244 results on '"Lohrey, Markus"'
Search Results
2. Subgroup Membership in GL(2,Z)
3. Complexity of word problems for HNN-extensions
4. Closure properties of knapsack semilinear groups
5. Derandomization for Sliding Window Algorithms with Strict Correctness∗
6. Combined compression of multiple correlated data streams for online-diagnosis systems
7. Knapsack in hyperbolic groups
8. Grammar-Based Compression of Unranked Trees
9. An architecture for online-diagnosis systems supporting compressed communication
10. Approximation of smallest linear tree grammar
11. Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees
12. Evaluation of Circuits Over Nilpotent and Polycyclic Groups
13. Balancing Straight-line Programs.
14. Knapsack in Graph Groups
15. On the Complexity of Diameter and Related Problems in Permutation Groups
16. Rational subsets and submonoids of wreath products
17. Processing Succinct Matrices and Vectors
18. Satisfiability of ECTL∗ with Local Tree Constraints
19. On Boolean Closed Full Trios and Rational Kripke Frames
20. Tree Compression Using String Grammars
21. THE ISOMORPHISM PROBLEM ON CLASSES OF AUTOMATIC STRUCTURES WITH TRANSITIVE RELATIONS
22. Knapsack and the power word problem in solvable Baumslag–Solitar groups.
23. XML tree structure compression using RePair
24. XML Compression via Directed Acyclic Graphs
25. Isomorphism of regular trees and words
26. The isomorphism problem for ω-automatic trees
27. Low-Latency Sliding Window Algorithms for Formal Languages
28. AUTOMATIC STRUCTURES OF BOUNDED DEGREE REVISITED
29. Balancing Straight-Line Programs for Strings and Trees
30. SOME NATURAL DECISION PROBLEMS IN AUTOMATIC GRAPHS
31. AN AUTOMATA THEORETIC APPROACH TO THE GENERALIZED WORD PROBLEM IN GRAPHS OF GROUPS
32. PDL with Intersection and Converse: Satisfiability and Infinite-State Model Checking
33. First-Order and Counting Theories of ω-Automatic Structures
34. Leaf languages and string compression
35. Submonoids and rational subsets of groups with infinitely many ends
36. Compressed Word Problems in HNN-extensions and Amalgamated Products
37. Tilings and Submonoids of Metabelian Groups
38. Fixpoint Logics over Hierarchical Structures
39. Efficient memory representation of XML document trees
40. The submonoid and rational subset membership problems for graph groups
41. Partially commutative inverse monoids
42. First-order and counting theories of omega-automatic structures
43. Knapsack and the power word problem in solvable Baumslag-Solitar groups
44. Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups
45. The Complexity of Knapsack Problems in Wreath Products
46. Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems
47. Inverse monoids: Decidability and complexity of algebraic questions
48. Decidable First-Order Theories of One-Step Rewriting in Trace Monoids
49. Existential and Positive Theories of Equations in Graph Products
50. The complexity of tree automata and XPath on grammar-compressed trees
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.