For more information use the link in the title of a talk. Remember that the Russian version is fuller.

- May 12, 2008
- Diploma thesis discussion

- May 5, 2008
- Game-theoretic approach to spatial allocation of public goods

- April 28, 2008
- Dynamic flows

- April 21, 2008
- On current situation with Average case complexity theory by Levin
- continuation

- April 14, 2008
- On current situation with Average case complexity theory by Levin
- continuation

- April 7, 2008
- Sparse sets
- continuation

- March 31, 2008
- On monotone complexity of a pair of words

- March 24, 2008
- Random sequences
- Sparse sets

- March 17, 2008
- On finite automata with an infinite word given as an input
- by Andrej Muchnik's unpublished work

- March 10, 2008
- A Uniform Lower Bound on Weights of Perceptrons

- March 3, 2008
- On current situation with Average case complexity theory by Levin
- continuation

- February 25, 2008
- Lower Bounds of Complexity for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates

- February 18, 2008
- On subword complexity of morphic sequences

- February 11, 2008
- On current situation with Average case complexity theory by Levin

- December 17, 2007
- Uniform tests of randomness
- by Peter Gacs' talks in Marseille

- December 10, 2007
- Finite automata and Presburger arithmetic

- December 3, 2007
- Finding the longest common substring using suffix arrays

- November 26, 2007
- Universal predictions and calibration

- November 19, 2007
- On transitivity of relations on measures on infinite words
- continuation

- November 12, 2007
- On transitivity of relations on measures on infinite words

- October 29, 2007
- Protocols of joint generating of random strings by several participants
- continuation

- October 22, 2007
- Uniform by exponent exponential lower bound on weights of perceprtons
- by Beigel's paper

- October 15, 2007
- Protocols of joint generating of random strings by several participants
- continuation

- October 1, 2007
- Protocols of joint generating of random strings by several participants

- September 24, 2007
- Communication complexity: an overview of upcoming special course

- September 17, 2007
- Polynomial algorithms for testing the divisibility of sparse polynomials by cyclotomic polynomials

- September 10, 2007
- Predictions. Games. Tests of randomness.
- by papers of Sandroni, Vovk, Dawid

- May 14, 2007
- Diploma thesis discussion

- May 7, 2007
- Robust measures of information
- by Leonid Levin's paper

- April 23, 2007
- Aperiodic tilings of plane with random holes

- April 16, 2007
- Lower bounds for circuits with threshold gates

- April 9, 2007
- About diploma thesis

- April 2, 2007
- Futures and Options Trading and Corresponding Problems

- March 26, 2007

- March 19, 2007
- Problems of Combinatorics on Words
- by School on Combinatorics on Words and Workshop on Recent Progress in Combinatorics on Words held in Montreal, Canada

- March 12, 2007
- On tilings with errors and self-correcting computations

- March 5, 2007
- On Estimate of the Number of Global Forbidden Markings using the Number of Local Markings (Multi-dimensional Case)
- Video fragment: avi (36 mb), full version: avi (651 mb).

- February 26, 2007
- A Model of Gene Expression Regulation

- February 12, 2007
- Combinatorial proof of Levin's theorem

- December 18, 2006
- Reformulation by A. Rumyantsev in combinatorial terms of Levin's Theorem about a sequence without forbidden substrings
- On enumerating complexity of sets

- December 11, 2006
- Locally finite tilings and Pisot numbers

- December 4, 2006
- Comparison of prefix and plain Kolmogorov complexity
- continuation

- November 27, 2006
- Miller–Yu Theorem
- by Miller and Yu's paper "On initial segment complexity and degrees of randomness", which can be found on Joseph Miller's homepage.

- November 20, 2006
- Comparison of prefix and plain Kolmogorov complexity
- by Joseph Miller's paper "Contrasting plain and prefix-free Kolmogorov complexity", which can be found on his site

- November 13, 2006
- Penrose tilings

- October 30, 2006
- Ammann's tilings
- continuation

- October 23, 2006
- Ammann's tilings

- October 16, 2006
- On Complexity of Algorithmic Problems on Skew-Symmetric Graphs

- October 9, 2006
- Effective version of Muchnik's theorem

- September 25, 2006
- On structure theory for computational complexity: NP-complete, sparse, P-selective, auto- and self-reducible sets
- continuation

- September 18, 2006
- On structure theory for computational complexity: NP-complete, sparse, P-selective, auto- and self-reducible sets

- September 11, 2006
- On Ear Decompositions of Strongly Connected Graphs

- May 15, 2006
- Path Matchings, Even Factors, and Generalizations

- May 8, 2006
- Diploma thesis discussion

- April 24, 2006
- Algorithms on Compressed Texts
- author's publications on the topic on his homepage

- April 17, 2006
- Algorithmic theory of lossy data compression

- April 10, 2006
- Almost Periodic Sequences under Finite Automata Mappings, Effectiveness Issues

- April 3, 2006
- Randomness for non-computable measures and families of measures
- continuation

- March 27, 2006
- Randomness for non-computable measures and families of measures
- continuation

- March 13, 2006
- On the bound of the almost periodicity regulator

© 2006—2007 Kolmogorov seminar

Feedback