PODC 2010 - PDF Preprint Papers

PODC 2010 Annual ACM Symposium on Principles of Distributed Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PODC-2010 Paper

click to vote

PODC
2010
ACM

216views Distributed and Parallel Com...» more PODC 2010»

Brief announcement: tree decomposition for faster concurrent data structures

13 years 8 months ago

Download dcg.ethz.ch

We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for eﬃcient complex operations, which lie beyond inserts, deletes ...

Johannes Schneider, Roger Wattenhofer

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	216	Brief announcement: tree decomposition for faster concurrent data structures	claim
2	193	Distributed algorithms for edge dominating sets	claim
3	184	Transactional predication: high-performance concurrent sets and maps for STM	claim
4	184	Brief announcement: view transactions: transactional model with relaxed consistency checks	claim
5	174	Constant RMR solutions to reader writer synchronization	claim
6	174	On asymmetric progress conditions	claim
7	174	Brief announcement: on the quest of optimal service ordering in decentralized queries	claim
8	171	On the computational power of oblivious robots: forming a series of geometric patterns	claim
9	168	Brief announcement: complexity and solution of the send-receive correlation problem	claim
10	167	Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks	claim
11	166	Adaptive system anomaly prediction for large-scale hosting infrastructures	claim
12	165	Group mutual exclusion in O(log n) RMR	claim
13	165	Adaptive randomized mutual exclusion in sub-logarithmic expected time	claim
14	162	Brief announcement: revisiting the power-law degree distribution for social graph analysis	claim
15	160	Brief announcement: improving social-network-based sybil-resilient node admission control	claim
16	158	Brief announcement: a shared disk on distributed storage	claim
17	158	Distributed data classification in sensor networks	claim
18	157	Broadcasting in unreliable radio networks	claim
19	156	A new technique for distributed symmetry breaking	claim
20	155	Brief announcement: on enhancing concurrency in distributed transactional memory	claim
21	155	Brief announcement: swarming secrets	claim
22	154	The multiplicative power of consensus numbers	claim
23	153	Brief announcement: realizing secure multiparty computation on incomplete networks	claim
24	153	Bayesian ignorance	claim
25	150	Meeting the deadline: on the complexity of fault-tolerant continuous gossip	claim
26	149	Partial information spreading with application to distributed maximum coverage	claim
27	149	Brief announcement: efficient graph algorithms without synchronization	claim
28	146	The k-bakery: local-spin k-exclusion using non-atomic reads and writes	claim
29	144	Finding mobile data under delay constraints with searching costs	claim
30	143	Brief announcement: anonymity and trust in distributed systems	claim
31	143	Brief announcement: towards robust medium access in multi-hop networks	claim
32	143	Brief announcement: adaptive content placement for peer-to-peer video-on-demand systems	claim
33	142	Deterministic distributed vertex coloring in polylogarithmic time	claim
34	140	Hybrid-secure MPC: trading information-theoretic robustness for computational privacy	claim
35	136	Optimal gradient clock synchronization in dynamic networks	claim
36	134	Brief announcement: asynchronous bounded expected delay networks	claim
37	133	Eventually linearizable shared objects	claim
38	133	Brief announcement: superpeer formation amidst churn and rewiring	claim
39	131	Brief announcement: exponential speed-up of local algorithms using non-local communication	claim
40	128	Brief announcement: single-version permissive STM	claim
41	127	On the theoretical gap between synchronous and asynchronous MPC protocols	claim
42	126	A modular approach to shared-memory consensus, with applications to the probabilistic-write model	claim
43	125	Brief announcement: distributed contention resolution in wireless networks	claim
44	121	Non-blocking binary search trees	claim
45	117	On utilizing speed in networks of mobile agents	claim
46	110	On maintaining multiple versions in STM	claim
47	108	Verifying linearizability with hindsight	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers