On the public citation graph

Parallelism in Randomized Incremental Algorithms

0 signed · 78 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/inco.1995.1049openalex-snapshot

A Simple Randomized Sieve Algorithm for the Closest-Pair Problem

inferredcites →https://doi.org/10.1006/jagm.1997.0888openalex-snapshot

A Randomized Parallel Algorithm for Single-Source Shortest Paths

inferredcites →https://doi.org/10.1006/jcss.1997.1534openalex-snapshot

Size-Estimation Framework with Applications to Transitive Closure and Reachability

inferredcites →https://doi.org/10.1007/3-540-54233-7_151openalex-snapshot

Fast parallel generation of random permutations

inferredcites →https://doi.org/10.1007/978-3-540-77974-2openalex-snapshot

Computational Geometry

inferredcites →https://doi.org/10.1007/978-3-642-58043-7_3openalex-snapshot

Backwards Analysis of Randomized Geometric Algorithms

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

Randomized incremental construction of Delaunay and Voronoi diagrams

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

A nearly optimal deterministic parallel Voronoi diagram algorithm

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

Incremental topological flipping works for regular triangulations

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

Applications of random sampling in computational geometry, II

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

Design and Implementation of a Practical Parallel Delaunay Algorithm

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

Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming

inferredcites →https://doi.org/10.1007/s00446-012-0157-9openalex-snapshot

Efficient distributed approximation algorithms via probabilistic tree embeddings

inferredcites →https://doi.org/10.1016/0020-0190(85)90024-9openalex-snapshot

Depth-first search is inherently sequential

inferredcites →https://doi.org/10.1016/0020-0190(90)90026-topenalex-snapshot

An optimal parallel algorithm for linear programming in the plane

inferredcites →https://doi.org/10.1016/0304-3975(93)90024-nopenalex-snapshot

On the randomized construction of the Delaunay tree

inferredcites →https://doi.org/10.1016/0377-0427(93)90083-nopenalex-snapshot

Department of Computer Science

inferredcites →https://doi.org/10.1016/j.apm.2005.05.022openalex-snapshot

Parallelization alternatives and their performance for the convex hull problem

inferredcites →https://doi.org/10.1016/j.jcss.2004.04.011openalex-snapshot

A tight bound on approximating arbitrary metrics by tree metrics

inferredcites →https://doi.org/10.1016/s0925-7721(01)00028-1openalex-snapshot

Two-variable linear programming in parallel

inferredcites →https://doi.org/10.1017/cbo9780511530067openalex-snapshot

Geometry and Topology for Mesh Generation

inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot

Introduction to Algorithms

inferredcites →https://doi.org/10.1090/surv/173openalex-snapshot

Geometric Approximation Algorithms

inferredcites →https://doi.org/10.1093/comjnl/21.2.168openalex-snapshot

Computing Dirichlet Tessellations in the Plane

inferredcites →https://doi.org/10.1109/icppw.2005.49openalex-snapshot

MESETA: A New Scheduling Strategy for Speculative Parallelization of Randomized Incremental Algorithms

inferredcites →https://doi.org/10.1109/ipdps.2011.59openalex-snapshot

Computing Strongly Connected Components in Parallel on CUDA

inferredcites →https://doi.org/10.1109/ipdps.2014.64openalex-snapshot

BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems

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

Towards a theory of nearly constant time parallel algorithms

inferredcites →https://doi.org/10.1111/1467-8659.1230129openalex-snapshot

Parallel 3D Delaunay Triangulation

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

Depth-First Search and Linear Graph Algorithms

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

Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

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

Parallel Merge Sort

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

Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

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

High-Probability Parallel Transitive-Closure Algorithms

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

Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems

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

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)

inferredcites →https://doi.org/10.1137/18m1197850openalex-snapshot

Nearly Work-Efficient Parallel Algorithm for Digraph Reachability

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

Engineering a compact parallel delaunay algorithm in 3D

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

A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension

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

Parallel linear programming in fixed dimension almost surely in constant time

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

The tao of parallelism in algorithms

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

Internally deterministic parallel algorithms can be fast

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

A parallel algorithm for linear programming in fixed dimension

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

Brief announcement

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

Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design

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

Greedy sequential maximal independent set and matching are parallel on average

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

On fast parallel detection of strongly connected components (SCC) in small-world graphs

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

Time-work tradeoffs for parallel algorithms

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

Sorting with Asymmetric Read and Write Costs

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

Parallel Shortest Paths Using Radius Stepping

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

Parallelism in Randomized Incremental Algorithms

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

Parallel Algorithms for Asymmetric Read-Write Costs

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

Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry

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

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

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

Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms

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

The Parallel Evaluation of General Arithmetic Expressions

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

Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers

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

Randomized Incremental Convex Hull is Highly Parallel

inferredcites →https://doi.org/10.5555/120885.120888openalex-snapshot

Small-dimensional linear programming and convex hulls made easy

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-032-26465-7_19openalex-snapshot

Fast Distributed Computation of Compact Routing Schemes

inferred← citeshttps://doi.org/10.1016/j.jpdc.2023.104793openalex-snapshot

An evaluation of GPU filters for accelerating the 2D convex hull

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

Real-Time GPU Acceleration of 3D Delaunay Triangulations using Parallel Insertion Strategies

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

Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence

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

Contour Algorithm for Connectivity

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

Teaching Parallel Algorithms Using the Binary-Forking Model

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

Raiders of the Lost Log: Synchronous Parallel In-Place Models and Algorithms

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

Establish the basis for Breadth-First Search on Frontier System: XBFS on AMD GPUs

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

Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient

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

Parallel Cover Trees and their Applications

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

Parallel Longest Increasing Subsequence and van Emde Boas Trees

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

High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems

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

Parallel Strong Connectivity Based on Faster Reachability

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

Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping

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

Parallel and (Nearly) Work-Efficient Dynamic Programming

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

Parallel Integer Sort: Theory and Practice

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

A Deterministic Work-Depth Tradeoff for Strongly Connected Components

inferred← citeshttps://doi.org/10.14778/3632093.3632104openalex-snapshot

Fast and Space-Efficient Parallel Algorithms for Influence Maximization

inferred← citeshttps://doi.org/10.3389/fdata.2023.1292923openalex-snapshot

A fast parallelized DBSCAN algorithm based on OpenMp for detection of criminals on streaming services

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.