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 : 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009 : proceedings / Idit Keidar, ed.
Distributed computing : 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009 : proceedings / Idit Keidar, ed.
Creatore [DISC (Symposium) (23rd : 2009 : Elche, Spain)]
Estensione 1 online resource (xv, 532 pages) : illustrations.
Disciplina 004/.36
Accesso persona Keidar, Idit
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783642043550
3642043550
9783642043543
3642043542
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-004613458
[DISC (Symposium) (23rd : 2009 : Elche, Spain)]  
Materiale a stampa
Lo trovi qui: New York 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 Electronic books
Conference papers and proceedings
ISBN 9783662534267
3662534266
3662534258
9783662534250
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Distributed algorithms; correctness and complexity -- Distributed operating systems, middleware, database systems -- Self-stabilizing, self-organizing, and autonomous systems -- Specification, verification, and testing: tools, methodologies -- Distributed computing issues in the Internet and the Web -- Mobile agents and autonomous robots.
Record Nr. NYU-006479156
[DISC (Symposium) (30th : 2016 : Paris, France)]  
Materiale a stampa
Lo trovi qui: New York University
Distributed computing : 24th international symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010 : proceedings / Nancy A. Lynch, Alexander A. Shvartsman (eds.).
Distributed computing : 24th international symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010 : proceedings / Nancy A. Lynch, Alexander A. Shvartsman (eds.).
Creatore [DISC (Symposium) (24th : 2010 : Cambridge, Mass.)]
Estensione 1 online resource (xv, 532 pages) : illustrations.
Disciplina 004/.36
Accesso persona Lynch, Nancy A. (Nancy Ann), 1948-
Shvartsman, Alex Allister
Genere/Forma Congresses
ISBN 9783642157639
3642157637
9783642157622
3642157629
Classificazione 54.71
54.51
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-7959934
[DISC (Symposium) (24th : 2010 : Cambridge, Mass.)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Distributed computing : 22nd international symposium, DISC 2008, Arcachon, France, September 22-24, 2008 ; proceedings / Gadi Taubenfeld (ed.).
Distributed computing : 22nd international symposium, DISC 2008, Arcachon, France, September 22-24, 2008 ; proceedings / Gadi Taubenfeld (ed.).
Creatore [DISC (Symposium) (22nd : 2008 : Arcachon, France)]
Estensione 1 online resource (xvi, 522 pages) : illustrations.
Disciplina 004/.36
Accesso persona Taubenfeld, Gadi
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783540877790
3540877797
9783540877783
3540877789
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Regular Papers -- The Mailbox Problem -- Matrix Signatures: From MACs to Digital Signatures in Distributed Systems -- How to Solve Consensus in the Smallest Window of Synchrony -- Local Terminations and Distributed Computability in Anonymous Networks -- A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring -- Fast Distributed Approximations in Planar Graphs -- Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion -- The Weakest Failure Detector for Message Passing Set-Agreement -- Local Maps: New Insights into Mobile Agent Algorithms -- r 3: Resilient Random Regular Graphs -- Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics -- Constant-Space Localized Byzantine Consensus -- Optimistic Erasure-Coded Distributed Storage -- On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing -- On Radio Broadcasting in Random Geometric Graphs -- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens -- Deterministic Rendezvous in Trees with Little Memory -- Broadcasting in UDG Radio Networks with Missing and Inaccurate Information -- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges -- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory -- Permissiveness in Transactional Memories -- The Synchronization Power of Coalesced Memory Accesses -- Optimizing Threshold Protocols in Adversarial Structures -- Hopscotch Hashing -- Computing Lightweight Spanners Locally -- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension -- Leveraging Linial’s Locality Limit -- Continuous Consensus with Failures and Recoveries -- No Double Discount: Condition-Based Simultaneity Yields Limited Gain -- Bosco: One-Step Byzantine Asynchronous Consensus -- A Limit to the Power of Multiple Nucleation in Self-assembly -- Using Bounded Model Checking to Verify Consensus Algorithms -- Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks -- Brief Announcements -- Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots -- The Dynamics of Probabilistic Population Protocols -- A Distributed Algorithm for Computing and Updating the Process Number of a Forest -- Brief Announcment: Corruption Resilient Fountain Codes -- Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks -- Easy Consensus Algorithms for the Crash-Recovery Model -- Evaluating the Quality of a Network Topology through Random Walks -- Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems -- Data Failures -- Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network -- Brief Announcement: Eventual Leader Election in the Infinite Arrival Message-Passing System Model.
Record Nr. NYU-004611605
[DISC (Symposium) (22nd : 2008 : Arcachon, France)]  
Materiale a stampa
Lo trovi qui: New York University
Distributed computing : 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings / Yehuda Afek (ed.).
Distributed computing : 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings / Yehuda Afek (ed.).
Creatore [DISC (Symposium) (27th : 2013 : Jerusalem)]
Estensione 1 online resource (xxiv, 586 pages) : illustrations.
Disciplina 004.6
Accesso persona Afek, Yehuda, 1952- editor
ISBN 9783642415272
364241527X
3642415261
9783642415265
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Graph Problems in the Message Passing Model -- Distributed Minimum Cut Approximation / Mohsen Ghaffari and Fabian Kuhn -- When Distributed Computation Is Communication Expensive / David P. Woodruff and Qin Zhang -- Topology, Leader Election, and Spanning Trees -- Use Knowledge to Learn Faster: Topology Recognition with Advice / Emanuele Guido Fusco, Andrzej Pelc and Rossella Petreschi -- An O Space Bound for Obstruction-Free Leader Election / George Giakkoupis [and others] -- Distributed Protocols for Leader Election: A Game-Theoretic Perspective / Ittai Abraham, Danny Dolev and Joseph Y. Halpern -- Compact Deterministic Self-stabilizing Leader Election / Lélia Blin and Sébastien Tixeuil -- Time Optimal Synchronous Self Stabilizing Spanning Tree / Alex Kravchik and Shay Kutten -- Software Transactional Memory -- Proving Non-opacity / Mohsen Lesani and Jens Palsberg.
Exploiting Locality in Lease-Based Replicated Transactional Memory via Task Migration / Danny Hendler [and others] -- Generic Multiversion STM / Li Lu and Michael L. Scott -- Practical Parallel Nesting for Software Transactional Memory / Nuno Diegues and João Cachopo -- Shared Memory Executions -- Asynchronous Resilient Linearizability / Sagar Chordia [and others] -- Fair Synchronization / Gadi Taubenfeld -- Gossip and Rumor -- Gossip Protocols for Renaming and Sorting / George Giakkoupis, Anne-Marie Kermarrec and Philipp Woelfel -- Faster Rumor Spreading: Breaking the logn Barrier / Chen Avin and Robert Elsässer -- Shared Memory Tasks and Data Structures -- Lock-Free Data-Structure Iterators / Erez Petrank and Shahar Timnat -- Practical Non-blocking Unordered Lists / Kunlong Zhang [and others] -- Atomic Snapshots in O(log3 n) Steps Using Randomized Helping / James Aspnes and Keren Censor-Hillel.
Adaptive Register Allocation with a Linear Number of Registers / Carole Delporte-Gallet [and others] -- An Optimal Implementation of Fetch-and-Increment / Faith Ellen and Philipp Woelfel -- Replication and Consensus -- On Barriers and the Gap between Active and Passive Replication / Flavio P. Junqueira and Marco Serafini -- Wireless Networks -- Conflict Resolution and Membership Problem in Beeping Channels / Bojun Huang and Thomas Moscibroda -- Frequency Hopping against a Powerful Adversary / Yuval Emek and Roger Wattenhofer -- Sleeping Experts in Wireless Networks / Johannes Dams, Martin Hoefer and Thomas Kesselheim -- Broadcast in the Ad Hoc SINR Model / Sebastian Daum [and others] -- Distributed Randomized Broadcasting in Wireless Networks under the SINR Model / Tomasz Jurdzinski [and others] -- Crypto, Trust, and Influence -- Asynchronous Multiparty Computation with Linear Communication Complexity / Ashish Choudhury, Martin Hirt and Arpita Patra.
Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary / Paul Bunn and Rafail Ostrovsky -- On the Communication Complexity of Distributed Name-Independent Routing Schemes / Cyril Gavoille [and others] -- Convergence in (Social) Influence Networks / Silvio Frischknecht, Barbara Keller and Roger Wattenhofer -- Trustful Population Protocols / Olivier Bournez, Jonas Lefevre and Mikaël Rabie -- Networking -- Prudent Opportunistic Cognitive Radio Access Protocols / Israel Cidon, Erez Kantor and Shay Kutten -- Braess's Paradox in Wireless Networks: The Danger of Improved Technology / Michael Dinitz and Merav Parter -- Fast Structuring of Radio Networks Large for Multi-message Communications / Mohsen Ghaffari and Bernhard Haeupler -- In-Network Analytics for Ubiquitous Sensing / Ittay Eyal [and others] -- A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location / James Hegeman and Sriram V. Pemmaraju -- CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System / Sebastian Kniesburges, Andreas Koutsopoulos and Christian Scheideler.
Record Nr. STANFORD-a10299535
[DISC (Symposium) (27th : 2013 : Jerusalem)]  
Materiale a stampa
Lo trovi qui: Stanford University