Maintaining dynamic ordered sets on processor networks

Authors:
Abhiram Ranade
Affiliations:
-
Venue:
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Year:
1992

A logarithmic time sort for linear size networks

Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Communications of the ACM
Dynamic tree embeddings in butterflies and hypercubes

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
An optimal parallel dictionary

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
How to emulate shared memory

Journal of Computer and System Sciences
Multisearch techniques for implementing data structures on a mesh-connected computer (preliminary version)

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Parallel Dictionaries in 2-3 Trees

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Fluent parallel computation

Fluent parallel computation

Asynchronous shared memory search structures

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Fully dynamic search trees for an extension of the BSP model

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Fast set operations using treaps

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

Hi-index	0.00