cs.FL

Papers

• Learning state machines via efficient hashing of future traces (2022)
  Robert Baumgartner et al.
  —
• Almost optimal searching of maximal subrepetitions in a word (2022)
  Roman Kolpakov
  —
• Combinatorial Algorithms for Subsequence Matching: A Survey (2022)
  Maria Kosche (G\"ottingen University et al.
  —
• Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph (2023)
  Hiroki Arimura et al.
  —
• Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved (2024)
  Shunsuke Inenaga
  —
• Attractors Is All You Need: Parity Games In Polynomial Time (2025)
  Rick van der Heijden
  —
• Unsupervised Hierarchical Skill Discovery (2026)
  Damion Harvey et al.
  —
• Reasoning about Reasoning: BAPO Bounds on Chain-of-Thought Token Complexity in LLMs (2026)
  Kiran Tomlinson et al.
  —