PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Haase, Christoph"

Author of the publication

copydeleteadd this publication to your clipboard
Tightening the Complexity of Equivalence Problems for Commutative Grammars.

, and . CoRR, (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.

Walter Haase

Walter Haase

Dr. -Ing. Walter Haase University of Stuttgart

Christoph Schulz University of Stuttgart

Hon. -Prof. Christoph Müller University of Stuttgart

 

Other publications of authors with the same name

On the complexity of model checking counter automata.. University of Oxford, UK, (2012)British Library, EThOS.Tightening the Complexity of Equivalence Problems for Commutative Grammars., and . CoRR, (2015)Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete., , , , and . CoRR, (2014)Counting Problems for Parikh Images., , and . MFCS, volume 83 of LIPIcs, page 12:1-12:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Reachability in Succinct and Parametric One-Counter Automata., , , and . CONCUR, volume 5710 of Lecture Notes in Computer Science, page 369-383. Springer, (2009)On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields., , and . LICS, page 1-10. IEEE, (2019)A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One., , , and . ICALP, volume 55 of LIPIcs, page 105:1-105:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Complexity of Subsumption in the Escr Lscr Family of Description Logics: Acyclic and Cyclic TBoxes., and . ECAI, volume 178 of Frontiers in Artificial Intelligence and Applications, page 25-29. IOS Press, (2008)The Logical View on Continuous Petri Nets., , , and . ACM Trans. Comput. Log., 18 (3): 24:1-24:28 (2017)The Odds of Staying on Budget., and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 234-246. Springer, (2015)