Документ взят из кэша поисковой машины. Адрес
оригинального документа
: http://www.mccme.ru/~raskin/
Дата изменения: Sun Mar 27 23:09:06 2016
Дата индексирования: Sun Apr 10 11:33:35 2016
Кодировка: IBM-866
Поисковые слова: п п п п п п п п п п п п п п п
|
Michael RaskinтА’s homepage
Publications
K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin.
Approximating the minimum cycle mean. Theoretical Computer Science,
2014, vol. 547, pp. 104–116
M.€аRaskin. Toom's Partial Order Is Transitive. Problems of
Information Transmission, 2012, vol.€а48, N2, pp.154–172
M.€аRaskin. Lower Estimate of the Regulator of the Direct Product
of almost Periodic and Periodic Sequences. Vestnik Mosckovskogo
Universiteta (MSU Bulletin), Series€а1, Mathematics. Mechanics.
2011, v.€а6
M.€аRaskin. Coupling of computable measures coordinated with an
order relation is not always computable. Vestnik Mosckovskogo
Universiteta (MSU Bulletin). Series€а1. Mathematics. Mechanics.
2012, v.€а2
Talks
OpenCV wrapper and form processing for Common Lisp тАФ implementation notes.
Lightning talk. European Lisp Symposium 2015, London, UK.
Julia: an outside view.
Lightning talk. European Lisp Symposium 2014, Paris, France.
Screen subareas in StumpWM via tagging.
Lightning talk. European Lisp Symposium 2014, Paris, France.
Computable measures that are couplable but not computably couplable.
International Conference on Computability, Complexity and Randomness,
Moscow, Russia.
Data-transformer: an example of data-centered tool set.
European Lisp Symposium 2013, Madrid, Spain.
Personal software for PC: how I ended up reading email using Common Lisp.
Lightning talk. European Common Lisp Meeting 2013, Madrid, Spain.
QueryFS: a virtual filesystem based on queries and related tools.
Lightning talk. European Lisp Symposium 2012, Zadar, Croatia.
Almost periodicity and finite automata (joint work with Yu.Pritykin).
Workshop on Infinite Words, Automata and Dynamics 2007, Ekaterinburg,
Russia.