Parallel algorithms based on expander graphs for optical computing
- 10 March 1991
- journal article
- Published by Optica Publishing Group in Applied Optics
- Vol. 30 (8) , 917-927
- https://doi.org/10.1364/ao.30.000917
Abstract
Optics InfoBase is the Optical Society's online library for flagship journals, partnered and copublished journals, and recent proceedings from OSA conferences.Keywords
This publication has 16 references indexed in Scilit:
- Fault Tolerance in Networks of Bounded DegreeSIAM Journal on Computing, 1988
- Sorting and Selecting in RoundsSIAM Journal on Computing, 1987
- Eigenvalues and expandersCombinatorica, 1986
- Explicit Concentrators from Generalized N-GonsSIAM Journal on Algebraic Discrete Methods, 1984
- Sorting inc logn parallel stepsCombinatorica, 1983
- A Scheme for Fast Parallel CommunicationSIAM Journal on Computing, 1982
- Explicit constructions of linear-sized superconcentratorsJournal of Computer and System Sciences, 1981
- The complexity of testing whether a graph is a superconcentratorInformation Processing Letters, 1981
- A Comparison of Several Bandwidth and Profile Reduction AlgorithmsACM Transactions on Mathematical Software, 1976
- Graph-theoretic properties in computational complexityJournal of Computer and System Sciences, 1976