Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Ludwig Staiger

Ludwig Staiger is a German mathematician and computer scientist at the Martin-Luther-Universität Halle-Wittenberg, Germany.Previously he had… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We consider Turing machines which perform infinite sequences of runs, where the (finite) number of computation steps in each run… Expand
Is this relevant?
2016
2016
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs, Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza, TR16… Expand
Is this relevant?
2012
2012
Abstract Synthetic pattern generation procedures have various applications, and a number of approaches (fractals, L-systems, etc… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2011
Review
2011
Fakahatchee Strand Preserve State Park is located in Collier County at the extreme southwestern corner of Florida, close to… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2011
2011
  • Martin-Luther
  • 2011
  • Corpus ID: 327494
The subword complexity of an infinite word ξ is a function f (ξ, n) returning the number of finite subwords (factors, infixes) of… Expand
Is this relevant?
2010
2010
We define an action-based extension of the branching-time temporal logic CTL which allows path quantifiers to be restricted by… Expand
  • figure 1
  • figure 2
Is this relevant?
2008
2008
The main topic of the present work are universal machines for plain and prefix-free description complexity and their domains. It… Expand
Is this relevant?
2008
2008
This is an extended abstract presenting new results on the topological complexity of omega-powers (which are included in a paper… Expand
Is this relevant?
2008
2008
  • Ulrich Speidel
  • 6th International Symposium on Communication…
  • 2008
  • Corpus ID: 18638361
Titchenerpsilas T-complexity is a computable complexity measure for finite strings with practical applications in a number of… Expand
Is this relevant?
Review
2005
Review
2005
EU-US trade disputes have recently caught much attention, because they have involved lasting non-compliance coupled with WTO… Expand
  • figure 1
  • figure 2
Is this relevant?