Go to the corresponding LIPIcs Volume Portal 
Andreev, Mikhail ; Posobin, Gleb ; Shen, Alexander
pdfformat: 

@InProceedings{andreev_et_al:LIPIcs:2018:9584, author = {Mikhail Andreev and Gleb Posobin and Alexander Shen}, title = {{Plain Stopping Time and Conditional Complexities Revisited}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {2:12:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770866}, ISSN = {18688969}, year = {2018}, volume = {117}, editor = {Igor Potapov and Paul Spirakis and James Worrell}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9584}, URN = {urn:nbn:de:0030drops95842}, doi = {10.4230/LIPIcs.MFCS.2018.2}, annote = {Keywords: Kolmogorov complexity, stopping time complexity, structured conditional complexity, algorithmic information theory} }
Keywords:  Kolmogorov complexity, stopping time complexity, structured conditional complexity, algorithmic information theory  
Seminar:  43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)  
Issue Date:  2018  
Date of publication:  20.08.2018 