Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Stephan Waack

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Matthias Krause 0001

> Home > Persons > Stephan Waack

Publications

2004
[j17]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/DammKMW04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/DammKMW04
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]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/mst/KrauseW95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/KrauseW95
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]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/eik/DammKMW94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eik/DammKMW94
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Oblivious Linear Length MOD_p-Branching Program Classes. J. Inf. Process. Cybern. 30(2): 63-75 (1994)
1992
[j8]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/HromkovicKMW92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/HromkovicKMW92
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]
- view
  authority control:
- export record
  dblp key:
  - journals/ita/KrauseMW92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/KrauseMW92
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]
- view
  authority control:
- export record
  dblp key:
  - conf/stacs/DammKMW92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/DammKMW92
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Counting Communication Complexity Classes. STACS 1992: 281-292
[i2]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - tr/trier/MI92-01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/tr/trier/MI92-01
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Counting Communication Complexity Classes. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-01 (1992)
1991
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/WaackK91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/WaackK91
Stephan Waack, Matthias Krause:
On Oblivious Branching Programs of Linear Length. Inf. Comput. 94(2): 232-249 (1991)
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/KrauseMW91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KrauseMW91
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]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/KrauseW91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/KrauseW91
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]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/KrauseMW89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/KrauseMW89
Matthias Krause, Christoph Meinel, Stephan Waack:
Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. SCT 1989: 240-249
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/fct/KrauseW89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/KrauseW89
Matthias Krause, Stephan Waack:
On Oblivious Branching Programs of Linear Length (Extended Abstract). FCT 1989: 287-296
[c5]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/ifip/KrauseMW89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifip/KrauseMW89
Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. IFIP Congress 1989: 287-292
1988
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/mfcs/KrauseMW88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/KrauseMW88
Matthias Krause, Christoph Meinel, Stephan Waack:
Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e. MFCS 1988: 405-413

a service of

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.