Upper and lower bounds for recurrent and recursively decomposable parallel processor‐networks

DOI10.1002/CPA.3160480904zbMATH Open0853.68067OpenAlexW2037437702MaRDI QIDQ4884664FDOQ4884664

Authors: Pilar de la Torre, Clyde Kruskal 

Publication date: 12 December 1996

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cpa.3160480904

Recommendations

• Separation and lower bounds for ROM and nondeterministic models of parallel computation
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
• The Dynamic Parallel Complexity of Computational Circuits
• Parallel and sequential computation on Boolean networks
• scientific article; zbMATH DE number 1098623
• scientific article; zbMATH DE number 784042
• A fast algorithm for bounded generalized processing networks
• New lower bounds for parallel computation
• scientific article; zbMATH DE number 1555966
• scientific article; zbMATH DE number 4047131

Mathematics Subject Classification ID

Applications of design theory to circuits and networks (94C30) Computer system organization (68M99)

Cited In (1)

• Applications of recurrence bounds to networks and paths

This page was built for publication: Upper and lower bounds for recurrent and recursively decomposable parallel processor‐networks

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