Special Issue on Theoretical Aspects of Computer Science (2018)
ISSN:
1432-4350 (Print)
1433-0490 (Online)
In this topical collection (9 articles)
-
OriginalPaper
Lower Bound Techniques for QBF Expansion
Olaf Beyersdorff, Joshua Blinkhorn Pages 400-421 -
OriginalPaper
On the Tree Conjecture for the Network Creation Game
Davide Bilò, Pascal Lenzner Pages 422-443 -
OriginalPaper
On Approximating the Stationary Distribution of Time-Reversible Markov Chains
Marco Bressan, Enoch Peserico, Luca Pretto Pages 444-466 -
OriginalPaper
Dependences in Strategy Logic
Patrick Gardy, Patricia Bouyer, Nicolas Markey Pages 467-507 -
OriginalPaper
Optimal Dislocation with Persistent Errors in Subquadratic Time
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu… Pages 508-521 -
OriginalPaper
Space-Efficient Algorithms for Longest Increasing Subsequence
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer… Pages 522-541 -
OriginalPaper
Additive Number Theory via Automata Theory
Aayush Rajasekaran, Jeffrey Shallit, Tim Smith Pages 542-567
Continue reading...
To view the rest of this content please follow the download PDF link above.