P
Petar Maymounkov
Researcher at Massachusetts Institute of Technology
Publications - 17
Citations - 4019
Petar Maymounkov is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Graph (abstract data type) & Solver. The author has an hindex of 9, co-authored 17 publications receiving 3756 citations. Previous affiliations of Petar Maymounkov include New York University & Vassar College.
Papers
More filters
Book ChapterDOI
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Petar Maymounkov,David Mazières +1 more
TL;DR: In this paper, the authors describe a peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment, which routes queries and locates nodes using a novel XOR-based metric topology.
A peer-to-peer information system based on the XOR metric
TL;DR: A peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment is described using a novel XOR-based metric topology that simplifies the algorithm and facilitates the proof.
Journal ArticleDOI
Blendenpik: Supercharging LAPACK's Least-Squares Solver
TL;DR: A least-squares solver for dense highly overdetermined systems that achieves residuals similar to those of direct QR factorization- based solvers, outperforms lapack by large factors, and scales significantly better than any QR-based solver.
Book ChapterDOI
Rateless Codes and Big Downloads
Petar Maymounkov,David Mazières +1 more
TL;DR: When nodes leave the network in the middle of uploads, the algorithm minimizes the duplicate information shared by nodes with truncated downloads, so any two peers with partial knowledge of a given file can almost always fully benefit from each other's knowledge.
Proceedings ArticleDOI
Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance
TL;DR: In this article, it was shown that a simple modification of the protocol gives an algorithm that solves the information dissemination problem in at most O(D + polylog (n)) rounds in a network of diameter D, with no dependence on the conductance.