On the public citation graph

A message passing implementation of lazy task creation

https://doi.org/10.1007/bfb0018649
0 signed · 35 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.1002/spe.4380190704openalex-snapshot
Allocation without locking
inferredcites →https://doi.org/10.1007/bf01383881openalex-snapshot
Implementing a Scheme-based parallel processing system
inferredcites →https://doi.org/10.1016/0020-0190(81)90106-xopenalex-snapshot
Myths about the mutual exclusion problem
inferredcites →https://doi.org/10.1137/0218014openalex-snapshot
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
inferredcites →https://doi.org/10.1145/165180.165205openalex-snapshot
Polling efficiently on stock hardware
inferredcites →https://doi.org/10.1145/4472.4478openalex-snapshot
MULTILISP: a language for concurrent symbolic computation
inferredcites →https://doi.org/10.1145/62678.62694openalex-snapshot
An implementation of portable standard LISP on the BBN butterfly
inferredcites →https://doi.org/10.1145/62678.62696openalex-snapshot
Preliminary results with the initial implementation of Qlisp
inferredcites →https://doi.org/10.1145/73141.74825openalex-snapshot
Mul-T: a high-performance parallel Lisp
inferredcites →https://doi.org/10.1145/74818.74825openalex-snapshot
Mul-T: a high-performance parallel Lisp
inferredcites →https://doi.org/10.1145/800055.802017openalex-snapshot
Implementation of multilisp
inferredcites →https://doi.org/10.1145/91556.91606openalex-snapshot
A parallel virtual machine for efficient scheme compilation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11688839_15openalex-snapshot
Lightweight Lexical Closures for Legitimate Execution Stack Access
inferred← citeshttps://doi.org/10.1007/3-540-40889-4_8openalex-snapshot
Performance Evaluation of OpenMP Applications with Nested Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-39707-6_13openalex-snapshot
Pursuing Laziness for Efficient Implementation of Modern Multithreaded Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-44471-9_11openalex-snapshot
On Efficient Load Balancing for Irregular Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-53455-7_2openalex-snapshot
Divide-and-Conquer Parallelism for Learning Mixture Models
inferred← citeshttps://doi.org/10.1007/bf01018696openalex-snapshot
Using Multilisp for solving constraint satisfaction problems: An application to nucleic acid 3D structure determination
inferred← citeshttps://doi.org/10.1007/bfb0018643openalex-snapshot
Parallel Symbolic Computing: Languages, Systems, and Applications
inferred← citeshttps://doi.org/10.1007/bfb0023054openalex-snapshot
Efficient evaluation strategies for structured concurrency constructs in parallel Scheme systems
inferred← citeshttps://doi.org/10.1007/bfb0026566openalex-snapshot
Multi-threaded PaiLisp with granularity adaptive parallel execution
inferred← citeshttps://doi.org/10.1017/s0956796816000101openalex-snapshot
Oracle-guided scheduling for controlling granularity in implicitly parallel languages
inferred← citeshttps://doi.org/10.1109/ia349570.2019.00008openalex-snapshot
Extending a Work-Stealing Framework with Priorities and Weights
inferred← citeshttps://doi.org/10.1109/icppw.2016.37openalex-snapshot
Extending a Work-Stealing Framework with Probabilistic Guards
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00057openalex-snapshot
Compiler-Based Timing For Extremely Fine-Grain Preemptive Parallelism
inferred← citeshttps://doi.org/10.1145/2442516.2442538openalex-snapshot
Scheduling parallel programs by work stealing with private deques
inferred← citeshttps://doi.org/10.1145/3192366.3192391openalex-snapshot
Heartbeat scheduling: provable efficiency for nested parallelism
inferred← citeshttps://doi.org/10.1145/3293883.3295725openalex-snapshot
Provably and practically efficient granularity control
inferred← citeshttps://doi.org/10.1145/3296979.3192391openalex-snapshot
Heartbeat scheduling: provable efficiency for nested parallelism
inferred← citeshttps://doi.org/10.1145/3635035.3635041openalex-snapshot
Portable Implementations of Work Stealing
inferred← citeshttps://doi.org/10.1145/781498.781533openalex-snapshot
Phoenix
inferred← citeshttps://doi.org/10.1145/966049.781533openalex-snapshot
Phoenix
inferred← citeshttps://doi.org/10.2197/ipsjdc.2.262openalex-snapshot
A Transformation-Based Implementation of Lightweight Nested Functions
inferred← citeshttps://doi.org/10.2197/ipsjjip.29.478openalex-snapshot
Work-stealing Strategies That Consider Work Amount and Hierarchy
inferred← citeshttps://doi.org/10.70675/35c0180dzc462z4178z90cez1700a6ba85c5openalex-snapshot
Synchronization costs in parallel programs and concurrent data structures
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.