Differences
This shows you the differences between two versions of the page.
Next revision Both sides next revision | |||
erc-project_papers [2015/11/23 17:21] 127.0.0.1 external edit |
erc-project_papers [2019/08/12 17:53] fablpd |
||
---|---|---|---|
Line 5: | Line 5: | ||
==== Related Papers ==== | ==== Related Papers ==== | ||
+ | |||
+ | <html> | ||
+ | <div class="infoscience_export"><!-- https://infoscience.epfl.ch/curator/export/10917/?ln=en --><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">P.-L. Aublin, R. Guerraoui, N. Knezevic, V. Quema and M. Vukolic.</span> <span class="infoscience_title">The Next 700 BFT Protocols</span>, <span class="infoscience_host">in ACM Transactions on Computer Systems, vol. 32, num. 4</span>, 2015.<p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/208030?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/208030/files/The_next_700bft_prot_a12-aublin.pdf?version=1" class="infoscience_link_fulltext">Full Text</a> - <a href="http://dx.doi.org/10.1145/2658994" class="infoscience_link_official">View at publisher</a></p></div></div><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">J.-P. Bahsoun, R. Guerraoui and A. Shoker</span>. <span class="infoscience_title">Making BFT Protocols Really Adaptive. </span><span class="infoscience_conference">2015 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Hyderabad</span>, 2015. | ||
+ | <p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/213734?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/213734/files/making_bft.pdf?version=1" class="infoscience_link_fulltext">Full Text</a> - <a href="http://dx.doi.org/10.1109/IPDPS.2015.21" class="infoscience_link_official">View at publisher</a></p></div></div><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">S. Dubois, R. Guerraoui, P. Kuznetsov, F. Petit and P. Sens</span>. <span class="infoscience_title">The Weakest Failure Detector for Eventual Consistency. </span><span class="infoscience_conference">the 2015 ACM Symposium, Donostia-San Sebastian, Spain</span>, 2015. | ||
+ | <p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/213733?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/213733/files/the_weakest_fail_p375-dubois.pdf?version=1" class="infoscience_link_fulltext">Full Text</a> - <a href="http://dx.doi.org/10.1145/2767386.2767404" class="infoscience_link_official">View at publisher</a></p></div></div><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">R. Guerraoui and A. Maurer</span>. <span class="infoscience_title">Byzantine Fireflies. </span><span class="infoscience_conference">29th International Symposium, DISC 2015, Tokyo, Japan</span>, <span class="infoscience_series">Lecture Notes in Computer Science</span>, 2015. | ||
+ | <p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/213732?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/213732/files/byzantine_fireflies_chp3A10.10072F978-3-662-48653-5_4.pdf?version=1" class="infoscience_link_fulltext">Full Text</a> - <a href="http://dx.doi.org/10.1007/978-3-662-48653-5_4" class="infoscience_link_official">View at publisher</a></p></div></div><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">R. Guerraoui and E. Ruppert</span>. <span class="infoscience_title">A paradox of eventual linearizability in shared memory. </span><span class="infoscience_conference">the 2014 ACM symposium, Paris, France</span>, 2014. | ||
+ | <p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/208044?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/208044/files/paradox_event_shr_mem_p40-guerraoui.pdf?version=1" class="infoscience_link_fulltext">Full Text</a> - <a href="http://dx.doi.org/10.1145/2611462.2611484" class="infoscience_link_official">View at publisher</a></p></div></div><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">S. Dubois and R. Guerraoui</span>. <span class="infoscience_title">Introducing Speculation in Self-Stabilization: An Application to Mutual Exclusion. </span>, 2013. | ||
+ | <p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/199109?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/199109/files/p290-dubois.pdf?version=1" class="infoscience_link_fulltext">Full Text</a> - <a href="http://dx.doi.org/10.1145/2484239.2484246" class="infoscience_link_official">View at publisher</a></p></div></div><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">R. Guerraoui, V. Kuncak and G. Losa.</span> <span class="infoscience_title">Speculative Linearizability</span>, <span class="infoscience_host">in Acm Sigplan Notices, vol. 47, num. 6, p. 55-66</span>, 2012.<p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/184583?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/184583/files/spec_linear_p55-guerraoui.pdf?version=1" class="infoscience_link_fulltext">Full Text</a> - <a href="http://dx.doi.org/10.1145/2254064.2254072" class="infoscience_link_official">View at publisher</a></p></div></div><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">D. Alistarh, R. Guerraoui, P. Kuznetsov and G. Losa</span>. <span class="infoscience_title">On the cost of composing shared-memory algorithms. </span><span class="infoscience_conference">Proceedinbgs of the 24th ACM symposium, Pittsburgh, Pennsylvania, USA</span>, 2012. | ||
+ | <p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/208739?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/208739/files/on_the_cost_p298-alistarh.pdf?version=1" class="infoscience_link_fulltext">Full Text</a> - <a href="http://dx.doi.org/10.1145/2312005.2312057" class="infoscience_link_official">View at publisher</a></p></div></div><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">D. Alistarh, S. Gilbert, R. Guerraoui and C. Travers.</span> <span class="infoscience_title">Generating Fast Indulgent Algorithms</span>, <span class="infoscience_host">in Theory Of Computing Systems, vol. 51, num. 4, p. 404-424</span>, 2012.<p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/184190?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/184190/files/Gener_fast_Fs00224-012-9407-2.pdf?version=1" class="infoscience_link_fulltext">Full Text</a> - <a href="http://dx.doi.org/10.1007/s00224-012-9407-2" class="infoscience_link_official">View at publisher</a></p></div></div><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">C. Delporte-Gallet, H. Fauconnier, R. Guerraoui and A. Tielmann.</span> <span class="infoscience_title">The disagreement power of an adversary</span>, <span class="infoscience_host">in Distributed Computing, vol. 24, num. 3-4, p. 137-147</span>, 2011.<p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/208938?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/208938/files/the_disag_pow_of_ad_2Fs00446-010-0122-4.pdf?version=1" class="infoscience_link_fulltext">Full Text</a> - <a href="http://dx.doi.org/10.1007/s00446-010-0122-4" class="infoscience_link_official">View at publisher</a></p></div></div><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">P. Dutta and R. Guerraoui.</span> <span class="infoscience_title">The Inherent Price of Indulgence</span>, <span class="infoscience_host">in Distributed Computing, vol. 18, num. 1, p. 85-98</span>, 2005.<p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/52452?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/52452/files/IC_TECH_REPORT_200231.pdf?version=1" class="infoscience_link_fulltext">Full Text</a></p></div></div><div class="infoscience_record"><div class="infoscience_data"><span class="infoscience_authors">R. Guerraoui</span>. <span class="infoscience_title">Indulgent Algorithms. </span><span class="infoscience_conference">Symposium on Principles of Distributed Computing, Portland, Oregon, USA</span>, 2000. | ||
+ | <p class="infoscience_links"><a href="https://infoscience.epfl.ch/record/52338?ln=en" class="infoscience_link_detailed">Detailed record</a> - <a href="https://infoscience.epfl.ch/record/52338/files/IC_TECH_REPORT_200007.pdf?version=1" class="infoscience_link_fulltext">Full Text</a></p></div></div></div> | ||
+ | </html> | ||
+ | |||
<php> | <php> |