ERCW PRAMs and optical communication
From MaRDI portal
Publication:1128717
DOI10.1016/S0304-3975(97)00199-0zbMath0902.68071MaRDI QIDQ1128717
Philip D. MacKenzie, Vijaya Ramachandran
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)
Related Items
Gossiping and broadcasting versus computing functions in networks. ⋮ Thinning protocols for routing \(h\)-relations over shared media ⋮ Optical computing ⋮ The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards optimal parallel bucket sorting
- A parallel bucket sort
- Improved deterministic parallel integer sorting
- Parallel iterated bucket sort
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
- Method of determining lower bounds for the complexity of \(\Pi\)-circuits
- A decomposition theorem for partially ordered sets
- Bounding Fan-out in Logical Networks
- Short monotone formulae for the majority function
- Intersection Theorems for Systems of Sets
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Relations between Concurrent-Write Models of Parallel Computation
- Bounds to Complexities of Networks for Sorting and for Switching
- Efficient routing in optical networks
- Constructing $O(n\log n)$ Size Monotone Formulae for the kth Threshold Function of n Boolean Variables
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Direct bulk-synchronous parallel algorithms
- On contention resolution protocols and associated probabilistic phenomena
- Self-simulation for the Passive Optical Star model
