( en | de | ru )

 

Disambiguation of "Vollmer, Heribert"

Author of the publication

copydeleteadd this publication to your clipboard
Modal Inclusion Logic: Being Lax is Simpler than Being Strict.

, , , and . MFCS (1), volume 9234 of Lecture Notes in Computer Science, page 281-292. Springer, (2015)

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.

Heribert Vollmer

Heribert Vollmer

Gregor Vollmer

Norbert Vollmer

Siegfried Vollmer

 

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)A Van Benthem Theorem for Modal Team Semantics, , , and . 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, page 277--291. (2015)Measure One Results in Computational Complexity Theory., and . Advances in Algorithms, Languages, and Complexity, page 285-312. Kluwer, (1997)The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis.. Theory Comput. Syst., 44 (1): 82-90 (2009)On the Autoreducibility of Random Sequences., and . Technical Report, 239. Department of Computer Science, (October 1999)Arithmetic Circuits and Polynomial Replacement Systems., , and . Technical Report, 242. Department of Computer Science, (November 1999)