Parallel algorithms for arrangements
type: Item
instance of: scholarly article
title: Parallel algorithms for arrangements
zbMATH Open document ID: 0836.68050
DOI: 10.1007/BF01941684
author: Paul Beame
author: Erik Brisson
author: Richard J. Anderson
published in: Algorithmica
publication date: 1996-02-20T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 845917
zbMATH Keywords: incremental algorithms
zbMATH Keywords: arrangement problem
MaRDI profile type: Publication
cites work: Parallel computational geometry
cites work: Cylindrical Algebraic Decomposition I: The Basic Algorithm
cites work: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
cites work: The power of geometric duality
cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
cites work: Making data structures persistent
cites work: Q3772828
cites work: Constructing Arrangements of Lines and Hyperplanes with Applications
cites work: Q5807665
full work available at URL: https://doi.org/10.1007/bf01941684
OpenAlex ID: W2142561263
Recommended article: Constructing arrangements optimally in parallel
Recommended article: Parallel algorithms for separable permutations
Recommended article: Q3033316
Recommended article: Q3777446
Recommended article: Parallel Algorithms
Recommended article: Parallel algorithms
Recommended article: Q3221759
Recommended article: Q3776653
Recommended article: Parallel algorithms for partitioning sorted sets and related problems
description: scientific article; zbMATH DE number 845917