| 2012 | ||
|---|---|---|
| c21 | Maria-Florina Balcan, Nicholas J. A. Harvey: Learning Submodular Functions. ECML/PKDD (2) 2012: 846-849 | |
| 2011 | ||
| j6 | Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau: On Disjoint Common Bases in Two Matroids. SIAM J. Discrete Math. 25(4): 1792-1803 (2011) | |
| j5 | Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12-14): 1054-1065 (2011) | |
| c20 | Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi: A general framework for graph sparsification. STOC 2011: 71-80 | |
| c19 | ||
| i6 | Marcel K. de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato: Sparse Sums of Positive Semidefinite Matrices. CoRR abs/1107.0088 (2011) | |
| 2010 | ||
| i5 | Wai Shing Fung, Nicholas J. A. Harvey: Graph Sparsification by Edge-Connectivity and Random Spanning Trees. CoRR abs/1005.0265 (2010) | |
| i4 | Maria-Florina Balcan, Nicholas J. A. Harvey: Learning Submodular Functions. CoRR abs/1008.2159 (2010) | |
| 2009 | ||
| j4 | Nicholas J. A. Harvey: Algebraic Algorithms for Matching and Matroid Problems. SIAM J. Comput. 39(2): 679-702 (2009) | |
| c18 | Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni: Approximating submodular functions everywhere. SODA 2009: 535-544 | |
| i3 | Michel X. Goemans, Nicholas J. A. Harvey, Kamal Jain, Mohit Singh: A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem. CoRR abs/0909.0941 (2009) | |
| 2008 | ||
| c17 | Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak: Sketching and Streaming Entropy via Approximation Theory. FOCS 2008: 489-498 | |
| c16 | Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno: On the Complexity of Reconfiguration Problems. ISAAC 2008: 28-39 | |
| c15 | Nicholas J. A. Harvey: Matroid intersection, pointer chasing, and Young's seminormal representation of Sn. SODA 2008: 542-549 | |
| i2 | Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak: Sketching and Streaming Entropy via Approximation Theory. CoRR abs/0804.4138 (2008) | |
| 2007 | ||
| c14 | 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. INFOCOM 2007: 697-705 | |
| c13 | Nicholas J. A. Harvey: An algebraic algorithm for weighted linear matroid intersection. SODA 2007: 444-453 | |
| c12 | John Dunagan, Nicholas J. A. Harvey: Iteratively constructing preconditioners via the conjugate gradient method. STOC 2007: 207-216 | |
| 2006 | ||
| j3 | Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir: Semi-matchings for bipartite graphs and load balancing. J. Algorithms 59(1): 53-78 (2006) | |
| j2 | Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman: On the capacity of information networks. IEEE Transactions on Information Theory 52(6): 2345-2364 (2006) | |
| c11 | Nicholas J. A. Harvey: Algebraic Structures and Algorithms for Matching and Matroid Problems. FOCS 2006: 531-542 | |
| c10 | Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman: On the capacity of information networks. SODA 2006: 241-250 | |
| c9 | Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu: Lower bounds for asymmetric communication channels and distributed source coding. SODA 2006: 251-260 | |
| c8 | Nicholas J. A. Harvey, David R. Karger, Sergey Yekhanin: The complexity of matrix completion. SODA 2006: 1103-1111 | |
| i1 | Nicholas J. A. Harvey: Algebraic Structures and Algorithms for Matching and Matroid Problems (Preliminary Version). CoRR abs/cs/0601026 (2006) | |
| 2005 | ||
| c7 | Nicholas J. A. Harvey, David R. Karger, Kazuo Murota: Deterministic network coding by matrix completion. SODA 2005: 489-498 | |
| 2004 | ||
| j1 | Nicholas J. A. Harvey, J. Ian Munro: Deterministic SkipNet. Inf. Process. Lett. 90(4): 205-208 (2004) | |
| c6 | John Dunagan, Nicholas J. A. Harvey, Michael B. Jones, Dejan Kostic, Marvin Theimer, Alec Wolman: FUSE: Lightweight Guaranteed Distributed Failure Notification. OSDI 2004: 151-166 | |
| c5 | Kevin C. Zatloukal, Nicholas J. A. Harvey: Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. SODA 2004: 308-317 | |
| 2003 | ||
| c4 | Nicholas J. A. Harvey, Michael B. Jones, Marvin Theimer, Alec Wolman: Efficient Recovery from Organizational Disconnects in SkipNet. IPTPS 2003: 183-196 | |
| c3 | ||
| c2 | Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman: SkipNet: A Scalable Overlay Network with Practical Locality Properties. USENIX Symposium on Internet Technologies and Systems 2003 | |
| c1 | Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir: Semi-matchings for Bipartite Graphs and Load Balancing. WADS 2003: 294-308 | |
Colors in the list of coauthors
Last update Mon May 20 22:56:27 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page