PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Göller, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
On the Parallel Complexity of Bisimulation on Finite Systems.

, , and . CSL, volume 62 of LIPIcs, page 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)

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.

Stefan Esser University of Stuttgart

First thin-disk oscillator with ceramic Yb:LuScO3 in comparison to the operation with ceramic Yb:Lu2O3, , , , and . Applied Physics B, 130 (6): 98 (May 14, 2024)

Stefan Kunert University of Stuttgart

Stefan Schippling University of Stuttgart

Stefan Hecht University of Stuttgart

Stefan Keuler University of Stuttgart

 

Other publications of authors with the same name

The Complexity of Bisimulation and Simulation on Finite Systems., , and . Logical Methods in Computer Science, (2018)Computational complexity of propositional dynamic logics.. University of Leipzig, (2008)The Complexity of Decomposing Modal and First-Order Theories., , and . ACM Trans. Comput. Log., 16 (1): 9:1-9:43 (2015)Branching-Time Model Checking of Parametric One-Counter Automata., , , and . FoSSaCS, volume 7213 of Lecture Notes in Computer Science, page 406-420. Springer, (2012)Model Checking Succinct and Parametric One-Counter Automata., , , and . ICALP (2), volume 6199 of Lecture Notes in Computer Science, page 575-586. Springer, (2010)The Complexity of Decomposing Modal and First-Order Theories., , and . LICS, page 325-334. IEEE Computer Society, (2012)The Complexity of Verifying Ground Tree Rewrite Systems., and . LICS, page 279-288. IEEE Computer Society, (2011)Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems., and . ACM Trans. Comput. Log., 15 (4): 26:1-26:28 (2014)Bisimilarity of One-Counter Processes Is PSPACE-Complete., , and . CONCUR, volume 6269 of Lecture Notes in Computer Science, page 177-191. Springer, (2010)On the Parallel Complexity of Bisimulation on Finite Systems., , and . CSL, volume 62 of LIPIcs, page 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)