Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Distributed, Parallel, and Cluster Computing

arXiv:1207.1852 (cs)
[Submitted on 8 Jul 2012 (v1), last revised 10 May 2013 (this version, v4)]

Title:Optimal Deterministic Routing and Sorting on the Congested Clique

Authors:Christoph Lenzen
View PDF
Abstract:Consider a clique of n nodes, where in each synchronous round each pair of nodes can exchange O(log n) 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 n messages of size O(log n). The second is a sorting problem where each node i is given n keys of size O(log n) and needs to receive the ith batch of n keys according to the global order of the keys. The latter result also implies deterministic constant-round solutions for related problems such as selection or determining modes.
Comments: 16 pages, no figures; published at PODC 2013
Subjects: Distributed, Parallel, and Cluster Computing (cs.DC)
Cite as: arXiv:1207.1852 [cs.DC]
  (or arXiv:1207.1852v4 [cs.DC] for this version)
  https://doi.org/10.48550/arXiv.1207.1852

Submission history

From: Christoph Lenzen [view email]
[v1] Sun, 8 Jul 2012 07:49:22 UTC (17 KB)
[v2] Mon, 5 Nov 2012 15:56:59 UTC (19 KB)
[v3] Wed, 9 Jan 2013 17:26:25 UTC (19 KB)
[v4] Fri, 10 May 2013 18:04:50 UTC (19 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.DC
< prev   |   next >
new | recent | 2012-07
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Christoph Lenzen
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)