Applications of reconfigurable meshes to constant-time computations

DOI10.1016/0167-8191(93)90052-MzbMath0794.68032OpenAlexW1992333612MaRDI QIDQ1208520

James L. Schwing, Stephan Olariu, Jingyuan Zhang

Publication date: 16 May 1993

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(93)90052-m

zbMATH Keywords

parallel algorithmsprefix sumssorting algorithminteger sortingbus systemsparantheses matchingreconfigurable meshes

Mathematics Subject Classification ID

Searching and sorting (68P10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Distributed algorithms (68W15)

Related Items (3)

A constant time algorithm for theorem proving in propositional logic on reconfigurable meshes ⋮ Simulating shared memory in real time: On the computation power of reconfigurable architectures ⋮ Parallel finding all initial palindromes and periods of a string on reconfigurable meshes

This page was built for publication: Applications of reconfigurable meshes to constant-time computations