A classification of interpreter systems. - Rolf Hoffmann 001 (Microprocessing and Microprogramming, 1983)

The Cellular Processing Machine CEPRA-8L. - Rolf Hoffmann 001; Klaus-Peter Völkmann; Mark Sobolewski (Parcella, 1994)

Compilation of CDL for Different Target Architectures. - Christian Hochberger; Rolf Hoffmann 001; Stefan Waldschmidt (PaCT, 1995)

Hardware Supported Simulation Systems for Graph Based and 3-D Cellular Processing. - P. Hartmann; Christian Hochberger; Rolf Hoffmann 001; Ralf Schneider; Klaus-Peter Völkmann (ACRI, 1996)

Solving Routing Problems with Cellular Automata. - Christian Hochberger; Rolf Hoffmann 001 (ACRI, 1996)

A Mapping Strategy for Cellular Models to Different Parallel Target Architectures. - Ralf Schneider; Rolf Hoffmann 001 (Parcella, 1996)

Hardware Support for 3D Cellular Processing. - Rolf Hoffmann 001; Klaus-Peter Völkmann (PaCT, 1997)

The parallel program development environment CDL/ACL for cellular processing. - Christian Hochberger; Rolf Hoffmann 001; Ralf Schneider (J. Syst. Archit., 1998)

CDL++ for the Description of Moving Objects in Cellular Automata. - Christian Hochberger; Rolf Hoffmann 001; Stefan Waldschmidt (PaCT, 1999)

A Stream Processor Architecture Based on the Configurable CEPRA-S. - Rolf Hoffmann 001; Bernd Ulmann; Klaus-Peter Völkmann; Stefan Waldschmidt (FPL, 2000)

The Cellular Processor Architecture CEPRA-1X and Its Configuration by CDL. - Christian Hochberger; Rolf Hoffmann 001; Klaus-Peter Völkmann; Stefan Waldschmidt (IPDPS Workshops, 2000)

GCA: Global Cellular Automata. A Flexible Parallel Model. - Rolf Hoffmann 001; Klaus-Peter Völkmann; Stefan Waldschmidt; Wolfgang Heenes (PaCT, 2001)

GCA: A Massively Parallel Model. - Rolf Hoffmann 001; Klaus-Peter Völkmann; Wolfgang Heenes (IPDPS, 2003)

Optimizing the Behavior of a Moving Creature in Software and in Hardware. - Mathias Halbach; Wolfgang Heenes; Rolf Hoffmann 001; Jan Tisje (ACRI, 2004)

FPGA Implementation of Cellular Automata Compared to Software Implementation. - Mathias Halbach; Rolf Hoffmann 001; Patrick Röder (ARCS Workshops, 2004)

Implementing Cellular Automata in FPGA Logic. - Mathias Halbach; Rolf Hoffmann 001 (IPDPS, 2004)

Implementation of the Massively Parallel Model GCA. - Rolf Hoffmann 001; Wolfgang Heenes; Mathias Halbach (PARELEC, 2004)

FPGA Implementations of the Massively Parallel GCA Model. - Wolfgang Heenes; Rolf Hoffmann 001; Sebastian Kanthak (IPDPS, 2005)

Optimal Behavior of a Moving Creature in the Cellular Automata Model. - Mathias Halbach; Rolf Hoffmann 001 (PaCT, 2005)

Optimal 6-State Algorithms for the Behavior of Several Moving Creatures. - Mathias Halbach; Rolf Hoffmann 001; Lars Both (ACRI, 2006)

Are Several Creatures More Efficient Than a Single One? - Rolf Hoffmann 001; Mathias Halbach (ACRI, 2006)

Minimising the Hardware Resources for a Cellular Automaton with Moving Creatures. - Mathias Halbach; Rolf Hoffmann 001 (ARCS Workshops, 2006)

A multiprocessor architecture for the massively parallel model GCA. - Wolfgang Heenes; Rolf Hoffmann 001; Johannes Jendrsczok (IPDPS, 2006)

Solving the Exploration's Problem with Several Creatures More Efficiently. - Mathias Halbach; Rolf Hoffmann 001 (EUROCAST, 2007)

Hirschberg's Algorithm on a GCA and Its Parallel Hardware Implementation. - Johannes Jendrsczok; Rolf Hoffmann 001; Jörg Keller 001 (Euro-Par, 2007)

Implementing Hirschberg's PRAM-Algorithm for Connected Components on a Global Cellular Automaton. - Johannes Jendrsczok; Rolf Hoffmann 001; Jörg Keller 001 (IPDPS, 2007)

Parallel Hardware Architecture to Simulate Movable Creatures in the CA Model. - Mathias Halbach; Rolf Hoffmann 001 (PaCT, 2007)

Improving the Behavior of Creatures by Time-Shuffling. - Patrick Ediger; Rolf Hoffmann 001 (ACRI, 2008)

Evolving Multi-creature Systems for All-to-All Communication. - Rolf Hoffmann 001; Patrick Ediger (ACRI, 2008)

How Efficient are Creatures with Time-shuffled Behaviors? - Patrick Ediger; Rolf Hoffmann 001; Mathias Halbach (PASA, 2008)

Optimizing the creature's rule for all-to-all communication. - Patrick Ediger; Rolf Hoffmann 001 (Automata, 2008)

Is a non-uniform system of creatures more efficient than a uniform one? - Patrick Ediger; Rolf Hoffmann 001; Mathias Halbach (IPDPS, 2008)

A scalable configurable architecture for the massively parallel GCA model. - Johannes Jendrsczok; Patrick Ediger; Rolf Hoffmann 001 (IPDPS, 2008)

Generated Horizontal and Vertical Data Parallel GCA Machines for the N-Body Force Calculation. - Johannes Jendrsczok; Rolf Hoffmann 001; Thomas Lenck (ARCS, 2009)

Evolving 6-State Automata for Optimal Behaviors of Creatures Compared to Exhaustive Search. - Patrick Ediger; Rolf Hoffmann 001; Mathias Halbach (EUROCAST, 2009)

On the Effectiveness of Evolution Compared to Time-Consuming Full Search of Optimal 6-State Automata. - Marcus Komann; Patrick Ediger; Dietmar Fey; Rolf Hoffmann 001 (EuroGP, 2009)

GCA Multi-Softcore Architecture for Agent Systems Simulation. - Christian Schäck; Wolfgang Heenes; Rolf Hoffmann 001 (GI Jahrestagung, 2009)

Combining genetic algorithm with time-shuffling in order to evolve agent systems more efficiently. - Patrick Ediger; Rolf Hoffmann 001 (IPDPS, 2009)

Solving All-to-All Communication with CA Agents More Effectively with Flags. - Patrick Ediger; Rolf Hoffmann 001 (PaCT, 2009)

The GCA-w Massively Parallel Model. - Rolf Hoffmann 001 (PaCT, 2009)

A Multiprocessor Architecture with an Omega Network for the Massively Parallel Model GCA. - Christian Schäck; Wolfgang Heenes; Rolf Hoffmann 001 (SAMOS, 2009)

CA Models for Target Searching Agents. - Patrick Ediger; Rolf Hoffmann 001 (AUTOMATA, 2009)

All-to-All Communication with CA Agents by Active Coloring and Acknowledging. - Patrick Ediger; Rolf Hoffmann 001 (ACRI, 2010)

Routing Based on Evolved Agents. - Patrick Ediger; Rolf Hoffmann 001 (ARCS Workshops, 2010)

The Massively Parallel Computing Model GCA. - Rolf Hoffmann 001 (Euro-Par Workshops, 2010)

Multiprocessor Architectures Specialized for Multi-agent Simulation. - Christian Schäck; Wolfgang Heenes; Rolf Hoffmann 001 (ICNC, 2010)

Routing in the triangular grid with evolved agents. - Patrick Ediger; Rolf Hoffmann 001; Dominique Désérable (HPCS, 2010)

Evolving hybrid time-shuffled behavior of agents. - Patrick Ediger; Rolf Hoffmann 001 (IPDPS Workshops, 2010)

Efficient traffic simulation using the GCA model. - Christian Schäck; Rolf Hoffmann 001; Wolfgang Heenes (IPDPS Workshops, 2010)

Effectively Evolving Finite State Machines Compared to Enumeration. - Patrick Ediger; Rolf Hoffmann 001; Sylvia Grüner (EUROCAST (1), 2011)

Rectangular vs triangular routing with evolved agents. - Patrick Ediger; Rolf Hoffmann 001; Dominique Désérable (HPCS, 2011)

Efficient Minimal Routing in the Triangular Grid with Six Channels. - Rolf Hoffmann 001; Dominique Désérable (PaCT, 2011)

Efficient Traffic Simulation Using Agents within the Global Cellular Automata Model. - Christian Schäck; Rolf Hoffmann 001; Wolfgang Heenes (Int. J. Netw. Comput., 2011)

Specialized Multicore Architectures Supporting Efficient Multi-Agent Simulations. - Christian Schäck; Rolf Hoffmann 001; Wolfgang Heenes (Int. J. Netw. Comput., 2011)

Modeling and Simulation of a Car Race. - Rolf Hoffmann 001; Maurice Margenstern (ACRI, 2012)

Rectangular vs. triangular minimal routing and performance study. - Dominique Désérable; Rolf Hoffmann 001 (HPCS, 2012)

Efficiency Analysis of the Time-Shuffling Method for the Evolution of Agent Behavior. - Patrick Ediger; Rolf Hoffmann 001 (Int. J. Found. Comput. Sci., 2012)

Preface. - Dominique Désérable; Rolf Hoffmann 001 (J. Cell. Autom., 2012)

CA Agents for All-to-All Communication Are Faster in the Triangulate Grid. - Rolf Hoffmann 001; Dominique Désérable (PaCT, 2013)

Preface. - Dominique Désérable; Rolf Hoffmann 001; Genaro Juárez Martínez (J. Cell. Autom., 2013)

How Agents Can Form a Specific Pattern. - Rolf Hoffmann 001 (ACRI, 2014)

All-to-all communication with cellular automata agents in 2d grids: topologies, streets and performances. - Rolf Hoffmann 001; Dominique Désérable (J. Supercomput., 2014)

Hexagonal Bravais-Miller Routing by Cellular Automata Agents. - Dominique Désérable; Rolf Hoffmann 001 (PaCT, 2015)

Line Patterns Formed by Cellular Automata Agents. - Rolf Hoffmann 001; Dominique Désérable (ACRI, 2016)

Generating Maximal Domino Patterns by Cellular Automata Agents. - Rolf Hoffmann 001; Dominique Désérable (PaCT, 2017)

Cellular Automata Applications in Shortest Path Problem. - Michail-Antisthenis I. Tsompanas; Nikolaos I. Dourvas; Konstantinos Ioannidis; Georgios Ch. Sirakoulis; Rolf Hoffmann 001; Andrew Adamatzky (CoRR, 2017)

Towards Self-organizing Sensor Networks: Game-Theoretic epsilon -Learning Automata-Based Approach. - Jakub Gasior; Franciszek Seredynski; Rolf Hoffmann 001 (ACRI, 2018)

Termination and Stability Levels in Evolved CA Agents for the Black-Pattern Task. - Rolf Hoffmann 001; Dominique Désérable; Franciszek Seredynski (ACRI, 2018)

Simple Block-Substitution Rule Exhibits Interesting Patterns. - Rolf Hoffmann 001 (Reversibility and Universality, 2018)

A Probabilistic Cellular Automata Rule Forming Domino Patterns. - Rolf Hoffmann 001; Dominique Désérable; Franciszek Seredynski (PaCT, 2019)

Experiments with Heterogenous Automata-Based Multi-agent Systems. - Franciszek Seredynski; Jakub Gasior; Rolf Hoffmann 001; Dominique Désérable (PPAM (2), 2019)

On Patterns and Dynamics of Rule 22 Cellular Automaton. - Genaro J. Martínez; Andrew Adamatzky; Rolf Hoffmann 001; Dominique Désérable; Ivan Zelinka (Complex Syst., 2019)

Domino pattern formation by cellular automata agents. - Rolf Hoffmann 001; Dominique Désérable (J. Supercomput., 2019)

Covering the Space with Sensor Tiles. - Rolf Hoffmann 001; Franciszek Seredynski (ACRI, 2020)

The Second Order CA-Based Multi-agent Systems with Income Sharing. - Franciszek Seredynski; Jakub Gasior; Rolf Hoffmann 001 (ACRI, 2020)

Minimal Covering of the Space by Domino Tiles. - Rolf Hoffmann 001; Dominique Désérable; Franciszek Seredynski (PaCT, 2021)

A cellular automata rule placing a maximal number of dominoes in the square and diamond. - Rolf Hoffmann 001; Dominique Désérable; Franciszek Seredynski (J. Supercomput., 2021)

Towards Self-optimizing Sensor Networks: Game-Theoretic Second-Order CA-Based Approach. - Franciszek Seredynski; Tomasz Kulpa; Rolf Hoffmann 001; Dominique Désérable (ACRI, 2022)

Towards evolutionary self-optimization of large multi-agent systems. - Franciszek Seredynski; Tomasz Kulpa; Rolf Hoffmann 001 (GECCO Companion, 2022)

Competition and Cooperation Mechanisms for Collective Behavior in Large Multi-agent Systems. - Franciszek Seredynski; Tomasz Kulpa; Rolf Hoffmann 001 (ICCS (1), 2022)

Forming Point Patterns by a Probabilistic Cellular Automata Rule. - Rolf Hoffmann 001 (CoRR, 2022)

Global Cellular Automata GCA - A Massively Parallel Computing Model. - Rolf Hoffmann 001 (CoRR, 2022)

Cellular automata rules solving the wireless sensor network coverage problem. - Rolf Hoffmann 001; Dominique Désérable; Franciszek Seredynski (Nat. Comput., 2022)

Coverage and Lifetime Optimization by Self-Optimizing Sensor Networks. - Franciszek Seredynski; Tomasz Kulpa; Rolf Hoffmann 001; Dominique Désérable (Sensors, 2023)

Evolutionary self-optimization of large CA-based multi-agent systems. - Franciszek Seredynski; Tomasz Kulpa; Rolf Hoffmann 001 (J. Comput. Sci., 2023)

Generating Loop Patterns with a Genetic Algorithm and a Probabilistic Cellular Automata Rule. - Rolf Hoffmann 001 (Algorithms, 2023)

Pattern Formation by Collective Behavior of Competing Cellular Automata-Based Agents. - Miroslaw Szaban; Michal Seredynski; Rolf Hoffmann 001; Dominique Désérable; Franciszek Seredynski (ACRI, 2024)

Loop Patterns Formed by Cellular Automata. - Rolf Hoffmann 001; Mariusz Bialecki (Advances in Cellular Automata - Volume 1: Theory (1), 2025)

Touching Loops and Worms Formed by Cellular Automata. - Rolf Hoffmann 001 (ASCAT, 2025)

Optimizing Wealth by a Game within Cellular Automata. - Rolf Hoffmann 001; Franciszek Seredynski; Dominique Désérable (CoRR, 2025)