David Peleg
The Norman D. Cohen Professor of Computer Sciences
My fields of interest include approximation
algorithms in combinatorial optimization, communication networks and distributed
computing. In the latter two areas, my work is mostly theoretic, and relates
to algorithmic and graph-theoretic aspects. For instance, my work in the area
of communication networks concerns the design of efficient connection patterns
as well as methods for efficient transmission of data between users in different
locations. A typical design question may involve, for example, the design of
a layout for a network that will guarantee relatively low distances between
different points (implying lower communication costs) or large transmission
capacity, yet at the same time will require a minimal number of communication
lines (implying lower costs for the construction of the network). A typical
methods question may involve, for example, the development of a program for
low cost broadcast of a message from one specific user in the network to all
other users, given the particular characteristics of an existing (pre-designed)
network at hand.
Recent Publications
- Distributed Computing: A Locality-Sensitive Approach. SIAM monographs on discrete mathematics and applications, SIAM, Philadelphia, PA, 2000.
- Local Majorities, Coalitions and Monopolies in Graphs: A Review. Theoretical Computer Science 282 (2002) 231-257.
- [with C. Gavoille] Compact and Localized Distributed Data Structures. Distributed Computing, PODC Jubilee Special Issue 16 (2003) 111-120.