The Parallel Simplicity of Compaction and Chaining

DOI10.1006/jagm.1993.1019zbMath0793.68072OpenAlexW2054284059MaRDI QIDQ4696646

Prabhakar Ragde

Publication date: 29 June 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/42f336ee49475381fda722ce1cfc3e0337613306

zbMATH Keywords

chainingcompactionperfect hash

Mathematics Subject Classification ID

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

Related Items

Parallel two dimensional witness computation, The parallel complexity of integer prefix summation, Retrieval of scattered information by EREW, CREW, and CRCW PRAMs, FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH, MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗, Simulating shared memory in real time: On the computation power of reconfigurable architectures, The complexity of parallel prefix problems on small domains, Shared memory simulations with triple-logarithmic delay, Prefix graphs and their applications, Optimal parallel selection in sorted matrices, A work-time optimal algorithm for computing all string covers, Parallel algorithms for separable permutations, PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS