default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRolf Hoffmann 0001
Person information
- affiliation (since 1978): Technical University Darmstadt, Germany
- affiliation (1975 - 1978): Heinrich-Hertz-Institut of Berlin, Germany
- affiliation (former): Technical University of Berlin, Germany
Other persons with the same name
- Rolf Hoffmann — disambiguation page
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2020 – today
- 2025
[c69]Rolf Hoffmann
:
Touching Loops and Worms Formed by Cellular Automata. ASCAT 2025: 165-178- [p2]Rolf Hoffmann, Mariusz Bialecki:
Loop Patterns Formed by Cellular Automata. Advances in Cellular Automata - Volume 1: Theory (1) 2025: 237-265 - [i5]Rolf Hoffmann, Franciszek Seredynski, Dominique Désérable:
Optimizing Wealth by a Game within Cellular Automata. CoRR abs/2502.05246 (2025) - 2024
- [c68]Miroslaw Szaban, Michal Seredynski, Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
Pattern Formation by Collective Behavior of Competing Cellular Automata-Based Agents. ACRI 2024: 34-44 - 2023
- [j22]Rolf Hoffmann:
Generating Loop Patterns with a Genetic Algorithm and a Probabilistic Cellular Automata Rule. Algorithms 16(7): 352 (2023) - [j21]Franciszek Seredynski, Tomasz Kulpa, Rolf Hoffmann:
Evolutionary self-optimization of large CA-based multi-agent systems. J. Comput. Sci. 68: 101994 (2023) - [j20]Franciszek Seredynski, Tomasz Kulpa, Rolf Hoffmann, Dominique Désérable:
Coverage and Lifetime Optimization by Self-Optimizing Sensor Networks. Sensors 23(8): 3930 (2023) - 2022
- [j19]Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
Cellular automata rules solving the wireless sensor network coverage problem. Nat. Comput. 21(3): 417-447 (2022) - [c67]Franciszek Seredynski, Tomasz Kulpa, Rolf Hoffmann, Dominique Désérable:
Towards Self-optimizing Sensor Networks: Game-Theoretic Second-Order CA-Based Approach. ACRI 2022: 208-219 - [c66]Franciszek Seredynski, Tomasz Kulpa, Rolf Hoffmann:
Towards evolutionary self-optimization of large multi-agent systems. GECCO Companion 2022: 200-203 - [c65]Franciszek Seredynski, Tomasz Kulpa, Rolf Hoffmann:
Competition and Cooperation Mechanisms for Collective Behavior in Large Multi-agent Systems. ICCS (1) 2022: 610-623 - [i4]Rolf Hoffmann:
Forming Point Patterns by a Probabilistic Cellular Automata Rule. CoRR abs/2202.06656 (2022) - [i3]Rolf Hoffmann:
Global Cellular Automata GCA - A Massively Parallel Computing Model. CoRR abs/2207.04885 (2022) - 2021
- [j18]Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
A cellular automata rule placing a maximal number of dominoes in the square and diamond. J. Supercomput. 77(8): 9069-9087 (2021) - [c64]Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
Minimal Covering of the Space by Domino Tiles. PaCT 2021: 453-465 - 2020
- [c63]Franciszek Seredynski, Jakub Gasior, Rolf Hoffmann:
The Second Order CA-Based Multi-agent Systems with Income Sharing. ACRI 2020: 134-145 - [c62]Rolf Hoffmann, Franciszek Seredynski:
Covering the Space with Sensor Tiles. ACRI 2020: 156-168 - [i2]Genaro J. Martínez, Andrew Adamatzky, Rolf Hoffmann, Dominique Désérable, Ivan Zelinka:
On patterns and dynamics of Rule 22 cellular automaton. CoRR abs/2005.01480 (2020)
2010 – 2019
- 2019
- [j17]Genaro J. Martínez, Andrew Adamatzky, Rolf Hoffmann, Dominique Désérable, Ivan Zelinka:
On Patterns and Dynamics of Rule 22 Cellular Automaton. Complex Syst. 28(2) (2019) - [j16]Rolf Hoffmann, Dominique Désérable:
Domino pattern formation by cellular automata agents. J. Supercomput. 75(12): 7799-7813 (2019) - [c61]Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
A Probabilistic Cellular Automata Rule Forming Domino Patterns. PaCT 2019: 334-344 - [c60]Franciszek Seredynski, Jakub Gasior, Rolf Hoffmann, Dominique Désérable:
Experiments with Heterogenous Automata-Based Multi-agent Systems. PPAM (2) 2019: 433-444 - 2018
- [c59]Jakub Gasior, Franciszek Seredynski, Rolf Hoffmann:
Towards Self-organizing Sensor Networks: Game-Theoretic \epsilon -Learning Automata-Based Approach. ACRI 2018: 125-136 - [c58]Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
Termination and Stability Levels in Evolved CA Agents for the Black-Pattern Task. ACRI 2018: 137-145 - [p1]Rolf Hoffmann:
Simple Block-Substitution Rule Exhibits Interesting Patterns. Reversibility and Universality 2018: 463-479 - 2017
- [c57]Rolf Hoffmann, Dominique Désérable:
Generating Maximal Domino Patterns by Cellular Automata Agents. PaCT 2017: 18-31 - [i1]Michail-Antisthenis I. Tsompanas, Nikolaos I. Dourvas, Konstantinos Ioannidis, Georgios Ch. Sirakoulis, Rolf Hoffmann, Andrew Adamatzky:
Cellular Automata Applications in Shortest Path Problem. CoRR abs/1712.05202 (2017) - 2016
- [j15]Dominique Désérable, Rolf Hoffmann, Genaro Juárez Martínez:
Preface. J. Cell. Autom. 11(1): 1-3 (2016) - [j14]Dominique Désérable, Rolf Hoffmann:
Rectangular vs. Triangular Minimal Routing and Performance Study. J. Cell. Autom. 11(1): 47-61 (2016) - [c56]Rolf Hoffmann, Dominique Désérable:
Line Patterns Formed by Cellular Automata Agents. ACRI 2016: 424-434 - 2015
- [c55]Dominique Désérable, Rolf Hoffmann:
Hexagonal Bravais-Miller Routing by Cellular Automata Agents. PaCT 2015: 164-178 - 2014
- [j13]Rolf Hoffmann, Dominique Désérable:
All-to-all communication with cellular automata agents in 2d grids: topologies, streets and performances. J. Supercomput. 69(1): 70-80 (2014) - [c54]Rolf Hoffmann:
How Agents Can Form a Specific Pattern. ACRI 2014: 660-669 - 2013
- [j12]Dominique Désérable, Rolf Hoffmann, Genaro Juárez Martínez:
Preface. J. Cell. Autom. 8(1-2): 1-3 (2013) - [j11]Patrick Ediger, Rolf Hoffmann, Dominique Désérable:
Rectangular vs Triangular Routing with Evolved Agents. J. Cell. Autom. 8(1-2): 73-89 (2013) - [j10]Rolf Hoffmann, Maurice Margenstern:
Modeling and Simulation of a Car Race. J. Cell. Autom. 8(5-6): 443-456 (2013) - [c53]Rolf Hoffmann, Dominique Désérable:
CA Agents for All-to-All Communication Are Faster in the Triangulate Grid. PaCT 2013: 316-329 - 2012
- [j9]Patrick Ediger, Rolf Hoffmann:
Efficiency Analysis of the Time-Shuffling Method for the Evolution of Agent Behavior. Int. J. Found. Comput. Sci. 23(2): 523-542 (2012) - [j8]Dominique Désérable, Rolf Hoffmann:
Preface. J. Cell. Autom. 7(1): 1-3 (2012) - [j7]Patrick Ediger, Rolf Hoffmann, Dominique Désérable:
Routing in the Triangular Grid with Evolved Agents. J. Cell. Autom. 7(1): 47-65 (2012) - [c52]Rolf Hoffmann, Maurice Margenstern:
Modeling and Simulation of a Car Race. ACRI 2012: 785-794 - [c51]Dominique Désérable, Rolf Hoffmann:
Rectangular vs. triangular minimal routing and performance study. HPCS 2012: 231-237 - 2011
- [j6]Christian Schäck, Rolf Hoffmann, Wolfgang Heenes:
Efficient Traffic Simulation Using Agents within the Global Cellular Automata Model. Int. J. Netw. Comput. 1(1): 2-20 (2011) - [j5]Christian Schäck, Rolf Hoffmann, Wolfgang Heenes:
Specialized Multicore Architectures Supporting Efficient Multi-Agent Simulations. Int. J. Netw. Comput. 1(2): 191-210 (2011) - [c50]Patrick Ediger, Rolf Hoffmann, Sylvia Grüner:
Effectively Evolving Finite State Machines Compared to Enumeration. EUROCAST (1) 2011: 303-310 - [c49]Patrick Ediger, Rolf Hoffmann, Dominique Désérable:
Rectangular vs triangular routing with evolved agents. HPCS 2011: 787-793 - [c48]Rolf Hoffmann, Dominique Désérable:
Efficient Minimal Routing in the Triangular Grid with Six Channels. PaCT 2011: 152-165 - 2010
- [c47]Patrick Ediger, Rolf Hoffmann:
All-to-All Communication with CA Agents by Active Coloring and Acknowledging. ACRI 2010: 24-34 - [c46]Patrick Ediger, Rolf Hoffmann:
Routing Based on Evolved Agents. ARCS Workshops 2010: 45-54 - [c45]Rolf Hoffmann:
The Massively Parallel Computing Model GCA. Euro-Par Workshops 2010: 77-84 - [c44]Christian Schäck, Wolfgang Heenes, Rolf Hoffmann:
Multiprocessor Architectures Specialized for Multi-agent Simulation. ICNC 2010: 232-236 - [c43]Patrick Ediger, Rolf Hoffmann, Dominique Désérable:
Routing in the triangular grid with evolved agents. HPCS 2010: 582-590 - [c42]Patrick Ediger, Rolf Hoffmann:
Evolving hybrid time-shuffled behavior of agents. IPDPS Workshops 2010: 1-8 - [c41]Christian Schäck, Rolf Hoffmann, Wolfgang Heenes:
Efficient traffic simulation using the GCA model. IPDPS Workshops 2010: 1-7
2000 – 2009
- 2009
- [j4]Johannes Jendrsczok, Patrick Ediger, Rolf Hoffmann:
A scalable configurable architecture for the massively parallel GCA model. Int. J. Parallel Emergent Distributed Syst. 24(4): 275-291 (2009) - [c40]Johannes Jendrsczok, Rolf Hoffmann, Thomas Lenck:
Generated Horizontal and Vertical Data Parallel GCA Machines for the N-Body Force Calculation. ARCS 2009: 96-107 - [c39]Patrick Ediger, Rolf Hoffmann, Mathias Halbach:
Evolving 6-State Automata for Optimal Behaviors of Creatures Compared to Exhaustive Search. EUROCAST 2009: 689-696 - [c38]Marcus Komann, Patrick Ediger, Dietmar Fey, Rolf Hoffmann:
On the Effectiveness of Evolution Compared to Time-Consuming Full Search of Optimal 6-State Automata. EuroGP 2009: 280-291 - [c37]Christian Schäck, Wolfgang Heenes, Rolf Hoffmann:
GCA Multi-Softcore Architecture for Agent Systems Simulation. GI Jahrestagung 2009: 2268-2282 - [c36]Patrick Ediger, Rolf Hoffmann:
Combining genetic algorithm with time-shuffling in order to evolve agent systems more efficiently. IPDPS 2009: 1-8 - [c35]Patrick Ediger, Rolf Hoffmann:
Solving All-to-All Communication with CA Agents More Effectively with Flags. PaCT 2009: 182-193 - [c34]Rolf Hoffmann:
The GCA-w Massively Parallel Model. PaCT 2009: 194-206 - [c33]Christian Schäck, Wolfgang Heenes, Rolf Hoffmann:
A Multiprocessor Architecture with an Omega Network for the Massively Parallel Model GCA. SAMOS 2009: 98-107 - [c32]Patrick Ediger, Rolf Hoffmann:
CA Models for Target Searching Agents. AUTOMATA 2009: 41-54 - 2008
- [j3]Johannes Jendrsczok, Rolf Hoffmann, Jörg Keller:
Implementing Hirschberg's PRAM-Algorithm for Connected Components on a Global Cellular Automaton. Int. J. Found. Comput. Sci. 19(6): 1299-1316 (2008) - [c31]Patrick Ediger, Rolf Hoffmann:
Improving the Behavior of Creatures by Time-Shuffling. ACRI 2008: 345-353 - [c30]Rolf Hoffmann, Patrick Ediger:
Evolving Multi-creature Systems for All-to-All Communication. ACRI 2008: 550-554 - [c29]Patrick Ediger, Rolf Hoffmann, Mathias Halbach:
How Efficient are Creatures with Time-shuffled Behaviors? PASA 2008: 93-103 - [c28]Patrick Ediger, Rolf Hoffmann:
Optimizing the creature's rule for all-to-all communication. Automata 2008: 398-412 - [c27]Patrick Ediger, Rolf Hoffmann, Mathias Halbach:
Is a non-uniform system of creatures more efficient than a uniform one? IPDPS 2008: 1-8 - [c26]Johannes Jendrsczok, Patrick Ediger, Rolf Hoffmann:
A scalable configurable architecture for the massively parallel GCA model. IPDPS 2008: 1-8 - [e1]Wolfgang E. Nagel, Rolf Hoffmann, Andreas Koch:
9th Workshop on Parallel Systems and Algorithms (PASA) held at the 21st Conference on the Architecture of Computing Systems (ARCS), February 26th, 2008, in Dresden, Germany. LNI P-124, GI 2008, ISBN 978-3-88579-218-5 [contents] - 2007
- [c25]Mathias Halbach, Rolf Hoffmann:
Solving the Exploration's Problem with Several Creatures More Efficiently. EUROCAST 2007: 596-603 - [c24]Johannes Jendrsczok, Rolf Hoffmann, Jörg Keller:
Hirschberg's Algorithm on a GCA and Its Parallel Hardware Implementation. Euro-Par 2007: 815-824 - [c23]Johannes Jendrsczok, Rolf Hoffmann, Jörg Keller:
Implementing Hirschberg's PRAM-Algorithm for Connected Components on a Global Cellular Automaton. IPDPS 2007: 1-8 - [c22]Mathias Halbach, Rolf Hoffmann:
Parallel Hardware Architecture to Simulate Movable Creatures in the CA Model. PaCT 2007: 418-431 - 2006
- [c21]Mathias Halbach, Rolf Hoffmann, Lars Both:
Optimal 6-State Algorithms for the Behavior of Several Moving Creatures. ACRI 2006: 571-581 - [c20]Rolf Hoffmann, Mathias Halbach:
Are Several Creatures More Efficient Than a Single One? ACRI 2006: 707-711 - [c19]Mathias Halbach, Rolf Hoffmann:
Minimising the Hardware Resources for a Cellular Automaton with Moving Creatures. ARCS Workshops 2006: 323-332 - [c18]Wolfgang Heenes, Rolf Hoffmann, Johannes Jendrsczok:
A multiprocessor architecture for the massively parallel model GCA. IPDPS 2006 - 2005
- [c17]Wolfgang Heenes, Rolf Hoffmann, Sebastian Kanthak:
FPGA Implementations of the Massively Parallel GCA Model. IPDPS 2005 - [c16]Mathias Halbach, Rolf Hoffmann:
Optimal Behavior of a Moving Creature in the Cellular Automata Model. PaCT 2005: 129-140 - 2004
- [c15]Mathias Halbach, Wolfgang Heenes, Rolf Hoffmann, Jan Tisje:
Optimizing the Behavior of a Moving Creature in Software and in Hardware. ACRI 2004: 841-850 - [c14]Mathias Halbach, Rolf Hoffmann, Patrick Röder:
FPGA Implementation of Cellular Automata Compared to Software Implementation. ARCS Workshops 2004: 309-317 - [c13]Mathias Halbach, Rolf Hoffmann:
Implementing Cellular Automata in FPGA Logic. IPDPS 2004 - [c12]Rolf Hoffmann, Wolfgang Heenes, Mathias Halbach:
Implementation of the Massively Parallel Model GCA. PARELEC 2004: 135-139 - 2003
- [c11]Rolf Hoffmann, Klaus-Peter Völkmann, Wolfgang Heenes:
GCA: A Massively Parallel Model. IPDPS 2003: 270 - 2001
- [c10]Rolf Hoffmann, Klaus-Peter Völkmann, Stefan Waldschmidt, Wolfgang Heenes:
GCA: Global Cellular Automata. A Flexible Parallel Model. PaCT 2001: 66-73 - 2000
- [c9]Rolf Hoffmann, Bernd Ulmann, Klaus-Peter Völkmann, Stefan Waldschmidt:
A Stream Processor Architecture Based on the Configurable CEPRA-S. FPL 2000: 822-825 - [c8]Christian Hochberger, Rolf Hoffmann, Klaus-Peter Völkmann, Stefan Waldschmidt:
The Cellular Processor Architecture CEPRA-1X and Its Configuration by CDL. IPDPS Workshops 2000: 898-905
1990 – 1999
- 1999
- [c7]Christian Hochberger, Rolf Hoffmann, Stefan Waldschmidt:
CDL++ for the Description of Moving Objects in Cellular Automata. PaCT 1999: 428-435 - 1998
- [j2]Christian Hochberger, Rolf Hoffmann, Ralf Schneider:
The parallel program development environment CDL/ACL for cellular processing. J. Syst. Archit. 45(1): 83-96 (1998) - 1997
- [c6]Rolf Hoffmann, Klaus-Peter Völkmann:
Hardware Support for 3D Cellular Processing. PaCT 1997: 322-329 - 1996
- [c5]Christian Hochberger, Rolf Hoffmann:
Solving Routing Problems with Cellular Automata. ACRI 1996: 89-98 - [c4]P. Hartmann, Christian Hochberger, Rolf Hoffmann, Ralf Schneider, Klaus-Peter Völkmann:
Hardware Supported Simulation Systems for Graph Based and 3-D Cellular Processing. ACRI 1996: 168-176 - [c3]Ralf Schneider, Rolf Hoffmann:
A Mapping Strategy for Cellular Models to Different Parallel Target Architectures. Parcella 1996: 322-323 - 1995
- [c2]Christian Hochberger, Rolf Hoffmann, Stefan Waldschmidt:
Compilation of CDL for Different Target Architectures. PaCT 1995: 169-179 - 1994
- [c1]Rolf Hoffmann, Klaus-Peter Völkmann, Mark Sobolewski:
The Cellular Processing Machine CEPRA-8L. Parcella 1994: 179-188
1980 – 1989
- 1983
- [j1]Rolf Hoffmann:
A classification of interpreter systems. Microprocessing and Microprogramming 12(1): 3-8 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-07-08 01:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
