The following pages link to Stefan Kiefer (Q396601):
Displaying 50 items.
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (Q396602) (← links)
- Space-efficient scheduling of stochastically generated tasks (Q418125) (← links)
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- Runtime analysis of probabilistic programs with unbounded recursion (Q743128) (← links)
- The complexity of the \(K\)th largest subset problem and related problems (Q894449) (← links)
- Three tokens in Herman's algorithm (Q1941880) (← links)
- BPA bisimilarity is EXPTIME-hard (Q1943623) (← links)
- Parikh's theorem: a simple and direct automaton construction (Q1944966) (← links)
- Image-binary automata (Q2096597) (← links)
- Selective monitoring (Q2221805) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- On complementing unambiguous automata and graphs with many cliques and cocliques (Q2671818) (← links)
- Trace Refinement in Labelled Markov Decision Processes (Q2811347) (← links)
- On the Complexity of the Equivalence Problem for Probabilistic Automata (Q2892790) (← links)
- (Q2904789) (← links)
- Model Checking Stochastic Branching Processes (Q2912726) (← links)
- On the memory consumption of probabilistic pushdown automata (Q2920112) (← links)
- Minimisation of Multiplicity Tree Automata (Q2949446) (← links)
- Bisimilarity of Probabilistic Pushdown Automata (Q2957520) (← links)
- Newtonian program analysis (Q2999782) (← links)
- On Probabilistic Parallel Programs with Process Creation and Synchronisation (Q3000662) (← links)
- Runtime Analysis of Probabilistic Programs with Unbounded Recursion (Q3012930) (← links)
- On Stabilization in Herman’s Algorithm (Q3012941) (← links)
- Computing the Least Fixed Point of Positive Polynomial Systems (Q3068634) (← links)
- COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS (Q3113763) (← links)
- The Odds of Staying on Budget (Q3449479) (← links)
- Newton’s Method for ω-Continuous Semirings (Q3520300) (← links)
- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations (Q3521959) (← links)
- Derivation Tree Analysis for Accelerated Fixed-Point Computation (Q3533020) (← links)
- (Q3549616) (← links)
- Space-Efficient Scheduling of Stochastically Generated Tasks (Q3587466) (← links)
- On Fixed Point Equations over Commutative Semirings (Q3590943) (← links)
- Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains (Q3617746) (← links)
- (Q3620428) (← links)
- (Q4558784) (← links)
- On Rationality of Nonnegative Matrix Factorization (Q4575827) (← links)
- On Restricted Nonnegative Matrix Factorization (Q4598244) (← links)
- (Q4598245) (← links)
- Markov Chains and Unambiguous Büchi Automata (Q4633525) (← links)
- Zero-reachability in probabilistic multi-counter automata (Q4635605) (← links)
- On the total variation distance of labelled Markov chains (Q4635617) (← links)
- Long-Run Average Behaviour of Probabilistic Vector Addition Systems (Q4635790) (← links)
- Convergence Thresholds of Newton's Method for Monotone Polynomial Equations (Q4910727) (← links)
- On the Complexity of Equivalence and Minimisation for Q-weighted Automata (Q4913771) (← links)
- On Nonnegative Integer Matrices and Short Killing Words (Q4992844) (← links)
- On Computing the Total Variation Distance of Hidden Markov Models. (Q5002817) (← links)
- (Q5009434) (← links)
- On Affine Reachability Problems (Q5089216) (← links)
