Antonín Kučera - Citegraph

Author Info

Name	Affiliation	Papers
ANTONÍN KUČERA	Masaryk University, Faculty of Informatics, Botanická 68a, 60200, Brno, Czech Republic	27
Collaborators	Citations	PageRank
30	262	18.04
Referers	Referees	References
363	340	494

Search Limit

100363

Publications (27 rows)

Collaborators (30 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Solving adversarial patrolling games with bounded error: (extended abstract)	1	0.39	2014
Branching-time model-checking of probabilistic pushdown automata	3	0.40	2014
Analyzing probabilistic pushdown automata	7	0.48	2013
Continuous-time stochastic games with time-bounded reachability	13	0.66	2013
Efficient controller synthesis for consumption games with multiple resource types	19	0.84	2012
Playing games with counter automata	3	0.40	2012
Minimizing expected termination time in one-counter markov decision processes	4	0.42	2012
Demuth's path to randomness	1	0.61	2012
Stochastic game logic	2	0.39	2012
Demuth randomness and computational complexity	7	0.68	2011
Approximating the termination value of one-counter MDPs and stochastic games	11	0.65	2011
Efficient Analysis of Probabilistic Programs with an Unbounded Counter.	6	0.54	2011
Reachability games on extended vector addition systems with states	48	2.15	2010
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes	12	0.70	2010
Runtime analysis of probabilistic programs with unbounded recursion	9	0.51	2010
Reachability in recursive Markov decision processes	12	0.70	2008
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives	11	0.63	2008
Methods for Quantitative Analysis of Probabilistic Pushdown Automata	2	0.46	2006
A general approach to comparing infinite-state systems with their finite-state specifications	9	0.49	2006
Computing the expected accumulated reward and gain for a subclass of infinite markov chains	3	0.39	2005
The stuttering principle revisited	11	0.57	2005
Equivalence-checking on infinite-state systems: Techniques and results	25	1.00	2005
DP Lower bounds for equivalence-checking and model-checking of one-counter automata	21	1.04	2004
The complexity of bisimilarity-checking for one-counter processes	4	0.46	2003
Effective decomposability of sequential behaviours	5	0.45	2000
On finite representations of infinite-state behaviours	2	0.41	1997
On relative randomness	11	1.61	1993