The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Alexander Shen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin
    Inequalities for Shannon entropies and Kolmogorov complexities. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:13-23 [Conf]
  2. 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]
  3. Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin
    Combinatorial Interpretation of Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:131-137 [Conf]
  4. Katalin Friedl, Zsolt Hátsági, Alexander Shen
    Low-degree Tests. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:57-64 [Conf]
  5. Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin
    Descriptive Complexity of Computable Sequences. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:153-162 [Conf]
  6. Bruno Durand, Leonid A. Levin, Alexander Shen
    Complex tilings. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:732-739 [Conf]
  7. Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin
    Non-reducible Descriptions for Conditional Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:308-317 [Conf]
  8. Alexander Shen
    Multisource Algorithmic Information Theory. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:327-338 [Conf]
  9. Alexander Shen
    Discussion on Kolmogorov Complexity and Statistical Analysis. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1999, v:42, n:4, pp:340-342 [Journal]
  10. Bruno Durand, Leonid A. Levin, Alexander Shen
    Complex Tilings [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  11. Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin
    Combinatorial Interpretation of Kolmogorov Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:26, pp:- [Journal]
  12. Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin
    Descriptive complexity of computable sequences [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:087, pp:- [Journal]
  13. Alexander Shen, Nikolai K. Vereshchagin
    Logical operations and Kolmogorov complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:088, pp:- [Journal]
  14. 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]
  15. Noga Alon, Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin
    Partitioning multi-dimensional sets in a small number of ``uniform'' parts [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:095, pp:- [Journal]
  16. Alexander Shen
    Multisource algorithmic information theory [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:006, pp:- [Journal]
  17. Noga Alon, Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin
    Partitioning multi-dimensional sets in a small number of "uniform" parts. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:1, pp:134-144 [Journal]
  18. Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin
    Inequalities for Shannon Entropy and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:2, pp:442-464 [Journal]
  19. Daniel Hammer, Alexander Shen
    A Strange Application of Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:1, pp:1-4 [Journal]
  20. 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]
  21. Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin
    Descriptive complexity of computable sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:271, n:1-2, pp:47-58 [Journal]
  22. Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin
    Combinatorial interpretation of Kolmogorov complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:271, n:1-2, pp:111-123 [Journal]
  23. Alexander Shen, Nikolai K. Vereshchagin
    Logical operations and Kolmogorov complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:271, n:1-2, pp:125-129 [Journal]
  24. Andrej Muchnik, Alexander Shen, Mikhail Ustinov, Nikolai K. Vereshchagin, Michael V. Vyugin
    Non-reducible descriptions for conditional Kolmogorov complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:1, pp:77-86 [Journal]

  25. Prequential Randomness. [Citation Graph (, )][DBLP]


  26. On-Line Probability, Complexity and Randomness. [Citation Graph (, )][DBLP]


  27. Effective Closed Subshifts in 1D Can Be Implemented in 2D. [Citation Graph (, )][DBLP]


  28. Ergodic-Type Characterizations of Algorithmic Randomness. [Citation Graph (, )][DBLP]


  29. Variations on Muchnik's Conditional Complexity Theorem. [Citation Graph (, )][DBLP]


  30. Combinatorial proof of Muchnik's theorem. [Citation Graph (, )][DBLP]


  31. Multisource Algorithmic Information Theory. [Citation Graph (, )][DBLP]


  32. Fixed Point and Aperiodic Tilings. [Citation Graph (, )][DBLP]


  33. High Complexity Tilings with Sparse Errors. [Citation Graph (, )][DBLP]


  34. Limit complexities revisited. [Citation Graph (, )][DBLP]


  35. Sparse sets. [Citation Graph (, )][DBLP]


  36. Algorithmic Information Theory and Foundations of Probability. [Citation Graph (, )][DBLP]


  37. Fixed Point and Aperiodic Tilings [Citation Graph (, )][DBLP]


  38. Limit complexities revisited [Citation Graph (, )][DBLP]


  39. Algorithmic randomness and splitting of supermartingales [Citation Graph (, )][DBLP]


  40. Variations on Muchnik's Conditional Complexity Theorem [Citation Graph (, )][DBLP]


  41. Fixed-point tile sets and their applications [Citation Graph (, )][DBLP]


  42. Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One [Citation Graph (, )][DBLP]


  43. Fixed point theorem and aperiodic tilings [Citation Graph (, )][DBLP]


  44. Effective closed subshifts in 1D can be implemented in 2D [Citation Graph (, )][DBLP]


  45. Game interpretation of Kolmogorov complexity [Citation Graph (, )][DBLP]


  46. A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points [Citation Graph (, )][DBLP]


  47. Fixed Point and Aperiodic Tilings. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.306secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002