Efficient Enumeration of Distinct Factors Using Package Representations

DOI10.1007/978-3-030-59212-7_18MaRDI QIDQ6485942zbMATH OpenFDO

Authors Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, Wiktor Zuba

Publication date 22 December 2022

Published in 1511.68098 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59212-7_18

Mathematics Subject Classification ID

Data structures (68P05) Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 5492361
• Efficiently counting representations of finite posets
• Fast enumeration of combinatorial objects
• Fast enumeration of Grassmannian elements
• Efficient recursions for general factorisable models
• Efficient enumeration of solutions produced by closure operations
• scientific article; zbMATH DE number 6829393
• An efficient representation of partitions of integers

Cited in

(4)

• Internal pattern matching queries in a text and applications
• Internal pattern matching in small space and applications
• Counting distinct square substrings in sublinear time
• Fast computation of k-runs, parameterized squares, and other generalised squares

This page was built for publication: Efficient Enumeration of Distinct Factors Using Package Representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6485942)