The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nicholas J. A. Harvey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nicholas J. A. Harvey
    Algebraic Structures and Algorithms for Matching and Matroid Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:531-542 [Conf]
  2. Nicholas J. A. Harvey, Michael B. Jones, Marvin Theimer, Alec Wolman
    Efficient Recovery from Organizational Disconnects in SkipNet. [Citation Graph (0, 0)][DBLP]
    IPTPS, 2003, pp:183-196 [Conf]
  3. John Dunagan, Nicholas J. A. Harvey, Michael B. Jones, Dejan Kostic, Marvin Theimer, Alec Wolman
    FUSE: Lightweight Guaranteed Distributed Failure Notification. [Citation Graph (0, 0)][DBLP]
    OSDI, 2004, pp:151-166 [Conf]
  4. Nicholas J. A. Harvey, J. Ian Munro
    Brief announcement: deterministic skipnet. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:152- [Conf]
  5. Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu
    Lower bounds for asymmetric communication channels and distributed source coding. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:251-260 [Conf]
  6. Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman
    On the capacity of information networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:241-250 [Conf]
  7. Nicholas J. A. Harvey, David R. Karger, Kazuo Murota
    Deterministic network coding by matrix completion. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:489-498 [Conf]
  8. Nicholas J. A. Harvey, David R. Karger, Sergey Yekhanin
    The complexity of matrix completion. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1103-1111 [Conf]
  9. Kevin C. Zatloukal, Nicholas J. A. Harvey
    Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:308-317 [Conf]
  10. Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman
    SkipNet: A Scalable Overlay Network with Practical Locality Properties. [Citation Graph (0, 0)][DBLP]
    USENIX Symposium on Internet Technologies and Systems, 2003, pp:- [Conf]
  11. Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
    Semi-matchings for Bipartite Graphs and Load Balancing. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:294-308 [Conf]
  12. Nicholas J. A. Harvey, J. Ian Munro
    Deterministic SkipNet. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:205-208 [Journal]
  13. Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
    Semi-matchings for bipartite graphs and load balancing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:59, n:1, pp:53-78 [Journal]
  14. Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman
    On the capacity of information networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2345-2364 [Journal]
  15. Nicholas J. A. Harvey, Mihai Patrascu, Yonggang Wen, Sergey Yekhanin, Vincent W. S. Chan
    Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:697-705 [Conf]
  16. Nicholas J. A. Harvey
    An algebraic algorithm for weighted linear matroid intersection. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:444-453 [Conf]
  17. John Dunagan, Nicholas J. A. Harvey
    Iteratively constructing preconditioners via the conjugate gradient method. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:207-216 [Conf]
  18. Nicholas J. A. Harvey
    Algebraic Structures and Algorithms for Matching and Matroid Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  19. Sketching and Streaming Entropy via Approximation Theory. [Citation Graph (, )][DBLP]


  20. On the Complexity of Reconfiguration Problems. [Citation Graph (, )][DBLP]


  21. Matroid intersection, pointer chasing, and Young's seminormal representation of Sn. [Citation Graph (, )][DBLP]


  22. Approximating submodular functions everywhere. [Citation Graph (, )][DBLP]


  23. Sketching and Streaming Entropy via Approximation Theory [Citation Graph (, )][DBLP]


  24. A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem [Citation Graph (, )][DBLP]


  25. Graph Sparsification by Edge-Connectivity and Random Spanning Trees [Citation Graph (, )][DBLP]


  26. Learning Submodular Functions [Citation Graph (, )][DBLP]


Search in 0.038secs, Finished in 0.040secs
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