Advanced search    

Search: authors:"Artur Czumaj"

7 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

Brief Announcement: Randomized Blind Radio Networks

Radio networks are a long-studied model for distributed system of devices which communicate wirelessly. When these devices are mobile or have limited capabilities, the system is best modeled by the ad-hoc variant, in which the devices do not know the structure of the network. Much work has been devoted to designing algorithms for the ad-hoc model, particularly for fundamental...

Detecting Cliques in CONGEST Networks

Artur Czumaj 2 Department of Computer Science, University of Bristol , UK The problem of detecting network structures plays a central role in distributed computing. One of the fundamental problems

Deterministic Blind Radio Networks

Ad-hoc radio networks and multiple access channels are classical and well-studied models of distributed systems, with a large body of literature on deterministic algorithms for fundamental communications primitives such as broadcasting and wake-up. However, almost all of these algorithms assume knowledge of the number of participating nodes and the range of possible IDs, and...

Online Facility Location with Deletions

, University of Warsaw , Banacha 2, 02-097 Warsaw , Poland 2 Marcin Mucha Institute of Informatics, University of Warsaw , Banacha 2, 02-097 Warsaw , Poland 3 Artur Czumaj Department of Computer Science and ... -015-0021-y. Mihai Badoiu , Artur Czumaj, Piotr Indyk, and Christian Sohler . Facility location in sublinear time . In Proceedings of the 32nd Annual International Colloquium on Automata, Languages and

Distributed Methods for Computing Approximate Equilibria

previous best known guarantee of 0.732. It can also be applied to the case of approximate Nash equilibria, where we obtain a randomized Artur Czumaj, Michail Fasoulakis and Marcin Jurdzin?ski were partially

Communicating with Beeps

The beep model is a very weak communications model in which devices in a network can communicate only via beeps and silence. As a result of its weak assumptions, it has broad applicability to many different implementations of communications networks. This comes at the cost of a restrictive environment for algorithm design. Despite being only recently introduced, the beep model...

Faster Deterministic Communication in Radio Networks

In this paper we improve the deterministic complexity of two fundamental communication primitives in the classical model of ad-hoc radio networks with unknown topology: broadcasting and wake-up. We consider an unknown radio network, in which all nodes have no prior knowledge about network topology, and know only the size of the network n, the maximum in-degree of any node Delta...