The ω(log n)–n^{o(1)} and ω(n^{1/(k+1)})–o(n^{1/k}) complexity gaps (with decidability) for LCL problems on trees extend to LPMSO problems on unbounded-degree rooted trees.
Automata and Logics for Unranked and Un- ordered Trees
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
The paper examines denial-of-service risks to multi-round transaction simulation arising from inter-transaction dependencies in smart-contract state.
citing papers explorer
-
Position Paper: Denial-of-Service against Multi-Round Transaction Simulation
The paper examines denial-of-service risks to multi-round transaction simulation arising from inter-transaction dependencies in smart-contract state.