×
Compute Distance To:
Author ID: meinel.christoph Recent zbMATH articles by "Meinel, Christoph"
Published as: Meinel, Christoph; Meinel, Ch.; Meinel, C.; Meinel, Chr.
External Links: MGP · Wikidata · GND · IdRef
Documents Indexed: 78 Publications since 1980, including 13 Books
4 Contributions as Editor
Reviewing Activity: 43 Reviews
Co-Authors: 38 Co-Authors with 55 Joint Publications
691 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

33 Publications have been cited 155 times in 131 Documents Cited by Year
Structure and importance of logspace-MOD class. Zbl 0749.68033
Buntrock, Gerhard; Damm, Carsten; Hertrampf, Ulrich; Meinel, Christoph
30
1992
Efficient Boolean manipulation with OBDD’s can be extended to FBDD’s. Zbl 1063.68573
Gergov, Jordan; Meinel, Christoph
16
1994
Algorithms and data structure in VLSI design. DBDD - foundations and applications. (Algorithmen und Datenstrukturen im VLSI-Design. DBDD - Grundlagen und Anwendungen.) Zbl 0899.68040
Meinel, Christoph; Theobald, Thorsten
15
1998
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\). Zbl 0749.68036
Krause, Matthias; Meinel, Christoph; Waack, Stephan
14
1991
Algorithms and data structures in VLSI design. Transl. from the German. Zbl 0907.68116
Meinel, Christoph; Theobald, Thorsten
11
1998
Polynomial size \(\Omega\)-branching programs and their computational power. Zbl 0705.68052
Meinel, Christoph
8
1990
Modified branching programs and their computational power. Zbl 0669.68042
Meinel, Christoph
7
1989
Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs. (Extended abstract). Zbl 0798.68078
Gergov, Jordan; Meinel, Christoph
7
1993
Algebraic and topological properties of finite partially ordered sets. Zbl 0677.06001
Budach, Lothar; Graw, Bernd; Meinel, Christoph; Waack, Stephan
6
1988
On relations between counting communication complexity classes. Zbl 1159.68465
Damm, Carsten; Krause, Matthias; Meinel, Christoph; Waack, Stephan
5
2004
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. Zbl 0768.68017
Krause, Matthias; Meinel, Christoph; Waack, Stephan
4
1992
Switching graphs and their complexity. Zbl 0755.68071
Meinel, Christoph
3
1989
The nonuniform complexity classes NC 1, L and NL. Zbl 0638.68028
Meinel, Christoph
3
1987
Structure and importance of logspace-MOD-classes. Zbl 0764.68041
Buntrock, Gerhard; Damm, Carsten; Hertrampf, Ulrich; Meinel, Christoph
2
1991
Separating completely complexity classes related to polynomial size \(\Omega\)-decision trees. Zbl 0756.68039
Damm, Carsten; Meinel, Christoph
2
1989
The power of polynomial size \(\Omega\)-branching programs. Zbl 0644.68074
Meinel, Christoph
2
1988
Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits. Zbl 0674.68033
Hromkovič, Juraj; Krause, Matthias; Meinel, Christoph; Waack, Stephan
2
1990
Local encoding transformations for optimizing OBDD-representations of finite state machines. Zbl 1001.68028
Meinel, Christoph; Theobald, Thorsten
2
2001
On the influence of the state encoding on OBDD-representations of finite state machines. Zbl 0927.68051
Meinel, Christoph; Theobald, Thorsten
2
1999
Branching programs — An efficient data structure for computer-aided circuit design. Zbl 0751.68019
Meinel, Christoph
1
1992
Upper and lower bounds for certain graph-accessibility-problems on bounded alternating \(\omega\)-branching programs. Zbl 0776.68060
Meinel, Christoph; Waack, Stephan
1
1991
p-projection reducibility and the complexity classes \({\mathcal L}\) nonuniform and \({\mathcal N}{\mathcal L}\) (nonuniform). Zbl 0611.03021
Meinel, Christoph
1
1986
Restricted branching programs and their computational power. Zbl 0747.68018
Meinel, Christoph
1
1990
Umwelten und Automaten in Umwelten. Zbl 0432.68042
Budach, L.; Meinel, Ch.
1
1980
Separating oblivious linear length \(\text{MOD}_ p\)-branching program classes. Zbl 0838.68037
Damm, Carsten; Krause, Matthias; Meinel, Christoph; Waack, Stephan
1
1994
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\). Zbl 0656.68050
Krause, Matthias; Meinel, Christoph; Waack, Stephan
1
1988
The importance of plane labyrinths. Zbl 0518.68033
Meinel, Christoph
1
1982
Environments and Autmata. I. Zbl 0534.68036
Budach, Lothar; Meinel, Christoph
1
1982
Environments and Automata. II. Zbl 0534.68037
Budach, Lothar; Meinel, Christoph
1
1982
Upper and lower bounds for certain graph-accessibility-problems on bounded alternating \(\omega\)-branching programs. Zbl 0789.68054
Meinel, Christoph; Waack, Stephan
1
1993
On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs. Zbl 0803.68049
Gergov, Jordan; Meinel, Christoph
1
1994
A reducibility concept for problems defined in terms of ordered binary decision diagrams. Zbl 0876.68044
Meinel, Ch.; Slobodová, A.
1
1997
SOFSEM 2007: Theory and practice of computer science. 33rd conference on current trends in theory and practice of computer science, Harrachov, Czech Republic, January 20–26, 2007. Proceedings. Zbl 1129.68007
1
2007
SOFSEM 2007: Theory and practice of computer science. 33rd conference on current trends in theory and practice of computer science, Harrachov, Czech Republic, January 20–26, 2007. Proceedings. Zbl 1129.68007
1
2007
On relations between counting communication complexity classes. Zbl 1159.68465
Damm, Carsten; Krause, Matthias; Meinel, Christoph; Waack, Stephan
5
2004
Local encoding transformations for optimizing OBDD-representations of finite state machines. Zbl 1001.68028
Meinel, Christoph; Theobald, Thorsten
2
2001
On the influence of the state encoding on OBDD-representations of finite state machines. Zbl 0927.68051
Meinel, Christoph; Theobald, Thorsten
2
1999
Algorithms and data structure in VLSI design. DBDD - foundations and applications. (Algorithmen und Datenstrukturen im VLSI-Design. DBDD - Grundlagen und Anwendungen.) Zbl 0899.68040
Meinel, Christoph; Theobald, Thorsten
15
1998
Algorithms and data structures in VLSI design. Transl. from the German. Zbl 0907.68116
Meinel, Christoph; Theobald, Thorsten
11
1998
A reducibility concept for problems defined in terms of ordered binary decision diagrams. Zbl 0876.68044
Meinel, Ch.; Slobodová, A.
1
1997
Efficient Boolean manipulation with OBDD’s can be extended to FBDD’s. Zbl 1063.68573
Gergov, Jordan; Meinel, Christoph
16
1994
Separating oblivious linear length \(\text{MOD}_ p\)-branching program classes. Zbl 0838.68037
Damm, Carsten; Krause, Matthias; Meinel, Christoph; Waack, Stephan
1
1994
On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs. Zbl 0803.68049
Gergov, Jordan; Meinel, Christoph
1
1994
Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs. (Extended abstract). Zbl 0798.68078
Gergov, Jordan; Meinel, Christoph
7
1993
Upper and lower bounds for certain graph-accessibility-problems on bounded alternating \(\omega\)-branching programs. Zbl 0789.68054
Meinel, Christoph; Waack, Stephan
1
1993
Structure and importance of logspace-MOD class. Zbl 0749.68033
Buntrock, Gerhard; Damm, Carsten; Hertrampf, Ulrich; Meinel, Christoph
30
1992
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. Zbl 0768.68017
Krause, Matthias; Meinel, Christoph; Waack, Stephan
4
1992
Branching programs — An efficient data structure for computer-aided circuit design. Zbl 0751.68019
Meinel, Christoph
1
1992
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\). Zbl 0749.68036
Krause, Matthias; Meinel, Christoph; Waack, Stephan
14
1991
Structure and importance of logspace-MOD-classes. Zbl 0764.68041
Buntrock, Gerhard; Damm, Carsten; Hertrampf, Ulrich; Meinel, Christoph
2
1991
Upper and lower bounds for certain graph-accessibility-problems on bounded alternating \(\omega\)-branching programs. Zbl 0776.68060
Meinel, Christoph; Waack, Stephan
1
1991
Polynomial size \(\Omega\)-branching programs and their computational power. Zbl 0705.68052
Meinel, Christoph
8
1990
Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits. Zbl 0674.68033
Hromkovič, Juraj; Krause, Matthias; Meinel, Christoph; Waack, Stephan
2
1990
Restricted branching programs and their computational power. Zbl 0747.68018
Meinel, Christoph
1
1990
Modified branching programs and their computational power. Zbl 0669.68042
Meinel, Christoph
7
1989
Switching graphs and their complexity. Zbl 0755.68071
Meinel, Christoph
3
1989
Separating completely complexity classes related to polynomial size \(\Omega\)-decision trees. Zbl 0756.68039
Damm, Carsten; Meinel, Christoph
2
1989
Algebraic and topological properties of finite partially ordered sets. Zbl 0677.06001
Budach, Lothar; Graw, Bernd; Meinel, Christoph; Waack, Stephan
6
1988
The power of polynomial size \(\Omega\)-branching programs. Zbl 0644.68074
Meinel, Christoph
2
1988
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\). Zbl 0656.68050
Krause, Matthias; Meinel, Christoph; Waack, Stephan
1
1988
The nonuniform complexity classes NC 1, L and NL. Zbl 0638.68028
Meinel, Christoph
3
1987
p-projection reducibility and the complexity classes \({\mathcal L}\) nonuniform and \({\mathcal N}{\mathcal L}\) (nonuniform). Zbl 0611.03021
Meinel, Christoph
1
1986
The importance of plane labyrinths. Zbl 0518.68033
Meinel, Christoph
1
1982
Environments and Autmata. I. Zbl 0534.68036
Budach, Lothar; Meinel, Christoph
1
1982
Environments and Automata. II. Zbl 0534.68037
Budach, Lothar; Meinel, Christoph
1
1982
Umwelten und Automaten in Umwelten. Zbl 0432.68042
Budach, L.; Meinel, Ch.
1
1980
all top 5

Cited by 189 Authors

11 Meinel, Christoph
10 Waack, Stephan
7 Bollig, Beate
6 Wegener, Ingo
5 Damm, Carsten
5 Köbler, Johannes
5 Krause, Matthias
5 Sieling, Detlef
4 Allender, Eric W.
4 Arvind, Vikraman
4 Homeister, Matthias
3 Bibilo, P. N.
3 Brosenne, Henrik
3 Gál, Anna
3 Kuhnert, Sebastian
3 Semenov, Aleksandr Anatol’evich
3 Vollmer, Heribert
2 Barto, Libor
2 Beimel, Amos
2 Flesca, Sergio
2 Gröpl, Clemens
2 Hertrampf, Ulrich
2 Klimovich, A. S.
2 Lohrey, Markus
2 Meier, Arne
2 Ogihara, Mitsunori
2 Parisi, Francesco
2 Prömel, Hans Jürgen
2 Razborov, Aleksandr Aleksandrovich
2 Solov’ev, Vyacheslav V.
2 Srivastav, Anand
2 Tewari, Raghunath
2 Torán, Jacobo
2 Vinodchandran, N. Variyam
2 Wunderlich, Henning
2 Yukna, Stasys P.
2 Živaljević, Rade T.
1 Al-Rawashdeh, Ahmad Saleh
1 Amadini, Roberto
1 Amarilli, Antoine
1 Andersen, Henrik Reif
1 Arnold, Stefan
1 Atserias, Albert
1 Barbier, Morgan
1 Behle, Markus
1 Beyersdorff, Olaf
1 Blais, Eric
1 Blondin, Michael
1 Borchert, Bernd
1 Borodin, Allan B.
1 Boros, Endre
1 Bousquet-Mélou, Mireille
1 Braverman, Mark
1 Breitbart, Yuri
1 Bryant, Randal E.
1 Bulatov, Andrei A.
1 Buntrock, Gerhard
1 Capelli, Florent
1 Čepek, Ondřej
1 Cheballah, Hayat
1 Choffrut, Christian
1 Chromý, Miloš
1 Cowan, Donald D.
1 Darwiche, Adnan
1 Das, Bireswar
1 Dawar, Anuj
1 Dechter, Rina
1 Elbassioni, Khaled M.
1 Fazzinga, Bettina
1 Fearnley, John
1 Fuhlbrück, Frank
1 Furfaro, Filippo
1 Gabbrielli, Maurizio
1 Gainutdinova, Aida
1 Gairing, Martin
1 Garvin, Brady J.
1 Gentilini, Raffaella
1 Gergov, Jordan
1 Ghasemzadeh, Mohammad
1 Góngora, Pedro Arturo
1 Göös, Mika
1 Gosti, Wilsin
1 Grädel, Erich
1 Graw, Bernd
1 Groote, Jan Friso
1 Gurvich, Vladimir A.
1 Haus, Utz-Uwe
1 Hirata, Kouichi
1 Holzer, Markus
1 Hromkovič, Juraj
1 Hulgaard, Henrik
1 Hunt, Harry Bowen III
1 Ignat’ev, A. S.
1 Inoue, Katsushi
1 Istrate, Gabriel I.
1 Itsykson, Dmitry M.
1 Jackson, Marcel G.
1 Jensen, Rune Møller
1 Jha, Abhay
1 Kabanets, Valentine
...and 89 more Authors
all top 5

Cited in 44 Serials

21 Theoretical Computer Science
13 Information Processing Letters
7 Computational Complexity
7 Theory of Computing Systems
5 Journal of Computer and System Sciences
5 Information and Computation
5 Journal of Computer and Systems Sciences International
4 Discrete Applied Mathematics
4 RAIRO. Informatique Théorique et Applications
4 RAIRO. Theoretical Informatics and Applications
3 The Journal of Symbolic Logic
3 Mathematical Systems Theory
3 Algorithmica
2 Artificial Intelligence
2 Automation and Remote Control
2 International Journal of Applied Mathematics and Computer Science
2 Prikladnaya Diskretnaya Matematika
1 Acta Informatica
1 Discrete Mathematics
1 Advances in Mathematics
1 Information Sciences
1 Journal of Combinatorial Theory. Series A
1 Numerical Functional Analysis and Optimization
1 SIAM Journal on Computing
1 Advances in Applied Mathematics
1 Science of Computer Programming
1 Mathematical Social Sciences
1 Discrete & Computational Geometry
1 SIAM Journal on Discrete Mathematics
1 International Journal of Algebra and Computation
1 Discrete Mathematics and Applications
1 Archive for Mathematical Logic
1 Russian Mathematics
1 Formal Methods in System Design
1 Journal of Applied Non-Classical Logics
1 The Journal of Artificial Intelligence Research (JAIR)
1 The Bulletin of Symbolic Logic
1 Annals of Mathematics and Artificial Intelligence
1 Sbornik: Mathematics
1 Journal of Combinatorial Optimization
1 Theory and Practice of Logic Programming
1 ACM Transactions on Computational Logic
1 Logical Methods in Computer Science
1 Matematicheskie Voprosy Kriptografii

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.