Examples: Prince; Princeton University; Ken Follett; Follett,Ken
1shortlisttitle datasearch history  
results search [or] ISN:0000000115784969 | 1 hits
0000 0001 1578 4969
Vitányi, P. M. B.
Vitányi, Paul
Vitanyi, Paul M.
Vitányi, Paul M. B.
Vitányi, Paul Michael Béla
born 1944-07-21
Creation class: 
Computer file
Language material
Creation role: 
Related names: 
Jiang, Tao (1963-)
Kirousis, Lefteris M.
Kranakis, E.
Kranakis, Evangelos
Leeuwen, Jan van (1946-)
Li, Ming (1955 July 16-)
Mullender, Sape J. (1953-)
Mullender, Sape Jurriën (1953-)
Seiferas, J.
Seiferas, Joel I.
Stichting Mathematisch Centrum (Amsterdam)
Tel, Gerard
Tromp, Johannes Theodorus (1966-)
Tromp, John (1966-)
Vrije Universiteit, Amsterdam
Area penalty for sublinear signal propagation delay on chip
Atomic shared register access by asynchronous hardware (detailed abstract)
Average case complexity under the universal distribution equals worst case complexity
Big omega versus the wild functions
Colloquium complexiteit en algoritmen
Computational learning theory second European conference, EuroCOLT '95, Barcelona, Spain, March 13-15, 1995 : proceedings
Counting is easy
Development, growth and time
Distributed algorithms : 8th international workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994 : proceedings
Distributed elections in an Archimedean ring of processors
Distributed match-making for processes in computer networks
DOL-languages and a feasible solution for a word problem
dynamic and quick intellect, A : Paul Vitányi, 25 years @CWI
Efficient implementations of multicounter machines on oblivious turing machines, acyclic ligis networks and VISI
Growth of strings in context dependent Lindenmayer systems
How to share concurrent wait-free variables
Inductive reasoning
introduction to Kolmogorov complexity and its applications, An
Kolmogorov complexity arguments in combinatorics
Lindenmayer systems : structure, languages, and growth functions
Locality, communication and interconnect length in multicomputers
Mathematical theory of thermodynamics of computation
Model selection for neural networks : comparing MDL and NIC
N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape, An
new approach to formal language theory by Kolmogorov complexity, A
Non-sequential computation and laws of nature
note on nonrecursive and deterministic Lindenmayer languages, A
On the power of real-time two-way multihead finite automata with jumps
On the size of DOL languages
optimal simulation of counter machines, An : the ACM case
Optimality of wait-free atomic multiwriter variables
power of the queue, The
Randomized wait-free test-and-set
Real-time simulation of multicounters by oblivious one-tape turing machines (preliminary draft)
Sharpening Occam's razor : (extended abstract)
Signal propagation delay, wire length distribution and the efficiency of VLSI circuits
Simple multireader registers using time-stamp schemes (extended abstract)
simple roots of real-time computation hierarchies, The
Square time is optimal for simulation of one pushdown store by an oblivious one-head tape unit
Tape versus queue and stacks: the lower bounds
Time-driven algorithms for distributed control
Two decades of applied Kolmogorov complexity : in memoriam Andrei Nikolaevich Kolmogorov 1903-1987
Two heads are better than two tapes
Victorians and Italy literature, travel, politics and art, The
Summary in Dutch
Thesis--Vrije Universiteit, Amsterdam