Searching for "STACS 2000" – sorted by Relevance.
-
Games for Verification: Algorithmic Issues
- . Small Progress Measures for Solving Parity Games. In Horst Reichel and Sophie Tison, editors, STACS 2000
- Cited by 1 (0 self) – Add To MetaCart
-
Small Progress Measures for Solving Parity Games
- , editors, STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, Lille
- Cited by 44 (4 self) – Add To MetaCart
-
On the Many Faces of Block Codes
- , Helsinki, Finland H. Reichel and S. Tison (Eds.): STACS 2000, LNCS 1770, pp. 53ā64, 2000. cā Springer
- Cited by 4 (0 self) – Add To MetaCart
-
Approximations for lambda-Coloring of Graphs
- Annual Symposium on Theoretical Aspects of Computer Science STACS 2000 [7]. That report contains
- Cited by 3 (0 self) – Add To MetaCart
-
Undecidability of Domino Games
- wants to show 1 A revised and extended version of the STACS 2000 extended abstract [16]. 2 The work
- Add To MetaCart
-
Average-Case Quantum Query Complexity
- Annual Symposium on Theoretical Aspects of Computer Science (STACS'2000), Springer, LNCS 1770, 2000. y
- Cited by 3 (1 self) – Add To MetaCart
-
Hereditary history preserving bisimilarity is undecidable
- Bisimilarity Is Undecidable. In Horst Reichel and Sophie Tison, editors, STACS 2000, 17th Annual Symposium
- Cited by 8 (1 self) – Add To MetaCart
-
Small Progress Measures for Solving Parity Games
- , editors, STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, Lille
- Add To MetaCart
-
Simulation and Bisimulation over One-Counter Processes
- Proceedings of STACS2000: Symposium in Theoretical Aspects of Computer Science. Simulation
- Cited by 8 (5 self) – Add To MetaCart
-
Decidability of Reachability Problems for Classes of Two . . .
- Science (STACS'2000), Lille, France, Feb. 2000. volume 1770 in Lecture Notes in Computer Science, pages
- Cited by 2 (0 self) – Add To MetaCart

