default search action
Andreas Gaiser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [b1]Andreas Gaiser:
Verification of Reachability Properties and Termination for Probabilistic Systems. Technical University Munich, 2013 - [j2]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) - [c7]Krishnendu Chatterjee, Andreas Gaiser, Jan Kretínský:
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. CAV 2013: 559-575 - [i5]Krishnendu Chatterjee, Andreas Gaiser, Jan Kretínský:
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. CoRR abs/1304.5281 (2013) - 2012
- [c6]Andreas Gaiser, Jan Kretínský, Javier Esparza
Rabinizer: Small Deterministic Automata for LTL(F, G). ATVA 2012: 72-76 - [c5]Javier Esparza
Proving Termination of Probabilistic Programs Using Patterns. CAV 2012: 123-138 - [i4]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
Proving Termination of Probabilistic Programs Using Patterns. CoRR abs/1204.2932 (2012) - 2011
- [c4]Javier Esparza
Probabilistic Abstractions with Arbitrary Domains. SAS 2011: 334-350 - [i3]Javier Esparza, Andreas Gaiser:
Probabilistic Abstractions with Arbitrary Domains. CoRR abs/1106.1364 (2011) - 2010
- [c3]Andreas Gaiser:
Probabilistic Verification Techniques and Probabilistic Program Analysis. AlgoSyn 2010: 148 - [c2]Javier Esparza
Computing Least Fixed Points of Probabilistic Systems of Polynomials. STACS 2010: 359-370
2000 – 2009
- 2009
- [j1]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
On least fixed points of systems of positive polynomials. ACM Commun. Comput. Algebra 43(3/4): 81-83 (2009) - [c1]Andreas Gaiser, Stefan Schwoon:
Comparison of Algorithms for Checking Emptiness on Büchi Automata. MEMICS 2009 - [i2]Andreas Gaiser, Stefan Schwoon:
Comparison of Algorithms for Checking Emptiness on Buechi Automata. CoRR abs/0910.3766 (2009) - [i1]Javier Esparza, Andreas Gaiser, Stefan Kiefer:
Computing Least Fixed Points of Probabilistic Systems of Polynomials. CoRR abs/0912.4226 (2009)
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 2024-04-25 05:54 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: