Distributed Computing
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Distributed Computing: 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013, Proceedings(Theoretical Computer Science and General Issues)
Distributed Computing: 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013, Proceedings(Theoretical Computer Science and General Issues)

Distributed Computing: 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013, Proceedings(Theoretical Computer Science and General Issues)


     0     
5
4
3
2
1



Available


X
About the Book

This book constitutes the proceedings of the 27th International Symposium on Distributed Computing, DISC 2013, held in Jerusalem, Israel, in October 2013. The 27 full papers presented in this volume were carefully reviewed and selected from 142 submissions; 16 brief announcements are also included. The papers are organized in topical sections named: graph distributed algorithms; topology, leader election, and spanning trees; software transactional memory; shared memory executions; shared memory and storage; gossip and rumor; shared memory tasks and data structures; routing; radio networks and the SINR model; crypto, trust, and influence; and networking.

Table of Contents:
Distributed Minimum Cut Approximation.- When Distributed Computation Is Communication Expensive.- An O(√n) Space Bound for Obstruction-Free Leader Election.- Distributed Protocols for Leader Election: A Game-Theoretic Perspective.- Compact Deterministic Self-stabilizing Leader Election: The Exponential Advantage of Being Talkative.- Time Optimal Synchronous Self Stabilizing Spanning Tree.- Proving Non-opacity.- Exploiting Locality in Lease-Based Replicated Transactional Memory via Task Migration.- Generic Multiversion STM.- Practical Parallel Nesting for Software Transactional Memory.- Asynchronous Resilient Linearizability.- Fair Synchronization.- Gossip Protocols for Renaming and Sorting.- Faster Rumor Spreading: Breaking the log n Barrier.- Lock-Free Data-Structure Iterators.- Practical Non-blocking Unordered Lists.- Atomic Snapshots in O(log3 n) Steps Using Randomized Helping.- Adaptive Register Allocation with a Linear Number of Registers.- An Optimal Implementation of Fetch-and-Increment.- On Barriers and the Gap between Active and Passive Replication.- Conflict Resolution and Membership Problem in Beeping Channels.- Frequency Hopping against a Powerful Adversary.- Sleeping Experts in Wireless Networks.- Broadcast in the Ad Hoc SINR Model.- Distributed Randomized Broadcasting in Wireless Networks under the SINR Model.- Asynchronous Multiparty Computation with Linear Communication Complexity.- Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary.- On the Communication Complexity of Distributed Name-Independent Routing Schemes.- Convergence in (Social) Influence Networks.- Trustful Population Protocols.- Prudent Opportunistic Cognitive Radio Access Protocols.- Braess’s Paradox in Wireless Networks: The Danger of Improved Technology.- Fast Structuring of Radio Networks Large for Multi-message Communications.- In-Network Analytics for Ubiquitous Sensing.- A Super-Fast Distributed Algorithm for BipartiteMetric Facility Location.- CONE-DHT: A Distributed Self-stabilizing Algorithm for a Heterogeneous Storage System.- Brief Announcement: Distributed MST in Core-Periphery Networks.- Brief Announcement: Enhancing Permissiveness in Transactional Memory via Time-Warping.- Brief Announcement: ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List.- Brief Anouncement: The Topology of Asynchronous Byzantine Colorless Tasks.- Brief Announcement: Revisiting Dynamic Distributed Systems.- Brief Announcement: Computing in the Presence of Concurrent Solo Executions.- Brief Announcement: A Concurrent Lock-Free Red-Black Tree.- Brief Announcement: A General Technique for Non-blocking Trees.- Brief Announcement: Communication-Efficient Byzantine Consensus without a Common Clock.- Brief Announcement: Consistency and Complexity Tradeoffs for Highly-Available Multi-cloud Store.- Brief Announcement: BFT Storage with 2t + 1 Data Replicas.- Brief Announcement: Private Channel Models in Multi-party Communication Complexity.- Vinod Vaikuntanathan Brief Announcement: Certified Impossibility Results for Byzantine-Tolerant Mobile Robots.- Brief Announcement: Distributed Compressed Sensing for Sensor Networks.- Brief Announcement: Towards Distributed and Reliable Software Defined Networking .- Brief Announcement: Dynamic Forwarding Table Aggregation without Update Churn: The Case of Dependent Prefixes.


Best Sellers


Product Details
  • ISBN-13: 9783642415265
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 586
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Width: 155 mm
  • ISBN-10: 3642415261
  • Publisher Date: 07 Oct 2013
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Sub Title: 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Distributed Computing: 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013, Proceedings(Theoretical Computer Science and General Issues)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Distributed Computing: 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013, Proceedings(Theoretical Computer Science and General Issues)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Distributed Computing: 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013, Proceedings(Theoretical Computer Science and General Issues)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!