AAAAAA

   
Results: 1-9 |
Results: 9
Time and space bounds for reversible simulation
Authors: Buhrman, H Tromp, J Vitanyi, P
Citation: H. Buhrman et al., Time and space bounds for reversible simulation, J PHYS A, 34(35), 2001, pp. 6821-6830
A lower bound on the average-case complexity of shellsort
Authors: Jiang, T Li, M Vitanyi, P
Citation: T. Jiang et al., A lower bound on the average-case complexity of shellsort, J ACM, 47(5), 2000, pp. 905-911
A discipline of evolutionary programming
Authors: Vitanyi, P
Citation: P. Vitanyi, A discipline of evolutionary programming, THEOR COMP, 241(1-2), 2000, pp. 3-23
New applications of the incompressibility method: Part II
Authors: Buhrman, H Jiang, T Li, M Vitanyi, P
Citation: H. Buhrman et al., New applications of the incompressibility method: Part II, THEOR COMP, 235(1), 2000, pp. 59-70
Applying MDL to learn best model granularity
Authors: Gao, Q Li, M Vitanyi, P
Citation: Q. Gao et al., Applying MDL to learn best model granularity, ARTIF INTEL, 121(1-2), 2000, pp. 1-29
Mutual search
Authors: Buhrman, H Franklin, M Garay, JA Hoepman, JH Tromp, J Vitanyi, P
Citation: H. Buhrman et al., Mutual search, J ACM, 46(4), 1999, pp. 517-536
Kolmogorov random graphs and the incompressibility method
Authors: Buhrman, H Li, M Tromp, J Vitanyi, P
Citation: H. Buhrman et al., Kolmogorov random graphs and the incompressibility method, SIAM J COMP, 29(2), 1999, pp. 590-599
Space-efficient routing tables for almost all networks and the incompressibility method
Authors: Buhrman, H Hoepman, JH Vitanyi, P
Citation: H. Buhrman et al., Space-efficient routing tables for almost all networks and the incompressibility method, SIAM J COMP, 28(4), 1999, pp. 1414-1432
New applications of the incompressibility method
Authors: Jiang, T Li, M Vitanyi, P
Citation: T. Jiang et al., New applications of the incompressibility method, COMPUTER J, 42(4), 1999, pp. 287-293
Risultati: 1-9 |