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

DOI10.1109/LICS.2015.34zbMath1401.68190MaRDI QIDQ4635810

Krishnendu Chatterjee, Veronika Loitzenbauer, Monika R. Henzinger

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time ⋮ Unnamed Item ⋮ Quantitative fair simulation games

This page was built for publication: Improved Algorithms for One-Pair and k-Pair Streett Objectives