Milos Tatarevic

Home * People * Milos Tatarevic



Milos Tatarevic, (Miloš Tatarević) a Serbian mathematician and computer scientist, residing in the San Francisco Bay Area, California. Currently working as software engineer at CoinList, he was previously affiliated with AngelList and Vast  , where he developed their high performance search engine in C. Milos Tatarevic is interested in combinatorial optimization, data mining, problem solving, experimental music composing, and computer chess.

=Xiphos= Milos Tatarevic is author of the UCI compliant open source chess engine Xiphos. Inspired by Garry Kasparov's book Deep Thinking: Where Machine Intelligence Ends and Human Creativity Begins, which evoked his childhood passion computer chess, he wondered how hard it could be to develop an engine strong enough to suppress the legendary Deep Blue and gave it a try.

=Publications=
 * Vladica Andrejić, Milos Tatarevic (2014). Searching for a counterexample to Kurepa's Conjecture. arXiv:1409.0800
 * Milos Tatarevic (2015). On Limits of Dense Packing of Equal Spheres in a Cube. The Electronic Journal of Combinatorics, Vol. 22, No. 1, arXiv:1503.07933
 * Geoffrey Exoo, Milos Tatarevic (2015). New Lower Bounds for 28 Classical Ramsey Numbers. The Electronic Journal of Combinatorics, Vol. 22, No. 3, arXiv:1504.02403
 * Vladica Andrejić, Milos Tatarevic (2016). On distinct residues of factorials. Publications de l’Institut Mathématique, arXiv:1603.04086

=Postings=

2010 ...

 * Mascheroni constructions in higher dimensions by Milos Tatarevic, September 13, 2010
 * Squares consisted of 3 different digits by Milos Tatarevic, September 14, 2010
 * Real-time implementation of ‘six degrees of separation’ involving 80 million Facebook users by Milos Tatarevic, September 18, 2010
 * The best known packings of equal circles in a square (n=67, 84, 92) by Milos Tatarevic, January 05, 2011
 * The best known packings of equal circles in a 1×0.50000 rectangle (n=33, 42) by Milos Tatarevic, March 09, 2011
 * Packing equal circles in a square: more results for n < 100 and an improvement for n=85s by Milos Tatarevic, March 09, 2011
 * Searching for a counterexample to the Kurepa’s left factorial hypothesis (p < 10^9) [OLD] by Milos Tatarevic, July 30, 2011
 * Packing equal spheres in a cube. Improvements for n = 29, 47 and 59 by Milos Tatarevic, April 12, 2013
 * Improved packing of 29 unit spheres in a cube by Milos Tatarevic, April 28, 2013
 * Construction of Ramsey (4,6)-Coloring by Milos Tatarevic, August 21, 2014
 * Searching for a counterexample to Kurepa’s Conjectures by Milos Tatarevic, September 3, 2014

2015 ...

 * On Limits of Dense Packing of Equal Spheres in a Cube by Milos Tatarevic, February 16, 2015
 * New Lower Bounds for 28 Classical Ramsey Numbers by Milos Tatarevic, April 9, 2015
 * On distinct residues of factorials by Milos Tatarevic, March 14, 2016
 * On the Ramsey Number R(12,12) by Milos Tatarevic, February 14, 2017
 * New lower bounds for some small Ramsey numbers by Milos Tatarevic, February 20, 2017

Computer Chess

 * New engine: Xiphos by Milos Tatarevic, CCC, February 28, 2018

=External Links=
 * Milos Tatarevic | LinkedIn
 * Milos Tatarevic Wordpress
 * milostatarevic (Milos Tatarevic) · GitHub
 * About – milos tatarevic

=References=

Up one level