Rotem Oshman - Concepedia

Author

Rotem Oshman

Tel Aviv University ORCID

Also Known As

Oshman, R., Oshman, Rotem, Rotem Oshman

Publications

1.5K

Citations

H-Index

Concepts

All Affiliations

Tel Aviv University Massachusetts Institute of Technology Università della Svizzera italiana University of Freiburg Princeton University

About

Rotem Oshman is an author at Tel Aviv University specializing in engineering, computer science, and network science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	13	16	1.1K
2	Business	7	7	299
3	Communication	4	4	107
4	Computer Engineering	2	2	58
5	Education	1	1	390

Rotem Oshman

Publications

1.3K

Citations

H-Index

Page 1

	Year	Citations
Distributed computation in dynamic networks Fabian Kühn, Nancy Lynch, Rotem Oshman EngineeringDistributed AlgorithmsNetwork RobustnessNetwork AnalysisEducation	2010	390
Dynamic networks Fabian Kühn, Rotem Oshman ACM SIGACT News Dynamic NetworkNetwork AnalyticsComputational Social ScienceNetwork ScienceEngineering	2011	213
On the power of the congested clique model Andrew Drucker, Fabian Kühn, Rotem Oshman EngineeringNetwork AnalysisCommunication ComplexityRandom GraphDistributed Coordination	2014	186
Coordinated consensus in dynamic networks Fabian Kühn, Yoram Moses, Rotem Oshman Dynamic NetworkCommunication GraphNetwork ScienceDistributed CoordinationSynchronization Protocol	2011	120
A Tight Bound for Set Disjointness in the Message-Passing Model Mark Braverman, Faith Ellen, Rotem Oshman, EngineeringTight Lower BoundComputational ComplexityCommunication ComplexityInformation Theoretic Security	2013	62
Broadcasting in unreliable radio networks Fabian Kühn, Nancy Lynch, Calvin Newport, Theoretical BoundsNetwork ScienceEngineeringUnreliable Radio NetworksSurvivable Network	2010	50
Possibilities and Impossibilities for Distributed Subgraph Detection Orr Fischer, Tzlil Gonen, Fabian Kühn, EngineeringNetwork GraphNetwork AnalysisCommunication ComplexityComputational Complexity	2018	35
Interactive Distributed Proofs Gillat Kol, Rotem Oshman, Raghuvansh R. Saxena EngineeringVerificationAutomated ProofComputational ComplexityFormal Verification	2018	35
The communication complexity of distributed task allocation Andrew Drucker, Fabian Kühn, Rotem Oshman Cluster ComputingEngineeringNetwork AnalysisCommunication ComplexityComputational Complexity	2012	33
Optimal gradient clock synchronization in dynamic networks Fabian Kühn, Christoph Lenzen, Thomas Locher, Dynamic NetworkFault-tolerant NetworkNetwork ScienceEngineeringClock Synchronization	2010	29

Page 1