Hakan Sundell and Philippas Tsigas.
Fast and Lock-Free Concurrent Priority Queues for Multi-Threaded Systems.
In Proceedings of the 17th International Parallel and Distributed Processing Symposium,
Nice, April 2003. IEEE.
Rung-Hung Gau and Zygmunt J. Haas.
Concurrent Search of Mobile Users in Cellular Networks.
Transactions on Networking, 12(1):117-130, February 2004.
The Congenial Talking Philosophers Problem in Computer Networks.
Distributed Computing, 15(3):155-175, July 2002.
Yong Yan and Xiaodong Zhang.
Lock Bypassing: An Efficient Algorithm for Concurrently Accessing Priority Heaps.
Journal of Experimental Algorithmics, 3:1-29, 1998.
Sung-Chae Lim, Joonseon Ahn, and Myoung Ho Kim.
A Concurrent Blink Tree Algorithm Using a Cooperative Locking Protocol.
In Proceedings of the 20th British National Conference on Databases,
volume 2712 of Lecture Notes in Computer Science, pages 253-260. Coventry, July 2003. Springer-Verlag.
Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan.
Energy-Efficient Communication Protocol for Wireless Microsensor Networks.
In Proceedings of the 33rd Hawaii International Conference on System
Chengzheng Sun, Xiaohua Jia, Yanchun Zhang, Yun Yang and David Chen.
Achieving Convergence, Causality Preservation, and Intention Preservation in
Real-Time Cooperative Editing Systems.
ACM Transactions on Computer-Human Interaction, 5(1):63-108, March 1998.
Undo Any Operation at Any Time in Group Editors.
In Proceedings of the 2000 ACM Conference on Computer Supported Cooperative Work,
pages 191-200. Philadelphia, 2000. ACM.
Azzedine Boukerche, Sungbum Hong and Tom Jacob.
A Distributed Algorithm for Dynamic Channel Allocation.
Mobile Networks and Applications, 7(2), April 2002.
Chromatic binary search trees: A structure for concurrent rebalancing.
Acta Informatica, 33(6):547-557, September 1996.