1. A. Akavia, R. LaVigne, T. Moran, Topology-hiding computation on all graphs, in Advances in Cryptology—CRYPTO 2017—37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20–24, 2017, Proceedings, Part I (2017), pp. 447–467
2. A. Akavia, T. Moran, Topology-hiding computation beyond logarithmic diameter, in Advances in Cryptology—EUROCRYPT 2017—36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30–May 4, 2017, Proceedings, Part III (2017), pp. 609–637
3. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in Proceedings of the 20th Annual Symposium on Foundations of Computer Science, SFCS ’79 (IEEE Computer Society, Washington, DC, USA, 1979), pp. 218–223
4. M. Ball, E. Boyle, T. Malkin, T. Moran, Exploring the boundaries of topology-hiding computation, in Advances in Cryptology—EUROCRYPT 2018—37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29–May 3, 2018 Proceedings, Part III (2018), pp. 294–325
5. J. Balogh, B. Bollobs, M. Krivelevich, T. Mller, M. Walters. Hamilton cycles in random geometric graphs. Ann. Appl. Probab.21(3), 1053–1072 (2011)