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

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

Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*	2
Introduction to Probabilistic Concurrent Systems	2
Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars	2
Absent Subsequences in Words	2
Preface	2
Boris (Boaz) Trakhtenbrot — The Beginning	2
Correctness Notions for Petri Nets with Identifiers	2
Preface	2
Preface	2
Gathering over Meeting Nodes in Infinite Grid*	2
Coinductive Algorithms for Büchi Automata	2
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity	2
Preface	2
Taking Complete Finite Prefixes To High Level, Symbolically*	2
The Complexity of Synthesis of b-Bounded Petri Nets	2
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets	2
Number Conservation via Particle Flow in One-dimensional Cellular Automata	2
On Finding Hamiltonian Cycles in Barnette Graphs	1
Commuting Upper Triangular Binary Morphisms	1
Computing the Length of Sum of Squares and Pythagoras Element in a Global Field	1
Relation-Algebraic Verification of Disjoint-Set Forests	1
Adaptive Merging on Phase Change Memory	1
Error Correction for Discrete Tomography	1
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns	1
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues	1
Characteristics of de Bruijn’s early proof checker Automath	1
Computing Square Roots in Quaternion Algebras	1
Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons	1
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model	1
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers	1
Cost Automata, Safe Schemes, and Downward Closures	1
On the 2-domination Number of Cylinders with Small Cycles	1
Right Buchberger Algorithm over Bijective Skew PBW Extensions	1
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis	1
Link Residual Closeness of Harary Graphs	1
A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type ????_r	1
On Random Number Generation for Kernel Applications	1
Spanning Structures in Walker–Breaker Games	1
Theory of Constructive Semigroups with Apartness – Foundations, Development and Practice	1
A Congruence-Based Perspective on Finite Tree Automata	1
Getting There and Back Again	1
Compression on the Twisted Jacobi Intersection	1
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words	1
Relations between Control Mechanisms for Sequential Grammars1	1
Inferring Unobserved Events in Systems with Shared Resources and Queues	1
Preface	1
Descriptional Complexity of Finite Automata – Selected Highlights	1
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions	1
Polynomial-time Classification of Skew-symmetrizable Matrices with a Positive Definite Quasi-Cartan Companion	1