Information and Computation

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

Composite event recognition with arbitrary specifications	7
Automatic pre- and postconditions for partial differential equations	7
Descriptional Complexity of Formal Systems (DCFS 2019)	7
r-indexing the eBWT	6
Complexity thresholds in inclusion logic	6
The g-good-neighbor diagnosability of product networks under the PMC model	6
Topological mixing notions on Turing machine dynamical systems	6
Are bundles good deals for first-order modal logic?	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
The membership problem for subsemigroups of GL<	6
Default logic and bounded treewidth	6
Effective notions of weak convergence of measures on the real line	6
Recent algorithmic advances in simple temporal networks with uncertainty: From faster controllability checking to faster execution	6
Context-sensitive fusion grammars and fusion grammars with forbidden context are universal	5
Finite-word hyperlanguages	5
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source	5
Weighted propositional configuration logics: A specification language for architectures with quantitative features	5
Pushdown and Lempel-Ziv depth	5
Atomic cross-chain swaps with improved space, time and local time complexities	5
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas	5
On the data persistency of replicated erasure codes in distributed storage systems	5
Computable one-way functions on the reals	5
Secretive interaction	5
Approximating the directed path partition problem	5
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees	5
Special issue on 10th international workshop Weighted Automata: Theory and Applications (WATA 2020)	5
Complexity of automatic sequences	4
Intersection and union hierarchies of deterministic context-free languages and pumping lemmas	4
Editorial Board	4
Preface to “Computation over Compressed Data” at DCC 2022	4
Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths	4
Synchronizing deterministic push-down automata can be really hard	4
Editorial Board	4
Isomorphism testing of read-once functions and polynomials	4
Constructing and indexing the bijective and extended Burrows–Wheeler transform	4
Spiking neural P systems with non-gated channels	4
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages	4
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form	4
The computational properties of P systems with mutative membrane structures	4
Modelling mutual exclusion in a process algebra with time-outs	4
Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric	4
On regular trees defined from unfoldings and coverings	4
Randomness and uniform distribution modulo one	3
Two-state spin systems with negative interactions	3
Polynomial Turing compressions for some graph problems parameterized by modular-width	3
Probabilistic input-driven pushdown automata	3
Model checking timed recursive CTL	3
Monomial Boolean functions with large high-order nonlinearities	3
Solving mean-payoff games via quasi dominions	3

Exploiting pseudo-locality of interchange distance	3
Structural properties of NFAs and growth rates of nondeterminism measures	3
Editorial Board	3
Towards a proof theory for quantifier macros	3
Robust, expressive, and quantitative linear temporal logics: Pick any two for free	3
Binary and circular automata having maximal state complexity for the set of synchronizing words	3
A parallel algorithm for counting parse trees	3
Topologies for error-detecting variable-length codes	3
What's decidable about weighted automata?	3
Optimizing reachability sets in temporal graphs by delaying	3
A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces	3
On linear languages recognized by deterministic biautomata	3
Unambiguous injective morphisms in free groups	3
Fairness and communication-based semantics for session-typed languages	3
Projection theorems using effective dimension	3
Efficient and competitive broadcast in multi-channel radio networks	3
Rational weighted tree languages with storage	3
The complexity of subcube partition relates to the additive structure of the support	3
Editorial Board	3
Succinctness issues for LTL and safety and cosafety fragments of LTL	3
On the computational power of energy-constrained mobile robots	3
Editorial Board	3
The geometry of reachability in continuous vector addition systems with states	3
Building a small and informative phylogenetic supertree	2
k-Universality of Regular Languages	2
Cayley polynomial–time computable groups	2
On algorithms based on finitely many homomorphism counts	2
Exchange of indivisible goods under matroid constraints	2
Characterising spectra of equivalences for event structures, logically	2
Operational complexity: NFA-to-DFA trade-off	2
Intensional Kleene and Rice theorems for abstract program semantics	2
Optimal in-place suffix sorting	2
Timed network games	2
Hennessy-Milner properties via topological compactness	2
Exploiting social influence to control elections based on positional scoring rules	2
Cyclic operator precedence grammars for parallel parsing	2
Generalising the maximum independent set algorithm via Boolean networks	2
Usefulness of information and decomposability of unary regular languages	2
Weighted operator precedence languages	2
Randomness below complete theories of arithmetic	2
The Billaud Conjecture for alphabet size 4	2
Editorial Board	2
On continued fraction randomness and normality	2
Deterministic quantum search with adjustable parameters: Implementations and applications	2
Reachability games with relaxed energy constraints	2
Relations between equation automata and follow automata	2
Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem	2
Special issue: Formal verification of cyber-physical systems	2
Finite-time safety and reach-avoid verification of stochastic discrete-time systems	2
Measuring the expressive power of practical regular expressions by classical stacking automata models	2
Formal verification for event stream processing: Model checking of BeepBeep stream processing pipelines	2
Achieving sequenced SQL with log-segmented timestamps	2
Order-preserving pattern matching indeterminate strings	2
The generalized constrained longest common subsequence in the run-length encoded format	2
Beyond PCSP(1-in-3,NAE)	2
Noisy beeping networks	2
Load balanced distributed directories	2
Efficient construction of the BWT for repetitive text using string compression	2
Existential and universal width of alternating finite automata	2
Competition among parallel contests	2
Formal languages over GF(2)	2
Compact representations of spatial hierarchical structures with support for topological queries	2
Incentive ratio: A game theoretical analysis of market equilibria	2
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters	2
Corrigendum to “On the equivalence of uniform key agreement and sequential composition insecurity” [Information and Computation 307 (2025) 105365]	2
Model checking hyperproperties for Markov decision processes	2
An iterative scheme of hybrid controller synthesis for nonlinear systems subject to safety constraints	2
Exorcising the phantom zone	2
The tail-recursive fragment of timed recursive CTL	2
Transduction from trees to graphs through folding	2
A self-stabilizing Hashed Patricia Trie	2
Learnability and positive equivalence relations	2
Computing maximal palindromes in non-standard matching models	2
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines	2
Editorial Board	2
Editorial Board	2
Algebraic barriers to halving algorithmic information quantities in correlated strings	2
Chained time lock puzzle with small puzzle size	2
Taming Strategy Logic: Non-Recurrent Fragments	1
Succinct data structure for path graphs	1

A practical succinct dynamic graph representation	1
Approximation algorithms for non-sequential star packing problems	1
Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games	1
A discrete and continuous study of the Max-Chain-Formation problem	1
Detecting causality in the presence of Byzantine processes: The case of synchronous systems	1
A combinatorial characterization of self-stabilizing population protocols	1
Descriptional complexity of iterated uniform finite-state transducers	1
Linear programming of monitoring the links of a fractional weighted network using distance	1
Deducibility and independence in Beklemishev's autonomous provability calculus	1
A perfect matching reciprocity method for embedding multiple hypercubes in an augmented cube: Application to Hamiltonian decomposition	1
Lifting proofs from countable to uncountable mathematics	1
Concept analysis approach for graphs	1
Bayesian definition of random sequences with respect to conditional probabilities	1
Linear construction of a left Lyndon tree	1
Exact counting of subtrees with diameter no more than d in trees: A generating function approach	1
Learning residual alternating automata	1
Editorial Board	1
Bounded game-theoretic semantics for modal mu-calculus	1
Complexity of round-robin allocation with potentially noisy queries	1
LZRR: LZ77 parsing with right reference	1
On the computational completeness of matrix simple semi-conditional grammars	1
A generic type system for higher-order Ψ-calculi	1
New characterizations of primitive permutation groups with applications to synchronizing automata	1
Further improvements for SAT in terms of formula length	1
Non-closure under complementation for unambiguous linear grammars	1
Posets with interfaces as a model for concurrency	1
Parikh one-counter automata	1
Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)	1
Editorial Board	1
Fixed-parameter algorithms for Fair Hitting Set problems	1
Editorial Board	1
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle	1
Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization	1
On hardest languages for one-dimensional cellular automata	1
Pomset bisimulation and unfolding for reset Petri nets	1
A periodicity lemma for partial words	1
Distributed localization of wireless sensor network using communication wheel	1
Decisiveness of stochastic systems and its application to hybrid models	1
The bang calculus revisited	1
Probabilistic judgment aggregation with conditional independence constraints	1
Self-adjusting grid networks	1
On the equivalence of uniform key agreement and sequential composition insecurity	1
Predictive mining of multi-temporal relations	1
Choosing the right algorithm with hints from complexity theory	1
Detecting arrays for effects of multiple interacting factors	1
Derandomization of quantum algorithm for triangle finding	1
Systems of fixpoint equations: Abstraction, games, up-to techniques and local algorithms	1
Parameter synthesis of polynomial dynamical systems	1
Higher order monotonicity and submodularity of influence in social networks: From local to global	1
Breaking Goppa-based McEliece with hints	1
Efficient assignment of identities in anonymous populations	1
Continuous randomness via transformations of 2-random sequences	1
Language models for some extensions of the Lambek calculus	1
Combination of roots and boolean operations: An application to state complexity	1
Trading information complexity for error II: The case of a large error and the external information complexity	1
Rauzy complexity and block entropy	1
On fast pattern formation by autonomous robots	1
On cardinalities of Rogers semilattices for families in the Ershov hierarchy	1
Regular transducer expressions for regular transformations	1
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields	1
Deterministic algorithms for the hidden subgroup problem	1
Preface to special issue MFCS 2023	1
Total (restrained) domination in unit disk graphs	1
Preface to Special Issue for DCC 2020	1
Algorithmic aspects of secure domination in unit disk graphs	1
Linear-time parameterized algorithms with limited local resources	1
Double-ended palindromic trees in linear time	1
Towards non-iterative calculation of the zeros of the Riemann zeta function	1
How does adiabatic quantum computation fit into quantum automata theory?	1
Enumeration of two dimensional palindromes	1
Preface: Selected papers from SSS'2019, the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems	1
Exploring sparse graphs with advice	1
Regular languages as images of local functions over small alphabets	1
Decision problems for systems of language equations and inequations	1
Sensitivity of string compressors and repetitiveness measures	1
Special issue: Selected papers of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2020)	1