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

Article	Citations
Self-stabilisation of Cellular Automata on Tilings	8
A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models	6
Complexity and Equivalency of Multiset Dimension and ID-colorings	6
Structural Liveness of Immediate Observation Petri Nets	6
Decision Problems on Copying and Shuffling	6
The 1966 International Congress of Mathematicians: A Micro-memoir	6
A Complete Taxonomy of Restarting Automata without Auxiliary Symbols*	5
Piecewise Affine Dynamical Models of Petri Nets – Application to Emergency Call Centers*	5
Two-Sided Strictly Locally Testable Languages	5
On the Length of Shortest Strings Accepted by Two-way Finite Automata	4
Reversible Regular Languages: Logical and Algebraic Characterisations	4
Computing Singular Elements Modulo Squares	4
Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees	4
Mining Clinical Process from Hospital Information System: A Granular Computing Approach	4
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3	4
Physical Computational Complexity and First-order Logic	3
Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines	3
A Dynamical System Approach to Polyominoes Generation*	3
Universal Address Sequence Generator for Memory Built-in Self-test*	3
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity	3
A Note of Generalization of Fractional ID-factor-critical Graphs	3
Acyclic and Cyclic Reversing Computations in Petri Nets	3
A Generalization of Falsity in Finitely-many Valued Logics	3
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus	3
Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions	3

Boris (Boaz) Trakhtenbrot — The Beginning	3
On the 2-domination Number of Cylinders with Small Cycles	2
Preface	2
Getting There and Back Again	2
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets	2
Cost Automata, Safe Schemes, and Downward Closures	2
Structure and Power: an Emerging Landscape	2
A Congruence-Based Perspective on Finite Tree Automata	2
Commuting Upper Triangular Binary Morphisms	2
Characteristics of de Bruijn’s early proof checker Automath	2
Right Buchberger Algorithm over Bijective Skew PBW Extensions	2
Correctness Notions for Petri Nets with Identifiers	2
String Covering: A Survey	2
Relation-Algebraic Verification of Disjoint-Set Forests	2
Preface	2
Taking Complete Finite Prefixes To High Level, Symbolically*	2
On Random Number Generation for Kernel Applications	2
Preface	2
Preface	2
Descriptional Complexity of Finite Automata – Selected Highlights	2
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns	1
Gathering over Meeting Nodes in Infinite Grid*	1
Compression on the Twisted Jacobi Intersection	1
Relations between Control Mechanisms for Sequential Grammars1	1
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model	1
Coxeter Invariants for Non-negative Unit Forms of Dynkin Type ????r	1
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues	1
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis	1
Coinductive Algorithms for Büchi Automata	1
The Complexity of Synthesis of b-Bounded Petri Nets	1
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*	1
Preface	1
Link Residual Closeness of Harary Graphs	1
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words	1
Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker	1
Towards Syntactic Epistemic Logic	1
Resource Bisimilarity in Petri Nets is Decidable	1
Adaptive Merging on Phase Change Memory	1
Static Scheduling with Load Balancing for Solving Triangular Band Linear Systems on Multicore Processors	1
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*	1
Checking Sets of Pure Evolving Association Rules	1
Absent Subsequences in Words	1
Number Conservation via Particle Flow in One-dimensional Cellular Automata	1
Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars	1
Error Correction for Discrete Tomography	1
Theory of Constructive Semigroups with Apartness – Foundations, Development and Practice	1
Persistent Stochastic Non-Interference	1
Spanning Structures in Walker–Breaker Games	1
A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type ????r	1
Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons	1

Introduction to Probabilistic Concurrent Systems	1
Inferring Unobserved Events in Systems with Shared Resources and Queues	1