The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrei A. Muchnik: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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". [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:114-0 [Conf]
  2. Andrei A. Muchnik, Nikolai K. Vereshchagin
    Logical Operations and Kolmogorov Complexity II. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:256-265 [Conf]
  3. Andrei A. Muchnik, Nikolai K. Vereshchagin
    Shannon Entropy vs. Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:281-291 [Conf]
  4. Bruno Durand, Andrei A. Muchnik, Maxim Ushakov, Nikolai K. Vereshchagin
    Ecological Turing Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:457-468 [Conf]
  5. Andrei A. Muchnik, Alexei L. Semenov
    Multi-conditional Descriptions and Codes in Kolmogorov Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:15, pp:- [Journal]
  6. Andrei A. Muchnik, Nikolai K. Vereshchagin
    Logical operations and Kolmogorov complexity. II [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:089, pp:- [Journal]
  7. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:015, pp:- [Journal]
  8. Andrei A. Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin
    Non-reducible descriptions for conditional Kolmogorov complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:054, pp:- [Journal]
  9. 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". [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:271, n:1-2, pp:69-95 [Journal]
  10. Andrei A. Muchnik
    Conditional complexity and codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:271, n:1-2, pp:97-109 [Journal]
  11. Andrei A. Muchnik
    The definable criterion for definability in Presburger arithmetic and its applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1433-1444 [Journal]
  12. Andrei A. Muchnik
    One application of real-valued interpretation of formal power series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1931-1946 [Journal]
  13. Andrei A. Muchnik
    On Common Information. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:207, n:2, pp:319-328 [Journal]
  14. Andrei A. Muchnik, Semen Ye. Positselsky
    Kolmogorov entropy in the context of computability theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:271, n:1-2, pp:15-35 [Journal]
  15. Andrei A. Muchnik, Alexei L. Semenov, Maxim Ushakov
    Almost periodic sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:1-33 [Journal]
  16. Andrei A. Muchnik, Alexei L. Semenov, Vladimir A. Uspensky
    Mathematical Metaphysics of Randomness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:207, n:2, pp:263-317 [Journal]
  17. Andrei A. Muchnik, Nikolai K. Vereshchagin
    A General Method to Construct Oracles Realizing Given Relationships Between Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:227-258 [Journal]

  18. A Random Oracle Does Not Help Extract the Mutual Information. [Citation Graph (, )][DBLP]


  19. Sequences close to periodic [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002