Decentralized Online Scheduling of Malleable NP-hard Jobs (Q6487361): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Massively Parallel Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT competition 2020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A high-performance, portable implementation of the MPI message passing interface standard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3639756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed cube and conquer with Paracooba / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages and Compilers for Parallel Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and Parallel Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lilotane: A Lifted SAT-based Approach to Hierarchical Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable SAT solving in the cloud / rank
 
Normal rank

Latest revision as of 11:48, 3 December 2024

scientific article; zbMATH DE number 7630866
Language Label Description Also known as
English
Decentralized Online Scheduling of Malleable NP-hard Jobs
scientific article; zbMATH DE number 7630866

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references