pdfformat: 

@InProceedings{rumyantsev:LIPIcs:2011:3035, author = {Andrey Yu. Rumyantsev}, title = {{Everywhere complex sequences and the probabilistic method}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) }, pages = {464471}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897255}, ISSN = {18688969}, year = {2011}, volume = {9}, editor = {Thomas Schwentick and Christoph D{\"u}rr}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3035}, URN = {urn:nbn:de:0030drops30353}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.464}, annote = {Keywords: Kolmogorov complexity, everywhere complex sequences, randomized algorithms, Medvedev reducibility, Muchnik reducibility} }
2011
Keywords:  Kolmogorov complexity, everywhere complex sequences, randomized algorithms, Medvedev reducibility, Muchnik reducibility  
Seminar:  28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)  
Issue date:  2011  
Date of publication:  2011 