Fundamenta Informaticae

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-08-01 to 2025-08-01.)
ArticleCitations
Decision Problems on Copying and Shuffling11
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets9
Link Residual Closeness of Harary Graphs6
Introduction to Probabilistic Concurrent Systems6
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers6
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns6
On Finding Hamiltonian Cycles in Barnette Graphs5
Coxeter Invariants for Non-negative Unit Forms of Dynkin Type ????r5
Minimal Size of Counters for (Real-Time) Multicounter Automata5
On the Complexity of Proving Polyhedral Reductions5
Computing Square Roots in Quaternion Algebras4
Morphisms and Minimisation of Weighted Automata4
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions4
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words4
A Note on Calculi for Non-deterministic Many-valued Logics4
Preface3
A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique3
On Morphisms Preserving Palindromic Richness3
Edge Forcing in Butterfly Networks3
Formal Concepts and Residuation on Multilattices3
On Boolean Automata Networks (de)Composition13
Coverability, Termination, and Finiteness in Recursive Petri Nets3
Structural Liveness of Immediate Observation Petri Nets2
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus2
Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions2
The Complexity of Synthesis of b-Bounded Petri Nets2
Adaptive Merging on Phase Change Memory2
On Random Number Generation for Kernel Applications2
High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications2
Single-sample Versus Case-control Sampling Scheme for Positive Unlabeled Data: the Story of Two Scenarios2
Error Correction for Discrete Tomography2
Cost Automata, Safe Schemes, and Downward Closures2
Absent Subsequences in Words2
Perturbation Results for Distance-edge-monitoring Numbers2
Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines2
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity2
Relations between Control Mechanisms for Sequential Grammars12
Number Conservation via Particle Flow in One-dimensional Cellular Automata2
0.15300917625427