|
|
Conferences in DBLP
- James H. Anderson
Lamport on mutual exclusion: 27 years of planting seeds. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:3-12 [Conf]
- Butler W. Lampson
The ABCD's of Paxos. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:13- [Conf]
- Amir Pnueli
Sticks and stones: a coding scheme for parameterized verification. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:14- [Conf]
- Martín Abadi
Leslie Lamport's properties and actions. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:15- [Conf]
- Nancy A. Lynch
Implementing atomic objects in a dynamic environment. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:16- [Conf]
- Chris Rowley
The LATEX legacy: 2.09 and all that. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:17-25 [Conf]
- Maurice Herlihy
On beyond registers: wait-free readable objects. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:26-42 [Conf]
- Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt
Restoration by path concatenation: fast recovery of MPLS paths. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:43-52 [Conf]
- Michael Elkin
Computing almost shortest paths. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:53-62 [Conf]
- Zvi Lotker, Boaz Patt-Shamir, David Peleg
Distributed MST for constant diameter graphs. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:63-71 [Conf]
- Vijay K. Garg, Chakarat Skawratananond
String realizers of posets with applications to distributed computing. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:72-80 [Conf]
- Oltea Mihaela Herescu, Catuscia Palamidessi
On the generalized dining philosophers problem. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:81-89 [Conf]
- James H. Anderson, Yong-Jik Kim
An improved lower bound for the time complexity of mutual exclusion. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:90-99 [Conf]
- Vassos Hadzilacos
A note on group mutual exclusion. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:100-106 [Conf]
- Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir
Nearly optimal perfectly-periodic schedules. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:107-116 [Conf]
- Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas
The do-all problem in broadcast networks. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:117-127 [Conf]
- Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer
Competitive concurrent distributed queuing. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:127-133 [Conf]
- Arun Venkataramani, Phoebe Weidmann, Michael Dahlin
Bandwidth constrained placement in a WAN. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:134-143 [Conf]
- Michael Mitzenmacher
Compressed bloom filters. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:144-150 [Conf]
- Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy
A hierarchy of conditions for consensus solvability. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:151-160 [Conf]
- Eli Gafni, Michael Merritt, Gadi Taubenfeld
The concurrency hierarchy, and algorithms for unbounded concurrency. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:161-169 [Conf]
- Indranil Gupta, Tushar Deepak Chandra, Germán S. Goldszmidt
On scalable and efficient distributed failure detectors. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:170-179 [Conf]
- Yehuda Hassin, David Peleg
Average probe complexity in quorum systems. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:180-189 [Conf]
- David Detlefs, Paul A. Martin, Mark Moir, Guy L. Steele Jr.
Lock-free reference counting. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:190-199 [Conf]
- Fabrice Le Fessant
Detecting distributed cycles of garbage in large-scale systems. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:200-209 [Conf]
- Anne-Marie Kermarrec, Antony I. T. Rowstron, Marc Shapiro, Peter Druschel
The IceCube approach to the reconciliation of divergent replicas. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:210-218 [Conf]
- Yuanyuan Zhao, Robert E. Strom
Exploitng event stream interpretation in publish-subscribe systems. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:219-228 [Conf]
- Yongqiang Huang, Hector Garcia-Molina
Replicated condition monitoring. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:229-237 [Conf]
- Simon St. James, Ulrich Ultes-Nitsche
Computing property-preserving behaviour abstractions from trace reductions: abstraction-based verification of linear-time properties under fairness. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:238-245 [Conf]
- Sung Hoon Baek, Bong Wan Kim, Eui Joung Joung, Chong-Won Park
Reliability and performance of hierarchical RAID with multiple controllers. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:246-254 [Conf]
- Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Distributed multi-broadcast in unknown radio networks. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:255-264 [Conf]
- Erran L. Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:264-273 [Conf]
- Olivier Baudron, Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Guillaume Poupard
Practical multi-candidate election system. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:274-283 [Conf]
- Markus Jakobsson, Ari Juels
An optimally robust hybrid mix network. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:284-292 [Conf]
- Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright
Selective private function evaluation with applications to private statistics. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:293-304 [Conf]
- Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
Optimal scheduling for disconnected cooperation. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:305-307 [Conf]
- Panagiota Fatourou, Maurice Herlihy
Adding networks. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:308-310 [Conf]
- Hyunyoung Lee, Jennifer L. Welch
Randomized shared queues. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:311-313 [Conf]
- Paul C. Attie, Nancy A. Lynch
Dynamic input/output automata, a formal model for dynamic systems. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:314-316 [Conf]
- Evelyn Tumlin Pierce, Lorenzo Alvisi
A framework for semantic reasoning about Byzantine quorum systems. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:317-319 [Conf]
- Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis
An efficient communication strategy for ad-hoc mobile networks. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:320-322 [Conf]
- Mark Moir
Correction: practical implementations of non-blocking synchronization primitives. [Citation Graph (0, 0)][DBLP]
PODC, 2001, pp:323- [Conf]
|
