default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLouis E. Rosier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
[j35]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
- [j34]Ludmila Cherkasova, Rodney R. Howell, Louis E. Rosier:
Bounded Self-Stabilizing Petri Nets. Acta Informatica 32(3): 189-207 (1995) - 1993
- [j33]Rodney R. Howell, Petr Jancar
, Louis E. Rosier:
Completeness Results for Single-Path Petri Nets. Inf. Comput. 106(2): 253-265 (1993) - [j32]Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
Normal and Sinkless Petri Nets. J. Comput. Syst. Sci. 46(1): 1-26 (1993) - [j31]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
- [j30]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): 125-144 (1992) - [j29]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
- [j28]Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
Global and Local Views of State Fairness. Theor. Comput. Sci. 80(1): 77-104 (1991) - [j27]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) - [c23]Ludmila Cherkasova, Rodney R. Howell, Louis E. Rosier:
Bounded Self-Stabilizing Petri Nets. Applications and Theory of Petri Nets 1991: 26-50 - [c22]Sanjoy K. Baruah, Louis E. Rosier, Donald A. Varvel:
Static and dynamic scheduling of sporadic tasks for single-processor systems. RTS 1991: 100-105 - [c21]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: 100-110 - [c20]Rodney R. Howell, Petr Jancar, Louis E. Rosier:
Single-Path Petri Nets. MFCS 1991: 202-210 - [c19]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: 106-115 - 1990
- [j26]Mohamed G. Gouda, Rodney R. Howell, Louis E. Rosier:
The Instability of Self-Stabilization. Acta Informatica 27(8): 697-724 (1990) - [j25]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): 301-324 (1990) - [c18]Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier:
On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. MFCS 1990: 173-179 - [c17]Sanjoy K. Baruah, Aloysius K. Mok, Louis E. Rosier:
Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor. RTSS 1990: 182-190
1980 – 1989
- 1989
- [j24]Al Mok, Louis E. Rosier, Igor Tulchinsky, Donald A. Varvel:
Algorithms and complexity of the periodic maintenance problem. Microprocessing and Microprogramming 27(1-5): 657-664 (1989) - [j23]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) - [c16]Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
Normal and Sinkless Petri Nets. FCT 1989: 234-243 - [c15]Mohamed G. Gouda, Rodney R. Howell, Louis E. Rosier:
System Simulation and the Sensitivity of Self-Stabilization. MFCS 1989: 249-258 - [c14]Robert Holte, Louis E. Rosier, Igor Tulchinsky, Donald A. Varvel:
Pinwheel Scheduling With Tow Distinct Numbers. MFCS 1989: 281-290 - 1988
- [j22]Rodney R. Howell, Louis E. Rosier:
Completeness Results for Conflict-Free Vector Replacement Systems. J. Comput. Syst. Sci. 37(3): 349-366 (1988) - [j21]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) - [c13]Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. MFCS 1988: 351-359 - 1987
- [j20]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) - [j19]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) - [j18]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) - [c12]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 - [c11]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 - [c10]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 - 1986
- [j17]Louis E. Rosier:
A Note on Presburger Arithmetic with Array Segments, Permutation and Equality. Inf. Process. Lett. 22(1): 33-35 (1986) - [j16]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) - [j15]Louis E. Rosier, Hsu-Chun Yen:
Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata. Theor. Comput. Sci. 44: 69-105 (1986) - [j14]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) - [c9]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 - [c8]Louis E. Rosier, Hsu-Chun Yen:
On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs. ICALP 1986: 334-343 - [c7]Rodney R. Howell, Louis E. Rosier:
An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines. MFCS 1986: 422-430 - [c6]Louis E. Rosier, Hsu-Chun Yen:
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines. STACS 1986: 306-320 - 1985
- [j13]Oscar H. Ibarra, Louis E. Rosier:
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs. Inf. Control. 65(1): 18-41 (1985) - [j12]Oscar H. Ibarra, Louis E. Rosier:
On Simple Programs with Primitive Conditional Statements. Inf. Control. 65(1): 42-62 (1985) - [j11]Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier:
Some Characterizations of Multihead Finite Automata. Inf. Control. 67(1-3): 114-125 (1985) - [j10]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): 126-143 (1985) - [j9]Alfred E. Borm, Louis E. Rosier:
A note on Parikh maps, abstract languages, and decision problems. Inf. Sci. 35(2): 157-166 (1985) - [j8]Mohamed G. Gouda, Louis E. Rosier:
Priority Networks of Communicating Finite State Machines. SIAM J. Comput. 14(3): 569-584 (1985) - [c5]Louis E. Rosier, Hsu-Chun Yen:
A multiparameter analysis of the boundedness problem for vector addition systems. FCT 1985: 361-370 - [c4]Louis E. Rosier, Hsu-Chun Yen:
Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines. STACS 1985: 287-298 - 1984
- [j7]Oscar H. Ibarra, Brian S. Leininger, Louis E. Rosier:
A Note on the Complexity of Program Evaluation. Math. Syst. Theory 17(2): 85-96 (1984) - [c3]Mohamed G. Gouda, Louis E. Rosier:
Communicating Finite State Machines with Priority Channnels. ICALP 1984: 209-221 - [c2]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 - [c1]Oscar H. Ibarra, Louis E. Rosier:
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract). MFCS 1984: 330-338 - 1983
- [j6]Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier:
On the Control Power of Integer Division. Theor. Comput. Sci. 24: 35-52 (1983) - [j5]Oscar H. Ibarra, Louis E. Rosier:
Simple Programming Languages and Restricted Classes of Turing Machines. Theor. Comput. Sci. 26: 197-220 (1983) - 1981
- [j4]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) - [j3]Oscar H. Ibarra, Louis E. Rosier:
On the Decidability of Equivalence for Deterministic Pushdown Transducers. Inf. Process. Lett. 13(3): 89-93 (1981) - [j2]Oscar H. Ibarra, Louis E. Rosier:
On Restricted One-counter Machines. Math. Syst. Theory 14: 241-245 (1981) - 1980
- [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
