Recursively divisible problems

DOI10.1007/BFB0009494zbMath1512.6844MaRDI QIDQ6487438

Rolf Niedermeier

Publication date: 25 January 2023

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Communication complexity of PRAMs
• A complexity theory of efficient parallel algorithms
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• On uniform circuit complexity
• A practical hierarchical model of parallel computation. I: The model
• Tight Bounds on the Complexity of Parallel Sorting
• Cubesort: A parallel algorithm for sorting N data items with S-sorters
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P

This page was built for publication: Recursively divisible problems