Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Navin
Last name:	Goyal
DBLP:	20/6275
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 19 of 19  

Select a publication
Show	Title	Venue	Rating	Date
	Navin Goyal, Neil Olver, F. Bruce Shepherd. Dynamic vs. Oblivious Routing in Network Design.	Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings 2009	(0)	2009
	Navin Goyal, Luis Rademacher, Santosh Vempala. Expanders via random spanning trees.	Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009 2009	(0)	2009
	Navin Goyal, Luis Rademacher. Learning convex bodies is hard	CoRR 2009, Volume 0	(0)	2009
	Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler. Deterministic Algorithms for the Lovasz Local Lemma	CoRR 2009, Volume 0	(0)	2009
	Navin Goyal, Neil Olver, F. Bruce Shepherd. The vpn conjecture is true.	Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008 2008	(0)	2008
	Navin Goyal, Yury Lifshits, Hinrich Schütze. Disorder inequality: a combinatorial approach to nearest neighbor search.	Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, February 11-12, 2008 2008	(0)	2008
	Navin Goyal, Luis Rademacher, Santosh Vempala. Expanders via Random Spanning Trees	CoRR 2008, Volume 0	(0)	2008
	Navin Goyal, Guy Kindler, Michael E. Saks. Lower Bounds for the Noisy Broadcast Problem.	SIAM J. Comput. 2007, Volume 37	(0)	2008
	Vicky Choi, Navin Goyal. An Algorithmic Approach to the Identification of Rigid Domains in Proteins.	Algorithmica 2007, Volume 48	(0)	2007
	Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien. Lower bounds for circuits with MOD_m gates.	47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings 2006	(0)	2006
	Vicky Choi, Navin Goyal. An Efficient Approximation Algorithm for Point Pattern Matching Under Noise.	LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings 2006	(0)	2006
	Navin Goyal, Sachin Lodha, S. Muthukrishnan. The Graham-Knowlton Problem Revisited.	Theory Comput. Syst. 2006, Volume 39	(0)	2006
	Navin Goyal, Guy Kindler, Michael E. Saks. Lower Bounds for the Noisy Broadcast Problem.	46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings 2005	(0)	2005
	Navin Goyal, Michael E. Saks. Rounds vs queries trade-off in noisy computation.	Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005 2005	(0)	2005
	Vicky Choi, Navin Goyal. An Efficient Approximation Algorithm for Point Pattern Matching Under Noise	CoRR 2005, Volume 0	(0)	2005
	Navin Goyal, Michael E. Saks. A parallel search game.	Random Struct. Algorithms 2005, Volume 27	(0)	2005
	Vicky Choi, Navin Goyal. A Combinatorial Shape Matching Algorithm for Rigid Protein Docking.	Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings 2004	(0)	2004
	Navin Goyal, Michael E. Saks, Srinivasan Venkatesh. Optimal Separation of EROW and CROWPRAMs.	18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark 2003	(0)	2003
	Samrat Ganguly, B. R. Badrinath, Navin Goyal. Optimal Bandwidth Reservation Schedule in Cellular Network.	INFOCOM 2003	(0)	2003

Your query returned 19 matches in the database.