( en | de | ru )

 

Disambiguation of "Loff, Bruno"

Author of the publication

copydeleteadd this publication to your clipboard
The Computational Power of Parsing Expression Grammars.

, , and . DLT, volume 11088 of Lecture Notes in Computer Science, page 491-502. Springer, (2018)

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.

Detmar Loff

Steffan Loff

Peter Loff

Horst Bruno

Horst Bruno

 

Other publications of authors with the same name

On the Complexity of Measurement in Classical Physics., , , and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 20-30. Springer, (2008)Derandomizing from Random Strings, , , and . CoRR, (2009)Simulation Theorems via Pseudorandom Properties., , , and . CoRR, (2017)Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy., , , , and . CCC, volume 300 of LIPIcs, page 7:1-7:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity., , and . CoRR, (2024)Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks., , , and . CoRR, (2021)Reductions to the Set of Random Strings: The Resource-Bounded Case., , , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 88-99. Springer, (2012)Derandomizing from Random Strings., , , and . CCC, page 58-63. IEEE Computer Society, (2010)Towards a Reverse Newman's Theorem in Interactive Information Complexity., , , , , and . CCC, page 24-33. IEEE Computer Society, (2013)Lower Bounds for Semi-adaptive Data Structures via Corruption., and . FSTTCS, volume 182 of LIPIcs, page 20:1-20:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)