Distributed Computing (Record no. 92689)

000 -LEADER
fixed length control field 10418nam a22006135i 4500
001 - CONTROL NUMBER
control field 978-3-642-33651-5
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730185203.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 121026s2012 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642336515
-- 978-3-642-33651-5
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-33651-5
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number TK5105.5-5105.9
072 #7 - SUBJECT CATEGORY CODE
Subject category code UKN
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM043000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UKN
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.6
Edition number 23
245 10 - TITLE STATEMENT
Title Distributed Computing
Medium [electronic resource] :
Remainder of title 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012, Proceedings /
Statement of responsibility, etc. edited by Marcos K. Aguilera.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2012.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2012.
300 ## - PHYSICAL DESCRIPTION
Extent XVI, 450 p. 49 illus.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 7611
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc. 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer networks .
9 (RLIN) 31572
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Software engineering.
9 (RLIN) 4138
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Application software.
9 (RLIN) 138247
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer programming.
9 (RLIN) 4169
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Artificial intelligence.
9 (RLIN) 3407
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Communication Networks.
9 (RLIN) 138248
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Software Engineering.
9 (RLIN) 4138
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer and Information Systems Applications.
9 (RLIN) 138249
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Programming Techniques.
9 (RLIN) 138250
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Artificial Intelligence.
9 (RLIN) 3407
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Aguilera, Marcos K.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 138251
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 138252
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642336508
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642336522
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 7611
9 (RLIN) 138253
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-642-33651-5">https://doi.org/10.1007/978-3-642-33651-5</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-Lecture Notes in CS

No items available.