On the public citation graph

Parallel general prefix computations with geometric, algebraic, and other applications

https://doi.org/10.1007/bf01381719
0 signed · 45 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/3-540-18991-2_57openalex-snapshot
Parallel algorithms for parenthesis matching and generation of random balanced sequences of parentheses
inferredcites →https://doi.org/10.1007/bf01379098openalex-snapshot
Optimal computation of prefix sums on a binary tree of processors
inferredcites →https://doi.org/10.1007/bf01414464openalex-snapshot
An optimal parallel algorithm for triangulating a set of points in the plane
inferredcites →https://doi.org/10.1007/bf01758753openalex-snapshot
Optimal randomized parallel algorithms for computational geometry
inferredcites →https://doi.org/10.1007/bf01934177openalex-snapshot
Alternative methods for the reconstruction of trees from their traversals
inferredcites →https://doi.org/10.1007/bf02219241openalex-snapshot
Constructing a binary tree from its traversals
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0020-0190(83)90046-7openalex-snapshot
Listing and counting subtrees of equal size of a binary tree
inferredcites →https://doi.org/10.1016/0020-0190(86)90070-0openalex-snapshot
algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computer
inferredcites →https://doi.org/10.1016/0020-0190(88)90165-2openalex-snapshot
An O(√n) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors
inferredcites →https://doi.org/10.1016/0020-0190(88)90177-9openalex-snapshot
Two algorithms for constructing a binary tree from its traversals
inferredcites →https://doi.org/10.1016/s0019-9958(86)80041-9openalex-snapshot
Arithmetic theories for computational complexity problems
inferredcites →https://doi.org/10.1016/s0019-9958(86)80046-8openalex-snapshot
Solving tree problems on a mesh-connected processor array
inferredcites →https://doi.org/10.1109/sfcs.1985.51openalex-snapshot
Slimming down search structures: A functional approach to algorithm design
inferredcites →https://doi.org/10.1109/sfcs.1986.41openalex-snapshot
Parallel merge sort
inferredcites →https://doi.org/10.1109/sfcs.1987.12openalex-snapshot
Cascading divide-and-conquer: A technique for designing parallel algorithms
inferredcites →https://doi.org/10.1109/tc.1981.6312172openalex-snapshot
Data broadcasting in SIMD computers
inferredcites →https://doi.org/10.1137/0209058openalex-snapshot
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
inferredcites →https://doi.org/10.1137/0214019openalex-snapshot
New Data Structures for Orthogonal Range Queries
inferredcites →https://doi.org/10.1137/0217049openalex-snapshot
Parallel Merge Sort
inferredcites →https://doi.org/10.1145/100216.100240openalex-snapshot
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
inferredcites →https://doi.org/10.1145/10515.10539openalex-snapshot
Efficient plane sweeping in parallel
inferredcites →https://doi.org/10.1145/322169.322171openalex-snapshot
A Note on Enumerating Binary Trees
inferredcites →https://doi.org/10.1145/322217.322226openalex-snapshot
Database Location in Computer Networks
inferredcites →https://doi.org/10.1145/322217.322232openalex-snapshot
Parallel Prefix Computation
inferredcites →https://doi.org/10.1145/3318.3478openalex-snapshot
Optimal parallel generation of a computation tree form
inferredcites →https://doi.org/10.1145/359461.359481openalex-snapshot
Sorting on a mesh-connected parallel computer
inferredcites →https://doi.org/10.1145/800057.808675openalex-snapshot
Scaling and related techniques for geometry problems

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-55599-4_85openalex-snapshot
Efficient parallel algorithms on interval graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-04303-5_2openalex-snapshot
The Design of Efficient Parallel Algorithms
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90099-hopenalex-snapshot
An optimal algorithm for reconstructing a binary tree
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.12.002openalex-snapshot
Sorting signed permutations by reversals, revisited
inferred← citeshttps://doi.org/10.1080/10637199608915557openalex-snapshot
TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING
inferred← citeshttps://doi.org/10.1109/71.210809openalex-snapshot
An optimal implementation of broadcasting with selective reduction
inferred← citeshttps://doi.org/10.1109/71.485530openalex-snapshot
Constant time BSR solutions to parenthesis matching, tree decoding, and tree reconstruction from its traversals
inferred← citeshttps://doi.org/10.1109/71.539733openalex-snapshot
A time- and cost-optimal algorithm for interlocking sets-with applications
inferred← citeshttps://doi.org/10.1109/71.790602openalex-snapshot
An efficient implementation for the BROADCAST instruction of BSR/sup +/
inferred← citeshttps://doi.org/10.1109/hicss.1994.323269openalex-snapshot
Multiple criteria BSR: an implementation and applications to computational geometry problems
inferred← citeshttps://doi.org/10.1109/icpads.1997.652528openalex-snapshot
Efficient algorithms for prefix and general prefix computations on distributed shared memory systems with applications
inferred← citeshttps://doi.org/10.1109/icpads.2001.934806openalex-snapshot
Optimal parallel algorithms for cut vertices, bridges, and Hamiltonian path in bounded interval tolerance graphs
inferred← citeshttps://doi.org/10.1109/icpads.2007.4447748openalex-snapshot
Parallel algorithms for chains and anti-chains of points on a plane
inferred← citeshttps://doi.org/10.1109/ipps.1991.153768openalex-snapshot
A cost-optimal parallel algorithm for the parentheses matching problem on an EREW PRAM
inferred← citeshttps://doi.org/10.1109/ipps.1992.223055openalex-snapshot
A new parallel algorithm for breadth-first search on interval graphs
inferred← citeshttps://doi.org/10.1109/padsw.2000.884511openalex-snapshot
Domination in bounded interval tolerance graphs
inferred← citeshttps://doi.org/10.1109/spdp.1991.218211openalex-snapshot
Data communication and computational geometry on the star and pancake interconnection networks
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.