- Zihui Liu. On some families of binary codes. Inf. Process. Lett., 191:106591, 2026.
- TianQi Chen, Zhiyi Tan 0001. Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan. Inf. Process. Lett., 191:106598, 2026.
- Stefan Kiefer, Andrew Ryzhikov. The complexity of computing the period and the exponent of a digraph. Inf. Process. Lett., 191:106590, 2026.
- Xian Xu, Wenbo Zhang. Logical characterization of branching bisimilarity over random processes. Inf. Process. Lett., 191:106596, 2026.
- Sam Buss, Neil Thapen. A simple supercritical tradeoff between size and height in resolution. Inf. Process. Lett., 191:106589, 2026.
- Manoj Gyawali. Rank-2 module-LIP with special matrices. Inf. Process. Lett., 191:106593, 2026.
- Marcin Peczarski. Note on pancake sorting. Inf. Process. Lett., 191:106597, 2026.
- Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson 0001, Zara Lim, Wing-Kin Sung, Wiktor Zuba. Finding the cyclic covers of a string. Inf. Process. Lett., 191:106594, 2026.
- Vladimir Edemskiy, Zeyu Cao. Notes about the linear complexity of quaternary cyclotomic sequences of order four. Inf. Process. Lett., 191:106595, 2026.
- Lixing Tan, Zhaohui Zhu, Jinjin Zhang. Reduced meet over labelling-based semantics in abstract argumentation. Inf. Process. Lett., 187:106514, 2025.