Ville Salo - RankMe

101 papers A* 1A 1B 2C 6Misc 1Journal 69Unranked 21

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Three-Dimensional SFT with Sparse Columns. CoRR Ville Salo, Ilkka Törmä
2025	—	`conf`	Descriptive Complexity of Sensitivity of Cellular Automata. AUTOMATA Tom Favereau, Ville Salo
2025	J	`jnl`	Descriptive Complexity of Sensitivity of Cellular Automata. CoRR Tom Favereau, Ville Salo
2025	J	`jnl`	Graph and wreath products of cellular automata. Int. J. Algebra Comput. Ville Salo
2025	J	`jnl`	Solitaire of independence. Nat. Comput. Ville Salo, Juliette Schabanel
2025	J	`jnl`	Structure and computability of preimages in the Game of Life. Theor. Comput. Sci. Ville Salo, Ilkka Törmä
2025	—	`conf`	Symbol Frequencies in Surjective Cellular Automata. AUTOMATA Benjamin Hellouin de Menibus, Ville Salo, Ilkka Törmä
2025	J	`jnl`	Word problems and embedding-obstructions in cellular automata groups on groups. CoRR Ville Salo
2024	J	`jnl`	Avoshifts. CoRR Ville Salo
2024	J	`jnl`	Finding Codes on Infinite Grids Automatically. Fundam. Informaticae Ville Salo, Ilkka Törmä
2024	J	`jnl`	Shifts on the lamplighter group. CoRR Laurent Bartholdi, Ville Salo
2024	J	`jnl`	Snakes can be fooled into thinking they live in a tree. CoRR Laurent Bartholdi, Ville Salo
2023	J	`jnl`	A physically universal Turing machine. J. Comput. Syst. Sci. Ville Salo, Ilkka Törmä
2023	J	`jnl`	Computing backwards with Game of Life, part 1: wires and circuits. CoRR Ville Salo, Ilkka Törmä
2023	—	`conf`	Diddy: A Python Toolbox for Infinite Discrete Dynamical Systems. AUTOMATA Ville Salo, Ilkka Törmä
2023	J	`jnl`	Diddy: a Python toolbox for infinite discrete dynamical systems. CoRR Ville Salo, Ilkka Törmä
2023	J	`jnl`	Finding codes on infinite grids automatically. CoRR Ville Salo, Ilkka Törmä
2023	J	`jnl`	On von Neumann regularity of cellular automata. Nat. Comput. Ville Salo
2023	J	`jnl`	The group of reversible Turing machines: subgroups, generators and computability. CoRR Sebastián Barbieri, Jarkko Kari, Ville Salo
2022	J	`jnl`	Automatic winning shifts. Inf. Comput. Jarkko Peltomäki, Ville Salo
2022	J	`jnl`	Cellular automata and bootstrap percolation. Theor. Comput. Sci. Ville Salo, Guillaume Theyssier, Ilkka Törmä
2022	J	`jnl`	Cutting corners. J. Comput. Syst. Sci. Ville Salo
2022	J	`jnl`	Distortion element in the automorphism group of a full shift. CoRR Antonin Callard, Ville Salo
2022	—	`conf`	Gardens of Eden in the Game of Life. Automata and Complexity Ville Salo, Ilkka Törmä
2022	J	`jnl`	On von Neumann regularity of cellular automata. CoRR Ville Salo
2022	—	`conf`	Triangle Solitaire. AUTOMATA Ville Salo, Juliette Schabanel
2022	A*	`conf`	What Can Oracles Teach Us About the Ultimate Fate of Life? ICALP Ville Salo, Ilkka Törmä
2021	J	`jnl`	Automatic winning shifts. CoRR Jarkko Peltomäki, Ville Salo
2021	J	`jnl`	Bootstrap Percolation and Cellular Automata. CoRR Ville Salo, Guillaume Theyssier, Ilkka Törmä
2021	J	`jnl`	Nilpotent endomorphisms of expansive group actions. Int. J. Algebra Comput. Ville Salo, Ilkka Törmä
2021	J	`jnl`	Sofically presented dynamical systems. CoRR Johan Kopra, Ville Salo
2021	J	`jnl`	Trees in Positive Entropy Subshifts. Axioms Ville Salo
2021	—	`conf`	Von Neumann Regularity, Split Epicness and Elementary Cellular Automata. AUTOMATA Ville Salo
2020	J	`jnl`	A Physically Universal Turing Machine. CoRR Ville Salo, Ilkka Törmä
2020	J	`jnl`	Conjugacy of reversible cellular automata. CoRR Ville Salo
2020	J	`jnl`	Cutting Corners. CoRR Ville Salo
2020	—	`conf`	Four Heads are Better than Three. Automata Ville Salo
2020	J	`jnl`	Four heads are better than three. CoRR Ville Salo
2020	J	`jnl`	Graph and wreath products of cellular automata. CoRR Ville Salo
2020	J	`jnl`	Sequentializing cellular automata. Nat. Comput. Jarkko Kari, Ville Salo, Thomas Worsch
2020	J	`jnl`	Simulations and the Lamplighter group. CoRR Laurent Bartholdi, Ville Salo
2019	J	`jnl`	Alternation diameter of a product object. CoRR Ville Salo
2019	J	`jnl`	Gardens of Eden in the Game of Life. CoRR Ville Salo, Ilkka Törmä
2019	J	`jnl`	Minimal subshifts with a language pivot property. CoRR Ville Salo
2019	J	`jnl`	On winning shifts of marked uniform substitutions. RAIRO Theor. Informatics Appl. Jarkko Peltomäki, Ville Salo
2018	—	`conf`	Sequentializing Cellular Automata. Automata Jarkko Kari, Ville Salo, Thomas Worsch
2018	J	`jnl`	Sequentializing cellular automata. CoRR Jarkko Kari, Ville Salo, Thomas Worsch
2018	J	`jnl`	Universal gates with wires in a row. CoRR Ville Salo
2018	J	`jnl`	Universal groups of cellular automata. CoRR Ville Salo
2018	J	`jnl`	Von Neumann regularity, split epicness and elementary cellular automata. CoRR Ville Salo
2017	C	`conf`	A One-Dimensional Physically Universal Cellular Automaton. CiE Ville Salo, Ilkka Törmä
2017	J	`jnl`	Characterizing Asymptotic Randomization in Abelian Cellular Automata. CoRR Benjamin Hellouin de Menibus, Ville Salo, Guillaume Theyssier
2017	J	`jnl`	Decidability and universality of quasiminimal subshifts. J. Comput. Syst. Sci. Ville Salo
2017	—	`conf`	Distortion in One-Head Machines and Cellular Automata. AUTOMATA Pierre Guillon, Ville Salo
2017	J	`jnl`	Finite generating sets for reversible gate sets under general conservation laws. Theor. Comput. Sci. Tim Boykett, Jarkko Kari, Ville Salo
2017	J	`jnl`	Independent finite automata on Cayley graphs. Nat. Comput. Ville Salo, Ilkka Törmä
2017	J	`jnl`	On winning shifts of marked uniform substitutions. CoRR Jarkko Peltomäki, Ville Salo
2017	—	`conf`	Strict Asymptotic Nilpotency in Cellular Automata. AUTOMATA Ville Salo
2016	A	`conf`	Distributed Testing of Excluded Subgraphs. DISC Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
2016	J	`jnl`	Distributed Testing of Excluded Subgraphs. CoRR Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
2016	J	`jnl`	Finite generating sets for reversible gate sets under general conservation laws. CoRR Tim Boykett, Jarkko Kari, Ville Salo
2016	J	`jnl`	PSPACE-completeness of majority automata networks. Theor. Comput. Sci. Eric Goles, Pedro Montealegre, Ville Salo, Ilkka Törmä
2016	C	`conf`	Strongly Universal Reversible Gate Sets. RC Tim Boykett, Jarkko Kari, Ville Salo
2016	J	`jnl`	Strongly Universal Reversible Gate Sets. CoRR Tim Boykett, Jarkko Kari, Ville Salo
2016	—	`conf`	The Group of Reversible Turing Machines. Automata Sebastián Barbieri, Jarkko Kari, Ville Salo
2015	J	`jnl`	A One-Dimensional Physically Universal Cellular Automaton. CoRR Ville Salo, Ilkka Törmä
2015	J	`jnl`	Category theory of symbolic dynamics. Theor. Comput. Sci. Ville Salo, Ilkka Törmä
2015	J	`jnl`	Factor Colorings of Linearly Recurrent Words. CoRR Ville Salo, Ilkka Törmä
2015	—	`conf`	Group-Walking Automata. Automata Ville Salo, Ilkka Törmä
2015	—	`conf`	Groups and Monoids of Cellular Automata. Automata Ville Salo
2015	J	`jnl`	PSPACE-Completeness of Majority Automata Networks. CoRR Eric Goles Ch., Pedro Montealegre, Ville Salo, Ilkka Törmä
2015	B	`conf`	Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. SIROCCO Jarkko Kari, Martín Matamala, Ivan Rapaport, Ville Salo
2014	J	`jnl`	Color Blind Cellular Automata. J. Cell. Autom. Ville Salo, Ilkka Törmä
2014	—	`conf`	Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2. Automata Ville Salo, Ilkka Törmä
2014	J	`jnl`	Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2. CoRR Ville Salo, Ilkka Törmä
2014	J	`jnl`	Decidability and Universality of Quasiminimal Subshifts. CoRR Ville Salo
2014	—	`conf`	Plane-Walking Automata. Automata Ville Salo, Ilkka Törmä
2014	J	`jnl`	Plane-Walking Automata. CoRR Ville Salo, Ilkka Törmä
2014	J	`jnl`	Playing with Subshifts. Fundam. Informaticae Ville Salo, Ilkka Törmä
2014	J	`jnl`	Realization problems for nonuniform cellular automata. Theor. Comput. Sci. Ville Salo
2014	C	`conf`	Trace Complexity of Chaotic Reversible Cellular Automata. RC Jarkko Kari, Ville Salo, Ilkka Törmä
2014	J	`jnl`	Trace Complexity of Chaotic Reversible Cellular Automata. CoRR Jarkko Kari, Ville Salo, Ilkka Törmä
2013	J	`jnl`	Block Maps between Primitive Uniform and Pisot Substitutions. CoRR Ville Salo, Ilkka Törmä
2013	—	`conf`	Color Blind Cellular Automata. Automata Ville Salo, Ilkka Törmä
2013	—	`conf`	Commutators of Bipermutive and Affine Cellular Automata. Automata Ville Salo, Ilkka Törmä
2013	J	`jnl`	Constructions with Countable Subshifts of Finite Type. CoRR Ville Salo, Ilkka Törmä
2013	J	`jnl`	Constructions with Countable Subshifts of Finite Type. Fundam. Informaticae Ville Salo, Ilkka Törmä
2013	J	`jnl`	Hard Asymptotic Sets for One-Dimensional Cellular Automata. CoRR Ville Salo
2013	J	`jnl`	Playing with Subshifts. CoRR Ville Salo, Ilkka Törmä
2012	J	`jnl`	A Characterization of Cellular Automata Generated by Idempotents on the Full Shift CoRR Ville Salo
2012	Misc	`conf`	A Characterization of Cellular Automata Generated by Idempotents on the Full Shift. CSR Ville Salo
2012	B	`conf`	Computational Aspects of Cellular Automata on Countable Sofic Shifts. MFCS Ville Salo, Ilkka Törmä
2012	J	`jnl`	Geometry and Dynamics of the Besicovitch and Weyl Spaces CoRR Ville Salo, Ilkka Törmä
2012	C	`conf`	Geometry and Dynamics of the Besicovitch and Weyl Spaces. Developments in Language Theory Ville Salo, Ilkka Törmä
2012	—	`conf`	On Derivatives and Subpattern Orders of Countable Subshifts AUTOMATA & JAC Ville Salo, Ilkka Törmä
2012	—	`conf`	On Nilpotency and Asymptotic Nilpotency of Cellular Automata. AUTOMATA & JAC Ville Salo
2012	C	`conf`	On Shift Spaces with Algebraic Structure. CiE Ville Salo, Ilkka Törmä
2012	J	`jnl`	On Shift Spaces with Algebraic Structure. CoRR Ville Salo, Ilkka Törmä
2012	C	`conf`	On Stable and Unstable Limit Sets of Finite Families of Cellular Automata. LATA Ville Salo, Ilkka Törmä
2012	—	`conf`	Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology AUTOMATA & JAC Ville Salo, Ilkka Törmä
2011	—	`conf`	A Survey on Picture-Walking Automata. Algebraic Foundations in Computer Science Jarkko Kari, Ville Salo