default search action
Daniil Musatov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Ruslan Ishkuvatov, Daniil Musatov, Alexander Shen:
Approximating Kolmogorov complexity. Comput. 12(3): 283-297 (2023) - [j5]Ekaterina Vasilyeva
, Miguel Romance
Distances in Higher-Order Networks and the Metric Structure of Hypergraphs. Entropy 25(6): 923 (2023) - [c6]Daniil Musatov
Structural Complexity of Rational Interactive Proofs. CiE 2023: 231-245 - [i6]Daniil Musatov, Georgii Potapov:
Structural Complexity of Rational Interactive Proofs. CoRR abs/2305.04563 (2023) - 2022
- [c5]Alexander Grishutin, Daniil Musatov
Discrete Versions of the KKM Lemma and Their PPAD-Completeness. CSR 2022: 170-189 - [i5]Ivan Samoylenko, David Aleja, Eva Primo, Karin Alfaro-Bittner, Ekaterina Vasilyeva
Why are there six degrees of separation in a social network? CoRR abs/2211.09463 (2022) - 2021
- [e2]Rahul Santhanam, Daniil Musatov
Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings. Lecture Notes in Computer Science 12730, Springer 2021, ISBN 978-3-030-79415-6 [contents]
2010 – 2019
- 2019
- [c4]Ruslan Ishkuvatov, Daniil Musatov:
On Approximate Uncomputability of the Kolmogorov Complexity Function. CiE 2019: 230-239 - 2016
- [j4]Daniil Musatov, Alexei Savvateev
Gale-Nikaido-Debreu and Milgrom-Shannon: Communal interactions with endogenous community structures. J. Econ. Theory 166: 282-303 (2016) - 2015
- [j3]Daniil Musatov:
On Extracting Space-bounded Kolmogorov Complexity. Theory Comput. Syst. 56(4): 643-661 (2015) - [e1]Lev D. Beklemishev
Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings. Lecture Notes in Computer Science 9139, Springer 2015, ISBN 978-3-319-20296-9 [contents] - 2014
- [j2]Daniil Musatov:
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization. Theory Comput. Syst. 55(2): 299-312 (2014) - 2012
- [c3]Daniil Musatov:
Space-Bounded Kolmogorov Extractors. CSR 2012: 266-277 - [i4]Daniil Musatov:
Space-Bounded Kolmogorov Extractors. CoRR abs/1203.3674 (2012) - 2011
- [j1]Daniil Musatov, Andrei E. Romashchenko
Variations on Muchnik's Conditional Complexity Theorem. Theory Comput. Syst. 49(2): 227-245 (2011) - [c2]Daniil Musatov:
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization. CSR 2011: 64-76 - 2010
- [i3]Daniil Musatov:
Theorems about space-bounded Kolmogorov complexity obtained by "naive" derandomization. CoRR abs/1009.5108 (2010)
2000 – 2009
- 2009
- [c1]Daniil Musatov, Andrei E. Romashchenko
Variations on Muchnik's Conditional Complexity Theorem. CSR 2009: 250-262 - [i2]Daniil Musatov, Andrei E. Romashchenko, Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem. CoRR abs/0904.3116 (2009) - 2008
- [i1]Daniil Musatov:
Extractors and an efficient variant of Muchnik's theorem. CoRR abs/0811.3958 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: