scientific article; zbMATH DE number 7376054
From MaRDI portal
Publication:5002813
DOI10.4230/LIPIcs.ICALP.2018.127zbMath1499.68175arXiv1802.07600MaRDI QIDQ5002813
Moses Ganardi, Danny Hucke, Markus Lohrey
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1802.07600
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Longest Common Subsequence with Gap Constraints ⋮ Subsequences in bounded ranges: matching and analysis problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On randomized one-round communication complexity
- Complete classifications for the communication complexity of regular languages
- Data streams. Models and algorithms.
- Approximate formulas for some functions of prime numbers
- Edit Distance to Monotonicity in Sliding Windows
- Querying Regular Languages over Sliding Windows
- Maintaining Stream Statistics over Sliding Windows
- Communication Complexity
- Efficient Summing over Sliding Windows
- Probabilistic automata
This page was built for publication: