OOIR: Observatory of International Research

Papers

(The TQCC of Fundamenta Informaticae is 1. 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
On the Length of Shortest Strings Accepted by Two-way Finite Automata	11
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets	6
A Complete Taxonomy of Restarting Automata without Auxiliary Symbols*	6
A Dynamical System Approach to Polyominoes Generation	6
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*	6
Decision Problems on Copying and Shuffling	6
Introduction to Probabilistic Concurrent Systems	5
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers	5
On the Complexity of Proving Polyhedral Reductions	5
Link Residual Closeness of Harary Graphs	5
Computing Square Roots in Quaternion Algebras	5
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns	5
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions	5
Coxeter Invariants for Non-negative Unit Forms of Dynkin Type ????_r	5
Minimal Size of Counters for (Real-Time) Multicounter Automata	3
Place the Vertices Anywhere on the Curve and Simplify	3
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words	3
On Boolean Automata Networks (de)Composition1	3
Preface	3
On Finding Hamiltonian Cycles in Barnette Graphs	3
On Morphisms Preserving Palindromic Richness	3
Morphisms and Minimisation of Weighted Automata	3
A Note on Calculi for Non-deterministic Many-valued Logics	3
Formal Concepts and Residuation on Multilattices	2
Coverability, Termination, and Finiteness in Recursive Petri Nets	2

Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions	2
Reversible Regular Languages: Logical and Algebraic Characterisations	2
Number Conservation via Particle Flow in One-dimensional Cellular Automata	2
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity	2
Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines	2
A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique	2
High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications	2
A New Description of Transversal Matroids Through Rough Set Approach	2
Structural Liveness of Immediate Observation Petri Nets	2
Absent Subsequences in Words	2
Edge Forcing in Butterfly Networks	2
Causal Semantics for BPP Nets with Silent Moves	2
Perturbation Results for Distance-edge-monitoring Numbers	2
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus	2
Adaptive Merging on Phase Change Memory	2
On Random Number Generation for Kernel Applications	2
Preface	1
Optimal Local Identifying and Local Locating-dominating Codes	1
Self-Verifying Pushdown and Queue Automata	1
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs	1
A Non-Deterministic Multiset Query Language	1
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking	1
Preface	1
Tomography and Applications	1
Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory	1
Separating the Words of a Language by Counting Factors	1
Cost Problems for Parametric Time Petri Nets*	1
Generative Capacity of Contextual Grammars with Subregular Selection Languages*	1
Symbolic and Structural Model-Checking	1
Solving Infinite Games in the Baire Space	1
Preface	1
Error Correction for Discrete Tomography	1
The Complexity of Synthesis of b-Bounded Petri Nets	1
Cost Automata, Safe Schemes, and Downward Closures	1
Investigating Reversibility of Steps in Petri Nets	1
A Note of Generalization of Fractional ID-factor-critical Graphs	1
Freeness Problem for Matrix Semigroups of Parikh Matrices	1
The Inverse of Ackermann Function is Computable in Linear Time	1
Time-free Solution to Independent Set Problem using P Systems with Active Membranes	1
Parametric Analyses of Attack-fault Trees*	1
Computing Parameterized Invariants of Parameterized Petri Nets	1
Resource Bisimilarity in Petri Nets is Decidable	1
Relations between Control Mechanisms for Sequential Grammars1	1
Spanning Structures in Walker–Breaker Games	1
Adding Metalogic Features to Knowledge Representation Languages*	1