Markus Lohrey
Markus Lohrey
Verifierad e-postadress på eti.uni-siegen.de - Startsida
Titel
Citeras av
Citeras av
År
Algorithmics on SLP-compressed strings: A survey
M Lohrey
Walter de Gruyter GmbH 4 (2), 241-299, 2012
1122012
Efficient memory representation of XML document trees
G Busatto, M Lohrey, S Maneth
Information Systems 33 (4-5), 456-474, 2008
882008
Efficient memory representation of XML documents
G Busatto, M Lohrey, S Maneth
International Workshop on Database Programming Languages, 199-216, 2005
712005
Word problems and membership problems on compressed words
M Lohrey
SIAM Journal on Computing 35 (5), 1210-1240, 2006
592006
Completeness of S4 with respect to the real line: revisited
G Bezhanishvili, M Gehrke
Annals of Pure and Applied Logic 131 (1-3), 287-301, 2005
572005
XML tree structure compression using RePair
M Lohrey, S Maneth, R Mennicke
Information Systems 38 (8), 1150-1167, 2013
562013
The complexity of tree automata and XPath on grammar-compressed trees
M Lohrey, S Maneth
Theoretical Computer Science 363 (2), 196-210, 2006
552006
Logical aspects of Cayley-graphs: the group case
D Kuske, M Lohrey
Annals of Pure and Applied Logic 131 (1-3), 263-286, 2005
482005
Bounded MSC communication
M Lohrey, A Muscholl
Information and Computation 189 (2), 160-181, 2004
442004
On the parallel complexity of tree automata
M Lohrey
International Conference on Rewriting Techniques and Applications, 201-215, 2001
422001
A fast branching algorithm for cluster vertex deletion
A Boral, M Cygan, T Kociumaka, M Pilipczuk
Theory of Computing Systems 58 (2), 357-376, 2016
40*2016
Querying and embedding compressed texts
Y Lifshits, M Lohrey
International Symposium on Mathematical Foundations of Computer Science, 681-692, 2006
392006
Safe Realizability of High-Level Message Sequence Charts*
M Lohrey
International Conference on Concurrency Theory, 177-192, 2002
382002
Priority and maximal progress are completely axiomatisable
H Hermanns, M Lohrey
International Conference on Concurrency Theory, 237-252, 1998
361998
First-order and counting theories of ω-automatic structures
D Kuske, M Lohrey
The Journal of Symbolic Logic 73 (1), 129-150, 2008
342008
Efficient computation in groups via compression
M Lohrey, S Schleimer
International Computer Science Symposium in Russia, 249-258, 2007
342007
Approximation of smallest linear tree grammar
A Jeż, M Lohrey
Information and Computation 251, 215-251, 2016
332016
Parameter reduction and automata evaluation for grammar-compressed trees
M Lohrey, S Maneth, M Schmidt-Schauß
Journal of Computer and System Sciences 78 (5), 1651-1669, 2012
332012
The compressed word problem for groups
M Lohrey
Springer, 2014
312014
The submonoid and rational subset membership problems for graph groups
M Lohrey, B Steinberg
Journal of Algebra 320 (2), 728-755, 2008
312008
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20