Sciweavers

SODA
2012
ACM
177views Algorithms» more  SODA 2012»
12 years 3 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
MST
2006
97views more  MST 2006»
14 years 16 days ago
Optimal Implicit Dictionaries over Unbounded Universes
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
Gianni Franceschini, Roberto Grossi
JAL
2006
100views more  JAL 2006»
14 years 17 days ago
Distance and routing labeling schemes for non-positively curved plane graphs
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
FOCS
2005
IEEE
14 years 6 months ago
Towards a Final Analysis of Pairing Heaps
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
Seth Pettie