This map shows the geographic impact of Doron Rotem's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Doron Rotem with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Doron Rotem more than expected).
This network shows the impact of papers produced by Doron Rotem. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Doron Rotem. The network helps show where Doron Rotem may publish in the future.
Co-authorship network of co-authors of Doron Rotem
This figure shows the co-authorship network connecting the top 25 collaborators of Doron Rotem.
A scholar is included among the top collaborators of Doron Rotem based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Doron Rotem. Doron Rotem is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Kim, Jinoh & Doron Rotem. (2010). Using Replication for Energy Conservation in RAID Systems.. Parallel and Distributed Processing Techniques and Applications. 703–709.7 indexed citations
2.
Shoshani, Arie & Doron Rotem. (2009). Scientific Data Management: Challenges, Technology, and Deployment. OPAL (Open@LaTrobe) (La Trobe University).46 indexed citations
3.
Otoo, Ekow, Doron Rotem, & Sridhar Seshadri. (2008). Optimal Chunking of Large Multidimensional Arrays for Data Warehousing. Information Systems.4 indexed citations
4.
Romosan, A., et al.. (2005). Co-scheduling of computation and data on computer clusters. 103–112.15 indexed citations
5.
Otoo, Ekow, Doron Rotem, & A. Romosan. (2004). Optimal File-Bundle Caching Algorithms for Data-Grids. University of North Texas Digital Library (University of North Texas).14 indexed citations
6.
Rotem, Doron, Kurt Stockinger, & Kesheng Wu. (2004). Efficient binning for bitmap indices on high-cardinality attributes. eScholarship (California Digital Library).
7.
Li, Jianzhong, Doron Rotem, & Jaideep Srivastava. (1999). Aggregation Algorithms for Very Large Compressed Data Warehouses. Very Large Data Bases. 651–662.26 indexed citations
8.
Rotem, Doron, et al.. (1995). Declustering Databases on Heterogeneous Disk Systems. University of North Texas Digital Library (University of North Texas). 110–121.9 indexed citations
9.
Rotem, Doron, et al.. (1994). Optimal Response Time Retrieval of Replicated Data.. 36–44.17 indexed citations
Rotem, Doron, et al.. (1993). Declustering Objects for Visualization. Very Large Data Bases. 85–96.37 indexed citations
12.
Li, Jianzhong, Jaideep Srivastava, & Doron Rotem. (1992). CMD: A Multidimensional Declustering Method for Parallel Data Systems. Very Large Data Bases. 3–14.50 indexed citations
13.
Rotem, Doron, et al.. (1989). Effective resource utilization for multiprocessor join execution. eScholarship (California Digital Library). 67–76.11 indexed citations
14.
Olken, Frank & Doron Rotem. (1989). Random sampling from B + trees. Very Large Data Bases. 269–277.52 indexed citations
15.
Otoo, Ekow, Nicola Santoro, & Doron Rotem. (1987). Improving Semi-Join Evaluation in Distributed Query Processing.. International Conference on Distributed Computing Systems. 554–561.6 indexed citations
16.
Li, Jianzhong, Doron Rotem, & Harry K. T. Wong. (1987). A New Compression Method with Fast Searching on Large Databases. eScholarship (California Digital Library). 311–318.14 indexed citations
17.
Olken, Frank & Doron Rotem. (1986). Simple Random Sampling from Relational Databases. eScholarship (California Digital Library). 160–169.109 indexed citations
Wong, Harry K. T., et al.. (1985). Bit transposed files. eScholarship (California Digital Library). 448–457.37 indexed citations
20.
Pachl, Jan, Ephraim Korach, & Doron Rotem. (1982). A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms. 378–382.18 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.