Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Kiefer
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j26]Christel Baier, Stefan Kiefer, Joachim Klein, David Müller, James Worrell:
Markov chains and unambiguous automata. J. Comput. Syst. Sci. 136: 113-134 (2023)- 2022
- [j25]Emil Indzhev, Stefan Kiefer:
On complementing unambiguous automata and graphs with many cliques and cocliques. Inf. Process. Lett. 177: 106270 (2022) - [j24]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem. Log. Methods Comput. Sci. 18(1) (2022) - [c66]Oscar Darwin, Stefan Kiefer:
On the Sequential Probability Ratio Test in Hidden Markov Models. CONCUR 2022: 9:1-9:16 - [c65]Stefan Kiefer, Qiyi Tang:
Strategies for MDP Bisimilarity Equivalence and Inequivalence. CONCUR 2022: 32:1-32:22 - [c64]Mika Göös, Stefan Kiefer, Weiqiang Yuan:
Lower Bounds for Unambiguous Automata via Communication Complexity. ICALP 2022: 126:1-126:13 - [i59]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. CoRR abs/2203.12024 (2022) - [i58]Oscar Darwin, Stefan Kiefer:
On the Sequential Probability Ratio Test in Hidden Markov Models. CoRR abs/2207.14088 (2022) - [i57]Mika Göös, Stefan Kiefer, Weiqiang Yuan:
Lower Bounds for Unambiguous Automata via Communication Complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j23]Radu Grigore, Stefan Kiefer:
Selective monitoring. J. Comput. Syst. Sci. 117: 99-129 (2021) - [j22]Stefan Kiefer, Corto Mascle:
On Nonnegative Integer Matrices and Short Killing Words. SIAM J. Discret. Math. 35(2): 1252-1267 (2021) - [c63]Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger:
Enforcing ω-Regular Properties in Markov Chains by Restarting. CONCUR 2021: 5:1-5:22 - [c62]Stefan Kiefer, Pavel Semukhin, Cas Widdershoven:
Linear-Time Model Checking Branching Processes. CONCUR 2021: 6:1-6:16 - [c61]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
:
Transience in Countable MDPs. CONCUR 2021: 11:1-11:15 - [c60]Stefan Kiefer, Cas Widdershoven:
Image-Binary Automata. DCFS 2021: 176-187 - [c59]Stefan Kiefer, Qiyi Tang:
Approximate Bisimulation Minimisation. FSTTCS 2021: 48:1-48:16 - [c58]Corto Mascle, Christel Baier, Florian Funke, Simon Jantsch, Stefan Kiefer:
Responsibility and verification: Importance value in temporal logics. LICS 2021: 1-14 - [e1]Stefan Kiefer, Christine Tasson:
Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings. Lecture Notes in Computer Science 12650, Springer 2021, ISBN 978-3-030-71994-4 [contents] - [i56]Corto Mascle, Christel Baier, Florian Funke, Simon Jantsch, Stefan Kiefer:
Responsibility and verification: Importance value in temporal logics. CoRR abs/2102.06655 (2021) - [i55]Emil Indzhev, Stefan Kiefer:
On Complementing Unambiguous Automata and Graphs With Many Cliques and Cocliques. CoRR abs/2105.07470 (2021) - [i54]Stefan Kiefer, Pavel Semukhin, Cas Widdershoven:
Linear-Time Model Checking Branching Processes. CoRR abs/2107.01687 (2021) - [i53]Stefan Kiefer, Cas Widdershoven:
Image-Binary Automata. CoRR abs/2109.01049 (2021) - [i52]Mika Göös, Stefan Kiefer:
Lower Bounds on Unambiguous Automata Complementation and Separation via Communication Complexity. CoRR abs/2109.09155 (2021) - [i51]Stefan Kiefer, Qiyi Tang:
Approximate Bisimulation Minimisation. CoRR abs/2110.00326 (2021) - 2020
- [j21]Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi:
Trace Refinement in Labelled Markov Decision Processes. Log. Methods Comput. Sci. 16(2) (2020) - [c57]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of Parity Objectives in Countable MDPs. CONCUR 2020: 39:1-39:17 - [c56]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem for Labelled Markov Chains and Weighted Automata. CONCUR 2020: 41:1-41:19 - [c55]Oscar Darwin, Stefan Kiefer:
Equivalence of Hidden Markov Models with Continuous Observations. FSTTCS 2020: 43:1-43:14 - [c54]Stefan Kiefer, Qiyi Tang:
Comparing Labelled Markov Decision Processes. FSTTCS 2020: 49:1-49:16 - [c53]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, Dominik Wojtczak:
How to Play in Infinite MDPs (Invited Talk). ICALP 2020: 3:1-3:18 - [c52]Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner:
On the Size of Finite Rational Matrix Semigroups. ICALP 2020: 115:1-115:13 - [c51]Stefan Jaax, Stefan Kiefer:
On Affine Reachability Problems. MFCS 2020: 48:1-48:14 - [i50]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of Parity Objectives in Countable MDPs. CoRR abs/2007.05065 (2020) - [i49]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem for Labelled Markov Chains and Weighted Automata. CoRR abs/2007.07694 (2020) - [i48]Stefan Kiefer:
Notes on Equivalence and Minimization of Weighted Automata. CoRR abs/2009.01217 (2020) - [i47]Stefan Kiefer, Qiyi Tang:
Comparing Labelled Markov Decision Processes. CoRR abs/2009.11643 (2020) - [i46]Oscar Darwin, Stefan Kiefer:
Equivalence of Hidden Markov Models with Continuous Observations. CoRR abs/2009.12978 (2020) - [i45]Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger:
Online Monitoring ω-Regular Properties in Unknown Markov Chains. CoRR abs/2010.08347 (2020) - [i44]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Transience in Countable MDPs. CoRR abs/2012.13739 (2020)
2010 – 2019
- 2019
- [c50]Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, Mahsa Shirmohammadi:
On the Complexity of Value Iteration. ICALP 2019: 102:1-102:15 - [c49]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Büchi Objectives in Countable MDPs. ICALP 2019: 119:1-119:14 - [c48]Stefan Kiefer, Cas Widdershoven:
Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques. MFCS 2019: 82:1-82:13 - [c47]Stefan Kiefer, Corto Mascle:
On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words. STACS 2019: 43:1-43:13 - [i43]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Büchi Objectives in Countable MDPs. CoRR abs/1904.11573 (2019) - [i42]Stefan Jaax, Stefan Kiefer:
On Semigroups of Two-Dimensional Upper-Triangular Integer Matrices. CoRR abs/1905.05114 (2019) - [i41]Stefan Kiefer, Cas Widdershoven:
Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques. CoRR abs/1906.10093 (2019) - [i40]Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner:
On the Size of Finite Rational Matrix Semigroups. CoRR abs/1909.04756 (2019) - 2018
- [j20]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. Log. Methods Comput. Sci. 14(4) (2018) - [c46]Radu Grigore, Stefan Kiefer:
Selective Monitoring. CONCUR 2018: 20:1-20:16 - [c45]Stefan Kiefer:
On Computing the Total Variation Distance of Hidden Markov Models. ICALP 2018: 130:1-130:13 - [i39]Stefan Kiefer:
On Computing the Total Variation Distance of Hidden Markov Models. CoRR abs/1804.06170 (2018) - [i38]Radu Grigore, Stefan Kiefer:
Selective Monitoring. CoRR abs/1806.06143 (2018) - [i37]Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, Mahsa Shirmohammadi:
On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes. CoRR abs/1807.04920 (2018) - [i36]Stefan Kiefer, Corto Mascle:
On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words. CoRR abs/1808.00940 (2018) - 2017
- [j19]Stefan Kiefer, Ines Marusic, James Worrell:
Minimisation of Multiplicity Tree Automata. Log. Methods Comput. Sci. 13(1) (2017) - [j18]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
Nonnegative Matrix Factorization Requires Irrationality. SIAM J. Appl. Algebra Geom. 1(1): 285-307 (2017) - [c44]Christoph Haase, Stefan Kiefer, Markus Lohrey:
Computing quantiles in Markov chains with multi-dimensional costs. LICS 2017: 1-12 - [c43]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
Parity objectives in countable MDPs. LICS 2017: 1-11 - [c42]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
On strong determinacy of countable stochastic games. LICS 2017: 1-12 - [c41]Christoph Haase, Stefan Kiefer, Markus Lohrey:
Counting Problems for Parikh Images. MFCS 2017: 12:1-12:13 - [c40]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Rationality of Nonnegative Matrix Factorization. SODA 2017: 1290-1305 - [i35]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
Parity Objectives in Countable MDPs. CoRR abs/1704.04490 (2017) - [i34]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
On Strong Determinacy of Countable Stochastic Games. CoRR abs/1704.05003 (2017) - [i33]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. CoRR abs/1711.06120 (2017) - 2016
- [j17]Christoph Haase, Stefan Kiefer:
The complexity of the Kth largest subset problem and related problems. Inf. Process. Lett. 116(2): 111-115 (2016) - [c39]Christel Baier, Stefan Kiefer, Joachim Klein, Sascha Klüppelholz, David Müller, James Worrell:
Markov Chains and Unambiguous Büchi Automata. CAV (1) 2016: 23-42 - [c38]Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi:
Trace Refinement in Labelled Markov Decision Processes. FoSSaCS 2016: 303-318 - [c37]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Restricted Nonnegative Matrix Factorization. ICALP 2016: 103:1-103:14 - [c36]Maria Bruna, Radu Grigore, Stefan Kiefer, Joël Ouaknine, James Worrell:
Proving the Herman-Protocol Conjecture. ICALP 2016: 104:1-104:12 - [c35]Stefan Kiefer, A. Prasad Sistla:
Distinguishing Hidden Markov Chains. LICS 2016: 66-75 - [i32]Christoph Haase, Stefan Kiefer, Markus Lohrey:
Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images. CoRR abs/1601.04661 (2016) - [i31]Christel Baier, Stefan Kiefer, Joachim Klein, Sascha Klüppelholz, David Müller, James Worrell:
Markov Chains and Unambiguous Büchi Automata. CoRR abs/1605.00950 (2016) - [i30]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
Nonnegative Matrix Factorization Requires Irrationality. CoRR abs/1605.06848 (2016) - [i29]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Restricted Nonnegative Matrix Factorization. CoRR abs/1605.07061 (2016) - 2015
- [j16]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková:
Runtime analysis of probabilistic programs with unbounded recursion. J. Comput. Syst. Sci. 81(1): 288-310 (2015) - [c34]Radu Grigore, Stefan Kiefer:
Tree Buffers. CAV (1) 2015: 290-306 - [c33]Stefan Kiefer, Ines Marusic, James Worrell:
Minimisation of Multiplicity Tree Automata. FoSSaCS 2015: 297-311 - [c32]Christoph Haase, Stefan Kiefer:
The Odds of Staying on Budget. ICALP (2) 2015: 234-246 - [c31]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný:
Long-Run Average Behaviour of Probabilistic Vector Addition Systems. LICS 2015: 44-55 - [i28]Christoph Haase, Stefan Kiefer:
The Complexity of the Kth Largest Subset Problem and Related Problems. CoRR abs/1501.06729 (2015) - [i27]Maria Bruna, Radu Grigore, Stefan Kiefer, Joël Ouaknine, James Worrell:
Proving the Herman-Protocol Conjecture. CoRR abs/1504.01130 (2015) - [i26]Radu Grigore, Stefan Kiefer:
Tree Buffers. CoRR abs/1504.04757 (2015) - [i25]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný:
Long-Run Average Behaviour of Probabilistic Vector Addition Systems. CoRR abs/1505.02655 (2015) - [i24]Stefan Kiefer, A. Prasad Sistla:
Distinguishing Hidden Markov Chains. CoRR abs/1507.02314 (2015) - [i23]Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi:
Trace Refinement in Labelled Markov Decision Processes. CoRR abs/1510.09102 (2015) - 2014
- [j15]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Language equivalence of probabilistic pushdown automata. Inf. Comput. 237: 1-11 (2014) - [j14]Tomás Brázdil, Stefan Kiefer, Antonín Kucera:
Efficient Analysis of Probabilistic Programs with an Unbounded Counter. J. ACM 61(6): 41:1-41:35 (2014) - [c30]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen:
Zero-reachability in probabilistic multi-counter automata. CSL-LICS 2014: 22:1-22:10 - [c29]Taolue Chen, Stefan Kiefer:
On the total variation distance of labelled Markov chains. CSL-LICS 2014: 33:1-33:10 - [c28]Rémi Bonnet, Stefan Kiefer, Anthony Widjaja Lin:
Analysis of Probabilistic Basic Parallel Processes. FoSSaCS 2014: 43-57 - [c27]Stefan Kiefer, Björn Wachter:
Stability and Complexity of Minimising Probabilistic Automata. ICALP (2) 2014: 268-279 - [i22]Rémi Bonnet, Stefan Kiefer, Anthony Widjaja Lin:
Analysis of Probabilistic Basic Parallel Processes. CoRR abs/1401.4130 (2014) - [i21]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen:
Zero-Reachability in Probabilistic Multi-Counter Automata. CoRR abs/1401.6840 (2014) - [i20]Stefan Kiefer, Björn Wachter:
Stability and Complexity of Minimising Probabilistic Automata. CoRR abs/1404.6673 (2014) - [i19]Taolue Chen, Stefan Kiefer:
On the Total Variation Distance of Labelled Markov Chains. CoRR abs/1405.2852 (2014) - [i18]Christoph Haase, Stefan Kiefer:
The Odds of Staying on Budget. CoRR abs/1409.8228 (2014) - 2013
- [j13]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
On the Complexity of Equivalence and Minimisation for Q-weighted Automata. Log. Methods Comput. Sci. 9(1) (2013) - [j12]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Antonín Kucera:
Analyzing probabilistic pushdown automata. Formal Methods Syst. Des. 43(2): 124-163 (2013) - [j11]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
Algorithmic probabilistic game semantics - Playing games with automata. Formal Methods Syst. Des. 43(2): 285-312 (2013) - [j10]Stefan Kiefer:
BPA bisimilarity is EXPTIME-hard. Inf. Process. Lett. 113(4): 101-106 (2013) - [j9]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars. Inf. Process. Lett. 113(10-11): 381-385 (2013) - [c26]Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski:
Bisimilarity of Pushdown Automata is Nonelementary. LICS 2013: 488-498 - 2012
- [j8]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
Three tokens in Herman's algorithm. Formal Aspects Comput. 24(4-6): 671-678 (2012) - [j7]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Space-efficient scheduling of stochastically generated tasks. Inf. Comput. 210: 87-110 (2012) - [c25]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
Proving Termination of Probabilistic Programs Using Patterns. CAV 2012: 123-138 - [c24]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
APEX: An Analyzer for Open Probabilistic Programs. CAV 2012: 693-698 - [c23]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
On the Complexity of the Equivalence Problem for Probabilistic Automata. FoSSaCS 2012: 467-481 - [c22]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Bisimilarity of Probabilistic Pushdown Automata. FSTTCS 2012: 448-460 - [c21]Taolue Chen, Klaus Dräger, Stefan Kiefer:
Model Checking Stochastic Branching Processes. MFCS 2012: 271-282 - [c20]Tomás Brázdil, Stefan Kiefer:
Stabilization of Branching Queueing Networks. STACS 2012: 507-518 - [i17]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
Proving Termination of Probabilistic Programs Using Patterns. CoRR abs/1204.2932 (2012) - [i16]Stefan Kiefer:
BPA Bisimilarity is EXPTIME-hard. CoRR abs/1205.7041 (2012) - [i15]Taolue Chen, Klaus Dräger, Stefan Kiefer:
Model Checking Stochastic Branching Processes. CoRR abs/1206.1317 (2012) - [i14]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Bisimilarity of Probabilistic Pushdown Automata. CoRR abs/1210.2273 (2012) - [i13]Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski:
Bisimilarity of Pushdown Systems is Nonelementary. CoRR abs/1210.7686 (2012) - 2011
- [j6]Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger:
Parikhʼs theorem: A simple and direct automaton construction. Inf. Process. Lett. 111(12): 614-619 (2011) - [j5]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Derivation tree analysis for accelerated fixed-point computation. Theor. Comput. Sci. 412(28): 3226-3241 (2011) - [c19]Tomás Brázdil, Stefan Kiefer, Antonín Kucera:
Efficient Analysis of Probabilistic Programs with an Unbounded Counter. CAV 2011: 208-224 - [c18]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
Language Equivalence for Probabilistic Automata. CAV 2011: 526-540 - [c17]Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková:
Runtime Analysis of Probabilistic Programs with Unbounded Recursion. ICALP (2) 2011: 319-331 - [c16]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang:
On Stabilization in Herman's Algorithm. ICALP (2) 2011: 466-477 - [c15]Stefan Kiefer, Dominik Wojtczak:
On Probabilistic Parallel Programs with Process Creation and Synchronisation. TACAS 2011: 296-310 - [i12]Tomás Brázdil, Stefan Kiefer, Antonín Kucera:
Efficient Analysis of Probabilistic Programs with an Unbounded Counter. CoRR abs/1102.2529 (2011) - [i11]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang:
On Stabilization in Herman's Algorithm. CoRR abs/1104.3100 (2011) - [i10]Tomás Brázdil, Stefan Kiefer:
Stabilization of Branching Queueing Networks. CoRR abs/1112.1041 (2011) - [i9]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
On the Complexity of the Equivalence Problem for Probabilistic Automata. CoRR abs/1112.4644 (2011) - 2010
- [j4]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Newtonian program analysis. J. ACM 57(6): 33:1-33:47 (2010) - [j3]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Computing the Least Fixed Point of Positive Polynomial Systems. SIAM J. Comput. 39(6): 2282-2335 (2010) - [c14]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Space-Efficient Scheduling of Stochastically Generated Tasks. ICALP (2) 2010: 539-550 - [c13]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
Computing Least Fixed Points of Probabilistic Systems of Polynomials. STACS 2010: 359-370 - [i8]