Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
This map shows the geographic impact of Israel Koren'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 Israel Koren with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Israel Koren more than expected).
This network shows the impact of papers produced by Israel Koren. 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 Israel Koren. The network helps show where Israel Koren may publish in the future.
Co-authorship network of co-authors of Israel Koren
This figure shows the co-authorship network connecting the top 25 collaborators of Israel Koren.
A scholar is included among the top collaborators of Israel Koren 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 Israel Koren. Israel Koren 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.
Xu, Ye, Israel Koren, & C.M. Krishna. (2017). AdaFT. ACM Transactions on Embedded Computing Systems. 16(3). 1–25.11 indexed citations
Breveglieri, Luca, et al.. (2006). Fault Diagnosis and Tolerance in Cryptography : Third International Workshop, FDTC 2006, Yokohama, Japan, October 10, 2006 : proceedings. Springer eBooks.1 indexed citations
5.
Breveglieri, Luca, Israel Koren, & Paolo Maistri. (2004). Detecting faults in four symmetric key block ciphers. Virtual Community of Pathological Anatomy (University of Castilla La Mancha). 258–268.5 indexed citations
Ünsal, Osman, et al.. (2001). Cool-cache for hot multimedia. International Symposium on Microarchitecture. 274–283.24 indexed citations
9.
Koren, Israel & Peter Kornerup. (1999). Proceedings, 14th IEEE Symposium on Computer Arithmetic, April 14-16, 1999, Adelaide, Australia.1 indexed citations
10.
Koren, Israel, et al.. (1998). Development Of Application-Level Fault Tolerance In A Real-Time Benchmark.1 indexed citations
Mendelson, Bilha & Israel Koren. (1991). Using Simulated Annealing for Mapping Algorithms onto Data Driven Arrays.. Proceedings of the International Conference on Parallel Processing. 123–127.1 indexed citations
16.
Koren, Israel, et al.. (1989). SPECIAL SECTION ON HIGH-YIELD VLSI SYSTEMS - INTRODUCTION. IEEE Transactions on Computers. 38(4).
17.
Koren, Israel & C.H. Stapper. (1989). Introduction Special Section on High-Yield Systems. IEEE Transactions on Computers. 38(4). 481–483.1 indexed citations
18.
Koren, Israel, et al.. (1985). Evaluating the Cost-Effectiveness of Switches in Processor Array Architectures.. Proceedings of the International Conference on Parallel Processing. 480–487.2 indexed citations
19.
Koren, Israel & Gabriel M. Silberman. (1983). A Direct Mapping of Algorithms onto VLSI Processing Arrays Based on the Data Flow Approach.. Proceedings of the International Conference on Parallel Processing. 335–337.9 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.