OOIR: Observatory of International Research

Papers

(The TQCC of Fundamenta Informaticae 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-11-01 to 2025-11-01.)

Article	Citations
Decision Problems on Copying and Shuffling	6
Introduction to Probabilistic Concurrent Systems	6
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers	5
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns	5
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets	5
On the Complexity of Proving Polyhedral Reductions	5
Link Residual Closeness of Harary Graphs	5
Computing Square Roots in Quaternion Algebras	4
On Finding Hamiltonian Cycles in Barnette Graphs	4
Coxeter Invariants for Non-negative Unit Forms of Dynkin Type ????_r	3
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words	3
Morphisms and Minimisation of Weighted Automata	3
Formal Concepts and Residuation on Multilattices	3
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions	3
Preface	3
Coverability, Termination, and Finiteness in Recursive Petri Nets	3
Perturbation Results for Distance-edge-monitoring Numbers	3
A Note on Calculi for Non-deterministic Many-valued Logics	3
On Morphisms Preserving Palindromic Richness	3
High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications	3
Edge Forcing in Butterfly Networks	3
Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions	2
Error Correction for Discrete Tomography	2
Adaptive Merging on Phase Change Memory	2
Preface	2

On Random Number Generation for Kernel Applications	2
Structural Liveness of Immediate Observation Petri Nets	2
The Complexity of Synthesis of b-Bounded Petri Nets	2
Absent Subsequences in Words	2
Resource Bisimilarity in Petri Nets is Decidable	2
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity	2
Single-sample Versus Case-control Sampling Scheme for Positive Unlabeled Data: the Story of Two Scenarios	2
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus	2
Number Conservation via Particle Flow in One-dimensional Cellular Automata	2
Cost Automata, Safe Schemes, and Downward Closures	2