The following pages link to Theodore P. Baker (Q842725):
Displaying 19 items.
- (Q704046) (redirect page) (← links)
- Real time scheduling theory: A historical perspective (Q704048) (← links)
- EDZL scheduling analysis (Q842727) (← links)
- An analysis of fixed-priority schedulability on a multiprocessor (Q853595) (← links)
- An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems (Q1039307) (← links)
- Extending lookahead for LR parsers (Q1157920) (← links)
- ``Natural'' properties of flowchart step-counting measures (Q1242679) (← links)
- A second step toward the polynomial hierarchy (Q1253656) (← links)
- Schedulability analysis of global EDF (Q2479890) (← links)
- A One-Pass Algorithm for Overload Resolution in Ada (Q3954813) (← links)
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question (Q4086709) (← links)
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension (Q4168066) (← links)
- On “provable” analogs of and (Q4191606) (← links)
- (Q4197341) (← links)
- (Q4750641) (← links)
- (Q4770003) (← links)
- On Simple Goedel Numberings and Translations (Q5180402) (← links)
- (Q5311853) (← links)
- Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks (Q5386255) (← links)
