Acta Informatica

Papers
(The TQCC of Acta Informatica 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-05-01 to 2025-05-01.)
ArticleCitations
Reactive bisimulation semantics for a process algebra with timeouts8
Correction to: Sound reasoning in tock-CSP8
Visualization of bipartite graphs in limited window size6
Homeostasis tissue-like P systems with cell separation5
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs5
Nilpotency and periodic points in non-uniform cellular automata5
Constrained polynomial zonotopes5
An instruction set for reversible Turing machines5
Toward a theory of program repair4
Approximating subset sum ratio via partition computations3
Parameterized algorithms for the Steiner arborescence problem on a hypercube3
On the size of partial derivatives and the word membership problem3
New families of Laplacian borderenergetic graphs3
On the piecewise complexity of words3
Translation validation of coloured Petri net models of programs on integers3
Editorial 2023: changes and invariants3
Correction to: Reactive synthesis without regret2
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications2
Reversible parallel communicating finite automata systems1
Reoptimization of parameterized problems1
Depth-first search in directed planar graphs, revisited1
Operational complexity and pumping lemmas1
Index appearance record with preorders1
Testing membership for timed automata1
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction1
Generalized straight-line programs1
Properties of graphs specified by a regular language1
Cycle encoding-based parameter synthesis for timed automata safety1
A closer look at Hamiltonicity and domination through the lens of diameter and convexity1
On Huang and Wong’s algorithm for generalized binary split trees1
Correction to: Solving high-level Petri games1
A binary integer programming-based method for qubit mapping in sparse architectures1
0.058011054992676