scientific article; zbMATH DE number 177853

MaRDI QIDQ4038731zbMATH OpenFDO

Authors Prabhakar Ragde

Publication date 18 May 1993

zbMATH Keywords

chaining problemcompaction problemCRCW PRAMperfect hash functions

Mathematics Subject Classification ID

Theory of data (68P99) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• The Parallel Simplicity of Compaction and Chaining
• On the Chain Pair Simplification Problem
• Transitive compaction in parallel via branchings
• A theory of compaction-based parallelization
• On the general chain pair simplification problem
• scientific article; zbMATH DE number 7651116
• A short cut to parallelization theorems
• Simplicity of iterated Ore extensions
• Oblivious parallel tight compaction

Cited in

(16)

• Linear-size constant-depth polylog-threshold circuits
• On a compaction theorem of Ragde
• Randomized range-maxima in nearly-constant parallel time
• A fine-grained parallel memory compaction algorithm
• Almost fully-parallel parentheses matching
• Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
• On the Chain Pair Simplification Problem
• Primitives for asynchronous list compression
• Optimal parallel algorithms for Prefix Matching
• The Parallel Simplicity of Compaction and Chaining
• An O(log log n) algorithm to compute the kernel of a polygon
• Retrieval of scattered information by EREW, CREW and CRCW PRAMs
• Fast and optimal simulations between CRCW PRAMs
• The log-star revolution
• Coloring k-colorable graphs in constant expected parallel time
• Fast randomized parallel methods for planar convex hull construction

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038731)