Paul M. B. Vitányi

From MaRDI portal
(Redirected from Person:354146)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Algorithmic arguments in physics of computation
Lecture Notes in Computer Science
2022-12-16Paper
Average-case analysis via incompressibility
Fundamentals of Computation Theory
2022-12-09Paper
Randomized two-process wait-free test-and-set
Distributed Computing
2020-12-03Paper
Randomized naming using wait-free shared variables2020-12-02Paper
Philosophical issues in Kolmogorov complexity
Automata, Languages and Programming
2019-12-04Paper
Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines
Theoretical Computer Science
2019-06-06Paper
Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines
Theoretical Computer Science
2019-06-06Paper
Corrigendum to: ``On the rate of decrease in logical depth'' by by L. F. Antunes, A. Souto, and P. M. B. Vitányi
Theoretical Computer Science
2019-05-02Paper
An introduction to Kolmogorov complexity and its applications
Texts in Computer Science
2019-02-15Paper
Obituary: Ray Solomonoff, founding father of algorithmic information theory
Algorithms
2018-08-20Paper
On the average-case complexity of Shellsort
Random Structures & Algorithms
2018-06-07Paper
On the average-case complexity of Shellsort
Random Structures & Algorithms
2018-06-07Paper
On the rate of decrease in logical depth
Theoretical Computer Science
2017-11-06Paper
Exact Expression For Information Distance
IEEE Transactions on Information Theory
2017-10-19Paper
Approximation of the Two-Part MDL Code
IEEE Transactions on Information Theory
2017-08-08Paper
Information Distance in Multiples
IEEE Transactions on Information Theory
2017-07-27Paper
Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity
IEEE Transactions on Information Theory
2017-07-27Paper
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
IEEE Transactions on Computers
2017-07-12Paper
Identification of probabilities
Journal of Mathematical Psychology
2017-02-28Paper
Similarity and denoising
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
2017-01-13Paper
Two heads are better than two tapes
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94
2016-09-01Paper
Bounded concurrent timestamp systems using vector clocks
Journal of the ACM
2015-10-30Paper
A lower bound on the average-case complexity of shellsort
Journal of the ACM
2015-09-19Paper
Optimal routing tables
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96
2015-09-11Paper
Thermodynamics of computation and information distance
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93
2015-05-07Paper
Conditional Kolmogorov complexity and universal probability
Theoretical Computer Science
2014-01-10Paper
Tolstoy's mathematics in ``War and peace''
The Mathematical Intelligencer
2013-07-18Paper
Identification of Probabilities of Languages2012-08-24Paper
Nonapproximability of the normalized information distance
Journal of Computer and System Sciences
2011-04-28Paper
A fast quartet tree heuristic for hierarchical clustering
Pattern Recognition
2011-01-31Paper
A fast quartet tree heuristic for hierarchical clustering
Pattern Recognition
2011-01-31Paper
Time-bounded incompressibility of compressible strings and sequences
Information Processing Letters
2010-08-20Paper
Physics and the new computation
Lecture Notes in Computer Science
2010-06-17Paper
Genetic fitness optimization using rapidly mixing Markov chains
Lecture Notes in Computer Science
2010-04-27Paper
Depth as randomness deficiency
Theory of Computing Systems
2009-10-19Paper
Sharpening Occam's razor
Information Processing Letters
2009-03-23Paper
Normalized Information Distance
Information Theory and Statistical Learning
2009-03-12Paper
Clustering by Compression
IEEE Transactions on Information Theory
2008-12-21Paper
The Similarity Metric
IEEE Transactions on Information Theory
2008-12-21Paper
Kolmogorov's Structure Functions and Model Selection
IEEE Transactions on Information Theory
2008-12-21Paper
Meaningful Information
IEEE Transactions on Information Theory
2008-12-21Paper
Algorithmic chaos and the incompressibility method2008-06-27Paper
An introduction to Kolmogorov complexity and its applications
Texts in Computer Science
2008-06-04Paper
`Ideal learning' of natural language: positive results about learning from positive evidence
Journal of Mathematical Psychology
2007-10-01Paper
STACS 2004
Lecture Notes in Computer Science
2007-10-01Paper
Individual communication complexity
Journal of Computer and System Sciences
2007-08-23Paper
Theory and Applications of Models of Computation
Lecture Notes in Computer Science
2007-04-30Paper
Correction to "CDMA systems in fading channels: admissibility, network capacity, and power control"
IEEE Transactions on Information Theory
2005-05-11Paper
Correction to "Algorithmic statistics"
IEEE Transactions on Information Theory
2005-05-11Paper
Mutual search
Journal of the ACM
2005-01-25Paper
scientific article; zbMATH DE number 2089996 (Why is no real title available?)2004-08-12Paper
scientific article; zbMATH DE number 2080439 (Why is no real title available?)2004-08-04Paper
scientific article; zbMATH DE number 2079851 (Why is no real title available?)2004-08-03Paper
scientific article; zbMATH DE number 2079424 (Why is no real title available?)2004-07-28Paper
scientific article; zbMATH DE number 2013826 (Why is no real title available?)2003-12-07Paper
scientific article; zbMATH DE number 1979532 (Why is no real title available?)2003-09-14Paper
Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers
Journal of Logic, Language and Information
2003-09-01Paper
The generalized universal law of generalization.
Journal of Mathematical Psychology
2003-08-25Paper
scientific article; zbMATH DE number 1833412 (Why is no real title available?)2002-11-21Paper
The average‐case area of Heilbronn‐type triangles*
Random Structures & Algorithms
2002-08-08Paper
Algorithmic statistics
IEEE Transactions on Information Theory
2002-08-04Paper
Quantum Kolmogorov complexity based on classical descriptions
IEEE Transactions on Information Theory
2002-08-04Paper
Quantum Kolmogorov complexity based on classical descriptions
IEEE Transactions on Information Theory
2002-08-04Paper
scientific article; zbMATH DE number 1754652 (Why is no real title available?)2002-06-12Paper
On the simulation of many storage heads by one
Theoretical Computer Science
2002-05-13Paper
scientific article; zbMATH DE number 1696671 (Why is no real title available?)2002-01-28Paper
Time and space bounds for reversible simulation
Journal of Physics A: Mathematical and General
2002-01-27Paper
scientific article; zbMATH DE number 1408350 (Why is no real title available?)2002-01-24Paper
scientific article; zbMATH DE number 1555924 (Why is no real title available?)2001-01-24Paper
Applying MDL to learn best model granularity
Artificial Intelligence
2000-10-26Paper
Minimum description length induction, Bayesianism, and Kolmogorov complexity
IEEE Transactions on Information Theory
2000-09-07Paper
A discipline of evolutionary programming
Theoretical Computer Science
2000-08-21Paper
New applications of the incompressibility method. II
Theoretical Computer Science
2000-06-04Paper
scientific article; zbMATH DE number 1405647 (Why is no real title available?)2000-04-25Paper
The miraculous universal distribution
The Mathematical Intelligencer
2000-04-02Paper
Kolmogorov Random Graphs and the Incompressibility Method
SIAM Journal on Computing
2000-03-19Paper
New Applications of the Incompressibility Method
The Computer Journal
2000-01-17Paper
Average-case analysis of algorithms using Kolmogorov complexity
Journal of Computer Science and Technology
2000-01-01Paper
Information distance
IEEE Transactions on Information Theory
1999-11-21Paper
Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
SIAM Journal on Computing
1999-10-28Paper
scientific article; zbMATH DE number 1303590 (Why is no real title available?)1999-06-17Paper
scientific article; zbMATH DE number 1142293 (Why is no real title available?)1998-05-04Paper
Two heads are better than two tapes
Journal of the ACM
1998-02-17Paper
Two heads are better than two tapes
Journal of the ACM
1998-02-17Paper
How to share concurrent wait-free variables
Journal of the ACM
1998-01-22Paper
How to share concurrent wait-free variables
Journal of the ACM
1998-01-22Paper
scientific article; zbMATH DE number 1010621 (Why is no real title available?)1997-05-19Paper
scientific article; zbMATH DE number 1008511 (Why is no real title available?)1997-05-12Paper
Reversibility and adiabatic computation: trading time and space for energy
Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
1997-03-23Paper
scientific article; zbMATH DE number 845624 (Why is no real title available?)1996-06-26Paper
scientific article; zbMATH DE number 809134 (Why is no real title available?)1996-03-14Paper
Erratum to: Kolmogorov complexity arguments in combinatorics
Journal of Combinatorial Theory. Series A
1995-06-30Paper
A New Approach to Formal Language Theory by Kolmogorov Complexity
SIAM Journal on Computing
1995-05-30Paper
scientific article; zbMATH DE number 740676 (Why is no real title available?)1995-04-03Paper
Kolmogorov complexity arguments in combinatorics
Journal of Combinatorial Theory. Series A
1995-01-12Paper
Statistical properties of finite sequences with high Kolmogorov complexity
Mathematical Systems Theory
1994-08-10Paper
scientific article; zbMATH DE number 176218 (Why is no real title available?)1993-05-18Paper
scientific article; zbMATH DE number 107774 (Why is no real title available?)1993-01-23Paper
Optimality of wait-free atomic multiwriter variables
Information Processing Letters
1993-01-17Paper
Average case complexity under the universal distribution equals worst- case complexity
Information Processing Letters
1993-01-16Paper
The Power of the Queue
SIAM Journal on Computing
1992-12-14Paper
scientific article; zbMATH DE number 67636 (Why is no real title available?)1992-09-27Paper
Inductive reasoning and Kolmogorov complexity
Journal of Computer and System Sciences
1992-09-27Paper
A note on weighted distributed match-making
Mathematical Systems Theory
1992-09-26Paper
Learning Simple Concepts under Simple Distributions
SIAM Journal on Computing
1992-06-26Paper
scientific article; zbMATH DE number 4117885 (Why is no real title available?)1989-01-01Paper
scientific article; zbMATH DE number 4096767 (Why is no real title available?)1988-01-01Paper
scientific article; zbMATH DE number 4086981 (Why is no real title available?)1988-01-01Paper
scientific article; zbMATH DE number 4062556 (Why is no real title available?)1988-01-01Paper
scientific article; zbMATH DE number 4047662 (Why is no real title available?)1988-01-01Paper
Distributed match-making
Algorithmica
1988-01-01Paper
Tape versus queue and stacks: The lower bounds
Information and Computation
1988-01-01Paper
Counting is easy
Journal of the ACM
1988-01-01Paper
Locality, Communication, and Interconnect Length in Multicomputers
SIAM Journal on Computing
1988-01-01Paper
scientific article; zbMATH DE number 3988713 (Why is no real title available?)1986-01-01Paper
scientific article; zbMATH DE number 3958735 (Why is no real title available?)1986-01-01Paper
scientific article; zbMATH DE number 4009785 (Why is no real title available?)1986-01-01Paper
scientific article; zbMATH DE number 3928765 (Why is no real title available?)1986-01-01Paper
An Optimal Simulation of Counter Machines
SIAM Journal on Computing
1985-01-01Paper
An Optimal Simulation of Counter Machines: The ACM Case
SIAM Journal on Computing
1985-01-01Paper
Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit
Information Processing Letters
1985-01-01Paper
An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape
Information Processing Letters
1985-01-01Paper
scientific article; zbMATH DE number 3965440 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3943032 (Why is no real title available?)1984-01-01Paper
On the power of real-time two-way multihead finite automata with jumps
Information Processing Letters
1984-01-01Paper
On two-tape real-time computation and queues
Journal of Computer and System Sciences
1984-01-01Paper
scientific article; zbMATH DE number 3825170 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3750291 (Why is no real title available?)1982-01-01Paper
scientific article; zbMATH DE number 3750292 (Why is no real title available?)1982-01-01Paper
scientific article; zbMATH DE number 3759551 (Why is no real title available?)1982-01-01Paper
On efficient simulations of multicounter machines
Information and Control
1982-01-01Paper
scientific article; zbMATH DE number 3713185 (Why is no real title available?)1981-01-01Paper
A note on dpda transductions of {0,1}<sup>∗</sup>and inverse dpda transductions of the dyck set
International Journal of Computer Mathematics
1981-01-01Paper
How well can a graph be n-colored?
Discrete Mathematics
1981-01-01Paper
scientific article; zbMATH DE number 3692651 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3684912 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3657127 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3657128 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3673532 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3673533 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3696502 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3700206 (Why is no real title available?)1980-01-01Paper
Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations
Information Processing Letters
1980-01-01Paper
scientific article; zbMATH DE number 3646279 (Why is no real title available?)1979-01-01Paper
scientific article; zbMATH DE number 3648124 (Why is no real title available?)1979-01-01Paper
Stable string languages of lindenmayer systems
Information and Control
1978-01-01Paper
A note on the recursive enumerability of some classes of recursively enumerable languages
Information Sciences
1978-01-01Paper
On inverse deterministic pushdown transductions
Journal of Computer and System Sciences
1978-01-01Paper
scientific article; zbMATH DE number 3550189 (Why is no real title available?)1977-01-01Paper
Context sensitive table linden mayer languages and a relation to the LBA problem
Information and Control
1977-01-01Paper
Growth Functions Associated with Biological Development
The American Mathematical Monthly
1976-01-01Paper
On a problem in the collective behavior of automata
Discrete Mathematics
1976-01-01Paper
Deterministic Lindenmayer languages, nonterminals and homomorphisms
Theoretical Computer Science
1976-01-01Paper
scientific article; zbMATH DE number 3459899 (Why is no real title available?)1974-01-01Paper
scientific article; zbMATH DE number 3470029 (Why is no real title available?)1974-01-01Paper
scientific article; zbMATH DE number 3443190 (Why is no real title available?)1973-01-01Paper
Sexually reproducing cellular automata
Mathematical Biosciences
1973-01-01Paper
scientific article; zbMATH DE number 3398797 (Why is no real title available?)1972-01-01Paper


Research outcomes over time


This page was built for person: Paul M. B. Vitányi