On the public citation graph
A randomized algorithm for fixed-dimensional linear programming
0 signed · 62 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.
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.
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-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1016/0020-0190(86)90037-2openalex-snapshot
Linear programming in O(n × 3d) time
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
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/0213003openalex-snapshot
Linear Time Algorithms for Two- and Three-Variable Linear Programs
inferredcites →https://doi.org/10.1137/0215052openalex-snapshot
On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
inferredcites →https://doi.org/10.1145/12130.12173openalex-snapshot
Further applications of random sampling to computational geometry
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
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.0060openalex-snapshot
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
inferred← citeshttps://doi.org/10.1006/jagm.1998.0984openalex-snapshot
Optimal Point Placement for Mesh Smoothing
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_3openalex-snapshot
Irregularities of Distribution, Derandomization, and Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_3openalex-snapshot
Optimal Möbius Transformations for Information Visualization and Meshing
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_54openalex-snapshot
Linear programming — Randomization and abstract frameworks
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_6openalex-snapshot
Randomized Algorithms for Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_3openalex-snapshot
Backwards Analysis of Randomized Geometric Algorithms
inferred← citeshttps://doi.org/10.1007/bf01582137openalex-snapshot
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
inferred← citeshttps://doi.org/10.1007/bf01940869openalex-snapshot
Introduction to special issue on randomized and derandomized algorithms
inferred← citeshttps://doi.org/10.1007/bf01940877openalex-snapshot
A subexponential bound for linear programming
inferred← citeshttps://doi.org/10.1007/bf02293052openalex-snapshot
Dynamic point location in arrangements of hyperplanes
inferred← citeshttps://doi.org/10.1007/bf02574698openalex-snapshot
Euclidean minimum spanning trees and bichromatic closest pairs
inferred← citeshttps://doi.org/10.1007/bf02574699openalex-snapshot
Small-dimensional linear programming and convex hulls made easy
inferred← citeshttps://doi.org/10.1007/bf02770866openalex-snapshot
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
inferred← citeshttps://doi.org/10.1007/bfb0015247openalex-snapshot
Algorithmic techniques for geometric optimization
inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot
Deterministic sampling and optimization
inferred← citeshttps://doi.org/10.1007/bfb0038202openalex-snapshot
Smallest enclosing disks (balls and ellipsoids)
inferred← citeshttps://doi.org/10.1007/s00454-006-1275-6openalex-snapshot
Multi-Pass Geometric Algorithms
inferred← citeshttps://doi.org/10.1007/s00454-020-00193-0openalex-snapshot
Random Sampling with Removal
inferred← citeshttps://doi.org/10.1007/s10479-014-1707-2openalex-snapshot
A characterization theorem and an algorithm for a convex hull problem
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90064-4openalex-snapshot
Convex hulls of samples from spherically symmetric distributions
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90006-xopenalex-snapshot
Using separation algorithms in fixed dimension
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.09.016openalex-snapshot
Empirical orthogonal constraint generation for Multidimensional 0/1 Knapsack Problems
inferred← citeshttps://doi.org/10.1080/10637199508915495openalex-snapshot
A PARALLEL ALGORITHM FOR FIXED-DIMENSIONAL LINEAR PROGRAMMING∗
inferred← citeshttps://doi.org/10.1093/comjnl/bxm053openalex-snapshot
Parameterized Complexity of Geometric Problems
inferred← citeshttps://doi.org/10.1109/fscs.1990.89578openalex-snapshot
Parallel linear programming in fixed dimension almost surely in constant time
inferred← citeshttps://doi.org/10.1109/ipdpsw52791.2021.00081openalex-snapshot
CPRIC: Collaborative Parallelism for Randomized Incremental Constructions
inferred← citeshttps://doi.org/10.1109/mdm.2012.41openalex-snapshot
Online Identification of Dwell Regions for Moving Objects
inferred← citeshttps://doi.org/10.1137/0221031openalex-snapshot
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
inferred← citeshttps://doi.org/10.1137/1.9781611977066.6openalex-snapshot
Finding Relevant Points for Nearest-Neighbor Classification
inferred← citeshttps://doi.org/10.1137/s0097539797325727openalex-snapshot
Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems
inferred← citeshttps://doi.org/10.1145/1064092.1064121openalex-snapshot
Multi-pass geometric algorithms
inferred← citeshttps://doi.org/10.1145/109648.109663openalex-snapshot
Dynamic point location in arrangements of hyperplanes
inferred← citeshttps://doi.org/10.1145/142675.142678openalex-snapshot
A subexponential bound for linear programming
inferred← citeshttps://doi.org/10.1145/174652.174661openalex-snapshot
Parallel linear programming in fixed dimension almost surely in constant time
inferred← citeshttps://doi.org/10.1145/201019.201036openalex-snapshot
Las Vegas algorithms for linear and integer programming when the dimension is small
inferred← citeshttps://doi.org/10.1145/2746539.2746557openalex-snapshot
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/3155312openalex-snapshot
Improved Deterministic Algorithms for Linear Programming in Low Dimensions
inferred← citeshttps://doi.org/10.1145/3294052.3319697openalex-snapshot
Distributed and Streaming Linear Programming in Low Dimensions
inferred← citeshttps://doi.org/10.1145/3543850openalex-snapshot
Dwell Regions: Generalized Stay Regions for Streaming and Archival Trajectory Data
inferred← citeshttps://doi.org/10.1145/98524.98567openalex-snapshot
Euclidean minimum spanning trees and bichromatic closest pairs
inferred← citeshttps://doi.org/10.1145/98524.98570openalex-snapshot
Linear programming and convex hulls made easy
inferred← citeshttps://doi.org/10.1214/ss/1177011084openalex-snapshot
Probabilistic Analysis in Linear Programming
inferred← citeshttps://doi.org/10.1287/moor.2022.1308openalex-snapshot
On Integer Programming, Discrepancy, and Convolution
inferred← citeshttps://doi.org/10.48550/arxiv.1903.05617openalex-snapshot
Distributed and Streaming Linear Programming in Low Dimensions
inferred← citeshttps://doi.org/10.48550/arxiv.1904.10706openalex-snapshot
Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
inferred← citeshttps://doi.org/10.5555/314161.314383openalex-snapshot
Optimal point placement for mesh smoothing
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.