Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Pinyin i2Cantonese i2Cangjie i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

1

STACS
2009
Springer

favoriteEmaildiscussreport

104views Theoretical Computer Science» more STACS 2009»

Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence

12 years 10 months ago

Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence

Download triton.towson.edu

Marius Zimand

Real-time Traffic

STACS 2009 | Theoretical Computer Science |

claim paper

Related Content

» Possibilities and impossibilities in Kolmogorov complexity extraction

» Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extr...

» On extracting common random bits from correlated sources

» Order in Complex Systems of Nonlinear Oscillators Phase Locked Subspaces

» Extracting Motor Unit Firing Information by Independent Component Analysis of Surface Elec...

» Games for extracting randomness

» Near optimal lossy source coding and compressionbased denoising via Markov chain Monte Car...

» Distributional convergence for the number of symbol comparisons used by QuickSort

» RateDistortion via Markov Chain Monte Carlo

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	STACS
Authors	Marius Zimand

Comments (0)