Andrey Timofeev

According to our database, Andrey Timofeev authored at least 4 papers between 2010 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Monte Carlo Tree Search With Reinforcement Learning for Motion Planning.

Philippe Weingertner, Minnie Ho, Andrey Timofeev, Sébastien Aubert, Guillermo Pita Gil

Proceedings of the 23rd IEEE International Conference on Intelligent Transportation Systems, 2020

2012

A heterogeneous computing environment to solve the 768-bit RSA challenge.

Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra, Dag Arne Osvik, Kazumaro Aoki, Scott Contini, Jens Franke, Emmanuel Thomé, Pascal Jermini, Michela Thiémard, Paul C. Leyland, Peter L. Montgomery, Andrey Timofeev, Heinz Stockinger

Clust. Comput., 2012

2011

Non-admissible tracks in Shamirʼs scheme.

Stanislaw Spiez, Andrey Timofeev, Jerzy Urbanowicz

Finite Fields Their Appl., 2011

2010

Factorization of a 768-bit RSA modulus.

Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann

IACR Cryptol. ePrint Arch., 2010