Papers by Petar Maymounkov
Graphs, flows, spectra and algorithms
-
- Keren Censor-Hillel, Bernhard Haeupler, Jonathan Kelner, Petar Maymounkov,
- Global Computation in a Poorly Connected World: Fast
Rumor Spreading with No Dependence on Conductance.
- To appear in STOC 2012.
-
- Jonathan Kelner and Petar Maymounkov,
- Electric
routing and concurrent flow cutting.
- In 20th
International Symposium on
Algorithms and Computation (ISAAC'09), 2009.
In Elsevier Journal of
Theoretical Computer Science.
Talk slides
-
- Matthew Brand, Petar Maymounkov and Andreas Molisch,
- Routing with probabilistic delay guarantees
in wireless ad-hoc networks.
- In IEEE GlobeCom
Wireless Communications Symposium, 2008
-
- Petar Maymounkov,
- Greedy Embeddings, Trees, and
Euclidean vs. Lobachevsky Geometry.
- Manuscript, 2006.
Talk slides
-
- Petar Maymounkov and David Mazières,
- Kademlia:
A Peer-to-peer Information System Based on the XOR Metric.
- In 1st International
Workshop on Peer-to-peer Systems (IPTPS'02), 2002.
Talk slides,
Wikipedia
Numerical algorithms
-
- Haim Avron, Petar Maymounkov and Sivan Toledo,
- Blendenpik: Supercharging LAPACK's least-squares
solver.
- To appear in SIAM Journal on
Scientific Computing, 2009.
Source code on Haim's page.
-
- Haim Avron, Petar Maymounkov and Sivan Toledo,
Engineering a random-sampling numerical linear algebra
algorithm.
- In SIAM Workshop on
Combinatorial Scientific Computing, 2009.
Talk slides on Haim's page.
Linear-time erasure coding
Complexity
Combinatorial optimization