scientific article; zbMATH DE number 3657112

MaRDI QIDQ3856087zbMATH OpenFDO

Authors Georg Gati

Publication date 1979

Full work available at URL https://eudml.org/doc/92095

zbMATH Keywords

control and data structure of algorithmsdecidability resultknapsack problemmatrix multiplicationOL systemparallel program schematascheduling algorithmunbounded parallelism

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3480114 (Why is no real title available?)
• scientific article; zbMATH DE number 3506156 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3536014 (Why is no real title available?)
• scientific article; zbMATH DE number 3558972 (Why is no real title available?)
• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 3596233 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• scientific article; zbMATH DE number 3333282 (Why is no real title available?)
• NP-complete scheduling problems
• Parallel program schemata
• Parallel Program Schemata and Maximal Parallelism I. Fundamental Results

This page was built for publication:

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