Information and Computation

Article	Citations
Nondeterminism and the clique problem	36
On Boolean threshold functions with minimum specification number	29
Editorial Board	20
26th Workshop on Logic, Language, Information and Computation – WoLLIC 2019	19
Scooby: Improved multi-party homomorphic secret sharing based on FHE	19
A computable and compositional semantics for hybrid systems	18
Zeroing neural network based on the equation AXA = A	17
Kolmogorov complexity in the USSR (1975–1982): Isolation and its end	15
One-shot learning for k-SAT	14
Survey on mining signal temporal logic specifications	14
Parameterized problems complete for nondeterministic FPT time and logarithmic space	12
Variable version Lovász local lemma: A tale of two boundaries	11
Vladimir V’yugin: Short biography and some research contributions	10
Extending the reach of the point-to-set principle	9
Towards a theoretical understanding of why local search works for clustering with fair-center representation	9
Satisfiability checking for Mission-time LTL (MLTL)	9
Editorial Board	8
Optimal regular expressions for palindromes of given length	8
Eilenberg's variety theorem without Boolean operations	8
On the complexity of decision problems for some classes of machines and applications	8
Preface	8
Recent algorithmic advances in simple temporal networks with uncertainty: From faster controllability checking to faster execution	7
Editorial Board	7
Weighted automata and logics meet computational complexity	7
r-indexing the eBWT	7

Composite event recognition with arbitrary specifications	7
The membership problem for subsemigroups of GL<	7
Effective notions of weak convergence of measures on the real line	6
Are bundles good deals for first-order modal logic?	6
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice	6
Bridging computational notions of depth	6
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source	6
Complexity thresholds in inclusion logic	6
Atomic cross-chain swaps with improved space, time and local time complexities	6
Secretive interaction	5
Finite-word hyperlanguages	5
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas	5
Context-sensitive fusion grammars and fusion grammars with forbidden context are universal	5
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees	5
Editorial Board	5
On the data persistency of replicated erasure codes in distributed storage systems	5
The g-good-neighbor diagnosability of product networks under the PMC model	5
Pushdown and Lempel-Ziv depth	5
A hierarchy of constant communication complexity	5
Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric	4
Approximating the directed path partition problem	4
Computable one-way functions on the reals	4
Editorial Board	4
Spiking neural P systems with non-gated channels	4
The computational properties of P systems with mutative membrane structures	4
Editorial Board	4
Complete axiomatization and decidability of the logic of two-agent cooperative strategic interaction	4
Special issue on 10th international workshop Weighted Automata: Theory and Applications (WATA 2020)	4
Applications of littlestone dimension to query learning and to compression	4
Parameterized approximation schemes for fair-range clustering	4
On regular trees defined from unfoldings and coverings	4
Improved bounds on the length of shortest strings accepted by two-way finite automata	4
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form	4
Modelling mutual exclusion in a process algebra with time-outs	4
Intersection and union hierarchies of deterministic context-free languages and pumping lemmas	4
Constructing and indexing the bijective and extended Burrows–Wheeler transform	4
Solving mean-payoff games via quasi dominions	3
Impossibility of depth reduction in explainable clustering	3
Model checking timed recursive CTL	3
Editorial Board	3
Efficient and competitive broadcast in multi-channel radio networks	3
The geometry of reachability in continuous vector addition systems with states	3
Synchronizing deterministic push-down automata can be really hard	3
A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces	3
Projection theorems using effective dimension	3
On the computational power of energy-constrained mobile robots	3
Unambiguous injective morphisms in free groups	3
Two-state spin systems with negative interactions	3
Editorial Board	3
Probabilistic input-driven pushdown automata	3

Multiple interdependent Simple Temporal Networks with Uncertainty: A semi-decentralized multi-agent model with shared control of activity durations	3
Complexity of automatic sequences	3
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages	3
Polynomial Turing compressions for some graph problems parameterized by modular-width	3
A parallel algorithm for counting parse trees	3
Monomial Boolean functions with large high-order nonlinearities	3
Towards a proof theory for quantifier macros	3
Rational weighted tree languages with storage	3
Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths	3
Preface to “Computation over Compressed Data” at DCC 2022	3
Transduction from trees to graphs through folding	2
Generalising the maximum independent set algorithm via Boolean networks	2
k-Universality of Regular Languages	2
Exchange of indivisible goods under matroid constraints	2
Efficient construction of the BWT for repetitive text using string compression	2
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters	2
Editorial Board	2
Intensional Kleene and Rice theorems for abstract program semantics	2
Competition among parallel contests	2
Usefulness of information and decomposability of unary regular languages	2
The complexity of subcube partition relates to the additive structure of the support	2
Exorcising the phantom zone	2
Dichotomy for Holant* problems with one ternary function on domain size 3	2
Exploiting pseudo-locality of interchange distance	2
Formal verification for event stream processing: Model checking of BeepBeep stream processing pipelines	2
Deterministic quantum search with adjustable parameters: Implementations and applications	2
Relations between equation automata and follow automata	2
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines	2
Chained time lock puzzle with small puzzle size	2
Hennessy-Milner properties via topological compactness	2
Editorial Board	2
Star and h-step-limited star connectivity of exchanged hypercubes	2
Online scheduling with rejection revisited	2
Compact representations of spatial hierarchical structures with support for topological queries	2
The Billaud Conjecture for alphabet size 4	2
Order-preserving pattern matching indeterminate strings	2
Building a small and informative phylogenetic supertree	2
On linear languages recognized by deterministic biautomata	2
Topologies for error-detecting variable-length codes	2
Cyclic operator precedence grammars for parallel parsing	2
Corrigendum to “On the equivalence of uniform key agreement and sequential composition insecurity” [Information and Computation 307 (2025) 105365]	2
Randomness below complete theories of arithmetic	2
Special issue: Formal verification of cyber-physical systems	2
Existential and universal width of alternating finite automata	2
On algorithms based on finitely many homomorphism counts	2
Learnability and positive equivalence relations	2
The geometry of computable Banach spaces	2
Generalized alternating-time temporal logics I: Semantics	2
Algebraic barriers to halving algorithmic information quantities in correlated strings	2
Binary and circular automata having maximal state complexity for the set of synchronizing words	2
Beyond PCSP(1-in-3,NAE)	2
Cayley polynomial–time computable groups	2
Succinctness issues for LTL and safety and cosafety fragments of LTL	2
On the equivalence of uniform key agreement and sequential composition insecurity	1
Noisy beeping networks	1
On the generation and enumeration of prime double square polyominoes	1
The tail-recursive fragment of timed recursive CTL	1
Complexity of round-robin allocation with potentially noisy queries	1
Operational complexity: NFA-to-DFA trade-off	1
The generalized constrained longest common subsequence in the run-length encoded format	1
Linear-time parameterized algorithms with limited local resources	1
Distributed localization of wireless sensor network using communication wheel	1
Detecting arrays for effects of multiple interacting factors	1
Probabilistic judgment aggregation with conditional independence constraints	1
Decision problems for systems of language equations and inequations	1
Breaking Goppa-based McEliece with hints	1
Editorial Board	1
Numerical spiking neural P systems with thresholds	1
Regular languages as images of local functions over small alphabets	1
Decisiveness of stochastic systems and its application to hybrid models	1
Model checking hyperproperties for Markov decision processes	1
Further improvements for SAT in terms of formula length	1
Fixed-parameter algorithms for Fair Hitting Set problems	1
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields	1
Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games	1
An iterative scheme of hybrid controller synthesis for nonlinear systems subject to safety constraints	1
Exact counting of subtrees with diameter no more than d in trees: A generating function approach	1
A perfect matching reciprocity method for embedding multiple hypercubes in an augmented cube: Application to Hamiltonian decomposition	1
Timed network games	1
Exponential time algorithms for deciding regular games	1

Achieving sequenced SQL with log-segmented timestamps	1
The bang calculus revisited	1
Sensitivity of string compressors and repetitiveness measures	1
Editorial Board	1
Combination of roots and boolean operations: An application to state complexity	1
Concept analysis approach for graphs	1
Rauzy complexity and block entropy	1
New characterizations of primitive permutation groups with applications to synchronizing automata	1
Algorithms and complexity for monitoring edge-geodetic sets in graphs	1
Taming Strategy Logic: Non-Recurrent Fragments	1
Lifting proofs from countable to uncountable mathematics	1
Exploring sparse graphs with advice	1
Predictive mining of multi-temporal relations	1
Total (restrained) domination in unit disk graphs	1
Solving Co-Path/Cycle Packing and Co-Path Packing faster than 3k	1
Parikh one-counter automata	1
Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem	1
Double-ended palindromic trees in linear time	1
Measuring the expressive power of practical regular expressions by classical stacking automata models	1
Bounded game-theoretic semantics for modal mu-calculus	1
Bayesian definition of random sequences with respect to conditional probabilities	1
Exploiting social influence to control elections based on positional scoring rules	1
Succinct data structure for path graphs	1
Computing maximal palindromes in non-standard matching models	1
Parameter synthesis of polynomial dynamical systems	1
Algorithmic aspects of secure domination in unit disk graphs	1
Approximation algorithms for non-sequential star packing problems	1
On the complexity of properties of partial bijection semigroups	1
Detecting causality in the presence of Byzantine processes: The case of synchronous systems	1
Finite-time safety and reach-avoid verification of stochastic discrete-time systems	1
Systems of fixpoint equations: Abstraction, games, up-to techniques and local algorithms	1
Enumeration of two dimensional palindromes	1
Efficient assignment of identities in anonymous populations	1
Learning residual alternating automata	1
Deducibility and independence in Beklemishev's autonomous provability calculus	1
Verifying Linear Temporal Properties on Polyhedral Systems: Decidability and Symbolic Algorithms	1
Hardness and approximability of bounded access Lempel Ziv coding	0
Functionality of compositions of top-down tree transducers is decidable	0
Realizability problem for constraint LTL	0
On the equivalence of Occam algorithms	0
Characterization of exact two-query quantum algorithms	0
A scalable mechanism for mutual fairness in allocating replicable resources	0
Recent developments in theory and tool support for hybrid systems verification with HyPro	0
Special issue on selected papers from the 19th International Workshop on Algorithms and Computation (WALCOM 2025)	0
On the complexity of approximately matching a string to a directed graph	0
Regular matching and inclusion on compressed tree patterns with constrained context variables	0
Assumptions of randomness in cosmology models	0
Distance labeling schemes for K4-free bridged graphs	0
Editorial Board	0
Logical equivalences, homomorphism indistinguishability, and forbidden minors	0
Cost-asymmetric memory hard password hashing	0
Special Issue: Selected papers of the 15th International Conference on Language and Automata Theory and Applications, LATA 2021	0
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs	0
Almost uniform deployment of mobile agents in dynamic rings	0
Bounded complete domains and their logical form	0
Linear-time safe-alternating DFS and SCCs	0
A pumping lemma for regular closure of prefix-free languages	0
Asymptotically optimal synthesis of reversible circuits	0
Editorial Board	0
A new class of string transformations for compressed text indexing	0
Modification problems toward proper (Helly) circular-arc graphs	0
Preface	0
External contextual grammars with resources restricted and structure limited selection	0
Minimal obstructions to C5-coloring in hereditary graph classes	0
Converting nondeterministic two-way automata into small deterministic linear-time machines	0
Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class	0
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs	0
Improved approximations for the capacitated vehicle routing problem with fixed capacity	0
Truthful and privacy-preserving generalized linear models	0
Arena-independent memory bounds for Nash equilibria in reachability games	0
Preface to special issue: EXPRESS/SOS 2019 and EXPRESS/SOS 2020	0
Asymptotic elimination of partially continuous aggregation functions in directed graphical models	0
Collision-free exploration by mobile agents using pebbles	0
Synchronous t-resilient consensus in arbitrary graphs	0
Editorial Board	0
Descriptive complexity and weighted Turing machines	0
Hierarchical identification of nonlinear hybrid systems in a Bayesian framework	0
The Caucal hierarchy: Interpretations in the (W)MSO+U logic	0
Complexity of exclusive nondeterministic finite automata	0
mrNISC from LWE with polynomial modulus	0
Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond	0
Editorial Board	0
Clustering categorical data: Soft rounding k-modes	0
Traceable constant-size multi-authority credentials	0
On Jaffe's pumping lemma, revisited	0
Pushdown and one-counter automata: Constant and non-constant memory usage	0
Weighted two-way transducers	0
Special Issue of PLACES 2022	0
On the containment problem for deterministic multicounter machine models	0
Encoding inductive invariants as barrier certificates: Synthesis via difference-of-convex programming	0
Editorial Board	0
Matroid and Knapsack House Allocation	0
On parallelisms of PG(3,4) with automorphisms of order 2	0
Causal computational complexity of distributed processes	0
Entropic risk for turn-based stochastic games	0