References
- Conway , R. W. , Maxwell , W. L. and Miller , L. W. 1967 . Theory of Scheduling , Reading , MA : Addison-Wesley Publishing Company .
- Flajolet , P. , Gardy , D. and Thimonier , L. 1992 . Birthday paradox, coupon collectors, caching algorithms and self-organizing search . Discrete Appl. Math. , 39 : 207 – 229 . (doi:10.1016/0166-218X(92)90177-C)
- Graham , R. , Lawler , E. , Lenstra , J. and Kan , A. 1979 . Optimization and approximation in deterministic sequencing and scheduling: A survey . Ann. Discrete Math. , 5 : 287 – 326 . (doi:10.1016/S0167-5060(08)70356-X)
- Horwitz , L. P. , Karp , R. M. , Miller , R. E. and Winograd , S. 1966 . Index register allocation . J. ACM , 13 : 43 – 61 . (doi:10.1145/321312.321317)
- Maier , D. 1978 . The complexity of some problems on subsequences and supersequences . J. ACM , 25 : 322 – 336 . (doi:10.1145/322063.322075)
- F.M.Q. Pereira, A survey on register allocation (2008). Available at http://compilers.cs.ucla.edu/fernando/publications/drafts/survey.pdf.
- Reidenbach , D. and Schmid , M. L. A polynomial time match test for large classes of extended regular expressions . Proceedings 15th International Conference on Implementation and Application of Automata, CIAA 2010 . August 12–15 2010 . Edited by: Domaratzki , M. and Salomaa , K. pp. 241 – 250 . Berlin , , MB, Canada : Springer . Lecture Notes in Computer Science, Vol. 6482