Rotem Oshman

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Quantum Simultaneous Protocols without Public Coins using Modified Equality Queries	2024	François Le Gall Oran Nadler Harumichi Nishimura Rotem Oshman
+ PDF Chat	History-Independent Concurrent Objects	2024	Hagit Attiya Michael A. Bender Martı́n Farach-Colton Rotem Oshman Noa Schiller
+ PDF Chat	History-Independent Concurrent Objects	2024	Hagit Attiya Michael A. Bender Martı́n Farach-Colton Rotem Oshman Noa Schiller
+	Massively Parallel Computation in a Heterogeneous Regime	2023	Orr Fischer Adi Horowitz Rotem Oshman
+ PDF Chat	Massively Parallel Computation in a Heterogeneous Regime	2022	Orr Fischer Adi Horowitz Rotem Oshman
+	Quantum Distributed Algorithms for Detection of Cliques	2022	Keren Censor-Hillel Orr Fischer François Le Gall Dean Leitersdorf Rotem Oshman
+	On the Communication Complexity of Key-Agreement Protocols	2021	Iftach Haitner Noam Mazor Rotem Oshman Omer Reingold Amir Yehudayoff
+	Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs	2021	Keren Censor-Hillel Orr Fischer Tzlil Gonen François Le Gall Dean Leitersdorf Rotem Oshman
+	On the Communication Complexity of Key-Agreement Protocols	2021	Iftach Haitner Noam Mazor Rotem Oshman Omer Reingold Amir Yehudayoff
+ PDF Chat	On the Interactive Capacity of Finite-State Protocols	2020	Assaf Ben-Yishai Young-Han Kim Rotem Oshman Ofer Shayevitz
+	Lower Bounds for Subgraph Detection in the CONGEST Model	2018	Tzlil Gonen Rotem Oshman
+	On the Communication Complexity of Key-Agreement Protocols.	2018	Iftach Haitner Noam Mazor Rotem Oshman Omer Reingold Amir Yehudayoff
+ PDF Chat	On the Multiparty Communication Complexity of Testing Triangle-Freeness	2017	Orr Fischer Shay Gershtein Rotem Oshman
+	On The Multiparty Communication Complexity of Testing Triangle-Freeness	2017	Orr Fischer Shay Gershtein Rotem Oshman
+	Distributed Property Testing for Subgraph-Freeness Revisited	2017	Orr Fischer Tzlil Gonen Rotem Oshman
+	Superlinear Lower Bounds for Distributed Subgraph Detection	2017	Orr Fischer Tzlil Gonen Rotem Oshman
+	On The Multiparty Communication Complexity of Testing Triangle-Freeness	2017	Orr Fischer Shay Gershtein Rotem Oshman
+	Tight Bounds for Set Disjointness in the Message Passing Model	2013	Mark Braverman Faith Ellen Rotem Oshman Toniann Pitassi Vinod Vaikuntanathan
+ PDF Chat	Optimal gradient clock synchronization in dynamic networks	2010	Fabian Kühn Christoph Lenzen Thomas Locher Rotem Oshman
+	Optimal Gradient Clock Synchronization in Dynamic Networks	2010	Fabian Kühn Christoph Lenzen Thomas Locher Rotem Oshman
+ PDF Chat	Gradient Clock Synchronization Using Reference Broadcasts	2009	Fabian Kühn Rotem Oshman
+	Gradient Clock Synchronization using Reference Broadcasts	2009	Fabian Kühn Rotem Oshman

Common Coauthors

Coauthor	Papers Together
Orr Fischer	9
Fabian Kühn	4
Tzlil Gonen	4
Noam Mazor	3
Iftach Haitner	3
Shay Gershtein	3
Omer Reingold	3
Amir Yehudayoff	3
François Le Gall	3
Michael A. Bender	2
Noa Schiller	2
Martı́n Farach-Colton	2
Hagit Attiya	2
Dean Leitersdorf	2
Adi Horowitz	2
Christoph Lenzen	2
Keren Censor-Hillel	2
Thomas Locher	2
Oran Nadler	1
Toniann Pitassi	1
Faith Ellen	1
Ofer Shayevitz	1
Mark Braverman	1
Assaf Ben-Yishai	1
Harumichi Nishimura	1
Young-Han Kim	1
Vinod Vaikuntanathan	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Algebraic methods in the congested clique	2016	Keren Censor-Hillel Petteri Kaski Janne H. Korhonen Christoph Lenzen Ami Paz Jukka Suomela	5
+ PDF Chat	“Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting	2012	Danny Dolev Christoph Lenzen Shir Peled	4
+ PDF Chat	Dynamic Graph Stream Algorithms in $o(n)$ Space	2016	Zengfeng Huang Peng Pan	2
+ PDF Chat	Communication lower bounds for statistical estimation problems via a distributed data processing inequality	2016	Mark Braverman Ankit Garg Tengyu Ma Huy L. Nguyễn David P. Woodruff	2
+	Testing triangle-freeness in general graphs	2006	Noga Alon Tali Kaufman Michael Krivelevich Dana Ron	2
+ PDF Chat	A new proof of the graph removal lemma	2011	Jacob Fox	2
+ PDF Chat	Tight bounds for distributed functional monitoring	2012	David P. Woodruff Qin Zhang	2
+	Testing subgraphs in directed graphs	2003	Noga Alon A. Shapira	2
+ PDF Chat	Fast Distributed Algorithms for Testing Graph Properties	2016	Keren Censor-Hillel Eldar Fischer Gregory Schwartzman Yadu Vasudev	2
+	Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems	2016	François Le Gall	2
+	Property testing in bounded degree graphs	1997	Oded Goldreich Dana Ron	2
+ PDF Chat	Approximately Counting Triangles in Sublinear Time	2015	Talya Eden Amit Levi Dana Ron C. Seshadhri	2
+ PDF Chat	Optimal principal component analysis in distributed and streaming models	2016	Christos Boutsidis David P. Woodruff Peilin Zhong	2
+	Deterministic subgraph detection in broadcast CONGEST	2017	Janne H. Korhonen Joel Rybicki	2
+	The one-way communication complexity of the Boolean Hidden Matching Problem	2006	Iordanis Kerenidis Ran Raz	2
+ PDF Chat	Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model	2008	Troy Lee Adi Shraibman	1
+ PDF Chat	On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model	2014	Yi Li Xiaoming Sun Chengu Wang David P. Woodruff	1
+ PDF Chat	A tail bound for read‐<i>k</i> families of functions	2014	Dmitry Gavinsky Shachar Lovett Michael Saks Srikanth Srinivasan	1
+ PDF Chat	Distributed community detection in dynamic graphs	2014	Andrea Clementi Miriam Di Ianni Giorgio Gambosi Emanuele Natale Riccardo Silvestri	1
+ PDF Chat	A Practical Oblivious Map Data Structure with Secure Deletion and History Independence	2016	Daniel S. Roche Adam J. Aviv Seung Geol Choi	1
+	Bridging the Capacity Gap Between Interactive and One-Way Communication	2017	Bernhard Haeupler Ameya Velingker	1
+ PDF Chat	Equivalence between modularity optimization and maximum likelihood methods for community detection	2016	M. E. J. Newman	1
+	Distributed Computation does not Help	2013	David P. Woodruff Qin Zhang	1
+	Practical Foundations of History Independence	2015	Sumeet Bajaj Anrin Chakraborti Radu Sion	1
+	Community detection and stochastic block models: recent developments	2017	Emmanuel Abbé	1
+	Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model	2017	Guy Even Reut Levi Moti Medina	1
+	Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model	2017	Keren Censor-Hillel Seri Khoury Ami Paz	1
+ PDF Chat	Triangle Finding and Listing in CONGEST Networks	2017	Taisuke Izumi François Le Gall	1
+	Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion	2017	Amir Abboud Keren Censor-Hillel Seri Khoury Christoph Lenzen	1
+	Distributed triangle detection via expander decomposition	2019	Yi‐Jun Chang Seth Pettie Hengjie Zhang	1
+	On the Communication Complexity of Key-Agreement Protocols.	2018	Iftach Haitner Noam Mazor Rotem Oshman Omer Reingold Amir Yehudayoff	1
+	Limits of Random Oracles in Secure Computation	2012	Mohammad Mahmoody Hemanta K. Maji Manoj Prabhakaran	1
+	Multiparty Communication Complexity of Disjointness	2008	Arkadev Chattopadhyay Anil Ada	1
+	When Distributed Computation is Communication Expensive	2013	David P. Woodruff Qin Zhang	1
+	A Hybrid Sampling Scheme for Triangle Counting	2017	John Kallaugher Eric Price	1
+	Information Equals Amortized Communication	2011	Mark Braverman Anup Rao	1
+ PDF Chat	On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation	2012	Jelani Nelson Huy L. Nguyễn David P. Woodruff	1
+	Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy	2012	Jeff M. Phillips Elad Verbin Qin Zhang	1
+ PDF Chat	Adaptive protocols for interactive communication	2016	Shweta Agrawal Ran Gelles Amit Sahai	1
+ PDF Chat	Fast Approximate Shortest Paths in the Congested Clique	2019	Keren Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf	1
+ PDF Chat	Exact Recovery in the Stochastic Block Model	2015	Emmanuel Abbé Afonso S. Bandeira Georgina Hall	1
+	Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration	2019	Yi‐Jun Chang Thatchaphol Saranurak	1
+	On the Distributed Complexity of Large-Scale Graph Computations	2018	Gopal Pandurangan Peter Robinson Michele Scquizzato	1
+	Large Cuts with Local Algorithms on Triangle-Free Graphs	2017	Juho Hirvonen Joel Rybicki Stefan Schmid Jukka Suomela	1
+ PDF Chat	Interactive Channel Capacity Revisited	2014	Bernhard Haeupler	1
+ PDF Chat	Parallel Graph Connectivity in Log Diameter Rounds	2018	Alexandr Andoni Zhao Song Clifford Stein Zhengyu Wang Peilin Zhong	1
+	A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels.	2019	Assaf Ben-Yishai Young-Han Kim Or Ordentlich Ofer Shayevitz	1
+ PDF Chat	Efficient Distributed Community Detection in the Stochastic Block Model	2019	Reza Fathi Anisur Rahaman Molla Gopal Pandurangan	1
+	Sparse matrix multiplication and triangle listing in the Congested Clique model	2019	Keren Censor-Hillel Dean Leitersdorf Elia Turner	1
+	Efficient Testing of Large Graphs	2000	Noga Alon Eldar Fischer Michael Krivelevich Márió Szegedy	1