Mikhail Andreev

11 papers B 1C 1Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Bishop's (up)crossing inequality and lower semicomputable random reals revisited.
CoRR
Mikhail Andreev, Alexander Shen
2019 — conf
Location Leakage from Network Access Patterns.
CNS
Trishita Tiwari, Avraham Klausner, Mikhail Andreev, Ari Trachtenberg, Arkady Yerukhimovich
2018 J jnl
Nothing But Net: Invading Android User Privacy Using Only Network Access Patterns.
CoRR
Mikhail Andreev, Avi Klausner, Trishita Tiwari, Ari Trachtenberg, Arkady Yerukhimovich
2018 B conf
Plain Stopping Time and Conditional Complexities Revisited.
MFCS
Mikhail Andreev, Gleb Posobin, Alexander Shen
2017 J jnl
Busy beavers and Kolmogorov complexity.
CoRR
Mikhail Andreev
2017 J jnl
Plain stopping time and conditional complexities revisited.
CoRR
Mikhail Andreev, Gleb Posobin, Alexander Shen
2016 C conf
Busy Beavers and Kolmogorov Complexity.
CiE
Mikhail Andreev
2016 J jnl
The Sum 2 KM(x)-K(x) Over All Prefixes x of Some Binary Sequence Can be Infinite.
Theory Comput. Syst.
Mikhail Andreev, Akim Kumok
2014 J jnl
The sum 2
CoRR
Mikhail Andreev, Akim Kumok
2011 J jnl
Not every domain of a plain decompressor contains the domain of a prefix-free one.
Theor. Comput. Sci.
Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen
2010 J jnl
Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One
CoRR
Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen