default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrej Muchnik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j19]Andrei A. Muchnik, Konstantin Yu. Gorbunov:
Algorithmic aspects of decomposition and equivalence of finite-valued transducers. Probl. Inf. Transm. 51(3): 267-288 (2015)- 2013
- [j18]Andrei A. Muchnik:
Determinization of ordinal automata. Probl. Inf. Transm. 49(2): 149-162 (2013) - 2012
- [i12]Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin:
Limit complexities revisited [once more]. CoRR abs/1204.0201 (2012) - 2011
- [i11]Andrej Muchnik:
Kolmogorov complexity and cryptography. CoRR abs/1106.5433 (2011) - 2010
- [j17]Laurent Bienvenu, Andrej Muchnik, Alexander Shen
, Nikolai K. Vereshchagin:
Limit Complexities Revisited. Theory Comput. Syst. 47(3): 720-736 (2010) - [j16]Andrei A. Muchnik, Andrei E. Romashchenko:
Stability of properties of Kolmogorov complexity under relativization. Probl. Inf. Transm. 46(1): 38-61 (2010) - [i10]Andrej Muchnik, Ilya Mezhirov, Alexander Shen, Nikolai K. Vereshchagin:
Game interpretation of Kolmogorov complexity. CoRR abs/1003.4712 (2010)
2000 – 2009
- 2009
- [j15]Andrei A. Muchnik:
Algorithmic randomness and splitting of supermartingales. Probl. Inf. Transm. 45(1): 54-64 (2009) - [i9]Andrei A. Muchnik, Yuri Pritykin, Alexei L. Semenov:
Sequences close to periodic. CoRR abs/0903.5316 (2009) - 2008
- [c8]Andrei A. Muchnik, Andrei E. Romashchenko:
A Random Oracle Does Not Help Extract the Mutual Information. MFCS 2008: 527-538 - [c7]Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin:
Limit complexities revisited. STACS 2008: 73-84 - [i8]Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin:
Limit complexities revisited. CoRR abs/0802.2833 (2008) - [i7]Andrej Muchnik, Alexey V. Chernov, Alexander Shen:
Algorithmic randomness and splitting of supermartingales. CoRR abs/0807.3156 (2008) - 2007
- [j14]Marcus Hutter, Andrej Muchnik:
On semimeasures predicting Martin-Löf random sequences. Theor. Comput. Sci. 382(3): 247-261 (2007) - [j13]Andrej Muchnik, Alexander Shen, Mikhail Ustinov, Nikolai K. Vereshchagin, Michael V. Vyugin:
Non-reducible descriptions for conditional Kolmogorov complexity. Theor. Comput. Sci. 384(1): 77-86 (2007) - [i6]Marcus Hutter, Andrej Muchnik:
On Semimeasures Predicting Martin-Loef Random Sequences. CoRR abs/0708.2319 (2007) - 2006
- [j12]Andrej Muchnik, Alexei L. Semenov:
Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets. Ann. Pure Appl. Log. 141(3): 437-441 (2006) - [j11]Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet:
Enumerations of the Kolmogorov function. J. Symb. Log. 71(2): 501-528 (2006) - [c6]Andrei A. Muchnik, Nikolai K. Vereshchagin:
Shannon Entropy vs. Kolmogorov Complexity. CSR 2006: 281-291 - [c5]Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin:
Non-reducible Descriptions for Conditional Kolmogorov Complexity. TAMC 2006: 308-317 - 2004
- [c4]Marcus Hutter, Andrej Muchnik:
Universal Convergence of Semimeasures on Individual Random Sequences. ALT 2004: 234-248 - [c3]Bruno Durand, Andrei A. Muchnik, Maxim Ushakov, Nikolai K. Vereshchagin:
Ecological Turing Machines. ICALP 2004: 457-468 - [i5]Marcus Hutter, Andrej Muchnik:
Universal Convergence of Semimeasures on Individual Random Sequences. CoRR cs.LG/0407057 (2004) - [i4]Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet:
Enumerations of the Kolmogorov Function. Electron. Colloquium Comput. Complex. TR04 (2004) - [i3]Andrei A. Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin:
Non-reducible descriptions for conditional Kolmogorov complexity. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j10]Andrei A. Muchnik, Alexei L. Semenov:
On the Role of the Law of Large Numbers in the Theory of Randomness. Probl. Inf. Transm. 39(1): 119-147 (2003) - [j9]Andrei A. Muchnik:
The definable criterion for definability in Presburger arithmetic and its applications. Theor. Comput. Sci. 290(3): 1433-1444 (2003) - [j8]Andrei A. Muchnik:
One application of real-valued interpretation of formal power series. Theor. Comput. Sci. 290(3): 1931-1946 (2003) - [j7]Andrei A. Muchnik, Alexei L. Semenov, Maxim Ushakov:
Almost periodic sequences. Theor. Comput. Sci. 304(1-3): 1-33 (2003) - 2002
- [j6]Andrei A. Muchnik, Semen Ye. Positselsky:
Kolmogorov entropy in the context of computability theory. Theor. Comput. Sci. 271(1-2): 15-35 (2002) - [j5]Alexey V. Chernov, Andrei A. Muchnik, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Upper semi-lattice of binary strings with the relation "x is simple conditional to y". Theor. Comput. Sci. 271(1-2): 69-95 (2002) - [j4]Andrei A. Muchnik:
Conditional complexity and codes. Theor. Comput. Sci. 271(1-2): 97-109 (2002) - 2001
- [c2]Andrei A. Muchnik, Nikolai K. Vereshchagin:
Logical Operations and Kolmogorov Complexity II. CCC 2001: 256-265 - [i2]Andrei A. Muchnik, Nikolai K. Vereshchagin:
Logical operations and Kolmogorov complexity. II. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [i1]Andrei A. Muchnik, Alexei L. Semenov:
Multi-conditional Descriptions and Codes in Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [c1]Andrei A. Muchnik, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y". CCC 1999: 114- - 1998
- [j3]Andrei A. Muchnik, Alexei L. Semenov, Vladimir A. Uspensky:
Mathematical Metaphysics of Randomness. Theor. Comput. Sci. 207(2): 263-317 (1998) - [j2]Andrei A. Muchnik:
On Common Information. Theor. Comput. Sci. 207(2): 319-328 (1998) - 1996
- [j1]Andrei A. Muchnik, Nikolai K. Vereshchagin:
A General Method to Construct Oracles Realizing Given Relationships Between Complexity Classes. Theor. Comput. Sci. 157(2): 227-258 (1996)
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-04-24 23:10 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:
