An Efficient General-Purpose Parallel Computer

DOI10.1145/322374.322382MaRDI QIDQ3662602zbMATH OpenOpenAlexFDO

Authors Wolfgang J. Paul, Zvi Galil

Publication date 1983

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322374.322382

zbMATH Keywords

efficient simulationparallel computationprocessor boundtime complexityuniversal machine

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99)

Cited in

(6)

• Parallel string matching with k mismatches
• Data structures and algorithms for approximate string matching
• An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits
• OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS
• Time-optimal simulations of networks by universal parallel computers
• A parallel-design distributed-implementation (PDDI) general-purpose computer

This page was built for publication: An Efficient General-Purpose Parallel Computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3662602)