On the public citation graph

On the parallel-decomposability of geometric problems

https://doi.org/10.1007/bf01758844
0 signed · 33 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/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf00264251openalex-snapshot
Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
inferredcites →https://doi.org/10.1007/bf01840383openalex-snapshot
Parallel geometric algorithms on a mesh-connected computer
inferredcites →https://doi.org/10.1007/bfb0040401openalex-snapshot
Network complexity of sorting and graph problems and simulating CRCW PRAMS by interconnection networks
inferredcites →https://doi.org/10.1007/bfb0040412openalex-snapshot
Cubesort: An optimal sorting algorithm for feasible parallel computers
inferredcites →https://doi.org/10.1016/0020-0190(87)90109-8openalex-snapshot
Sorting numbers using limited systolic coprocessors
inferredcites →https://doi.org/10.1016/0020-0190(88)90075-0openalex-snapshot
Sorting with efficient use of special-purpose sorters
inferredcites →https://doi.org/10.1016/0022-0000(82)90048-4openalex-snapshot
The complexity of selection and ranking in X + Y and matrices with sorted columns
inferredcites →https://doi.org/10.1016/0196-6774(81)90027-4openalex-snapshot
The measure problem for rectangular ranges in d-space
inferredcites →https://doi.org/10.1109/12.21120openalex-snapshot
Mesh computer algorithms for computational geometry
inferredcites →https://doi.org/10.1109/12.53587openalex-snapshot
Sorting n objects with a k-sorter
inferredcites →https://doi.org/10.1109/ms.2024.3399277openalex-snapshot
IEEE Transactions on Computers
inferredcites →https://doi.org/10.1109/sfcs.1988.21971openalex-snapshot
New upper bounds in Klee's measure problem
inferredcites →https://doi.org/10.1109/tc.1981.1675805openalex-snapshot
An On-Chip Compare/Steer Bubble Sorter
inferredcites →https://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferredcites →https://doi.org/10.1109/tc.1984.1676494openalex-snapshot
Computational Geometry on a Systolic Chip
inferredcites →https://doi.org/10.1145/12527.12532openalex-snapshot
Systolic algorithms to examine all pairs of elements
inferredcites →https://doi.org/10.1145/321906.321910openalex-snapshot
On Finding the Maxima of a Set of Vectors
inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot
Multidimensional divide-and-conquer
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.1145/73393.73398openalex-snapshot
Quasi-Valid range querying and its implications for nearest neighbor problems
inferredcites →https://doi.org/10.1145/73393.73414openalex-snapshot
Optimal parallel algorithms for polygon and point-set problems
inferredcites →https://doi.org/10.1145/800076.802486openalex-snapshot
I/O complexity

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-45465-9_37openalex-snapshot
Cache Oblivious Distribution Sweeping
inferred← citeshttps://doi.org/10.1007/s00224-002-1066-2openalex-snapshot
Bulk Synchronous Parallel Algorithms for the External Memory Model
inferred← citeshttps://doi.org/10.1007/s00453-002-1009-yopenalex-snapshot
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90026-6openalex-snapshot
An efficient implementation of priority queues using fixed-sized systolic coprocessors
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015508openalex-snapshot
Distribution sweeping on clustered machines with hierarchical memories
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366816openalex-snapshot
External-memory computational geometry
inferred← citeshttps://doi.org/10.1109/spdp.1993.395531openalex-snapshot
Parallel algorithms for geometric problems on networks of processors
inferred← citeshttps://doi.org/10.1145/181014.181438openalex-snapshot
A model for multi-grained parallelism (extended abstract)
inferred← citeshttps://doi.org/10.1145/258492.258503openalex-snapshot
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
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.