Vitányi, Paul
89  Ergebnisse:
Personensuche X
?
1

On the average‐case complexity of Shellsort:

Vitányi, Paul
Random Structures & Algorithms.  52 (2017)  2 - p. 354-363 , 2017
 
?
3

Depth as Randomness Deficiency:

Antunes, Luís ; Matos, Armando ; Souto, André.
Theory of Computing Systems.  45 (2009)  4 - p. 724-739 , 2009
 
?
4

'Ideal learning' of natural language: Positive results abou..:

Chater, Nick ; Vitányi, Paul
Journal of Mathematical Psychology.  51 (2007)  3 - p. 135-163 , 2007
 
?
5

Individual communication complexity:

Buhrman, Harry ; Klauck, Hartmut ; Vereshchagin, Nikolai.
Journal of Computer and System Sciences.  73 (2007)  6 - p. 973-985 , 2007
 
?
9

Sharpening Occam's razor:

Li, Ming ; Tromp, John ; Vitányi, Paul
Information Processing Letters.  85 (2003)  5 - p. 267-274 , 2003
 
?
10

Simplicity: a unifying principle in cognitive science?:

Chater, Nick ; Vitányi, Paul
Trends in Cognitive Sciences.  7 (2003)  1 - p. 19-22 , 2003
 
?
11

Bounded concurrent timestamp systems using vector clocks:

Haldar, Sibsankar ; Vitányi, Paul
Journal of the ACM (JACM).  49 (2002)  1 - p. 101-126 , 2002
 
?
13

Randomized two-process wait-free test-and-set:

Tromp, John ; Vitányi, Paul
Distributed Computing.  15 (2002)  3 - p. 127-135 , 2002
 
?
14

The average‐case area of Heilbronn‐type triangles*:

Jiang, Tao ; Li, Ming ; Vitányi, Paul
Random Structures & Algorithms.  20 (2002)  2 - p. 206-219 , 2002
 
?
15

Time and space bounds for reversible simulation:

Buhrman, Harry ; Tromp, John ; Vitányi, Paul
Journal of Physics A: Mathematical and General.  34 (2001)  35 - p. 6821-6830 , 2001
 
1-15