G. Koren

1.0k total citations
17 papers, 655 citations indexed

About

G. Koren is a scholar working on Hardware and Architecture, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, G. Koren has authored 17 papers receiving a total of 655 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Hardware and Architecture, 14 papers in Computer Networks and Communications and 8 papers in Industrial and Manufacturing Engineering. Recurrent topics in G. Koren's work include Real-Time Systems Scheduling (15 papers), Optimization and Search Problems (9 papers) and Scheduling and Optimization Algorithms (8 papers). G. Koren is often cited by papers focused on Real-Time Systems Scheduling (15 papers), Optimization and Search Problems (9 papers) and Scheduling and Optimization Algorithms (8 papers). G. Koren collaborates with scholars based in United States and Israel. G. Koren's co-authors include Dennis Shasha, Bud Mishra, Louis E. Rosier, Sanjoy Baruah, Arvind U. Raghunathan, Dacheng Mao, Amihood Amir, Shih‐Chang Huang and Daniel M. Berry and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Real-Time Systems.

In The Last Decade

G. Koren

15 papers receiving 609 citations

Peers

G. Koren

CNC

HA

IME

CTM

EEE

Lee United States

Donald Varvel United States

Simon Künzli Switzerland

Stanley P. Y. Fung Hong Kong

Chao-Ju Hou United States

Mario J. Gonzalez United States

Claudio Scordino Italy

Rajesh Devaraj India

Walter H. Kohler United States

Raymond M. Bryant United States

Lee United States

G. Koren

237 ×0.5

CNC

154 ×0.4

HA

98 ×0.6

IME

70 ×0.6

CTM

44 ×0.6

EEE

Citations per year, relative to G. Koren G. Koren (= 1×) peers Lee

Countries citing papers authored by G. Koren

Since Specialization

Citations

This map shows the geographic impact of G. 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 G. Koren with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites G. Koren more than expected).

Fields of papers citing papers by G. Koren

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by G. 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 G. Koren. The network helps show where G. Koren may publish in the future.

Co-authorship network of co-authors of G. Koren

This figure shows the co-authorship network connecting the top 25 collaborators of G. Koren. A scholar is included among the top collaborators of G. 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 G. Koren. G. Koren is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

17 of 17 papers shown

1.

Koren, G. & Dennis Shasha. (2011). An optimal scheduling algorithm with a competitive factor for real-time systems.

2.

Koren, G. & Dennis Shasha. (2004). Scheduling overloaded real-time systems with competitive/worst-case guarantees. 33-1–33-24. 1 indexed citations

3.

Koren, G. & Dennis Shasha. (2003). D/sup over/; an optimal on-line scheduling algorithm for overloaded real-time systems. 290–299. 62 indexed citations

4.

Koren, G., Dennis Shasha, & Shih‐Chang Huang. (2002). MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling. 172–181. 8 indexed citations

5.

Koren, G. & Dennis Shasha. (2002). Skip-Over: algorithms and complexity for overloaded systems that allow skips. 161 indexed citations

6.

Baruah, Sanjoy, G. Koren, Dacheng Mao, et al.. (2002). On the competitiveness of on-line real-time task scheduling. 106–115. 26 indexed citations

7.

Baruah, Sanjoy, G. Koren, Bud Mishra, et al.. (2002). On-line scheduling in the presence of overload. 100–110. 73 indexed citations

8.

Koren, G., et al.. (2002). A time-sharing architecture for complex real-time systems. 9–16. 5 indexed citations

9.

Koren, G., et al.. (2000). The Power of Migration in Multiprocessor Scheduling of Real-Time Systems. SIAM Journal on Computing. 30(2). 511–527. 5 indexed citations

10.

Koren, G., et al.. (1998). The power of migration in multi-processor scheduling of real-time systems. Symposium on Discrete Algorithms. 226–235. 12 indexed citations

11.

Koren, G. & Dennis Shasha. (1995). An Approach To Handling Overloaded Systems That Allow Skips.. 49(5). 110–119. 8 indexed citations

12.

Koren, G. & Dennis Shasha. (1995). $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems. SIAM Journal on Computing. 24(2). 318–339. 125 indexed citations

13.

Koren, G. & Dennis Shasha. (1994). MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling. Theoretical Computer Science. 128(1-2). 75–97. 43 indexed citations

14.

Koren, G. & Dennis Shasha. (1993). Competitive Algorithms and Lower Bounds for On-Line Scheduling of Multiprocessor Real-Time Systems. 3 indexed citations

15.

Koren, G., et al.. (1993). Competitive on-line scheduling for multiprocessor real-time systems.

16.

Koren, G.. (1993). Competitive on-line scheduling for overloaded real-time systems. 4 indexed citations

17.

Baruah, Sanjoy, G. Koren, Dacheng Mao, et al.. (1992). On the competitiveness of on-line real-time task scheduling. Real-Time Systems. 4(2). 125–144. 119 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.

Explore authors with similar magnitude of impact