On the public citation graph

Proving relative lower bounds for incremental algorithms

https://doi.org/10.1007/bf00259471
0 signed · 28 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.1007/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferredcites →https://doi.org/10.1016/0196-6774(81)90009-2openalex-snapshot
The spanning bound as a measure of range query complexity
inferredcites →https://doi.org/10.1137/0210001openalex-snapshot
Lower Bounds on the Complexity of Some Optimal Data Structures
inferredcites →https://doi.org/10.1137/0214055openalex-snapshot
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
inferredcites →https://doi.org/10.1145/27632.27649openalex-snapshot
Elimination algorithms for data flow analysis
inferredcites →https://doi.org/10.1145/322276.322281openalex-snapshot
A Lower Bound on the Complexity of Orthogonal Range Queries
inferredcites →https://doi.org/10.1145/322290.322305openalex-snapshot
The Complexity of Maintaining an Array and Computing Its Partial Sums
inferredcites →https://doi.org/10.1145/42192.42193openalex-snapshot
Incremental data-flow analysis algorithms
inferredcites →https://doi.org/10.1145/567067.567084openalex-snapshot
Incremental data flow analysis
inferredcites →https://doi.org/10.1145/73560.73584openalex-snapshot
Incremental data flow analysis via dominator and attribute update
inferredcites →https://doi.org/10.1145/78969.78963openalex-snapshot
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
inferredcites →https://doi.org/10.7282/t3jh3qqgopenalex-snapshot
Exploring the Structure of Incremental Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.1133openalex-snapshot
Language design and analyzability: a retrospective
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_63openalex-snapshot
A complexity theoretic approach to incremental computation
inferred← citeshttps://doi.org/10.1007/bf01190506openalex-snapshot
Dynamic expression trees
inferred← citeshttps://doi.org/10.1007/s00453-004-1081-6openalex-snapshot
Solving Systems of Difference Constraints Incrementally with Bidirectional Search
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90159-7openalex-snapshot
Complexity models for incremental computation
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00079-8openalex-snapshot
On the computational complexity of dynamic graph problems
inferred← citeshttps://doi.org/10.1016/bs.pbr.2017.05.006openalex-snapshot
Fundamental computational constraints on the time course of perception and action
inferred← citeshttps://doi.org/10.1080/00207169908804821openalex-snapshot
The complexity of certain incremental code generation problems
inferred← citeshttps://doi.org/10.1109/32.44377openalex-snapshot
Profiling an incremental data flow analysis algorithm
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267818openalex-snapshot
Sparsification-a technique for speeding up dynamic graph algorithms
inferred← citeshttps://doi.org/10.1137/s0097539794280736openalex-snapshot
On-Line Planarity Testing
inferred← citeshttps://doi.org/10.1145/103135.103137openalex-snapshot
INC
inferred← citeshttps://doi.org/10.1145/158511.158710openalex-snapshot
A categorized bibliography on incremental computation
inferred← citeshttps://doi.org/10.1145/265910.265914openalex-snapshot
Sparsification—a technique for speeding up dynamic graph algorithms
inferred← citeshttps://doi.org/10.1145/91556.91679openalex-snapshot
Incremental reduction in the lambda calculus
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.