DE eng

Search in the Catalogues and Directories

Hits 1 – 5 of 5

1
Succinct Population Protocols for Presburger Arithmetic
In: STACS 2020 - 37th International Symposium on Theoretical Aspects of Computer Science ; https://hal.archives-ouvertes.fr/hal-03065533 ; STACS 2020 - 37th International Symposium on Theoretical Aspects of Computer Science, Mar 2020, Montpellier, France. pp.1-15, ⟨10.4230/LIPIcs.STACS.2020.40⟩ (2020)
BASE
Show details
2
Computing Least Fixed Points of Probabilistic Systems of Polynomials
In: 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010 ; https://hal.inria.fr/inria-00455344 ; 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.359-370 (2010)
BASE
Show details
3
Computing Least Fixed Points of Probabilistic Systems of Polynomials
Esparza, Javier; Gaiser, Andreas; Kiefer, Stefan. - : LIPIcs - Leibniz International Proceedings in Informatics. 27th International Symposium on Theoretical Aspects of Computer Science, 2010
BASE
Show details
4
Computing Least Fixed Points of Probabilistic Systems of Polynomials ...
Esparza, Javier; Gaiser, Andreas; Kiefer, Stefan. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2010
BASE
Show details
5
Computing Least Fixed Points of Probabilistic Systems of Polynomials ...
BASE
Show details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
5
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern