|
|
|
2007
|
Best Student Paper
Dana Angluin , James Aspnes and David Eisenstat "A Simple Population Protocol for Fast Robust Approximate Majority"
|
2006
|
Best Student Paper
Maleq Khan and Gopal Pandurangan "A Fast Distributed Approximation Algorithm for Minimum Spanning Trees"
|
Special Issue of Distributed Computing
Maleq Khan and Gopal Pandurangan :
"A Fast Distributed Approximation Algorithm for Minimum Spanning Trees"
Piotr Zielinski :
"Low-latency Atomic Broadcast in the presence of contention"
Michael Okun , Amnon Barak and Eli Gafni :
"Renaming in Message Passing Systems with Byzantine Failures"
Rachid Guerraoui , Michal Kapalka and Petr Kouznetsov :
"The Weakest Failure Detectors to Boost Obstruction-Freedom"
|
2005
|
Best Student Paper
Korman, A. "General Compact Labeling Schemes for Dynamic Trees"
|
Special Issue of Distributed Computing
Rachid Guerraoui and Eric Ruppert :
"Anonymous and fault-tolerant shared-memory computing"
Amos Korman :
"General compact labeling schemes for dynamic trees"
Maurice Herlihy and Ye Sun :
"Distributed transactional memory for metric-space networks"
Dahlia Malkhi and Doug Terry :
"Concise version vectors in WinFS"
Yehuda Afek and Yaron De Levie :
"Efficient adaptive collect algorithms"
|
2004
|
Best Student Paper
Hagit Attiya , Fabian Kuhn , Mirjam Wattenhofer and Roger Wattenhofer "Efficient Adaptive Collect using Randomization"
Laurent Fribourg , Stephane Messika and Claudine Picaronny "Coupling and Self-Stabilization"
|
Special Issue of Distributed Computing
Harry Buhrman , Alessandro Panconesi , Riccardo Silvestri and Paul Vitanyi :
"On the importance of having an identity or, is consensus really universal?"
Hagit Attiya , Fabian Kuhn , C. Greg Plaxton , Mirjam Wattenhofer and Roger Wattenhofer :
"Efficient adaptive collect using randomization"
Danny Hendler , Yossi Lev , Mark Moir and Nir Shavit :
"A dynamic-sized nonblocking work stealing deque"
James Aspnes , Faith Ellen Fich and Eric Ruppert :
"Relationships between broadcast and shared memory in reliable anonymous distributed systems"
Laurent Fribourg , Stéphane Messika and laudine Picaronny :
"Coupling and self-stabilization"
|
2003
|
Best Student Paper
Ittai Abraham and Dahlia Malkhi " Probabilistic Quorums for Dynamic Systems"
|
Special Issue of Distributed Computing
Noga Alon , Michael Merritt , Omer Reingold , Gadi Taubenfeld and Rebecca N. Wright :
"Tight bounds for shared memory systems accessed by Byzantine processes"
Ittai Abraham and Dahlia Malkhi :
"Probabilistic quorums for dynamic systems"
Shlomi Dolev , Seth Gilbert , Nancy A. Lynch , Alexander A. Shvartsman and Jennifer L. Welch :
"GeoQuorums: implementing atomic memory in mobile ad hoc networks"
M. Herlihy and L. D. Penso :
"Tight bounds for k-set agreement with limited-scope failure detectors"
|
2002
|
Best Student Paper
Yongqiang Huang and Hector Garcia-Molina "Assignment-based Partitioning in a Condition Monitoring System"
|
2001
|
Best Student Paper
Yong-Jik Kim and James H. Anderson "A Time Complexity Bound for Adaptive Mutual Exclusion"
|
2000
|
Best Student Paper
Hagit Attiya and Arie Fouren "Polynominal and Adaptive Long-Lived (2-1)-Renaming"
|
1999
|
Best Student Paper
Marcos Kawazoe Aguilera , Sam Toueg and Borislav Deianov "Revising the Weakest Failure Detector for Uniform Reliable Broadcast"
|
1998
|
Best Student Paper
Michael J. Demmer and Maurice Herlihy "The Arrow Distributed Directory Protocol"
|