◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Kiefer

61 papers hereh-index 201.3k citations109 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • first author18
  • middle author22
  • last author16

Across the 59 of 61 papers where every author was matched, so the position is known.

fields
  • cs.FL25
  • cs.LO14
  • cs.DS7
  • cs.CC4
  • math.PR3
  • cs.GT2
same name
  • S. Kiefer — 10 papers, h 4
  • S. Kiefer — 3 papers, h 1
  • S. Kiefer — 2 papers, h 14
  • S. Kiefer — 2 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20082024
most citedParikh's Theorem: A simple and direct automaton construction

52 citations · 146 across the 41 of their papers we have counts for

collaborators
Showing 2019Show all

4 papers · 1 filter

math.GR2019★ 2 cited

On the Size of Finite Rational Matrix Semigroups

Georgina Bumpus, Christoph Haase, Stefan Kiefer +2

Let n be a positive integer and M a set of rational n×n-matrices such that M generates a finite multiplicative semigroup. We show that any matrix i…

cs.FL2019

Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques

Stefan Kiefer, Cas Widdershoven

We introduce a novel technique to analyse unambiguous Büchi automata quantitatively, and apply this to the model checking problem. It is based on linear-algebra arguments that orig…

cs.CC2019

On Affine Reachability Problems

Stefan Jaax, Stefan Kiefer

We analyze affine reachability problems in dimensions 1 and 2. We show that the reachability problem for 1-register machines over the integers with affine updates is PSPACE-hard, h…

math.PR2019★ 2 cited

Büchi Objectives in Countable MDPs

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1

We study countably infinite Markov decision processes with Büchi objectives, which ask to visit a given subset of states infinitely often. A question left open by T.P. Hill in 1979…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.