Dynamic data structures for timed automata acceptance

DOI10.1007/s00453-022-01025-8OpenAlexW3217447083WikidataQ114692101 ScholiaQ114692101MaRDI QIDQ2093569

Gabriele Puppis, Michał Pilipczuk, Filip Mazowiecki, Alejandro Grez, Cristian Riveros

Publication date: 27 October 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-01025-8

zbMATH Keywords

timed automatadata streamdynamic data structure

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Streaming algorithms for language recognition problems
• On a class of \(O(n^2)\) problems in computational geometry
• A theory of timed automata
• Timed automata and additive clock constraints
• On a class of \(O(n^ 2)\) problems in computational geometry
• A brief account of runtime verification
• Towards polynomial lower bounds for dynamic problems
• Threesomes, Degenerates, and Love Triangles
• Higher Lower Bounds from the 3SUM Conjecture
• Timed Pushdown Automata Revisited
• Querying Regular Languages over Sliding Windows
• Maintaining Stream Statistics over Sliding Windows
• Dynamic Parameterized Problems and Algorithms
• Recognizing Well-Parenthesized Expressions in the Streaming Model
• Fault Diagnosis for Timed Automata

This page was built for publication: Dynamic data structures for timed automata acceptance