On the public citation graph

On the complexity of parallel implementation of logic programs

https://doi.org/10.1007/bfb0058027
0 signed · 32 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.1006/jcss.1996.0008openalex-snapshot
Lower Bounds for the Union–Find and the Split–Find Problem on Pointer Machines
inferredcites →https://doi.org/10.1007/3-540-16492-8openalex-snapshot
Third International Conference on Logic Programming
inferredcites →https://doi.org/10.1007/3-540-18088-5_42openalex-snapshot
The nearest common ancestor in a dynamic tree
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf01397627openalex-snapshot
Full prolog and scheduling or-parallelism in muse
inferredcites →https://doi.org/10.1007/bf03037208openalex-snapshot
The Aurora or-parallel Prolog system
inferredcites →https://doi.org/10.1016/0022-0000(79)90042-4openalex-snapshot
A class of algorithms which require nonlinear time to maintain disjoint sets
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0743-1066(95)00092-5openalex-snapshot
Cuts and side-effects in and-or parallel Prolog
inferredcites →https://doi.org/10.1109/ipps.1995.395891openalex-snapshot
&ACE: a high-performance parallel Prolog system
inferredcites →https://doi.org/10.1137/0209036openalex-snapshot
Storage Modification Machines
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/0215072openalex-snapshot
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/155183.155220openalex-snapshot
Analysis of Or-parallel execution models
inferredcites →https://doi.org/10.1145/73007.73040openalex-snapshot
The cell probe complexity of dynamic data structures
inferredcites →https://doi.org/10.5555/320176.320229openalex-snapshot
Data structures for weighted matching and nearest common ancestors with linking
inferredcites →https://doi.org/10.7551/mitpress/4299.003.0015openalex-snapshot
Implementation Mechanisms for Dependent And-Parallelism

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-45995-2_26openalex-snapshot
Ancestor Problems on Pure Pointer Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_25openalex-snapshot
On the Complexity of Dependent And-Parallelism in Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_8openalex-snapshot
Some Results for Elementary Operations
inferred← citeshttps://doi.org/10.1007/bf03037223openalex-snapshot
On the complexity of or-parallelism
inferred← citeshttps://doi.org/10.1007/bfb0056616openalex-snapshot
The complexity of late-binding in dynamic object-oriented languages
inferred← citeshttps://doi.org/10.1007/s00224-004-1118-xopenalex-snapshot
A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines
inferred← citeshttps://doi.org/10.1007/s002360050002openalex-snapshot
How to calculate symmetries of Petri nets
inferred← citeshttps://doi.org/10.1007/s00453-002-0935-zopenalex-snapshot
Optimal Solutions for the Temporal Precedence Problem
inferred← citeshttps://doi.org/10.1007/s004530010036openalex-snapshot
The Temporal Precedence Problem
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00141-0openalex-snapshot
Efficient algorithms for the temporal precedence problem
inferred← citeshttps://doi.org/10.1016/s0096-0551(02)00004-8openalex-snapshot
An optimal data structure to handle dynamic environments in non-deterministic computations
inferred← citeshttps://doi.org/10.1109/icpp.1999.797418openalex-snapshot
Efficient techniques for distributed implementation of search-based AI systems
inferred← citeshttps://doi.org/10.1145/504083.504085openalex-snapshot
Parallel execution of prolog programs
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.