Go to the corresponding Portal 
pdfformat: 

@InProceedings{zimand:LIPIcs:2009:1812, author = {Marius Zimand}, title = {{Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {697708}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897095}, ISSN = {18688969}, year = {2009}, volume = {3}, editor = {Susanne Albers and JeanYves Marion}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2009/1812}, URN = {urn:nbn:de:0030drops18128}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2009.1812}, annote = {Keywords: Algorithmic information theory, Computational complexity, Kolmogorov complexity, Randomness extractors} }
Keywords:  Algorithmic information theory, Computational complexity, Kolmogorov complexity, Randomness extractors  
Seminar:  26th International Symposium on Theoretical Aspects of Computer Science  
Issue Date:  2009  
Date of publication:  19.02.2009 