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 2021-05-01 to 2025-05-01.)

Article	Citations
Extending the reach of the point-to-set principle	28
Editorial Board	21
26th Workshop on Logic, Language, Information and Computation – WoLLIC 2019	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	13
Nondeterminism and the clique problem	13
Slowly synchronizing automata with fixed alphabet size	13
Zeroing neural network based on the equation AXA = A	13
Constant-time dynamic weight approximation for minimum spanning forest	12
On Boolean threshold functions with minimum specification number	12
On quotients of formal power series	11
Satisfiability checking for Mission-time LTL (MLTL)	10
A computable and compositional semantics for hybrid systems	10
Parameterized problems complete for nondeterministic FPT time and logarithmic space	10
Scooby: Improved multi-party homomorphic secret sharing based on FHE	9
On the decidability of the valuedness problem for two-way finite transducers	9
Weighted automata and logics meet computational complexity	8
Completeness of string analysis for dynamic languages	8
Survey on mining signal temporal logic specifications	8
Editorial Board	8
The membership problem for subsemigroups of GL<	7
Automatic pre- and postconditions for partial differential equations	7
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement	7
Preface	7
Determining temporal agreements in cross-organizational business processes	7

Descriptional Complexity of Formal Systems (DCFS 2019)	6
Narrowing the speedup factor gap of partitioned EDF	6
Complexity thresholds in inclusion logic	6
On the complexity of decision problems for some classes of machines and applications	6
Topological mixing notions on Turing machine dynamical systems	6
r-indexing the eBWT	6
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice	6
Eilenberg's variety theorem without Boolean operations	6
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source	6
Default logic and bounded treewidth	6
A new framework for deniable secure key exchange	5
Effective notions of weak convergence of measures on the real line	5
Asymptotics of the number of 2-threshold functions	5
Context-sensitive fusion grammars and fusion grammars with forbidden context are universal	5
Reversible pushdown transducers	5
Atomic cross-chain swaps with improved space, time and local time complexities	5
Query complexity of generalized Simon's problem	5
On the amount of nonconstructivity in learning formal languages from text	5
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond	5
Secretive interaction	5
Slicing techniques for temporal aggregation in spanning event streams	5
Syntactic stochastic processes: Definitions, models, and related inference problems	5
Are bundles good deals for first-order modal logic?	5
The computational properties of P systems with mutative membrane structures	4
On computational complexity of set automata	4
Approximating the directed path partition problem	4
Multi-server verifiable delegation of computations: Unconditional security and practical efficiency	4
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees	4
Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric	4
A probabilistic calculus of cyber-physical systems	4
Editorial Board	4
Finite-word hyperlanguages	4
Pushdown and Lempel-Ziv depth	4
Editorial Board	4
Constructing and indexing the bijective and extended Burrows–Wheeler transform	4
Modelling mutual exclusion in a process algebra with time-outs	4
On the data persistency of replicated erasure codes in distributed storage systems	4
Weighted propositional configuration logics: A specification language for architectures with quantitative features	4
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas	4
Isomorphism testing of read-once functions and polynomials	4
On the computational power of energy-constrained mobile robots	3
Solving mean-payoff games via quasi dominions	3
Preface to “Computation over Compressed Data” at DCC 2022	3
Towards a proof theory for quantifier macros	3
Succinctness issues for LTL and safety and cosafety fragments of LTL	3
Model checking timed recursive CTL	3
Universal solutions for temporal data exchange	3
Structural properties of NFAs and growth rates of nondeterminism measures	3
Projection theorems using effective dimension	3
Fairness and communication-based semantics for session-typed languages	3

A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form	3
Editorial Board	3
Biased differential distinguisher – Cryptanalysis of reduced-round SKINNY	3
Robust, expressive, and quantitative linear temporal logics: Pick any two for free	3
The geometry of reachability in continuous vector addition systems with states	3
Rational weighted tree languages with storage	3
Efficient and competitive broadcast in multi-channel radio networks	3
On linear languages recognized by deterministic biautomata	3
Editorial Board	3
Constrained existence problem for weak subgame perfect equilibria with ω-regular Boolean objectives	3
What's decidable about weighted automata?	3
Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths	3
On regular trees defined from unfoldings and coverings	3
Synchronizing deterministic push-down automata can be really hard	3
Editorial Board	3
Monomial Boolean functions with large high-order nonlinearities	3
A parallel algorithm for counting parse trees	3
Optimizing reachability sets in temporal graphs by delaying	3
Unambiguous injective morphisms in free groups	3
Randomness and uniform distribution modulo one	3
A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces	3
Complexity of automatic sequences	3
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages	3
Generalising the maximum independent set algorithm via Boolean networks	2
Timed network games	2
A simplicial complex model for dynamic epistemic logic to study distributed task computability	2
Exploiting social influence to control elections based on positional scoring rules	2
Efficient pattern matching in elastic-degenerate strings	2
Randomness below complete theories of arithmetic	2
Optimal in-place suffix sorting	2
Chained time lock puzzle with small puzzle size	2
Reachability games with relaxed energy constraints	2
Building a small and informative phylogenetic supertree	2
Beyond PCSP(1-in-3,NAE)	2
A derivational model of discontinuous parsing	2
Editorial Board	2
Topologies for error-detecting variable-length codes	2
On continued fraction randomness and normality	2
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines	2
Noisy beeping networks	2
Transduction from trees to graphs through folding	2
The tail-recursive fragment of timed recursive CTL	2
Information gathering in ad-hoc radio networks	2
Abstract processes and conflicts in place/transition systems	2
Efficient construction of the BWT for repetitive text using string compression	2
Computing maximal palindromes in non-standard matching models	2
Characterising spectra of equivalences for event structures, logically	2
Special issue: Formal verification of cyber-physical systems	2
Deterministic quantum search with adjustable parameters: Implementations and applications	2
Weighted operator precedence languages	2
Exchange of indivisible goods under matroid constraints	2
QCTL model-checking with 2
Hennessy-Milner properties via topological compactness	2
Binary and circular automata having maximal state complexity for the set of synchronizing words	2
Usefulness of information and decomposability of unary regular languages	2
Formal languages over GF(2)	2
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way	2
A self-stabilizing Hashed Patricia Trie	2
Achieving sequenced SQL with log-segmented timestamps	2
The complexity of subcube partition relates to the additive structure of the support	2
Intensional Kleene and Rice theorems for abstract program semantics	2
Order-preserving pattern matching indeterminate strings	2
Editorial Board	2
Exorcising the phantom zone	2
Bialgebraic foundations for the operational semantics of string diagrams	2
Incentive ratio: A game theoretical analysis of market equilibria	2
Cayley polynomial–time computable groups	2
Learnability and positive equivalence relations	2
Load balanced distributed directories	2
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters	2
Compact representations of spatial hierarchical structures with support for topological queries	2
Neural-like P systems with plasmids	2
Formal verification for event stream processing: Model checking of BeepBeep stream processing pipelines	2