566 results on '"Lohrey, Markus"'
Search Results
202. Parameter Reduction in Grammar-Compressed Trees
203. Compressed Word Problems in HNN-Extensions and Amalgamated Products
204. Automatic Structures of Bounded Degree Revisited
205. Size-optimal top dag compression
206. Derandomization for Sliding Window Algorithms with Strict Correctness∗
207. TO WHICH EXTENT CAN WE USE AUGMENTED REALITY IN MATH LEARNING? A SURVEY ON THE POTENTIALS AND LIMITATIONS OF UTILIZING AR IN HIGH-SCHOOL MATH LECTURES IN IRAN
208. Balancing Straight-Line Programs
209. Universal Tree Source Coding Using Grammar-Based Compression
210. Tree Automata and XPath on Compressed Trees
211. Infinite State Model-Checking of Propositional Dynamic Logics
212. Theories of HNN-Extensions and Amalgamated Products
213. Efficient Memory Representation of XML Documents
214. Inverse Monoids: Decidability and Complexity of Algebraic Questions
215. Axiomatising divergence
216. Logical aspects of Cayley-graphs: the group case
217. Decidability and Complexity in Automatic Monoids
218. Word Problems on Compressed Words
219. Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131)
220. Compressed Decision Problems in Hyperbolic Groups
221. Automatic Structures of Bounded Degree
222. On the Theory of One-Step Rewriting in Trace Monoids
223. Existential and Positive Theories of Equations in Graph Products
224. Axiomatising Divergence
225. Safe Realizability of High-Level Message Sequence Charts*
226. Word Problems for 2-Homogeneous Monoids and Symmetric Logspace
227. On the Parallel Complexity of Tree Automata
228. Word Problems and Confluence Problems for Restricted Semi-Thue Systems
229. Bounded MSC communication
230. Realizability of high-level message sequence charts: closing the gaps
231. Sliding Windows over Context-Free Languages
232. Average Case Analysis of Leaf-Centric Binary Tree Sources
233. Grammar-Based Compression of Unranked Trees
234. Combined Compression of Multiple Correlated Data Streams for Online-Diagnosis Systems
235. Entropy Bounds for Grammar-Based Tree Compressors
236. A Universal Tree Balancing Theorem
237. Confluence Problems for Trace Rewriting Systems
238. Counting problems for Parikh images
239. Compression of Unordered XML Trees
240. The Complexity of Knapsack in Graph Groups
241. Computation over Compressed Structured Data (Dagstuhl Seminar 16431)
242. Parallel identity testing for skew circuits with big powers and applications
243. Circuits and Expressions over Finite Semirings
244. On the Parallel Complexity of Bisimulation on Finite Systems
245. Querying Regular Languages over Sliding Windows
246. An Architecture for Online-Diagnosis Systems Supporting Compressed Communication
247. Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees
248. Evaluation of Circuits Over Nilpotent and Polycyclic Groups
249. Computing quantiles in Markov chains with multi-dimensional costs
250. Constructing small tree grammars and small circuits for formulas
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.