Navin Goyal

	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

Coauthor Index

1	B. R. Badrinath (Badri Nath)	[1]
2	Karthekeyan Chandrasekaran	[16]
3	Arkadev Chattopadhyay	[10]
4	Vicky Choi	[3] [5] [9] [11]
5	Samrat Ganguly	[1]
6	Bernhard Haeupler	[16]
7	Guy Kindler	[7] [12]
8	Yury Lifshits	[14]
9	Sachin Lodha	[8]
10	S. Muthukrishnan (S. Muthu Muthukrishnan)	[8]
11	Neil Olver	[15] [19]
12	Pavel Pudlák	[10]
13	Luis Rademacher	[13] [17] [18]
14	Michael E. Saks	[2] [4] [6] [7] [12]
15	Hinrich Schütze	[14]
16	F. Bruce Shepherd	[15] [19]
17	Denis Thérien	[10]
18	Santosh Vempala	[13] [18]
19	Srinivasan Venkatesh	[2]

Colors in the list of coauthors