Foundations of block-parallel automata networks
Fuente:
arXiv
Saved in:
| Main Authors: | Perrot, Kévin, Sené, Sylvain, Tapin, Léah |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
RTD-Conjecture and Concept Classes Induced by Graphs
by: Simon, Hans U.
Published: (2025)
by: Simon, Hans U.
Published: (2025)
Creation of fixed points in block-parallel Boolean automata networks
by: Perrot, Kévin, et al.
Published: (2025)
by: Perrot, Kévin, et al.
Published: (2025)
Tight bounds on adjacency labels for monotone graph classes
by: Bonnet, Édouard, et al.
Published: (2023)
by: Bonnet, Édouard, et al.
Published: (2023)
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
by: Bonnet, Édouard, et al.
Published: (2023)
by: Bonnet, Édouard, et al.
Published: (2023)
Polygonal corona limit on multigrid dual tilings
by: Lutfalla, Victor, et al.
Published: (2024)
by: Lutfalla, Victor, et al.
Published: (2024)
Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)
by: Bonnet, Édouard, et al.
Published: (2024)
The decidability of the genus of regular languages and directed emulators
by: Bonfante, Guillaume, et al.
Published: (2021)
by: Bonfante, Guillaume, et al.
Published: (2021)
Constructions, bounds, and algorithms for peaceable queens
by: Clinch, Katie, et al.
Published: (2024)
by: Clinch, Katie, et al.
Published: (2024)
Complexity of Boolean automata networks under block-parallel update modes
by: Perrot, Kévin, et al.
Published: (2024)
by: Perrot, Kévin, et al.
Published: (2024)
On Graph Grammars and Games
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)
Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees
by: S, Rajeshwari, et al.
Published: (2022)
by: S, Rajeshwari, et al.
Published: (2022)
Greedy Sets and Greedy Numerical Semigroups
by: Pérez-Rosés, Hebert, et al.
Published: (2024)
by: Pérez-Rosés, Hebert, et al.
Published: (2024)
On solving basic equations over the semiring of functional digraphs
by: Dennunzio, Alberto, et al.
Published: (2024)
by: Dennunzio, Alberto, et al.
Published: (2024)
Shortest Paths in a Weighted Simplicial Complex
by: Chakraborty, Sukrit, et al.
Published: (2025)
by: Chakraborty, Sukrit, et al.
Published: (2025)
The Hierarchy of Saturating Matching Numbers
by: Simon, Hans U., et al.
Published: (2025)
by: Simon, Hans U., et al.
Published: (2025)
Hypergeometric-Type Sequences
by: Tabuguia, Bertrand Teguia
Published: (2023)
by: Tabuguia, Bertrand Teguia
Published: (2023)
Normal forms in Virus Machines
by: Ramírez-de-Arellano, A., et al.
Published: (2024)
by: Ramírez-de-Arellano, A., et al.
Published: (2024)
An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)
by: Mundhra, S.
Published: (2025)
Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)
by: Gabryelski, Wojciech, et al.
Published: (2026)
Computing with Hypergeometric-Type Terms
by: Tabuguia, Bertrand Teguia
Published: (2024)
by: Tabuguia, Bertrand Teguia
Published: (2024)
The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
by: Wittwer, David, et al.
Published: (2024)
by: Wittwer, David, et al.
Published: (2024)
Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)
by: Buchbinder, Niv, et al.
Published: (2024)
Transit Functions and Clustering Systems
by: Changat, Manoj, et al.
Published: (2024)
by: Changat, Manoj, et al.
Published: (2024)
Which graph motif parameters count?
by: Bläser, Markus, et al.
Published: (2025)
by: Bläser, Markus, et al.
Published: (2025)
Dispersion on the Complete Graph
by: De Ambroggio, Umberto, et al.
Published: (2023)
by: De Ambroggio, Umberto, et al.
Published: (2023)
Skip Letters for Short Supersequence of All Permutations
by: Tan, Oliver
Published: (2022)
by: Tan, Oliver
Published: (2022)
Colouring the interference digraph of a set of requests in a bidirected tree
by: Boulier, Hugo, et al.
Published: (2026)
by: Boulier, Hugo, et al.
Published: (2026)
Determining Factorial Speed Fast
by: Feng, Zhidan, et al.
Published: (2026)
by: Feng, Zhidan, et al.
Published: (2026)
The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its Associated Graph
by: Mehiri, El-Mehdi
Published: (2025)
by: Mehiri, El-Mehdi
Published: (2025)
Thick Forests
by: Dyer, Martin, et al.
Published: (2023)
by: Dyer, Martin, et al.
Published: (2023)
Three iterations of $(d-1)$-WL test distinguish non isometric clouds of $d$-dimensional points
by: Rose, Valentino Delle, et al.
Published: (2023)
by: Rose, Valentino Delle, et al.
Published: (2023)
Hardness of busy beaver value BB(15)
by: Stérin, Tristan, et al.
Published: (2021)
by: Stérin, Tristan, et al.
Published: (2021)
Tight eigenvalue bound on the traveling salesman problem
by: Wolff, Lasse H.
Published: (2025)
by: Wolff, Lasse H.
Published: (2025)
Efficient Binary Decision Diagram Manipulation in External Memory
by: Sølvsten, Steffan Christ, et al.
Published: (2021)
by: Sølvsten, Steffan Christ, et al.
Published: (2021)
Bicriteria Submodular Maximization
by: Feldman, Moran, et al.
Published: (2025)
by: Feldman, Moran, et al.
Published: (2025)
Insignificant Choice Polynomial Time: A Logic Capturing PTIME
by: Schewe, Klaus-Dieter
Published: (2020)
by: Schewe, Klaus-Dieter
Published: (2020)
Degree-preserving graph dynamics -- a versatile process to construct random networks
by: Erdős, Péter L., et al.
Published: (2021)
by: Erdős, Péter L., et al.
Published: (2021)
De Bruijn Sequences with Minimum Discrepancy
by: Álvarez, Nicolás, et al.
Published: (2024)
by: Álvarez, Nicolás, et al.
Published: (2024)
Graphs whose vertices of degree at least 2 lie in a triangle
by: Forte, Vinicius L. do, et al.
Published: (2022)
by: Forte, Vinicius L. do, et al.
Published: (2022)
WELLDOC property for words generated by morphisms
by: Puzynina, Svetlana, et al.
Published: (2026)
by: Puzynina, Svetlana, et al.
Published: (2026)
Similar Items
-
RTD-Conjecture and Concept Classes Induced by Graphs
by: Simon, Hans U.
Published: (2025) -
Creation of fixed points in block-parallel Boolean automata networks
by: Perrot, Kévin, et al.
Published: (2025) -
Tight bounds on adjacency labels for monotone graph classes
by: Bonnet, Édouard, et al.
Published: (2023) -
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
by: Bonnet, Édouard, et al.
Published: (2023) -
Polygonal corona limit on multigrid dual tilings
by: Lutfalla, Victor, et al.
Published: (2024)