2009 |
17 | EE | Navin Goyal,
Luis Rademacher,
Santosh Vempala:
Expanders via random spanning trees.
SODA 2009: 576-585 |
16 | EE | Navin Goyal,
Luis Rademacher:
Learning convex bodies is hard
CoRR abs/0904.1227: (2009) |
2008 |
15 | EE | Navin Goyal,
Neil Olver,
F. Bruce Shepherd:
The vpn conjecture is true.
STOC 2008: 443-450 |
14 | EE | Navin Goyal,
Yury Lifshits,
Hinrich Schütze:
Disorder inequality: a combinatorial approach to nearest neighbor search.
WSDM 2008: 25-32 |
13 | EE | Navin Goyal,
Luis Rademacher,
Santosh Vempala:
Expanders via Random Spanning Trees
CoRR abs/0807.1496: (2008) |
12 | EE | Navin Goyal,
Guy Kindler,
Michael E. Saks:
Lower Bounds for the Noisy Broadcast Problem.
SIAM J. Comput. 37(6): 1806-1841 (2008) |
2007 |
11 | EE | Vicky Choi,
Navin Goyal:
An Algorithmic Approach to the Identification of Rigid Domains in Proteins.
Algorithmica 48(4): 343-362 (2007) |
2006 |
10 | EE | Arkadev Chattopadhyay,
Navin Goyal,
Pavel Pudlák,
Denis Thérien:
Lower bounds for circuits with MOD_m gates.
FOCS 2006: 709-718 |
9 | EE | Vicky Choi,
Navin Goyal:
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise.
LATIN 2006: 298-310 |
8 | EE | Navin Goyal,
Sachin Lodha,
S. Muthukrishnan:
The Graham-Knowlton Problem Revisited.
Theory Comput. Syst. 39(3): 399-412 (2006) |
2005 |
7 | EE | Navin Goyal,
Guy Kindler,
Michael E. Saks:
Lower Bounds for the Noisy Broadcast Problem.
FOCS 2005: 40-52 |
6 | EE | Navin Goyal,
Michael E. Saks:
Rounds vs queries trade-off in noisy computation.
SODA 2005: 632-639 |
5 | EE | Vicky Choi,
Navin Goyal:
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
CoRR abs/cs/0506019: (2005) |
4 | EE | Navin Goyal,
Michael E. Saks:
A parallel search game.
Random Struct. Algorithms 27(2): 227-234 (2005) |
2004 |
3 | EE | Vicky Choi,
Navin Goyal:
A Combinatorial Shape Matching Algorithm for Rigid Protein Docking.
CPM 2004: 285-296 |
2003 |
2 | EE | Navin Goyal,
Michael E. Saks,
Srinivasan Venkatesh:
Optimal Separation of EROW and CROWPRAMs.
IEEE Conference on Computational Complexity 2003: 93- |
1 | EE | Samrat Ganguly,
B. R. Badrinath,
Navin Goyal:
Optimal Bandwidth Reservation Schedule in Cellular Network.
INFOCOM 2003 |