Streaming in graph products

DOI10.4230/LIPICS.MFCS.2024.71MaRDI QIDQ7241079zbMATH OpenFDO

Authors Markus Lohrey, Julio Xochitemol

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2024.71

zbMATH Keywords

graph productsstreaming algorithmsword problems for groups

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
• Groups, languages and automata
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3257446 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• Logspace computations in graph products
• On linear and residual properties of graph products
• On representations of Artin groups and the Tits conjecture
• On the algorithmic insolvability of the word problem in group theory
• Probabilistic automata
• Recognizing well-parenthesized expressions in the streaming model
• Stallings foldings and subgroups of free groups
• Streaming algorithms for language recognition problems
• Streaming Property Testing of Visibly Pushdown Languages *
• Streaming word problems
• The Compressed Word Problem for Groups
• The word problem
• Über unendliche diskontinuierliche Gruppen.
• Wreath Products and Chief Factors of Linear Groups

This page was built for publication: Streaming in graph products

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