ERCW PRAMs and optical communication
type: Item
instance of: scholarly article
title: ERCW PRAMs and optical communication
zbMATH Open document ID: 0902.68071
DOI: 10.1016/S0304-3975(97)00199-0
author: Philip MacKenzie
author: Vijaya Ramachandran
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 1189969
zbMATH Keywords: parallel algorithms
zbMATH Keywords: optical communication
zbMATH Keywords: ERCW PRAM
zbMATH Keywords: lower bounds
zbMATH Keywords: bounded fan-out circuits
MaRDI profile type: Publication
cites work: Efficient routing in optical networks
cites work: Q3741626
cites work: Q4099676
cites work: Self-simulation for the Passive Optical Star model
cites work: Improved deterministic parallel integer sorting
cites work: Q4385519
cites work: A parallel bucket sort
cites work: Parallel iterated bucket sort
cites work: Q3974857
cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
cites work: A decomposition theorem for partially ordered sets
cites work: Intersection Theorems for Systems of Sets
cites work: Q4281540
cites work: Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
cites work: Relations between Concurrent-Write Models of Parallel Computation
cites work: Constructing $O(n\log n)$ Size Monotone Formulae for the kth Threshold Function of n Boolean Variables
cites work: Direct bulk-synchronous parallel algorithms
cites work: Q3128927
cites work: Towards optimal parallel bucket sorting
cites work: Bounding Fan-out in Logical Networks
cites work: Q4385522
cites work: Method of determining lower bounds for the complexity of \(\Pi\)-circuits
cites work: Q5334622
cites work: On contention resolution protocols and associated probabilistic phenomena
cites work: Q3138978
cites work: Bounds to Complexities of Networks for Sorting and for Switching
cites work: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
cites work: Short monotone formulae for the majority function
cites work: Q4385523
description: scientific article; zbMATH DE number 1189969