A twist on Erdös Numbers
- De Bruijn, N.G., Knuth, D.E., and Rice, S.O., The average height of planted plane trees, In Graph Theory and Computing (1972), R.C. Read, Ed., Academic Press, 15--22.
- P. Erdos and N.G. de Bruijn, A colour problem for infinite graphs and a problem in the theory of relations, Nederl. Akad. Wetensch. Proc. -- Indagationes Math. 13 (1951), 369--373.
- P Erdös, R Graham On a Linear Diophantine Problem of Frobenius, Acta Arithmetica 21 (1972), 399-408.
- R Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Annals of Dis. Math. 5 (1979), 169-231.
- MAH Dempster, ML Fisher, L Jansen, B J Lagewag, J K Lenstra, A H G Rinnooy
Kan, "Analysis of Heuristics for Stochastic Programming: Results for
Hierarchical Scheduling Problems", Maths of Operations Res., 8.4 (1983)
525-537.
- R G Bates, MAH Dempster, Y S Romahi, "Evolutionary reinforcement learning
in FX order book and order flow analysis". In IEEE Neural Networks Council
Staff (eds.) Proceedings of the International Conference on Computational
Intelligence for Financial Engineering (CIFEr), 21-23 March 2003, Hong
Kong. Piscataway NJ: IEEE Standards Office (2003) 355-362.
Courtesy of the Erdös Number Project.