2009 |
23 | EE | Michel X. Goemans,
Nicholas J. A. Harvey,
Satoru Iwata,
Vahab S. Mirrokni:
Approximating submodular functions everywhere.
SODA 2009: 535-544 |
2008 |
22 | EE | Nicholas J. A. Harvey,
Jelani Nelson,
Krzysztof Onak:
Sketching and Streaming Entropy via Approximation Theory.
FOCS 2008: 489-498 |
21 | EE | 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 |
20 | EE | Nicholas J. A. Harvey:
Matroid intersection, pointer chasing, and Young's seminormal representation of Sn.
SODA 2008: 542-549 |
19 | EE | Nicholas J. A. Harvey,
Jelani Nelson,
Krzysztof Onak:
Sketching and Streaming Entropy via Approximation Theory
CoRR abs/0804.4138: (2008) |
2007 |
18 | EE | 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 |
17 | EE | Nicholas J. A. Harvey:
An algebraic algorithm for weighted linear matroid intersection.
SODA 2007: 444-453 |
16 | EE | John Dunagan,
Nicholas J. A. Harvey:
Iteratively constructing preconditioners via the conjugate gradient method.
STOC 2007: 207-216 |
2006 |
15 | EE | Nicholas J. A. Harvey:
Algebraic Structures and Algorithms for Matching and Matroid Problems.
FOCS 2006: 531-542 |
14 | EE | Nicholas J. A. Harvey,
David R. Karger,
Sergey Yekhanin:
The complexity of matrix completion.
SODA 2006: 1103-1111 |
13 | EE | Micah Adler,
Nicholas J. A. Harvey,
Kamal Jain,
Robert D. Kleinberg,
April Rasala Lehman:
On the capacity of information networks.
SODA 2006: 241-250 |
12 | EE | 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 |
11 | EE | Nicholas J. A. Harvey:
Algebraic Structures and Algorithms for Matching and Matroid Problems (Preliminary Version)
CoRR abs/cs/0601026: (2006) |
10 | EE | 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) |
9 | EE | 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) |
2005 |
8 | EE | Nicholas J. A. Harvey,
David R. Karger,
Kazuo Murota:
Deterministic network coding by matrix completion.
SODA 2005: 489-498 |
2004 |
7 | EE | 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 |
6 | EE | Kevin C. Zatloukal,
Nicholas J. A. Harvey:
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time.
SODA 2004: 308-317 |
5 | EE | Nicholas J. A. Harvey,
J. Ian Munro:
Deterministic SkipNet.
Inf. Process. Lett. 90(4): 205-208 (2004) |
2003 |
4 | EE | Nicholas J. A. Harvey,
Michael B. Jones,
Marvin Theimer,
Alec Wolman:
Efficient Recovery from Organizational Disconnects in SkipNet.
IPTPS 2003: 183-196 |
3 | EE | Nicholas J. A. Harvey,
J. Ian Munro:
Brief announcement: deterministic skipnet.
PODC 2003: 152 |
2 | EE | 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 |
1 | EE | 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 |