pdfformat: 

@InProceedings{esparza_et_al:LIPIcs:2010:2468, author = {Javier Esparza and Andreas Gaiser and Stefan Kiefer}, title = {{Computing Least Fixed Points of Probabilistic Systems of Polynomials}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {359370}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897163}, ISSN = {18688969}, year = {2010}, volume = {5}, editor = {JeanYves Marion and Thomas Schwentick}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2468}, URN = {urn:nbn:de:0030drops24685}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2468}, annote = {Keywords: Computing fixed points, numerical approximation, stochastic models, branching processes} }
Keywords:  Computing fixed points, numerical approximation, stochastic models, branching processes  
Seminar:  27th International Symposium on Theoretical Aspects of Computer Science  
Issue date:  2010  
Date of publication:  09.03.2010 