OOIR: Observatory of International Research

Papers

(The TQCC of Information and Computation is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-06-01 to 2026-06-01.)

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
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
Editorial Board	2
Hennessy-Milner properties via topological compactness	2
Online scheduling with rejection revisited	2
Star and h-step-limited star connectivity of exchanged hypercubes	2
Compact representations of spatial hierarchical structures with support for topological queries	2
Exorcising the phantom zone	2
The Billaud Conjecture for alphabet size 4	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
Existential and universal width of alternating finite automata	2
Special issue: Formal verification of cyber-physical systems	2
Learnability and positive equivalence relations	2
On algorithms based on finitely many homomorphism counts	2
Generalized alternating-time temporal logics I: Semantics	2
The geometry of computable Banach spaces	2
Algebraic barriers to halving algorithmic information quantities in correlated strings	2
Order-preserving pattern matching indeterminate strings	2
Binary and circular automata having maximal state complexity for the set of synchronizing words	2
Cayley polynomial–time computable groups	2
Succinctness issues for LTL and safety and cosafety fragments of LTL	2
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
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters	2
Efficient construction of the BWT for repetitive text using string compression	2
Intensional Kleene and Rice theorems for abstract program semantics	2
Editorial Board	2
Usefulness of information and decomposability of unary regular languages	2
Competition among parallel contests	2
The complexity of subcube partition relates to the additive structure of the support	2
Beyond PCSP(1-in-3,NAE)	2
Dichotomy for Holant* problems with one ternary function on domain size 3	2
Exploiting pseudo-locality of interchange distance	2