The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Antonín Kucera" ( http://dblp.L3S.de/Authors/Antonín_Kucera )

URL (Homepage):  http://www.fi.muni.cz/usr/kucera  Author page on DBLP  Author page in RDF  Community of Antonín Kucera in ASPL-2

Publication years (Num. hits)
1986-1999 (17) 2000-2002 (16) 2003-2005 (19) 2006-2009 (19) 2010-2011 (21) 2012 (3)
Publication types (Num. hits)
article(42) incollection(1) inproceedings(47) proceedings(5)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords

Results
Found 95 publication records. Showing 95 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Petr Hlinený, Antonín Kucera Preface. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný Efficient Controller Synthesis for Consumption Games with Multiple Resource Types Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Antonín Kucera, André Nies Demuth's Path to Randomness. Search on Bibsonomy Computation, Physics and Beyond The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek Qualitative reachability in stochastic BPA games. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, André Nies Demuth randomness and computational complexity. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Stefan Kiefer, Antonín Kucera Efficient Analysis of Probabilistic Programs with an Unbounded Counter Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera Approximating the Termination Value of One-Counter MDPs and Stochastic Games Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák Measuring Performance of Continuous-Time Stochastic Processes using Timed Automata Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera Approximating the Termination Value of One-Counter MDPs and Stochastic Games. Search on Bibsonomy ICALP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková Runtime Analysis of Probabilistic Programs with Unbounded Recursion. Search on Bibsonomy ICALP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Stefan Kiefer, Antonín Kucera Efficient Analysis of Probabilistic Programs with an Unbounded Counter. Search on Bibsonomy CAV The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák Measuring performance of continuous-time stochastic processes using timed automata. Search on Bibsonomy HSCC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. Search on Bibsonomy LICS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Richard Mayr On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. Search on Bibsonomy Inf. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek Qualitative Reachability in Stochastic BPA Games Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Tomás Brázdil, Petr Jancar, Antonín Kucera Reachability Games on Extended Vector Addition Systems with States Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková Runtime Analysis of Probabilistic Programs with Unbounded Recursion Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Antonín Kucera Effective Analysis of Infinite State Stochastic Processes Games. Search on Bibsonomy Logics and Languages for Reliability and Security The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák Stochastic Real-Time Games with Qualitative Timed Automata Objectives. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak One-Counter Markov Decision Processes. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  BibTeX  RDF
1Tomás Brázdil, Petr Jancar, Antonín Kucera Reachability Games on Extended Vector Addition Systems with States. Search on Bibsonomy ICALP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Petr Hlinený, Antonín Kucera (eds.) Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings Search on Bibsonomy MFCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Igor Potapov (eds.) Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings Search on Bibsonomy RP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Theodore A. Slaman Low upper bounds of ideals. Search on Bibsonomy J. Symb. Log. The full citation details ... 2009 DBLP  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak One-Counter Markov Decision Processes Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek Qualitative Reachability in Stochastic BPA Games. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mogens Nielsen, Antonín Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank D. Valencia (eds.) SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings Search on Bibsonomy SOFSEM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Vojtech Forejt, Jan Krcál, Jan Kretínský, Antonín Kucera Continuous-Time Stochastic Games with Time-Bounded Reachability. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Antonín Kucera, Oldrich Strazovský Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Search on Bibsonomy Acta Inf. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera Reachability in recursive Markov decision processes. Search on Bibsonomy Inf. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Oldrich Strazovský On the Controller Synthesis for Finite-State Markov Decision Processes. Search on Bibsonomy Fundam. Inform. The full citation details ... 2008 DBLP  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Jan Holecek, Antonín Kucera Discounted Properties of Probabilistic Pushdown Automata. Search on Bibsonomy LPAR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Vojtech Forejt, Antonín Kucera Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives. Search on Bibsonomy ICALP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Vojtech Forejt, Jan Kretínský, Antonín Kucera The Satisfiability Problem for Probabilistic CTL. Search on Bibsonomy LICS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF temporal logics, Markov chains
1Ludek Kucera, Antonín Kucera (eds.) Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  BibTeX  RDF
1Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera Stochastic Game Logic. Search on Bibsonomy QEST The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Ph. Schnoebelen A general approach to comparing infinite-state systems with their finite-state specifications. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Javier Esparza, Richard Mayr Model Checking Probabilistic Pushdown Automata. Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Antonín Kucera Methods for Quantitative Analysis of Probabilistic Pushdown Automata. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Petr Jancar Equivalence-checking on infinite-state systems: Techniques and results. Search on Bibsonomy TPLP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera Reachability in Recursive Markov Decision Processes. Search on Bibsonomy CONCUR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera Stochastic Games with Branching-Time Winning Objectives. Search on Bibsonomy LICS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Jan Strejcek The stuttering principle revisited. Search on Bibsonomy Acta Inf. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Antonín Kucera, Richard Mayr Model Checking Probabilistic Pushdown Automata Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Antonín Kucera, Petr Jancar Equivalence-Checking on Infinite-State Systems: Techniques and Results Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Tomás Brázdil, Antonín Kucera, Oldrich Strazovský On the Decidability of Temporal Properties of Probabilistic Pushdown Automata. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Antonín Kucera, Richard Mayr Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. Search on Bibsonomy LICS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Javier Esparza, Antonín Kucera Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract). Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Jan Strejcek Characteristic Patterns for LTL. Search on Bibsonomy SOFSEM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Oldrich Strazovský On the Controller Synthesis for Finite-State Markov Decision Processes. Search on Bibsonomy FSTTCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Antonín Kucera Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. Search on Bibsonomy FSTTCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa DP lower bounds for equivalence-checking and model-checking of one-counter automata. Search on Bibsonomy Inf. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Ph. Schnoebelen A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. Search on Bibsonomy CONCUR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Antonín Kucera, Oldrich Strazovský Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems. Search on Bibsonomy CONCUR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Richard Mayr A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. Search on Bibsonomy IFIP TCS The full citation details ... 2004 DBLP  BibTeX  RDF
1Javier Esparza, Antonín Kucera, Richard Mayr Model Checking Probabilistic Pushdown Automata. Search on Bibsonomy LICS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Antonín Kucera The complexity of bisimilarity-checking for one-counter processes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Antonín Kucera, Stefan Schwoon Model checking LTL with regular valuations for pushdown systems. Search on Bibsonomy Inf. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Javier Esparza A Logical Viewpoint on Process-algebraic Quotients. Search on Bibsonomy J. Log. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Petr Jancar, Antonín Kucera, Faron Moller Deciding Bisimilarity between BPA and BPP Processes. Search on Bibsonomy CONCUR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Robert Batusek, Ivan Kopecek, Antonín Kucera On Homogeneous Segments. Search on Bibsonomy TSD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Richard Mayr Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Richard Mayr Simulation Preorder over Simple Process Algebras. Search on Bibsonomy Inf. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Richard Mayr Preface. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera (eds.) CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings Search on Bibsonomy CONCUR The full citation details ... 2002 DBLP  BibTeX  RDF
1Antonín Kucera, Richard Mayr Why Is Simulation Harder than Bisimulation? Search on Bibsonomy CONCUR The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Richard Mayr On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Petr Jancar Equivalence-Checking with Infinite-State Systems: Techniques and Results. Search on Bibsonomy SOFSEM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Jan Strejcek The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. Search on Bibsonomy CSL The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. Search on Bibsonomy FoSSaCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Petr Jancar, Antonín Kucera, Richard Mayr Deciding bisimulation-like equivalences with finite-state processes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Theodore A. Slaman Randomness and Recursive Enumerability. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Antonín Kucera, Stefan Schwoon Model-Checking LTL with Regular Valuations for Pushdown Systems. Search on Bibsonomy TACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Antonín Kucera Effective decomposability of sequential behaviours. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Antonín Kucera Efficient Verification Algorithms for One-Counter Processes. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Petr Jancar, Antonín Kucera, Faron Moller Simulation and Bisimulation over One-Counter Processes. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Antonín Kucera On Simulation-Checking with Sequential Systems. Search on Bibsonomy ASIAN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Antonín Kucera On Finite Representations of Infinite-State Behaviours. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Antonín Kucera Regularity of Normed PA Processes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Ivana Cerná, Mojmír Kretínský, Antonín Kucera Comparing Expressibility of Normed BPA and Normed BPP Processes. Search on Bibsonomy Acta Inf. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Sebastiaan Terwijn Lowness for The Class of Random Sets. Search on Bibsonomy J. Symb. Log. The full citation details ... 1999 DBLP  BibTeX  RDF
1Antonín Kucera, Richard Mayr Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. Search on Bibsonomy CONCUR The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Richard Mayr Simulation Preorder on Simple Process Algebras. Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Antonín Kucera, Javier Esparza A Logical Viewpoint on Process-Algebraic Quotients. Search on Bibsonomy CSL The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Petr Jancar, Antonín Kucera, Richard Mayr Deciding Bisimulation-Like Equivalences with Finite-State Processes. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Petr Jancar, Antonín Kucera Bisimilarity of processes with finite-state systems. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Antonín Kucera How to Parallelize Sequential Processes. Search on Bibsonomy CONCUR The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Antonín Kucera On Finite Representations of Infinite-State Behaviours. Search on Bibsonomy SOFSEM The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Ivana Cerná, Mojmír Kretínský, Antonín Kucera Bisimilarity is decidable in the union of normed BPA and normed BPP processes. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Antonín Kucera Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time. Search on Bibsonomy SOFSEM The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Antonín Kucera Regularity is Decidable for Normed PA Processes in Polynomial Time. Search on Bibsonomy FSTTCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Antonín Kucera On Relative Randomness. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Petr Hájek, Antonín Kucera On Recursion Theory in I Sigma1. Search on Bibsonomy J. Symb. Log. The full citation details ... 1989 DBLP  BibTeX  RDF
1Antonín Kucera An Alternative, Priority-Free, Solution to Post's Problem. Search on Bibsonomy MFCS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #95 of 95 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.