Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVáclav Brozek
Person information
- affiliation: Masaryk University, Brno, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j6]Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee
, Vojtech Forejt, Antonín Kucera:
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. Log. Methods Comput. Sci. 10(1) (2014)- [j5]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Branching-time model-checking of probabilistic pushdown automata. J. Comput. Syst. Sci. 80(1): 139-156 (2014) - 2013
- [j4]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera:
Approximating the termination value of one-counter MDPs and stochastic games. Inf. Comput. 222: 121-138 (2013) - [j3]Václav Brozek:
Determinacy and optimal strategies in infinite-state stochastic reachability games. Theor. Comput. Sci. 493: 80-97 (2013) - 2011
- [j2]Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek:
Qualitative reachability in stochastic BPA games. Inf. Comput. 209(8): 1160-1183 (2011) - [c11]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera:
Approximating the Termination Value of One-Counter MDPs and Stochastic Games. ICALP (2) 2011: 332-343 - [c10]Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. LICS 2011: 33-42 - [c9]Václav Brozek:
Optimal Strategies in Infinite-state Stochastic Reachability Games. GandALF 2011: 60-73 - [i4]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera:
Approximating the Termination Value of One-Counter MDPs and Stochastic Games. CoRR abs/1104.4978 (2011) - 2010
- [c8]Tomás Brázdil, Václav Brozek, Kousha Etessami:
One-Counter Stochastic Games. FSTTCS 2010: 108-119 - [c7]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak:
One-Counter Markov Decision Processes. SODA 2010: 863-874 - [i3]Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek:
Qualitative Reachability in Stochastic BPA Games. CoRR abs/1003.0118 (2010) - [i2]Tomás Brázdil, Václav Brozek, Kousha Etessami:
One-Counter Stochastic Games. CoRR abs/1009.5636 (2010)
2000 – 2009
- 2009
- [c6]Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek:
Qualitative Reachability in Stochastic BPA Games. STACS 2009: 207-218 - [c5]Tomás Brázdil, Václav Brozek, Vojtech Forejt:
Branching-Time Model-Checking of Probabilistic Pushdown Automata. INFINITY 2009: 73-83 - [i1]Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak:
One-Counter Markov Decision Processes. CoRR abs/0904.2511 (2009) - 2008
- [j1]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Reachability in recursive Markov decision processes. Inf. Comput. 206(5): 520-537 (2008) - [c4]Tomás Brázdil, Václav Brozek, Jan Holecek, Antonín Kucera:
Discounted Properties of Probabilistic Pushdown Automata. LPAR 2008: 230-242 - [c3]Václav Brozek:
Regularity in PDA Games Revisited. MEMICS 2008: 5-16 - 2006
- [c2]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Reachability in Recursive Markov Decision Processes. CONCUR 2006: 358-374 - [c1]Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Stochastic Games with Branching-Time Winning Objectives. LICS 2006: 349-358
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
