Scholar
Rotem Oshman
Google Scholar ID: lGbzFmAAAAAJ
Tel Aviv University
Citations & Impact
Citations
1,082
H-index
17
i10-index
26
Publications
20
Co-authors
0
Contact
No contact links provided.
Publications
Resume (English only)
Academic Achievements
- Some of my talks can be viewed online:
- - Distributed Interactive Proofs, October 2018
- - The Communication Complexity of Distributed Subgraph Detection, October 2014
- - Tight Bounds for Set Disjointness in the Message-Passing Model, May 2013
- - New Connections Between Distributed Computing and Communication Complexity, December 2012
Research Experience
- Given talks at several academic conferences, such as a talk on Distributed Interactive Proofs at the Simons Institute Workshop in October 2018, and a talk on The Communication Complexity of Distributed Subgraph Detection at the Institute for Advanced Studies, Princeton, in October 2014, among others.
Background
- I am a member of the Department of Computer Science at Tel-Aviv University. My main research interests are distributed computing, communication complexity, and formal methods in computer science.
Co-authors