Acta Informatica

Papers
(The median citation count of Acta Informatica is 0. 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
Correction to: Sound reasoning in tock-CSP10
Reactive bisimulation semantics for a process algebra with timeouts9
Deterministic real-time tree-walking-storage automata8
Visualization of bipartite graphs in limited window size7
The Primitive Deficiency of two Primitive Strings5
Toward a theory of program repair5
Constrained polynomial zonotopes5
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs4
Homeostasis tissue-like P systems with cell separation4
Translation validation of coloured Petri net models of programs on integers3
Approximating subset sum ratio via partition computations3
New families of Laplacian borderenergetic graphs3
Editorial 2023: changes and invariants2
Correction to: Reactive synthesis without regret2
On the piecewise complexity of words2
Parameterized algorithms for the Steiner arborescence problem on a hypercube2
A closer look at Hamiltonicity and domination through the lens of diameter and convexity1
Cycle encoding-based parameter synthesis for timed automata safety1
Depth-first search in directed planar graphs, revisited1
A binary integer programming-based method for qubit mapping in sparse architectures1
Generalized straight-line programs1
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications1
Testing membership for timed automata1
Reoptimization of parameterized problems1
Operational complexity and pumping lemmas1
Reachability analysis of linear systems1
On Huang and Wong’s algorithm for generalized binary split trees1
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction1
Index appearance record with preorders1
Properties of graphs specified by a regular language1
Dense non-binary Fibonacci codes1
Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking0
Invariant relations for affine loops0
Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms0
Pushdown automata and constant height: decidability and bounds0
On the decidability of finding a positive ILP-instance in a regular set of ILP-instances0
On first-order runtime enforcement of branching-time properties0
$$\mathcal {L}$$-reduction computation revisited0
Data reduction for directed feedback vertex set on graphs without long induced cycles0
Birkhoff-von Neumann quantum logic enriched with entanglement quantifiers: coincidence theorem and semantic consequence0
Interface Automata for Shared Memory0
Comparative genomics with succinct colored de Bruijn graphs0
Distance-edge-monitoring sets of networks0
An encoding of the $$\lambda $$-calculus in the String MultiSet Rewriting calculus0
Exploration of k-edge-deficient temporal graphs0
Decentralized runtime verification of message sequences in message-based systems0
Correction: Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms0
Tight bounds for the sensitivity of CDAWGs with left-end edits0
From regular expression matching to parsing0
Three-word codes $$\{a,\ aba,\ u\}$$ and $$\{a,\ ab,\ v\}$$ having finite completions0
Discovering workflow nets of concurrent iterative processes0
The longest letter-duplicated subsequence and related problems0
A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R0
The thief orienteering problem on 2-terminal series–parallel graphs0
A jumping $$5'\rightarrow 3'$$ Watson–Crick finite automata model0
Improving LSH via tensorized random projection0
Row-column combination of Dyck words0
Alternating complexity of counting first-order logic for the subword order0
Fault-tolerance in distance-edge-monitoring sets0
On minimum t-claw deletion in split graphs0
Exact distributed quantum algorithm for generalized Simon’s problem0
On partial information retrieval: the unconstrained 100 prisoner problem0
Simple chain automaton random number generator for IoT devices0
The second step in characterizing a three-word code0
On star-k-PCGs: exploring class boundaries for small k values0
Effects on distance energy of some special complete multipartite graphs by embedding an edge0
Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms0
Balancing m-ary search trees with compressions on the fringe0
Parameterized aspects of distinct Kemeny rank aggregation0
Correction: Birkhoff-von Neumann quantum logic enriched with entanglement quantifiers: coincidence theorem and semantic consequence0
The regular languages of wire linear AC$$^0$$0
Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm0
Linear-size suffix tries and linear-size CDAWGs simplified and improved0
Word-representable graphs from a word’s perspective0
Exact and parameterized algorithms for choosability0
Improved complement for two-way alternating automata0
n-PS-codes, 2-infix-outfix codes and some related classes of codes0
On the undecidability and descriptional complexity of synchronized regular expressions0
Connected feedback vertex set on AT-free graphs0
Careful synchronization of partial deterministic finite automata0
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times0
Preface to Klaus-Jörn Lange Festschrift0
Editorial 2024: moving forwards in the electronic age0
A decision procedure for string constraints with string/integer conversion and flat regular constraints0
Lamplighter groups and automata0
Minimum status of trees with a given degree sequence0
0.016967058181763