Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Nicolas Braud-Santoni"'
Autor:
Florian Lonsing, Roderick Bloem, Nicolas Braud-Santoni, Uwe Egly, Martina Seidl, Vedad Hadzic
Publikováno v:
Formal Methods in System Design. 57:157-177
In recent years, expansion-based techniques have been shown to be very powerful in theory and practice for solving quantified Boolean formulas (QBF), the extension of propositional formulas with existential and universal quantifiers over Boolean vari
Autor:
Florian Lonsing, Uwe Egly, Vedad Hadzic, Nicolas Braud-Santoni, Martina Seidl, Roderick Bloem
Publikováno v:
FMCAD
In recent years, expansion-based techniques have been shown to be very powerful in theory and practice for solving quantified Boolean formulas (QBF), the extension of propositional formulas with existential and universal quantifiers over Boolean vari
Publikováno v:
TU Graz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::76ae328d0e2362f9f051197d81b9f79e
http://openlib.tugraz.at/57ac1e6f202ed
http://openlib.tugraz.at/57ac1e6f202ed
Publikováno v:
[Research Report] UPMC Sorbonne Universités/CNRS/Inria-EPI REGAL. 2014
International Journal of Networking and Computing
International Journal of Networking and Computing, Higashi Hiroshima : Dept. of Computer Engineering, Hiroshima University, 2016, 6 (1), pp.27-41
International Journal of Networking and Computing, 2016, 6 (1), pp.27-41
International Journal of Networking and Computing
International Journal of Networking and Computing, Higashi Hiroshima : Dept. of Computer Engineering, Hiroshima University, 2016, 6 (1), pp.27-41
International Journal of Networking and Computing, 2016, 6 (1), pp.27-41
International audience; We consider highly dynamic distributed systems modelled by time-varying graphs (TVGs). We first address proof of impossibility results that often use informal arguments about convergence. We provide a general framework that fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f6c9092465226b59c8e76e9ec48cdd0
https://inria.hal.science/hal-01097109
https://inria.hal.science/hal-01097109
Publikováno v:
PODC
This paper presents the first probabilistic Byzantine Agreement algorithm whose communication and time complexities are poly-logarithmic. So far, the most effective probabilistic Byzantine Agreement algorithm had communication complexity O(√n) and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9070fa92897b80eded4ddb6fef8567f
https://infoscience.epfl.ch/record/199107
https://infoscience.epfl.ch/record/199107