High Complexity Tilings with Sparse Errors

DOI10.1007/978-3-642-02927-1_34MaRDI QIDQ3638051zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andrei Romashchenko, A. Shen, Bruno Durand

Publication date 14 July 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02927-1_34

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Tilings robust to errors
• Complex tilings
• Complex tilings
• Tilings with infinite local complexity
• The Tiling Problem Revisited (Extended Abstract)
• Tile complexity of approximate squares
• Error diffusion on simplices: the structure of bounded invariant tiles
• Tilings in randomly perturbed dense graphs
• Parametrized tiling: accurate approximations and analysis of global dependences
• Error diffusion on acute simplices: invariant tiles

Cited in

(6)

• Fixed Point and Aperiodic Tilings
• Complex tilings
• Tilings robust to errors
• Complex tilings
• Fixed-point tile sets and their applications
• Knight tiles: particles and collisions in the realm of 4-way deterministic tilings

This page was built for publication: High Complexity Tilings with Sparse Errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638051)