# Louis E. Rosier

According to our database

Collaborative distances:

^{1}, Louis E. Rosier authored at least 49 papers between 1980 and 1997.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

1997

An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related to Pinwheel Scheduling.

Algorithmica, 1997

1995

Acta Informatica, 1995

1993

Inf. Comput., October, 1993

Theor. Comput. Sci., 1993

J. Comput. Syst. Sci., 1993

1992

Theor. Comput. Sci., 1992

Real Time Syst., 1992

1991

Theor. Comput. Sci., 1991

Theor. Comput. Sci., 1991

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Proceedings of the Euromicro '91 Workshop on Real Time Systems, 1991

1990

Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor.

Real Time Syst., 1990

Acta Informatica, 1990

Proceedings of the Real-Time Systems Symposium, 1990

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

Theor. Comput. Sci., 1989

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs.

Theor. Comput. Sci., 1988

J. Comput. Syst. Sci., 1988

1987

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

SIAM J. Comput., 1987

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

J. Comput. Syst. Sci., 1987

An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems.

Inf. Process. Lett., 1987

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

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Proceedings of the Advances in Petri Nets 1988, 1987

Proceedings of the Advances in Petri Nets 1988, 1987

1986

Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata.

Theor. Comput. Sci., 1986

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

Theor. Comput. Sci., 1986

J. Comput. Syst. Sci., 1986

Inf. Process. Lett., 1986

Proceedings of the Advances in Petri Nets 1987, 1986

1985

Inf. Control., April, 1985

Inf. Control., April, 1985

SIAM J. Comput., 1985

Inf. Sci., 1985

Inf. Control., 1985

Inf. Control., 1985

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

Proceedings of the STACS 85, 1985

1984

Math. Syst. Theory, 1984

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

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

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

Proceedings of the Automata, 1984

Proceedings of the Automata, 1984

1983

Theor. Comput. Sci., 1983

Theor. Comput. Sci., 1983

1981

Math. Syst. Theory, 1981

Inf. Process. Lett., 1981

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

Inf. Process. Lett., 1981

1980

Inf. Process. Lett., 1980