Optimal Space Distributed Order-Preserving Lists

Journal of Algorithms

Volumn 31, Issue 2, 1999, Pages 320-334

  Saks, Michael ^a   Zaharoglou, Fotios ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Data structures; Distributed systems

Indexed keywords

EID: 0141663715     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.1000     Document Type: Article

References (7)

1. Y. Azar, A. Karlin, J. Naor, and N. Shavit, personal communication, 1991.
2. R. Cori and E. Sopena, Some combinatorial aspects of time stamp systems, European J. Combin. 14 (1993), 95-102.
3. D. Dolev and N. Shavit, Bounded concurrent time-stamping, SIAM J. Comput. 26 (1997), 418-455.
4. C. Dwork and O. Waarts, Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!, in "Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992," pp. 655-666.
5. A. Israeli and Ming Li, Bounded time-stamps, in "Proceedings of the 28th Annual Symposium on Foundations of Computer Science, October 1987," pp. 371-382.
6. L. Lamport, Time, clocks, and the ordering of events in a distributed system, Comm. ACM 21(7) (1978), 558-565.
7. M. Li and P. Vitanyi, How to share concurrent asynchronous wait-free variables, in "Proceedings of 16th International Colloquium on Automata, Languages and Programming, 1989," pp. 488-505.