On the public citation graph

Algorithms for parallel memory allocation

https://doi.org/10.1007/bf01407909
0 signed · 37 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00289064openalex-snapshot
Concurrent search and insertion in 2?3 trees
inferredcites →https://doi.org/10.1016/0306-4379(88)90030-0openalex-snapshot
Concurrency in extendible hashing
inferredcites →https://doi.org/10.1109/52.7940openalex-snapshot
Concurrent algorithms for real-time memory management
inferredcites →https://doi.org/10.1109/tc.1980.1675680openalex-snapshot
Concurrent Search and Insertion in AVL Trees
inferredcites →https://doi.org/10.1145/1270.318576openalex-snapshot
Concurrency control in a dynamic search structure
inferredcites →https://doi.org/10.1145/22952.22954openalex-snapshot
Concurrency in linear hashing
inferredcites →https://doi.org/10.1145/319566.319567openalex-snapshot
On optimistic methods for concurrency control
inferredcites →https://doi.org/10.1145/319628.319663openalex-snapshot
Efficient locking for concurrent operations on B-trees
inferredcites →https://doi.org/10.1145/320613.320618openalex-snapshot
Quintary trees
inferredcites →https://doi.org/10.1145/320613.320619openalex-snapshot
Concurrent manipulation of binary search trees
inferredcites →https://doi.org/10.1145/42201.42204openalex-snapshot
Concurrent search structure algorithms
inferredcites →https://doi.org/10.1145/588111.588156openalex-snapshot
Concurrency control in a dynamic search structure
inferredcites →https://doi.org/10.1145/859515.859517openalex-snapshot
Coordinating parallel processors

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-60368-9_19openalex-snapshot
Dynamic storage allocation: A survey and critical review
inferred← citeshttps://doi.org/10.1007/978-1-4419-6778-7_2openalex-snapshot
Application-Specific Multi-Threaded Dynamic Memory Management
inferred← citeshttps://doi.org/10.1007/s004460050019openalex-snapshot
Linearizable counting networks
inferred← citeshttps://doi.org/10.1109/fmpc.1996.558089openalex-snapshot
Scalability of dynamic storage allocation algorithms
inferred← citeshttps://doi.org/10.1109/icsamos.2010.5642078openalex-snapshot
Custom multi-threaded Dynamic Memory Management for Multiprocessor System-on-Chip platforms
inferred← citeshttps://doi.org/10.1109/ipps.1997.580978openalex-snapshot
The impact of timing on linearizability in counting networks
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185415openalex-snapshot
Low contention linearizable counting
inferred← citeshttps://doi.org/10.1109/spdp.1993.395547openalex-snapshot
Parallel dynamic storage allocation algorithms
inferred← citeshttps://doi.org/10.1145/103418.103421openalex-snapshot
Counting networks and multi-processor coordination
inferred← citeshttps://doi.org/10.1145/106972.106998openalex-snapshot
Process coordination with fetch-and-increment
inferred← citeshttps://doi.org/10.1145/106973.106998openalex-snapshot
Process coordination with fetch-and-increment
inferred← citeshttps://doi.org/10.1145/106974.106998openalex-snapshot
Process coordination with fetch-and-increment
inferred← citeshttps://doi.org/10.1145/106975.106998openalex-snapshot
Process coordination with fetch-and-increment
inferred← citeshttps://doi.org/10.1145/129712.129752openalex-snapshot
Small-depth counting networks
inferred← citeshttps://doi.org/10.1145/167088.167145openalex-snapshot
Contention in shared memory algorithms
inferred← citeshttps://doi.org/10.1145/185675.185815openalex-snapshot
Counting networks
inferred← citeshttps://doi.org/10.1145/197917.198092openalex-snapshot
A combinatorial treatment of balancing networks
inferred← citeshttps://doi.org/10.1145/234752.234754openalex-snapshot
A combinatorial treatment of balancing networks
inferred← citeshttps://doi.org/10.1145/268999.269000openalex-snapshot
Contention in shared memory algorithms
inferred← citeshttps://doi.org/10.1145/356989.357000openalex-snapshot
Hoard
inferred← citeshttps://doi.org/10.1145/3710848.3710873openalex-snapshot
Aggregating Funnels for Faster Fetch&Add and Queues
inferred← citeshttps://doi.org/10.1145/378993.379232openalex-snapshot
Hoard
inferred← citeshttps://doi.org/10.1145/378995.379232openalex-snapshot
Hoard
inferred← citeshttps://doi.org/10.1145/384264.379232openalex-snapshot
Hoard
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.