Author:
Khadiev Kamil,Yagafarov Maxim
Publisher
Springer Nature Singapore
Reference34 articles.
1. Ablayev, F., Ablayev, M., Khadiev, K., Vasiliev, A.: Classical and quantum computations with restricted memory. In: Böckenhauer, HJ., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes. LNCS, vol. 11011, pp. 129–155. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98355-4_9
2. Ahmed, A.R., Rahman, M.S., Kobourov, S.: Online facility assignment. Theoret. Comput. Sci. 806, 455–467 (2020)
3. Akagi, T., Nakano, S.i.: On r-gatherings on the line. In: Wang, J., Yap, C. (eds.) Frontiers in Algorithmics. FAW 2015. LNCS, vol. 9130, pp. 25–32. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19647-3_3
4. Alstrup, S., Holm, J.: Improved algorithms for finding level ancestors in dynamic trees. In: Automata, Languages and Programming: 27th International Colloquium, ICALP 2000, pp. 73–84 (2000)
5. Baliga, G.R., Shende, A.M.: On space bounded server algorithms. In: Proceedings of ICCI’93: 5th International Conference on Computing and Information, pp. 77–81. IEEE (1993)