Talks
For more information use the link in the title of a talk.
Remember that the Russian version is fuller.
2008
- May 12, 2008
- Natalia Kolodkina, Alexander Makarov,
Alexey Preobrazhenskiy, Mikhail Raskin
- Diploma thesis discussion
- May 5, 2008
- Daniil Musatov
- Game-theoretic approach
to spatial allocation of public goods
- April 28, 2008
- Pavel Nalivaiko
- Dynamic flows
- April 21, 2008
- Nikolay Vereshchagin
- On current situation with
Average case complexity theory by Levin
- April 14, 2008
- Nikolay Vereshchagin
- On current situation with
Average case complexity theory by Levin
- April 7, 2008
- Andrei Romashchenko
- Sparse sets
- March 31, 2008
- Pavel Karpovich
- On monotone complexity of a pair of words
- March 24, 2008
- Denis Hirschfeldt
- Random sequences
- Alexander Shen
- Sparse sets
- March 17, 2008
- Nikolai Vereshchagin
- On finite automata with
an infinite word given as an input
- March 10, 2008
- Vladimir Podolskii
- A Uniform Lower Bound on Weights of Perceptrons
- March 3, 2008
- Nikolay Vereshchagin
- On current situation with
Average case complexity theory by Levin
- February 25, 2008
- Dmitriy Cherukhin
- Lower Bounds of Complexity for Depth-2 and Depth-3
Boolean Circuits with Arbitrary Gates
- February 18, 2008
- Rostislav Deviatov
- On subword complexity of morphic sequences
- February 11, 2008
- Nikolay Vereshchagin
- On current situation with
Average case complexity theory by Levin
2007
- December 17, 2007
- Alexander Shen
- Uniform tests of randomness
- December 10, 2007
- Andrey Rumyantsev
- Finite automata and Presburger arithmetic
- December 3, 2007
- Tatiana Starikovskaya
- Finding the longest common substring
using suffix arrays
- November 26, 2007
- Vladimir V'yugin
- Universal predictions and calibration
- November 19, 2007
- Mikhail Raskin
- On transitivity of relations on measures
on infinite words
- November 12, 2007
- Mikhail Raskin
- On transitivity of relations on measures
on infinite words
- October 29, 2007
- Timofey Arkhangelskiy
- Protocols of joint generating of random strings
by several participants
- October 22, 2007
- Vladimir Podolskii
- Uniform by exponent exponential lower bound on
weights of perceprtons
- October 15, 2007
- Timofey Arkhangelskiy
- Protocols of joint generating of random strings
by several participants
- October 1, 2007
- Timofey Arkhangelskiy
- Protocols of joint generating of random strings
by several participants
- September 24, 2007
- Vladimir Podolskii
- Communication complexity:
an overview of upcoming special course
- September 17, 2007
- Sergey Tarasov, Mikhail Vyalyi
- Polynomial algorithms for testing
the divisibility of sparse polynomials by cyclotomic polynomials
- September 10, 2007
- Alexander Shen
- Predictions. Games. Tests of randomness.
- May 14, 2007
- M. Ivanov, J. Jomantaite,
A. Khodyrev, K. Korshunov, P. Mitrichev,
P. Nalivaiko, I. Vegner, A. Vorontsov
- И. Вегнер, А. Воронцов,
М. Иванов, Ю. Йомантайте, К. Коршунов,
П. Митричев, П. Наливайко, А. Ходырев
- Diploma thesis discussion
- May 7, 2007
- Nikolai Vereschagin
- Robust measures of information
- April 23, 2007
- Andrey Romaschenko
- Aperiodic tilings of plane with
random holes
- April 9, 2007
- Petr Mitrichev
- About diploma thesis
- April 2, 2007
- Mikhail V'yugin
- Futures and Options Trading
and Corresponding Problems
- March 26, 2007
- The meeting is in memory of
Andrej
Muchnik. Participants will talk about the main
results of Andrej.
- March 19, 2007
- Yuri Pritykin
- Problems of Combinatorics on Words
- March 12, 2007
- Andrey Romaschenko
- On tilings with errors and
self-correcting computations
- March 5, 2007
- Andrej Muchnik
-
On Estimate
of the Number of Global Forbidden Markings
using the Number of Local Markings (Multi-dimensional
Case)
- February 26, 2007
- Vasiliy Lubetskiy
- A Model of Gene Expression Regulation
- February 12, 2007
- Andrey Rumyantsev
- Combinatorial proof of Levin's theorem
2006
- December 18, 2006
- Yuri Pritykin
- Reformulation by A. Rumyantsev in combinatorial terms
of Levin's Theorem about
a sequence without forbidden substrings
- Nikolay Vereschagin
- On enumerating complexity of sets
- December 11, 2006
- Pavel Karpovich
- Locally finite tilings and
Pisot numbers
- December 4, 2006
- Nikolay Vereschagin
- Comparison of prefix and plain Kolmogorov
complexity
- November 27, 2006
- Alexander Shen
- Miller–Yu Theorem
- November 20, 2006
- Nikolay Vereschagin
- Comparison of prefix and plain Kolmogorov
complexity
- November 13, 2006
- Leonid Rybnikov
- Penrose tilings
- October 30, 2006
- Nikolay Vereshagin, Alexander Shen
- Ammann's tilings
- October 23, 2006
- Nikolay Vereshagin, Alexander Shen
- Ammann's tilings
- October 9, 2006
- Daniil Musatov
- Effective version of Muchnik's theorem
- September 25, 2006
- Nikolay Vereschagin
- On structure theory for computational complexity:
NP-complete, sparse, P-selective, auto- and self-reducible sets
- September 18, 2006
- Nikolay Vereschagin
- On structure theory for computational complexity:
NP-complete, sparse, P-selective, auto- and self-reducible sets
- May 8, 2006
- D. Vinogradov, I. Mezhirov, D. Musatov,
V. Podolskiy, A. Rumyantsev
- Diploma thesis discussion
- April 24, 2006
- Yury Lifshits
- Algorithms on Compressed Texts
- April 17, 2006
- Nikolay Vereschagin
- Algorithmic theory of lossy
data compression
- April 10, 2006
- Yuri Pritykin
- Almost Periodic Sequences under Finite Automata
Mappings, Effectiveness Issues
- March 13, 2006
- Mikhail Raskin
- On the bound of the almost
periodicity regulator
© 2006—2007 Kolmogorov seminar
Feedback