On the public citation graph
A compile-time granularity analysis algorithm and its performance evaluation
0 signed · 26 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/bf03037210openalex-snapshot
Compile-time granularity analysis for parallel logic programming languages
inferredcites →https://doi.org/10.1109/52.1991openalex-snapshot
Grain size determination for parallel processing
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/113445.113451openalex-snapshot
Predicting program behavior using real or estimated profiles
inferredcites →https://doi.org/10.1145/66451.66454openalex-snapshot
Automatic determination of grain size for efficient parallel processing
inferredcites →https://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming languages
inferredcites →https://doi.org/10.1145/93542.93564openalex-snapshot
Task granularity analysis in logic programs
inferredcites →https://doi.org/10.1145/989393.989433openalex-snapshot
Profile guided code positioning
inferredcites →https://doi.org/10.2307/2317652openalex-snapshot
Introduction to Combinatorial Mathematics.
inferredcites →https://doi.org/10.2307/2317834openalex-snapshot
Introduction to Combinatorial Mathematics.
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-44854-3_15openalex-snapshot
Cost Analysis Using Automatic Size and Time Inference
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_21openalex-snapshot
Monaco: A high-performance flat concurrent logic programming system
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_54openalex-snapshot
Sequentialization of parallel logic programs with mode analysis
inferred← citeshttps://doi.org/10.1007/bf03037372openalex-snapshot
PAN: A portable, parallel Prolog: Its design, realisation and performance
inferred← citeshttps://doi.org/10.1007/s11265-018-1356-9openalex-snapshot
Static Compiler Analyses for Application-specific Optimization of Task-Parallel Runtime Systems
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00038-8openalex-snapshot
The deevolution of concurrent logic programming languages
inferred← citeshttps://doi.org/10.1109/icdcs.1998.679506openalex-snapshot
Granularity control for distributed execution of logic programs
inferred← citeshttps://doi.org/10.1109/ispan.1994.367182openalex-snapshot
Compiler-chosen operator granularity in a functionally-programmed tagged token architecture
inferred← citeshttps://doi.org/10.1145/3075564.3075574openalex-snapshot
Task-parallel Runtime System Optimization Using Static Compiler Analysis
inferred← citeshttps://doi.org/10.1145/504083.504085openalex-snapshot
Parallel execution of prolog programs
inferred← citeshttps://doi.org/10.5753/sbac-pad.2000.41223openalex-snapshot
Distributed OR Scheduling with Granularity Information
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.