Prati
Veronika Loitzenbauer
Veronika Loitzenbauer
impactit
Potvrđena adresa e-pošte na univie.ac.at
Naslov
Citirano
Citirano
Godina
Finding 2-edge and 2-vertex strongly connected components in quadratic time
M Henzinger, S Krinninger, V Loitzenbauer
International Colloquium on Automata, Languages, and Programming, 713-724, 2015
422015
Conditionally Optimal Algorithms for Generalized B\" uchi Games
K Chatterjee, W Dvořák, M Henzinger, V Loitzenbauer
arXiv preprint arXiv:1607.05850, 2016
282016
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
S Chechik, TD Hansen, GF Italiano, V Loitzenbauer, N Parotsidis
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
222017
Improved algorithms for one-pair and k-pair Streett objectives
K Chatterjee, M Henzinger, V Loitzenbauer
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 269-280, 2015
212015
Improved algorithms for one-pair and k-pair Streett objectives
K Chatterjee, M Henzinger, V Loitzenbauer
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 269-280, 2015
212015
Improved algorithms for one-pair and k-pair Streett objectives
K Chatterjee, M Henzinger, V Loitzenbauer
Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer …, 2015
212015
Model and objective separation with conditional lower bounds: Disjunction is harder than conjunction
K Chatterjee, W Dvořák, M Henzinger, V Loitzenbauer
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
182016
Improved Set-based Symbolic Algorithms for Parity Games
K Chatterjee, W Dvořák, M Henzinger, V Loitzenbauer
arXiv preprint arXiv:1706.04889, 2017
102017
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter
K Chatterjee, W Dvořák, M Henzinger, V Loitzenbauer
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
92018
Approximating the minimum cycle mean
K Chatterjee, M Henzinger, S Krinninger, V Loitzenbauer, MA Raskin
Theoretical Computer Science 547, 104-116, 2014
92014
Symbolic algorithms for graphs and Markov decision processes with fairness objectives
K Chatterjee, M Henzinger, V Loitzenbauer, S Oraee, V Toman
International Conference on Computer Aided Verification, 178-197, 2018
72018
Ad Exchange: Envy-Free Auctions with Mediators
O Ben-Zwi, M Henzinger, V Loitzenbauer
International Conference on Web and Internet Economics, 104-117, 2015
72015
Improved algorithms and conditional lower bounds for problems in formal verification and reactive synthesis
V Loitzenbauer
uniwien, 2016
62016
Truthful unit-demand auctions with budgets revisited
M Henzinger, V Loitzenbauer
Theoretical Computer Science 573, 1-15, 2015
12015
A Hierarchical Sparsification Technique for Faster Algorithms in Graphs and Game Graphs
V Loitzenbauer
2015
A ROI optimizing and a randomized approach for sponsored search
V Loitzenbauer
uniwien, 2012
2012
Lower Bounds for Symbolic Computation on Graphs
K Chatterjee, W Dvořák, M Henzinger, V Loitzenbauer
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–17