A Declustering Scheme With Guaranteed Worst-Case Additive Error O(k/frac{1}{{d - 1}})

Fouad B. Chedid. A Declustering Scheme With Guaranteed Worst-Case Additive Error O(k/frac{1}{{d - 1}}). In 11th International Conference on Parallel and Distributed Systems (ICPADS 2005), 20-22 July 2005, Fuduoka, Japan, 2 Volumes. pages 625-628, IEEE Computer Society, 2005. [doi]

@inproceedings{Chedid05,
  title = {A Declustering Scheme With Guaranteed Worst-Case Additive Error O(k/frac{1}{{d - 1}})},
  author = {Fouad B. Chedid},
  year = {2005},
  doi = {10.1109/ICPADS.2005.16},
  url = {http://dx.doi.org/10.1109/ICPADS.2005.16},
  researchr = {https://researchr.org/publication/Chedid05},
  cites = {0},
  citedby = {0},
  pages = {625-628},
  booktitle = {11th International Conference on Parallel and Distributed Systems (ICPADS 2005), 20-22 July 2005, Fuduoka, Japan, 2 Volumes},
  publisher = {IEEE Computer Society},
}