Concurrent online tracking of mobile users
暂无分享,去创建一个
[1] Baruch Awerbuch,et al. Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..
[2] Jose Augusto Ramos Soares,et al. Graph Spanners: a Survey , 1992 .
[3] Baruch Awerbuch,et al. On buffer-economical store-and-forward deadlock prevention , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.
[4] Michael E. Saks,et al. Decomposing graphs into regions of small diameter , 1991, SODA '91.
[5] Baruch Awerbuch,et al. Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[6] Baruch Awerbuch,et al. Network synchronization with polylogarithmic overhead , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[7] Andrew V. Goldberg,et al. Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.
[8] Eli Upfal,et al. A trade-off between space and efficiency for routing tables , 1989, JACM.
[9] Eli Upfal,et al. A tradeoff between space and efficiency for routing tables , 1988, STOC '88.
[10] David Peleg,et al. An optimal synchronizer for the hypercube , 1987, PODC '87.
[11] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.
[12] Keith A. Lantz,et al. Towards a universal directory service , 1985, PODC '85.
[13] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.