Louis E. Rosier

Louis E. Rosier, Robert C. Holte, Igor Tulchinsky, 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track.

A note on the complexity of program evaluation

Oscar H. Ibarra, Louis E. Rosier, Brian S. Leininger, 1984, Mathematical systems theory.

An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines

Rodney R. Howell, Louis E. Rosier, Rodney R. Howell, 1985, J. Comput. Syst. Sci..

Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets

Rodney R. Howell, Louis E. Rosier, Rodney R. Howell, 1989, Theor. Comput. Sci..

Single-Path Petri Nets

Rodney R. Howell, Louis E. Rosier, Petr Jancar, 1991, MFCS.

Feasibility Problems for Recurring Tasks on one Processor

Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier, 1993, Theor. Comput. Sci..

A multiparameter analysis of the boundedness problem for vector addition systems

Hsu-Chun Yen, Louis E. Rosier, 1985, FCT.

Pinwheel Scheduling With Tow Distinct Numbers

Louis E. Rosier, Robert C. Holte, Igor Tulchinsky, 1989, MFCS.

An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines

Rodney R. Howell, Louis E. Rosier, 1987, J. Comput. Syst. Sci..

Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines

Hsu-Chun Yen, Louis E. Rosier, 1987, SIAM J. Comput..

On restricted one-counter machines

Oscar H. Ibarra, Louis E. Rosier, 2005, Mathematical systems theory.

On Deciding Progress for a Class of Communication Protocols

Mohamed G. Gouda, Louis E. Rosier, M. Gouda, 1983 .

DECIDING PROGRESS FOR A CLASS OF COMMUNICATING FINITE STATE MACHINES.

Mohamed G. Gouda, Louis E. Rosier, 1984 .

On-line scheduling in the presence of overload

Sanjoy K. Baruah, Dennis Shasha, Bud Mishra, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier, 1990, Real-Time Systems.

Completeness Results for Single-Path Petri Nets

Rodney R. Howell, Louis E. Rosier, Petr Jancar, 1993, Inf. Comput..

Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems

Rodney R. Howell, Louis E. Rosier, Rodney R. Howell, 1987, ICALP.

A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets

Hsu-Chun Yen, Rodney R. Howell, Louis E. Rosier, 1988, Theoretical Computer Science.

On deadlock detection in systems of communicating finite state machines

Mohamed G. Gouda, Louis E. Rosier, E. M. Gurari, 1987 .

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract)

Oscar H. Ibarra, Louis E. Rosier, O. Ibarra, 1984, MFCS.

On Questions of Fairness and Temporal Logic for Conflict- Free Petri Nets

Rodney R. Howell, Louis E. Rosier, Rodney R. Howell, 1988, European Workshop on Applications and Theory of Petri Nets.

Communicating Finite State Machines with Priority Channnels

Mohamed G. Gouda, Louis E. Rosier, 1984, ICALP.

On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's

Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier, 1986, Inf. Control..

Bounded self-stabilizing Petri nets

Ludmila Cherkasova, Rodney R. Howell, Louis E. Rosier, 2005, Acta Informatica.

Normal and Sinkless Petri Nets

Hsu-Chun Yen, Rodney R. Howell, Louis E. Rosier, 1993, J. Comput. Syst. Sci..

Completeness Results for Conflict-Free Vector Replacement Systems

Rodney R. Howell, Louis E. Rosier, Rodney R. Howell, 1988, J. Comput. Syst. Sci..

Priority Networks of Communicating Finite State Machines

Mohamed G. Gouda, Louis E. Rosier, 1985, SIAM J. Comput..

A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets

Hsu-Chun Yen, Rodney R. Howell, Louis E. Rosier, 1991, Theor. Comput. Sci..

Simple Programming Languages and Restricted Classes of Turing Machines

Oscar H. Ibarra, Louis E. Rosier, 1983, Theor. Comput. Sci..

On the Decidability of Equivalence for Deterministic Pushdown Transducers

Oscar H. Ibarra, Louis E. Rosier, 1981, Inf. Process. Lett..

Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States

Hsu-Chun Yen, Rodney R. Howell, Louis E. Rosier, 1986, Theor. Comput. Sci..

Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems

Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier, 1981, Information Processing Letters.

An algorithm reminiscent of euclidean-gcd for computing a function related to pinwheel scheduling

Louis E. Rosier, Theodore H. Romer, T. Romer, 2006, Algorithmica.

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs

Oscar H. Ibarra, Louis E. Rosier, O. Ibarra, 1985, Inf. Control..

The Boundedness Problem for Conflict-Free Vector Replacement Systems IsPtime-complete

Rodney R. Howell, Louis E. Rosier, Hsu Yen, 1986 .

Algorithms and complexity of the periodic maintenance problem

Louis E. Rosier, Igor Tulchinsky, Donald A. Varvel, 1989, Microprocessing and Microprogramming.

Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs

Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier, 1984, ICALP.

A Note on the Parallel Complexity of Computing the Rank of Order n Matrices

Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier, 1980, Inf. Process. Lett..

The instability of self-stabilization

Mohamed G. Gouda, Rodney R. Howell, Louis E. Rosier, 1990, Acta Informatica.

A Survey on the Decidability Questions for Classes of FIFO Nets

Alain Finkel, Louis E. Rosier, A. Finkel, 1988, European Workshop on Applications and Theory of Petri Nets.

A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems

Hsu-Chun Yen, Louis E. Rosier, L. Rosier, 1985, J. Comput. Syst. Sci..

A Note on Presburger Arithmetic with Array Segments, Permutation and Equality

Louis E. Rosier, 1986, Inf. Process. Lett..

Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines

Hsu-Chun Yen, Louis E. Rosier, 1985, STACS.

A note on Parikh maps, abstract languages, and decision problems

Louis E. Rosier, Alfred E. Borm, 1985, Inf. Sci..

Normal and Sinkless Petri Nets

Hsu-Chun Yen, Rodney R. Howell, Louis E. Rosier, 1989, J. Comput. Syst. Sci..

Recent results on the complexity of problems related to Petri nets

Rodney R. Howell, Louis E. Rosier, Rodney R. Howell, 1986, European Workshop on Applications and Theory of Petri Nets.

On the Control Power of Integer Division

Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier, 1983, Theor. Comput. Sci..

On the competitiveness of on-line real-time task scheduling

Sanjoy K. Baruah, Dennis Shasha, Bud Mishra, 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

Preemptively scheduling hard-real-time sporadic tasks on one processor

Sanjoy K. Baruah, Aloysius K. Mok, Louis E. Rosier, 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

Bounded self-stabilizing Petri nets

Ludmila Cherkasova, Louis E. Rosier, Rodney R. Howell, 1995 .