


default search action
Stephan Waack
- > Home > Persons > Stephan Waack
Publications
- 2004
- [j17]Carsten Damm
, Matthias Krause, Christoph Meinel, Stephan Waack:
On relations between counting communication complexity classes. J. Comput. Syst. Sci. 69(2): 259-280 (2004) - 2001
- [j14]Christoph Meinel, Stephan Waack:
The "log rank" conjecture for modular communication complexity. Comput. Complex. 10(1): 70-91 (2001) - 1996
- [j12]Christoph Meinel, Stephan Waack:
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. Math. Syst. Theory 29(6): 649-659 (1996) - [c17]Christoph Meinel, Stephan Waack:
The "log Rank" Conjecture for Modular Communication Complexity. STACS 1996: 619-630 - [i6]Christoph Meinel, Stephan Waack:
The "Log Rank" Conjecture for Modular Communication Complexity. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j11]Christoph Meinel, Stephan Waack:
Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs. Math. Syst. Theory 28(1): 21-39 (1995) - [c16]Christoph Meinel, Stephan Waack:
Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. LATIN 1995: 427-435 - [c15]Christoph Meinel, Stephan Waack:
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. MFCS 1995: 299-308 - [i5]Christoph Meinel, Stephan Waack:
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j9]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Oblivious Linear Length MODp-Branching Program Classes. J. Inf. Process. Cybern. 30(2): 63-75 (1994) - [i4]Christoph Meinel, Stephan Waack:
The Möbius Function, Variations Ranks, and Theta(n)-Bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem. Electron. Colloquium Comput. Complex. TR94 (1994) - [i3]Christoph Meinel, Stephan Waack:
The Möbius Function, Variations Ranks, and Theta(n)-Bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-04 (1994) - 1993
- [c13]Christoph Meinel, Stephan Waack:
Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs. ISAAC 1993: 379-388 - 1992
- [j8]Juraj Hromkovic, Matthias Krause, Christoph Meinel, Stephan Waack:
Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits. Inf. Comput. 96(2): 168-178 (1992) - [j7]Matthias Krause, Christoph Meinel, Stephan Waack:
Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. RAIRO Theor. Informatics Appl. 26: 345-362 (1992) - [c12]Christoph Meinel, Stephan Waack:
Upper and Lower Bounds for Certain Graph Accessibility Problems on Bounded Alternating omega-Branching Programs. Complexity Theory: Current Research 1992: 273-290 - [c11]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Counting Communication Complexity Classes. STACS 1992: 281-292 - [i2]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Counting Communication Complexity Classes. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-01 (1992) - [i1]Christoph Meinel, Stephan Waack:
Upper and Lower Bounds for Certain Graph-Accessability-Problems on Bounded Alternating (omega)-Branching Programs. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-04 (1992) - 1991
- [j4]Matthias Krause, Christoph Meinel, Stephan Waack:
Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e. Theor. Comput. Sci. 86(2): 267-275 (1991) - [c9]Christoph Meinel, Stephan Waack:
Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. MFCS 1991: 337-345 - 1989
- [c7]Matthias Krause, Christoph Meinel, Stephan Waack:
Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. SCT 1989: 240-249 - [c5]Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. IFIP Congress 1989: 287-292 - 1988
- [c4]Matthias Krause, Christoph Meinel, Stephan Waack:
Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe. MFCS 1988: 405-413

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.
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.
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.
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 2025-07-02 19:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
