BibSLEIGH — Stefan

Travelled to:

1 × Denmark
1 × Estonia
1 × Finland
1 × Germany
1 × Switzerland
2 × Austria
2 × France
2 × Iceland
2 × United Kingdom
3 × Japan
5 × USA

Collaborated with:

J.Esparza M.Luttenberger T.Brázdil J.Worrell B.Wachter A.S.Murawski A.Kucera J.Ouaknine S.Schwoon R.Grigore C.Haase T.Chen D.Wojtczak P.Novotný I.Marusic R.Bonnet A.W.Lin A.Gaiser M.Benedikt S.Göller I.H.Vareková M.Kühnrich J.Srba T.Gawlitza H.Seidl J.Katoen L.Zhang C.Baier J.K.0001 S.Klüppelholz D.M.0001 J.W.0001

Talks about:

probabilist (11) automata (7) program (5) analysi (5) system (4) method (4) newton (3) chain (3) tree (3) pushdown (2)

Person: Stefan Kiefer

DBLP: Kiefer:Stefan

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2016

Wrote 26 papers:

CAV-2015-GrigoreK: Tree Buffers (RG, SK), pp. 290–306.
FoSSaCS-2015-KieferMW #automaton #multi: Minimisation of Multiplicity Tree Automata (SK, IM, JW), pp. 297–311.
ICALP-v2-2015-HaaseK: The Odds of Staying on Budget (CH, SK), pp. 234–246.
LICS-2015-BrazdilKKN #behaviour #probability: Long-Run Average Behaviour of Probabilistic Vector Addition Systems (TB, SK, AK, PN), pp. 44–55.
FoSSaCS-2014-BonnetKL #analysis #parallel #probability #process: Analysis of Probabilistic Basic Parallel Processes (RB, SK, AWL), pp. 43–57.
ICALP-v2-2014-KieferW #automaton #complexity #probability: Stability and Complexity of Minimising Probabilistic Automata (SK, BW), pp. 268–279.
LICS-CSL-2014-BrazdilKKNK #automaton #multi #probability: Zero-reachability in probabilistic multi-counter automata (TB, SK, AK, PN, JPK), p. 10.
LICS-CSL-2014-ChenK #distance #markov #on the: On the total variation distance of labelled Markov chains (TC, SK), p. 10.
LICS-2013-BenediktGKM #automaton #similarity: Bisimilarity of Pushdown Automata is Nonelementary (MB, SG, SK, ASM), pp. 488–498.
CAV-2012-EsparzaGK #probability #proving #source code #termination #using: Proving Termination of Probabilistic Programs Using Patterns (JE, AG, SK), pp. 123–138.
CAV-2012-KieferMOWW #named #probability #source code: APEX: An Analyzer for Open Probabilistic Programs (SK, ASM, JO, BW, JW), pp. 693–698.
FoSSaCS-2012-KieferMOWW #automaton #complexity #equivalence #on the #probability #problem: On the Complexity of the Equivalence Problem for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 467–481.
CAV-2011-BrazdilKK #analysis #bound #performance #probability #source code: Efficient Analysis of Probabilistic Programs with an Unbounded Counter (TB, SK, AK), pp. 208–224.
CAV-2011-KieferMOWW #automaton #equivalence #probability: Language Equivalence for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 526–540.
ICALP-v2-2011-BrazdilKKV #analysis #bound #probability #recursion #runtime #source code: Runtime Analysis of Probabilistic Programs with Unbounded Recursion (TB, SK, AK, IHV), pp. 319–331.
ICALP-v2-2011-KieferMOWZ #algorithm #on the: On Stabilization in Herman’s Algorithm (SK, ASM, JO, JW, LZ), pp. 466–477.
TACAS-2011-KieferW #on the #parallel #probability #process #source code: On Probabilistic Parallel Programs with Process Creation and Synchronisation (SK, DW), pp. 296–310.
ICALP-v2-2010-BrazdilEKL #scheduling: Space-Efficient Scheduling of Stochastically Generated Tasks (TB, JE, SK, ML), pp. 539–550.
FoSSaCS-2009-KuhnrichSSK #analysis #data flow #infinity #interprocedural: Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains (MK, SS, JS, SK), pp. 440–455.
DLT-2008-EsparzaKL #analysis #fixpoint: Derivation Tree Analysis for Accelerated Fixed-Point Computation (JE, SK, ML), pp. 301–313.
ICALP-A-2008-EsparzaGKS #approximate #equation: Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations (JE, TG, SK, HS), pp. 698–710.
ICALP-B-2008-EsparzaKL: Newton’s Method for ω-Continuous Semirings (JE, SK, ML), pp. 14–26.
DLT-2007-EsparzaKL: An Extension of Newton’s Method to ω-Continuous Semirings (JE, SK, ML), pp. 157–168.
STOC-2007-KieferLE #convergence #equation #on the #polynomial: On the convergence of Newton’s method for monotone systems of polynomial equations (SK, ML, JE), pp. 217–226.
TACAS-2006-EsparzaKS #abstraction #automaton #refinement: Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems (JE, SK, SS), pp. 489–503.
CAV-2016-BaierK0K0W #ambiguity #automaton #markov: Markov Chains and Unambiguous Büchi Automata (CB, SK, JK0, SK, DM0, JW0), pp. 23–42.