Petar Maymounkov
Petar Maymounkov
The Go Circuit Project
Verified email at maymounkov.org - Homepage
Title
Cited by
Cited by
Year
Kademlia: A peer-to-peer information system based on the xor metric
P Maymounkov, D Mazieres
International Workshop on Peer-to-Peer Systems, 53-65, 2002
39742002
Online codes
P Maymounkov
Technical report, New York University, 2002
2802002
Rateless codes and big downloads
P Maymounkov, D Mazieres
International workshop on peer-to-peer systems, 247-255, 2003
2052003
Blendenpik: Supercharging LAPACK's least-squares solver
H Avron, P Maymounkov, S Toledo
SIAM Journal on Scientific Computing 32 (3), 1217-1236, 2010
1982010
Methods for efficient network coding
P Maymounkov, NJA Harvey, DS Lun
Proc. 44th Annual Allerton Conference on Communication, Control, and …, 2006
1582006
Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance
K Censor-Hillel, B Haeupler, J Kelner, P Maymounkov
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
742012
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
O Feinerman, B Haeupler, A Korman
Distributed Computing 30 (5), 339-355, 2017
362017
Greedy embeddings, trees, and euclidean vs. lobachevsky geometry
P Maymounkov
Technical Report, 2006
232006
Electric routing and concurrent flow cutting
J Kelner, P Maymounkov
Theoretical Computer Science 412 (32), 4123-4135, 2011
172011
Greedy embeddings, trees, and Euclidean vs
P Maymounkov
Lobachevsky geometry (manuscript, 2006), 2006
112006
Routing with probabilistic delay guarantees in wireless ad-hoc networks
M Brand, P Maymounkov, AF Molisch
IEEE GLOBECOM 2008-2008 IEEE Global Telecommunications Conference, 1-6, 2008
92008
Method for routing packets in wireless ad-hoc networks with probabilistic delay guarantees
M Brand, P Maymounkov, AF Molisch
US Patent 8,040,810, 2011
82011
Rumor spreading with no dependence on conductance
K Censor-Hillel, B Haeupler, J Kelner, P Maymounkov
SIAM Journal on Computing 46 (1), 58-79, 2017
72017
Perpetual codes: cache-friendly coding
P Maymounkov
Unpublished draft, retieved 2nd of September, 2011
42011
Koji: Automating pipelines with mixed-semantics data sources
P Maymounkov
arXiv preprint arXiv:1901.01908, 2018
12018
Divergence-proving Techniques for Best Fit Bin Packing and Random Fit
P Maymounkov
PhD thesis, BA Thesis, Harvard College, Cambridge, MA, 2001
12001
Dynamics of spectral algorithms for distributed routing
PPB Maymounkov
Massachusetts Institute of Technology, 2012
2012
Blendenpik: Supercharging LAPACK's Least-Squares Solver
PB Maymounkov, S Toledo, H Avron
Society for Industrial and Applied Mathematics, 2010
2010
Linear-time Learning with Noise
P Kheradpour, P Maymounkov
2005
Speed-Ups and Fault-Tolerant Data Sharing over Unreliable Networks
V Vankov, P Maymounkov
2001
The system can't perform the operation now. Try again later.
Articles 1–20