Louis E. Rosier

Publication Activity (10 Years)

Years Active: 1980-1997
Publications (10 Years): 0

Publications

Theodore H. Romer, Louis E. Rosier
An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related to Pinwheel Scheduling. Algorithmica 17 (1) (1997)
Ludmila Cherkasova, Rodney R. Howell, Louis E. Rosier
Bounded Self-Stabilizing Petri Nets. Acta Informatica 32 (3) (1995)
Rodney R. Howell, Petr Jancar, Louis E. Rosier
Completeness Results for Single-Path Petri Nets Inf. Comput. 106 (2) (1993)
Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
Normal and Sinkless Petri Nets. J. Comput. Syst. Sci. 46 (1) (1993)
Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier
Feasibility Problems for Recurring Tasks on one Processor. Theor. Comput. Sci. 118 (1) (1993)
Sanjoy K. Baruah, Gilad Koren, Decao Mao, Bhubaneswar Mishra, Arvind Raghunathan, Louis E. Rosier, Dennis E. Shasha, Fuxing Wang
On the Competitiveness of On-Line Real-Time Task Scheduling. Real Time Syst. 4 (2) (1992)
Robert Holte, Louis E. Rosier, Igor Tulchinsky, Donald A. Varvel
Pinwheel Scheduling with Two Distinct Numbers. Theor. Comput. Sci. 100 (1) (1992)
Sanjoy K. Baruah, Louis E. Rosier, Donald A. Varvel
Static and dynamic scheduling of sporadic tasks for single-processor systems. RTS (1991)
Rodney R. Howell, Petr Jancar, Louis E. Rosier
Single-Path Petri Nets. MFCS (1991)
Sanjoy K. Baruah, Gilad Koren, Bhubaneswar Mishra, Arvind Raghunathan, Louis E. Rosier, Dennis E. Shasha
On-line Scheduling in the Presence of Overload FOCS (1991)
Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
Global and Local Views of State Fairness. Theor. Comput. Sci. 80 (1) (1991)
Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. Theor. Comput. Sci. 82 (2) (1991)
Sanjoy K. Baruah, Gilad Koren, Decao Mao, Bud Mishra, Arvind Raghunathan, Louis E. Rosier, Dennis E. Shasha, Fuxing Wang
On the competitiveness of on-line real-time task scheduling. RTSS (1991)
Ludmila Cherkasova, Rodney R. Howell, Louis E. Rosier
Bounded Self-Stabilizing Petri Nets. Applications and Theory of Petri Nets (1991)
Sanjoy K. Baruah, Aloysius K. Mok, Louis E. Rosier
Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor. RTSS (1990)
Mohamed G. Gouda, Rodney R. Howell, Louis E. Rosier
The Instability of Self-Stabilization. Acta Informatica 27 (8) (1990)
Sanjoy K. Baruah, Louis E. Rosier, Rodney R. Howell
Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. Real Time Syst. 2 (4) (1990)
Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier
On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. MFCS (1990)
Al Mok, Louis E. Rosier, Igor Tulchinsky, Donald A. Varvel
Algorithms and complexity of the periodic maintenance problem. Microprocessing and Microprogramming 27 (1-5) (1989)
Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
Normal and Sinkless Petri Nets. FCT (1989)
Mohamed G. Gouda, Rodney R. Howell, Louis E. Rosier
System Simulation and the Sensitivity of Self-Stabilization. MFCS (1989)
Rodney R. Howell, Louis E. Rosier
Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets. Theor. Comput. Sci. 64 (3) (1989)
Robert Holte, Louis E. Rosier, Igor Tulchinsky, Donald A. Varvel
Pinwheel Scheduling With Tow Distinct Numbers. MFCS (1989)
Rodney R. Howell, Louis E. Rosier
Completeness Results for Conflict-Free Vector Replacement Systems. J. Comput. Syst. Sci. 37 (3) (1988)
Louis E. Rosier, Hsu-Chun Yen
On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs. Theor. Comput. Sci. 58 (1988)
Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. MFCS (1988)
Louis E. Rosier, Hsu-Chun Yen
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines. SIAM J. Comput. 16 (5) (1987)
Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems. Inf. Process. Lett. 25 (1) (1987)
Rodney R. Howell, Louis E. Rosier
Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems. ICALP (1987)
Alain Finkel, Louis E. Rosier
A Survey on the Decidability Questions for Classes of FIFO Nets. European Workshop on Applications and Theory of Petri Nets (1987)
Rodney R. Howell, Louis E. Rosier
An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines. J. Comput. Syst. Sci. 34 (1) (1987)
Rodney R. Howell, Louis E. Rosier
On Questions of Fairness and Temporal Logic for Conflict- Free Petri Nets. European Workshop on Applications and Theory of Petri Nets (1987)
Rodney R. Howell, Louis E. Rosier
An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines. MFCS (1986)
Rodney R. Howell, Louis E. Rosier
Recent results on the complexity of problems related to Petri nets. European Workshop on Applications and Theory of Petri Nets (1986)
Rodney R. Howell, Louis E. Rosier, Dung T. Huynh, Hsu-Chun Yen
Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States. Theor. Comput. Sci. 46 (3) (1986)
Louis E. Rosier, Hsu-Chun Yen
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines. STACS (1986)
Louis E. Rosier, Hsu-Chun Yen
On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs. ICALP (1986)
Louis E. Rosier, Hsu-Chun Yen
A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems. J. Comput. Syst. Sci. 32 (1) (1986)
Louis E. Rosier
A Note on Presburger Arithmetic with Array Segments, Permutation and Equality. Inf. Process. Lett. 22 (1) (1986)
Louis E. Rosier, Hsu-Chun Yen
Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata. Theor. Comput. Sci. 44 (1986)
Louis E. Rosier, Hsu-Chun Yen
Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines. STACS (1985)
Oscar H. Ibarra, Louis E. Rosier
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs Inf. Control. 65 (1) (1985)
Alfred E. Borm, Louis E. Rosier
A note on Parikh maps, abstract languages, and decision problems. Inf. Sci. 35 (2) (1985)
Louis E. Rosier, Hsu-Chun Yen
A multiparameter analysis of the boundedness problem for vector addition systems. FCT (1985)
Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier
Some Characterizations of Multihead Finite Automata Inf. Control. 67 (1-3) (1985)
Mohamed G. Gouda, Louis E. Rosier
Priority Networks of Communicating Finite State Machines. SIAM J. Comput. 14 (3) (1985)
Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier
On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's Inf. Control. 67 (1-3) (1985)
Oscar H. Ibarra, Louis E. Rosier
On Simple Programs with Primitive Conditional Statements Inf. Control. 65 (1) (1985)
Oscar H. Ibarra, Louis E. Rosier
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract). MFCS (1984)
Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier
Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs. ICALP (1984)
Mohamed G. Gouda, Louis E. Rosier
Communicating Finite State Machines with Priority Channnels. ICALP (1984)
Oscar H. Ibarra, Brian S. Leininger, Louis E. Rosier
A Note on the Complexity of Program Evaluation. Math. Syst. Theory 17 (2) (1984)
Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier
On the Control Power of Integer Division. Theor. Comput. Sci. 24 (1983)
Oscar H. Ibarra, Louis E. Rosier
Simple Programming Languages and Restricted Classes of Turing Machines. Theor. Comput. Sci. 26 (1983)
Oscar H. Ibarra, Louis E. Rosier
On Restricted One-counter Machines. Math. Syst. Theory 14 (1981)
Oscar H. Ibarra, Louis E. Rosier
On the Decidability of Equivalence for Deterministic Pushdown Transducers. Inf. Process. Lett. 13 (3) (1981)
Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier
Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems. Inf. Process. Lett. 12 (5) (1981)
Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier
A Note on the Parallel Complexity of Computing the Rank of Order n Matrices. Inf. Process. Lett. 11 (4/5) (1980)