Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

C. L. Liu, J. W. Layland · Journal of the ACM · 1973 · 8.3K citations · Full text

Computing, Computer Engineering, Computer Science +16

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

The Art of Computer Programming

G.E. Whitesides · Nuclear Science and Engineering · 1970 · 6.1K citations

Computing, Computer Science, Computer Systems +7

Integer Programming with a Fixed Number of Variables

H. W. Lenstra · Mathematics of Operations Research · 1983 · 1.4K citations

Natural Sciences, Computer Science, Mathematics +12

On the complexity of fixed-priority scheduling of periodic, real-time tasks

Joseph Y.‐T. Leung, Jennifer Whitehead · Performance Evaluation · 1982 · 1.1K citations

Computing, Computer Engineering, Computer Science +14