𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] SOFSEM 2010: Theory and Practice of Computer Science Volume 5901 || Symbolic OBDD-Based Reachability Analysis Needs Exponential Space

✍ Scribed by Leeuwen, Jan; Muscholl, Anca; Peleg, David; Pokorný, Jaroslav; Rumpe, Bernhard

Book ID
111900768
Publisher
Springer Berlin Heidelberg
Year
2010
Tongue
German
Weight
225 KB
Category
Article
ISBN
3642112668

No coin nor oath required. For personal study only.

✦ Synopsis

This Book Constitutes The Refereed Proceedings Of The 36th Conference On Current Trends In Theory And Practice Of Computer Science, Sofsem 2010, Held In Špindleruv Mlýn, Czech Republic, In January 2009. The 53 Revised Full Papers, Presented Together With 11 Invited Contributions, Were Carefully Reviewed And Selected From 134 Submissions. Sofsem 2010 Was Organized Around The Following Four Tracks: Foundations Of Computer Science, Principles Of Software Construction, Data, Knowledge, And Intelligent Systems And Web Science.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] SOFS
[Lecture Notes in Computer Science] SOFSEM 2010: Theory and Practice of Computer Science Volume 5901 || Improving Classification Performance with Focus on the Complex Areas
✍ van Leeuwen, Jan; Muscholl, Anca; Peleg, David; Pokorný, Jaroslav; Rumpe, Bernha 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 317 KB

This Book Constitutes The Refereed Proceedings Of The 36th Conference On Current Trends In Theory And Practice Of Computer Science, Sofsem 2010, Held In Špindleruv Mlýn, Czech Republic, In January 2009. The 53 Revised Full Papers, Presented Together With 11 Invited Contributions, Were Carefully Revi

[Lecture Notes in Computer Science] SOFS
[Lecture Notes in Computer Science] SOFSEM 2009: Theory and Practice of Computer Science Volume 5404 || On Stateless Deterministic Restarting Automata
✍ Nielsen, Mogens; Kučera, Antonín; Miltersen, Peter Bro; Palamidessi, Catuscia; T 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 221 KB

This book constitutes the refereed proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2009, held in Špindleruv Mlýn, Czech Republic, in January 2009. The 49 revised full papers, presented together with 9 invited contributions, were carefully revie

[Lecture Notes in Computer Science] LATI
[Lecture Notes in Computer Science] LATIN 2006: Theoretical Informatics Volume 3887 || Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
✍ Correa, José R.; Hevia, Alejandro; Kiwi, Marcos 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 478 KB

This Book Constitutes The Refereed Proceedings Of The 7th International Symposium, Latin American Theoretical Informatics, Latin 2006, Held In March 2006. The 66 Revised Full Papers Presented Together With Seven Invited Papers Were Carefully Reviewed And Selected From 224 Submissions. The Papers Pre

[Lecture Notes in Computer Science] Abst
[Lecture Notes in Computer Science] Abstract State Machines - Theory and Applications Volume 1912 || Symbolic Analysis of Transition Systems?
✍ Gurevich, Yuri; Kutter, Philipp W.; Odersky, Martin; Thiele, Lothar 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 596 KB

The ASM 2000 workshop was held in the conference center of the Swiss Federal Institute of Technology (ETH) at Monte Verit a, Canton Ticino, March 19-24, 2000. The ASM formalism was proposed together with the thesis that it is suitable to model arbitrary computer systems on arbitrary abstraction leve