Parallel linear programming in fixed dimension almost surely in constant time

No abstract is available for this paper.

• Publication year

  1990

• Venue

  Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science

• Publication date

  1990-10-22

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/FSCS.1990.89578
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An Optimal Parallel Algorithm for Linear Programming in the Plane

  1990cited by this paper
• A randomized algorithm for fixed-dimensional linear programming

  1989cited by this paper
• Partition trees for triangle counting and other range searching problems

  1988cited by this paper
• A Las Vegas algorithm for linear programming when the dimension is small

  1988cited by this paper
• Linear programming with two variables per inequality in poly-log time

  1986cited by this paper
• On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem

  1986cited by this paper
• Linear Programming in O(n * (3_d)_2) Time

  1986cited by this paper
• Linear Programming in Linear Time When the Dimension Is Fixed

  1984cited by this paper
• Fast parallel matrix and GCD computations

  1982cited by this paper
• A fast probabilistic parallel sorting algorithm

  1981cited by this paper
• Parallelism in Comparison Problems

  1975cited by this paper
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

  1952influential reference

• Fast Distributed Algorithms for LP-Type Problems of Low Dimension

  2019cites this paper
• Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension (Brief Announcement)

  2019cites this paper
• A Differentiated Caching Mechanism to Enable Primary Storage Deduplication in Clouds

  2018cites this paper
• Parallelism in Randomized Incremental Algorithms

  2018cites this paper
• HPDedup: A Hybrid Prioritized Data Deduplication Mechanism for Primary Storage in the Cloud

  2017cites this paper
• 49 LINEAR PROGRAMMING

  2017cites this paper
• The CAPS Family of Cognitive Architectures

  2017cites this paper
• 46 PARALLEL ALGORITHMS IN GEOMETRY

  2016cites this paper
• 50 LINEAR PROGRAMMING

  2016cites this paper
• Parallelism in Randomized Incremental Algorithms

  2016cites this paper
• Dynamic power management for multidomain system-on-chip platforms

  2013influential citation
• Algorithms and hardness results for parallel large margin learning

  2011cites this paper
• Sorting, Searching, and Simulation in the MapReduce Framework

  2011cites this paper
• Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry

  2010cites this paper
• A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs

  2007cites this paper
• Poisson convergence in the restricted k-partitioning problem

  2007cites this paper
• Resource Constraints on Computation and Communication in the Brain

  2007cites this paper
• CS-1996-19 E cient Algorithms for GeometricOptimizationPankaj

  2007cites this paper
• Bound Propagation

  2003cites this paper
• Efficient computation of a measure of depth between convex objects for graphics applications

  2002cites this paper
• Derandomization in Combinatorial Optimization

  2001cites this paper
• Randomized Geometry Algorithms for Coarse Grained Parallel Computers

  2001cites this paper
• Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems

  2000cites this paper
• Parallel Computational Geometry: An Approach using Randomization

  2000cites this paper
• Chapter 16 Fixed-Dimensional Parallel Linear Programming via Relative c-Approximations

  1999cites this paper
• E cient Algorithms for Geometric Optimization

  1998cites this paper
• Two-variable linear programming in parallel

  1998cites this paper
• Efficient algorithms for geometric optimization

  1998cites this paper
• Computation of penetration measures for convex polygons and polyhedra for graphics applications

  1998cites this paper
• LINEAR PROGRAMMING

  1997cites this paper
• A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers

  1997cites this paper
• Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming

  1997cites this paper
• Fast Randomized Parallel Methods for Planar Convex Hull Construction

  1997influential citation
• Fixed-dimensional parallel linear programming via relative ε-approximations

  1996cites this paper
• Parallel multidimensional search using approximation algorithms: with applications to linear-programming and related problems

  1996cites this paper
• Derandomization in Computational Geometry

  1996cites this paper
• A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions

  1996cites this paper
• Las Vegas algorithms for linear and integer programming when the dimension is small

  1995influential citation
• A randomized parallel 3D convex hull algorithm for coarse grained multicomputers

  1995cites this paper
• Fast Parallel Space Allocation, Estimation and Integer Sorting

  1995influential citation
• A parallel algorithm for linear programming in fixed dimension

  1995cites this paper
• Optimal parallel string algorithms: sorting, merging and computing the minimum

  1994cites this paper
• A Convex Hull Algorithm on Coarse-Grained Multiprocessors

  1994cites this paper
• Good algorithm design style for multiprocessors

  1994influential citation
• General purpose parallel computing

  1993cites this paper
• Experimental evidence for the power of random sampling in practical parallel algorithms

  1993cites this paper
• A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension

  1992cites this paper
• Piercing convex sets and the hadwiger-debrunner (p

  1992cites this paper
• On parallel complexity of integer linear programming, GCD and the iterated mod function

  1992cites this paper
• On Spanning Trees with Low Crossing Numbers

  1992cites this paper
• In-place techniques for parallel convex hull algorithms (preliminary version)

  1991cites this paper
• Linear Programming (for the Encyclopedia of Microcomputers)

  1991cites this paper
• Strutural Parallel Algorithmics

  1991cites this paper
• Max-planck-institut @bullet@bullet Fur Informatik Prefix Graphs and Their Applications Prefix Graphs and Their Applications Prefix Graphs and Their Applications *

  year unknowncites this paper
• Doubly logarithmic time parallel sortingR

  year unknowncites this paper