The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Stefan Kiefer" ( http://dblp.L3S.de/Authors/Stefan_Kiefer )

  Author page on DBLP  Author page in RDF  Community of Stefan Kiefer in ASPL-2

Publication years (Num. hits)
2006-2009 (15) 2010-2011 (20) 2012 (4)
Publication types (Num. hits)
article(19) inproceedings(20)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1 occurrences of 1 keywords

Results
Found 39 publication records. Showing 39 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger Space-efficient scheduling of stochastically generated tasks. Search on Bibsonomy Inf. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Andreas Gaiser, Stefan Kiefer Proving Termination of Probabilistic Programs Using Patterns Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Tomás Brázdil, Stefan Kiefer Stabilization of Branching Queueing Networks. Search on Bibsonomy STACS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell On the Complexity of the Equivalence Problem for Probabilistic Automata. Search on Bibsonomy FoSSaCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger Parikhʼs theorem: A simple and direct automaton construction. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Michael Luttenberger Derivation tree analysis for accelerated fixed-point computation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell On the Complexity of the Equivalence Problem for Probabilistic Automata Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  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, Stefan Kiefer Stabilization of Branching Queueing Networks Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang On Stabilization in Herman's Algorithm Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Stefan Kiefer, Dominik Wojtczak On Probabilistic Parallel Programs with Process Creation and Synchronisation. Search on Bibsonomy TACAS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang On Stabilization in Herman's Algorithm. 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
1Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell Language Equivalence for Probabilistic Automata. Search on Bibsonomy CAV 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
1Javier Esparza, Stefan Kiefer, Michael Luttenberger Newtonian program analysis. Search on Bibsonomy J. ACM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger Space-efficient scheduling of stochastically generated tasks Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Michael Luttenberger Computing the Least Fixed Point of Positive Polynomial Systems 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
1Stefan Kiefer, Dominik Wojtczak On Probabilistic Parallel Programs with Process Creation and Synchronisation Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger Parikh's Theorem: A simple and direct construction Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Michael Luttenberger Computing the Least Fixed Point of Positive Polynomial Systems. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger Space-Efficient Scheduling of Stochastically Generated Tasks. Search on Bibsonomy ICALP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Andreas Gaiser, Stefan Kiefer Computing Least Fixed Points of Probabilistic Systems of Polynomials. Search on Bibsonomy STACS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Javier Esparza, Andreas Gaiser, Stefan Kiefer Computing Least Fixed Points of Probabilistic Systems of Polynomials Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. Search on Bibsonomy FOSSACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Javier Esparza, Stefan Kiefer On the Memory Consumption of Probabilistic Pushdown Automata. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Stefan Schwoon Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. Search on Bibsonomy JSAT The full citation details ... 2008 DBLP  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Michael Luttenberger Convergence Thresholds of Newton's Method for Monotone Polynomial Equations Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Michael Luttenberger Newton's Method for omega-Continuous Semirings. Search on Bibsonomy ICALP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. Search on Bibsonomy ICALP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Michael Luttenberger Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Michael Luttenberger Derivation Tree Analysis for Accelerated Fixed-Point Computation. Search on Bibsonomy Developments in Language Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Michael Luttenberger Solving Monotone Polynomial Equations. Search on Bibsonomy IFIP TCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Michael Luttenberger On Fixed Point Equations over Commutative Semirings. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Michael Luttenberger An Extension of Newton's Method to omega -Continuous Semirings. Search on Bibsonomy Developments in Language Theory The full citation details ... 2007 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
1Javier Esparza, Stefan Kiefer, Stefan Schwoon Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. Search on Bibsonomy TACAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #39 of 39 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.