Information and Computation

Article	Citations
Nondeterminism and the clique problem	38
On Boolean threshold functions with minimum specification number	37
Editorial Board	22
26th Workshop on Logic, Language, Information and Computation – WoLLIC 2019	20
Scooby: Improved multi-party homomorphic secret sharing based on FHE	20
A computable and compositional semantics for hybrid systems	19
Zeroing neural network based on the equation AXA = A	18
Kolmogorov complexity in the USSR (1975–1982): Isolation and its end	16
One-shot learning for k-SAT	15
Towards a theoretical understanding of why local search works for clustering with fair-center representation	14
Parameterized problems complete for nondeterministic FPT time and logarithmic space	13
Extending the reach of the point-to-set principle	12
Variable version Lovász local lemma: A tale of two boundaries	11
Satisfiability checking for Mission-time LTL (MLTL)	10
Vladimir V’yugin: Short biography and some research contributions	9
Survey on mining signal temporal logic specifications	9
Preface	8
Weighted automata and logics meet computational complexity	8
Editorial Board	8
On the complexity of decision problems for some classes of machines and applications	8
Composite event recognition with arbitrary specifications	8
Eilenberg's variety theorem without Boolean operations	8
The membership problem for subsemigroups of GL<	8
Are bundles good deals for first-order modal logic?	7
Editorial Board	7

Optimal regular expressions for palindromes of given length	7
r-indexing the eBWT	7
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source	6
Secretive interaction	6
Bridging computational notions of depth	6
The g-good-neighbor diagnosability of product networks under the PMC model	6
Recent algorithmic advances in simple temporal networks with uncertainty: From faster controllability checking to faster execution	6
Atomic cross-chain swaps with improved space, time and local time complexities	6
Effective notions of weak convergence of measures on the real line	6
Complete axiomatization and decidability of the logic of two-agent cooperative strategic interaction	5
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form	5
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
Pushdown and Lempel-Ziv depth	5
Improved bounds on the length of shortest strings accepted by two-way finite automata	5
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas	5
Finite-word hyperlanguages	5
Complexity thresholds in inclusion logic	5
A hierarchy of constant communication complexity	5
Approximating the directed path partition problem	5
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees	5
Editorial Board	5
Computable one-way functions on the reals	4
Editorial Board	4
Applications of littlestone dimension to query learning and to compression	4
Parameterized approximation schemes for fair-range clustering	4
Projection theorems using effective dimension	4
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages	4
Special issue on 10th international workshop Weighted Automata: Theory and Applications (WATA 2020)	4
Editorial Board	4
Spiking neural P systems with non-gated channels	4
On regular trees defined from unfoldings and coverings	4
Solving mean-payoff games via quasi dominions	4
Polynomial Turing compressions for some graph problems parameterized by modular-width	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
Constructing and indexing the bijective and extended Burrows–Wheeler transform	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
Intersection and union hierarchies of deterministic context-free languages and pumping lemmas	4
Probabilistic input-driven pushdown automata	3
The geometry of reachability in continuous vector addition systems with states	3
Editorial Board	3
A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces	3
Complexity of automatic sequences	3
Multiple interdependent Simple Temporal Networks with Uncertainty: A semi-decentralized multi-agent model with shared control of activity durations	3
Efficient and competitive broadcast in multi-channel radio networks	3
Cayley polynomial–time computable groups	3
Towards a proof theory for quantifier macros	3

Exploiting pseudo-locality of interchange distance	3
Rational weighted tree languages with storage	3
Model checking timed recursive CTL	3
On the computational power of energy-constrained mobile robots	3
Monomial Boolean functions with large high-order nonlinearities	3
Two-state spin systems with negative interactions	3
The Billaud Conjecture for alphabet size 4	3
The complexity of subcube partition relates to the additive structure of the support	3
Unambiguous injective morphisms in free groups	3
A parallel algorithm for counting parse trees	3
Impossibility of depth reduction in explainable clustering	3
Synchronizing deterministic push-down automata can be really hard	3
Succinctness issues for LTL and safety and cosafety fragments of LTL	3
Building a small and informative phylogenetic supertree	3
Dichotomy for Holant* problems with one ternary function on domain size 3	2
Generalized alternating-time temporal logics I: Semantics	2
Corrigendum to “On the equivalence of uniform key agreement and sequential composition insecurity” [Information and Computation 307 (2025) 105365]	2
An iterative scheme of hybrid controller synthesis for nonlinear systems subject to safety constraints	2
Intensional Kleene and Rice theorems for abstract program semantics	2
Computing maximal palindromes in non-standard matching models	2
Formal verification for event stream processing: Model checking of BeepBeep stream processing pipelines	2
Timed network games	2
Exorcising the phantom zone	2
Randomness below complete theories of arithmetic	2
Special issue: Formal verification of cyber-physical systems	2
Relations between equation automata and follow automata	2
Efficient construction of the BWT for repetitive text using string compression	2
Deterministic quantum search with adjustable parameters: Implementations and applications	2
Binary and circular automata having maximal state complexity for the set of synchronizing words	2
Topologies for error-detecting variable-length codes	2
Editorial Board	2
Learnability and positive equivalence relations	2
Measuring the expressive power of practical regular expressions by classical stacking automata models	2
Achieving sequenced SQL with log-segmented timestamps	2
Order-preserving pattern matching indeterminate strings	2
Generalising the maximum independent set algorithm via Boolean networks	2
Hennessy-Milner properties via topological compactness	2
k-Universality of Regular Languages	2
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines	2
Exchange of indivisible goods under matroid constraints	2
On algorithms based on finitely many homomorphism counts	2
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters	2
Star and h-step-limited star connectivity of exchanged hypercubes	2
Competition among parallel contests	2
Algebraic barriers to halving algorithmic information quantities in correlated strings	2
Online scheduling with rejection revisited	2
Noisy beeping networks	2
The tail-recursive fragment of timed recursive CTL	2
The generalized constrained longest common subsequence in the run-length encoded format	2
Cyclic operator precedence grammars for parallel parsing	2
Existential and universal width of alternating finite automata	2
Usefulness of information and decomposability of unary regular languages	2
Editorial Board	2
Transduction from trees to graphs through folding	2
Chained time lock puzzle with small puzzle size	2
Compact representations of spatial hierarchical structures with support for topological queries	2
Beyond PCSP(1-in-3,NAE)	2
The geometry of computable Banach spaces	2
Special issue: Selected papers of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2020)	1
Further improvements for SAT in terms of formula length	1
Finite-time safety and reach-avoid verification of stochastic discrete-time systems	1
Sensitivity of string compressors and repetitiveness measures	1
The bang calculus revisited	1
Distributed localization of wireless sensor network using communication wheel	1
Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games	1
Parikh one-counter automata	1
Combination of roots and boolean operations: An application to state complexity	1
Editorial Board	1
On the generation and enumeration of prime double square polyominoes	1
Exponential time algorithms for deciding regular games	1
New characterizations of primitive permutation groups with applications to synchronizing automata	1
Bounded game-theoretic semantics for modal mu-calculus	1
Towards non-iterative calculation of the zeros of the Riemann zeta function	1
Probabilistic judgment aggregation with conditional independence constraints	1
Continuous randomness via transformations of 2-random sequences	1
Bayesian definition of random sequences with respect to conditional probabilities	1
Numerical spiking neural P systems with thresholds	1
A generic type system for higher-order Ψ-calculi	1
On cardinalities of Rogers semilattices for families in the Ershov hierarchy	1
Rauzy complexity and block entropy	1

Solving Co-Path/Cycle Packing and Co-Path Packing faster than 3k	1
Complexity of round-robin allocation with potentially noisy queries	1
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields	1
Efficient assignment of identities in anonymous populations	1
Succinct data structure for path graphs	1
Deducibility and independence in Beklemishev's autonomous provability calculus	1
Systems of fixpoint equations: Abstraction, games, up-to techniques and local algorithms	1
Fixed-parameter algorithms for Fair Hitting Set problems	1
Algorithmic aspects of secure domination in unit disk graphs	1
Detecting causality in the presence of Byzantine processes: The case of synchronous systems	1
Double-ended palindromic trees in linear time	1
Detecting arrays for effects of multiple interacting factors	1
Predictive mining of multi-temporal relations	1
Choosing the right algorithm with hints from complexity theory	1
Learning residual alternating automata	1
Preface to special issue MFCS 2023	1
Decisiveness of stochastic systems and its application to hybrid models	1
Model checking hyperproperties for Markov decision processes	1
Trading information complexity for error II: The case of a large error and the external information complexity	1
Language models for some extensions of the Lambek calculus	1
On the complexity of properties of partial bijection semigroups	1
Breaking Goppa-based McEliece with hints	1
A perfect matching reciprocity method for embedding multiple hypercubes in an augmented cube: Application to Hamiltonian decomposition	1
Verifying Linear Temporal Properties on Polyhedral Systems: Decidability and Symbolic Algorithms	1
On the equivalence of uniform key agreement and sequential composition insecurity	1
Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem	1
Regular languages as images of local functions over small alphabets	1
Editorial Board	1
Exploiting social influence to control elections based on positional scoring rules	1
Taming Strategy Logic: Non-Recurrent Fragments	1
Concept analysis approach for graphs	1
Linear-time parameterized algorithms with limited local resources	1
Approximation algorithms for non-sequential star packing problems	1
Exact counting of subtrees with diameter no more than d in trees: A generating function approach	1
Parameter synthesis of polynomial dynamical systems	1
Exploring sparse graphs with advice	1
Editorial Board	1
Operational complexity: NFA-to-DFA trade-off	1
Lifting proofs from countable to uncountable mathematics	1
Preface: Selected papers from SSS'2019, the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems	1
Total (restrained) domination in unit disk graphs	1
Editorial Board	1
Decision problems for systems of language equations and inequations	1
Encoding inductive invariants as barrier certificates: Synthesis via difference-of-convex programming	0
Removing redundant refusals: Minimal complete test suites for failure trace semantics	0
Clustering categorical data: Soft rounding k-modes	0
Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class	0
Assumptions of randomness in cosmology models	0
Editorial Board	0
Minimal obstructions to C5-coloring in hereditary graph classes	0
Weighted two-way transducers	0
Characterizing contrasimilarity through games, modal logic, and complexity	0
Entropic risk for turn-based stochastic games	0
A pumping lemma for regular closure of prefix-free languages	0
Editorial Board	0
On the equivalence of Occam algorithms	0
On parallelisms of PG(3,4) with automorphisms of order 2	0
Truthful and privacy-preserving generalized linear models	0
Realizability problem for constraint LTL	0
A scalable mechanism for mutual fairness in allocating replicable resources	0
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs	0
Arena-independent memory bounds for Nash equilibria in reachability games	0
Bounded complete domains and their logical form	0
Collision-free exploration by mobile agents using pebbles	0
Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond	0
Improved approximations for the capacitated vehicle routing problem with fixed capacity	0
Editorial Board	0
On the containment problem for deterministic multicounter machine models	0
Modification problems toward proper (Helly) circular-arc graphs	0
Cost-asymmetric memory hard password hashing	0
Causal computational complexity of distributed processes	0
A new class of string transformations for compressed text indexing	0
Descriptive complexity and weighted Turing machines	0
Converting nondeterministic two-way automata into small deterministic linear-time machines	0
On the complexity of approximately matching a string to a directed graph	0
Logical equivalences, homomorphism indistinguishability, and forbidden minors	0
mrNISC from LWE with polynomial modulus	0
On Jaffe's pumping lemma, revisited	0
Preface	0
Special issue on selected papers from the 19th International Workshop on Algorithms and Computation (WALCOM 2025)	0
Recent developments in theory and tool support for hybrid systems verification with HyPro	0
Pushdown and one-counter automata: Constant and non-constant memory usage	0
Special Issue of PLACES 2022	0
Distance labeling schemes for K4-free bridged graphs	0
A dichotomy result for countably based sober spaces	0
Learning half-spaces on general infinite spaces equipped with a distance function	0
Traceable constant-size multi-authority credentials	0
Editorial Board	0
Functionality of compositions of top-down tree transducers is decidable	0
Complexity of exclusive nondeterministic finite automata	0
Asymptotically optimal synthesis of reversible circuits	0
Hierarchical identification of nonlinear hybrid systems in a Bayesian framework	0
Hardness and approximability of bounded access Lempel Ziv coding	0
External contextual grammars with resources restricted and structure limited selection	0
Characterization of exact two-query quantum algorithms	0