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 2020-11-01 to 2024-11-01.)
ArticleCitations
Sound reasoning in tock-CSP14
Measuring the constrained reachability in quantum Markov chains5
Operational complexity and pumping lemmas5
An automated system repair framework with signal temporal logic5
Proportional lumpability and proportional bisimilarity5
On the undecidability and descriptional complexity of synchronized regular expressions4
Constrained polynomial zonotopes3
A jumping $$5'\rightarrow 3'$$ Watson–Crick finite automata model3
Index appearance record with preorders3
Depth-first search in directed planar graphs, revisited3
On Huang and Wong’s algorithm for generalized binary split trees2
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction2
Exact distributed quantum algorithm for generalized Simon’s problem2
On the size of partial derivatives and the word membership problem2
Distance-edge-monitoring sets of networks2
Pushdown automata and constant height: decidability and bounds2
Reversible parallel communicating finite automata systems2
Minimum status of trees with a given degree sequence1
Correction to: Sound reasoning in tock-CSP1
Nilpotency and periodic points in non-uniform cellular automata1
Session-based concurrency, declaratively1
Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms1
Correction to: Reactive synthesis without regret1
Discovering workflow nets of concurrent iterative processes1
Toward a theory of program repair1
Decentralized runtime verification of message sequences in message-based systems1
Natural language guided object retrieval in images1
A new class of the smallest FSSP partial solutions for 1D rings of length $$n=2^{k}-1$$1
The descriptional power of queue automata of constant length1
Configurable verification of timed automata with discrete variables1
Operational complexity and right linear grammars1
0.038591146469116