Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Information Systems
Reference11 articles.
1. Aho AV, Johnson DS, Karp RM, Rao Kosaraju S, McGeoch CC, Papadimitriou CH, Pevzner P (1997) Emerging opportunities for theoretical computer science. SIGACT News 28(3):65–74
2. Beier R, Vöcking B (2003) Random knapsack in expected polynomial time. In: 35th ACM Symposium on Theory of Computing
3. Beth T, Clausen M (eds) (1988) Applied algebra, algebraic algorithms and error-correcting codes. In: Proceedings of the 4th International Conference, AAECC-4, Karlsruhe, FRG, 23–26 September 1986, vol. 307 of Lecture Notes in Computer Science, Springer
4. Delling D, Sanders P, Schultes D, Wagner D (2009) Engineering route planning algorithms. In: Algorithmics of Large and Complex Networks, vol. 5515 of LNCS State-of-the-Art Survey, Springer, pp 117–139
5. Fleischer R, Moret B, Schmidt EM (eds) (2002) Experimental algorithmics: from algorithm design to robust and efficient software, vol. 2547 of LNCS, Springer