On the public citation graph
The parallel simplicity of compaction and chaining
0 signed · 54 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01759055openalex-snapshot
Large parallel machines can be extremely slow for small problems
inferredcites →https://doi.org/10.1007/bf01762109openalex-snapshot
Simulations among concurrent-write PRAMs
inferredcites →https://doi.org/10.1007/bfb0035775openalex-snapshot
Parallel retrieval of scattered information
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(85)90015-7openalex-snapshot
Unbounded fan-in circuits and associative functions
inferredcites →https://doi.org/10.1109/sct.1990.113958openalex-snapshot
Perfect hashing, graph entropy, and circuit complexity
inferredcites →https://doi.org/10.1109/sfcs.1982.39openalex-snapshot
Storing a sparse table with O(1) worst case access time
inferredcites →https://doi.org/10.1109/sfcs.1985.9openalex-snapshot
An optimal parallel algorithm for integer sorting
inferredcites →https://doi.org/10.1109/sfcs.1986.10openalex-snapshot
Approximate and exact parallel scheduling with applications to list, tree and graph problems
inferredcites →https://doi.org/10.1109/sfcs.1989.63478openalex-snapshot
Recursive *-tree parallel data-structure
inferredcites →https://doi.org/10.1145/28395.28405openalex-snapshot
Optimal bounds for decision problems on the CRCW PRAM
inferredcites →https://doi.org/10.1145/800222.806745openalex-snapshot
Relations between concurrent-write models of parallel computation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.10104openalex-snapshot
Randomization helps to perform independent tasks reliably
inferred← citeshttps://doi.org/10.1006/inco.1996.0043openalex-snapshot
Sensitive Functions and Approximate Problems
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1127openalex-snapshot
Fast and Efficient Simulations among CRCW PRAMs
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1128openalex-snapshot
Renaming and Dispersing: Techniques for Fast Load Balancing
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_42openalex-snapshot
The power of collision: Randomized parallel algorithms for chaining and integer sorting
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_148openalex-snapshot
Structural parallel algorithmics
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_151openalex-snapshot
Fast parallel generation of random permutations
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_172openalex-snapshot
Fast and optimal simulations between CRCW PRAMs
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_3openalex-snapshot
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_50openalex-snapshot
Coloring k-colorable graphs in constant expected parallel time
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_69openalex-snapshot
Optimal parallel algorithms for Prefix Matching
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_29openalex-snapshot
An O(log log n) algorithm to compute the kernel of a polygon
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_158openalex-snapshot
Optimal logarithmic time randomized suffix tree construction
inferred← citeshttps://doi.org/10.1007/bf01200429openalex-snapshot
Randomized range-maxima in nearly-constant parallel time
inferred← citeshttps://doi.org/10.1007/bfb0023830openalex-snapshot
Leaders election without conflict resolution rule
inferred← citeshttps://doi.org/10.1007/s00224-004-1155-5openalex-snapshot
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
inferred← citeshttps://doi.org/10.1007/s002240000070openalex-snapshot
Lower Bounds for Randomized Exclusive Write PRAMs
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90110-4openalex-snapshot
Linear-size constant-depth polylog-threshold circuits
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90121-bopenalex-snapshot
On a compaction theorem of Ragde
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0137-nopenalex-snapshot
Almost fully-parallel parentheses matching
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00036-4openalex-snapshot
Fast randomized parallel methods for planar convex hull construction
inferred← citeshttps://doi.org/10.1023/a:1015365901501openalex-snapshot
Parallel Self-Index Integer Sorting
inferred← citeshttps://doi.org/10.1109/hicss.1993.284096openalex-snapshot
Improved parallel bucketing algorithms for proximity problems
inferred← citeshttps://doi.org/10.1109/istcs.1993.253487openalex-snapshot
A lower bound for linear approximate compaction
inferred← citeshttps://doi.org/10.1109/istcs.1995.377028openalex-snapshot
Optimal deterministic approximate parallel prefix sums and their applications
inferred← citeshttps://doi.org/10.1109/sct.1990.113958openalex-snapshot
Perfect hashing, graph entropy, and circuit complexity
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185438openalex-snapshot
Towards a theory of nearly constant time parallel algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185439openalex-snapshot
Using approximation algorithms to design parallel algorithms that may ignore processor allocation
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267787openalex-snapshot
The complexity of parallel prefix problems on small domains
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267788openalex-snapshot
Waste makes haste: tight bounds for loose parallel sorting
inferred← citeshttps://doi.org/10.1109/spdp.1991.218302openalex-snapshot
Fast load balancing on a PRAM
inferred← citeshttps://doi.org/10.1137/s0097539792230277openalex-snapshot
Tight Bounds on Oblivious Chaining
inferred← citeshttps://doi.org/10.1137/s0097539795280068openalex-snapshot
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
inferred← citeshttps://doi.org/10.1145/103418.103452openalex-snapshot
Constant-time parallel integer sorting
inferred← citeshttps://doi.org/10.1145/103418.103453openalex-snapshot
Converting high probability into nearly-constant time---with applications to parallel hashing
inferred← citeshttps://doi.org/10.1145/113379.113385openalex-snapshot
Tight bounds for the chaining problem
inferred← citeshttps://doi.org/10.1145/113379.113397openalex-snapshot
In-place techniques for parallel convex hull algorithms (preliminary version)
inferred← citeshttps://doi.org/10.1145/165231.157380openalex-snapshot
Fast deterministic approximate and exact parallel sorting
inferred← citeshttps://doi.org/10.1145/215399.215454openalex-snapshot
Lower bounds for randomized exclusive write PRAMs
inferred← citeshttps://doi.org/10.4230/lipics.itc.2020.11openalex-snapshot
Deterministic oblivious distribution (and tight compaction) in linear time
inferred← citeshttps://doi.org/10.5539/cis.v13n1p51openalex-snapshot
Sort Integers into a Linked List
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.