Остановите войну!
for scientists:
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) - 1995
- [j10]Matthias Krause, Stephan Waack:
Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In. Math. Syst. Theory 28(6): 553-564 (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) - 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) - [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) - 1991
- [j6]Stephan Waack, Matthias Krause:
On Oblivious Branching Programs of Linear Length. Inf. Comput. 94(2): 232-249 (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) - [c10]Matthias Krause, Stephan Waack:
Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In. FOCS 1991: 777-782 - 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 - [c6]Matthias Krause, Stephan Waack:
On Oblivious Branching Programs of Linear Length (Extended Abstract). FCT 1989: 287-296 - [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.
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 2023-10-29 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint