2003q1 Archives by Author

• Messages sorted by: [ thread ] [ subject ] [ date ]
• More info on this list...

Starting: Sat Jan 18 21:37:19 2003
Ending: Tue Feb 18 15:04:46 2003
Messages: 11

• [KC-List] AT LEAST ONE BIT STRING IS INCOMPRESSIBLE.   Harry Buhrman
• [KC-List] AT LEAST ONE BIT STRING IS INCOMPRESSIBLE.   Ming Li
• [KC-List] Kolmogorov's web sites   NAFTCORP@aol.com
• [KC-List] AT LEAST ONE BIT STRING IS INCOMPRESSIBLE.   Andrei E. Romashchenko
• [KC-List] International Symposium on Information and Communication Technologies   International Symposium on Information and Communication Technologies
• [KC-List] AT LEAST ONE BIT STRING IS INCOMPRESSIBLE.   P. Vitanyi
• [KC-List] Is the universal supermartingale universal for all random sequences?   P. Vitanyi
• [KC-List] time complexity   P. Vitanyi
• [KC-List] AT LEAST ONE BIT STRING IS INCOMPRESSIBLE.   John R W Woodward
• [KC-List] time complexity   John R W Woodward
• [KC-List] Is the universal supermartingale universal for all random sequences?   staiger@informatik.uni-halle.de

Last message date: Tue Feb 18 15:04:46 2003
Archived on: Tue Feb 18 16:27:01 2003

• Messages sorted by: [ thread ] [ subject ] [ date ]
• More info on this list...