Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal-stretch name-independent compact routing in doubling metrics. Invited for publication in special issue of ACM Transactions on Algorithms dedicated to best papers of SODA 2007; combination of papers from PODC 2006 and SODA 2007; submitted, 2007. [ bib | .pdf ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia. Dynamic routing and location services in metrics of low doubling dimension. In Proceedings of the 22nd DISC, volume 5218 of Lecture Notes in Computer Science, pages 379-393, 2008. [ bib | .pdf ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia. Dynamic routing and location services in metrics of low doubling dimension. In Proceedings of the 27th PODC, page 417, 2008. Brief announcement. [ bib ]

Goran Konjevod, Andrea Richa, Donglin Xia, and Hai Yu. Compact routing with slack in low doubling dimension. In Proceedings of the 26th PODC, pages 71-80, 2007. [ bib | DOI | .pdf ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal scale-free compact routing schemes in networks of low doubling dimension. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 939-948, 2007. [ bib | .ps.gz ]

Rida A. Bazzi and Goran Konjevod. On the establishment of distinct identities in overlay networks. Distributed Computing, 19(4):267-287, 2007. Special issue with best papers of PODC 2005. [ bib | .pdf ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal-stretch name-independent compact routing in doubling metrics. In Proceedings of the 25th PODC, pages 198-207, 2006. [ bib | .ps.gz ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia. On sampling in higher-dimensional peer-to-peer systems. In Proceedings of the 9th LATIN, volume 3887 of Lecture Notes in Computer Science, pages 641-652, 2006. [ bib | .pdf ]

Rida A. Bazzi and Goran Konjevod. On the establishment of distinct identities in overlay networks. In Proceedings of the 24th PODC, pages 312-320, 2005. [ bib | .ps.gz ]

Rida A. Bazzi and Goran Konjevod. Efficient verification for provably secure storage and secret sharing in systems where half the servers are faulty. In Proceedings of the 18th DISC, volume 3274 of Lecture Notes in Computer Science, pages 420-434, 2004. [ bib | .pdf ]

Rida A. Bazzi and Goran Konjevod. Erratum: Efficient verification for provably secure storage and secret sharing in systems where half the servers are faulty. 2004. [ bib | .pdf ]


This file was generated by bibtex2html 1.91.