Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains

No abstract is available for this paper.

• Publication year

  1998

• Venue

  J. Algorithms

• Publication date

  1998-08-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1006/jagm.1997.0905
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On Parallel Searching

  2011cited by this paper
• Introduction to parallel algorithms

  1998cited by this paper
• Fast parallel algorithms for minimum and related problems with small integer inputs

  1995cited by this paper
• Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima

  1994cited by this paper
• Proceedings of the 30th IEEE symposium on Foundations of computer science

  1994cited by this paper
• On Parallel Integer Merging

  1993cited by this paper
• Structural parallel algorithmics

  1993cited by this paper
• Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values

  1993cited by this paper
• Synthesis of Parallel Algorithms

  1993cited by this paper
• Parallel Algorithms for Shared-Memory Machines

  1991cited by this paper
• Lower bounds with smaller domain size on concurrent write parallel machines

  1991cited by this paper
• Paradigms for very fast parallel algorithms

  1991cited by this paper
• Converting high probability into nearly-constant time—with applications to parallel hashing

  1991cited by this paper
• Towards a theory of nearly constant time parallel algorithms

  1991cited by this paper
• Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics

  1990cited by this paper
• Efficient pattern matching with scaling

  1990cited by this paper
• Triangulating a Polygon in Parallel

  1989cited by this paper
• Optimal separations between concurrent-write parallel machines

  1989cited by this paper
• On Finding Lowest Common Ancestors: Simplification and Parallelization

  1988cited by this paper
• Efficient Parallel Triconnectivity in Logarithmic Time

  1988cited by this paper
• The Parallel Complexity of Element Distinctness is Omega (sqrt(log n))

  1988cited by this paper
• Parallel Algorithmic Techniques for Combinatorial Computation

  1988cited by this paper
• Design and analysis of some parallel algorithms

  1987cited by this paper
• The complexity of parallel comparison merging

  1987cited by this paper
• Optimal bounds for decision problems on the CRCW PRAM

  1987cited by this paper
• Incomparability in parallel computation

  1987cited by this paper
• Probabilistic Parallel Algorithms for Sorting and Selection

  1985cited by this paper
• The complexity of parallel sorting

  1985cited by this paper
• Fast Algorithms for Finding Nearest Common Ancestors

  1984cited by this paper
• Relations between concurrent-write models of parallel computation

  1984cited by this paper
• Scaling and related techniques for geometry problems

  1984cited by this paper
• Searching, Merging, and Sorting in Parallel Computation

  1983cited by this paper
• Finding the Maximum, Merging, and Sorting in a Parallel Computation Model

  1981cited by this paper
• Intersection Theorems for Systems of Sets

  1977cited by this paper
• Parallelism in Comparison Problems

  1975cited by this paper
• Intersection Theorems for Systems of Sets

  1960cited by this paper

• Optimized Line-of-Sight Assessment Algorithm for 5G mmW Network Design using LiDAR Information

  2021cites this paper
• Sorted Range Selection and Range Minima Queries

  2021cites this paper
• All Nearest Smallers Made Simple

  2020cites this paper
• Improved bounds for the sunflower lemma

  2019cites this paper
• Algorithms for testing occurrences of length 4 patterns in permutations

  2017influential citation
• Parallel Algorithms for Testing Length Four Permutations

  2014influential citation
• Algorithms for Testing Length Four Permutations

  2013cites this paper
• Dominance made simple

  2009cites this paper
• A faster parallel connectivity algorithm on cographs

  2007cites this paper
• Parallel algorithms for separable permutations

  2005cites this paper
• A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs

  2000cites this paper
• Parallel Algorithms for the All-Sources Generalized Shortest Paths Problem

  1999cites this paper