Komplexitätstheoretische Untersuchungen an myopischen Polyautomaten. - Thomas Worsch (1990)

On the power of global-bus in mesh-connected architectures. - Hiroshi Umeo; Thomas Worsch; Roland Vollmar (Future Gener. Comput. Syst., 1992)

Investigation of Different Input Modes for Cellular Automata. - Martin Kutrib; Thomas Worsch (Parcella, 1994)

Modelle der Parallelverarbeitung - eine Einführung. - Roland Vollmar; Thomas Worsch (Teubner, 1995)

Programming Environments for Cellular Automata. - Thomas Worsch (ACRI, 1996)

On Relations between Arrays of Processing Elements of Different Dimensionality. - Alf-Christian Achilles; Martin Kutrib; Thomas Worsch (Parcella, 1996)

Parallele Programmierung mit MPI - ein Praktikum, Programmtexte im Internet. - Peter Sanders 001; Thomas Worsch (Logos Verlag, 1997)

Feasible Models of Computation: Three-Dimensionality and Energy Consumption. - Peter Sanders 001; Roland Vollmar; Thomas Worsch (Euro-Par, 1997)

Introduction to the Special Issue on Cellular Automata. - Martin Kutrib; Roland Vollmar; Thomas Worsch (Parallel Comput., 1997)

On Parallel Turing Machines with Multi-Head Control Units. - Thomas Worsch (Parallel Comput., 1997)

Cellular Automata with Dynamically Reconfigurable Buses. - Thomas Worsch (SOFSEM, 1999)

Simulation of cellular automata. - Thomas Worsch (Future Gener. Comput. Syst., 1999)

Parallel Turing Machines with One-Head Control Units and Cellular Automata. - Thomas Worsch (Theor. Comput. Sci., 1999)

Linear Time Language Recognition on Cellular Automata with Restricted Communication. - Thomas Worsch (LATIN, 2000)

A perimeter-time CA for the queen bee problem. - Andreas Beckers; Thomas Worsch (Parallel Comput., 2001)

On Benchmarking Collective MPI Operations. - Thomas Worsch; Ralf H. Reussner; Werner Augustin (PVM/MPI, 2002)

Leader election in d-dimensional CA in time diam log(diam). - Michael Stratmann; Thomas Worsch (Future Gener. Comput. Syst., 2002)

Formal language recognition by stochastic cellular automata. - Daniel Merkle; Thomas Worsch (Fundam. Informaticae, 2002)

Cellular Automata: Energy Consumption and Physical Feasibility. - Peter Sanders 001; Roland Vollmar; Thomas Worsch (Fundam. Informaticae, 2002)

Usefulness and Usage of SKaMPI-Bench. - Werner Augustin; Thomas Worsch (PVM/MPI, 2003)

Simulations Between Cellular Automata on Trees Extended by Horizontal Edges. - Thomas Worsch (Fundam. Informaticae, 2003)

Efficient Simulation of CA with Few Activities. - Richard Walter; Thomas Worsch (ACRI, 2004)

The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA. - Hubert Schmid; Thomas Worsch (IFIP TCS, 2004)

Benchmarking One-Sided Communication with SKaMPI 5. - Werner Augustin; Marc-Oliver Straub; Thomas Worsch (PVM/MPI, 2005)

Benchmarking MPI One-sided Communication with SKaMPI-5. - Werner Augustin; Marc-Oliver Straub; Thomas Worsch (High Performance Computing in Science and Engineering, 2006)

Editorial. - Thomas Worsch (J. Cell. Autom., 2006)

Variations on Neighborhoods in CA. - Thomas Worsch; Hidenosuke Nishio (EUROCAST, 2007)

Doing IO with MPI and Benchmarking It with SKaMPI-5. - Joachim Mathes; Argirios Perogiannakis; Thomas Worsch (High Performance Computing in Science and Engineering, 2008)

Changing Neighborhoods of CA: Reduced Local Structures and Embeddings for Universality. - Thomas Worsch; Hidenosuke Nishio (ACRI, 2008)

Changing the neighborhood of CA: local structure, equivalence and reversibility. - Hidenosuke Nishio; Thomas Worsch (Automata, 2008)

Achieving Universality of CA by Changing the Neighborhood. - Thomas Worsch; Hidenosuke Nishio (J. Cell. Autom., 2009)

Cellular Automata as Models of Parallel Computation. - Thomas Worsch (Encyclopedia of Complexity and Systems Science, 2009)

Real-time Sorting of Binary Numbers on One-dimensional CA. - Thomas Worsch; Hidenosuke Nishio (JAC, 2010)

Changing the Neighborhood of Cellular Automata: Local Structure, Equivalence and Isomorphism. - Hidenosuke Nishio; Thomas Worsch (J. Cell. Autom., 2010)

A 3-State Asynchronous CA for the Simulation of Delay-Insensitive Circuits. - Oliver Schneider 003; Thomas Worsch (ACRI, 2012)

(Intrinsically?) Universal Asynchronous CA. - Thomas Worsch (ACRI, 2012)

Phase Space Invertible Asynchronous Cellular Automata - Simon Wacker; Thomas Worsch (AUTOMATA & JAC, 2012)

Simulations between Asynchronous Cellular Automata for the Standardization of Their Set of States and Their Neighborhood. - Thomas Worsch (CANDAR, 2013)

Time-Symmetric Machines. - Martin Kutrib; Thomas Worsch (RC, 2013)

On Completeness and Decidability of Phase Space Invertible Asynchronous Cellular Automata. - Simon Wacker; Thomas Worsch (Fundam. Informaticae, 2013)

Towards intrinsically universal asynchronous CA. - Thomas Worsch (Nat. Comput., 2013)

Degrees of Reversibility for DFA and DPDA. - Martin Kutrib; Thomas Worsch (RC, 2014)

Foreword: asynchronous behavior of cellular automata and discrete models. - Alberto Dennunzio; Enrico Formenti; Giancarlo Mauri; Thomas Worsch (Nat. Comput., 2015)

Shrinking and Expanding Cellular Automata. - Augusto Modanese; Thomas Worsch (Automata, 2016)

Iterative Arrays with Self-verifying Communication Cell. - Martin Kutrib; Thomas Worsch (Automata, 2019)

A faster algorithm for the FSSP in one-dimensional CA with multiple speeds. - Thomas Worsch (CoRR, 2020)

Self-Verifying Cellular Automata. - Martin Kutrib; Thomas Worsch (J. Cell. Autom., 2020)

Sequentializing cellular automata. - Jarkko Kari; Ville Salo; Thomas Worsch (Nat. Comput., 2020)

A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds. - Thomas Worsch (Acta Informatica, 2021)

Embedding Arbitrary Boolean Circuits into Fungal Automata. - Augusto Modanese; Thomas Worsch (Algorithmica, 2024)