Author of the publication

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

Counting paths in planar width 2 branching programs., , and . CATS, volume 128 of CRPIT, page 59-68. Australian Computer Society, (2012)Algebraic Branching Programs, Border Complexity, and Tangent Spaces., , , , and . CCC, volume 169 of LIPIcs, page 21:1-21:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Upper Bounds on Fourier Entropy., , , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 771-782. Springer, (2015)Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity., , , and . ESA, volume 112 of LIPIcs, page 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On the complexity of detecting hazards., and . Inf. Process. Lett., (2020)Improved Bounds on Fourier Entropy and Min-Entropy., , , , and . STACS, volume 154 of LIPIcs, page 45:1-45:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Tight Lower Bounds for Approximate & Exact k-Center in ℝd., and . SoCG, volume 224 of LIPIcs, page 28:1-28:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Rabbits Approximate, Cows Compute Exactly!, , and . MFCS, volume 241 of LIPIcs, page 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Upper bounds on Fourier entropy., , , and . Theor. Comput. Sci., (2016)Approximate polymorphisms., , , , and . CoRR, (2021)