Vitányi, P.M.B. (Paul Michael Béla)
Vitányi, Paul M. B.
Vitányi, P. M. B.
VIAF ID: 94523542 (Personal)
ISNI-test: 0000 0001 1578 4969
- 100 1 _ ‡a Vitanyi, Paul
- 100 1 _ ‡a Vitányi, Paul
- 200 _ | ‡a Vitányi ‡b Paul M. B.
- 100 1 _ ‡a Vitányi, Paul (undifferentiated) (sparse)
- 100 1 0 ‡a Vitányi, P. M. B.
- 100 1 _ ‡a Vitányi, Paul M. B.
4xx's: Alternate Name Forms (5)
- 400 1 _ ‡a Vitanyi, Paul M.
- 400 1 0 ‡a Vitányi, Paul M. B.
- 400 1 _ ‡a Vitányi, P. M. B.
- 400 1 _ ‡a Vitányi, Paul M. B.
- 400 1 _ ‡a Vitányi, Paul Michael Béla
|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|
|A dynamic and quick intellect : 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|
|An introduction to Kolmogorov complexity and its applications|
|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|
|An N1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape|
|A new approach to formal language theory by Kolmogorov complexity|
|Non-sequential computation and laws of nature|
|A note on nonrecursive and deterministic Lindenmayer languages|
|On the power of real-time two-way multihead finite automata with jumps|
|On the size of DOL languages|
|An optimal simulation of counter machines : the ACM case|
|Optimality of wait-free atomic multiwriter variables|
|The power of the queue|
|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)|
|The simple roots of real-time computation hierarchies|
|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|
|The Victorians and Italy literature, travel, politics and art|
Countries of Publication (4)
Selected Publishers (8)
- XX -
- eng - English