✦ LIBER ✦
[Lecture Notes in Computer Science] STACS 99 Volume 1563 || In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
✍ Scribed by Meinel, Christoph; Tison, Sophie
- Book ID
- 118123983
- Publisher
- Springer Berlin Heidelberg
- Year
- 1999
- Tongue
- German
- Weight
- 110 KB
- Category
- Article
- ISBN
- 3540491163
No coin nor oath required. For personal study only.
✦ Synopsis
This Book Constitutes The Refereed Proceedings Of The 16th Annual Symposium On Theoretical Aspects Of Computer Science, Stacs 99, Held In Trier, Germany In March 1999. The 51 Revised Full Papers Presented Were Selected From A Total Of 146 Submissions. Also Included Are Three Invited Papers. The Volume Is Divided In Topical Sections On Complexity, Parallel Algorithms, Computational Geometry, Algorithms And Data Structures, Automata And Formal Languages, Verification, Algorithmic Learning, And Logic In Computer Science.