default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 271

> Home > Journals > Theoretical Computer Science

Refine list

refinements active!

zoomed in on 14 of 14 records

view refined list in

export refined list as

showing all 14 records

refine by search term

refine by author

refine by access Please note:
▪ This facet is still work in progress.
▪ Open access information for publications is still rather incomplete.

Volume 271, Number 1-2, January 2002

Kolmogorov Complexity

- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Durand02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Durand02
Bruno Durand:
Kolmogorov Complexity - Foreword. 1
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Calude02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Calude02
Cristian Calude:
A characterization of c.e. random reals. 3-14
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/MuchnikP02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MuchnikP02
Andrei A. Muchnik, Semen Ye. Positselsky:
Kolmogorov entropy in the context of computability theory. 15-35
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DurandP02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DurandP02
Bruno Durand, Sylvain Porrot:
Comparison between the complexity of a function and the complexity of its graph. 37-46
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DurandSV02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DurandSV02
Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin:
Descriptive complexity of computable sequences. 47-58
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Vereshchagin02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Vereshchagin02
Nikolai K. Vereshchagin:
Kolmogorov complexity conditional to large integers. 59-67
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/ChernovMRSV02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ChernovMRSV02
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". 69-95
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Muchnik02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Muchnik02
Andrei A. Muchnik:
Conditional complexity and codes. 97-109
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/RomashchenkoSV02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/RomashchenkoSV02
Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Combinatorial interpretation of Kolmogorov complexity. 111-123
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/ShenV02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ShenV02
Alexander Shen, Nikolai K. Vereshchagin:
Logical operations and Kolmogorov complexity. 125-129
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/VereshchaginV02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/VereshchaginV02
Nikolai K. Vereshchagin, Michael V. Vyugin:
Independent minimum length programs to translate between given strings. 131-143
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Vyugin02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Vyugin02
Michael V. Vyugin:
Information distance and conditional complexities. 145-150
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/GrigorieffM02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/GrigorieffM02
Serge Grigorieff, Jean-Yves Marion:
Kolmogorov complexity and non-determinism. 151-180
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Kalnishkan02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Kalnishkan02
Yuri Kalnishkan:
General linear relations between different types of predictive complexity. 181-200
no results

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.