The SCEAS System
| |||||||

## Search the dblp DataBase
Andrei E. Romashchenko:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - Andrei E. Romashchenko
**Extracting the Mutual Information for a Triple of Binary Strings.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:221-229 [Conf] - 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] - Troy Lee, Andrei E. Romashchenko
**On Polynomially Time Bounded Symmetry of Information.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:463-475 [Conf] - Andrei E. Romashchenko
**Reliable Computations Based on Locally Decodable Codes.**[Citation Graph (0, 0)][DBLP] STACS, 2006, pp:537-548 [Conf] - 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] - Troy Lee, Andrei E. Romashchenko
**On Polynomially Time Bounded Symmetry of Information**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:031, pp:- [Journal] - 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] - 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] - Troy Lee, Andrei E. Romashchenko
**Resource bounded symmetry of information revisited.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:345, n:2-3, pp:386-405 [Journal] - 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] **Effective Closed Subshifts in 1D Can Be Implemented in 2D.**[Citation Graph (, )][DBLP]**Variations on Muchnik's Conditional Complexity Theorem.**[Citation Graph (, )][DBLP]**Fixed Point and Aperiodic Tilings.**[Citation Graph (, )][DBLP]**High Complexity Tilings with Sparse Errors.**[Citation Graph (, )][DBLP]**A Random Oracle Does Not Help Extract the Mutual Information.**[Citation Graph (, )][DBLP]**Sparse sets.**[Citation Graph (, )][DBLP]**Fixed Point and Aperiodic Tilings**[Citation Graph (, )][DBLP]**Variations on Muchnik's Conditional Complexity Theorem**[Citation Graph (, )][DBLP]**Fixed-point tile sets and their applications**[Citation Graph (, )][DBLP]**Fixed point theorem and aperiodic tilings**[Citation Graph (, )][DBLP]**Effective closed subshifts in 1D can be implemented in 2D**[Citation Graph (, )][DBLP]**Fixed Point and Aperiodic Tilings.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |