×

Found 23 Documents (Results 1–23)

A faster deterministic exponential time algorithm for energy games and mean payoff games. (English) Zbl 1522.91066

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 114, 14 p. (2019).
MSC:  91A68 91A43 05C57
PDFBibTeX XMLCite
Full Text: DOI

Infinite-duration bidding games. (English) Zbl 1448.91061

Meyer, Roland (ed.) et al., 28th international conference on concurrency theory. CONCUR 2017, Berlin, Germany, September 5–8, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 85, Article 21, 18 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Finding 2-edge and 2-vertex strongly connected components in quadratic time. (English) Zbl 1410.05203

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 713-724 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Subexponential parameterized algorithm for minimum fill-in. (English) Zbl 1421.68061

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1737-1746 (2012).
PDFBibTeX XMLCite
Full Text: Link

An \(O(n^2)\) time algorithm for alternating Büchi games. (English) Zbl 1421.68110

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1386-1399 (2012).
PDFBibTeX XMLCite
Full Text: arXiv Link

Uniform solution of parity games on prefix-recognizable graphs. (English) Zbl 1270.91017

Kucera, Antonin (ed.) et al., Infinity 2002. Selected papers of the 4th international workshop on verification of infinite-state systems (CONCUR 2002 satellite workshop), Brno, Czech Republic, August 24, 2002. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 68, No. 6, 71-84 (2003).
MSC:  91A43 05C85
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field