%0 Conference Paper %1 Arge:2005 %A Arge, Lars %A Eppstein, David %A Goodrich, Michael T. %B PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing %C New York, NY, USA %D 2005 %I ACM %K SkipGraph algorithms %P 69--76 %R http://doi.acm.org/10.1145/1073814.1073827 %T Skip-webs: efficient distributed data structures for multi-dimensional data sets %@ 1-59593-994-2

@inproceedings{Arge:2005, added-at = {2009-08-03T04:15:32.000+0200}, address = {New York, NY, USA}, author = {Arge, Lars and Eppstein, David and Goodrich, Michael T.}, biburl = {https://www.bibsonomy.org/bibtex/29f3a3176beb45de74cca4181f5b7b71a/alessandro}, booktitle = {PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing}, doi = {http://doi.acm.org/10.1145/1073814.1073827}, interhash = {d5883c4164024680de85ec16d7d35319}, intrahash = {9f3a3176beb45de74cca4181f5b7b71a}, isbn = {1-59593-994-2}, keywords = {SkipGraph algorithms}, location = {Las Vegas, NV, USA}, pages = {69--76}, publisher = {ACM}, timestamp = {2009-08-03T04:15:32.000+0200}, title = {Skip-webs: efficient distributed data structures for multi-dimensional data sets}, year = 2005 }