Mikhail Andreev

According to our database, Mikhail Andreev authored at least 8 papers between 2011 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Bishop's (up)crossing inequality and lower semicomputable random reals revisited.

Mikhail Andreev, Alexander Shen

CoRR, November, 2025

2019

Location Leakage from Network Access Patterns.

Trishita Tiwari, Avraham Klausner, Mikhail Andreev, Ari Trachtenberg, Arkady Yerukhimovich

Proceedings of the 7th IEEE Conference on Communications and Network Security, 2019

2018

Nothing But Net: Invading Android User Privacy Using Only Network Access Patterns.

Mikhail Andreev, Avi Klausner, Trishita Tiwari, Ari Trachtenberg, Arkady Yerukhimovich

CoRR, 2018

Plain Stopping Time and Conditional Complexities Revisited.

Mikhail Andreev, Gleb Posobin, Alexander Shen

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2016

The Sum 2 KM(x)-K(x) Over All Prefixes x of Some Binary Sequence Can be Infinite.

Mikhail Andreev, Akim Kumok

Theory Comput. Syst., 2016

Busy Beavers and Kolmogorov Complexity.

Mikhail Andreev

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2014

The sum 2^KA(x)-KP(x) over all prefixes x of some binary sequence can be infinite.

Mikhail Andreev, Akim Kumok

CoRR, 2014

2011

Not every domain of a plain decompressor contains the domain of a prefix-free one.

Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen

Theor. Comput. Sci., 2011