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
[3]
Hilfe
Suche: Author="Vit{\'a}nyi, Paul M.B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Conditional Kolmogorov complexity and universal probability
Paul M.B. Vitányi
Theoretical Computer Science
501
, 2013, pp. 93-100
Nonapproximability of the normalized information distance
Sebastiaan A. Terwijn
,
Leen Torenvliet
,
Paul M.B. Vitányi
Journal of Computer and System Sciences
77
(4), 2011, pp. 738-742
Time-bounded incompressibility of compressible strings and sequences
Edgar G. Daylight
,
Wouter M. Koolen
,
Paul M.B. Vitányi
Information Processing Letters
109
(18), 2009, pp. 1055-1059
Two heads are better than two tapes
Tao Jiang
,
Joel I. Seiferas
,
Paul M.B. Vitányi
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 668-675
Statistical properties of finite sequences with high Kolmogorov complexity
Ming Li
,
Paul M.B. Vitányi
Math. Systems Theory
27
(4), 1994, pp. 365-376
Kolmogorov complexity arguments in combinatorics
Ming Li
,
Paul M.B. Vitányi
Journal of Combinatorial Theory Series A
66
(2), 1994, pp. 226-236
Thermodynamics of computation and information distance
Charles H. Bennett
,
Péter Gács
,
Ming Li
,
Paul M.B. Vitányi
,
Wojciech H. Zurek
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 21-30
A note on weighted distributed match-making
Evangelos Kranakis
,
Paul M.B. Vitányi
Math. Systems Theory
25
, 1992, pp. 123-140
Inductive reasoning and Kolmogorov complexity
Ming Li
,
Paul M.B. Vitányi
Journal of Computer and System Sciences
44
, 1992, pp. 343-384
Optimality of wait-free atomic multiwriter variables
Ming Li
,
Paul M.B. Vitányi
Information Processing Letters
43
, 1992, pp. 107-112
Average case complexity under the universal distribution equals worst-case complexity
Ming Li
,
Paul M.B. Vitányi
Information Processing Letters
42
, 1992, pp. 145-149
Philosophical issues in Kolmogorov complexity
Ming Li
,
Paul M.B. Vitányi
Lecture Notes in Computer Science
623
, 1992, pp. 1-15
Combinatorics and Kolmogorov complexity
Ming Li
,
Paul M.B. Vitányi
Proceedings of the 6th Annual Conference on Structure in Complexity Theory, CSCT'91 (Chicago, Illinois, June 30-July 3, 1991)
, 1991, pp. 154-163
Learning simple concepts under simple distributions
Ming Li
,
Paul M.B. Vitányi
SIAM Journal on Computing
20
(5), 1991, October, pp. 911-935
A proof technique for register atomicity
Baruch Awerbuch
,
Lefteris M. Kirousis
,
Evangelos Kranakis
,
Paul M.B. Vitányi
Lecture Notes in Computer Science
338
, 1988, pp. 286-303
Counting is easy
Joel I. Seiferas
,
Paul M.B. Vitányi
Journal of the ACM
35
(4), 1988, pp. 985-1000
Locality, communication, and interconnect length in multicomputers
Paul M.B. Vitányi
SIAM Journal on Computing
17
, 1988, pp. 659-672
Counting is easy
Joel I. Seiferas
,
Paul M.B. Vitányi
Technical Report (225), 1987, September
A modest proposal for communication costs in multicomputers (Preliminary Note)
Paul M.B. Vitányi
misc, 1987
Relativized obliviousness
Paul M.B. Vitányi
Lecture Notes in Computer Science
88
, 1980, pp. 665-672
Stable string languages of Lindenmayer systems
Paul M.B. Vitányi
,
Adrian Walker
Information and Control
37
, 1978, pp. 134-149
Context sensitive table Lindenmayer languages and a relation to the LBA problem
Paul M.B. Vitányi
Information and Control
33
, 1977, pp. 217-226