Year: 2012
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Lenzen, Christoph
Institution: Massachusetts Institute of Technology
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G1040128030, CCF-AF: Abstract Medium Access Control Layers, G1523888516, G2137202048, G413333172, G4377892860, AF: Small: Bounded-Contention Coding for Wireless Networks, Emerging Frontiers of Science of Information, G6565510919, CPS: Medium: Collaborative Research: Geometric Distributed Algorithms for Multi-Robot Coordination and Control
OpenAlex ID: W2949818233