1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Andersson, A.: Faster deterministic sorting and searching in linear space. In: Proceedings of the 1996 IEEE International Conference on Foundations of Computer Science (FOCS’1996), pp. 135–141 (1996)
3. Andersson, A., Thorup, M.: Tight(er) worest-case bounds on dynamic searching and priority queues. In: Proceedings of the 2000 ACM Symposium on Theory of Computing STOC’2000, pp. 335–342 (2000)
4. Blum, L., Shub, M., Smale, M.: On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines. In: Proceedings of the 29th IEEE Symposium on Foundations of Computer Science (FOCS’1988), pp. 387–397 (1988)
5. Corman, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)