• Home
  • Petar Maymounkov
Petar Maymounkov

Petar Maymounkov
Maymounkov Math

PhD

About

24
Publications
6,577
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
3,349
Citations
Citations since 2017
1 Research Item
797 Citations
2017201820192020202120222023020406080100120140
2017201820192020202120222023020406080100120140
2017201820192020202120222023020406080100120140
2017201820192020202120222023020406080100120140
Additional affiliations
September 2005 - March 2012
Massachusetts Institute of Technology
Position
  • PhD Student

Publications

Publications (24)
Article
In the past few decades distributed systems have evolved from man-made machines to organically changing social, economic and protein networks. This transition has been overwhelming in many ways at once. Dynamic, heterogeneous, irregular topologies have taken the place of static, homogeneous, regular ones. Asynchronous, ad hoc peer-to-peer networks...
Article
This work discusses my attempts to extend Kenyon and Mitzenmacher's technique for proving diveregnce of the online approximation algorithm Best Fit to Random Fit { another approximation algorithm for the well-known NP-hard problem of bin packing. In specic, the paper goes over Kenyon and Mitzenmacher's recent advances on divergence of the waste of...
Article
Full-text available
In this paper, we study the question of how efficiently a collection of interconnected nodes can perform a global computation in the GOSSIP model of communication. In this model, nodes do not know the global topology of the network, and they may only initiate contact with a single neighbor in each round. This model contrasts with the much less rest...
Article
We investigate an oblivious routing scheme, amenable to distributed computation and resilient to graph changes, based on electrical flow. Our main technical contribution is a new rounding method which we use to obtain a bound on the operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric...
Article
Full-text available
Several innovative random-sampling and random-mixing techniques for solving problems in linear algebra have been proposed in the last decade, but they have not yet made a significant impact on numerical linear algebra. We show that by using a high-quality implementation of one of these techniques, we obtain a solver that performs extremely well in...
Conference Paper
We investigate an oblivious routing scheme amenable to distributed computation and resilient to graph changes, based on electrical flow. Our main technical contribution is a new rounding method which we use to obtain a bound on the L 1→L 1 operator norm of the inverse graph Laplacian.
Conference Paper
Full-text available
In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify such routes based on average channel state information (CSI) only, since this information can be distributed more easily over the network. Such cases allow probabilistic QoS...
Article
Full-text available
Random linear network coding is a multicast communication scheme in which all participating nodes send out coded packets formed from random linear combinations of packets received so far. This scheme is capacity-achieving for single
Conference Paper
Full-text available
This paper presents a novel algorithm for downloading big files from multiple sources in peer-to-peer networks. The algorithm is simple, but offers several compelling properties. It ensures low handshaking overhead between peers that download files (or parts of a files) from each other. It is computationally efficient, with cost linear in the amoun...
Article
Full-text available
We report the first spatially resolved observations of the spectroscopic binaries λ Vir and WR 140, including the debut of aperture-synthesis imaging with the upgraded three-telescope IOTA interferometer. Using IONIC-3, a new integrated optics beam combiner capable of a precise closure phase measurement, short observations were sufficient to extrac...
Article
Full-text available
We report the first spatially-resolved observations of the spectroscopic binaries lambda Vir and WR 140, which includes the debut of aperture-synthesis imaging with the upgraded three-telescope IOTA interferometer. Using IONIC-3, a new integrated optics beam combiner capable of precise closure phase measurement, short observations were sufficient t...
Article
Full-text available
We introduce online codes – a class of near-optimal codes for a very general loss channel which we call the free channel. Online codes are linear encoding/decoding time codes, based on sparse bipartite graphs, similar to Tornado codes, with a couple of novel properties: local encodability and rateless-ness. Local encodability is the property that e...
Conference Paper
Full-text available
We describe a peer-to-peer system which has provable consistency and performance in a fault-prone environment. Our system routes queries and locates nodes using a novel XOR-based metric topology that simplifies the algorithm and facilitates our proof. The topology has the property that every message exchanged conveys or reinforces useful contact in...
Article
Full-text available
In this paper we propose a model for evaluating distributed data sharing schemes like Napster and others. We show what the infomration theoretical limits of data propagation speed are, and compare to Napster, Gnutella and FreeNet's performances. We give an algo-rithm which trades off communication costs (speed) for local computational costs, and pr...
Article
The third telescope project to enable phase-closure observations at the IOTA interferometer is well underway, and is anticipated to be completed later this year. For this project, we present the main technical improvements which we have already made or expect to make, including a new VxWorks control system, improved star acquisition cameras, improv...
Conference Paper
The third telescope project to enable phase-closure observations at the IOTA interferometer is well underway, and is anticipated to be completed later this year. For this project, we present the main technical improvements which we have already made or expect to make, including a new VxWorks control system, improved star acquisition cameras, improv...
Article
The third telescope project to enable phase-closure observations at the IOTA interferometer is well underway, and is anticipated to be completed later this year. For this project, we present the main technical improvements which we have already made or expect to make, including a new VxWorks control system, improved star acquisition cameras, improv...
Article
Full-text available
We report the first spatially resolved observations of the spectroscopic binaries l Vir and WR 140, including the debut of aperture-synthesis imaging with the upgraded three-telescope IOTA interferometer. Using IONIC-3, a new integrated optics beam combiner capable of a precise closure phase measurement, short observations were sufficient to extrac...
Article
Full-text available
A greedy embedding of an unweighted undirected graph G = (V;E) into a metric space (X;‰) is a function f : V ! X such that for every source-sink pair of difierent vertices s;t 2 V it is the case that s has a neighbor v in G with ‰(f(v);f(t)) < ‰(f(s);f(t)). Finding greedy embeddings of connectivity graphs helps to build distributed routing schemes...
Article
Full-text available
This exposition gives a simplied version of Radhakrishnan's construction of a PCP gap amplication transform (4), which is itself a simplied version of Dinur's construc- tion (3). The preprocessing and alphabet reduction transforms are left unchanged, and are thus not addressed here. Briey, we simplify the analysis by pretending that all vertices ha...
Article
Full-text available
This writing is my personal concise and fairly incomplete collection of daily-used probabilistic and other techniques. In essence, a lot of it consists of literal copies of frequently read sections of "The Probabilis- tic Method" by Spencer and Alon together with italicized comments and clarifications by myself. In addition, I have included excerpt...

Network

Cited By

Projects

Project (1)