Публикации 2018-2021

• 2021
  • J. Doliskani, A. Narayanan, E. Schost : “Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields”, Journal of Symbolic Computation, vol. 105 (July–August 2021), pp. 199-213, (Elsevier) (2021)
• 2020
  • A. Narayanan, M. Weidner : “On Decoding Cohen-Haeupler-Schulman Tree Codes”, ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, United States, pp. 1337-1356, (Society for Industrial and Applied Mathematics) (2020)
• 2019
  • A. Narayanan, M. Weidner : “Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound”, IEEE Transactions on Information Theory, vol. 65 (10), pp. 6010-6021, (Institute of Electrical and Electronics Engineers) (2019)
  • A. Narayanan : “Polynomial Factorisation using Drinfeld Modules”, Newsletter of the London Mathematical Society, (London Mathematical Society) (2019)
• 2018
  • A. Narayanan : “Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves”, WAIFI 2018 - 7^th International Workshop on the Arithmetic of Finite Fields, vol. 11321, Lecture Notes in Computer Science, Bergen, Norway, pp. 74-91, (Springer) (2018)
  • A. Narayanan : “Polynomial factorization over finite fields by computing Euler–Poincaré characteristics of Drinfeld modules”, Finite Fields and Their Applications, vol. 54, pp. 335-365, (Elsevier) (2018)