Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Barmpalias, George"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the gap between trivial and nontrivial initial segment prefix-free complexity
Martijn Baartse
,
George Barmpalias
Theory of Computing Systems
52
(1), 2013, pp. 28-47
Universal computably enumerable sets and initial segment prefix-free complexity
George Barmpalias
Information and Computation
233
, 2013, pp. 41-59
On the number of infinite sequences with trivial initial segment complexity
George Barmpalias
,
T.F. Sterkenburg
Theoretical Computer Science
412
(52), 2011, pp. 7133-7146
Kolmogorov complexity of initial segments of sequences and arithmetical definability
George Barmpalias
,
C.S. Vlek
Theoretical Computer Science
412
(41), 2011, pp. 5656-5667
Random non-cupping revisited
George Barmpalias
Journal of Complexity
22
(6), 2006, pp. 850-857