| P-selective self-reducible sets: A new characterization of P H Buhrman, L Torenvliet journal of computer and system sciences 53 (2), 210-217, 1996 | 67 | 1996 |
| Theory of semi-feasible algorithms LA Hemaspaandra, L Torenvliet Springer Science & Business Media, 2013 | 49 | 2013 |
| Completeness for nondeterministic complexity classes H Buhrman, S Homer, L Torenvliet Mathematical Systems Theory 24 (1), 179-200, 1991 | 46 | 1991 |
| Using autoreducibility to separate complexity classes H Buhrman, L Fortnow, L Torenvliet Proceedings of IEEE 36th Annual Foundations of Computer Science, 520-527, 1995 | 44 | 1995 |
| On the structure of complete sets H Buhrman, L Torenvliet Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory …, 1994 | 42 | 1994 |
| Nonapproximability of the normalized information distance SA Terwijn, L Torenvliet, PMB Vitányi Journal of Computer and System Sciences 77 (4), 738-742, 2011 | 41 | 2011 |
| Twenty questions to a P-selector H Buhrman, L Torenvliet, P van Emde Boas Information Processing Letters 48 (4), 201-204, 1993 | 38 | 1993 |
| Separating complexity classes using autoreducibility H Buhrman, L Fortnow, D Van Melkebeek, L Torenvliet SIAM Journal on Computing 29 (5), 1497-1520, 2000 | 34 | 2000 |
| Optimal advice LA Hemaspaandra, L Torenvliet Theoretical Computer Science 154 (2), 367-377, 1996 | 32 | 1996 |
| Bounded reductions H Buhrman, E Spaan, L Torenvliet STACS 91: 8th Annual Symposium on Theoretical Aspects of Computer Science …, 1991 | 32 | 1991 |
| Enumerations of the Kolmogorov function R Beigel, H Buhrman, P Fejer, L Fortnow, P Grabowski, L Longpré, ... The Journal of Symbolic Logic 71 (2), 501-528, 2006 | 31 | 2006 |
| The value of agreement a new boosting algorithm B Leskes, L Torenvliet Journal of Computer and System Sciences 74 (4), 557-586, 2008 | 30 | 2008 |
| Randomness is hard H Buhrman, L Torenvliet SIAM Journal on Computing 30 (5), 1485-1501, 2000 | 28 | 2000 |
| Semi-membership algorithms: Some recent advances D Denny-Brown, Y Han, LA Hemaspaandra, L Torenvliet ACM SIGACT News 25 (3), 12-23, 1994 | 26 | 1994 |
| Nondeterminism, fairness and a fundamental analogy E Spaan, L Torenvliet, P van Emde Boas | 26 | 1988 |
| Splittings, robustness, and structure of complete sets H Buhrman, A Hoene, L Torenvliet SIAM Journal on Computing 27 (3), 637-653, 1998 | 25 | 1998 |
| Complete sets and structure in subrecursive classes H Buhrman, L Torenvliet Proceedings of Logic Colloquium 96, 45-78, 1998 | 25 | 1998 |
| A Post's Program for Complexity Theory. H Buhrman, L Torenvliet Bull. EATCS 85, 41-51, 2005 | 23 | 2005 |
| The relative power of logspace and polynomial time reductions H Buhrman, E Spaan, L Torenvliet Computational Complexity 3, 231-244, 1993 | 19 | 1993 |
| The communication complexity of enumeration, elimination, and selection A Ambainis, H Buhrman, W Gasarch, B Kalyanasundaram, L Torenvliet Journal of Computer and System Sciences 63 (2), 148-185, 2001 | 18 | 2001 |
Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftVerified email at quantinuum.com
