| 1997 |
|---|
| 55 | | Theodore H. Romer,
Louis E. Rosier:
An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related to Pinwheel Scheduling.
Algorithmica 17(1): 1-10 (1997) |
| 1995 |
|---|
| 54 | | Ludmila Cherkasova,
Rodney R. Howell,
Louis E. Rosier:
Bounded Self-Stabilizing Petri Nets
Acta Inf. 32(3): 189-207 (1995) |
| 1993 |
|---|
| 53 | | Rodney R. Howell,
Petr Jancar,
Louis E. Rosier:
Completeness Results for Single-Path Petri Nets
Inf. Comput. 106(2): 253-265 (1993) |
| 52 | | Rodney R. Howell,
Louis E. Rosier,
Hsu-Chun Yen:
Normal and Sinkless Petri Nets.
J. Comput. Syst. Sci. 46(1): 1-26 (1993) |
| 51 | | Sanjoy K. Baruah,
Rodney R. Howell,
Louis E. Rosier:
Feasibility Problems for Recurring Tasks on one Processor.
Theor. Comput. Sci. 118(1): 3-20 (1993) |
| 1992 |
|---|
| 50 | | Sanjoy K. Baruah,
Gilad Koren,
D. Mao,
Bhubaneswar Mishra,
Arvind Raghunathan,
Louis E. Rosier,
Dennis Shasha,
Fuxing Wang:
On the Competitiveness of On-Line Real-Time Task Scheduling.
Real-Time Systems 4(2): 125-144 (1992) |
| 49 | | Robert Holte,
Louis E. Rosier,
Igor Tulchinsky,
Donald A. Varvel:
Pinwheel Scheduling with Two Distinct Numbers.
Theor. Comput. Sci. 100(1): 105-135 (1992) |
| 1991 |
|---|
| 48 | | Ludmila Cherkasova,
Rodney R. Howell,
Louis E. Rosier:
Bounded Self-Stabilizing Petri Nets.
Applications and Theory of Petri Nets 1991: 26-50 |
| 47 | | Sanjoy K. Baruah,
Gilad Koren,
Bhubaneswar Mishra,
Arvind Raghunathan,
Louis E. Rosier,
Dennis Shasha:
On-line Scheduling in the Presence of Overload
FOCS 1991: 100-110 |
| 46 | | Rodney R. Howell,
Petr Jancar,
Louis E. Rosier:
Single-Path Petri Nets.
MFCS 1991: 202-210 |
| 45 | | Rodney R. Howell,
Louis E. Rosier,
Hsu-Chun Yen:
Global and Local Views of State Fairness.
Theor. Comput. Sci. 80(1): 77-104 (1991) |
| 44 | | 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): 341-372 (1991) |
| 1990 |
|---|
| 43 | | Sanjoy K. Baruah,
Aloysius K. Mok,
Louis E. Rosier:
Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor.
IEEE Real-Time Systems Symposium 1990: 182-190 |
| 42 | | Sanjoy K. Baruah,
Rodney R. Howell,
Louis E. Rosier:
On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor.
MFCS 1990: 173-179 |
| 41 | | 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 Systems 2(4): 301-324 (1990) |
| 1989 |
|---|
| 40 | | Rodney R. Howell,
Louis E. Rosier,
Hsu-Chun Yen:
Normal and Sinkless Petri Nets.
FCT 1989: 234-243 |
| 39 | | Mohamed G. Gouda,
Rodney R. Howell,
Louis E. Rosier:
System Simulation and the Sensitivity of Self-Stabilization.
MFCS 1989: 249-258 |
| 38 | | Robert Holte,
Louis E. Rosier,
Igor Tulchinsky,
Donald A. Varvel:
Pinwheel Scheduling With Tow Distinct Numbers.
MFCS 1989: 281-290 |
| 37 | | Mohamed G. Gouda,
Rodney R. Howell,
Louis E. Rosier:
The Instability of Self-Stabilization.
Acta Inf. 27(8): 697-724 (1989) |
| 36 | | Rodney R. Howell,
Louis E. Rosier:
Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets.
Theor. Comput. Sci. 64(3): 305-329 (1989) |
| 1988 |
|---|
| 35 | | Rodney R. Howell,
Louis E. Rosier,
Hsu-Chun Yen:
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets.
MFCS 1988: 351-359 |
| 34 | | Rodney R. Howell,
Louis E. Rosier:
Completeness Results for Conflict-Free Vector Replacement Systems.
J. Comput. Syst. Sci. 37(3): 349-366 (1988) |
| 33 | | Louis E. Rosier,
Hsu-Chun Yen:
On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs.
Theor. Comput. Sci. 58: 263-324 (1988) |
| 1987 |
|---|
| 32 | | 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: 106-132 |
| 31 | | 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: 200-226 |
| 30 | | Rodney R. Howell,
Louis E. Rosier:
Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems.
ICALP 1987: 509-520 |
| 29 | | 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): 27-33 (1987) |
| 28 | | 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): 55-74 (1987) |
| 27 | | Louis E. Rosier,
Hsu-Chun Yen:
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines.
SIAM J. Comput. 16(5): 779-807 (1987) |
| 1986 |
|---|
| 26 | | 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: 45-72 |
| 25 | | Louis E. Rosier,
Hsu-Chun Yen:
On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs.
ICALP 1986: 334-343 |
| 24 | | Rodney R. Howell,
Louis E. Rosier:
An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines.
MFCS 1986: 422-430 |
| 23 | | Louis E. Rosier,
Hsu-Chun Yen:
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines.
STACS 1986: 306-320 |
| 22 | | Louis E. Rosier:
A Note on Presburger Arithmetic with Array Segments, Permutation and Equality.
Inf. Process. Lett. 22(1): 33-35 (1986) |
| 21 | | Louis E. Rosier,
Hsu-Chun Yen:
A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems.
J. Comput. Syst. Sci. 32(1): 105-135 (1986) |
| 20 | | Louis E. Rosier,
Hsu-Chun Yen:
Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata.
Theor. Comput. Sci. 44: 69-105 (1986) |
| 19 | | 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): 107-140 (1986) |
| 1985 |
|---|
| 18 | | Louis E. Rosier,
Hsu-Chun Yen:
A multiparameter analysis of the boundedness problem for vector addition systems.
FCT 1985: 361-370 |
| 17 | | Louis E. Rosier,
Hsu-Chun Yen:
Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines.
STACS 1985: 287-298 |
| 16 | EE | Alfred E. Borm,
Louis E. Rosier:
A note on Parikh maps, abstract languages, and decision problems.
Inf. Sci. 35(2): 157-166 (1985) |
| 15 | | Oscar H. Ibarra,
Louis E. Rosier:
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs
Information and Control 65(1): 18-41 (1985) |
| 14 | | Oscar H. Ibarra,
Louis E. Rosier:
On Simple Programs with Primitive Conditional Statements
Information and Control 65(1): 42-62 (1985) |
| 13 | | Oscar H. Ibarra,
Sam M. Kim,
Louis E. Rosier:
Some Characterizations of Multihead Finite Automata
Information and Control 67(1-3): 114-125 (1985) |
| 12 | | Oscar H. Ibarra,
Sam M. Kim,
Louis E. Rosier:
On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's
Information and Control 67(1-3): 126-143 (1985) |
| 11 | | Mohamed G. Gouda,
Louis E. Rosier:
Priority Networks of Communicating Finite State Machines.
SIAM J. Comput. 14(3): 569-584 (1985) |
| 1984 |
|---|
| 10 | | Mohamed G. Gouda,
Louis E. Rosier:
Communicating Finite State Machines with Priority Channnels.
ICALP 1984: 209-221 |
| 9 | | Oscar H. Ibarra,
Sam M. Kim,
Louis E. Rosier:
Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs.
ICALP 1984: 247-259 |
| 8 | | Oscar H. Ibarra,
Louis E. Rosier:
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract).
MFCS 1984: 330-338 |
| 7 | | Oscar H. Ibarra,
Brian S. Leininger,
Louis E. Rosier:
A Note on the Complexity of Program Evaluation.
Mathematical Systems Theory 17(2): 85-96 (1984) |
| 1983 |
|---|
| 6 | | Oscar H. Ibarra,
Shlomo Moran,
Louis E. Rosier:
On the Control Power of Integer Division.
Theor. Comput. Sci. 24: 35-52 (1983) |
| 5 | | Oscar H. Ibarra,
Louis E. Rosier:
Simple Programming Languages and Restricted Classes of Turing Machines.
Theor. Comput. Sci. 26: 197-220 (1983) |
| 1981 |
|---|
| 4 | | Oscar H. Ibarra,
Shlomo Moran,
Louis E. Rosier:
Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems.
Inf. Process. Lett. 12(5): 227-232 (1981) |
| 3 | | Oscar H. Ibarra,
Louis E. Rosier:
On the Decidability of Equivalence for Deterministic Pushdown Transducers.
Inf. Process. Lett. 13(3): 89-93 (1981) |
| 2 | | Oscar H. Ibarra,
Louis E. Rosier:
On Restricted One-counter Machines.
Mathematical Systems Theory 14: 241-245 (1981) |
| 1980 |
|---|
| 1 | | 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): 162 (1980) |
