A linear algorithm to tile the trapezes with \(h_ m\) and \(v_ n\) (Q1314412): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The undecidability of the domino problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling with polyominoes and combinatorial group theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling with polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling with sets of polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Limitations on the Efficient Use of Parallel Memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conway's Tiling Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on a class of tiling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of Periodic Storage Schemes for Parallel Memories / rank
 
Normal rank

Latest revision as of 12:04, 22 May 2024

scientific article
Language Label Description Also known as
English
A linear algorithm to tile the trapezes with \(h_ m\) and \(v_ n\)
scientific article

    Statements

    A linear algorithm to tile the trapezes with \(h_ m\) and \(v_ n\) (English)
    0 references
    0 references
    30 May 1994
    0 references
    trapezes
    0 references
    linear-time algorithm
    0 references
    rectangles
    0 references
    tiling
    0 references

    Identifiers