Search for Author All Reviews
	Peleg, David     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 7 reviews       Towards a complexity theory for local distributed computing Fraigniaud P., Korman A., Peleg D. Journal of the ACM 60(5): 1-26, 2013.  Type: Article Background on the topic of distributed local computing is given in great detail in this paper. Most of the papers mentioned in the motivation section are recent and valuable in the area. Furthermore, some of the mathematical analysis i...... Apr 24 2014     Localized spanner construction for ad hoc networks with variable transmission range Peleg D., Roditty L.  ADHOC-NOW 2008 (Proceedings of the 7th International Conference on Ad-hoc, Mobile, and Wireless Networks, Sophia-Antipolis, France, Sep 10-12, 2008) 135-147, 2008.  Type: Proceedings A spanner of a geometric graph G is a spanning subgraph S, such that the length of the shortest path between any two vertices in G is well approximated by the distance provided b...... Mar 11 2010     Distance labeling in graphs Gavoille C., Peleg D., Pérennes S., Raz R. Journal of Algorithms 53(1): 85-112, 2004.  Type: Article This paper mainly addresses the problem of efficiently labeling graphs in such a way that the distance between two nodes of the graph can be computed only from their labels. Of course, it is desirable to have the maximum length of a la...... Jan 26 2005     Distributed computing: a locality-sensitive approach Peleg D., Society for Industrial and Applied Mathematics, Philadelphia, PA, 2000. 343 pp.  Type: Book (9780898714647) The algorithms and theory of distributed systems--in particular, the locality aspect of distributed computing--are this book’s focus. The first chapter introduces distributed systems, then discusses some imp...... Apr 1 2001     Online tracking of mobile users Awerbuch B., Peleg D. Journal of the ACM 42(5): 1021-1058, 1995.  Type: Article The problem of efficiently tracking mobile users is a double-edged sword, because the cost of finding a user varies inversely to the cost of updating the user’s address information in the directory as the user moves. To solve...... Nov 1 1996     Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy