The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Recursive Markov chains (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2004-2009 (12)
Publication types (Num. hits)
article(1) inproceedings(11)
Venues (Conferences, Journals, ...)
QEST(2) TACAS(2) CIAA(1) FOCS(1) FSTTCS(1) ICALP(1) IFIP TCS(1) J. ACM(1) STACS(1) STOC(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 2 keywords

Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
3Kousha Etessami, Mihalis Yannakakis Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Recursive Markov chains, monotone nonlinear systems, multi-type branching processes, Newton's method, stochastic context-free grammars
2Kousha Etessami, Mihalis Yannakakis Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Mihalis Yannakakis, Kousha Etessami Checking LTL Properties of Recursive Markov Chains. Search on Bibsonomy QEST The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. Search on Bibsonomy QEST The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Mihalis Yannakakis Automata, Probability, and Recursion. Search on Bibsonomy CIAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Stefan Kiefer, Michael Luttenberger, Javier Esparza On the convergence of Newton's method for monotone systems of polynomial equations. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF fixed-point equations, formal verification of software, probabilistic pushdown systems, Newton's method
1Kousha Etessami, Mihalis Yannakakis On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Dominik Wojtczak, Kousha Etessami PReMo : An Analyzer for P robabilistic Re cursive Mo dels. Search on Bibsonomy TACAS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Mihalis Yannakakis Recursion and Probability. Search on Bibsonomy IFIP TCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Kousha Etessami, Mihalis Yannakakis Recursive Markov Decision Processes and Recursive Stochastic Games. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Kousha Etessami, Mihalis Yannakakis Algorithmic Verification of Recursive Probabilistic State Machines. Search on Bibsonomy TACAS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Kousha Etessami Verifying Probabilistic Procedural Programs. Search on Bibsonomy FSTTCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #12 of 12 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.