Veronika Loitzenbauer

According to our database, Veronika Loitzenbauer authored at least 14 papers between 2013 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter.

Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives.

Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, Viktor Toman

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017

Improved Algorithms for Parity and Streett objectives.

Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer

Log. Methods Comput. Sci., 2017

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs.

Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Verbesserte Algorithmen und Bedingte Untere Schranken für Probleme in Formaler Verifikation und Reaktiver Synthese.

Veronika Loitzenbauer

Proceedings of the Ausgezeichnete Informatikdissertationen 2017, 2017

Improved Set-Based Symbolic Algorithms for Parity Games.

Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016

Conditionally Optimal Algorithms for Generalized Büchi Games.

Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction.

Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

Truthful unit-demand auctions with budgets revisited.

Monika Henzinger, Veronika Loitzenbauer

Theor. Comput. Sci., 2015

Ad Exchange: Envy-Free Auctions with Mediators.

Oren Ben-Zwi, Monika Henzinger, Veronika Loitzenbauer

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Improved Algorithms for One-Pair and k-Pair Streett Objectives.

Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.

Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Approximating the minimum cycle mean.

Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, Michael A. Raskin

Theor. Comput. Sci., 2014

2013

Approximating the minimum cycle mean.

Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer

Proceedings of the Proceedings Fourth International Symposium on Games, 2013