- Philippe Moser. A zero-one SUBEXP-dimension law for BPP. Inf. Process. Lett., 111(9):429-432, 2011.
- Manfred Schmidt-Schauß, David Sabel, Elena Machkasova. Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec. Inf. Process. Lett., 111(14):711-716, 2011.
- Javier Herranz, Fabien Laguillaumie, Carla Ràfols. Relations between semantic security and anonymity in identity-based encryption. Inf. Process. Lett., 111(10):453-460, 2011.
- Hai-Zhong Shi, Pan-feng Niu, Jian-bo Lu. One conjecture of bubble-sort graphs. Inf. Process. Lett., 111(18):926-929, 2011.
- Xia Zhang, Guizhen Liu. On edge covering colorings of graphs. Inf. Process. Lett., 111(20):1004-1006, 2011.
- Chunming Tang, MaoZhi Xu, Yanfeng Qi. Faster pairing computation on genus 2 hyperelliptic curves. Inf. Process. Lett., 111(10):494-499, 2011.
- Alberto Policriti, Alexandru I. Tomescu. Counting extensional acyclic digraphs. Inf. Process. Lett., 111(16):787-791, 2011.
- Toufik Mansour, Ghalib Nassar, Vincent Vajnovszki. Loop-free Gray code algorithm for the e-restricted growth functions. Inf. Process. Lett., 111(11):541-544, 2011.
- Jianhua Tu, Wenli Zhou. A factor 2 approximation algorithm for the vertex cover P::3:: problem. Inf. Process. Lett., 111(14):683-686, 2011.
- Dragana Bajic, Alister G. Burr. Comments on Integer SEC-DED codes for low power communications [Inform. Process. Lett. 110 (2010) 518-520]. Inf. Process. Lett., 111(9):414-415, 2011.