Publications
- Mark Braverman, Gillat Kol, Rotem Oshman and Avishay Tal. On the Computational Power of Radio Channels. In the 33rd International Symposium on Distributed Computing (DISC 2019).
- Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, and Rotem Oshman. Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. In the 33rd International Symposium on Distributed Computing (DISC 2019).
- Orr Fischer and Rotem Oshman. A Distributed Algorithm for Directed Minimum-Weight Spanning Tree. In the 33rd International Symposium on Distributed Computing (DISC 2019).
- Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca. On Distributed Merlin-Arthur Decision Protocols. In the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019).
- Uri Meir, Dor Minzer, Rotem Oshman. Can Distributed Uniformity Testing Be Local? In the 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2019).
- Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold and Amir Yehudayoff. On the Communication Complexity of Key-Agreement Protocols. In the 10th Innovations in Theoretical Computer Science Conference (ITCS 2019).
- Mohamad Ahmadi, Fabian Kuhn and Rotem Oshman. Distributed Approximate Maximum Matching in the CONGEST Model. In the 32nd International Symposium on Distributed Computing (DISC 2018).
- Orr Fischer, Uri Meir, Rotem Oshman. Distributed Uniformity Testing. In the 36th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2018).
- Gillat Kol, Rotem Oshman, Raghuvansh R. Saxena. Interactive Distributed Proofs. In the 36th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2018).
- Orr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman. Possibilities and Impossibilities for Distributed Subgraph Detection. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA 2018).
- Tzlil Gonen and Rotem Oshman. Lower Bounds on Subgraph Detection in the CONGEST model. In the 21st International Conference on Principles of Distributed Systems (OPODIS 2017).
- Mark Braverman, Rotem Oshman. A Rounds vs. Communication Tradeoff forMulti-Party Set Disjointness. In the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017).
- Gillat Kol, Rotem Oshman, Dafna Sadeh. Interactive Compression for Multi-Party Protocols. In the 31st International Symposium on Distributed Computing (DISC 2017).
- Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedto Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca. Three Notes on Distributed Property Testing. In the 31st International Symposium on Distributed Computing (DISC 2017).
- Orr Fischer, Shay Gerhstein, Rotem Oshman. On the Multiparty Communication Complexity of Testing Triangle-Freeness. In the 35th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2017).
- Orr Fischer, Rotem Oshman, Uri Zwick. Public vs. Private Randomness in Simultaneous Multi-Party Communication Complexity. In Structural Information and Communication Complexity, 23rd International Colloquium (SIROCCO 2016).
- Mark Braverman, Rotem Oshman. On Information Complexity in the Broadcast Model. In the 34th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2015).
- Andrew Drucker, Fabian Kuhn, Rotem Oshman. On the power of the congested clique model. In the 33rd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2014).
- Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan. A Tight Bound for Set Disjointness in the Message-Passing Model. In the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013).
- Rotem Oshman, Nir Shavit. The SkipTrie: low-depth concurrent search without rebalancing. In the 32nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2013).
- Rotem Oshman. Distributed Computation in Wireless and Dynamic Networks. PhD Thesis.
- Andrew Drucker, Fabian Kuhn and Rotem Oshman. The Communication Complexity of Task Aggregation. In the 31st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2012).
- Fabian Kuhn and Rotem Oshman. The Complexity of Data Aggregation in Directed Networks. In the 25th International Symposium on DIStributed Computing (DISC 2011).
- Fabian Kuhn, Yoram Moses and Rotem Oshman. Coordinated Consensus in Dynamic Networks. In the 30th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2011).
- Thomas Moscibroda and Rotem Oshman. Resilience of Mutual Exclusion Algorithms to Transient Memory Faults. In the 30th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2011).
- Fabian Kuhn, Christoph Lenzen, Thomas Locher and Rotem Oshman. Optimal Gradient Clock Synchronization in Dynamic Networks. In the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2010).
- Fabian Kuhn, Nancy Lynch, Calvin Newport, Rotem Oshman and Andrea Richa. Broadcasting in Unreliable Networks. In the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2010).
- Fabian Kuhn, Nancy Lynch, Rotem Oshman. Distributed Computation in Dynamic Networks. In the 42nd ACM Symposium on Theory of Computing (STOC 2010).
- Fabian Kuhn, Rotem Oshman. Gradient Clock Synchronization Using Reference Broadcasts. In the 13th International Conference Principles of Distributed Systems (OPODIS 2009).
- Fabian Kuhn, Thomas Locher, Rotem Oshman. Gradient Clock Synchronization in Dynamic Networks. In the 21st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2009).
- Rotem Oshman. An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking. In the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2009).
- Rotem Oshman, Orna Grumberg. A New Approach to Bounded Model Checking for Branching Time Logics. In the 5th International Symposium on Automated Technology for Verification and Analysis.