Inf. Comput.

Keyphrases

Publications

volume 296, 2024

Somayyeh Golalizadeh, Nasrin Soltankhah
On the codewords of generalized Reed-Muller codes reaching the fourth weight. Inf. Comput. 296 (2024)
Surya Teja Gavva, Karthik C. S., Sharath Punna
-modes. Inf. Comput. 296 (2024)
Olga Martynova
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs. Inf. Comput. 296 (2024)
Paul C. Bell, Mika Hirvensalo, Igor Potapov
The membership problem for subsemigroups of GL2(Z) is NP-complete. Inf. Comput. 296 (2024)
Sebastian Maneth, Helmut Seidl, Martin Vu
Functionality of compositions of top-down tree transducers is decidable. Inf. Comput. 296 (2024)
Isaac Mackey, Raghubir Chimni, Jianwen Su
Early detection of temporal constraint violations. Inf. Comput. 296 (2024)
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct data structure for path graphs. Inf. Comput. 296 (2024)
Yuri V. Matiyasevich
Towards non-iterative calculation of the zeros of the Riemann zeta function. Inf. Comput. 296 (2024)
Clemente Galdi, Stanislaw Jarecki
Special Issue on 13th International Conference on Security and Cryptography for Networks (SCN 2022). Inf. Comput. 296 (2024)
Ashwin Bhaskar, M. Praveen
Realizability problem for constraint LTL. Inf. Comput. 296 (2024)
Balázs Gerencsér, Zsombor Várkonyi
Fast synchronization of inhomogenous random automata. Inf. Comput. 296 (2024)
Robert Bredereck, Junjie Luo
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas. Inf. Comput. 296 (2024)
Shouda Wang, Weijie Zheng, Benjamin Doerr
Choosing the right algorithm with hints from complexity theory. Inf. Comput. 296 (2024)

volume 295, number Part B, 2023

Peter Kostolányi
Bideterministic weighted automata. Inf. Comput. 295 (Part B) (2023)
Jean Néraud
Topologies for error-detecting variable-length codes. Inf. Comput. 295 (Part B) (2023)
Martin Berglund, Henrik Björklund, Johanna Björklund, Adrien Boiret
Transduction from trees to graphs through folding. Inf. Comput. 295 (Part B) (2023)
Spyros Angelopoulos
Online search with a hint. Inf. Comput. 295 (Part B) (2023)
Henning Fernau, Petra Wolf, Tomoyuki Yamakami
Synchronizing deterministic push-down automata can be really hard. Inf. Comput. 295 (Part B) (2023)
Jinshan Zhang, Bo Tang, Jianwei Yin
Exchange of indivisible goods under matroid constraints. Inf. Comput. 295 (Part B) (2023)
Fan Feng, Andreas Maletti
Weighted two-way transducers. Inf. Comput. 295 (Part B) (2023)
Ari Shaller, Linir Zamir, Mehrdad Nojoumian
Roadmap of post-quantum cryptography standardization: Side-channel attacks and countermeasures. Inf. Comput. 295 (Part B) (2023)
Masahiro Hamano
A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces. Inf. Comput. 295 (Part B) (2023)
Cai-Xia Wang, Yu Yang, Shou-Jun Xu
Algorithmic aspects of secure domination in unit disk graphs. Inf. Comput. 295 (Part B) (2023)

volume 294, 2023

volume 293, 2023