( en | de | ru )

 

Disambiguation of "Rabinovich, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Some Complexity Results for Stateful Network Verification.

, , , , , , and . TACAS, volume 9636 of Lecture Notes in Computer Science, page 811-830. Springer, (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.

Andrew Rabinovich

Roman Rabinovich

Alexander

Alexander Stadler

Messtechnische Bestimmung und Simulation der Kernverluste in weichmagnetischen Materialien. Uni Erlangen-Nürnberg, (2009)

Alexander Auch

A phylogenetic potpourri: computational methods for analysing genome scale data. Uni Tübingen, (2010)
 

Other publications of authors with the same name

The Complexity of Multi-Mean-Payoff and Multi-Energy Games, , , , , and . CoRR, (2012)Complexity of metric temporal logics with counting and the Pnueli modalities.. Theor. Comput. Sci., 411 (22-24): 2331-2342 (2010)The Expressive Power of Temporal and First-Order Metric Logics.. Fields of Logic and Computation III, volume 12180 of Lecture Notes in Computer Science, page 226-246. Springer, (2020)Some Complexity Results for Stateful Network Verification., , , , , , and . CoRR, (2021)Complementation of Finitely Ambiguous Büchi Automata.. DLT, volume 11088 of Lecture Notes in Computer Science, page 541-552. Springer, (2018)A Proof of Kamp's theorem.. CSL, volume 16 of LIPIcs, page 516-527. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)A Proof of Kamp's theorem.. Logical Methods in Computer Science, (2014)Decidable Expansions of Labelled Linear Orderings., and . Fields of Logic and Computation, volume 6300 of Lecture Notes in Computer Science, page 95-107. Springer, (2010)On the Borel Complexity of MSO Definable Sets of Branches., , , , and . Fundam. Informaticae, 98 (4): 337-349 (2010)Decidable Extensions of Church's Problem.. CSL, volume 5771 of Lecture Notes in Computer Science, page 424-439. Springer, (2009)