|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6 occurrences of 6 keywords
|
|
|
|
|
Results
Found 32 publication records. Showing 32 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel K. de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato |
Sparse Sums of Positive Semidefinite Matrices |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau |
On Disjoint Common Bases in Two Matroids. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Nicholas J. A. Harvey |
Learning submodular functions. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi |
A general framework for graph sparsification. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Nicholas J. A. Harvey |
Learning Submodular Functions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Wai Shing Fung, Nicholas J. A. Harvey |
Graph Sparsification by Edge-Connectivity and Random Spanning Trees |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michel X. Goemans, Nicholas J. A. Harvey, Kamal Jain, Mohit Singh |
A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey |
Algebraic Algorithms for Matching and Matroid Problems. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni |
Approximating submodular functions everywhere. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak |
Sketching and Streaming Entropy via Approximation Theory |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey |
Matroid intersection, pointer chasing, and Young's seminormal representation of Sn. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak |
Sketching and Streaming Entropy via Approximation Theory. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey |
An algebraic algorithm for weighted linear matroid intersection. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | John Dunagan, Nicholas J. A. Harvey |
Iteratively constructing preconditioners via the conjugate gradient method. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
preconditioning, conjugate gradient method |
| 1 | Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir |
Semi-matchings for bipartite graphs and load balancing. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey |
Algebraic Structures and Algorithms for Matching and Matroid Problems (Preliminary Version) |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman |
On the capacity of information networks. |
IEEE Transactions on Information Theory |
2006 |
DBLP DOI BibTeX RDF |
infomational dominance, k-pairs communication problems, multiple unicast sessions, capacity, network coding, multicommodity flow, sparsity |
| 1 | Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu |
Lower bounds for asymmetric communication channels and distributed source coding. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman |
On the capacity of information networks. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, David R. Karger, Sergey Yekhanin |
The complexity of matrix completion. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey |
Algebraic Structures and Algorithms for Matching and Matroid Problems. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, David R. Karger, Kazuo Murota |
Deterministic network coding by matrix completion. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, J. Ian Munro |
Deterministic SkipNet. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin C. Zatloukal, Nicholas J. A. Harvey |
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | John Dunagan, Nicholas J. A. Harvey, Michael B. Jones, Dejan Kostic, Marvin Theimer, Alec Wolman |
FUSE: Lightweight Guaranteed Distributed Failure Notification. |
OSDI |
2004 |
DBLP BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, Michael B. Jones, Marvin Theimer, Alec Wolman |
Efficient Recovery from Organizational Disconnects in SkipNet. |
IPTPS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir |
Semi-matchings for Bipartite Graphs and Load Balancing. |
WADS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, J. Ian Munro |
Brief announcement: deterministic skipnet. |
PODC |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #32 of 32 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")