Efficient simulation of circuits by EREW PRAMs

DOI10.1016/0020-0190(90)90113-CzbMath0697.68050OpenAlexW2056373208MaRDI QIDQ911771

Ingo Wegener

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90113-c

zbMATH Keywords

matching problemcircuit complexitycomplexity theoryEREW PRAMparallel random access machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Efficient parallel algorithms for linear recurrence computation
• Bounding Fan-out in Logical Networks
• Simulation of Parallel Random Access Machines by Circuits
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• On Representatives of Subsets
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Efficient simulation of circuits by EREW PRAMs