| 2013 | ||
|---|---|---|
| i12 | Amit Chakrabarti, Graham Cormode, Navin Goyal, Justin Thaler: Annotations for Sparse Data Streams. CoRR abs/1304.3816 (2013) | |
| 2012 | ||
| j7 | Shipra Agrawal, Navin Goyal: Analysis of Thompson Sampling for the Multi-armed Bandit Problem. Journal of Machine Learning Research - Proceedings Track 23: 39.1-39.26 (2012) | |
| c15 | Navin Goyal, Luis Rademacher: Lower Bounds for the Average and Smoothed Number of Pareto Optima. FSTTCS 2012: 58-69 | |
| i11 | Shipra Agrawal, Navin Goyal: Thompson Sampling for Contextual Bandits with Linear Payoffs. CoRR abs/1209.3352 (2012) | |
| i10 | Shipra Agrawal, Navin Goyal: Further Optimal Regret Bounds for Thompson Sampling. CoRR abs/1209.3353 (2012) | |
| i9 | ||
| 2011 | ||
| j6 | Navin Goyal, Neil Olver, F. Bruce Shepherd: Dynamic vs. Oblivious Routing in Network Design. Algorithmica 61(1): 161-173 (2011) | |
| i8 | ||
| i7 | Navin Goyal, Luis Rademacher: Lower Bounds for the Average and Smoothed Number of Pareto Optima. CoRR abs/1107.3876 (2011) | |
| i6 | Shipra Agrawal, Navin Goyal: Analysis of Thompson Sampling for the multi-armed bandit problem. CoRR abs/1111.1797 (2011) | |
| 2010 | ||
| j5 | Navin Goyal, Michael Saks: Rounds vs. Queries Tradeoff in Noisy Computation. Theory of Computing 6(1): 113-134 (2010) | |
| c14 | Nishanth Ulhas Nair, Navin Goyal, Nagasuma R. Chandra: Enhanced flux balance analysis to model metabolic networks. BCB 2010: 358-361 | |
| c13 | Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler: Deterministic Algorithms for the Lovász Local Lemma. SODA 2010: 992-1004 | |
| i5 | Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler: Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections. CoRR abs/1006.3030 (2010) | |
| 2009 | ||
| c12 | ||
| c11 | Navin Goyal, Neil Olver, F. Bruce Shepherd: Dynamic vs. Oblivious Routing in Network Design. ESA 2009: 277-288 | |
| c10 | Navin Goyal, Luis Rademacher, Santosh Vempala: Expanders via random spanning trees. SODA 2009: 576-585 | |
| i4 | ||
| i3 | Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler: Deterministic Algorithms for the Lovasz Local Lemma. CoRR abs/0908.0375 (2009) | |
| 2008 | ||
| j4 | Navin Goyal, Guy Kindler, Michael E. Saks: Lower Bounds for the Noisy Broadcast Problem. SIAM J. Comput. 37(6): 1806-1841 (2008) | |
| c9 | ||
| c8 | Navin Goyal, Yury Lifshits, Hinrich Schütze: Disorder inequality: a combinatorial approach to nearest neighbor search. WSDM 2008: 25-32 | |
| i2 | Navin Goyal, Luis Rademacher, Santosh Vempala: Expanders via Random Spanning Trees. CoRR abs/0807.1496 (2008) | |
| 2007 | ||
| j3 | Vicky Choi, Navin Goyal: An Algorithmic Approach to the Identification of Rigid Domains in Proteins. Algorithmica 48(4): 343-362 (2007) | |
| 2006 | ||
| j2 | Navin Goyal, Sachin Lodha, S. Muthukrishnan: The Graham-Knowlton Problem Revisited. Theory Comput. Syst. 39(3): 399-412 (2006) | |
| c7 | Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien: Lower bounds for circuits with MOD_m gates. FOCS 2006: 709-718 | |
| c6 | Vicky Choi, Navin Goyal: An Efficient Approximation Algorithm for Point Pattern Matching Under Noise. LATIN 2006: 298-310 | |
| 2005 | ||
| j1 | Navin Goyal, Michael E. Saks: A parallel search game. Random Struct. Algorithms 27(2): 227-234 (2005) | |
| c5 | Navin Goyal, Guy Kindler, Michael E. Saks: Lower Bounds for the Noisy Broadcast Problem. FOCS 2005: 40-52 | |
| c4 | ||
| i1 | Vicky Choi, Navin Goyal: An Efficient Approximation Algorithm for Point Pattern Matching Under Noise. CoRR abs/cs/0506019 (2005) | |
| 2004 | ||
| c3 | Vicky Choi, Navin Goyal: A Combinatorial Shape Matching Algorithm for Rigid Protein Docking. CPM 2004: 285-296 | |
| 2003 | ||
| c2 | Navin Goyal, Michael E. Saks, Srinivasan Venkatesh: Optimal Separation of EROW and CROWPRAMs. IEEE Conference on Computational Complexity 2003: 93- | |
| c1 | Samrat Ganguly, B. R. Badrinath, Navin Goyal: Optimal Bandwidth Reservation Schedule in Cellular Network. INFOCOM 2003 | |
Colors in the list of coauthors
Last update Mon May 20 07:34:43 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page