Optimal deterministic routing and sorting on the congested clique

@inproceedings{Lenzen2013OptimalDR,
  title={Optimal deterministic routing and sorting on the congested clique},
  author={Christoph Lenzen},
  booktitle={PODC},
  year={2013}
}
Consider a clique of <i>n</i> nodes, where in each synchronous round each pair of nodes can exchange <i>O(log n)</i> bits. We provide deterministic constant-time solutions for two problems in this model. The first is a routing problem where each node is source and destination of <i>n</i> messages of size <i>O(log n)</i>. The second is a sorting problem where each node <i>i</i> is given <i>n</i> keys of size <i>O(log n)</i> and needs to receive the <i>i<sup>th</sup></i> batch of <i>n</i> keys… CONTINUE READING
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 97 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

97 Citations

02040'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 97 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…