 | 2011 |
| 28 |  | Navin Goyal,
Neil Olver,
F. Bruce Shepherd:
Dynamic vs. Oblivious Routing in Network Design.
Algorithmica 61(1): 161-173 (2011) |
| 27 |  | Navin Goyal,
Manoj Gupta:
On Dynamic Optimality for Binary Search Trees
CoRR abs/1102.4523: (2011) |
| 26 |  | Navin Goyal,
Luis Rademacher:
Lower Bounds for the Average and Smoothed Number of Pareto Optima
CoRR abs/1107.3876: (2011) |
| 25 |  | Shipra Agrawal,
Navin Goyal:
Analysis of Thompson Sampling for the multi-armed bandit problem
CoRR abs/1111.1797: (2011) |
| 2010 |
| 24 |  | Nishanth Ulhas Nair,
Navin Goyal,
Nagasuma R. Chandra:
Enhanced flux balance analysis to model metabolic networks.
BCB 2010: 358-361 |
| 23 |  | Karthekeyan Chandrasekaran,
Navin Goyal,
Bernhard Haeupler:
Deterministic Algorithms for the Lovász Local Lemma.
SODA 2010: 992-1004 |
| 22 |  | Karthekeyan Chandrasekaran,
Navin Goyal,
Bernhard Haeupler:
Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections
CoRR abs/1006.3030: (2010) |
| 21 |  | Navin Goyal,
Michael Saks:
Rounds vs. Queries Tradeoff in Noisy Computation.
Theory of Computing 6(1): 113-134 (2010) |
| 2009 |
| 20 |  | Luis Rademacher,
Navin Goyal:
Learning Convex Bodies is Hard.
COLT 2009 |
| 19 |  | Navin Goyal,
Neil Olver,
F. Bruce Shepherd:
Dynamic vs. Oblivious Routing in Network Design.
ESA 2009: 277-288 |
| 18 |  | Navin Goyal,
Luis Rademacher,
Santosh Vempala:
Expanders via random spanning trees.
SODA 2009: 576-585 |
| 17 |  | Navin Goyal,
Luis Rademacher:
Learning convex bodies is hard
CoRR abs/0904.1227: (2009) |
| 16 |  | Karthekeyan Chandrasekaran,
Navin Goyal,
Bernhard Haeupler:
Deterministic Algorithms for the Lovasz Local Lemma
CoRR abs/0908.0375: (2009) |
| 2008 |
| 15 |  | Navin Goyal,
Neil Olver,
F. Bruce Shepherd:
The vpn conjecture is true.
STOC 2008: 443-450 |
| 14 |  | Navin Goyal,
Yury Lifshits,
Hinrich Schütze:
Disorder inequality: a combinatorial approach to nearest neighbor search.
WSDM 2008: 25-32 |
| 13 |  | Navin Goyal,
Luis Rademacher,
Santosh Vempala:
Expanders via Random Spanning Trees
CoRR abs/0807.1496: (2008) |
| 12 |  | Navin Goyal,
Guy Kindler,
Michael E. Saks:
Lower Bounds for the Noisy Broadcast Problem.
SIAM J. Comput. 37(6): 1806-1841 (2008) |
| 2007 |
| 11 |  | Vicky Choi,
Navin Goyal:
An Algorithmic Approach to the Identification of Rigid Domains in Proteins.
Algorithmica 48(4): 343-362 (2007) |
| 2006 |
| 10 |  | Arkadev Chattopadhyay,
Navin Goyal,
Pavel Pudlák,
Denis Thérien:
Lower bounds for circuits with MOD_m gates.
FOCS 2006: 709-718 |
| 9 |  | Vicky Choi,
Navin Goyal:
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise.
LATIN 2006: 298-310 |
| 8 |  | Navin Goyal,
Sachin Lodha,
S. Muthukrishnan:
The Graham-Knowlton Problem Revisited.
Theory Comput. Syst. 39(3): 399-412 (2006) |
| 2005 |
| 7 |  | Navin Goyal,
Guy Kindler,
Michael E. Saks:
Lower Bounds for the Noisy Broadcast Problem.
FOCS 2005: 40-52 |
| 6 |  | Navin Goyal,
Michael E. Saks:
Rounds vs queries trade-off in noisy computation.
SODA 2005: 632-639 |
| 5 |  | Vicky Choi,
Navin Goyal:
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
CoRR abs/cs/0506019: (2005) |
| 4 |  | Navin Goyal,
Michael E. Saks:
A parallel search game.
Random Struct. Algorithms 27(2): 227-234 (2005) |
| 2004 |
| 3 |  | Vicky Choi,
Navin Goyal:
A Combinatorial Shape Matching Algorithm for Rigid Protein Docking.
CPM 2004: 285-296 |
| 2003 |
| 2 |  | Navin Goyal,
Michael E. Saks,
Srinivasan Venkatesh:
Optimal Separation of EROW and CROWPRAMs.
IEEE Conference on Computational Complexity 2003: 93- |
| 1 |  | Samrat Ganguly,
B. R. Badrinath,
Navin Goyal:
Optimal Bandwidth Reservation Schedule in Cellular Network.
INFOCOM 2003 |