-
1
-
-
33748589199
-
Metric embeddings with relaxed guarantees
-
DOI 10.1109/SFCS.2005.51, 1530704, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
-
I. Abraham, Y. Bartal, T.-H. H. Chan, K. D. Dhamdhere, A. Gupta, J. Kleinberg, O. Neiman, and A. Slivkins. Metric embeddings with relaxed guarantees. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS '05, pages 83-100, Washington, DC, USA, 2005. IEEE Computer Society. (Pubitemid 44375722)
-
(2005)
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
, vol.2005
, pp. 83-100
-
-
Abraham, I.1
Bartal, Y.2
Chan, T.-H.H.3
Dhamdhere, K.4
Gupta, A.5
Kleinberg, J.6
Neiman, O.7
Slivkins, A.8
-
2
-
-
85045415700
-
Random walks, universal traversal sequences, and the complexity of maze problems
-
R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In FOCS, pages 218-223, 1979.
-
(1979)
FOCS
, pp. 218-223
-
-
Aleliunas, R.1
Karp, R.M.2
Lipton, R.J.3
Lovász, L.4
Rackoff, C.5
-
3
-
-
21844431675
-
Mercury: Supporting scalable multi-attribute range queries
-
DOI 10.1145/1030194.1015507, Computer Communication Review - Proceedings of ACM SIGCOMM 2004: Conference on Computer Communications
-
A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: supporting scalable multi-attribute range queries. In SIGCOMM, pages 353-366, 2004. (Pubitemid 40954893)
-
(2004)
Computer Communication Review
, vol.34
, Issue.4
, pp. 353-366
-
-
Bharambe, A.R.1
Agrawal, M.2
Seshan, S.3
-
4
-
-
33750739218
-
Spanners with slack
-
Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings LNCS
-
T.-H. H. Chan, M. Dinitz, and A. Gupta. Spanners with slack. In Proceedings of the 14th European Symposium on Algorithms, pages 196-207, 2006. (Pubitemid 44699652)
-
(2006)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.4168
, pp. 196-207
-
-
Chan, T.-H.H.1
Dinitz, M.2
Gupta, A.3
-
5
-
-
58149485779
-
Labeling schemes for tree representation
-
R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg. Labeling schemes for tree representation. Algorithmica, 53(1):1-15, 2009.
-
(2009)
Algorithmica
, vol.53
, Issue.1
, pp. 1-15
-
-
Cohen, R.1
Fraigniaud, P.2
Ilcinkas, D.3
Korman, A.4
Peleg, D.5
-
6
-
-
33646038566
-
Quickly routing searches without having to move content
-
B. F. Cooper. Quickly routing searches without having to move content. In IPTPS, pages 163-172, 2005.
-
(2005)
IPTPS
, pp. 163-172
-
-
Cooper, B.F.1
-
7
-
-
0001305184
-
Collisions among random walks on a graph
-
D. Coppersmith, P. Tetali, and P. Winkler. Collisions among random walks on a graph. SIAM J. Discret. Math., 6(3):363-374, 1993.
-
(1993)
SIAM J. Discret. Math.
, vol.6
, Issue.3
, pp. 363-374
-
-
Coppersmith, D.1
Tetali, P.2
Winkler, P.3
-
8
-
-
14944372190
-
Vivaldi: A decentralized network coordinate system
-
Portland, Oregon, August
-
F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: A decentralized network coordinate system. In Proceedings of the ACM SIGCOMM '04 Conference, Portland, Oregon, August 2004.
-
(2004)
Proceedings of the ACM SIGCOMM '04 Conference
-
-
Dabek, F.1
Cox, R.2
Kaashoek, F.3
Morris, R.4
-
9
-
-
33746628606
-
Random walk for self-stabilizing group communication in ad hoc networks
-
DOI 10.1109/TMC.2006.104, 1637437
-
S. Dolev, E. Schiller, and J. L. Welch. Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mob. Comput., 5(7):893-905, 2006. also in PODC'02. (Pubitemid 44143938)
-
(2006)
IEEE Transactions on Mobile Computing
, vol.5
, Issue.7
, pp. 893-905
-
-
Dolev, S.1
Schiller, E.2
Welch, J.L.3
-
10
-
-
0037330403
-
Peer-to-peer membership management for gossip-based protocols
-
A. J. Ganesh, A.-M. Kermarrec, and L. Massoulié. Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput., 52(2):139-149, 2003.
-
(2003)
IEEE Trans. Comput.
, vol.52
, Issue.2
, pp. 139-149
-
-
Ganesh, A.J.1
Kermarrec, A.-M.2
Massoulié, L.3
-
11
-
-
3943059465
-
Distance labeling in graphs
-
C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance labeling in graphs. J. Algorithms, 53(1):85-112, 2004.
-
(2004)
J. Algorithms
, vol.53
, Issue.1
, pp. 85-112
-
-
Gavoille, C.1
Peleg, D.2
Pérennes, S.3
Raz, R.4
-
12
-
-
25844506732
-
Hybrid search schemes for unstructured peer-to-peer networks
-
Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
-
C. Gkantsidis, M. Mihail, and A. Saberi. Hybrid search schemes for unstructured peer-to-peer networks. In INFOCOM, pages 1526-1537, 2005. (Pubitemid 41390670)
-
(2005)
Proceedings - IEEE INFOCOM
, vol.3
, pp. 1526-1537
-
-
Gkantsidis, C.1
Mihail, M.2
Saberi, A.3
-
13
-
-
0025534945
-
Token management schemes and random walks yield self-stabilizing mutual exclusion
-
A. Israeli and M. Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In PODC, pages 119-131, 1990.
-
(1990)
PODC
, pp. 119-131
-
-
Israeli, A.1
Jalfon, M.2
-
14
-
-
8344230668
-
Simple efficient load balancing algorithms for peer-to-peer systems
-
D. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In SPAA, pages 36-43, 2004.
-
(2004)
SPAA
, pp. 36-43
-
-
Karger, D.R.1
Ruhl, M.2
-
15
-
-
16244388250
-
Labeling schemes for ow and connectivity
-
M. Katz, N. A. Katz, A. Korman, and D. Peleg. Labeling schemes for ow and connectivity. SIAM J. Comput., 34(1):23-40, 2004.
-
(2004)
SIAM J. Comput.
, vol.34
, Issue.1
, pp. 23-40
-
-
Katz, M.1
Katz, N.A.2
Korman, A.3
Peleg, D.4
-
17
-
-
57549102790
-
Efficient distributed approximation algorithms via probabilistic tree embeddings
-
Journal version: Distributed Computing
-
M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar. Efficient distributed approximation algorithms via probabilistic tree embeddings. In Proc. 27th ACM Symp. on Principles of Distributed Computing (PODC), 2008. Journal version: Distributed Computing, 2012.
-
(2008)
Proc. 27th ACM Symp. on Principles of Distributed Computing (PODC)
-
-
Khan, M.1
Kuhn, F.2
Malkhi, D.3
Pandurangan, G.4
Talwar, K.5
-
18
-
-
41549095348
-
A fast distributed approximation algorithm for minimum spanning trees
-
DOI 10.1007/s00446-007-0047-8
-
M. Khan and G. Pandurangan. A fast distributed approximation algorithm for minimum spanning trees. Distributed Computing, 20:391-402, 2008. (Pubitemid 351464295)
-
(2008)
Distributed Computing
, vol.20
, Issue.6
, pp. 391-402
-
-
Khan, M.1
Pandurangan, G.2
-
19
-
-
0033726520
-
The small-world phenomenon: An algorithm perspective
-
J. M. Kleinberg. The small-world phenomenon: an algorithm perspective. In STOC, pages 163-170, 2000.
-
(2000)
STOC
, pp. 163-170
-
-
Kleinberg, J.M.1
-
20
-
-
0041472348
-
Distributed construction of random expander networks
-
C. Law and K.-Y. Siu. Distributed construction of random expander networks. In INFOCOM, 2003.
-
(2003)
INFOCOM
-
-
Law, C.1
Siu, K.-Y.2
-
21
-
-
1242310022
-
Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience
-
D. Loguinov, A. Kumar, V. Rai, and S. Ganesh. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In SIGCOMM, pages 395-406, 2003.
-
(2003)
SIGCOMM
, pp. 395-406
-
-
Loguinov, D.1
Kumar, A.2
Rai, V.3
Ganesh, S.4
-
22
-
-
0036374187
-
Search and replication in unstructured peer-to-peer networks
-
Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In ICS, pages 84-95, 2002. (Pubitemid 35039987)
-
(2002)
Proceedings of the International Conference on Supercomputing
, pp. 84-95
-
-
Lv, Q.1
Cao, P.2
Cohen, E.3
Li, K.4
Shenker, S.5
-
23
-
-
34848836086
-
Avmon: Optimal and scalable discovery of consistent availability monitoring overlays for distributed systems
-
R. Morales and I. Gupta. Avmon: Optimal and scalable discovery of consistent availability monitoring overlays for distributed systems. In ICDCS, page 55, 2007.
-
(2007)
ICDCS
, pp. 55
-
-
Morales, R.1
Gupta, I.2
-
27
-
-
23844472102
-
Distance estimation and object location via rings of neighbors
-
DOI 10.1145/1073814.1073823, Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing, PODC 2005
-
A. Slivkins. Distance estimation and object location via rings of neighbors. In Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, PODC '05, pages 41-50, New York, NY, USA, 2005. ACM. (Pubitemid 43218369)
-
(2005)
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
, vol.24
, pp. 41-50
-
-
Slivkins, A.1
-
28
-
-
36849031279
-
Towards fast decentralized construction of locality-aware overlay networks
-
DOI 10.1145/1281100.1281116, PODC'07: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing
-
A. Slivkins. Towards fast decentralized construction of locality-aware overlay networks. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pages 89-98, New York, NY, USA, 2007. ACM. (Pubitemid 350229305)
-
(2007)
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
, pp. 89-98
-
-
Slivkins, A.1
-
29
-
-
26444519480
-
Approximate distance oracles
-
DOI 10.1145/1044731.1044732
-
M. Thorup and U. Zwick. Approximate distance oracles. J. ACM, 52(1):1-24, 2005. (Pubitemid 43078379)
-
(2005)
Journal of the ACM
, vol.52
, Issue.1
, pp. 1-24
-
-
Thorup, M.1
Zwick, U.2
-
30
-
-
33847333958
-
Meridian: A lightweight network location service without virtual coordinates
-
DOI 10.1145/1090191.1080103
-
B. Wong, A. Slivkins, and E. G. Sirer. Meridian: a lightweight network location service without virtual coordinates. In Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, SIGCOMM '05, pages 85-96, New York, NY, USA, 2005. ACM. (Pubitemid 46323496)
-
(2005)
Computer Communication Review
, vol.35
, Issue.4
, pp. 85-96
-
-
Wong, B.1
Slivkins, A.2
Sirer, E.G.3
-
31
-
-
25844500356
-
Non-uniform random membership management in peer-to-peer networks
-
Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
-
M. Zhong, K. Shen, and J. I. Seiferas. Non-uniform random membership management in peer-to-peer networks. In INFOCOM, pages 1151-1161, 2005. (Pubitemid 41390768)
-
(2005)
Proceedings - IEEE INFOCOM
, vol.2
, pp. 1151-1161
-
-
Zhong, M.1
Shen, K.2
Seiferas, J.3
|