default search action
Ashish Rastogi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j4]Sujeet Kumar Sharma, Avinash Gaur
, Venkataramanaiah Saddikuti, Ashish Rastogi:
Structural equation model (SEM)-neural network (NN) model for predicting quality determinants of e-learning management systems. Behav. Inf. Technol. 36(10): 1053-1066 (2017) - 2012
- [c8]Yun Kuen Cheung, Richard Cole, Ashish Rastogi:
Tatonnement in ongoing markets of complementary goods. EC 2012: 337-354 - [i5]Yun Kuen Cheung, Richard Cole, Ashish Rastogi:
Tatonnement in Ongoing Markets of Complementary Goods. CoRR abs/1211.2268 (2012) - 2011
- [j3]Cyril Allauzen, Mehryar Mohri, Ashish Rastogi:
General Algorithms for Testing the Ambiguity of Finite Automata and the Double-Tape Ambiguity of Finite-State Transducers. Int. J. Found. Comput. Sci. 22(4): 883-904 (2011) - 2010
- [i4]Richard Cole, Lisa Fleischer, Ashish Rastogi:
Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses. CoRR abs/1012.2124 (2010)
2000 – 2009
- 2009
- [c7]Adam Isaac Juda, S. Muthukrishnan, Ashish Rastogi:
Pricing guidance in ad sale negotiations: the PrintAds example. KDD Workshop on Data Mining and Audience Intelligence for Advertising 2009: 61-68 - [i3]Corinna Cortes, Mehryar Mohri, Dmitry Pechyony, Ashish Rastogi:
Stability Analysis and Learning Bounds for Transductive Regression Algorithms. CoRR abs/0904.0814 (2009) - 2008
- [b1]Ashish Rastogi:
Theory and Algorithms for Modern Machine Learning Problems and an Analysis of Markets. New York University, USA, 2008 - [j2]Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Michael Riley:
On the Computation of the Relative Entropy of Probabilistic Automata. Int. J. Found. Comput. Sci. 19(1): 219-242 (2008) - [c6]Cyril Allauzen, Mehryar Mohri, Ashish Rastogi:
General Algorithms for Testing the Ambiguity of Finite Automata. Developments in Language Theory 2008: 108-120 - [c5]Corinna Cortes, Mehryar Mohri, Dmitry Pechyony, Ashish Rastogi:
Stability of transductive regression algorithms. ICML 2008: 176-183 - [i2]Cyril Allauzen, Mehryar Mohri, Ashish Rastogi:
General Algorithms for Testing the Ambiguity of Finite Automata. CoRR abs/0802.3254 (2008) - 2007
- [j1]Corinna Cortes, Mehryar Mohri, Ashish Rastogi:
LP Distance and Equivalence of Probabilistic Automata. Int. J. Found. Comput. Sci. 18(4): 761-779 (2007) - [c4]Corinna Cortes, Mehryar Mohri, Ashish Rastogi:
Magnitude-preserving ranking algorithms. ICML 2007: 169-176 - [c3]Corinna Cortes, Mehryar Mohri, Ashish Rastogi:
An Alternative Ranking Problem for Search Engines. WEA 2007: 1-22 - [i1]Ashish Rastogi, Richard Cole:
Indivisible Markets with Good Approximate EquilibriumPrices. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c2]Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Michael Riley:
Efficient Computation of the Relative Entropy of Probabilistic Automata. LATIN 2006: 323-336 - [c1]Corinna Cortes, Mehryar Mohri, Ashish Rastogi:
On the Computation of Some Standard Distances Between Probabilistic Automata. CIAA 2006: 137-149
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: