Advanced search    

Search: authors:"Rotem Oshman"

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

Distributed Approximate Maximum Matching in the CONGEST Model

We study distributed algorithms for the maximum matching problem in the CONGEST model, where each message must be bounded in size. We give new deterministic upper bounds, and a new lower bound on the problem. We begin by giving a distributed algorithm that computes an exact maximum (unweighted) matching in bipartite graphs, in O(n log n) rounds. Next, we give a distributed...

Interactive Compression for Multi-Party Protocol

can be compressed to its information content. Roughly speaking, compressing a protocol ? means constructing ? Rotem Oshman is supported by the Israeli Centers of Research Excellence (I-CORE) program

Three Notes on Distributed Property Testing

Symposium on Distributed Computing , pages 195 - 209 , 2012 . Andrew Drucker , Fabian Kuhn, and Rotem Oshman . On the power of the congested clique model . In ACM Symposium on Principles of Distributed ... /abs/1705.04898. Orr Fischer , Tzlil Gonen , and Rotem Oshman . Distributed property testing for subgraphfreeness revisited . CoRR, abs/1705.04033 , 2017 . URL: http://arxiv.org/abs/1705. Distributed