The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Navin Goyal" ( http://dblp.L3S.de/Authors/Navin_Goyal )

  Author page on DBLP  Author page in RDF  Community of Navin Goyal in ASPL-2

Publication years (Num. hits)
2003-2008 (15) 2009-2011 (13)
Publication types (Num. hits)
article(14) inproceedings(14)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 8 occurrences of 8 keywords

Results
Found 28 publication records. Showing 28 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Navin Goyal, Neil Olver, F. Bruce Shepherd Dynamic vs. Oblivious Routing in Network Design. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Navin Goyal, Manoj Gupta 0002 On Dynamic Optimality for Binary Search Trees Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Navin Goyal, Luis Rademacher Lower Bounds for the Average and Smoothed Number of Pareto Optima Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Shipra Agrawal, Navin Goyal Analysis of Thompson Sampling for the multi-armed bandit problem Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Navin Goyal, Michael Saks Rounds vs. Queries Tradeoff in Noisy Computation. Search on Bibsonomy Theory of Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler Deterministic Algorithms for the Lovász Local Lemma. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  BibTeX  RDF
1Nishanth Ulhas Nair, Navin Goyal, Nagasuma R. Chandra Enhanced flux balance analysis to model metabolic networks. Search on Bibsonomy BCB The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler Deterministic Algorithms for the Lovasz Local Lemma Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Navin Goyal, Luis Rademacher Learning convex bodies is hard Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Navin Goyal, Neil Olver, F. Bruce Shepherd Dynamic vs. Oblivious Routing in Network Design. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Navin Goyal, Luis Rademacher, Santosh Vempala Expanders via random spanning trees. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Luis Rademacher, Navin Goyal Learning Convex Bodies is Hard. Search on Bibsonomy COLT The full citation details ... 2009 DBLP  BibTeX  RDF
1Navin Goyal, Luis Rademacher, Santosh Vempala Expanders via Random Spanning Trees Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Navin Goyal, Guy Kindler, Michael E. Saks Lower Bounds for the Noisy Broadcast Problem. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Navin Goyal, Yury Lifshits, Hinrich Schütze Disorder inequality: a combinatorial approach to nearest neighbor search. Search on Bibsonomy WSDM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF disorder constant, disorder dimension, disorder inequality, randomized algorithms, random walk, similarity search, nearest neighbor search, proximity search
1Navin Goyal, Neil Olver, F. Bruce Shepherd The vpn conjecture is true. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF network design, robust optimization, oblivious routing
1Vicky Choi, Navin Goyal An Algorithmic Approach to the Identification of Rigid Domains in Proteins. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Navin Goyal, Sachin Lodha, S. Muthukrishnan The Graham-Knowlton Problem Revisited. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Vicky Choi, Navin Goyal An Efficient Approximation Algorithm for Point Pattern Matching Under Noise. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien Lower bounds for circuits with MOD_m gates. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Navin Goyal, Michael E. Saks A parallel search game. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Vicky Choi, Navin Goyal An Efficient Approximation Algorithm for Point Pattern Matching Under Noise Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Navin Goyal, Michael E. Saks Rounds vs queries trade-off in noisy computation. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Navin Goyal, Guy Kindler, Michael E. Saks Lower Bounds for the Noisy Broadcast Problem. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Vicky Choi, Navin Goyal A Combinatorial Shape Matching Algorithm for Rigid Protein Docking. Search on Bibsonomy CPM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Samrat Ganguly, B. R. Badrinath, Navin Goyal Optimal Bandwidth Reservation Schedule in Cellular Network. Search on Bibsonomy INFOCOM The full citation details ... 2003 DBLP  BibTeX  RDF
1Navin Goyal, Michael E. Saks, Srinivasan Venkatesh Optimal Separation of EROW and CROWPRAMs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #28 of 28 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.