On the public citation graph

Optimal randomized parallel algorithms for computational geometry

0 signed · 67 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/bf01178563openalex-snapshot

On parallel integer sorting

inferredcites →https://doi.org/10.1007/bf01762120openalex-snapshot

Parallel computational geometry

inferredcites →https://doi.org/10.1007/bf01762130openalex-snapshot

Parallel algorithms for some functions of two convex polygons

inferredcites →https://doi.org/10.1007/bf02187876openalex-snapshot

ɛ-nets and simplex range queries

inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot

New applications of random sampling in computational geometry

inferredcites →https://doi.org/10.1007/bf02579338openalex-snapshot

Sorting inc logn parallel steps

inferredcites →https://doi.org/10.1016/0022-0000(85)90008-xopenalex-snapshot

Routing, merging, and sorting on parallel models of computation

inferredcites →https://doi.org/10.1109/sfcs.1981.6openalex-snapshot

A fast probabilistic parallel sorting algorithm

inferredcites →https://doi.org/10.1109/sfcs.1985.42openalex-snapshot

Parallel computational geometry

inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot

Parallel tree contraction and its application

inferredcites →https://doi.org/10.1109/sfcs.1985.9openalex-snapshot

An optimal parallel algorithm for integer sorting

inferredcites →https://doi.org/10.1109/sfcs.1986.10openalex-snapshot

Approximate and exact parallel scheduling with applications to list, tree and graph problems

inferredcites →https://doi.org/10.1109/sfcs.1986.41openalex-snapshot

Parallel merge sort

inferredcites →https://doi.org/10.1109/sfcs.1986.9openalex-snapshot

An optimal randomized parallel algorithm for finding connected components in a graph

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.1137/0204030openalex-snapshot

Parallelism in Comparison Problems

inferredcites →https://doi.org/10.1137/0205015openalex-snapshot

Multidimensional Searching Problems

inferredcites →https://doi.org/10.1137/0211027openalex-snapshot

A Scheme for Fast Parallel Communication

inferredcites →https://doi.org/10.1137/0212002openalex-snapshot

Optimal Search in Planar Subdivisions

inferredcites →https://doi.org/10.1137/0215023openalex-snapshot

Optimal Point Location in a Monotone Subdivision

inferredcites →https://doi.org/10.1145/10515.10539openalex-snapshot

Efficient plane sweeping in parallel

inferredcites →https://doi.org/10.1145/22145.22165openalex-snapshot

A probabilistic algorithm for the post office problem

inferredcites →https://doi.org/10.1145/41958.41980openalex-snapshot

Parallel processing for efficient subdivision search

inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot

Applications of random sampling in computational geometry, II

inferredcites →https://doi.org/10.1145/7531.7532openalex-snapshot

A logarithmic time sort for linear size networks

inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot

A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1996.0027openalex-snapshot

Derandomization in Computational Geometry

inferred← citeshttps://doi.org/10.1007/3-540-50647-0_104openalex-snapshot

A survey of parallel computational geometry algorithms

inferred← citeshttps://doi.org/10.1007/3-540-51498-8_41openalex-snapshot

Parallel general prefix computations with geometric, algebraic and other applications

inferred← citeshttps://doi.org/10.1007/3-540-58715-2_125openalex-snapshot

Lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems

inferred← citeshttps://doi.org/10.1007/3-540-64359-1_714openalex-snapshot

Parallel randomized techniques for some fundamental geometric problems: A survey

inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_3openalex-snapshot

Random Sampling Techniques in Parallel Algorithms

inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_7openalex-snapshot

Parallel Randomized Techniques for Some Fundamental Geometric Problems

inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_3openalex-snapshot

Concentration of Measure for Randomized Algorithms: Techniques and Analysis

inferred← citeshttps://doi.org/10.1007/bf01381719openalex-snapshot

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

inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot

Deterministic sampling and optimization

inferred← citeshttps://doi.org/10.1007/bfb0035760openalex-snapshot

A singly-exponential stratification scheme for real semi-algebraic varieties and its applications

inferred← citeshttps://doi.org/10.1007/s00453-001-0115-6openalex-snapshot

Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane

inferred← citeshttps://doi.org/10.1016/0304-3975(91)90261-yopenalex-snapshot

A singly exponential stratification scheme for real semi-algebraic varieties and its applications

inferred← citeshttps://doi.org/10.1016/0925-7721(94)90009-4openalex-snapshot

Point location among hyperplanes and unidirectional ray-shooting

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot

Deterministic Parallel Computational Geometry

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50019-xopenalex-snapshot

Parallel Computational Geometry: An Approach using Randomization

inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80023-6openalex-snapshot

Parallel solutions to geometric problems in the scan model of computation

inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80069-8openalex-snapshot

The probabilistic method yields deterministic parallel algorithms

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00212-5openalex-snapshot

Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems

inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot

Parallel techniques for computational geometry

inferred← citeshttps://doi.org/10.1109/hicss.1994.323267openalex-snapshot

Maintaining Voronoi diagrams in parallel

inferred← citeshttps://doi.org/10.1109/sfcs.1987.12openalex-snapshot

Cascading divide-and-conquer: A technique for designing parallel algorithms

inferred← citeshttps://doi.org/10.1109/sfcs.1988.21970openalex-snapshot

A deterministic view of random sampling and its use in geometry

inferred← citeshttps://doi.org/10.1109/sfcs.1991.185345openalex-snapshot

An optimal convex hull algorithm and new results on cuttings

inferred← citeshttps://doi.org/10.1109/sfcs.1991.185371openalex-snapshot

Randomized multidimensional search trees: further results in dynamic sampling

inferred← citeshttps://doi.org/10.1109/sfcs.1993.366877openalex-snapshot

Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs

inferred← citeshttps://doi.org/10.1137/s0097539790184298openalex-snapshot

Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications

inferred← citeshttps://doi.org/10.1142/s0129626412500077openalex-snapshot

EXPLOITING THE MEMORY HIERARCHY OF MULTICORE SYSTEMS FOR PARALLEL TRIANGULATION REFINEMENT

inferred← citeshttps://doi.org/10.1145/109648.109663openalex-snapshot

Dynamic point location in arrangements of hyperplanes

inferred← citeshttps://doi.org/10.1145/177424.177511openalex-snapshot

Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane and related problems

inferred← citeshttps://doi.org/10.1145/195058.195110openalex-snapshot

Computational geometry

inferred← citeshttps://doi.org/10.1145/225058.225285openalex-snapshot

Computing faces in segment and simplex arrangements

inferred← citeshttps://doi.org/10.1145/2935764.2935766openalex-snapshot

Parallelism in Randomized Incremental Algorithms

inferred← citeshttps://doi.org/10.1145/3210377.3210380openalex-snapshot

Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry

inferred← citeshttps://doi.org/10.1145/3318464.3380582openalex-snapshot

Theoretically-Efficient and Practical Parallel DBSCAN

inferred← citeshttps://doi.org/10.1145/3350755.3400255openalex-snapshot

Randomized Incremental Convex Hull is Highly Parallel

inferred← citeshttps://doi.org/10.1145/3694906.3743318openalex-snapshot

Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications

inferred← citeshttps://doi.org/10.1145/73007.73045openalex-snapshot

Polling: a new randomized sampling technique for computational geometry

inferred← citeshttps://doi.org/10.1145/73393.73394openalex-snapshot

Applications of random sampling in computational geometry, II

inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5391openalex-snapshot

Parallel Geometric 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.