The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Navin Goyal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Navin Goyal, Michael E. Saks, Srinivasan Venkatesh
    Optimal Separation of EROW and CROWPRAMs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:93-0 [Conf]
  2. Vicky Choi, Navin Goyal
    A Combinatorial Shape Matching Algorithm for Rigid Protein Docking. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:285-296 [Conf]
  3. Navin Goyal, Guy Kindler, Michael E. Saks
    Lower Bounds for the Noisy Broadcast Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:40-52 [Conf]
  4. Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien
    Lower bounds for circuits with MOD_m gates. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:709-718 [Conf]
  5. Samrat Ganguly, B. R. Badrinath, Navin Goyal
    Optimal Bandwidth Reservation Schedule in Cellular Network. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  6. Vicky Choi, Navin Goyal
    An Efficient Approximation Algorithm for Point Pattern Matching Under Noise. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:298-310 [Conf]
  7. Navin Goyal, Michael E. Saks
    Rounds vs queries trade-off in noisy computation. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:632-639 [Conf]
  8. Navin Goyal, Sachin Lodha, S. Muthukrishnan
    The Graham-Knowlton Problem Revisited. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:399-412 [Journal]
  9. Navin Goyal, Michael E. Saks
    A parallel search game. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:27, n:2, pp:227-234 [Journal]
  10. Vicky Choi, Navin Goyal
    An Algorithmic Approach to the Identification of Rigid Domains in Proteins. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:4, pp:343-362 [Journal]

  11. Dynamic vs. Oblivious Routing in Network Design. [Citation Graph (, )][DBLP]


  12. Expanders via random spanning trees. [Citation Graph (, )][DBLP]


  13. Deterministic Algorithms for the Lovász Local Lemma. [Citation Graph (, )][DBLP]


  14. The vpn conjecture is true. [Citation Graph (, )][DBLP]


  15. Disorder inequality: a combinatorial approach to nearest neighbor search. [Citation Graph (, )][DBLP]


  16. An Efficient Approximation Algorithm for Point Pattern Matching Under Noise [Citation Graph (, )][DBLP]


  17. Expanders via Random Spanning Trees [Citation Graph (, )][DBLP]


  18. Learning convex bodies is hard [Citation Graph (, )][DBLP]


  19. Deterministic Algorithms for the Lovasz Local Lemma [Citation Graph (, )][DBLP]


  20. Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002