On the public citation graph
Concurrent Clustered Programming
0 signed · 52 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.1002/(sici)1096-9128(199809/11)10:11/13<825::aid-cpe383>3.0.co;2-hopenalex-snapshot
Titanium: a high-performance Java dialect
inferredcites →https://doi.org/10.1016/0898-1221(95)90199-xopenalex-snapshot
Using MPI: Portable parallel programming with the message-passing interface
inferredcites →https://doi.org/10.1109/sfcs.1994.365680openalex-snapshot
Scheduling multithreaded computations by work stealing
inferredcites →https://doi.org/10.1145/1065944.1065952openalex-snapshot
Composable memory transactions
inferredcites →https://doi.org/10.1145/248052.248106openalex-snapshot
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
inferredcites →https://doi.org/10.1145/2641638.2641654openalex-snapshot
Language support for lightweight transactions
inferredcites →https://doi.org/10.1145/289918.289920openalex-snapshot
Co-array Fortran for parallel programming
inferredcites →https://doi.org/10.1145/376656.376831openalex-snapshot
A comparison of three approaches to language, compiler, and library support for multidimensional arrays in Java
inferredcites →https://doi.org/10.1145/62546.62582openalex-snapshot
Detecting stable properties of networks in concurrent logic programming languages
inferredcites →https://doi.org/10.1145/949305.949340openalex-snapshot
Language support for lightweight transactions
inferredcites →https://doi.org/10.1147/sj.391.0021openalex-snapshot
Java programming for high-performance numerical computing
inferredcites →https://doi.org/10.48456/tr-563openalex-snapshot
MJ: An imperative core calculus for Java and Java with effects
inferredcites →https://doi.org/10.7551/mitpress/2086.001.0001openalex-snapshot
Concurrent Constraint Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11590156_42openalex-snapshot
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-89247-0_2openalex-snapshot
Automated Replication of Tuple Spaces via Static Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-27810-0_12openalex-snapshot
Replicating Data for Better Performances in X10
inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_11openalex-snapshot
A Proof System for a PGAS Language
inferred← citeshttps://doi.org/10.1007/978-3-642-17679-1_13openalex-snapshot
Distributed Generalized Dynamic Barrier Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-642-38493-6_3openalex-snapshot
Coordinating Phased Activities while Maintaining Progress
inferred← citeshttps://doi.org/10.1007/978-3-642-41202-8_16openalex-snapshot
Verification of Static and Dynamic Barrier Synchronization Using Bounded Permissions
inferred← citeshttps://doi.org/10.1007/978-3-662-44202-9_27openalex-snapshot
Semantics of (Resilient) X10
inferred← citeshttps://doi.org/10.1145/1248377.1248416openalex-snapshot
Deadlock-free scheduling of X10 computations with bounded resources
inferred← citeshttps://doi.org/10.1145/1480881.1480887openalex-snapshot
A model of cooperative threads
inferred← citeshttps://doi.org/10.1145/1967677.1967681openalex-snapshot
Task-level analysis for a language with async/finish parallelism
inferred← citeshttps://doi.org/10.1145/2016603.1967681openalex-snapshot
Task-level analysis for a language with async/finish parallelism
inferred← citeshttps://doi.org/10.1145/2442516.2442520openalex-snapshot
Array dataflow analysis for polyhedral X10 programs
inferred← citeshttps://doi.org/10.1145/2481268.2481275openalex-snapshot
Achieving load-balancing in power system parallel contingency analysis using X10 programming language
inferred← citeshttps://doi.org/10.1145/2517327.2442520openalex-snapshot
Array dataflow analysis for polyhedral X10 programs
inferred← citeshttps://doi.org/10.1145/2627373.2627380openalex-snapshot
Supporting Array Programming in X10
inferred← citeshttps://doi.org/10.1145/2688500.2688519openalex-snapshot
Dynamic deadlock verification for general barrier synchronisation
inferred← citeshttps://doi.org/10.1145/2858788.2688519openalex-snapshot
Dynamic deadlock verification for general barrier synchronisation
inferred← citeshttps://doi.org/10.1145/3229060openalex-snapshot
Dynamic Deadlock Verification for General Barrier Synchronisation
inferred← citeshttps://doi.org/10.25675/3.023296openalex-snapshot
Beyond shared memory loop parallelism in the polyhedral model
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.