\(O(\log \log n)\)-time integer geometry on the CRCW PRAM
type: Item
instance of: scholarly article
title: \(O(\log \log n)\)-time integer geometry on the CRCW PRAM
zbMATH Open document ID: 0837.68121
DOI: 10.1007/BF01300373
author: Bogdan S. Chlebus
author: Krzysztof Diks
author: Mirosław Kowaluk
published in: Algorithmica
publication date: 1995-07-24T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 778425
zbMATH Keywords: computational geometry
zbMATH Keywords: closest pair of points
zbMATH Keywords: intersection of convex polygons
zbMATH Keywords: intersection of Manhattan line segments
zbMATH Keywords: dominating set
zbMATH Keywords: largest empty square
MaRDI profile type: Publication
cites work: Parallel computational geometry
cites work: Improved deterministic parallel integer sorting
cites work: Q3138978
cites work: An O(logn) parallel connectivity algorithm
cites work: Q4228433
full work available at URL: https://doi.org/10.1007/bf01300373
OpenAlex ID: W1974381145
Recommended article: \(O (\log^* n)\) algorithms on a Sum-CRCW PRAM
Recommended article: Q4255996
Recommended article: Time lower bounds do not exist for CRCW PRAMs
Recommended article: Optimal bounds for decision problems on the CRCW PRAM
Recommended article: Lower bounds for recognizing small cliques on CRCW PRAM's
Recommended article: On the time-space complexity of geometric elimination procedures
Recommended article: Q4551346
Recommended article: Q4945529
Recommended article: Geometric Algorithms for Private-Cache Chip Multiprocessors
description: scientific article; zbMATH DE number 778425