top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Distributed computing : 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014 : proceedings / Fabian Kuhn (Ed.).
Distributed computing : 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014 : proceedings / Fabian Kuhn (Ed.).
Creatore [DISC (Symposium) (28th : 2014 : Austin, Texas)]
Estensione 1 online resource (XXIII, 573 pages).
Disciplina 004/.36
Accesso persona Kuhn, Fabian, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783662451748
3662451743
9783662451731
3662451735
Classificazione 54.71
54.51
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Concurrency -- Automatically Adjusting Concurrency to the Level of Synchrony -- Biological and Chemical Networks -- Speed Faults in Computation by Chemical Reaction Networks -- Fault-Tolerant ANTS -- Task Allocation in Ant Colonies -- Agreement Problems -- Communication-Efficient Randomized Consensus -- Tight Bound on Mobile Byzantine Agreement -- Unbeatable Consensus -- Reliable Broadcast with Respect to Topology Knowledge -- Robot Coordination, Scheduling -- Evacuating Robots via Unknown Exit in a Disk -- Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots -- A Theoretical Foundation for Scheduling and Designing Heterogeneous Processors for Interactive Applications -- Graph Distances and Routing -- Vertex Fault Tolerant Additive Spanners -- Close to Linear Space Routing Schemes -- Near-Optimal Distributed Tree Embedding -- Radio Networks -- Deterministic Leader Election in Multi-hop Beeping Networks (Extended Abstract) -- Who Are You? Secure Identities in Ad Hoc Networks -- Approximate Local Sums and Their Applications in Radio Networks -- Radio Network Lower Bounds Made Easy -- Shared Memory -- On Correctness of Data Structures under Reads-Write Concurrency -- Solo-Fast Universal Constructions for Deterministic Abortable Objects -- Space Bounds for Adaptive Renaming -- Dynamic and Social Networks Lower Bounds for Structuring Unreliable Radio Networks -- Random Walks on Evolving Graphs with Recurring Topologies -- Randomized Rumor Spreading in Poorly Connected Small-World Networks -- Relativistic Systems -- Making Sense of Relativistic Distributed Systems -- Transactional Memory and Concurrent Data Structures -- Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient -- Decomposing Opacity -- The Adaptive Priority Queue with Elimination and Combining -- Improving Average Performance by Relaxing Distributed Data Structures -- Distributed Graph Algorithms -- Almost-Tight Distributed Minimum Cut Algorithms -- Distributed Algorithms for Coloring Interval Graphs -- Distributed Symmetry Breaking in Hypergraphs -- Communication -- On Streaming and Communication Complexity of the Set Cover Problem -- On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model -- Near-Constant-Time Distributed Algorithms on a Congested Clique -- Brief Announcement: Replacement -- Handling Failures in a Replicated State Machine -- Brief Announcement: The Power of Scheduling-Aware Synchronization -- Brief Announcement: Assignment of Different-Sized Inputs in MapReduce -- Brief Announcement: Scheduling Multiple Objects in Distributed Transactional Memory -- Brief Announcement: Relaxing Opacity in Pessimistic Transactional Memory -- Brief Announcement: A Practical Transactional Memory Interface -- Brief Announcement: On Dynamic and Multi-functional Labeling Schemes -- Brief Announcement: Update Consistency in Partitionable Systems -- Brief Announcement: Breaching the Wall of Impossibility Results on Disjoint-Access Parallel TM -- Brief Announcement: COP Composition Using Transaction Suspension in the Compiler -- Brief Announcement: Non-blocking Monitor Executions for Increased Parallelism -- Brief Announcement: Agreement in Partitioned Dynamic Networks -- Brief Announcement: The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm -- Brief Announcement: k-Selection and Sorting in the SINR Model -- Brief Announcement: Distributed 3/2-Approximation of the Diameter -- Brief Announcement: Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes -- Brief Announcement: Secure Anonymous Broadcast -- Brief Announcement: Privacy-Preserving Location-Based Services.
Record Nr. NYU-004450478
[DISC (Symposium) (28th : 2014 : Austin, Texas)]  
Materiale a stampa
Lo trovi qui: New York University
Distributed computing : 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012 : proceedings / Marcos K. Aguilera (ed.).
Distributed computing : 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012 : proceedings / Marcos K. Aguilera (ed.).
Creatore [DISC (Symposium) (26th : 2012 : Salvador, Brazil)]
Estensione 1 online resource.
Accesso persona Aguilera, Marcos K.
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783642336515
3642336515
9783642336508
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Shared Memory I: CBTree: A Practical Concurrent Self-Adjusting Search Tree / Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert E. Tarjan -- Efficient Fetch-and-Increment / Faith Ellen, Vijaya Ramachandran, Philipp Woelfel -- Show No Weakness: Sequentially Consistent Specifications of TSO Libraries / Alexey Gotsman, Madanlal Musuvathi, Hongseok Yang -- Mobile Agents and Overlay Networks: Collecting Information by Power-Aware Mobile Agents / Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc -- Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology / Ofer Feinerman, Amos Korman -- A Generalized Algorithm for Publish/Subscribe Overlay Design and Its Fast Implementation / Chen Chen, Roman Vitenberg, Hans-Arno Jacobsen.
Wireless and Multiple Access Channel Networks: Bounded-Contention Coding for Wireless Networks in the High SNR Regime / Keren Censor-Hillel, Bernhard Haeupler, Nancy Lynch, Muriel Médard -- Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks / Tomasz Jurdzinski, Dariusz R. Kowalski -- Distributed Online and Stochastic Queuing on a Multiple Access Channel / Marcin Bienkowski, Tomasz Jurdzinski, Miroslaw Korzeniowski, Dariusz R. Kowalski -- Dynamic Networks: Fast Distributed Computation in Dynamic Networks via Random Walks / Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan -- Dense Subgraphs on Dynamic Networks / Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan -- Lower Bounds on Information Dissemination in Dynamic Networks / Bernhard Haeupler, Fabian Kuhn -- Distributed Graph Algorithms: No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover / Mika Göös, Jukka Suomela.
"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting / Danny Dolev, Christoph Lenzen, Shir Peled -- Distributed 2-Approximation Algorithm for the Semi-matching Problem / Andrzej Czygrinow, Michal Hanćkowiak, Edyta Szymańska, Wojciech Wawrzyniak -- Wireless and Loosely Connected Networks: Bounds on Contention Management in Radio Networks / Mohsen Ghaffari, Bernhard Haeupler, Nancy Lynch, Calvin Newport -- Efficient Symmetry Breaking in Multi-Channel Radio Networks / Sebastian Daum, Fabian Kuhn, Calvin Newport -- On Byzantine Broadcast in Loosely Connected Networks / Alexandre Maurer, Sébastien Tixeuil -- Shared Memory II: RMR-Efficient Randomized Abortable Mutual Exclusion / Abhijeet Pareek, Philipp Woelfel -- Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks / Prasad Jayanti, Zhiyu Liu -- Pessimistic Software Lock-Elision / Yehuda Afek, Alexander Matveev, Nir Shavit.
Robots: Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots / Nao Fujinaga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita -- How to Gather Asynchronous Oblivious Robots on Anonymous Rings / Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra -- Position Discovery for a System of Bouncing Robots / Jurek Czyzowicz, Leszek Gąsieniec, Adrian Kosowski, Evangelos Kranakis -- Lower Bounds and Separation: Counting-Based Impossibility Proofs for Renaming and Set Agreement / Hagit Attiya, Ami Paz -- Randomized Distributed Decision / Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg -- The Strong At-Most-Once Problem / Sotirios Kentros, Chadi Kari, Aggelos Kiayias -- Brief Announcements I: Brief Announcement: Wait-Free Gathering of Mobile Robots / Zohir Bouzid, Shantanu Das, Sébastien Tixeuil -- Brief Announcement: Distributed Exclusive and Perpetual Tree Searching / Lélia Blin, Janna Burman, Nicolas Nisse.
Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks / Chuanyou Li, Michel Hurfin, Yun Wang -- Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model / Guanhong Pei, Anil Kumar S. Vullikanti -- Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model / Maleq Khan, Gopal Pandurangan, Guanhong Pei, Anil Kumar S. Vullikanti -- Brief Announcement: Deterministic Protocol for the Membership Problem in Beeping Channels / Bojun Huang -- Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers / Yukiko Yamauchi, Sébastien Tixeuil, Shuji Kijima, Masafumi Yamashita -- Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories / Gokarna Sharma, Costas Busch -- Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence / Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud.
Brief Announcement: Node Sampling Using Centrifugal Random Walks / Andrés Sevilla, Alberto Mozo, Antonio Fernández Anta -- Brief Announcement: Concurrent Wait-Free Red-Black Trees / Aravind Natarajan, Lee Savoie, Neeraj Mittal -- Brief Announcement: A Contention-Friendly, Non-blocking Skip List / Tyler Crain, Vincent Gramoli, Michel Raynal -- Brief Announcements II: Brief Announcement: Consensus and Efficient Passive Replication / Flavio Junqueira, Marco Serafini Patrick Eugster -- Brief Announcement: Anonymity, Failures, Detectors and Consensus / Zohir Bouzid, Corentin Travers -- Brief Announcement: Do VNet Embeddings Leak Information about ISP Topology? / Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan -- Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams / Shlomi Dolev, Juan Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky -- Brief Announcement: Fast Travellers: Infrastructure-Independent Deadlock Resolution in Resource-restricted Distributed Systems / Sebastian Ertel, Christof Fetzer, Michael J. Beckerle.
Brief Announcement: Hashed Predecessor Patricia Trie -- A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems / Sebastian Kniesburges, Christian Scheideler -- Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks / Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis -- Brief Announcement: SplayNets / Stefan Schmid, Chen Avin, Christian Scheideler, Bernhard Haeupler, Zvi Lotker -- Brief Announcement: Semantics of Eventually Consistent Replicated Sets / Annette Bieniusa, Marek Zawirski, Nuno Preguiça, Marc Shapiro, Carlos Baquero -- Brief Announcement: Decoupled and Consensus-Free Reconfiguration for Fault-Tolerant Storage / Eduardo Alchieri, Alysson Bessani, Fabíola Greve, Joni Fraga -- Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value Stores / Cosmin Arad, Tallat M. Shafaat, Seif Haridi -- Brief Announcement: Weighted Partial Message Matching for Implicit Multicast Systems / William Culhane, K.R. Jayaram, Patrick Eugster.
Record Nr. UCHICAGO-11077596
[DISC (Symposium) (26th : 2012 : Salvador, Brazil)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Distributed computing : 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014 : proceedings / Fabian Kuhn (Ed.).
Distributed computing : 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014 : proceedings / Fabian Kuhn (Ed.).
Creatore [DISC (Symposium) (28th : 2014 : Austin, Texas)]
Estensione 1 online resource (XXIII, 573 pages).
Disciplina 004/.36
Accesso persona Kuhn, Fabian, editor
ISBN 9783662451748
3662451743
9783662451731
3662451735
Classificazione 54.71
54.51
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Concurrency -- Automatically Adjusting Concurrency to the Level of Synchrony -- Biological and Chemical Networks -- Speed Faults in Computation by Chemical Reaction Networks -- Fault-Tolerant ANTS -- Task Allocation in Ant Colonies -- Agreement Problems -- Communication-Efficient Randomized Consensus -- Tight Bound on Mobile Byzantine Agreement -- Unbeatable Consensus -- Reliable Broadcast with Respect to Topology Knowledge -- Robot Coordination, Scheduling -- Evacuating Robots via Unknown Exit in a Disk -- Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots -- A Theoretical Foundation for Scheduling and Designing Heterogeneous Processors for Interactive Applications -- Graph Distances and Routing -- Vertex Fault Tolerant Additive Spanners -- Close to Linear Space Routing Schemes -- Near-Optimal Distributed Tree Embedding -- Radio Networks -- Deterministic Leader Election in Multi-hop Beeping Networks (Extended Abstract) -- Who Are You? Secure Identities in Ad Hoc Networks -- Approximate Local Sums and Their Applications in Radio Networks -- Radio Network Lower Bounds Made Easy -- Shared Memory -- On Correctness of Data Structures under Reads-Write Concurrency -- Solo-Fast Universal Constructions for Deterministic Abortable Objects -- Space Bounds for Adaptive Renaming -- Dynamic and Social Networks Lower Bounds for Structuring Unreliable Radio Networks -- Random Walks on Evolving Graphs with Recurring Topologies -- Randomized Rumor Spreading in Poorly Connected Small-World Networks -- Relativistic Systems -- Making Sense of Relativistic Distributed Systems -- Transactional Memory and Concurrent Data Structures -- Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient -- Decomposing Opacity -- The Adaptive Priority Queue with Elimination and Combining -- Improving Average Performance by Relaxing Distributed Data Structures -- Distributed Graph Algorithms -- Almost-Tight Distributed Minimum Cut Algorithms -- Distributed Algorithms for Coloring Interval Graphs -- Distributed Symmetry Breaking in Hypergraphs -- Communication -- On Streaming and Communication Complexity of the Set Cover Problem -- On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model -- Near-Constant-Time Distributed Algorithms on a Congested Clique -- Brief Announcement: Replacement -- Handling Failures in a Replicated State Machine -- Brief Announcement: The Power of Scheduling-Aware Synchronization -- Brief Announcement: Assignment of Different-Sized Inputs in MapReduce -- Brief Announcement: Scheduling Multiple Objects in Distributed Transactional Memory -- Brief Announcement: Relaxing Opacity in Pessimistic Transactional Memory -- Brief Announcement: A Practical Transactional Memory Interface -- Brief Announcement: On Dynamic and Multi-functional Labeling Schemes -- Brief Announcement: Update Consistency in Partitionable Systems -- Brief Announcement: Breaching the Wall of Impossibility Results on Disjoint-Access Parallel TM -- Brief Announcement: COP Composition Using Transaction Suspension in the Compiler -- Brief Announcement: Non-blocking Monitor Executions for Increased Parallelism -- Brief Announcement: Agreement in Partitioned Dynamic Networks -- Brief Announcement: The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm -- Brief Announcement: k-Selection and Sorting in the SINR Model -- Brief Announcement: Distributed 3/2-Approximation of the Diameter -- Brief Announcement: Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes -- Brief Announcement: Secure Anonymous Broadcast -- Brief Announcement: Privacy-Preserving Location-Based Services.
Record Nr. UALBERTA-6741657
[DISC (Symposium) (28th : 2014 : Austin, Texas)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Distributed computing [electronic resource] : 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings / edited by Yoram Moses
Distributed computing [electronic resource] : 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings / edited by Yoram Moses
Creatore [DISC (Symposium) (29th : 2015 : Tokyo, Japan)]
Estensione 1 online resource (xxi, 678 p.) : ill.
Disciplina 004.6
Accesso persona Moses, Yoram. editor
Genere/Forma Conference papers and proceedings
ISBN 9783662486535
3662486539
9783662486528
3662486520
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-004459130
[DISC (Symposium) (29th : 2015 : Tokyo, Japan)]  
Materiale a stampa
Lo trovi qui: New York University
Distributed computing : 25th international symposium, DISC 2011, Rome, Italy, September 20-22, 2011 : proceedings / David Peleg (ed.).
Distributed computing : 25th international symposium, DISC 2011, Rome, Italy, September 20-22, 2011 : proceedings / David Peleg (ed.).
Creatore [DISC (Symposium) (25th : 2011 : Rome, Italy)]
Estensione 1 online resource (xvii, 506 pages) : illustrations (some color).
Disciplina 004/.36
Accesso persona Peleg, D. (David)
Soggetto non controllato Computer science
Computer Communication Networks
Software engineering
Computer software
Artificial intelligence
Information Systems Applications (incl. Internet)
Algorithm Analysis and Problem Complexity
Programming Techniques
Artificial Intelligence (incl. Robotics)
ISBN 9783642241000
364224100X
9783642240997
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. STANFORD-a9391510
[DISC (Symposium) (25th : 2011 : Rome, Italy)]  
Materiale a stampa
Lo trovi qui: Stanford University
Distributed computing : 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings / Cyril Gavoille, David Ilcinkas (eds.).
Distributed computing : 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings / Cyril Gavoille, David Ilcinkas (eds.).
Creatore [DISC (Symposium) (30th : 2016 : Paris, France)]
Estensione 1 online resource (xxiv, 496 pages) : illustrations.
Disciplina 004.6
Accesso persona Gavoille, Cyril, editor
Ilcinkas, David, editor
Genere/Forma Conference papers and proceedings
ISBN 9783662534267
3662534266
3662534258
9783662534250
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-7662979
[DISC (Symposium) (30th : 2016 : Paris, France)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Distributed computing : 20th international symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006 : proceedings / Shlomi Dolev (ed.).
Distributed computing : 20th international symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006 : proceedings / Shlomi Dolev (ed.).
Creatore [DISC (Symposium) (20th : 2006 : Stockholm, Sweden)]
Estensione xv, 576 pages : illustrations ; 24 cm.
Accesso persona Dolev, Shlomi
Genere/Forma Conference papers and proceedings
ISBN 3540446249
9783540446248
3540446273
9783540446279
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Exploring Gafni's reduction land : from [Omega][superscript k] to wait-free adaptive (2p -- [p/k])-renaming via [kappa]-set agreement / Achour Mostefaoui, Michel Raynal and Corentin Travers -- Renaming in message passing systems with Byzantine failures / Michael Okun and Amnon Barak -- Built-in coloring for highly-concurrent doubly-linked lists / Hagit Attiya and Eshar Hillel -- Fault-tolerant and self-stabilizing mobile robots gathering / Xavier Defago, Maria Gradinariu, Stephane Messika and Philippe Raipin-Parvedy -- Fast Computation by population protocols with a leader / Dana Angluin, James Aspnes and David Eisenstat -- On self-stabilizing search trees / Doina Bein, Ajoy K. Datta and Lawrence L. Larmore -- Efficient dynamic aggregation / Yitzhak Birk, Idit Keidar, Liran Liss and Assaf Schuster -- Groupings and pairings in anonymous networks / Jeremie Chalopin, Shantanu Das and Nicola Santoro -- A new proof of the GHS minimum spanning tree algorithm / Yoram Moses and Benny Shimony -- A knowledge-based analysis of global function computation / Joseph Y. Halpern and Sabina Petride -- Checking a multithreaded algorithm with [superscript +]CAL / Leslie Lamport -- Capturing register and control dependence in memory consistency models with applications to the Itanium architecture / Lisa Higham, LillAnne Jackson and Jalal Kawash -- Conflict detection and validation strategies for software transactional memory / Michael F. Spear, Virendra J. Marathe, William N. Scherer III and Michael L. Scott -- Transactional locking II / Dave Dice, Ori Shalev and Nir Shavit -- Less is more : consensus gaps between restricted and unrestricted objects / Yehuda Afek and Eran Shalom -- One-step consensus solvability / Taisuke Izumi and Toshimitsu Masuzawa -- Time-bounded task-PIOAs : a framework for analyzing security protocols / Ran Canetti, Ling Cheung, Dilsun Kaynar, Moses Liskov, Nancy Lynch, Olivier Pereira and Roberto Segala -- On consistency of encrypted files / Alina Oprea and Michael K. Reiter -- Agreeing to agree : conflict resolution for optimistically replicated data / Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce and Alan Schmitt -- A lazy snapshot algorithm with eager validation / Torvald Riegel, Pascal Felber and Christof Fetzer -- Bounded wait-free f-resilient atomic Byzantine data storage systems for an unbounded number of clients / Rida A. Bazzi and Yin Ding -- Time and communication efficient consensus for crash failures / Bogdan S. Chlebus and Dariusz R. Kowalski -- Subconsensus tasks : renaming is weaker than set agreement / Eli Gafni, Sergio Rajsbaum and Maurice Herlihy -- Exact distance labelings yield additive-stretch compact routing schemes / Arthur Brady and Lenore Cowen -- A fast distributed approximation algorithm for minimum spanning trees / Maleq Khan and Gopal Pandurangan -- On randomized broadcasting in power law networks / Robert Elsasser -- Distributed approximation algorithms in unit-disk graphs / A. Czygrinow and M. Hanckowiak -- The weakest failure detectors to boost obstruction-freedom / Rachid Guerraoui, Michal Kapalka and Petr Kouznetsov -- Fully-adaptive algorithms for long-lived renaming / Alex Brodsky, Faith Ellen and Philipp Woelfel -- Constructing shared objects that are both robust and high-throughput / Danny Hendler and Shay Kutten -- Byzantine and multi-writer K-quorums / Amitanand S. Aiyer, Lorenzo Alvisi and Rida A. Bazzi -- On minimizing the number of ADMs in a general topology optical network / Michele Flammini, Mordechai Shalom and Shmuel Zaks -- Robust network supercomputing with malicious processes / Kishori M. Konwar, Sanguthevar Rajasekaran and Alexander A. Shvartsman -- Distributed resource allocation in stream processing systems / Cathy H. Xia, James A. Broberg, Zhen Liu and Li Zhang -- Low-latency atomic broadcast in the presence of contention / Piotr Zielinski -- Oblivious gradient clock synchronization / Thomas Locher and Roger Wattenhofer -- Abortable and query-abortable objects / Marcos K. Aguilera, Svend Frolund, Vassos Hadzilacos, Stephanie Loraine Horn and Sam Toueg -- Fault-tolerant semifast implementations of atomic read/write registers / Chryssis Georgiou, Nicolas C. Nicolaou and Alexander A. Shvartsman -- Convergence analysis of scalable gossip protocols / Stacy Patterson, Bassam Bamieh and Amr El Abbadi -- Computing automatically the stabilization time against the worst and the best schedules / Joffroy Beauquier, Colette Johnen and Stephane Messika -- Many slices are better than one / Vinit A. Ogale and Vijay K. Garg -- On augmented graph navigability / Pierre Fraigniaud, Emmanuelle Lebhar and Zvi Lotker -- Decoupled quorum-based Byzantine-resilient coordination in open distributed systems / Alysson Neves Bessani, Miguel Correia, Joni da Silva Fraga and Lau Cheuk Lung -- Optimistic algorithms for partial database replication / Nicolas Schiper, Rodrigo Schmidt and Fernando Pedone -- Performance analysis of cyclon, an inexpensive membership management for unstructured P2P overlays / Francois Bonnet, Frederic Tronel and Spyros Voulgaris -- Decentralized, connectivity-preserving, and cost-effective structured overlay maintenance / Yu Chen and Wei Chen -- Monitoring of linear distributed computations / Anton Esin, Rostislav Yavoraskiy and Nikolay Zemtsov -- Communication-optimal implementation of failure detector class [actual symbol not reproducible][actual symbol not reproducible] / Mikel Larrea, Alberto Lafuente and Joachim Wieland -- Synchronous distributed algorithms for node discovery and configuration in multi-channel cognitive radio networks / Srinivasan Krishnamurthy, R. Chandrasekaran, Neeraj Mittal and S. Venkatesan.
Record Nr. UCHICAGO-11065658
[DISC (Symposium) (20th : 2006 : Stockholm, Sweden)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Distributed computing : 25th international symposium, DISC 2011, Rome, Italy, September 20-22, 2011 : proceedings / David Peleg (ed.).
Distributed computing : 25th international symposium, DISC 2011, Rome, Italy, September 20-22, 2011 : proceedings / David Peleg (ed.).
Creatore [DISC (Symposium) (25th : 2011 : Rome, Italy)]
Estensione 1 online resource (xvii, 506 pages) : illustrations (some color).
Accesso persona Peleg, D. (David)
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Software engineering
Computer software
Artificial intelligence
Information Systems Applications (incl. Internet)
Algorithm Analysis and Problem Complexity
Programming Techniques
Artificial Intelligence (incl. Robotics)
ISBN 9783642241000
364224100X
9783642240997
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-11076296
[DISC (Symposium) (25th : 2011 : Rome, Italy)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Distributed computing : 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings / edited by Yoram Moses
Distributed computing : 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings / edited by Yoram Moses
Creatore [DISC (Symposium) (29th : 2015 : Tokyo, Japan)]
Estensione 1 online resource (xxi, 678 pages) : illustrations.
Disciplina 004.6
Accesso persona Moses, Yoram, editor
ISBN 9783662486535
3662486539
9783662486528
3662486520
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro; Preface; Organization; Awards and Keynote Lecture; The 2015 Edsger W. Dijkstra Prizein Distributed Computing; The 2015 Doctoral Dissertation Awardin Distributed Computing; DISC 2015 Invited Lecture:System Algorithms for the Cloud and Big Data; Contents; On the Computational Complexity of MapReduce; 1 Introduction; 2 Background and Previous Work; 2.1 MapReduce; 2.2 Complexity; 3 Models; 3.1 MapReduce and MRC; 3.2 Nonuniformity; 3.3 Other Models of Parallel Computation; 4 Space Complexity Classes in MRC0; 5 Hierarchy Theorems; 6 Discussion and Open Problems; References
Efficient Counting with Optimal Resilience1 Introduction; 1.1 Contributions; 1.2 Prior Work; 1.3 Structure of the Article; 2 Preliminaries; 3 Optimal Resilience Boosting; 3.1 The Road Map; 3.2 Agreeing on a Common Counter (Once in a While); 3.3 Reaching Consensus; 3.4 Proofs of Theorems 1 and 2; 4 Less Communication After Stabilisation; 5 Discussion; References; The Computational Power of Beeps; 1 Introduction; 2 Model; 3 Leader Election; 3.1 Leader Election Lower Bound; 3.2 The Universal Leader Election Algorithm; 3.3 Optimal Leader Election; 3.4 Fast Leader Election with Sub-Optimal State
3.5 Fast Leader Election with O(1) States and High Probability4 Solving General Distributed Decision Problems; References; Byzantine Fireflies; 1 Introduction; 2 Model and Problem; 3 Lower Bound; 4 Known Beeping Period; 4.1 Algorithm (Known Period Synchronous Beeping -- KPSB); 4.2 Informal Description; 4.3 Correctness Proof; 5 Unknown Beeping Period; 5.1 Preliminaries; 5.2 Algorithm (Unknown Period Synchronous Beeping -- UPSB); 5.3 Informal Description; 5.4 Correctness Proof; 6 Average Beeping Period; 6.1 Lower Bound; 6.2 Preliminaries; 6.3 Algorithm (Average Period Synchronous Beeping -- APSB)
6.4 Informal Description6.5 Correctness Proof; 7 Synchronous Lighting; 7.1 Problem; 7.2 Algorithm (Average Period Synchronous Lighting -- APSL); 7.3 Correctness Proof; 8 Conclusion; References; Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability; 1 Introduction; 2 Preliminaries; 3 Impossibilities; 3.1 Group Valency and Super Valency; 3.2 Impossibility Proof; 4 Lock-Free Implementations; 5 Discussion; References; Simulating a Shared Register in an Asynchronous System that Never Stops Changing; 1 Introduction; 2 Model; 3 The CCReg Algorithm; 4 Correctness Proof; 5 Discussion
Record Nr. STANFORD-a11641317
[DISC (Symposium) (29th : 2015 : Tokyo, Japan)]  
Materiale a stampa
Lo trovi qui: Stanford University
Distributed computing : 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings / edited by Yoram Moses
Distributed computing : 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings / edited by Yoram Moses
Creatore [DISC (Symposium) (29th : 2015 : Tokyo, Japan)]
Estensione 1 online resource (xxi, 678 pages) : illustrations.
Disciplina 004.6
Accesso persona Moses, Yoram, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783662486535
3662486539
9783662486528
3662486520
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro; Preface; Organization; Awards and Keynote Lecture; The 2015 Edsger W. Dijkstra Prizein Distributed Computing; The 2015 Doctoral Dissertation Awardin Distributed Computing; DISC 2015 Invited Lecture:System Algorithms for the Cloud and Big Data; Contents; On the Computational Complexity of MapReduce; 1 Introduction; 2 Background and Previous Work; 2.1 MapReduce; 2.2 Complexity; 3 Models; 3.1 MapReduce and MRC; 3.2 Nonuniformity; 3.3 Other Models of Parallel Computation; 4 Space Complexity Classes in MRC0; 5 Hierarchy Theorems; 6 Discussion and Open Problems; References
Efficient Counting with Optimal Resilience1 Introduction; 1.1 Contributions; 1.2 Prior Work; 1.3 Structure of the Article; 2 Preliminaries; 3 Optimal Resilience Boosting; 3.1 The Road Map; 3.2 Agreeing on a Common Counter (Once in a While); 3.3 Reaching Consensus; 3.4 Proofs of Theorems 1 and 2; 4 Less Communication After Stabilisation; 5 Discussion; References; The Computational Power of Beeps; 1 Introduction; 2 Model; 3 Leader Election; 3.1 Leader Election Lower Bound; 3.2 The Universal Leader Election Algorithm; 3.3 Optimal Leader Election; 3.4 Fast Leader Election with Sub-Optimal State
3.5 Fast Leader Election with O(1) States and High Probability4 Solving General Distributed Decision Problems; References; Byzantine Fireflies; 1 Introduction; 2 Model and Problem; 3 Lower Bound; 4 Known Beeping Period; 4.1 Algorithm (Known Period Synchronous Beeping -- KPSB); 4.2 Informal Description; 4.3 Correctness Proof; 5 Unknown Beeping Period; 5.1 Preliminaries; 5.2 Algorithm (Unknown Period Synchronous Beeping -- UPSB); 5.3 Informal Description; 5.4 Correctness Proof; 6 Average Beeping Period; 6.1 Lower Bound; 6.2 Preliminaries; 6.3 Algorithm (Average Period Synchronous Beeping -- APSB)
6.4 Informal Description6.5 Correctness Proof; 7 Synchronous Lighting; 7.1 Problem; 7.2 Algorithm (Average Period Synchronous Lighting -- APSL); 7.3 Correctness Proof; 8 Conclusion; References; Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability; 1 Introduction; 2 Preliminaries; 3 Impossibilities; 3.1 Group Valency and Super Valency; 3.2 Impossibility Proof; 4 Lock-Free Implementations; 5 Discussion; References; Simulating a Shared Register in an Asynchronous System that Never Stops Changing; 1 Introduction; 2 Model; 3 The CCReg Algorithm; 4 Correctness Proof; 5 Discussion
Record Nr. NYU-006474092
[DISC (Symposium) (29th : 2015 : Tokyo, Japan)]  
Materiale a stampa
Lo trovi qui: New York University