Distributed Computing

26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012, Proceedings

AvMarcos K. Aguilera

Häftad, Engelska, 2012

Del i serien Lecture Notes in Computer Science

572 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

572 kr

572 kr

572 kr

571 kr

572 kr

571 kr

571 kr

1 136 kr

572 kr

572 kr

Beskrivning

This book constitutes the refereed proceedings of the 26th International Symposium on Distributed Computing, DISC 2012, held in Salvador, Brazil, in October 2012. The 27 revised full papers presented together with 24 brief announcements were carefully reviewed and selected from 119 submissions. The papers are organized in topical sections on shared memory, mobile agents and overlay networks, wireless and multiple access channel networks, dynamic networks, distributed graph algorithms, wireless and loosely connected networks, robots, and lower bounds and separation.

Produktinformation

Utgivningsdatum:2012-09-03
Mått:155 x 235 x 26 mm
Vikt:703 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:450
Upplaga:2012
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783642336508

Utforska kategorier

Innehållsförteckning

CBTree: A Practical Concurrent Self-Adjusting Search Tree.- Efficient Fetch-and-Increment.- Show No Weakness: Sequentially Consistent Specifications of TSO Libraries.- Collecting Information by Power-Aware Mobile Agents.- Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology.- A Generalized Algorithm for Publish/Subscribe Overlay Design and Its Fast Implementation.- Bounded-Contention Coding for Wireless Networks in the High SNR Regime.- Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks.- Distributed Online and Stochastic Queuing on a Multiple Access Channel.- Fast Distributed Computation in Dynamic Networks via Random Walks.- Dense Subgraphs on Dynamic Networks.- Lower Bounds on Information Dissemination in Dynamic Networks.- No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover.- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting.- Distributed 2-Approximation Algorithm for the Semi-matching Problem.- Bounds on Contention Management in Radio Networks.- Efficient Symmetry Breaking in Multi-Channel Radio Networks.- On Byzantine Broadcast in Loosely Connected Networks.- RMR-Efficient Randomized Abortable Mutual Exclusion.- Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks.- Pessimistic Software Lock-Elision.- Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots.-How to Gather Asynchronous Oblivious Robots on Anonymous Rings.- Position Discovery for a System of Bouncing Robots.- Counting-Based Impossibility Proofs for Renaming and Set Agreement.- Randomized Distributed Decision.- The Strong At-Most-Once Problem.- Brief Announcement: Wait-Free Gathering of Mobile Robots.- Brief Announcement: Distributed Exclusive and Perpetual Tree Searching.- Brief Announcement: Reaching Approximate ByzantineConsensus in Partially-Connected Mobile Networks.- Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model.- Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model.- Brief Announcement: Deterministic Protocol for the Membership Problem in Beeping Channels.- Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers.- Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories.- Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence.- Brief Announcement: Node Sampling Using Centrifugal Random Walks.- Brief Announcement: Concurrent Wait-Free Red-Black Trees.- Brief Announcement: A Contention-Friendly, Non-blocking Skip List.- Brief Announcement: Consensus and Efficient Passive Replication.- Brief Announcement: Anonymity, Failures, Detectors and Consensus.- Brief Announcement: Do VNet Embeddings Leak Information about ISP Topology.- Brief Announcement: Efficient Private Distributed Computation onUnbounded Input Streams.- Brief Announcement: Fast Travellers: Infrastructure-Independent Deadlock Resolution in Resource-restricted Distributed Systems.- Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.- Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks.- Brief Announcement: SplayNets: Towards Self-Adjusting Distributed Data Structures.- Brief Announcement: Semantics of Eventually Consistent Replicated Sets.- Brief Announcement: Decoupled and Consensus-Free Reconfiguration for Fault-Tolerant Storage.- Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value Stores.- Brief Announcement: Weighted Partial Message Matching for Implicit Multicast Systems. Efficient Fetch-and-Increment.- Show No Weakness: Sequentially Consistent Specifications of TSO Libraries.- Collecting Information by Power-Aware Mobile Agents.- Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology.- AGeneralized Algorithm for Publish/Subscribe Overlay Design and Its Fast Implementation.- Bounded-Contention Coding for Wireless Networks in the High SNR Regime.- Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks.- Distributed Online and Stochastic Queuing on a Multiple Access Channel.- Fast Distributed Computation in Dynamic Networks via Random Walks.- Dense Subgraphs on Dynamic Networks.- Lower Bounds on Information Dissemination in Dynamic Networks.- No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover.- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting.- Distributed 2-Approximation Algorithm for the Semi-matching Problem.- Bounds on Contention Management in Radio Networks.- Efficient Symmetry Breaking in Multi-Channel Radio Networks.- On Byzantine Broadcast in Loosely Connected Networks.- RMR-Efficient Randomized Abortable Mutual Exclusion.- Abortable Reader-Writer Locks Are No More Complex ThanAbortable Mutex Locks.- Pessimistic Software Lock-Elision.- Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots.-How to Gather Asynchronous Oblivious Robots on Anonymous Rings.- Position Discovery for a System of Bouncing Robots.- Counting-Based Impossibility Proofs for Renaming and Set Agreement.- Randomized Distributed Decision.- The Strong At-Most-Once Problem.- Brief Announcement: Wait-Free Gathering of Mobile Robots.- Brief Announcement: Distributed Exclusive and Perpetual Tree Searching.- Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks.- Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model.- Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model.- Brief Announcement: Deterministic Protocol for the Membership Problem in Beeping Channels.- Brief Announcement: Probabilistic Stabilization under ProbabilisticSchedulers.- Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories.- Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence.- Brief Announcement: Node Sampling Using Centrifugal Random Walks.- Brief Announcement: Concurrent Wait-Free Red-Black Trees.- Brief Announcement: A Contention-Friendly, Non-blocking Skip List.- Brief Announcement: Consensus and Efficient Passive Replication.- Brief Announcement: Anonymity, Failures, Detectors and Consensus.- Brief Announcement: Do VNet Embeddings Leak Information about ISP Topology.- Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams.- Brief Announcement: Fast Travellers: Infrastructure-Independent Deadlock Resolution in Resource-restricted Distributed Systems.- Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.- Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks.- Brief Announcement: SplayNets: Towards Self-AdjustingDistributed Data Structures.- Brief Announcement: Semantics of Eventually Consistent Replicated Sets.- Brief Announcement: Decoupled and Consensus-Free Reconfiguration for Fault-Tolerant Storage.- Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value Stores.- Brief Announcement: Weighted Partial Message Matching for Implicit Multicast Systems.

Mer från samma författare

Del 8878

Principles of Distributed Systems

Marcos K. Aguilera, Leonardo Querzoni, Marc Shapiro

Häftad, 2014

555 kr

Principles of Distributed Systems

Marc Shapiro, Leonardo Querzoni, Marcos K. Aguilera

E-bok

2014

718 kr

Distributed Computing and Networking

Marcos K. Aguilera, Haifeng Yu, Nitin H. Vaidya, Vikram Srinivasan, Romit Roy Choudhury

Häftad, 2010

572 kr

Distributed Computing and Networking

Romit Roy Choudhury, Vikram Srinivasan, Nitin H. Vaidya, Haifeng Yu, Marcos K. Aguilera

E-bok

2011

739 kr

Distributed Computing

Marcos K. Aguilera

E-bok

2012

739 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

555 kr

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang - Knowledge Graphs, Häftad

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

933 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

572 kr

Del 16096

Energy Informatics

Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin

Häftad, 2025

842 kr

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott - Biomimetic and Biohybrid Systems, Häftad

Del 15582

Biomimetic and Biohybrid Systems

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott

Häftad, 2025

1 022 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

572 kr

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson - Advanced Parallel Processing Technologies, Häftad

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 024 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

933 kr

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek - Electronic Participation, Häftad

Nyhet

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

730 kr

Du kanske också är intresserad av

10% rabatt på allt

26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012, Proceedings

AvMarcos K. Aguilera

Häftad, Engelska, 2012

Del i serien Lecture Notes in Computer Science

572 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

572 kr

572 kr

572 kr

571 kr

572 kr

571 kr

571 kr

1 136 kr

572 kr

572 kr

Beskrivning

Produktinformation

Utgivningsdatum:2012-09-03
Mått:155 x 235 x 26 mm
Vikt:703 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:450
Upplaga:2012
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783642336508

Utforska kategorier

Innehållsförteckning

CBTree: A Practical Concurrent Self-Adjusting Search Tree.- Efficient Fetch-and-Increment.- Show No Weakness: Sequentially Consistent Specifications of TSO Libraries.- Collecting Information by Power-Aware Mobile Agents.- Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology.- A Generalized Algorithm for Publish/Subscribe Overlay Design and Its Fast Implementation.- Bounded-Contention Coding for Wireless Networks in the High SNR Regime.- Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks.- Distributed Online and Stochastic Queuing on a Multiple Access Channel.- Fast Distributed Computation in Dynamic Networks via Random Walks.- Dense Subgraphs on Dynamic Networks.- Lower Bounds on Information Dissemination in Dynamic Networks.- No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover.- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting.- Distributed 2-Approximation Algorithm for the Semi-matching Problem.- Bounds on Contention Management in Radio Networks.- Efficient Symmetry Breaking in Multi-Channel Radio Networks.- On Byzantine Broadcast in Loosely Connected Networks.- RMR-Efficient Randomized Abortable Mutual Exclusion.- Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks.- Pessimistic Software Lock-Elision.- Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots.-How to Gather Asynchronous Oblivious Robots on Anonymous Rings.- Position Discovery for a System of Bouncing Robots.- Counting-Based Impossibility Proofs for Renaming and Set Agreement.- Randomized Distributed Decision.- The Strong At-Most-Once Problem.- Brief Announcement: Wait-Free Gathering of Mobile Robots.- Brief Announcement: Distributed Exclusive and Perpetual Tree Searching.- Brief Announcement: Reaching Approximate ByzantineConsensus in Partially-Connected Mobile Networks.- Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model.- Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model.- Brief Announcement: Deterministic Protocol for the Membership Problem in Beeping Channels.- Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers.- Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories.- Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence.- Brief Announcement: Node Sampling Using Centrifugal Random Walks.- Brief Announcement: Concurrent Wait-Free Red-Black Trees.- Brief Announcement: A Contention-Friendly, Non-blocking Skip List.- Brief Announcement: Consensus and Efficient Passive Replication.- Brief Announcement: Anonymity, Failures, Detectors and Consensus.- Brief Announcement: Do VNet Embeddings Leak Information about ISP Topology.- Brief Announcement: Efficient Private Distributed Computation onUnbounded Input Streams.- Brief Announcement: Fast Travellers: Infrastructure-Independent Deadlock Resolution in Resource-restricted Distributed Systems.- Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.- Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks.- Brief Announcement: SplayNets: Towards Self-Adjusting Distributed Data Structures.- Brief Announcement: Semantics of Eventually Consistent Replicated Sets.- Brief Announcement: Decoupled and Consensus-Free Reconfiguration for Fault-Tolerant Storage.- Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value Stores.- Brief Announcement: Weighted Partial Message Matching for Implicit Multicast Systems. Efficient Fetch-and-Increment.- Show No Weakness: Sequentially Consistent Specifications of TSO Libraries.- Collecting Information by Power-Aware Mobile Agents.- Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology.- AGeneralized Algorithm for Publish/Subscribe Overlay Design and Its Fast Implementation.- Bounded-Contention Coding for Wireless Networks in the High SNR Regime.- Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks.- Distributed Online and Stochastic Queuing on a Multiple Access Channel.- Fast Distributed Computation in Dynamic Networks via Random Walks.- Dense Subgraphs on Dynamic Networks.- Lower Bounds on Information Dissemination in Dynamic Networks.- No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover.- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting.- Distributed 2-Approximation Algorithm for the Semi-matching Problem.- Bounds on Contention Management in Radio Networks.- Efficient Symmetry Breaking in Multi-Channel Radio Networks.- On Byzantine Broadcast in Loosely Connected Networks.- RMR-Efficient Randomized Abortable Mutual Exclusion.- Abortable Reader-Writer Locks Are No More Complex ThanAbortable Mutex Locks.- Pessimistic Software Lock-Elision.- Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots.-How to Gather Asynchronous Oblivious Robots on Anonymous Rings.- Position Discovery for a System of Bouncing Robots.- Counting-Based Impossibility Proofs for Renaming and Set Agreement.- Randomized Distributed Decision.- The Strong At-Most-Once Problem.- Brief Announcement: Wait-Free Gathering of Mobile Robots.- Brief Announcement: Distributed Exclusive and Perpetual Tree Searching.- Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks.- Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model.- Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model.- Brief Announcement: Deterministic Protocol for the Membership Problem in Beeping Channels.- Brief Announcement: Probabilistic Stabilization under ProbabilisticSchedulers.- Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories.- Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence.- Brief Announcement: Node Sampling Using Centrifugal Random Walks.- Brief Announcement: Concurrent Wait-Free Red-Black Trees.- Brief Announcement: A Contention-Friendly, Non-blocking Skip List.- Brief Announcement: Consensus and Efficient Passive Replication.- Brief Announcement: Anonymity, Failures, Detectors and Consensus.- Brief Announcement: Do VNet Embeddings Leak Information about ISP Topology.- Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams.- Brief Announcement: Fast Travellers: Infrastructure-Independent Deadlock Resolution in Resource-restricted Distributed Systems.- Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.- Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks.- Brief Announcement: SplayNets: Towards Self-AdjustingDistributed Data Structures.- Brief Announcement: Semantics of Eventually Consistent Replicated Sets.- Brief Announcement: Decoupled and Consensus-Free Reconfiguration for Fault-Tolerant Storage.- Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value Stores.- Brief Announcement: Weighted Partial Message Matching for Implicit Multicast Systems.

Mer från samma författare

Del 8878

Principles of Distributed Systems

Marcos K. Aguilera, Leonardo Querzoni, Marc Shapiro

Häftad, 2014

555 kr

Principles of Distributed Systems

Marc Shapiro, Leonardo Querzoni, Marcos K. Aguilera

E-bok

2014

718 kr

Distributed Computing and Networking

Marcos K. Aguilera, Haifeng Yu, Nitin H. Vaidya, Vikram Srinivasan, Romit Roy Choudhury

Häftad, 2010

572 kr

Distributed Computing and Networking

Romit Roy Choudhury, Vikram Srinivasan, Nitin H. Vaidya, Haifeng Yu, Marcos K. Aguilera

E-bok

2011

739 kr

Distributed Computing

Marcos K. Aguilera

E-bok

2012

739 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

555 kr

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

933 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

572 kr

Del 16096

Energy Informatics

Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin

Häftad, 2025

842 kr

Del 15582

Biomimetic and Biohybrid Systems

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott

Häftad, 2025

1 022 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

572 kr

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 024 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

933 kr

Nyhet

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

730 kr

Du kanske också är intresserad av

10% rabatt på allt

Cyril Gavoille, David Ilcinkas

Häftad, 2016

572 kr