Fundamenta Informaticae

Papers
(The median citation count 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 2022-05-01 to 2026-05-01.)
ArticleCitations
Decision Problems on Copying and Shuffling9
Link Residual Closeness of Harary Graphs7
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns6
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets6
Introduction to Probabilistic Concurrent Systems6
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers5
On the Complexity of Proving Polyhedral Reductions5
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions5
Computing Square Roots in Quaternion Algebras4
On Finding Hamiltonian Cycles in Barnette Graphs4
Coxeter Invariants for Non-negative Unit Forms of Dynkin Type ???? r 4
A Note on Calculi for Non-deterministic Many-valued Logics4
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus3
Formal Concepts and Residuation on Multilattices3
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity3
Perturbation Results for Distance-edge-monitoring Numbers3
Structural Liveness of Immediate Observation Petri Nets3
Single-sample Versus Case-control Sampling Scheme for Positive Unlabeled Data: the Story of Two Scenarios3
Morphisms and Minimisation of Weighted Automata3
Computing Parameterized Invariants of Parameterized Petri Nets2
Adaptive Merging on Phase Change Memory2
On Random Number Generation for Kernel Applications2
Resource Bisimilarity in Petri Nets is Decidable2
Preface2
Absent Subsequences in Words2
Number Conservation via Particle Flow in One-dimensional Cellular Automata2
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking2
Error Correction for Discrete Tomography2
Cost Automata, Safe Schemes, and Downward Closures2
Taking Complete Finite Prefixes To High Level, Symbolically*1
Complexity and Equivalency of Multiset Dimension and ID-colorings1
Solving Infinite Games in the Baire Space1
Optimal Local Identifying and Local Locating-dominating Codes1
Maximal and Minimal Dynamic Petri Net Slicing1
Nonatomic Non-Cooperative Neighbourhood Balancing Games1
Boris (Boaz) Trakhtenbrot — The Beginning1
Preface1
A Note of Generalization of Fractional ID-factor-critical Graphs1
Preface1
Myhill-Nerode Theorem for Higher-Dimensional Automata1
Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs1
Preface1
On the Tutte and Matching Polynomials for Complete Graphs1
Structure and Power: an Emerging Landscape1
Tomography and Applications1
Affine Completeness of Some Free Binary Algebras1
Exact Wirelength of Embedding 3-Ary n -Cubes into Certain Cylinders and Trees1
Preface1
A Generalization of Falsity in Finitely-many Valued Logics1
Maximum Centre-Disjoint Mergeable Disks1
0.048938035964966