Z | |
---|---|
[Zan12] | Fabio Zanasi. Expressiveness of Monadic Second-Order Logics on Infinite Trees of Arbitrary Branching Degrees. Master's thesis, Amsterdam University, the Netherlands, August 2012. |
[Zeu15] | Thomas Zeume. Small Dynamic Complexity Classes. PhD thesis, Dortmund University, Germany, May 2015. |
[Zie98] | Wiesław Zielonka.
Infinite Games on Finitely Coloured Graphs with
Applications to Automata on Infinite Trees.
Theoretical Computer Science 200(1-2):135-183. Elsevier, June 1998.
|
[ZL77] | Jacob Ziv and
Abraham Lempel.
A Universal Algorithm for Sequential Data
Compression.
IEEE Transactions on Information Theory 23(3):337-343. IEEE Inf. Theory Soc., May 1977.
|
[ZL13] | Janan Zaytoon and Stéphane Lafortune. Overview of fault diagnosis methods for Discrete Event Systems. Annual Reviews in Control 37(2):308-320. Elsevier, 2013. |
[ZP96] | Uri Zwick and Mike Paterson. The Complexity of Mean Payoff Games on Graphs. Theoretical Computer Science 158(1-2):343-359. Elsevier, May 1996. |
[ZSS04] | Shipei Zhang,
Oleg Sokolsky, and
Scott A. Smolka.
On the Parallel Complexity of Model Checking in the
Modal Mu-Calculus.
In LICS'04,
pages 154-163.
IEEE Comp. Soc. Press, July 2004.
|
[Zur05] | Richard Zurawski.
Embedded Systems Handbook.
CRC Press, 2005.
|
[ZYN03] | Sarah Zennou,
Manuel Yguel, and
Peter Niebert.
ELSE: A New Symbolic State Generator for Timed
Automata.
In FORMATS'03,
Lecture Notes in Computer Science 2791, pages 273-280. Springer-Verlag, September 2003.
|
Search
Displayed 9 resultsList of authors
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1