default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRodney R. Howell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b1]Rodney R. Howell:
Algorithms - A Top-Down Approach. WorldScientific 2023, ISBN 9789811263835, pp. 1-612
2010 – 2019
- 2012
- [c14]Rodney R. Howell:
Computing First-to-First Propagation Delays through Sequences of Fixed-Priority Periodic Tasks. ECRTS 2012: 343-352 - 2010
- [c13]Rodney R. Howell
, Masaaki Mizuno:
Propagation Delays in Fixed-Priority Scheduling of Periodic Tasks. ECRTS 2010: 219-228
2000 – 2009
- 2002
- [j16]Rodney R. Howell, Mikhail Nesterenko, Masaaki Mizuno:
Finite-State Self-Stabilizing Protocols in Message-Passing Systems. J. Parallel Distributed Comput. 62(5): 792-817 (2002)
1990 – 1999
- 1999
- [c12]Rodney R. Howell, Mikhail Nesterenko, Masaaki Mizuno:
Finite-state self-stabilizing protocols in message-passing systems. WSS 1999: 62-69 - 1995
- [j15]Ludmila Cherkasova, Rodney R. Howell, Louis E. Rosier:
Bounded Self-Stabilizing Petri Nets. Acta Informatica 32(3): 189-207 (1995) - [j14]Rodney R. Howell, Muralidhar K. Venkatrao:
On Non-Preemptive Scheduling of Recurring Tasks Using Inserted Idle Times. Inf. Comput. 117(1): 50-62 (1995) - 1993
- [j13]Rodney R. Howell, Petr Jancar, Louis E. Rosier:
Completeness Results for Single-Path Petri Nets. Inf. Comput. 106(2): 253-265 (1993) - [j12]Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
Normal and Sinkless Petri Nets. J. Comput. Syst. Sci. 46(1): 1-26 (1993) - [j11]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) - 1991
- [j10]Rodney R. Howell:
The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets. Inf. Process. Lett. 39(6): 309-315 (1991) - [j9]Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
Global and Local Views of State Fairness. Theor. Comput. Sci. 80(1): 77-104 (1991) - [j8]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) - [c11]Ludmila Cherkasova, Rodney R. Howell, Louis E. Rosier:
Bounded Self-Stabilizing Petri Nets. Applications and Theory of Petri Nets 1991: 26-50 - [c10]Rodney R. Howell, Petr Jancar, Louis E. Rosier:
Single-Path Petri Nets. MFCS 1991: 202-210 - 1990
- [j7]Mohamed G. Gouda, Rodney R. Howell, Louis E. Rosier:
The Instability of Self-Stabilization. Acta Informatica 27(8): 697-724 (1990) - [j6]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) - [c9]Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier:
On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. MFCS 1990: 173-179
1980 – 1989
- 1989
- [j5]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) - [c8]Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
Normal and Sinkless Petri Nets. FCT 1989: 234-243 - [c7]Mohamed G. Gouda, Rodney R. Howell, Louis E. Rosier:
System Simulation and the Sensitivity of Self-Stabilization. MFCS 1989: 249-258 - 1988
- [j4]Rodney R. Howell, Louis E. Rosier:
Completeness Results for Conflict-Free Vector Replacement Systems. J. Comput. Syst. Sci. 37(3): 349-366 (1988) - [c6]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
- [j3]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) - [j2]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) - [c5]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 - [c4]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 - [c3]Rodney R. Howell:
On the Complexity of Containment, Equivalence and Reachability for Finite and 2-Dimensional Vector Addition Systems with States. STACS 1987: 360-370 - 1986
- [j1]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) - [c2]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 - [c1]Rodney R. Howell, Louis E. Rosier:
An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines. MFCS 1986: 422-430
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 22:45 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:
