Scheduling of pipelined operator graphs (Q2434287): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Hans L. Bodlaender / rank
Normal rank
 
Property / author
 
Property / author: Gerhard J. Woeginger / rank
Normal rank
 
Property / author
 
Property / author: Hans L. Bodlaender / rank
 
Normal rank
Property / author
 
Property / author: Gerhard J. Woeginger / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59567568 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-011-0225-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989674505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Dcomposition of Recursive Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor scheduling with communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:31, 7 July 2024

scientific article
Language Label Description Also known as
English
Scheduling of pipelined operator graphs
scientific article

    Statements

    Scheduling of pipelined operator graphs (English)
    0 references
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    query optimization
    0 references
    SQL
    0 references
    operator graph
    0 references
    pipelined parallelism
    0 references
    scheduling
    0 references
    worst case analysis
    0 references
    0 references
    0 references