David Peleg
Algorithmica · 1993–2010
A researcher in the Science corpus: 4 papers; trusts 2 researchers and is trusted by 3 researchers here, as inferred from the citation graph.
Whom David Peleg trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts David Peleg overall
Papers from David Peleg's perspective
Ordered by how strongly the researchers David Peleg trusts endorse each paper. Same corpus, a different order for every researcher.
- Communication Complexity
- An information statistics approach to data stream and communication complexity
- Approximation Algorithms
- Distributed Algorithms
- Constant-time distributed dominating set approximation (ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing)
- Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
- A personal communication
- The NP-Completeness Column: An Ongoing Guide
- Book Reviews: WordNet: An Electronic Lexical Database
- A and V
Their papers
- The Dense k -Subgraph Problem (2001) — 625 citations
- Distance labeling in graphs (2001) — 372 citations
- Distributed verification and hardness of distributed approximation (2010) — 362 citations
- Approximating bounded 0-1 integer linear programs (1993)