pith. sign in

Stefan G\"oller

Identifiers

  • name variant Stefan G\"oller 0.60 · backfill

Papers (10)

  1. The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages cs.FL · 2023 · author #1
  2. On long words avoiding Zimin patterns cs.DM · 2019 · author #2
  3. A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One cs.FL · 2016 · author #1
  4. Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete cs.FL · 2014 · author #3
  5. Equivalence of Deterministic One-Counter Automata is NL-complete cs.FL · 2013 · author #2
  6. Bisimilarity of Pushdown Systems is Nonelementary cs.FL · 2012 · author #2
  7. The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers cs.CC · 2012 · author #1
  8. Branching-time model checking of one-counter processes cs.LO · 2009 · author #1
  9. Branching-time model checking of one-counter processes cs.LO · 2009 · author #1
  10. On a Non-Context-Free Extension of PDL cs.LO · 2007 · author #1

Mentions

  • 1412.4259 #3 · backfill · confidence 0.70 Stefan G\"oller
  • 1301.2181 #2 · backfill · confidence 0.70 Stefan G\"oller
  • 1210.7686 #2 · backfill · confidence 0.70 Stefan G\"oller
  • 1204.1196 #1 · backfill · confidence 0.70 Stefan G\"oller
  • 0912.4117 #1 · backfill · confidence 0.70 Stefan G\"oller
  • 0909.1102 #1 · backfill · confidence 0.70 Stefan G\"oller
  • 0707.0562 #1 · backfill · confidence 0.70 Stefan G\"oller

Frequent Coauthors