| 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 | 4897 | 2002 |
| Blendenpik: Supercharging LAPACK's least-squares solver H Avron, P Maymounkov, S Toledo SIAM Journal on Scientific Computing 32 (3), 1217-1236, 2010 | 312 | 2010 |
| Online codes P Maymounkov Technical report, New York University, 2002 | 310 | 2002 |
| Rateless codes and big downloads P Maymounkov, D Mazieres International workshop on peer-to-peer systems, 247-255, 2003 | 217 | 2003 |
| Methods for efficient network coding P Maymounkov, NJA Harvey, DS Lun Proc. 44th Annual Allerton Conference on Communication, Control, and …, 2006 | 175 | 2006 |
| 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 | 91 | 2012 |
| Greedy embeddings, trees, and euclidean vs. lobachevsky geometry P Maymounkov Technical Report, 2006 | 26 | 2006 |
| Electric routing and concurrent flow cutting J Kelner, P Maymounkov Theoretical computer science 412 (32), 4123-4135, 2011 | 22 | 2011 |
| Greedy embeddings, trees, and Euclidean vs P Maymounkov Lobachevsky geometry (manuscript, 2006), 2006 | 11 | 2006 |
| 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 | 10 | 2017 |
| 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 | 9 | 2008 |
| Koji: Automating pipelines with mixed-semantics data sources P Maymounkov arXiv preprint arXiv:1901.01908, 2018 | 7 | 2018 |
| Perpetual codes: cache-friendly coding P Maymounkov Unpublished draft, retieved 2nd of September, 2011 | 5 | 2011 |
| Divergence-proving Techniques for Best Fit Bin Packing and Random Fit P Maymounkov PhD thesis, BA Thesis, Harvard College, Cambridge, MA, 2001 | 1 | 2001 |
| Dynamics of spectral algorithms for distributed routing PPB Maymounkov Massachusetts Institute of Technology, 2012 | | 2012 |
| 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 | | 2011 |
| 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 |
| On Radhakrishnan’s Proof of PCP Gap Amplification P Maymounkov | | |
| The Menu of the Method P Maymounkov | | |
Haim AvronAssociate Professor, Tel Aviv Universitytauex.tau.ac.il의 이메일 확인됨
