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