Leen Torenvliet

2008
45	EE	Boaz Leskes, Leen Torenvliet: The value of agreement a new boosting algorithm. J. Comput. Syst. Sci. 74(4): 557-586 (2008)
2006
44	EE	Lane A. Hemaspaandra, Leen Torenvliet: P-Selectivity, Immunity, and the Power of One Bit. SOFSEM 2006: 323-331
43	EE	Harry Buhrman, Leen Torenvliet, Falk Unger: Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. STACS 2006: 455-468
2005
42		S. Barry Cooper, Benedikt Löwe, Leen Torenvliet: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings Springer 2005
41		Harry Buhrman, Leen Torenvliet: A Post's Program for Complexity Theory. Bulletin of the EATCS 85: 41-51 (2005)
40	EE	Lane A. Hemaspaandra, Leen Torenvliet: P-Selectivity, Immunity, and the Power of One Bit CoRR abs/cs/0504096: (2005)
2004
39	EE	Harry Buhrman, Leen Torenvliet: Separating Complexity Classes Using Structural Properties. IEEE Conference on Computational Complexity 2004: 130-138
38	EE	Marnix Kaart, Jan-Pascal van Best, Willem Vree, Leen Torenvliet: The importance of measurements for Internet policy. SMC (5) 2004: 4711-4716
37	EE	Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet: Enumerations of the Kolmogorov Function Electronic Colloquium on Computational Complexity (ECCC)(015): (2004)
2001
36	EE	Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet: Two oracles that force a big crunch. Computational Complexity 10(2): 93-116 (2001)
35	EE	Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet: The Communication Complexity of Enumeration, Elimination, and Selection Electronic Colloquium on Computational Complexity (ECCC) 8(19): (2001)
34		Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet: The Communication Complexity of Enumeration, Elimination, and Selection. J. Comput. Syst. Sci. 63(2): 148-185 (2001)
2000
33	EE	Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet: The Communication Complexity of Enumeration, Elimination, and Selection. IEEE Conference on Computational Complexity 2000: 44-53
32		Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet: Separating Complexity Classes Using Autoreducibility. SIAM J. Comput. 29(5): 1497-1520 (2000)
31	EE	Harry Buhrman, Leen Torenvliet: Randomness is Hard. SIAM J. Comput. 30(5): 1485-1501 (2000)
1999
30	EE	Harry Buhrman, Leen Torenvliet: Complicated Complementations. IEEE Conference on Computational Complexity 1999: 227-236
1998
29	EE	Harry Buhrman, Leen Torenvliet: Randomness is Hard. IEEE Conference on Computational Complexity 1998: 249-260
28		Sebastiaan Terwijn, Leen Torenvliet: Arithmetical Measure. Math. Log. Q. 44: 277-286 (1998)
27		Harry Buhrman, Albrecht Hoene, Leen Torenvliet: Splittings, Robustness, and Structure of Complete Sets. SIAM J. Comput. 27(3): 637-653 (1998)
1997
26	EE	Harry Buhrman, Lance Fortnow, Leen Torenvliet: Six Hypotheses in Search of a Theorem. IEEE Conference on Computational Complexity 1997: 2-12
1996
25		Harry Buhrman, Leen Torenvliet: P-Selektive Self-Reducible Sets: A New Characterization of P. J. Comput. Syst. Sci. 53(2): 210-217 (1996)
24	EE	Lane A. Hemaspaandra, Leen Torenvliet: Optimal Advice. Theor. Comput. Sci. 154(2): 367-377 (1996)
1995
23		Harry Buhrman, Lance Fortnow, Leen Torenvliet: Using Autoreducibility to Separate Complexity Classes. FOCS 1995: 520-527
22		Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet: Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). MFCS 1995: 277-287
21		Sophie Fischer, Leen Torenvliet: The Malleability of TSP_{2Opt}. WG 1995: 152-166
20	EE	Leen Torenvliet, Marten Trautwein: A Note on the Complexity of Restricted Attribute-Value Grammars CoRR cmp-lg/9503021: (1995)
1994
19		Harry Buhrman, Leen Torenvliet: On the Cutting Edge of Relativization: The Resource Bounded Injury Method. ICALP 1994: 263-273
18		Harry Buhrman, Leen Torenvliet: On the Structure of Complete Sets. Structure in Complexity Theory Conference 1994: 118-133
1993
17		Harry Buhrman, Albrecht Hoene, Leen Torenvliet: Splittings, Robustness and Structure of Complete Sets. STACS 1993: 175-184
16		Harry Buhrman, Peter van Helden, Leen Torenvliet: P-Selective Self-reducibles Sets: A New Characterization of P. Structure in Complexity Theory Conference 1993: 44-51
15		Harry Buhrman, Edith Spaan, Leen Torenvliet: The Relative Power of Logspace and Polynomial Time Reductions. Computational Complexity 3: 231-244 (1993)
14		Harry Buhrman, Leen Torenvliet, Peter van Emde Boas: Twenty Questions to a P-Selector. Inf. Process. Lett. 48(4): 201-204 (1993)
1992
13		Harry Buhrman, Edith Spaan, Leen Torenvliet: Bounded Reductions. Complexity Theory: Current Research 1992: 83-99
1991
12		Harry Buhrman, Edith Spaan, Leen Torenvliet: Bounded Reductions. STACS 1991: 410-421
11		Harry Buhrman, Steven Homer, Leen Torenvliet: Completeness for Nondeterministic Complexity Classes. Mathematical Systems Theory 24(3): 179-200 (1991)
1990
10		Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar: Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). MFCS 1990: 269-276
1989
9		Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas: Multiple Representations of Dynamic Data Structures. IFIP Congress 1989: 437-442
8		Edith Spaan, Leen Torenvliet, Peter van Emde Boas: Nondeterminism fairness and a fundamental analogy. Bulletin of the EATCS 37: 186-193 (1989)
7		Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars: Two Models for the Reconstruction Problem for Dynamic Data Structures. Elektronische Informationsverarbeitung und Kybernetik 25(4): 131-155 (1989)
6		Leen Torenvliet, Peter van Emde Boas: Simplicity, Immunity, Relativizations and Nondeterminism Inf. Comput. 80(1): 1-17 (1989)
5		Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas: Maintaining Multiple Representations of Dynamic Data Structures Inf. Comput. 83(2): 206-233 (1989)
1988
4		Leen Torenvliet: A Second Step Toward the Strong Polynomial-Time Hierarchy. Mathematical Systems Theory 21(2): 99-123 (1988)
1986
3		Leen Torenvliet, Peter van Emde Boas: Diagonalisation methods in a polynomial setting. Structure in Complexity Theory Conference 1986: 330-346
1985
2		Leen Torenvliet, Peter van Emde Boas: Combined Simplicity and Immunity in Relativized NP. STACS 1985: 339-350
1983
1	EE	Leen Torenvliet, Peter van Emde Boas: The Reconstruction and Optimization of Trie Hashing Functions. VLDB 1983: 142-156

Coauthor Index

1	Andris Ambainis	[33] [34] [35]
2	José L. Balcázar	[10]
3	Richard Beigel	[37]
4	Jan-Pascal van Best	[38]
5	Peter van Emde Boas	[1] [2] [3] [5] [6] [7] [8] [9] [14]
6	Harry Buhrman	[11] [12] [13] [14] [15] [16] [17] [18] [19] [23] [25] [26] [27] [29] [30] [31] [32] [33] [34] [35] [36] [37] [39] [41] [43]
7	S. Barry Cooper	[42]
8	Peter A. Fejer	[37]
9	Stephen A. Fenner	[36]
10	Sophie Fischer	[21] [22]
11	Lance Fortnow	[23] [26] [32] [36] [37]
12	William I. Gasarch	[33] [34] [35]
13	Ricard Gavaldà	[10]
14	Piotr Grabowski	[37]
15	Peter van Helden	[16]
16	Edith Hemaspaandra (Edith Spaan)	[8] [12] [13] [15]
17	Lane A. Hemaspaandra (Lane A. Hemachandra)	[22] [24] [40] [44]
18	Albrecht Hoene	[17] [27]
19	Steven Homer	[11]
20	Marnix Kaart	[38]
21	Bala Kalyanasundaram	[33] [34] [35]
22	Boaz Leskes	[45]
23	Luc Longpré	[37]
24	Benedikt Löwe	[42]
25	Dieter van Melkebeek	[32]
26	Andrej Muchnik (Andrei A. Muchnik)	[37]
27	Mark H. Overmars	[5] [7] [9]
28	Michiel H. M. Smid	[5] [7] [9]
29	Frank Stephan	[37]
30	Sebastiaan Terwijn	[28]
31	Marten Trautwein	[20]
32	Falk Unger	[43]
33	Willem Vree	[38]
34	Osamu Watanabe	[10]

Colors in the list of coauthors