scientific article

zbMath0422.68001MaRDI QIDQ3856087

Georg Gati

Publication date: 1979

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

knapsack problemscheduling algorithmmatrix multiplicationparallel program schematadecidability resultunbounded parallelismcontrol and data structure of algorithmsOL system

Mathematics Subject Classification ID

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

Cites Work

• NP-complete scheduling problems
• Parallel program schemata
• Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: