Author of the publication

Deterministic OL Languages are of Very Low Complexity: DOL is in AC0.

, , , and . Developments in Language Theory, page 305-313. World Scientific, Singapore, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Note on Spectral Lower Bound Arguments for Decision Trees.. Bulletin of the EATCS, (1998)Complexity of some arithmetic problems for binary polynomials., , , , , and . Comput. Complex., 12 (1-2): 23-47 (2003)Symmetric Functions in AC02, and . Universität Trier, Mathematik/Informatik, Forschungsbericht, (1993)On Alternating vs. Parity Communication Complexity. Universität Trier, Mathematik/Informatik, Forschungsbericht, (1998)Some Bounds on Multiparty Communication Complexity of Pointer Jumping, , and . Electron. Colloquium Comput. Complex., (1995)On Covering and Rank Problems for Boolean Matrices and Their Applications., , and . COCOON, volume 1627 of Lecture Notes in Computer Science, page 123-133. Springer, (1999)Some Bounds on Multiparty Communication Complexity of Pointer Jumping., , and . STACS, volume 1046 of Lecture Notes in Computer Science, page 643-654. Springer, (1996)The average sensitivity of square-freeness., , and . Comput. Complex., 9 (1): 39-51 (2000)The Complexity of Symmetric Functions in Parity Normal Forms.. MFCS, volume 452 of Lecture Notes in Computer Science, page 232-238. Springer, (1990)On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols.. MFCS, volume 1450 of Lecture Notes in Computer Science, page 780-788. Springer, (1998)