𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE 2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS) - Los Angeles, California, USA (2009.08.11-2009.08.14)] 2009 24th Annual IEEE Symposium on Logic In Computer Science - Expressiveness and Closure Properties for Quantitative Languages

✍ Scribed by Chatterjee, Krishnendu; Doyen, Laurent; Henzinger, Thomas A.

Book ID: 126705952
Publisher: IEEE
Year: 2009
Weight: 314 KB
Category: Article
ISBN: 0769537464
DOI: 10.1109/LICS.2009.16

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 2009 24th Annual IEEE Symposium on

[IEEE 2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS) - Los Angeles, California, USA (2009.08.11-2009.08.14)] 2009 24th Annual IEEE Symposium on Logic In Computer Science - Logics with Rank Operators

✍ Dawar, Anuj; Grohe, Martin; Holm, Bjarki; Laubner, Bastian 📂 Article 📅 2009 🏛 IEEE ⚖ 339 KB

[IEEE 2009 24th Annual IEEE Symposium on

[IEEE 2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS) - Los Angeles, California, USA (2009.08.11-2009.08.14)] 2009 24th Annual IEEE Symposium on Logic In Computer Science - Computation and the Periodic Table

✍ Baez, John 📂 Article 📅 2009 🏛 IEEE ⚖ 99 KB

[IEEE 2009 24th Annual IEEE Symposium on

[IEEE 2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS) - Los Angeles, California, USA (2009.08.11-2009.08.14)] 2009 24th Annual IEEE Symposium on Logic In Computer Science - Pointer Programs and Undirected Reachability

✍ Hofmann, Martin; Schopp, Ulrich 📂 Article 📅 2009 🏛 IEEE ⚖ 376 KB

[IEEE 2009 24th Annual IEEE Symposium on

[IEEE 2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS) - Los Angeles, California, USA (2009.08.11-2009.08.14)] 2009 24th Annual IEEE Symposium on Logic In Computer Science - Co-ing Büchi Made Tight and Useful

✍ Boker, Udi; Kupferman, Orna 📂 Article 📅 2009 🏛 IEEE ⚖ 292 KB

[IEEE 2009 24th Annual IEEE Symposium on

[IEEE 2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS) - Los Angeles, California, USA (2009.08.11-2009.08.14)] 2009 24th Annual IEEE Symposium on Logic In Computer Science - Graph Reachability and Pebble Automata over Infinite Alphabets

✍ Tan, Tony 📂 Article 📅 2009 🏛 IEEE ⚖ 266 KB

[IEEE 2009 24th Annual IEEE Symposium on

[IEEE 2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS) - Los Angeles, California, USA (2009.08.11-2009.08.14)] 2009 24th Annual IEEE Symposium on Logic In Computer Science - A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics

✍ Kazakov, Yevgeny; Pratt-Hartmann, Ian 📂 Article 📅 2009 🏛 IEEE ⚖ 318 KB