-
4
-
-
0029369741
-
Online tracking of mobile users
-
B. Awerbuch and D. Peleg. Online tracking of mobile users. Journal of the ACM, 37:1021-1058, 1995.
-
(1995)
Journal of the ACM
, vol.37
, pp. 1021-1058
-
-
Awerbuch, B.1
Peleg, D.2
-
6
-
-
0000182415
-
A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations
-
H. Chernoff, A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493-509, 1952.
-
(1952)
Annals of Mathematical Statistics
, vol.23
, pp. 493-509
-
-
Chernoff, H.1
-
7
-
-
0004931805
-
Bubbles: Adaptive routing scheme for high-speed dynamic networks
-
May
-
S. Dolev, E. Kranakis, D. Krizanc, and D. Peleg. Bubbles: adaptive routing scheme for high-speed dynamic networks. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 528-537, May 1995.
-
(1995)
Proceedings of the 27th Annual ACM Symposium on Theory of Computing
, pp. 528-537
-
-
Dolev, S.1
Kranakis, E.2
Krizanc, D.3
Peleg, D.4
-
8
-
-
0004155526
-
-
Addison-Wesley, Reading, MA
-
R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics, Addison-Wesley, Reading, MA, 1989.
-
(1989)
Concrete Mathematics
-
-
Graham, R.L.1
Knuth, D.E.2
Patashnik, O.3
-
9
-
-
84981162393
-
Locating nearby copies of replicated Internet servers
-
August
-
J. D. Guyton and M. F. Schwartz. Locating nearby copies of replicated Internet servers. In Proceedings of the 1995 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 288-298, August 1995.
-
(1995)
Proceedings of the 1995 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
, pp. 288-298
-
-
Guyton, J.D.1
Schwartz, M.F.2
-
10
-
-
0030704545
-
Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In
-
May
-
D. Karger, E. Lehman, F. T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 654-663, May 1997.
-
(1997)
Proceedings of the 29th Annual ACM Symposium on Theory of Computing
, pp. 654-663
-
-
Karger, D.1
Lehman, E.2
Leighton, F.T.3
Levine, M.4
Lewin, D.5
Panigrahy, R.6
-
12
-
-
0022141776
-
Fat-trees: Universal networks for hardware-efficient supercomputing
-
C. E. Leiserson, Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers C-34:892-900, 1985.
-
(1985)
IEEE Transactions on Computers
, vol.C-34
, pp. 892-900
-
-
Leiserson, C.E.1
-
13
-
-
0031356159
-
Exploiting locality for data management in systems of limited bandwidth
-
October
-
B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann. Exploiting locality for data management in systems of limited bandwidth. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 284-293, October 1997.
-
(1997)
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science
, pp. 284-293
-
-
Maggs, B.M.1
Meyer Auf Der Heide, F.2
Vöcking, B.3
Westermann, M.4
-
19
-
-
0023266822
-
How to share memory in a distributed system
-
E. Upfal and A. Wigderson. How to share memory in a distributed system. Journal of the ACM, 34:116-127, 1987.
-
(1987)
Journal of the ACM
, vol.34
, pp. 116-127
-
-
Upfal, E.1
Wigderson, A.2
|