Sciweavers

5 search results - page 1 / 1
» Lock-free linked lists and skip lists
Sort
View
OPODIS
2004
13 years 6 months ago
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
Håkan Sundell, Philippas Tsigas
PODC
2004
ACM
13 years 10 months ago
Lock-free linked lists and skip lists
Mikhail Fomitchev, Eric Ruppert
ACNS
2005
Springer
138views Cryptology» more  ACNS 2005»
13 years 10 months ago
Indexing Information for Data Forensics
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
Michael T. Goodrich, Mikhail J. Atallah, Roberto T...
SIGDOC
2000
ACM
13 years 9 months ago
High-tech publications need old-fashioned editing
: Standard formats, familiar word choices, consistency, organization, simple graphic formats, technology, mechanics, and the global nature of the user and the media are major consi...
Janis Ramey, Marlene Miller
SPAA
2005
ACM
13 years 10 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...