Efficient simulation of circuits by EREW PRAMs

DOI10.1016/0020-0190(90)90113-CMaRDI QIDQ911771zbMATH OpenOpenAlexFDO

Authors 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

complexity theorycircuit complexityEREW PRAMmatching problemparallel random access machines

Mathematics Subject Classification ID

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

Recommendations

• Simulation of PRAMs with scan primitives by unbounded fan-in circuits
• Processor-time tradeoffs in PRAM simulations
• scientific article; zbMATH DE number 1337740
• Publication:4727434
• Simulation of Parallel Random Access Machines by Circuits

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 5788647 (Why is no real title available?)
• Simulation of PRAMs with scan primitives by unbounded fan-in circuits

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

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