An approach to parallel algorithm design
From MaRDI portal
Publication:5286057
DOI10.1051/ita/1993270200851zbMath0770.68034OpenAlexW164262183MaRDI QIDQ5286057
George F. Georgakopoulos, Andreas N. Stafylopatis
Publication date: 29 June 1993
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92445
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Does co-NP have short interactive proofs ?
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Vertex-transitive graphs
- Author's Reply to Vergin's Note on the Paper “Lot Size Scheduling on a Single Machine for Stochastic Demand”