Networked Systems

s of Posters An Implementation of the Keccak Hash Function . . . . . . . . . . . . . . . . . . . . 375 Soufiane El Moumni, Mohamed Fettach, and Abderrahim Tragha A Secure Processor Using Homomorphic Encryption. . . . . . . . . . . . . . . . . . 376 Bouchra Echandouri, Youssef Gahi, Mouhcine Guennoun, and Fouzia Omary An Ontology Based Social Search System . . . . . . . . . . . . . . . . . . . . . . . . . 377 Anas El-ansari, Abderrahim Beni-hssane, and Mostafa Saadi An Adaptive Routing Scheme in Scale-Free Networks . . . . . . . . . . . . . . . . . 378 Nora Ben Haddou, Hamid Ez-zahraouy, and Abdelilah Benyoussef Communication Interface for Distributed SDN . . . . . . . . . . . . . . . . . . . . . . 379 Fouad Benamrane, Mouad Ben Mamoun, and Redouane Benaini

[1]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

[2]  Nir Shavit,et al.  Bounded Concurrent Time-Stamping , 1997, SIAM J. Comput..

[3]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1996, JACM.

[4]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[5]  Carole Delporte-Gallet,et al.  Two Consensus Algorithms with Atomic Registers and Failure Detector Omega , 2009, ICDCN.

[6]  MICHEL HURFIN,et al.  FAST ASYNCHRONOUS CONSENSUS BASED ON A WEAK FAILURE DETECTOR , 1997 .

[7]  Michael E. Saks,et al.  Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.

[8]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[9]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[10]  André Schiper.  Early consensus in an asynchronous system with a weak failure detector , 1997, Distributed Computing.

[11]  Ambuj K. Singh,et al.  The elusive atomic register , 1994, JACM.

[12]  Achour Mostéfaoui,et al.  Leader-Based Consensus , 2001, Parallel Process. Lett..

[13]  Hagit Attiya,et al.  Wiley Series on Parallel and Distributed Computing , 2004, SCADA Security: Machine Learning Concepts for Intrusion Detection and Prevention.

[14]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[15]  Lukas Furst.  Concurrent Programming Algorithms Principles And Foundations , 2016 .

[16]  Maurice Herlihy,et al.  On the space complexity of randomized synchronization , 1993, PODC '93.

[17]  Amos Israeli,et al.  Bounded time-stamps , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[18]  Nir Shavit,et al.  Atomic snapshots of shared memory , 1990, JACM.

[19]  Carole Delporte-Gallet,et al.  Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses| , 2013, NETYS.

[20]  Maurice Herlihy,et al.  The art of multiprocessor programming , 2020, PODC '06.

[21]  Rati Gelashvili.  On the optimal space complexity of consensus for anonymous processes , 2018, Distributed Computing.

[22]  Petr Kuznetsov,et al.  On Set Consensus Numbers , 2009, DISC.

[23]  Mark Moir,et al.  Obstruction-Free Algorithms Can Be Practically Wait-Free , 2005, DISC.

[24]  Soma Chaudhuri,et al.  More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems , 1993, Inf. Comput..

[25]  Eli Gafni,et al.  Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.

[26]  Rachid Guerraoui,et al.  The complexity of obstruction-free implementations , 2009, JACM.

[27]  Maurice Herlihy,et al.  Obstruction-free synchronization: double-ended queues as an example , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[28]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[29]  Rachid Guerraoui,et al.  Tight failure detection bounds on atomic object implementations , 2010, JACM.

[30]  James Aspnes,et al.  Randomized protocols for asynchronous consensus , 2002, Distributed Computing.

[31]  George Giakkoupis,et al.  An O ( √ n ) Space Bound for Obstruction-Free Leader Election , 2013 .

[32]  Ming Li,et al.  How to share concurrent wait-free variables , 1996, JACM.

[33]  Michel Raynal,et al.  Anonymous Obstruction-free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers , 2015, OPODIS.