Thomas Worsch

According to our database, Thomas Worsch authored at least 50 papers between 1990 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Embedding Arbitrary Boolean Circuits into Fungal Automata.

Augusto Modanese, Thomas Worsch

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds.

Thomas Worsch

Acta Informatica, 2021

2020

Sequentializing cellular automata.

Jarkko Kari, Ville Salo, Thomas Worsch

Nat. Comput., 2020

Self-Verifying Cellular Automata.

Martin Kutrib, Thomas Worsch

J. Cell. Autom., 2020

A faster algorithm for the FSSP in one-dimensional CA with multiple speeds.

Thomas Worsch

CoRR, 2020

2019

Iterative Arrays with Self-verifying Communication Cell.

Martin Kutrib, Thomas Worsch

Proceedings of the Cellular Automata and Discrete Complex Systems, 2019

2016

Shrinking and Expanding Cellular Automata.

Augusto Modanese, Thomas Worsch

Proceedings of the Cellular Automata and Discrete Complex Systems, 2016

2015

Foreword: asynchronous behavior of cellular automata and discrete models.

Alberto Dennunzio, Enrico Formenti, Giancarlo Mauri, Thomas Worsch

Nat. Comput., 2015

2014

Degrees of Reversibility for DFA and DPDA.

Martin Kutrib, Thomas Worsch

Proceedings of the Reversible Computation - 6th International Conference, 2014

2013

Towards intrinsically universal asynchronous CA.

Thomas Worsch

Nat. Comput., 2013

On Completeness and Decidability of Phase Space Invertible Asynchronous Cellular Automata.

Simon Wacker, Thomas Worsch

Fundam. Informaticae, 2013

Time-Symmetric Machines.

Martin Kutrib, Thomas Worsch

Proceedings of the Reversible Computation - 5th International Conference, 2013

Simulations between Asynchronous Cellular Automata for the Standardization of Their Set of States and Their Neighborhood.

Thomas Worsch

Proceedings of the First International Symposium on Computing and Networking, 2013

2012

Phase Space Invertible Asynchronous Cellular Automata

Simon Wacker, Thomas Worsch

Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

(Intrinsically?) Universal Asynchronous CA.

Thomas Worsch

Proceedings of the Cellular Automata, 2012

A 3-State Asynchronous CA for the Simulation of Delay-Insensitive Circuits.

Oliver Schneider, Thomas Worsch

Proceedings of the Cellular Automata, 2012

2010

Changing the Neighborhood of Cellular Automata: Local Structure, Equivalence and Isomorphism.

Hidenosuke Nishio, Thomas Worsch

J. Cell. Autom., 2010

Real-time Sorting of Binary Numbers on One-dimensional CA.

Thomas Worsch, Hidenosuke Nishio

Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

2009

Cellular Automata as Models of Parallel Computation.

Thomas Worsch

Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Achieving Universality of CA by Changing the Neighborhood.

Thomas Worsch, Hidenosuke Nishio

J. Cell. Autom., 2009

2008

Cellular automata with dynamically reconfigurable buses.

Thomas Worsch

Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

Changing the neighborhood of CA: local structure, equivalence and reversibility.

Hidenosuke Nishio, Thomas Worsch

Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

Changing Neighborhoods of CA: Reduced Local Structures and Embeddings for Universality.

Thomas Worsch, Hidenosuke Nishio

Proceedings of the Cellular Automata, 2008

Doing IO with MPI and Benchmarking It with SKaMPI-5.

Joachim Mathes, Argirios Perogiannakis, Thomas Worsch

Proceedings of the High Performance Computing in Science and Engineering '08, 2008

2007

Variations on Neighborhoods in CA.

Thomas Worsch, Hidenosuke Nishio

Proceedings of the Computer Aided Systems Theory, 2007

2006

Editorial.

Thomas Worsch

J. Cell. Autom., 2006

Benchmarking MPI One-sided Communication with SKaMPI-5.

Werner Augustin, Marc-Oliver Straub, Thomas Worsch

Proceedings of the High Performance Computing in Science and Engineering, 2006

2005

Benchmarking One-Sided Communication with SKaMPI 5.

Werner Augustin, Marc-Oliver Straub, Thomas Worsch

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2005

2004

The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA.

Hubert Schmid, Thomas Worsch

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Efficient Simulation of CA with Few Activities.

Richard Walter, Thomas Worsch

Proceedings of the Cellular Automata, 2004

2003

Simulations Between Cellular Automata on Trees Extended by Horizontal Edges.

Thomas Worsch

Fundam. Informaticae, 2003

Usefulness and Usage of SKaMPI-Bench.

Werner Augustin, Thomas Worsch

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface,10th European PVM/MPI Users' Group Meeting, Venice, Italy, September 29, 2003

2002

Cellular Automata: Energy Consumption and Physical Feasibility.

Peter Sanders, Roland Vollmar, Thomas Worsch

Fundam. Informaticae, 2002

Formal language recognition by stochastic cellular automata.

Daniel Merkle, Thomas Worsch

Fundam. Informaticae, 2002

Leader election in d-dimensional CA in time diam log(diam).

Michael Stratmann, Thomas Worsch

Future Gener. Comput. Syst., 2002

On Benchmarking Collective MPI Operations.

Thomas Worsch, Ralf H. Reussner, Werner Augustin

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 9th European PVM/MPI Users' Group Meeting, Linz, Austria, September 29, 2002

2001

A perimeter-time CA for the queen bee problem.

Andreas Beckers, Thomas Worsch

Parallel Comput., 2001

2000

Linear Time Language Recognition on Cellular Automata with Restricted Communication.

Thomas Worsch

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Parallel Turing Machines with One-Head Control Units and Cellular Automata.

Thomas Worsch

Theor. Comput. Sci., 1999

Simulation of cellular automata.

Thomas Worsch

Future Gener. Comput. Syst., 1999

1997

On Parallel Turing Machines with Multi-Head Control Units.

Thomas Worsch

Parallel Comput., 1997

Introduction to the Special Issue on Cellular Automata.

Martin Kutrib, Roland Vollmar, Thomas Worsch

Parallel Comput., 1997

Feasible Models of Computation: Three-Dimensionality and Energy Consumption.

Peter Sanders, Roland Vollmar, Thomas Worsch

Proceedings of the Euro-Par '97 Parallel Processing, 1997

Parallele Programmierung mit MPI - ein Praktikum, Programmtexte im Internet.

Peter Sanders, Thomas Worsch

Logos Verlag, ISBN: 978-3-931216-76-4, 1997

1996

On Relations between Arrays of Processing Elements of Different Dimensionality.

Alf-Christian Achilles, Martin Kutrib, Thomas Worsch

Proceedings of the Parcella 1996, 1996

Programming Environments for Cellular Automata.

Thomas Worsch

Proceedings of the ACRI '96, 1996

1995

Modelle der Parallelverarbeitung - eine Einführung.

Roland Vollmar, Thomas Worsch

Leitfaeden der Informatik, Teubner, ISBN: 978-3-519-02138-4, 1995

1994

Investigation of Different Input Modes for Cellular Automata.

Martin Kutrib, Thomas Worsch

Proceedings of the Parcella 1994, 1994

1992

On the power of global-bus in mesh-connected architectures.

Hiroshi Umeo, Thomas Worsch, Roland Vollmar

Future Gener. Comput. Syst., 1992

1990

Komplexitätstheoretische Untersuchungen an myopischen Polyautomaten.

Thomas Worsch

PhD thesis, 1990