Conferences in DBLP

ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC) (podc)
2010 (conf/podc/2010)

1. 
   The inherent complexity of transactional memory and what to do about it. [Citation Graph (, )][DBLP]
   
   
2. 
   Transactional predication: high-performance concurrent sets and maps for STM. [Citation Graph (, )][DBLP]
   
   
3. 
   On maintaining multiple versions in STM. [Citation Graph (, )][DBLP]
   
   
4. 
   The multiplicative power of consensus numbers. [Citation Graph (, )][DBLP]
   
   
5. 
   The k-bakery: local-spin k-exclusion using non-atomic reads and writes. [Citation Graph (, )][DBLP]
   
   
6. 
   Group mutual exclusion in O(log n) RMR. [Citation Graph (, )][DBLP]
   
   
7. 
   On asymmetric progress conditions. [Citation Graph (, )][DBLP]
   
   
8. 
   Brief announcement: view transactions: transactional model with relaxed consistency checks. [Citation Graph (, )][DBLP]
   
   
9. 
   Brief announcement: single-version permissive STM. [Citation Graph (, )][DBLP]
   
   
10. 
    Brief announcement: NUMA-aware transactional memory. [Citation Graph (, )][DBLP]
    
    
11. 
    Brief announcement: actions in the twilight - concurrent irrevocable transactions and inconsistency repair. [Citation Graph (, )][DBLP]
    
    
12. 
    Brief announcement: on enhancing concurrency in distributed transactional memory. [Citation Graph (, )][DBLP]
    
    
13. 
    Brief announcement: queuing or priority queuing? on the design of cache-coherence protocols for distributed transactional memory. [Citation Graph (, )][DBLP]
    
    
14. 
    Brief announcement: k-shot distributed broadcasting in radio networks. [Citation Graph (, )][DBLP]
    
    
15. 
    Brief announcement: a shared disk on distributed storage. [Citation Graph (, )][DBLP]
    
    
16. 
    Brief announcement: on L-resilience, hitting sets, and colorless tasks. [Citation Graph (, )][DBLP]
    
    
17. 
    Brief announcement: an efficient failure detector for omission environments. [Citation Graph (, )][DBLP]
    
    
18. 
    Verifying linearizability with hindsight. [Citation Graph (, )][DBLP]
    
    
19. 
    Eventually linearizable shared objects. [Citation Graph (, )][DBLP]
    
    
20. 
    The topology of shared-memory adversaries. [Citation Graph (, )][DBLP]
    
    
21. 
    Brief announcement: towards robust medium access in multi-hop networks. [Citation Graph (, )][DBLP]
    
    
22. 
    Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio. [Citation Graph (, )][DBLP]
    
    
23. 
    Brief announcement: ART--sub-logarithmic decentralized range query processing with probabilistic guarantees. [Citation Graph (, )][DBLP]
    
    
24. 
    Brief announcement: pan and scan. [Citation Graph (, )][DBLP]
    
    
25. 
    Brief announcement: complexity and solution of the send-receive correlation problem. [Citation Graph (, )][DBLP]
    
    
26. 
    Brief announcement: distributed contention resolution in wireless networks. [Citation Graph (, )][DBLP]
    
    
27. 
    Brief announcement: sources of instability in data center multicast. [Citation Graph (, )][DBLP]
    
    
28. 
    Brief announcement: superpeer formation amidst churn and rewiring. [Citation Graph (, )][DBLP]
    
    
29. 
    Brief announcement: self-monitoring in dynamic wireless networks. [Citation Graph (, )][DBLP]
    
    
30. 
    Non-blocking binary search trees. [Citation Graph (, )][DBLP]
    
    
31. 
    Adaptive randomized mutual exclusion in sub-logarithmic expected time. [Citation Graph (, )][DBLP]
    
    
32. 
    Distributed data classification in sensor networks. [Citation Graph (, )][DBLP]
    
    
33. 
    Partial information spreading with application to distributed maximum coverage. [Citation Graph (, )][DBLP]
    
    
34. 
    Distributed computational complexities: are you volvo-addicted or nascar-obsessed? [Citation Graph (, )][DBLP]
    
    
35. 
    Adaptive system anomaly prediction for large-scale hosting infrastructures. [Citation Graph (, )][DBLP]
    
    
36. 
    Efficient threshold detection in a distributed environment: extended abstract. [Citation Graph (, )][DBLP]
    
    
37. 
    Forbidden-set distance labels for graphs of bounded doubling dimension. [Citation Graph (, )][DBLP]
    
    
38. 
    Efficient distributed random walks with applications. [Citation Graph (, )][DBLP]
    
    
39. 
    On the theoretical gap between synchronous and asynchronous MPC protocols. [Citation Graph (, )][DBLP]
    
    
40. 
    Hybrid-secure MPC: trading information-theoretic robustness for computational privacy. [Citation Graph (, )][DBLP]
    
    
41. 
    Brief announcement: the price of anarchy for distributed network formation in an adversary model. [Citation Graph (, )][DBLP]
    
    
42. 
    Brief announcement: swarming secrets. [Citation Graph (, )][DBLP]
    
    
43. 
    Brief announcement: distributed trust management and revocation. [Citation Graph (, )][DBLP]
    
    
44. 
    Brief announcement: realizing secure multiparty computation on incomplete networks. [Citation Graph (, )][DBLP]
    
    
45. 
    Brief announcement: anonymity and trust in distributed systems. [Citation Graph (, )][DBLP]
    
    
46. 
    Brief announcement: secret sharing based on the social behaviors of players. [Citation Graph (, )][DBLP]
    
    
47. 
    Brief announcement: improving social-network-based sybil-resilient node admission control. [Citation Graph (, )][DBLP]
    
    
48. 
    Brief announcement: communication efficient asynchronous byzantine agreement. [Citation Graph (, )][DBLP]
    
    
49. 
    Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. [Citation Graph (, )][DBLP]
    
    
50. 
    Meeting the deadline: on the complexity of fault-tolerant continuous gossip. [Citation Graph (, )][DBLP]
    
    
51. 
    A new technique for distributed symmetry breaking. [Citation Graph (, )][DBLP]
    
    
52. 
    On the computational power of oblivious robots: forming a series of geometric patterns. [Citation Graph (, )][DBLP]
    
    
53. 
    Brief announcement: on the quest of optimal service ordering in decentralized queries. [Citation Graph (, )][DBLP]
    
    
54. 
    Brief announcement: network traffic can optimize consolidation during transformation to virtualization. [Citation Graph (, )][DBLP]
    
    
55. 
    Brief announcement: distributed almost stable marriage. [Citation Graph (, )][DBLP]
    
    
56. 
    Brief announcement: decentralized construction of multicast trees embedded into P2P overlay networks based on virtual geometric coordinates. [Citation Graph (, )][DBLP]
    
    
57. 
    Brief announcement: deterministic dominating set construction in networks with bounded degree. [Citation Graph (, )][DBLP]
    
    
58. 
    Brief announcement: tree decomposition for faster concurrent data structures. [Citation Graph (, )][DBLP]
    
    
59. 
    Brief announcement: efficient graph algorithms without synchronization. [Citation Graph (, )][DBLP]
    
    
60. 
    Brief announcement: the accuracy of tree-based counting in dynamic networks. [Citation Graph (, )][DBLP]
    
    
61. 
    Brief announcement: adaptive content placement for peer-to-peer video-on-demand systems. [Citation Graph (, )][DBLP]
    
    
62. 
    Brief announcement: exponential speed-up of local algorithms using non-local communication. [Citation Graph (, )][DBLP]
    
    
63. 
    Finding mobile data under delay constraints with searching costs. [Citation Graph (, )][DBLP]
    
    
64. 
    On utilizing speed in networks of mobile agents. [Citation Graph (, )][DBLP]
    
    
65. 
    Expansion and the cover time of parallel random walks. [Citation Graph (, )][DBLP]
    
    
66. 
    Rapid randomized pruning for fast greedy distributed algorithms. [Citation Graph (, )][DBLP]
    
    
67. 
    A certain freedom: thoughts on the CAP theorem. [Citation Graph (, )][DBLP]
    
    
68. 
    Broadcasting in unreliable radio networks. [Citation Graph (, )][DBLP]
    
    
69. 
    Discrete load balancing is (almost) as easy as continuous load balancing. [Citation Graph (, )][DBLP]
    
    
70. 
    Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? [Citation Graph (, )][DBLP]
    
    
71. 
    Distributed algorithms for edge dominating sets. [Citation Graph (, )][DBLP]
    
    
72. 
    Fast flooding over Manhattan. [Citation Graph (, )][DBLP]
    
    
73. 
    Bayesian ignorance. [Citation Graph (, )][DBLP]
    
    
74. 
    Brief announcement: asynchronous bounded expected delay networks. [Citation Graph (, )][DBLP]
    
    
75. 
    Brief announcement: locally-accessible implementations for distributed shared memory multiprocessors. [Citation Graph (, )][DBLP]
    
    
76. 
    Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks. [Citation Graph (, )][DBLP]
    
    
77. 
    Brief announcement: a framework for building self-stabilizing overlay networks. [Citation Graph (, )][DBLP]
    
    
78. 
    Brief announcement: revisiting the power-law degree distribution for social graph analysis. [Citation Graph (, )][DBLP]
    
    
79. 
    Brief announcement: collusion free protocol for rational secret sharing. [Citation Graph (, )][DBLP]
    
    
80. 
    Brief announcement: leader election vs pattern formation. [Citation Graph (, )][DBLP]
    
    
81. 
    Brief announcement: monotonic stabilization. [Citation Graph (, )][DBLP]
    
    
82. 
    Brief announcement: modelling MapReduce for optimal execution in the cloud. [Citation Graph (, )][DBLP]
    
    
83. 
    Deterministic distributed vertex coloring in polylogarithmic time. [Citation Graph (, )][DBLP]
    
    
84. 
    Breaking the O(n²) bit barrier: scalable byzantine agreement with an adaptive adversary. [Citation Graph (, )][DBLP]
    
    
85. 
    Optimal gradient clock synchronization in dynamic networks. [Citation Graph (, )][DBLP]
    
    
86. 
    Online set packing and competitive scheduling of multi-part tasks. [Citation Graph (, )][DBLP]
    
    
87. 
    How to meet when you forget: log-space rendezvous in arbitrary graphs. [Citation Graph (, )][DBLP]
    
    
88. 
    A modular approach to shared-memory consensus, with applications to the probabilistic-write model. [Citation Graph (, )][DBLP]
    
    
89. 
    Constant RMR solutions to reader writer synchronization. [Citation Graph (, )][DBLP]