Database Paper Browser

Back to papers

Concurrent Set Manipulation Without Locking

Summary: Lock-free concurrent set algorithm supporting insert/delete/member using only single-location atomic read-modify-write operations, no locks and no aborts. Provides order-preserving serializability via weaker conditions than prior approaches, enabling higher concurrency with simpler primitives. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
831
Venue
PODS
Year
1988
Pagerank
4.1945683e-05
Overall Rank
12,952 | 9.90%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers