- Sebastian Maneth, Helmut Seidl, Martin Vu. Functionality of compositions of top-down tree transducers is decidable. Inf. Comput., 296:105131, January 2024.
- Yuri V. Matiyasevich. Towards non-iterative calculation of the zeros of the Riemann zeta function. Inf. Comput., 296:105130, January 2024.
- Paul C. Bell, Mika Hirvensalo, Igor Potapov. The membership problem for subsemigroups of GL2(Z) is NP-complete. Inf. Comput., 296:105132, January 2024.
- Balázs Gerencsér, Zsombor Várkonyi. Fast synchronization of inhomogenous random automata. Inf. Comput., 296:105129, January 2024.
- Olga Martynova 0001. Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs. Inf. Comput., 296:105127, January 2024.
- Robert Bredereck, Junjie Luo 0001. Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas. Inf. Comput., 296:105128, January 2024.
- Clemente Galdi, Stanislaw Jarecki. Special Issue on 13th International Conference on Security and Cryptography for Networks (SCN 2022). Inf. Comput., 296:105135, January 2024.
- Shouda Wang, Weijie Zheng 0001, Benjamin Doerr. Choosing the right algorithm with hints from complexity theory. Inf. Comput., 296:105125, January 2024.
- Somayyeh Golalizadeh, Nasrin Soltankhah. On the codewords of generalized Reed-Muller codes reaching the fourth weight. Inf. Comput., 296:105113, January 2024.
- Surya Teja Gavva, Karthik C. S., Sharath Punna. k-modes. Inf. Comput., 296:105115, January 2024.