A Discrete Subexponential Algorithm for Parity Games

@inproceedings{Bjrklund2003ADS,
  title={A Discrete Subexponential Algorithm for Parity Games},
  author={Henrik Bj{\"o}rklund and Sven Sandberg and Sergei G. Vorobyov},
  booktitle={STACS},
  year={2003}
}
We suggest a new randomized algorithm for solving parity games with worst case time complexity roughly 
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 140 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 51 extracted citations

Parity games and the automaticity of modal μ

2012
View 5 Excerpts
Highly Influenced

Non-oblivious Strategy Improvement

LPAR • 2010
View 1 Excerpt
Highly Influenced

Mean-payoff parity games

20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05) • 2005
View 4 Excerpts
Highly Influenced

141 Citations

01020'03'06'10'14'18
Citations per Year
Semantic Scholar estimates that this publication has 141 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

A discrete subexponential algorithm for parity games

H. Björklund, S. Sandberg, S. Vorobyov
Technical Report 2002-026, • 2002

Fast and Simple Nested Fixpoints

Universität Trier, Mathematik/Informatik, Forschungsbericht • 1996
View 1 Excerpt