Louis E. Rosier

2.7k total citations · 1 hit paper
42 papers, 1.7k citations indexed

About

Louis E. Rosier is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Louis E. Rosier has authored 42 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 15 papers in Computer Networks and Communications and 14 papers in Artificial Intelligence. Recurrent topics in Louis E. Rosier's work include semigroups and automata theory (16 papers), Formal Methods in Verification (14 papers) and Petri Nets in System Modeling (13 papers). Louis E. Rosier is often cited by papers focused on semigroups and automata theory (16 papers), Formal Methods in Verification (14 papers) and Petri Nets in System Modeling (13 papers). Louis E. Rosier collaborates with scholars based in United States, Taiwan and Czechia. Louis E. Rosier's co-authors include Sanjoy Baruah, R. Rodney Howell, Aloysius K. Mok, Hsu‐Chun Yen, Donald Varvel, Robert C. Holte, Bud Mishra, Arvind U. Raghunathan, G. Koren and Dennis Shasha and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Louis E. Rosier

42 papers receiving 1.5k citations

Hit Papers

Preemptively scheduling hard-real-time sporadic tasks on ... 1990 2026 2002 2014 1990 100 200 300 400 500

Peers

Louis E. Rosier
J.W.S. Liu United States
J.K. Strosnider United States
Neil Audsley United Kingdom
Tilak Agerwala United States
J.W.S. Liu United States
Louis E. Rosier
Citations per year, relative to Louis E. Rosier Louis E. Rosier (= 1×) peers J.W.S. Liu

Countries citing papers authored by Louis E. Rosier

Since Specialization
Citations

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

Fields of papers citing papers by Louis E. Rosier

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Louis E. Rosier

This figure shows the co-authorship network connecting the top 25 collaborators of Louis E. Rosier. A scholar is included among the top collaborators of Louis E. Rosier 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 Louis E. Rosier. Louis E. Rosier 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.
Baruah, Sanjoy, Louis E. Rosier, & Donald Varvel. (2002). Static and dynamic scheduling of sporadic tasks for single-processor systems. 100–105. 2 indexed citations
2.
Baruah, Sanjoy, R. Rodney Howell, & Louis E. Rosier. (1993). Feasibility problems for recurring tasks on one processor. Theoretical Computer Science. 118(1). 3–20. 62 indexed citations
3.
Howell, R. Rodney, Louis E. Rosier, & Hsu‐Chun Yen. (1993). Normal and sinkless petri nets. Journal of Computer and System Sciences. 46(1). 1–26. 23 indexed citations
4.
Howell, R. Rodney, Petr Jančar, & Louis E. Rosier. (1993). Completeness Results for Single-Path Petri Nets. Information and Computation. 106(2). 253–265. 7 indexed citations
5.
Holte, Robert C., et al.. (1992). Pinwheel scheduling with two distinct numbers. Theoretical Computer Science. 100(1). 105–135. 42 indexed citations
6.
Howell, R. Rodney, Louis E. Rosier, & Hsu‐Chun Yen. (1991). A taxonomy of fairness and temporal logic problems for Petri nets. Theoretical Computer Science. 82(2). 341–372. 16 indexed citations
7.
Baruah, Sanjoy & Louis E. Rosier. (1991). Limitations Concerning On-Line Scheduling Algorithms for Overloaded Real-Time Systems. IFAC Proceedings Volumes. 24(2). 123–125. 4 indexed citations
8.
Baruah, Sanjoy, Aloysius K. Mok, & Louis E. Rosier. (1990). Preemptively scheduling hard-real-time sporadic tasks on one processor. 182–190. 503 indexed citations breakdown →
9.
Browne, James C., et al.. (1990). Bounded-time fault-tolerant rule-based systems. Telematics and Informatics. 7(3-4). 441–454. 2 indexed citations
10.
Mok, Al, et al.. (1989). Algorithms and complexity of the periodic maintenance problem. Microprocessing and Microprogramming. 27(1-5). 657–664. 12 indexed citations
11.
Howell, R. Rodney & Louis E. Rosier. (1989). Problems concerning fairness and temporal logic for conflict-free petri nets. Theoretical Computer Science. 64(3). 305–329. 22 indexed citations
12.
Howell, R. Rodney & Louis E. Rosier. (1988). Completeness results for conflict-free vector replacement systems. Journal of Computer and System Sciences. 37(3). 349–366. 24 indexed citations
13.
Gouda, Mohamed G., et al.. (1987). On deadlock detection in systems of communicating finite state machines. Computing and Informatics / Computers and Artificial Intelligence. 6(3). 209–228. 26 indexed citations
14.
Howell, R. Rodney, Louis E. Rosier, Dung T. Huynh, & Hsu‐Chun Yen. (1986). Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states. Theoretical Computer Science. 46. 107–140. 13 indexed citations
15.
Rosier, Louis E. & Hsu‐Chun Yen. (1986). A multiparameter analysis of the boundedness problem for vector addition systems. Journal of Computer and System Sciences. 32(1). 105–135. 34 indexed citations
16.
Rosier, Louis E. & Hsu‐Chun Yen. (1986). Boundedness, empty channel detection, and synchronization for communicating finite automata. Theoretical Computer Science. 44. 69–105. 16 indexed citations
17.
Ibarra, Óscar H. & Louis E. Rosier. (1985). The equivalence problem and correctness formulas for a simple class of programs. Information and Control. 65(1). 18–41. 1 indexed citations
18.
Ibarra, Óscar H., et al.. (1984). A note on the complexity of program evaluation. Theory of Computing Systems. 17(1). 85–96. 6 indexed citations
19.
Ibarra, Óscar H., Shlomo Moran, & Louis E. Rosier. (1983). On the control power of integer division. Theoretical Computer Science. 24(1). 35–52. 6 indexed citations
20.
Ibarra, Óscar H. & Louis E. Rosier. (1981). On restricted one-counter machines. Theory of Computing Systems. 14(1). 241–245. 2 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

Rankless by CCL
2026