Person: David Peleg

DBLP: Peleg:David

Facilitated 2 volumes:

Ed

Ed

Contributed to:

2015

2014

2012

2011

2010

2009

2006

2005

2003

2001

2000

1999

1998

1995

1992

1991

1990

1989

1988

1987

1986

1985

Wrote 28 papers:

ICALP-v2-2015-AvinLNP #network

Core Size and Densification in Preferential Attachment Networks (CA, ZL, YN, DP), pp. 492–503.

ICALP-v2-2014-AvinBLP #axiom #design #distributed #network

Distributed Computing on Core-Periphery Networks: Axiom-Based Design (CA, MB, ZL, DP), pp. 399–410.

ICALP-v2-2012-PelegRT #algorithm #distributed #network

Distributed Algorithms for Network Diameter and Girth (DP, LR, ET), pp. 660–672.

STOC-2011-KantorLPP #communication

The topology of wireless communication (EK, ZL, MP, DP), pp. 383–392.

STOC-2011-SarmaHKKNPPW #approximate #distributed #verification

Distributed verification and hardness of distributed approximation (ADS, SH, LK, AK, DN, GP, DP, RW), pp. 363–372.

ICALP-v2-2010-ChechikEPP #graph #reliability

Sparse Reliable Graph Backbones (SC, YE, BPS, DP), pp. 261–272.

STOC-2009-ChechikLPR #fault tolerance #graph

Fault-tolerant spanners for general graphs (SC, ML, DP, LR), pp. 435–444.

ICALP-v1-2006-KormanP #graph

Dynamic Routing Schemes for General Graphs (AK, DP), pp. 619–630.

ICALP-2005-CohenFIKP #automaton #finite #graph

Label-Guided Graph Exploration by a Finite Automaton (RC, PF, DI, AK, DP), pp. 335–346.

ICALP-2003-KormanP

Labeling Schemes for Weighted Dynamic Trees (AK, DP), pp. 369–383.

STOC-2001-ElkinP #graph

(1+ε,β)-Spanner Constructions for General Graphs (ME, DP), pp. 173–182.

ICALP-2000-ElkinP #problem

Strong Inapproximability of the Basic k-Spanner Problem (ME, DP), pp. 636–647.

ICALP-1999-HassinP #distributed #probability

Distributed Probabilistic Polling and Applications to Proportionate Agreement (YH, DP), pp. 402–411.

ICALP-1999-PelegR #complexity #distributed

A Variant of the Arrow Distributed Directory with Low Average Complexity (DP, ER), pp. 615–624.

ICALP-1998-Peleg #distributed

Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees (DP), pp. 164–175.

ICALP-1998-PelegR #approximate #communication

Deterministic Polylog Approximation for Minimum Communication Spanning Trees (DP, ER), pp. 670–681.

STOC-1995-DolevKKP #adaptation #named #network #performance

Bubbles: adaptive routing scheme for high-speed dynamic networks (SD, EK, DK, DP), pp. 528–537.

STOC-1992-AwerbuchKP #distributed #scheduling

Competitive Distributed Job Scheduling (BA, SK, DP), pp. 571–580.

STOC-1992-AwerbuchPPS #adaptation #network

Adapting to Asynchronous Dynamic Networks (BA, BPS, DP, MES), pp. 557–570.

ICALP-1991-Ben-AsherPRS #configuration management #power of

The POwer of Reconfiguration (YBA, DP, RR, AS), pp. 139–150.

STOC-1990-FeigePRU

Computing with Unreliable Information (UF, DP, PR, EU), pp. 128–137.

STOC-1989-AlonBLP #communication #complexity #on the

On the Complexity of Radio Communication (NA, ABN, NL, DP), pp. 274–285.

STOC-1989-AwerbuchBLP #adaptation #data type #distributed

Compact Distributed Data Structures for Adaptive Routing (BA, ABN, NL, DP), pp. 479–489.

STOC-1988-KrizancPU #trade-off

A Time-Randomness Tradeoff for Oblivious Routing (DK, DP, EU), pp. 93–102.

STOC-1988-PelegU #performance #trade-off

A Tradeoff between Space and Efficiency for Routing Tables (DP, EU), pp. 43–52.

STOC-1987-PelegU #graph

Constructing Disjoint Paths on Expander Graphs (DP, EU), pp. 264–273.

STOC-1986-DworkPPU #bound #fault tolerance #network

Fault Tolerance in Networks of Bounded Degree (CD, DP, NP, EU), pp. 370–379.

STOC-1985-Peleg #concurrent #logic

Concurrent Dynamic Logic (DP), pp. 232–239.