M
Markus Lohrey
Researcher at University of Siegen
Publications - 269
Citations - 3549
Markus Lohrey is an academic researcher from University of Siegen. The author has contributed to research in topics: Decidability & Word problem (mathematics). The author has an hindex of 28, co-authored 263 publications receiving 3246 citations. Previous affiliations of Markus Lohrey include University of Paris & Folkwang University of the Arts.
Papers
More filters
Book ChapterDOI
Efficient memory representation of XML documents
TL;DR: A technique is presented that allows to represent the tree structure of an XML document in an efficient way by “compressing” their tree structure, which allows to directly execute queries without prior decompression.
Journal ArticleDOI
Algorithmics on SLP-compressed strings: A survey
TL;DR: Results on algorithmic problems on strings that are given in a compressed form via straight-line programs are surveyed and applications in combinatorial group theory and computational topology and to the solution of word equations are discussed.
Journal ArticleDOI
Efficient memory representation of XML document trees
TL;DR: A technique is presented that allows to represent the tree structure of an XML document in an efficient way by compressing their tree structure, and the functionality of basic tree operations, like traversal along edges, is preserved under this compressed representation.
Journal ArticleDOI
XML tree structure compression using RePair
TL;DR: A new linear time algorithm for computing small SLCF tree grammars, called TreeRePair, is presented and it is shown that it greatly outperforms the best known previous algorithm BPLEX.
Journal ArticleDOI
Word Problems and Membership Problems on Compressed Words
TL;DR: A fixed deterministic context-free language with a PSPACE-complete compressed membership problem for finitely presented monoids and completeness results for complexity classes in the range from P to EXPSPACE are obtained.