12 citations · 12 across the 2 of their papers we have counts for
5 papers
On the work of dynamic constant-time parallel algorithms for regular tree languages and context-free languages
Jonas Schmidt, Thomas Schwentick, Jennifer Todtenhoefer
Previous work on Dynamic Complexity has established that there exist dynamic constant-time parallel algorithms for regular tree languages and context-free languages under label or…
Iltis: Learning Logic in the Web
Gaetano Geck, Christine Quenkert, Marko Schmellenkamp +4
The Iltis project provides an interactive, web-based system for teaching the foundations of formal methods. It is designed with the objective to allow for simple inclusion of new e…
Work-sensitive Dynamic Complexity of Formal Languages
Jonas Schmidt, Thomas Schwentick, Till Tantau +2
Which amount of parallel resources is needed for updating a query result after changing an input? In this work we study the amount of work required for dynamically answering member…
Dynamic Complexity Meets Parameterised Algorithms
Jonas Schmidt, Thomas Schwentick, Nils Vortmeier +2
Dynamic Complexity studies the maintainability of queries with logical formulas in a setting where the underlying structure or database changes over time. Most often, these formula…
Introduction to Iltis: An Interactive, Web-Based System for Teaching Logic
Gaetano Geck, Artur Ljulin, Sebastian Peter +3
Logic is a foundation for many modern areas of computer science. In artificial intelligence, as a basis of database query languages, as well as in formal software and hardware veri…