- Md. Enamul Kabir, Hua Wang, Elisa Bertino. Efficient systematic clustering method for ::::k::::-anonymization. Acta Informatica, 48(1):51-66, 2011.
- Markus N. Rabe, Sven Schewe. Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games. Acta Informatica, 48(5-6):291-315, 2011.
- Victor Mitrana, Cristina Tîrnauca. New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries. Acta Informatica, 48(1):43-50, 2011.
- Daniel Seidel, Janis Voigtländer. Refined typing to localize the impact of forced strictness on free theorems. Acta Informatica, 48(3):191-211, 2011.
- Frank Drewes, Johanna Högberg, Andreas Maletti. MAT learners for tree series: an abstract data type and two realizations. Acta Informatica, 48(3):165-189, 2011.
- Daowen Qiu, Lvzhou Li, Xiangfu Zou, Paulo Mateus, Jozef Gruska. Multi-letter quantum finite automata: decidability of the equivalence and minimization of states. Acta Informatica, 48(5-6):271-290, 2011.
- Tien Van Do, Ram Chakka, Nam H. Do, László Pap. A Markovian queue with varying number of servers and applications to the performance comparison of HSDPA user equipment. Acta Informatica, 48(4):243-269, 2011.
- Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein. Avoidable binary patterns in partial words. Acta Informatica, 48(1):25-41, 2011.
- Juha Honkala. A characterization of rational D0L power series. Acta Informatica, 48(1):19-24, 2011.
- Sándor Vágvölgyi. CHAP and rewrite components. Acta Informatica, 48(5-6):317-361, 2011.