- Vesa Halava, Stepan Holub. Reduction Tree of the Binary Generalized Post Correspondence Problem. Int. J. Found. Comput. Sci., 22(2):473-490, 2011.
- Amaldev Manuel, Ramaswamy Ramanujam. Class Counting Automata on Datawords. Int. J. Found. Comput. Sci., 22(4):863-882, 2011.
- Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa. Reliable Communication on Emulated Channels Resilient to Transient Faults. Int. J. Found. Comput. Sci., 22(5):1099-1122, 2011.
- Akihiro Fujiwara, Hirotsugu Kakugawa, Koji Nakano. Preface. Int. J. Found. Comput. Sci., 22(5), 2011.
- Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine. Automatic Verification of Directory-Based Consistency Protocols with Graph Constraints. Int. J. Found. Comput. Sci., 22(4):761-782, 2011.
- Marie-Pierre Béal, Mikhail V. Berlinkov, Dominique Perrin. A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Int. J. Found. Comput. Sci., 22(2):277-288, 2011.
- Yo-Sub Han, Kai Salomaa. Overlap-Free Languages and solid Codes. Int. J. Found. Comput. Sci., 22(5):1197-1209, 2011.
- Anne Benoit, Veronika Rehn-Sonigo, Yves Robert, Henri Casanova. Resource Allocation Strategies for Constructive in-Network Stream Processing. Int. J. Found. Comput. Sci., 22(3):621-638, 2011.
- Stepan Holub. Binary Morphisms with Stable Suffix Complexity. Int. J. Found. Comput. Sci., 22(3):699-712, 2011.
- Jürgen Dassow, György Vaszil. On the Number of Active Symbols in Lindenmayer Systems. Int. J. Found. Comput. Sci., 22(1):223-235, 2011.