On schemata and $L$ systems for parallel algorithms
Copyright policy )On schemata and $L$ systems for parallel algorithms
unbounded parallelism, decidability result, Analysis of algorithms and problem complexity, matrix multiplication, OL system, scheduling algorithm, parallel program schemata, Formal languages and automata, knapsack problem, Theory of operating systems, control and data structure of algorithms, Algorithms in computer science, Performance evaluation, queueing, and scheduling in the context of computer systems
unbounded parallelism, decidability result, Analysis of algorithms and problem complexity, matrix multiplication, OL system, scheduling algorithm, parallel program schemata, Formal languages and automata, knapsack problem, Theory of operating systems, control and data structure of algorithms, Algorithms in computer science, Performance evaluation, queueing, and scheduling in the context of computer systems
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!