#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2007

2018

- This year (4)
- Last 5 years (21)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Fabian Kuhn, Nancy A. Lynch, Rotem Oshman
- STOC
- 2010

In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the communication links forâ€¦ (More)

- Andrew Drucker, Fabian Kuhn, Rotem Oshman
- PODC
- 2014

We study the computation power of the congested clique, a model of distributed computation where n players communicate with each other over a complete network in order to compute some function ofâ€¦ (More)

- Fabian Kuhn, Yoram Moses, Rotem Oshman
- PODC
- 2011

We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adversary. The networkâ€¦ (More)

- Fabian Kuhn, Rotem Oshman
- SIGACT News
- 2011

The study of dynamic networks has come into popularity recently, and many models and algorithms for such networks have been suggested. In this column we survey some recent work on dynamic networkâ€¦ (More)

- Fabian Kuhn, Rotem Oshman
- DISC
- 2011

We study problems of data aggregation, such as approximate counting and computing the minimum input value, in synchronous directed networks with bounded message bandwidth B = Î©(log n). In undirectedâ€¦ (More)

- Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan
- 2013 IEEE 54th Annual Symposium on Foundations ofâ€¦
- 2013

In a multiparty message-passing model of communication, there are k players. Each player has a private input, and they communicate by sending messages to one another over private channels. While thisâ€¦ (More)

- Rotem Oshman, Nir Shavit
- PODC
- 2013

To date, all concurrent search structures that can support predecessor queries have had depth logarithmic in m, the number of elements. This paper introduces the SkipTrie, a new concurrent searchâ€¦ (More)

- Fabian Kuhn, Thomas Locher, Rotem Oshman
- Theory of Computing Systems
- 2009

Over the last years, large-scale decentralized computer networks such as peer-to-peer and mobile ad hoc networks have become increasingly prevalent. The topologies of many of these networks are oftenâ€¦ (More)

- Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman
- PODC
- 2010

We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks,â€¦ (More)

- Fabian Kuhn, Rotem Oshman
- OPODIS
- 2009

In this paper we suggest a method by which reference broadcas t synchronization (RBS), and other methods of estimating clock values, can be incorpo rated in standard clock synchronization algorithmsâ€¦ (More)