( en | de | ru )

 

Disambiguation of "Baier, Christel"

Author of the publication

copydeleteadd this publication to your clipboard
Generic Emptiness Check for Fun and Profit.

, , , , , and . ATVA, volume 11781 of Lecture Notes in Computer Science, page 445-461. Springer, (2019)

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.

Christel Baier

Ralf Christel

Aktive Schwingungsminderung an gekoppelten Zylindern in Rollenoffsetdruckmaschinen mittels piezokeramischer Aktoren an den Lagerstellen. Uni Hannover, (2010)

Angela Baier

Horst Baier

Thomas Baier

 

Other publications of authors with the same name

Norm Functions for Probabilistic Bisimulations with Delays., and . FoSSaCS, volume 1784 of Lecture Notes in Computer Science, page 1-16. Springer, (2000)Partial and Conditional Expectations in Markov Decision Processes with Integer Weights., and . FoSSaCS, volume 11425 of Lecture Notes in Computer Science, page 436-452. Springer, (2019)Performance Evaluation of Thermal-Constrained Scheduling Strategies in Multi-core Systems., , , , and . EPEW, volume 12039 of Lecture Notes in Computer Science, page 133-147. Springer, (2019)Denotational Linear Time Semantics and Sequential Composition., and . Inf. Process. Lett., 59 (3): 135-143 (1996)Long-run Satisfaction of Path Properties., , , and . LICS, page 1-14. IEEE, (2019)From LTL to unambiguous Büchi automata via disambiguation of alternating automata., , , and . Formal Methods Syst. Des., 58 (1-2): 42-82 (2021)On the probabilistic bisimulation spectrum with silent moves., , and . Acta Informatica, 57 (3-5): 465-512 (2020)Metric Completion versus Ideal Completion., and . Theor. Comput. Sci., 170 (1-2): 145-171 (1996)Theoretische Informatik. Eine Einführung in Berechenbarkeit, Komplexität und formale Sprachen mit 101~Beispielen, and . Pearson Studium, München, (2002)Theoretische Informatik eBook : Berechenbarkeit ..., Komplexität ..., formale Sprachen .., and . (2008)