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-03-01 to 2025-03-01.)
ArticleCitations
On the piecewise complexity of words16
On the undecidability and descriptional complexity of synchronized regular expressions6
Correction to: Sound reasoning in tock-CSP5
A binary integer programming-based method for qubit mapping in sparse architectures5
Editorial 2023: changes and invariants5
Depth-first search in directed planar graphs, revisited5
Comparative genomics with succinct colored de Bruijn graphs4
Parameterized algorithms for the Steiner arborescence problem on a hypercube3
On the number of active states in finite automata3
Reactive bisimulation semantics for a process algebra with timeouts3
Connected feedback vertex set on AT-free graphs3
Correction to: A linear-time branching-time perspective on interface automata3
Distance-edge-monitoring sets of networks3
A new class of the smallest FSSP partial solutions for 1D rings of length $$n=2^{k}-1$$2
Reachability analysis of linear systems2
n-PS-codes, 2-infix-outfix codes and some related classes of codes2
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications2
Correction to: Reactive synthesis without regret2
A closer look at Hamiltonicity and domination through the lens of diameter and convexity1
Improved complement for two-way alternating automata1
Balancing m-ary search trees with compressions on the fringe1
A jumping $$5'\rightarrow 3'$$ Watson–Crick finite automata model1
Testing membership for timed automata1
On minimum t-claw deletion in split graphs1
Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking1
Natural language guided object retrieval in images1
Reversible parallel communicating finite automata systems1
A decision procedure for string constraints with string/integer conversion and flat regular constraints1
An automated system repair framework with signal temporal logic1
Dense non-binary Fibonacci codes1
Tight bounds for the sensitivity of CDAWGs with left-end edits1
The second step in characterizing a three-word code1
$$\mathcal {L}$$-reduction computation revisited0
Approximating subset sum ratio via partition computations0
Editorial 2024: moving forwards in the electronic age0
Preface to Klaus-Jörn Lange Festschrift0
Operational complexity and pumping lemmas0
Parameterized aspects of distinct Kemeny rank aggregation0
Correction: Birkhoff-von Neumann quantum logic enriched with entanglement quantifiers: coincidence theorem and semantic consequence0
Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms0
Interface Automata for Shared Memory0
Linear-size suffix tries and linear-size CDAWGs simplified and improved0
Lamplighter groups and automata0
Improving LSH via tensorized random projection0
Regular numeral systems for data structures0
Careful synchronization of partial deterministic finite automata0
Session-based concurrency, declaratively0
Translation validation of coloured Petri net models of programs on integers0
A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds0
On first-order runtime enforcement of branching-time properties0
From regular expression matching to parsing0
An instruction set for reversible Turing machines0
On partial information retrieval: the unconstrained 100 prisoner problem0
Homeostasis tissue-like P systems with cell separation0
Minimum status of trees with a given degree sequence0
Fault-tolerance in distance-edge-monitoring sets0
Decentralized runtime verification of message sequences in message-based systems0
An encoding of the $$\lambda $$-calculus in the String MultiSet Rewriting calculus0
Properties of graphs specified by a regular language0
Invariant relations for affine loops0
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs0
Cycle encoding-based parameter synthesis for timed automata safety0
Exact distributed quantum algorithm for generalized Simon’s problem0
Pushdown automata and constant height: decidability and bounds0
On the decidability of finding a positive ILP-instance in a regular set of ILP-instances0
Toward a theory of program repair0
Correction to: Solving high-level Petri games0
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times0
Discovering workflow nets of concurrent iterative processes0
Reversibility for stateless ordered RRWW-automata0
Simple chain automaton random number generator for IoT devices0
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction0
Nilpotency and periodic points in non-uniform cellular automata0
Alternating complexity of counting first-order logic for the subword order0
New families of Laplacian borderenergetic graphs0
Proportional lumpability and proportional bisimilarity0
Sound reasoning in tock-CSP0
On the size of partial derivatives and the word membership problem0
The longest letter-duplicated subsequence and related problems0
The regular languages of wire linear AC$$^0$$0
Generalized straight-line programs0
Finite automata with undirected state graphs0
Preface to Martin Kutrib Festschrift0
Constrained polynomial zonotopes0
Index appearance record with preorders0
Operational complexity and right linear grammars0
Birkhoff-von Neumann quantum logic enriched with entanglement quantifiers: coincidence theorem and semantic consequence0
Exploration of k-edge-deficient temporal graphs0
The descriptional power of queue automata of constant length0
Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm0
A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R0
Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms0
On Huang and Wong’s algorithm for generalized binary split trees0
Word-representable graphs from a word’s perspective0
Reoptimization of parameterized problems0
0.026103019714355