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

Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, and . 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), page 0:i--0:xvi. Dagstuhl, Germany, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, (2017)Paradigms for Parameterized Enumeration, , , , and . Theory Comput. Syst., 60 (4): 737--758 (2017)Complexity Results for Modal Dependence Logic, and . CoRR, (2011)Uniform characterizations of complexity classes.. SIGACT News, 30 (1): 17-27 (1999)Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071)., , , and . Dagstuhl Reports, 3 (2): 45-54 (2013)On the Autoreducibility of Random Sequences., and . MFCS, volume 1893 of Lecture Notes in Computer Science, page 333-342. Springer, (2000)A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits., and . WoLLIC, volume 9803 of Lecture Notes in Computer Science, page 234-248. Springer, (2016)Generic separations and leaf languages., , and . Math. Log. Q., 49 (4): 353-362 (2003)Complexity Theory Made Easy.. Developments in Language Theory, volume 2710 of Lecture Notes in Computer Science, page 95-110. Springer, (2003)On the Autoreducibility of Random Sequences., and . Technical Report, 239. Department of Computer Science, (October 1999)