Stabilization, Safety, and Security of Distributed Systems: 22nd International Symposium, SSS 2020, Austin, TX, USA, November 18–21, 2020, Proceedings

[1]  Till Knollmann,et al.  A Discrete and Continuous Study of the Max-Chain-Formation Problem , 2022, Information and Computation.

[2]  Anisur Rahaman Molla,et al.  Dispersion of Mobile Robots , 2022, ICDCN.

[3]  Michel Raynal,et al.  Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability , 2021, Networked Systems.

[4]  Kazumasa Shinagawa,et al.  Card-Based ZKP Protocols for Takuzu and Juosan , 2021, FUN.

[5]  Toshimitsu Masuzawa,et al.  Time-optimal Loosely-stabilizing Leader Election in Population Protocols , 2020, ArXiv.

[6]  Suthee Ruangwises,et al.  Physical Zero-Knowledge Proof for Numberlink , 2021, FUN.

[7]  Introduction to local certification , 2019, Discrete Mathematics & Theoretical Computer Science.

[8]  Chuan Xu,et al.  Time-Optimal Self-Stabilizing Leader Election in Population Protocols , 2019, PODC.

[9]  Arpita Patra,et al.  On the Exact Round Complexity of Secure Three-Party Computation , 2018, Journal of Cryptology.

[10]  Petr Kuznetsov,et al.  Affine Tasks for k-Test-and-Set , 2020, SSS.

[11]  A Combinatorial Characterization of Self-Stabilizing Population Protocols , 2020, SSS.

[12]  Yefim Dinitz,et al.  Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs , 2020, ArXiv.

[13]  Christoph Lenzen,et al.  TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware , 2020, ArXiv.

[14]  Carole Delporte-Gallet,et al.  t-Resilient k-Immediate Snapshot and its Relation with Agreement Problems , 2020, ArXiv.

[15]  Axel Legay,et al.  Formalising fault injection and countermeasures , 2020, ARES.

[16]  Fadi Al-Turjman,et al.  A Dominating Tree Based Leader Election Algorithm for Smart Cities IoT Infrastructure , 2020, Mobile Networks and Applications.

[17]  Ho-Lin Chen,et al.  Self-Stabilizing Leader Election in Regular Graphs , 2020, PODC.

[18]  Friedhelm Meyer auf der Heide,et al.  A Discrete and Continuous Study of the Max-Chain-Formation Problem , 2020, SSS.

[19]  Fukuhito Ooshita,et al.  Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings , 2020, Theor. Comput. Sci..

[20]  Axel Legay,et al.  Combined software and hardware fault injection vulnerability detection , 2020, Innovations in Systems and Software Engineering.

[21]  Tatsuya Sasaki,et al.  Efficient card-based zero-knowledge proof for Sudoku , 2020, Theor. Comput. Sci..

[22]  Songtao Guo,et al.  G-PBFT: A Location-based and Scalable Consensus Protocol for IoT-Blockchain Applications , 2020, 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[23]  H. Attiya,et al.  Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement , 2020, SSS.

[24]  Toshimitsu Masuzawa,et al.  The Power of Global Knowledge on Self-stabilizing Population Protocols , 2020, SIROCCO.

[25]  Kim Yonghwan,et al.  Uniform Deployment of Mobile Agents in Dynamic Rings , 2020, SSS.

[26]  Avrim Blum,et al.  Foundations of Data Science , 2020 .

[27]  Soumyottam Chatterjee,et al.  Distributed MST: A Smoothed Analysis , 2020, ICDCN.

[28]  Ajay D. Kshemkalyani,et al.  Dispersion of Mobile Robots in the Global Communication Model , 2019, ICDCN.

[29]  L. Blin,et al.  Silent MST approximation for tiny memory , 2019, SSS.

[30]  Jukka Suomela,et al.  How much does randomness help with locally checkable problems? , 2019, PODC.

[31]  Yuval Emek,et al.  Twenty-Two New Approximate Proof Labeling Schemes , 2020, DISC.

[32]  Sébastien Tixeuil,et al.  Boosting the Efficiency of Byzantine-Tolerant Reliable Communication , 2020, SSS.

[33]  Friedhelm Meyer auf der Heide,et al.  Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented and Luminous Robots with Limited Visibility , 2020, SSS.

[34]  Anisur Rahaman Molla,et al.  Smoothed Analysis of Leader Election in Distributed Networks , 2020, SSS.

[35]  Axel Legay,et al.  Brief Announcement: Effectiveness of Code Hardening for Fault-Tolerant IoT Software , 2020, SSS.

[36]  Petr Kuznetsov,et al.  Brief Announcement: On Decidability of 2-Process Affine Models , 2020, DISC.

[37]  S. Dolev,et al.  Randomly Choose an Angle from Immense Number of Angles to Rotate Qubits, Compute and Reverse For QKD Resilient Against Weak Measurements and Securing Entanglement , 2020 .

[38]  Tatsuya Sasaki,et al.  A Physical ZKP for Slitherlink: How to Perform Physical Topology-Preserving Computation , 2019, ISPEC.

[39]  Leader Election in the Internet of Things: Challenges and Opportunities , 2019, ArXiv.

[40]  Laurent Feuilloley,et al.  Brief Announcement: Memory Lower Bounds for Self-Stabilization , 2019, DISC.

[41]  Petr Kuznetsov,et al.  Reconfigurable Lattice Agreement and Applications , 2019, OPODIS.

[42]  Shashank Srivastava,et al.  NBP: Namespace-based privacy to counter timing-based attack in named data networking , 2019, J. Netw. Comput. Appl..

[43]  Laurent Feuilloley.  Note on distributed certification of minimum spanning trees , 2019, ArXiv.

[44]  Ajay D. Kshemkalyani,et al.  Fast Dispersion of Mobile Robots on Arbitrary Graphs , 2019, ALGOSENSORS.

[45]  Tatsuya Sasaki,et al.  Card-Based Physical Zero-Knowledge Proof for Kakuro , 2019, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[46]  Ivan Damgård,et al.  Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing , 2019, IACR Cryptol. ePrint Arch..

[47]  Tatsuya Sasaki,et al.  Interactive Physical Zero-Knowledge Proof for Norinori , 2019, COCOON.

[48]  Ho-Lin Chen,et al.  Self-Stabilizing Leader Election , 2019, PODC.

[49]  Sergio Rajsbaum,et al.  An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values , 2019, 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).

[50]  Fukuhito Ooshita,et al.  Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model , 2019, IEEE Transactions on Parallel and Distributed Systems.

[51]  Feng Wu,et al.  A Secure, Efficient, and Accountable Edge-Based Access Control Framework for Information Centric Networks , 2019, IEEE/ACM Transactions on Networking.

[52]  Saptaparni Kumar,et al.  Implementing ♢P with Bounded Messages on a Network of ADD Channels , 2019, Parallel Process. Lett..

[53]  Franck Petit,et al.  Introduction to Distributed Self-Stabilizing Algorithms , 2019, Introduction to Distributed Self-Stabilizing Algorithms.

[54]  Nitin H. Vaidya,et al.  Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model , 2019, PODC.

[55]  Sébastien Tixeuil,et al.  Multi-hop Byzantine reliable broadcast with honest dealer made practical , 2019, Journal of the Brazilian Computer Society.

[56]  Fukuhito Ooshita,et al.  Partial Gathering of Mobile Agents in Arbitrary Networks , 2019, IEICE Trans. Inf. Syst..

[57]  Mauro Conti,et al.  Privacy-Aware Caching in Information-Centric Networking , 2019, IEEE Transactions on Dependable and Secure Computing.

[58]  M. Lewenstein,et al.  Quantum Entanglement , 2020, Quantum Mechanics.

[59]  Stéphane Devismes,et al.  Self-Stabilizing Distributed Cooperative Reset , 2019, 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS).

[60]  Pavan Poudel,et al.  Time-optimal uniform scattering in a grid , 2019, ICDCN.

[61]  Vijay K. Garg,et al.  Linearizable Replicated State Machines with Lattice Agreement , 2018, OPODIS 2018.

[62]  Christian Scheideler,et al.  Forming tile shapes with simple robots , 2018, Natural Computing.

[63]  Giuseppe Antonio Di Luna,et al.  Patrolling on Dynamic Ring Networks , 2019, SOFSEM.

[64]  Tim Roughgarden,et al.  Beyond worst-case analysis , 2018, Commun. ACM.

[65]  Ajay D. Kshemkalyani,et al.  Efficient dispersion of mobile robots on graphs , 2018, ICDCN.

[66]  Axel Legay,et al.  An automated and scalable formal process for detecting fault injection vulnerabilities in binaries , 2019, Concurr. Comput. Pract. Exp..

[67]  Shlomi Dolev,et al.  Polynomials Whose Secret Shares Multiplication Preserves Degree for 2-CNF Circuits Over a Dynamic Set of Secrets , 2019, IACR Cryptol. ePrint Arch..

[68]  Leslie Lamport,et al.  The mutual exclusion problem: part II - Statement and solutions , 2019, Concurrency: the Works of Leslie Lamport.

[69]  Shlomi Dolev,et al.  Optimal-Round Preprocessing-MPC via Polynomial Representation and Distributed Random Matrix (extended abstract) , 2019, IACR Cryptol. ePrint Arch..

[70]  Alfredo Navarra,et al.  Asynchronous Robots on Graphs: Gathering , 2019, Distributed Computing by Mobile Entities.

[71]  Giovanni Viglietta,et al.  Robots with Lights , 2019, Distributed Computing by Mobile Entities.

[72]  Friedhelm Meyer auf der Heide,et al.  Continuous Protocols for Swarm Robotics , 2019, Distributed Computing by Mobile Entities.

[73]  Fukuhito Ooshita,et al.  Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time , 2018, OPODIS.

[74]  Craig Gentry,et al.  Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free , 2019, IACR Cryptol. ePrint Arch..

[75]  Geoffroy Couteau.  A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model , 2018, IACR Cryptol. ePrint Arch..

[76]  Moni Naor,et al.  The Power of Distributed Verifiers in Interactive Proofs , 2018, Electron. Colloquium Comput. Complex..

[77]  Michel Raynal,et al.  Unifying Concurrent Objects and Distributed Tasks , 2018, J. ACM.

[78]  Tatsuya Sasaki,et al.  Physical Zero-Knowledge Proof for Makaro , 2018, SSS.

[79]  Mariana Raykova,et al.  RapidChain: Scaling Blockchain via Full Sharding , 2018, CCS.

[80]  Axel Legay,et al.  The State of Fault Injection Vulnerability Detection , 2018, VECoS.

[81]  Mario Gerla,et al.  Betweenness centrality and cache privacy in information-centric networks , 2018, ICN.

[82]  Michel Raynal,et al.  Fault-Tolerant Message-Passing Distributed Systems , 2018, Springer International Publishing.

[83]  Giuseppe Antonio Di Luna,et al.  Distributed exploration of dynamic rings , 2018, Distributed Computing.

[84]  Xin Wang,et al.  Distributed Line Formation Control in Swarm Robots , 2018, 2018 IEEE International Conference on Information and Automation (ICIA).

[85]  Maria Gradinariu Potop-Butucaru,et al.  On time complexity for connectivity-preserving scattering of mobile robots , 2018, Theor. Comput. Sci..

[86]  Vijay K. Garg,et al.  Lattice Agreement in Message Passing Systems , 2018, DISC.

[87]  Peter Robinson,et al.  Leader Election in Well-Connected Graphs , 2018, PODC.

[88]  Petr Kuznetsov,et al.  An Asynchronous Computability Theorem for Fair Adversaries , 2018, PODC.

[89]  John Augustine,et al.  Sublinear Message Bounds for Randomized Agreement , 2018, PODC.

[90]  Fukuhito Ooshita,et al.  Group Exploration of Dynamic Tori , 2018, 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS).

[91]  Shlomi Dolev,et al.  One-Round Secure Multiparty Computation of Arithmetic Streams and Functions - (Extended Abstract) , 2018, CSCML.

[92]  Gene Tsudik,et al.  Content-Centric and Named-Data Networking Security: The Good, The Bad and The Rest , 2018, 2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN).

[93]  Fucai Zhou,et al.  Dynamic Fully Homomorphic encryption-based Merkle Tree for lightweight streaming authenticated data structures , 2018, J. Netw. Comput. Appl..

[94]  Rafail Ostrovsky,et al.  Population Stability: Regulating Size in the Presence of an Adversary , 2018, PODC.

[95]  Sébastien Tixeuil,et al.  Synchronous Gathering without Multiplicity Detection: a Certified Algorithm , 2017, Theory of Computing Systems.

[96]  Leonid Barenboim,et al.  Locally-Iterative Distributed (Δ+ 1): -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models , 2017, PODC.

[97]  Alysson Bessani,et al.  A Byzantine Fault-Tolerant Ordering Service for the Hyperledger Fabric Blockchain Platform , 2017, 2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).

[98]  Xavier Défago,et al.  Optimally Gathering Two Robots , 2018, ICDCN.

[99]  John Augustine,et al.  Deterministic Dispersion of Mobile Robots in Dynamic Rings , 2017, ICDCN.

[100]  John Augustine,et al.  Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs , 2017, International Conference of Distributed Computing and Networking.

[101]  Mauro Conti,et al.  A Survey on Homomorphic Encryption Schemes , 2017, ACM Comput. Surv..

[102]  Carole Delporte-Gallet,et al.  Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems , 2018, IEEE Transactions on Parallel and Distributed Systems.

[103]  Chuzo Iwamoto,et al.  Herugolf and Makaro are NP-complete , 2018, FUN.

[104]  Sébastien Tixeuil,et al.  Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative , 2017, Distributed Computing.

[105]  Veysel Gazi,et al.  Distributed sensor deployment using potential fields , 2017, Ad Hoc Networks.

[106]  Gennaro Cordasco,et al.  Space-Optimal Proportion Consensus with Population Protocols , 2017, SSS.

[107]  Hirotsugu Kakugawa,et al.  Brief Announcement: Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings , 2017, SSS.

[108]  Pavan Poudel,et al.  Universally Optimal Gathering Under Limited Visibility , 2017, SSS.

[109]  Gene Tsudik,et al.  When encryption is not enough: privacy attacks in content-centric networking , 2017, ICN.

[110]  Ivan Damgård,et al.  The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited , 2017, CRYPTO.

[111]  Yoshiaki Katayama,et al.  Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights , 2017, SSS.

[112]  Ami Paz,et al.  Approximate Proof-Labeling Schemes , 2017, SIROCCO.

[113]  Christoph Lenzen,et al.  Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus , 2017, DISC.

[114]  Nicola Santoro,et al.  Gathering in Dynamic Rings , 2017, SIROCCO.

[115]  Friedhelm Meyer auf der Heide,et al.  Gathering Anonymous, Oblivious Robots on a Grid , 2017, ALGOSENSORS.

[116]  Petr Kuznetsov,et al.  Agreement Functions for Distributed Computing Models , 2017, NETYS.

[117]  Yuval Peres,et al.  Local max-cut in smoothed polynomial time , 2017, STOC.

[118]  Michael Dinitz,et al.  Smoothed Analysis of Dynamic Networks , 2015, DISC.

[119]  Elaine Shi,et al.  The Honey Badger of BFT Protocols , 2016, CCS.

[120]  Petr Kuznetsov,et al.  Read-Write Memory and k-Set Consensus as an Affine Task , 2016, OPODIS.

[121]  Zvika Brakerski,et al.  Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts , 2016, CRYPTO.

[122]  Michel Raynal,et al.  Implementing set objects in dynamic distributed systems , 2016, J. Comput. Syst. Sci..

[123]  Fukuhito Ooshita,et al.  Uniform Deployment of Mobile Agents in Asynchronous Rings , 2016, PODC.

[124]  Carole Delporte-Gallet,et al.  t-Resilient Immediate Snapshot Is Impossible , 2016, SIROCCO.

[125]  George Pavlou,et al.  Efficient Hash-routing and Domain Clustering Techniques for Information-Centric Networks , 2016, Comput. Networks.

[126]  Ajoy Kumar Datta,et al.  The Same Speed Timer in Population Protocols , 2016, 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS).

[127]  Jean-Guillaume Dumas,et al.  Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen , 2016, FUN.

[128]  Pierre Fraigniaud,et al.  Survey of Distributed Decision , 2016, Bull. EATCS.

[129]  Sylvain Clerc,et al.  Investigating the single-event-transient sensitivity of 65 nm clock trees with heavy ion irradiation and Monte-Carlo simulation , 2016, 2016 IEEE International Reliability Physics Symposium (IRPS).

[130]  B. L. Bhuva,et al.  Single-Event Transient Sensitivity Evaluation of Clock Networks at 28-nm CMOS Technology , 2016, IEEE Transactions on Nuclear Science.

[131]  Friedhelm Meyer auf der Heide,et al.  Asymptotically Optimal Gathering on a Grid , 2016, SPAA.

[132]  Nicola Santoro,et al.  Autonomous mobile robots with lights , 2016, Theor. Comput. Sci..

[133]  Friedhelm Meyer auf der Heide,et al.  Gathering a Closed Chain of Robots on a Grid , 2016, 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[134]  Fukuhito Ooshita,et al.  Partial gathering of mobile agents in asynchronous unidirectional rings , 2016, Theor. Comput. Sci..

[135]  Nicola Santoro,et al.  Distributed computing by mobile robots: uniform circle formation , 2014, Distributed Computing.

[136]  Paul G. Spirakis,et al.  Determining majority in networks with local interactions and very small local memory , 2014, Distributed Computing.

[137]  Matthias Függer,et al.  HEX: scaling honeycombs is easier than scaling clock trees , 2013, J. Comput. Syst. Sci..

[138]  Xavier Défago,et al.  Fault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering - Feasibility Study - , 2016, ArXiv.

[139]  Idit Keidar,et al.  Dynamic Atomic Snapshots , 2016, OPODIS.

[140]  Gene Tsudik,et al.  AC3N: Anonymous communication in Content-Centric Networking , 2016, 2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC).

[141]  Aziz Mohaisen,et al.  Timing Attacks on Access Privacy in Information Centric Networks and Countermeasures , 2015, IEEE Transactions on Dependable and Secure Computing.

[142]  Eli Gafni,et al.  Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution , 2015, DISC.

[143]  Hein Meling,et al.  SmartMerge: A New Approach to Reconfiguration for Atomic Storage , 2015, DISC.

[144]  Fukuhito Ooshita,et al.  A Single Agent Exploration in Unknown Undirected Graphs with Whiteboards , 2015, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[145]  Takaaki Mizuki,et al.  Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points , 2015, UCNC.

[146]  Gokarna Sharma,et al.  Tight Bounds on Localized Sensor Self-Deployment for Focused Coverage , 2015, 2015 24th International Conference on Computer Communication and Networks (ICCCN).

[147]  Taisuke Izumi.  On Space and Time Complexity of Loosely-Stabilizing Leader Election , 2015, SIROCCO.

[148]  Sébastien Tixeuil,et al.  Wait-Free Gathering Without Chirality , 2015, SIROCCO.

[149]  Pierre Fraigniaud,et al.  Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees , 2015, 2015 IEEE 35th International Conference on Distributed Computing Systems.

[150]  Lélia Blin,et al.  A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon , 2015, 2015 IEEE International Parallel and Distributed Processing Symposium.

[151]  Friedhelm Meyer auf der Heide,et al.  Linear and Competitive Strategies for Continuous Robot Formation Problems , 2015, ACM Trans. Parallel Comput..

[152]  Nahid Farhady Ghalaty,et al.  Differential Fault Intensity Analysis on PRESENT and LED Block Ciphers , 2015, COSADE.

[153]  Sruti Gan Chaudhuri,et al.  Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement , 2015, J. Discrete Algorithms.

[154]  Sébastien Tixeuil,et al.  Containing Byzantine Failures with Control Zones , 2015, IEEE Transactions on Parallel and Distributed Systems.

[155]  Sébastien Tixeuil,et al.  Impossibility of gathering, a certification , 2015, Inf. Process. Lett..

[156]  Shay Kutten,et al.  Sublinear bounds for randomized leader election , 2012, Theor. Comput. Sci..

[157]  Shlomi Dolev,et al.  Towards efficient private distributed computation on unbounded input streams , 2012, J. Math. Cryptol..

[158]  Heiko Röglin,et al.  Smoothed Analysis of Local Search for the Maximum-Cut Problem , 2017, ACM Trans. Algorithms.

[159]  Fukuhito Ooshita,et al.  Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers , 2020, OPODIS.

[160]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[161]  Tomoko Izumi,et al.  Space-efficient self-stabilizing counting population protocols on mobile sensor networks , 2014, Theor. Comput. Sci..

[162]  Boaz Patt-Shamir,et al.  On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms , 2014, SSS.

[163]  Karine Heydemann,et al.  Software Countermeasures for Control Flow Integrity of Smart Card C Codes , 2014, ESORICS.

[164]  Sébastien Tixeuil,et al.  Byzantine broadcast with fixed disjoint paths , 2014, J. Parallel Distributed Comput..

[165]  Fukuhito Ooshita,et al.  Move-optimal partial gathering of mobile agents in asynchronous trees , 2014, Theor. Comput. Sci..

[166]  Fernanda Gusmão de Lima Kastensmidt,et al.  SET Susceptibility Analysis of Clock Tree and Clock Mesh Topologies , 2014, 2014 IEEE Computer Society Annual Symposium on VLSI.

[167]  Li Yu,et al.  Limitations on information theoretically secure quantum homomorphic encryption , 2014, ArXiv.

[168]  Faith Ellen,et al.  Impossibility Results for Distributed Computing , 2014, Impossibility Results for Distributed Computing.

[169]  George Pavlou,et al.  Icarus: a caching simulator for information centric networking (ICN) , 2014, SimuTools.

[170]  Petr Kuznetsov,et al.  Strong Equivalence Relations for Iterated Models , 2014, OPODIS.

[171]  Petr Kuznetsov,et al.  A generalized asynchronous computability theorem , 2013, PODC.

[172]  Joffroy Beauquier,et al.  Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs , 2013, OPODIS.

[173]  Miguel Correia,et al.  Byzantine Fault-Tolerant Consensus in Wireless Ad Hoc Networks , 2013, IEEE Transactions on Mobile Computing.

[174]  Maurice Herlihy,et al.  Distributed Computing Through Combinatorial Topology , 2013 .

[175]  Michel Raynal,et al.  Power and limits of distributed computing shared memory models , 2013, Theor. Comput. Sci..

[176]  Sriram K. Rajamani,et al.  Asynchronous Resilient Linearizability , 2013, DISC.

[177]  Nicola Santoro,et al.  Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes , 2013, ALGOSENSORS.

[178]  George Pavlou,et al.  Hash-routing schemes for information centric networking , 2013, ICN '13.

[179]  Shay Kutten,et al.  On the Complexity of Universal Leader Election , 2015, J. ACM.

[180]  Sébastien Tixeuil,et al.  Gathering of Mobile Robots Tolerating Multiple Crash Faults , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[181]  Sayaka Kamei,et al.  Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings , 2013, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[182]  George Pavlou,et al.  Cache "less for more" in information-centric networks (extended version) , 2013, Comput. Commun..

[183]  Sayaka Kamei,et al.  Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots , 2013, IEEE Transactions on Parallel and Distributed Systems.

[184]  Anat Paskin-Cherniavsky,et al.  On the Power of Correlated Randomness in Secure Computation , 2013, TCC.

[185]  Giovanni Viglietta.  Rendezvous of Two Robots with Visible Bits , 2013, ALGOSENSORS.

[186]  Shlomi Dolev,et al.  Self-stabilizing Byzantine Resilient Topology Discovery and Message Delivery - (Extended Abstract) , 2012, NETYS.

[187]  Zhiyun Lin,et al.  An incremental deployment algorithm for wireless sensor networks using one or multiple autonomous agents , 2013, Ad Hoc Networks.

[188]  Aziz Mohaisen,et al.  Protecting access privacy of cached contents in information centric networks , 2013, ASIA CCS '13.

[189]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[190]  Sébastien Tixeuil,et al.  On the self-stabilization of mobile oblivious robots in uniform rings , 2015, Theor. Comput. Sci..

[191]  Nicola Santoro,et al.  Distributed Computing by Oblivious Mobile Robots , 2012, Synthesis Lectures on Distributed Computing Theory.

[192]  George Pavlou,et al.  Probabilistic in-network caching for information-centric networks , 2012, ICN '12.

[193]  Maurice Herlihy,et al.  Simulations and reductions for colorless tasks , 2012, PODC '12.

[194]  Sriram K. Rajamani,et al.  Generalized lattice agreement , 2012, PODC '12.

[195]  Yukiko Yamauchi,et al.  Loosely-stabilizing leader election in a population protocol model , 2012, Theor. Comput. Sci..

[196]  Friedhelm Meyer auf der Heide,et al.  Optimal and competitive runtime bounds for continuous, local gathering of mobile robots , 2012, SPAA '12.

[197]  Sébastien Tixeuil,et al.  Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection , 2012, MFCS.

[198]  Franck Petit,et al.  Self-stabilizing gathering with strong multiplicity detection , 2012, Theor. Comput. Sci..

[199]  Ron Steinfeld,et al.  Multi-party computation with conversion of secret sharing , 2012, Des. Codes Cryptogr..

[200]  Ashwin Machanavajjhala,et al.  Publishing Search Logs—A Comparative Study of Privacy Guarantees , 2012, IEEE Transactions on Knowledge and Data Engineering.

[201]  Lewis Tseng,et al.  Iterative approximate byzantine consensus in arbitrary directed graphs , 2012, PODC '12.

[202]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[203]  Gene Tsudik,et al.  ANDaNA: Anonymous Named Data Networking Application , 2011, NDSS.

[204]  Xavier Défago,et al.  The Gathering Problem for Two Oblivious Robots with Unreliable Compasses , 2012, SIAM J. Comput..

[205]  Dmitry N. Kozlov,et al.  Chromatic subdivision of a simplicial complex , 2012 .

[206]  Christophe Giraud,et al.  Dynamic Fault Injection Countermeasure , 2012 .

[207]  Michel Raynal,et al.  Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn , 2012, IEEE Transactions on Parallel and Distributed Systems.

[208]  Craig Gentry,et al.  Fully Homomorphic Encryption with Polylog Overhead , 2012, EUROCRYPT.

[209]  Koichi Wada,et al.  How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model , 2012, Theory of Computing Systems.

[210]  Ivan Damgård,et al.  Secure Two-Party Computation with Low Communication , 2012, IACR Cryptol. ePrint Arch..

[211]  Kun Peng.  Threshold distributed access control with public verification: a practical application of PVSS , 2011, International Journal of Information Security.

[212]  Kun Peng,et al.  Efficient VSS free of computational assumption , 2011, J. Parallel Distributed Comput..

[213]  Jennifer L. Welch,et al.  Link Reversal Algorithms , 2011, Synthesis Lectures on Distributed Computing Theory.

[214]  Ajoy Kumar Datta,et al.  An O(n)-time self-stabilizing leader election algorithm , 2011, J. Parallel Distributed Comput..

[215]  Sébastien Tixeuil,et al.  A Taxonomy of Daemons in Self-stabilization , 2011, ArXiv.

[216]  Bodo Manthey,et al.  Smoothed Analysis of the k-Means Method , 2011, JACM.

[217]  Matthew Roughan,et al.  The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.

[218]  Alexandre Viejo,et al.  Multi-party Private Web Search with Untrusted Partners , 2011, SecureComm.

[219]  Ricardo Reis,et al.  SET susceptibility analysis in buffered tree clock distribution networks , 2011, 2011 12th European Conference on Radiation and Its Effects on Components and Systems.

[220]  Friedhelm Meyer auf der Heide,et al.  Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed , 2011, SPAA '11.

[221]  Friedhelm Meyer auf der Heide,et al.  A tight runtime bound for synchronous gathering of autonomous robots with limited visibility , 2011, SPAA '11.

[222]  Christoph Lenzen,et al.  Fault-tolerant algorithms for tick-generation in asynchronous logic , 2011, SSS.

[223]  Sébastien Tixeuil,et al.  Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection , 2011, SIROCCO.

[224]  Alfred M. Bruckstein,et al.  Uniform multi-agent deployment on a ring , 2011, Theor. Comput. Sci..

[225]  Rachid Guerraoui,et al.  Introduction to Reliable and Secure Distributed Programming , 2011 .

[226]  David Peleg,et al.  Distributed verification and hardness of distributed approximation , 2010, STOC '11.

[227]  Robert Elsässer,et al.  Settling the Complexity of Local Max-Cut (Almost) Completely , 2010, ICALP.

[228]  Rachid Guerraoui,et al.  The disagreement power of an adversary , 2011, Distributed Computing.

[229]  Eli Gafni,et al.  Distributed Programming with Tasks , 2010, OPODIS.

[230]  Pekka Nikander,et al.  Developing Information Networking Further: From PSIRP to PURSUIT , 2010, BROADNETS.

[231]  Nancy A. Lynch,et al.  Rambo: a robust, reconfigurable atomic memory service for dynamic networks , 2010, Distributed Computing.

[232]  Shay Kutten,et al.  Low Communication Self-stabilization through Randomization , 2010, DISC.

[233]  Alfredo Navarra,et al.  Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring , 2010, Theor. Comput. Sci..

[234]  Craig Gentry,et al.  Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.

[235]  Euripides Markou,et al.  The Mobile Agent Rendezvous Problem in the Ring , 2010, Synthesis Lectures on Distributed Computing Theory.

[236]  Sergio Rajsbaum,et al.  Iterated Shared Memory Models , 2010, LATIN.

[237]  Xavier Défago,et al.  The cost of probabilistic agreement in oblivious robot networks , 2010, Inf. Process. Lett..

[238]  Frederik Vercauteren,et al.  Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes , 2010, Public Key Cryptography.

[239]  Kun Peng,et al.  Efficient Publicly Verifiable Secret Sharing with Correctness, Soundness and ZK Privacy , 2009, WISA.

[240]  Shay Kutten,et al.  Making Population Protocols Self-stabilizing , 2009, SSS.

[241]  Marcos K. Aguilera,et al.  Dynamic atomic storage without consensus , 2009, PODC '09.

[242]  Friedhelm Meyer auf der Heide,et al.  Optimal strategies for maintaining a chain of relays between an explorer and a base camp , 2009, Theor. Comput. Sci..

[243]  Alex Wright,et al.  Contemporary approaches to fault tolerance , 2009, CACM.

[244]  Anne-Marie Kermarrec,et al.  Implementing a Register in a Dynamic Distributed System , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[245]  Lali Barrière,et al.  Uniform scattering of autonomous mobile robots in a grid , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[246]  Franck Petit,et al.  Self-stabilizing Deterministic Gathering , 2009, ALGOSENSORS.

[247]  Jehoshua Bruck,et al.  Programmability of Chemical Reaction Networks , 2009, Algorithmic Bioprocesses.

[248]  Nicola Santoro,et al.  Arbitrary pattern formation by asynchronous, anonymous, oblivious robots , 2008, Theor. Comput. Sci..

[249]  Dahlia Malkhi,et al.  Efficient distributed approximation algorithms via probabilistic tree embeddings , 2008, PODC '08.

[250]  Nicola Santoro,et al.  Self-deployment of mobile sensors on a ring , 2008, Theor. Comput. Sci..

[251]  Reuven Cohen,et al.  Local spreading algorithms for autonomous robot systems , 2008, Theor. Comput. Sci..

[252]  Xavier Défago,et al.  Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity , 2008, Theor. Comput. Sci..

[253]  Ashwin Machanavajjhala,et al.  Privacy: Theory meets Practice on the Map , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[254]  Moni Naor,et al.  Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles , 2008, Theory of Computing Systems.

[255]  David Eisenstat,et al.  Fast computation by population protocols with a leader , 2006, Distributed Computing.

[256]  Michael J. Fischer,et al.  Self-stabilizing population protocols , 2005, TAAS.

[257]  Michel Raynal,et al.  A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems , 2007, 10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'07).

[258]  Michel Raynal,et al.  Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability , 2007, 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007).

[259]  Andrey Bogdanov,et al.  PRESENT: An Ultra-Lightweight Block Cipher , 2007, CHES.

[260]  Srikanth Sastry,et al.  Eventually Perfect Failure Detectors Using ADD Channels , 2007, ISPA.

[261]  Ajoy Kumar Datta,et al.  Snap-stabilization and PIF in tree networks , 2007, Distributed Computing.

[262]  Christian Scheideler,et al.  Linearization: Locally Self-Stabilizing Sorting in Graphs , 2007, ALENEX.

[263]  David Eisenstat,et al.  The computational power of population protocols , 2006, Distributed Computing.

[264]  Sébastien Tixeuil,et al.  Transient fault detectors , 1998, Distributed Computing.

[265]  B. Awerbuch,et al.  Memory-eecient and Self-stabilizing Network Reset , 2007 .

[266]  James Aspnes,et al.  An Introduction to Population Protocols , 2007, Bull. EATCS.

[267]  Michael J. Fischer,et al.  Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents , 2006, OPODIS.

[268]  Evangelos Kranakis,et al.  An Algorithmic Theory of Mobile Agents , 2006, TGC.

[269]  Xavier Défago,et al.  Fault-Tolerant and Self-stabilizing Mobile Robots Gathering , 2006, DISC.

[270]  Friedhelm Meyer auf der Heide,et al.  Maintaining Communication Between an Explorer and a Base Station , 2006, BICC.

[271]  Shay Kutten,et al.  Distributed verification of minimum spanning trees , 2006, PODC '06.

[272]  Reuven Cohen,et al.  Local Algorithms for Autonomous Robot Systems , 2006, SIROCCO.

[273]  Nikolaos Laoutaris,et al.  The LCD interconnection of LRU caches and its analysis , 2006, Perform. Evaluation.

[274]  Michael K. Reiter,et al.  Fault-scalable Byzantine fault-tolerant services , 2005, SOSP '05.

[275]  Laurence Pilard,et al.  Observing Locally Self-Stabilization in a Probabilistic Way , 2005, J. Aerosp. Comput. Inf. Commun..

[276]  Shay Kutten,et al.  Proof labeling schemes , 2005, PODC '05.

[277]  Nitin H. Vaidya,et al.  On reliable broadcast in a radio network , 2005, PODC '05.

[278]  Nicola Santoro,et al.  Gathering of asynchronous robots with limited visibility , 2005, Theor. Comput. Sci..

[279]  Branislav Katreniak.  Biangular Circle Formation by Asynchronous Mobile Robots , 2005, SIROCCO.

[280]  A short introduction to failure detectors for asynchronous distributed systems , 2005, SIGA.

[281]  Andrzej Pelc,et al.  Broadcasting with locally bounded Byzantine faults , 2005, Inf. Process. Lett..

[282]  Ophir Rachman,et al.  Atomic snapshots using lattice agreement , 1995, Distributed Computing.

[283]  Laurence Pilard,et al.  Observing locally self-stabilization , 2005, J. High Speed Networks.

[284]  M. Dahleh.  Laboratory for Information and Decision Systems , 2005 .

[285]  Pramod K. Varshney,et al.  Energy-efficient deployment of Intelligent Mobile sensor networks , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[286]  Elaine Shi,et al.  Designing secure sensor networks , 2004, IEEE Wireless Communications.

[287]  Reuven Cohen,et al.  Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems , 2004, SIAM J. Comput..

[288]  Israel A. Wagner,et al.  Gathering Multiple Robotic A(ge)nts with Limited Sensing Capabilities , 2004, ANTS Workshop.

[289]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[290]  Chiu-Yuen Koo,et al.  Broadcast in radio networks tolerating byzantine adversarial behavior , 2004, PODC '04.

[291]  Marcos K. Aguilera,et al.  Communication-efficient leader election and consensus with limited link synchrony , 2004, PODC '04.

[292]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[293]  Marcos K. Aguilera,et al.  A pleasant stroll through the land of infinitely many creatures , 2004, SIGA.

[294]  Fuguo Deng,et al.  Secure direct communication with a quantum one-time pad , 2004, quant-ph/0405177.

[295]  Deborah Estrin,et al.  Self-configuring localization systems: Design and Experimental Evaluation , 2004, TECS.

[296]  Noa Agmon,et al.  Fault-tolerant gathering algorithms for autonomous mobile robots , 2004, SODA '04.

[297]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[298]  Jiannong Cao,et al.  Scalable load balancing on distributed web servers using mobile agents , 2003, J. Parallel Distributed Comput..

[299]  Hoa G. Nguyen,et al.  Autonomous Communication Relays for Tactical Robots , 2003 .

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

[301]  M. Kaufmann.  What Can Be Computed Locally ? , 2003 .

[302]  Esther M. Arkin,et al.  Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments , 2002, WAFR.

[303]  Miguel Castro,et al.  Farsite: federated, available, and reliable storage for an incompletely trusted environment , 2002, OPSR.

[304]  Anna Lysyanskaya,et al.  Asynchronous verifiable secret sharing and proactive cryptosystems , 2002, CCS '02.

[305]  Miguel Castro,et al.  Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.

[306]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[307]  George Cybenko,et al.  D'Agents: Applications and performance of a mobile‐agent system , 2002, Softw. Pract. Exp..

[308]  Hagit Attiya,et al.  An adaptive collect algorithm with applications , 2002, Distributed Computing.

[309]  Nancy A. Lynch,et al.  The BG distributed simulation algorithm , 2001, Distributed Computing.

[310]  Miguel Castro,et al.  BASE: using abstraction to improve fault tolerance , 2001, SOSP.

[311]  John M. Rushby,et al.  Bus Architectures for Safety-Critical Embedded Systems , 2001, EMSOFT.

[312]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[313]  Eli Gafni,et al.  The concurrency hierarchy, and algorithms for unbounded concurrency , 2001, PODC '01.

[314]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.

[315]  Ivan Damgård,et al.  Multiparty Computation from Threshold Homomorphic Encryption , 2000, EUROCRYPT.

[316]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[317]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[318]  R. Velazco,et al.  Experimentally evaluating an automatic approach for generating safety-critical software with respect to transient errors , 2000 .

[319]  Andris Ambainis,et al.  Private quantum channels , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[320]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[321]  Michael Merritt,et al.  Computing with infinitely many processes , 2013, Inf. Comput..

[322]  Cyril Gavoille,et al.  Approximate Distance Labeling Schemes , 2000, Electron. Notes Discret. Math..

[323]  Masafumi Yamashita,et al.  Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..

[324]  Jacques Traoré,et al.  Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery , 1999, ICICS.

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

[326]  Berry Schoenmakers,et al.  A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic , 1999, CRYPTO.

[327]  Maria Gradinariu Potop-Butucaru,et al.  Memory space requirements for self-stabilizing leader election protocols , 1999, PODC '99.

[328]  Danny B. Lange,et al.  Seven good reasons for mobile agents , 1999, CACM.

[329]  Masafumi Yamashita,et al.  Distributed Anonymous Mobile Robots: Formation of Geometric Patterns , 1999, SIAM J. Comput..

[330]  Franck Petit,et al.  Time and Space Optimality of Distributed Depth-First Token Circulation Algorithms , 1999, WDAS.

[331]  Andrzej Pelc,et al.  Exploring unknown undirected graphs , 1999, SODA '98.

[332]  Yuval Rabani,et al.  Local divergence of Markov chains and the analysis of iterative load-balancing schemes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[333]  Tatsuaki Okamoto,et al.  A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications , 1998, EUROCRYPT.

[334]  Eli Gafni,et al.  Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). , 1998, PODC 1998.

[335]  Mark Moir,et al.  Using local-spin k-exclusion algorithms to improve wait-free object implementations , 1997, Distributed Computing.

[336]  Moti Yung,et al.  The Local Detection Paradigm and Its Application to Self-Stabilization , 1997, Theor. Comput. Sci..

[337]  Boaz Patt-Shamir,et al.  Time-adaptive self stabilization , 1997, PODC '97.

[338]  Eli Gafni,et al.  A simple algorithmically reasoned characterization of wait-free computation (extended abstract) , 1997, PODC '97.

[339]  Yehuda Afek,et al.  Local stabilizer , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[340]  Ronald Cramer,et al.  A Secure and Optimally Efficient Multi-Authority Election Scheme ( 1 ) , 2000 .

[341]  Dhar,et al.  Eulerian Walkers as a Model of Self-Organized Criticality. , 1996, Physical review letters.

[342]  Markus Stadler,et al.  Publicly Verifiable Secret Sharing , 1996, EUROCRYPT.

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

[344]  Shlomi Dolev,et al.  SuperStabilizing protocols for dynamic distributed systems , 1995, PODC '95.

[345]  Silvio Micali,et al.  Verifiable Secret Sharing as Secure Computation , 1994, EUROCRYPT.

[346]  Boaz Patt-Shamir,et al.  Self-Stabilization by Local Checking and Global Reset (Extended Abstract) , 1994, WDAG.

[347]  Gil Neiger,et al.  Set-linearizability , 1994, PODC '94.

[348]  Maurice Herlihy,et al.  A simple constructive computability theorem for wait-free computation , 1994, STOC '94.

[349]  Eli Gafni,et al.  Immediate atomic snapshots and fast renaming , 1993, PODC '93.

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

[351]  Boaz Patt-Shamir,et al.  Time optimal self-stabilizing synchronization , 1993, STOC.

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

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

[354]  Bruce M. Maggs,et al.  Approximate load balancing on dynamic and asynchronous networks , 1993, STOC.

[355]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[356]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

[357]  Janos Simon,et al.  Observing self-stabilization , 1992, PODC '92.

[358]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[359]  B. Awerbuch,et al.  Distributed program checking: a paradigm for building self-stabilizing distributed protocols , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[360]  Boaz Patt-Shamir,et al.  Self-stabilization by local checking and correction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[361]  Torben P. Pedersen.  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

[362]  Donald Beaver,et al.  Efficient Multiparty Protocols Using Circuit Randomization , 1991, CRYPTO.

[363]  Amos Israeli,et al.  Resource bounds for self stabilizing message driven protocols , 1991, PODC '91.

[364]  Gurdip Singh.  Efficient distributed algorithms for leader election in complete networks , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[365]  Torben P. Pedersen.  Distributed Provers with Applications to Undeniable Signatures , 1991, EUROCRYPT.

[366]  Maurice Herlihy,et al.  Counting networks and multi-processor coordination , 1991, STOC '91.

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

[368]  Jacques E. Boillat,et al.  Load Balancing and Poisson Equation in a Graph , 1990, Concurr. Pract. Exp..

[369]  Moti Yung,et al.  Memory-Efficient Self Stabilizing Protocols for General Networks , 1990, WDAG.

[370]  Soma Chaudhuri,et al.  Agreement is harder than consensus: set consensus problems in totally asynchronous systems , 1990, PODC '90.

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

[372]  Hagit Attiya,et al.  Sharing memory robustly in message-passing systems , 1990, PODC '90.

[373]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[374]  Baruch Awerbuch,et al.  A trade-off between information and communication in broadcast protocols , 1990, JACM.

[375]  Shay Kutten,et al.  A modular technique for the design of efficient distributed leader finding algorithms , 1990, TOPL.

[376]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[377]  Michaël Quisquater,et al.  How to Explain Zero-Knowledge Protocols to Your Children , 1989, CRYPTO.

[378]  Shmuel Zaks,et al.  Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors , 1989, Theor. Comput. Sci..

[379]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[380]  Jan K. Pachl,et al.  Uniform self-stabilizing rings , 1988, TOPL.

[381]  Mark S. Boddy,et al.  An Analysis of Time-Dependent Planning , 1988, AAAI.

[382]  David Chaum,et al.  Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.

[383]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[384]  Paul Feldman,et al.  A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[385]  Eric Horvitz,et al.  Reasoning about beliefs and actions under computational resource constraints , 1987, Int. J. Approx. Reason..

[386]  Josh Benaloh,et al.  Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.

[387]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[388]  Silvio Micali,et al.  How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design , 1986, CRYPTO.

[389]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[390]  Shmuel Zaks,et al.  The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors , 1987, PODC '85.

[391]  Sam Toueg,et al.  Optimal clock synchronization , 1985, PODC '85.

[392]  Yehuda Afek,et al.  Time and message bounds for election in synchronous and asynchronous complete networks , 1985, PODC '85.

[393]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[394]  Danny Dolev,et al.  On the possibility and impossibility of achieving clock synchronization , 1984, STOC '84.

[395]  Nancy A. Lynch,et al.  A new fault-tolerant algorithm for clock synchronization , 1984, PODC '84.

[396]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[397]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[398]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[399]  Danny Dolev,et al.  Unanimity in an unknown and unreliable environment , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[400]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[401]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[402]  Ronald L. Rivest,et al.  ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .

[403]  Gérard Le Lann,et al.  Distributed Systems - Towards a Formal Approach , 1977, IFIP Congress.

[404]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[405]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[406]  Frank Harary,et al.  Graph Theory , 2016 .

[407]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[408]  N. Vaidya,et al.  Implementing a Reliable Local Broadcast Primitive in Wireless Ad Hoc Networks , 2022 .