Information and Computation

Article	Citations
Nondeterminism and the clique problem	36
On Boolean threshold functions with minimum specification number	33
On the decidability of the valuedness problem for two-way finite transducers	24
26th Workshop on Logic, Language, Information and Computation – WoLLIC 2019	18
Geometric bounds for convergence rates of averaging algorithms	18
Editorial Board	18
On quotients of formal power series	17
Scooby: Improved multi-party homomorphic secret sharing based on FHE	17
A computable and compositional semantics for hybrid systems	15
Zeroing neural network based on the equation AXA = A	14
Kolmogorov complexity in the USSR (1975–1982): Isolation and its end	14
One-shot learning for k-SAT	14
Variable version Lovász local lemma: A tale of two boundaries	12
Parameterized problems complete for nondeterministic FPT time and logarithmic space	11
Survey on mining signal temporal logic specifications	11
Extending the reach of the point-to-set principle	10
Satisfiability checking for Mission-time LTL (MLTL)	10
Vladimir V’yugin: Short biography and some research contributions	10
Eilenberg's variety theorem without Boolean operations	9
Weighted automata and logics meet computational complexity	9
Editorial Board	9
Automatic pre- and postconditions for partial differential equations	9
Towards a theoretical understanding of why local search works for clustering with fair-center representation	9
Preface	8
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement	8

Composite event recognition with arbitrary specifications	7
The membership problem for subsemigroups of GL<	7
Topological mixing notions on Turing machine dynamical systems	7
r-indexing the eBWT	7
Recent algorithmic advances in simple temporal networks with uncertainty: From faster controllability checking to faster execution	7
On the complexity of decision problems for some classes of machines and applications	7
Secretive interaction	6
A new framework for deniable secure key exchange	6
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice	6
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees	6
Are bundles good deals for first-order modal logic?	6
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source	6
The g-good-neighbor diagnosability of product networks under the PMC model	6
Bridging computational notions of depth	6
Complete axiomatization and decidability of the logic of two-agent cooperative strategic interaction	6
Effective notions of weak convergence of measures on the real line	6
Complexity thresholds in inclusion logic	6
Atomic cross-chain swaps with improved space, time and local time complexities	6
Finite-word hyperlanguages	6
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas	6
On the data persistency of replicated erasure codes in distributed storage systems	5
Context-sensitive fusion grammars and fusion grammars with forbidden context are universal	5
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form	5
A hierarchy of constant communication complexity	5
Editorial Board	5
Computable one-way functions on the reals	5
Special issue on 10th international workshop Weighted Automata: Theory and Applications (WATA 2020)	5
Pushdown and Lempel-Ziv depth	5
Approximating the directed path partition problem	5
Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric	5
Applications of littlestone dimension to query learning and to compression	4
Modelling mutual exclusion in a process algebra with time-outs	4
Constructing and indexing the bijective and extended Burrows–Wheeler transform	4
Preface to “Computation over Compressed Data” at DCC 2022	4
Solving mean-payoff games via quasi dominions	4
Synchronizing deterministic push-down automata can be really hard	4
A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces	4
Editorial Board	4
The computational properties of P systems with mutative membrane structures	4
On regular trees defined from unfoldings and coverings	4
Impossibility of depth reduction in explainable clustering	4
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages	4
Fairness and communication-based semantics for session-typed languages	4
Polynomial Turing compressions for some graph problems parameterized by modular-width	4
Spiking neural P systems with non-gated channels	4
Editorial Board	4
Intersection and union hierarchies of deterministic context-free languages and pumping lemmas	4
Isomorphism testing of read-once functions and polynomials	4
Projection theorems using effective dimension	4
Complexity of automatic sequences	4

Randomness and uniform distribution modulo one	4
On the computational power of energy-constrained mobile robots	4
Monomial Boolean functions with large high-order nonlinearities	3
Building a small and informative phylogenetic supertree	3
Two-state spin systems with negative interactions	3
Compact representations of spatial hierarchical structures with support for topological queries	3
Exploiting pseudo-locality of interchange distance	3
Unambiguous injective morphisms in free groups	3
On linear languages recognized by deterministic biautomata	3
The geometry of reachability in continuous vector addition systems with states	3
Robust, expressive, and quantitative linear temporal logics: Pick any two for free	3
Succinctness issues for LTL and safety and cosafety fragments of LTL	3
Efficient construction of the BWT for repetitive text using string compression	3
The complexity of subcube partition relates to the additive structure of the support	3
Topologies for error-detecting variable-length codes	3
Cayley polynomial–time computable groups	3
Competition among parallel contests	3
Load balanced distributed directories	3
Towards a proof theory for quantifier macros	3
Editorial Board	3
Rational weighted tree languages with storage	3
A parallel algorithm for counting parse trees	3
Efficient and competitive broadcast in multi-channel radio networks	3
The Billaud Conjecture for alphabet size 4	3
Optimizing reachability sets in temporal graphs by delaying	3
On continued fraction randomness and normality	3
Reachability games with relaxed energy constraints	3
Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths	3
Editorial Board	3
Probabilistic input-driven pushdown automata	3
Model checking timed recursive CTL	3
Algebraic barriers to halving algorithmic information quantities in correlated strings	3
Chained time lock puzzle with small puzzle size	2
Order-preserving pattern matching indeterminate strings	2
Noisy beeping networks	2
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters	2
The tail-recursive fragment of timed recursive CTL	2
Transduction from trees to graphs through folding	2
Timed network games	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
Special issue: Formal verification of cyber-physical systems	2
The generalized constrained longest common subsequence in the run-length encoded format	2
Usefulness of information and decomposability of unary regular languages	2
Dichotomy for Holant* problems with one ternary function on domain size 3	2
Optimal in-place suffix sorting	2
k-Universality of Regular Languages	2
Distributed localization of wireless sensor network using communication wheel	2
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines	2
Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem	2
Online scheduling with rejection revisited	2
An iterative scheme of hybrid controller synthesis for nonlinear systems subject to safety constraints	2
Corrigendum to “On the equivalence of uniform key agreement and sequential composition insecurity” [Information and Computation 307 (2025) 105365]	2
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields	2
Randomness below complete theories of arithmetic	2
Incentive ratio: A game theoretical analysis of market equilibria	2
On algorithms based on finitely many homomorphism counts	2
Generalising the maximum independent set algorithm via Boolean networks	2
Characterising spectra of equivalences for event structures, logically	2
A self-stabilizing Hashed Patricia Trie	2
Editorial Board	2
Binary and circular automata having maximal state complexity for the set of synchronizing words	2
Existential and universal width of alternating finite automata	2
A perfect matching reciprocity method for embedding multiple hypercubes in an augmented cube: Application to Hamiltonian decomposition	2
Deducibility and independence in Beklemishev's autonomous provability calculus	2
Cyclic operator precedence grammars for parallel parsing	2
Model checking hyperproperties for Markov decision processes	2
Learnability and positive equivalence relations	2
Measuring the expressive power of practical regular expressions by classical stacking automata models	2
Exchange of indivisible goods under matroid constraints	2
Achieving sequenced SQL with log-segmented timestamps	2
Beyond PCSP(1-in-3,NAE)	2
Relations between equation automata and follow automata	2
Exorcising the phantom zone	2
Intensional Kleene and Rice theorems for abstract program semantics	2
Hennessy-Milner properties via topological compactness	2
Computing maximal palindromes in non-standard matching models	2
The geometry of computable Banach spaces	2
Editorial Board	2
Exploiting social influence to control elections based on positional scoring rules	2

Operational complexity: NFA-to-DFA trade-off

2