1. [1] Martin Abadi, Mike Burrows, Mark Manasse, and Ted Wobber. Moderately hard, memory-bound functions. ACM Transactions on Internet Technology (TOIT), 5(2):299–327, 2005.
2. Foundations, Properties, and Security Applications of Puzzles
3. AdIDoS – Adaptive and Intelligent Fully-Automatic Detection of Denial-of-Service Weaknesses in Web Services
4. [4] Nikolas Askitis and Justin Zobel. Redesigning the string hash table, burst trie, and BST to exploit cache. Journal of Experimental Algorithmics (JEA), 15:1–1, 2011.
5. [5] James Aspnes and Gauri Shah. Skip graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 384–393, 2003.