Demo Data from EDBT 2026 / reviewers in the wild / expert
Roland Vollmar
dblp:v/RolandVollmar
· DBLP profile ↗
8ranked-venue papers
0as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4Systems, architecture and hardware · 3Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › complexity measures
reversal complexity |
0.0 | 1 | 1970 | Note on Tape Reversal Complexity of Languages · Inf. Control. 1970 |
Computational complexity
language complexity |
0.0 | 1 | 1970 | Note on Tape Reversal Complexity of Languages · Inf. Control. 1970 |
Methods — techniques the papers use, named apart from their topics
turing machine complexity · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | Cellular Automata: Energy Consumption and Physical Feasibility
Peter Sanders 0001, Roland Vollmar, Thomas Worsch |
Fundam. Informaticae | 2 |
| 1997 | Feasible Models of Computation: Three-Dimensionality and Energy Consumption
Peter Sanders 0001, Roland Vollmar, Thomas Worsch |
Euro-Par | 2 |
| 1997 | Introduction to the Special Issue on Cellular Automata
Martin Kutrib, Roland Vollmar, Thomas Worsch |
Parallel Comput. | 2 |
| 1992 | On the power of global-bus in mesh-connected architectures
Hiroshi Umeo, Thomas Worsch, Roland Vollmar |
Future Gener. Comput. Syst. | 3 |
| 1986 | Three-way two-dimensional finite automata with rotated inputs
Katsushi Inoue, Itsuo Takanami, Roland Vollmar |
Inf. Sci. | 3 |
| 1985 | Alternating On-Line Turing Machines with Only Universal States and Small Space Bounds
Katsushi Inoue, Itsuo Takanami, Roland Vollmar |
Theor. Comput. Sci. | 3 |
| 1975 | On "Forgetful" Cellular Automata
W. O. Höllerer, Roland Vollmar |
J. Comput. Syst. Sci. | 2 |
| 1970 | Note on Tape Reversal Complexity of Languages
Tiko Kameda, Roland Vollmar |
Inf. Control. | 2 |