Thomas Worsch - RankMe

61 papers B 3C 2Journal 25Unranked 22

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences. CoRR Eric Goles, Augusto Modanese, Martín Ríos-Wilson, Domingo Ruiz-Tala, Thomas Worsch
2024	J	`jnl`	Embedding Arbitrary Boolean Circuits into Fungal Automata. Algorithmica Augusto Modanese, Thomas Worsch
2022	B	`conf`	Embedding Arbitrary Boolean Circuits into Fungal Automata. LATIN Augusto Modanese, Thomas Worsch
2022	J	`jnl`	Embedding arbitrary Boolean circuits into fungal automata. CoRR Augusto Modanese, Thomas Worsch
2021	J	`jnl`	A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds. Acta Informatica Thomas Worsch
2020	J	`jnl`	A faster algorithm for the FSSP in one-dimensional CA with multiple speeds. CoRR Thomas Worsch
2020	J	`jnl`	Self-Verifying Cellular Automata. J. Cell. Autom. Martin Kutrib, Thomas Worsch
2020	J	`jnl`	Sequentializing cellular automata. Nat. Comput. Jarkko Kari, Ville Salo, Thomas Worsch
2019	—	`conf`	Iterative Arrays with Self-verifying Communication Cell. Automata Martin Kutrib, Thomas Worsch
2018	—	`conf`	Self-verifying Cellular Automata. ACRI Martin Kutrib, Thomas Worsch
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
2016	—	`conf`	Shrinking and Expanding Cellular Automata. Automata Augusto Modanese, Thomas Worsch
2015	J	`jnl`	Foreword: asynchronous behavior of cellular automata and discrete models. Nat. Comput. Alberto Dennunzio, Enrico Formenti, Giancarlo Mauri, Thomas Worsch
2014	C	`conf`	Degrees of Reversibility for DFA and DPDA. RC Martin Kutrib, Thomas Worsch
2013	J	`jnl`	On Completeness and Decidability of Phase Space Invertible Asynchronous Cellular Automata. Fundam. Informaticae Simon Wacker, Thomas Worsch
2013	—	`conf`	Simulations between Asynchronous Cellular Automata for the Standardization of Their Set of States and Their Neighborhood. CANDAR Thomas Worsch
2013	C	`conf`	Time-Symmetric Machines. RC Martin Kutrib, Thomas Worsch
2013	J	`jnl`	Towards intrinsically universal asynchronous CA. Nat. Comput. Thomas Worsch
2012	—	`conf`	(Intrinsically?) Universal Asynchronous CA. ACRI Thomas Worsch
2012	—	`conf`	A 3-State Asynchronous CA for the Simulation of Delay-Insensitive Circuits. ACRI Oliver Schneider, Thomas Worsch
2012	—	`conf`	Phase Space Invertible Asynchronous Cellular Automata AUTOMATA & JAC Simon Wacker, Thomas Worsch
2010	—	`ed.`	Automata 2010 - 16th Intl. Workshop on CA and DCS, Nancy, France, June 14-16, 2010 Automata Nazim Fatès, Jarkko Kari, Thomas Worsch
2010	J	`jnl`	Changing the Neighborhood of Cellular Automata: Local Structure, Equivalence and Isomorphism. J. Cell. Autom. Hidenosuke Nishio, Thomas Worsch
2010	J	`jnl`	Real-Time Sorting of Binary Numbers on One-Dimensional CA CoRR Thomas Worsch, Hidenosuke Nishio
2010	—	`conf`	Real-time Sorting of Binary Numbers on One-dimensional CA. JAC Thomas Worsch, Hidenosuke Nishio
2009	J	`jnl`	Achieving Universality of CA by Changing the Neighborhood. J. Cell. Autom. Thomas Worsch, Hidenosuke Nishio
2009	—	`ch.`	Cellular Automata as Models of Parallel Computation. Encyclopedia of Complexity and Systems Science Thomas Worsch
2008	—	`ed.`	Automata 2008: Theory and Applications of Cellular Automata, Bristol, UK, June 12-14, 2008 Andrew Adamatzky, Ramón Alonso-Sanz, Anna T. Lawniczak, Genaro Juárez Martínez, Kenichi Morita, Thomas Worsch
2008	—	`conf`	Cellular automata with dynamically reconfigurable buses. Automata Thomas Worsch
2008	—	`conf`	Changing Neighborhoods of CA: Reduced Local Structures and Embeddings for Universality. ACRI Thomas Worsch, Hidenosuke Nishio
2008	—	`conf`	Changing the neighborhood of CA: local structure, equivalence and reversibility. Automata Hidenosuke Nishio, Thomas Worsch
2008	—	`ch.`	Doing IO with MPI and Benchmarking It with SKaMPI-5. High Performance Computing in Science and Engineering Joachim Mathes, Argirios Perogiannakis, Thomas Worsch
2007	—	`conf`	Variations on Neighborhoods in CA. EUROCAST Thomas Worsch, Hidenosuke Nishio
2006	—	`ch.`	Benchmarking MPI One-sided Communication with SKaMPI-5. High Performance Computing in Science and Engineering Werner Augustin, Marc-Oliver Straub, Thomas Worsch
2006	J	`jnl`	Editorial. J. Cell. Autom. Thomas Worsch
2005	—	`conf`	Benchmarking One-Sided Communication with SKaMPI 5. PVM/MPI Werner Augustin, Marc-Oliver Straub, Thomas Worsch
2004	—	`conf`	Efficient Simulation of CA with Few Activities. ACRI Richard Walter, Thomas Worsch
2004	—	`conf`	The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA. IFIP TCS Hubert Schmid, Thomas Worsch
2003	J	`jnl`	Simulations Between Cellular Automata on Trees Extended by Horizontal Edges. Fundam. Informaticae Thomas Worsch
2003	—	`conf`	Usefulness and Usage of SKaMPI-Bench. PVM/MPI Werner Augustin, Thomas Worsch
2002	J	`jnl`	Cellular Automata: Energy Consumption and Physical Feasibility. Fundam. Informaticae Peter Sanders, Roland Vollmar, Thomas Worsch
2002	J	`jnl`	Formal language recognition by stochastic cellular automata. Fundam. Informaticae Daniel Merkle, Thomas Worsch
2002	J	`jnl`	Leader election in d-dimensional CA in time diam log(diam). Future Gener. Comput. Syst. Michael Stratmann, Thomas Worsch
2002	—	`conf`	On Benchmarking Collective MPI Operations. PVM/MPI Thomas Worsch, Ralf H. Reussner, Werner Augustin
2001	J	`jnl`	A perimeter-time CA for the queen bee problem. Parallel Comput. Andreas Beckers, Thomas Worsch
2000	B	`conf`	Linear Time Language Recognition on Cellular Automata with Restricted Communication. LATIN Thomas Worsch
2000	—	`ed.`	Theoretical and Practical Issues on Cellular Automata, Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry, Karlsruhe, 4-6 October 2000 ACRI Stefania Bandini, Thomas Worsch
1999	B	`conf`	Cellular Automata with Dynamically Reconfigurable Buses. SOFSEM Thomas Worsch
1999	J	`jnl`	Parallel Turing Machines with One-Head Control Units and Cellular Automata. Theor. Comput. Sci. Thomas Worsch
1999	J	`jnl`	Simulation of cellular automata. Future Gener. Comput. Syst. Thomas Worsch
1997	—	`conf`	Feasible Models of Computation: Three-Dimensionality and Energy Consumption. Euro-Par Peter Sanders, Roland Vollmar, Thomas Worsch
1997	J	`jnl`	Introduction to the Special Issue on Cellular Automata. Parallel Comput. Martin Kutrib, Roland Vollmar, Thomas Worsch
1997	J	`jnl`	On Parallel Turing Machines with Multi-Head Control Units. Parallel Comput. Thomas Worsch
1997	—	`book`	Parallele Programmierung mit MPI - ein Praktikum, Programmtexte im Internet. Peter Sanders, Thomas Worsch
1996	—	`conf`	On Relations between Arrays of Processing Elements of Different Dimensionality. Parcella Alf-Christian Achilles, Martin Kutrib, Thomas Worsch
1996	—	`conf`	Programming Environments for Cellular Automata. ACRI Thomas Worsch
1995	—	`book`	Modelle der Parallelverarbeitung - eine Einführung. Roland Vollmar, Thomas Worsch
1994	—	`conf`	Investigation of Different Input Modes for Cellular Automata. Parcella Martin Kutrib, Thomas Worsch
1992	J	`jnl`	On the power of global-bus in mesh-connected architectures. Future Gener. Comput. Syst. Hiroshi Umeo, Thomas Worsch, Roland Vollmar
1990	—	`—`	Komplexitätstheoretische Untersuchungen an myopischen Polyautomaten. Thomas Worsch