A Note on the Parallel Complexity of Computing the Rank of Order n Matrices. - Oscar H. Ibarra; Shlomo Moran; Louis E. Rosier (Inf. Process. Lett., 1980)

Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems. - Oscar H. Ibarra; Shlomo Moran; Louis E. Rosier (Inf. Process. Lett., 1981)

On the Decidability of Equivalence for Deterministic Pushdown Transducers. - Oscar H. Ibarra; Louis E. Rosier (Inf. Process. Lett., 1981)

On Restricted One-counter Machines. - Oscar H. Ibarra; Louis E. Rosier (Math. Syst. Theory, 1981)

On the Control Power of Integer Division. - Oscar H. Ibarra; Shlomo Moran; Louis E. Rosier (Theor. Comput. Sci., 1983)

Simple Programming Languages and Restricted Classes of Turing Machines. - Oscar H. Ibarra; Louis E. Rosier (Theor. Comput. Sci., 1983)

Communicating Finite State Machines with Priority Channnels. - Mohamed G. Gouda; Louis E. Rosier (ICALP, 1984)

Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs. - Oscar H. Ibarra; Sam M. Kim; Louis E. Rosier (ICALP, 1984)

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract). - Oscar H. Ibarra; Louis E. Rosier (MFCS, 1984)

A Note on the Complexity of Program Evaluation. - Oscar H. Ibarra; Brian S. Leininger; Louis E. Rosier (Math. Syst. Theory, 1984)

Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines. - Louis E. Rosier; Hsu-Chun Yen (STACS, 1985)

Some Characterizations of Multihead Finite Automata - Oscar H. Ibarra; Sam M. Kim; Louis E. Rosier (Inf. Control., 1985)

On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's - Oscar H. Ibarra; Sam M. Kim; Louis E. Rosier (Inf. Control., 1985)

A note on Parikh maps, abstract languages, and decision problems. - Alfred E. Borm; Louis E. Rosier (Inf. Sci., 1985)

Priority Networks of Communicating Finite State Machines. - Mohamed G. Gouda; Louis E. Rosier (SIAM J. Comput., 1985)

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs - Oscar H. Ibarra; Louis E. Rosier (Inf. Control., 1985)

On Simple Programs with Primitive Conditional Statements - Oscar H. Ibarra; Louis E. Rosier (Inf. Control., 1985)

Recent results on the complexity of problems related to Petri nets. - Rodney R. Howell; Louis E. Rosier (European Workshop on Applications and Theory of Petri Nets, 1986)

A Note on Presburger Arithmetic with Array Segments, Permutation and Equality. - Louis E. Rosier (Inf. Process. Lett., 1986)

A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems. - Louis E. Rosier; Hsu-Chun Yen (J. Comput. Syst. Sci., 1986)

Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States. - Rodney R. Howell; Louis E. Rosier; Dung T. Huynh; Hsu-Chun Yen (Theor. Comput. Sci., 1986)

Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata. - Louis E. Rosier; Hsu-Chun Yen (Theor. Comput. Sci., 1986)

A Survey on the Decidability Questions for Classes of FIFO Nets. - Alain Finkel; Louis E. Rosier (European Workshop on Applications and Theory of Petri Nets, 1987)

On Questions of Fairness and Temporal Logic for Conflict- Free Petri Nets. - Rodney R. Howell; Louis E. Rosier (European Workshop on Applications and Theory of Petri Nets, 1987)

Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems. - Rodney R. Howell; Louis E. Rosier (ICALP, 1987)

An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems. - Rodney R. Howell; Louis E. Rosier; Hsu-Chun Yen (Inf. Process. Lett., 1987)

An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines. - Rodney R. Howell; Louis E. Rosier (J. Comput. Syst. Sci., 1987)

Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines. - Louis E. Rosier; Hsu-Chun Yen (SIAM J. Comput., 1987)

Completeness Results for Conflict-Free Vector Replacement Systems. - Rodney R. Howell; Louis E. Rosier (J. Comput. Syst. Sci., 1988)

On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs. - Louis E. Rosier; Hsu-Chun Yen (Theor. Comput. Sci., 1988)

System Simulation and the Sensitivity of Self-Stabilization. - Mohamed G. Gouda; Rodney R. Howell; Louis E. Rosier (MFCS, 1989)

Pinwheel Scheduling With Tow Distinct Numbers. - Robert Holte; Louis E. Rosier; Igor Tulchinsky; Donald A. Varvel (MFCS, 1989)

Algorithms and complexity of the periodic maintenance problem. - Al Mok; Louis E. Rosier; Igor Tulchinsky; Donald A. Varvel (Microprocessing and Microprogramming, 1989)

Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets. - Rodney R. Howell; Louis E. Rosier (Theor. Comput. Sci., 1989)

On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. - Sanjoy K. Baruah; Rodney R. Howell; Louis E. Rosier (MFCS, 1990)

Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor. - Sanjoy K. Baruah; Aloysius K. Mok; Louis E. Rosier (RTSS, 1990)

The Instability of Self-Stabilization. - Mohamed G. Gouda; Rodney R. Howell; Louis E. Rosier (Acta Informatica, 1990)

Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. - Sanjoy K. Baruah; Louis E. Rosier; Rodney R. Howell (Real Time Syst., 1990)

Static and dynamic scheduling of sporadic tasks for single-processor systems. - Sanjoy K. Baruah; Louis E. Rosier; Donald A. Varvel (RTS, 1991)

On-line Scheduling in the Presence of Overload - Sanjoy K. Baruah; Gilad Koren; Bhubaneswar Mishra; Arvind Raghunathan; Louis E. Rosier; Dennis E. Shasha (FOCS, 1991)

Single-Path Petri Nets. - Rodney R. Howell; Petr Jancar; Louis E. Rosier (MFCS, 1991)

Global and Local Views of State Fairness. - Rodney R. Howell; Louis E. Rosier; Hsu-Chun Yen (Theor. Comput. Sci., 1991)

A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. - Rodney R. Howell; Louis E. Rosier; Hsu-Chun Yen (Theor. Comput. Sci., 1991)

On the Competitiveness of On-Line Real-Time Task Scheduling. - Sanjoy K. Baruah; Gilad Koren; Decao Mao; Bhubaneswar Mishra; Arvind Raghunathan; Louis E. Rosier; Dennis E. Shasha; Fuxing Wang (Real Time Syst., 1992)

Pinwheel Scheduling with Two Distinct Numbers. - Robert Holte; Louis E. Rosier; Igor Tulchinsky; Donald A. Varvel (Theor. Comput. Sci., 1992)

Normal and Sinkless Petri Nets. - Rodney R. Howell; Louis E. Rosier; Hsu-Chun Yen (J. Comput. Syst. Sci., 1993)

Feasibility Problems for Recurring Tasks on one Processor. - Sanjoy K. Baruah; Rodney R. Howell; Louis E. Rosier (Theor. Comput. Sci., 1993)

Completeness Results for Single-Path Petri Nets - Rodney R. Howell; Petr Jancar; Louis E. Rosier (Inf. Comput., 1993)

Bounded Self-Stabilizing Petri Nets. - Ludmila Cherkasova; Rodney R. Howell; Louis E. Rosier (Acta Informatica, 1995)

An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related to Pinwheel Scheduling. - Theodore H. Romer; Louis E. Rosier (Algorithmica, 1997)