Leen Torenvliet Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitanyi: Nonapproximablity of the Normalized Information Distance CoRR abs/0910.4353: (2009)
2008
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoaz Leskes, Leen Torenvliet: The value of agreement a new boosting algorithm. J. Comput. Syst. Sci. 74(4): 557-586 (2008)
2006
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Leen Torenvliet: P-Selectivity, Immunity, and the Power of One Bit. SOFSEM 2006: 323-331
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet, Falk Unger: Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. STACS 2006: 455-468
2005
42no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLS. 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
41no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet: A Post's Program for Complexity Theory. Bulletin of the EATCS 85: 41-51 (2005)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Leen Torenvliet: P-Selectivity, Immunity, and the Power of One Bit CoRR abs/cs/0504096: (2005)
2004
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet: Separating Complexity Classes Using Structural Properties. IEEE Conference on Computational Complexity 2004: 130-138
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarnix Kaart, Jan-Pascal van Best, Willem G. Vree, Leen Torenvliet: The importance of measurements for Internet policy. SMC (5) 2004: 4711-4716
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard 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
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet: Two oracles that force a big crunch. Computational Complexity 10(2): 93-116 (2001)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndris 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)
34no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndris 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
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndris 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
32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet: Separating Complexity Classes Using Autoreducibility. SIAM J. Comput. 29(5): 1497-1520 (2000)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet: Randomness is Hard. SIAM J. Comput. 30(5): 1485-1501 (2000)
1999
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet: Complicated Complementations. IEEE Conference on Computational Complexity 1999: 227-236
1998
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet: Randomness is Hard. IEEE Conference on Computational Complexity 1998: 249-260
28no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSebastiaan Terwijn, Leen Torenvliet: Arithmetical Measure. Math. Log. Q. 44: 277-286 (1998)
27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Albrecht Hoene, Leen Torenvliet: Splittings, Robustness, and Structure of Complete Sets. SIAM J. Comput. 27(3): 637-653 (1998)
1997
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Lance Fortnow, Leen Torenvliet: Six Hypotheses in Search of a Theorem. IEEE Conference on Computational Complexity 1997: 2-12
1996
25no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet: P-Selektive Self-Reducible Sets: A New Characterization of P. J. Comput. Syst. Sci. 53(2): 210-217 (1996)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Leen Torenvliet: Optimal Advice. Theor. Comput. Sci. 154(2): 367-377 (1996)
1995
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Lance Fortnow, Leen Torenvliet: Using Autoreducibility to Separate Complexity Classes. FOCS 1995: 520-527
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet: Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). MFCS 1995: 277-287
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSophie Fischer, Leen Torenvliet: The Malleability of TSP_{2Opt}. WG 1995: 152-166
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeen Torenvliet, Marten Trautwein: A Note on the Complexity of Restricted Attribute-Value Grammars CoRR cmp-lg/9503021: (1995)
1994
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet: On the Cutting Edge of Relativization: The Resource Bounded Injury Method. ICALP 1994: 263-273
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet: On the Structure of Complete Sets. Structure in Complexity Theory Conference 1994: 118-133
1993
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Albrecht Hoene, Leen Torenvliet: Splittings, Robustness and Structure of Complete Sets. STACS 1993: 175-184
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Peter van Helden, Leen Torenvliet: P-Selective Self-reducibles Sets: A New Characterization of P. Structure in Complexity Theory Conference 1993: 44-51
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Edith Spaan, Leen Torenvliet: The Relative Power of Logspace and Polynomial Time Reductions. Computational Complexity 3: 231-244 (1993)
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet, Peter van Emde Boas: Twenty Questions to a P-Selector. Inf. Process. Lett. 48(4): 201-204 (1993)
1992
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Edith Spaan, Leen Torenvliet: Bounded Reductions. Complexity Theory: Current Research 1992: 83-99
1991
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Edith Spaan, Leen Torenvliet: Bounded Reductions. STACS 1991: 410-421
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Steven Homer, Leen Torenvliet: Completeness for Nondeterministic Complexity Classes. Mathematical Systems Theory 24(3): 179-200 (1991)
1990
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRicard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar: Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). MFCS 1990: 269-276
1989
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas: Multiple Representations of Dynamic Data Structures. IFIP Congress 1989: 437-442
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Spaan, Leen Torenvliet, Peter van Emde Boas: Nondeterminism fairness and a fundamental analogy. Bulletin of the EATCS 37: 186-193 (1989)
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichiel 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)
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeen Torenvliet, Peter van Emde Boas: Simplicity, Immunity, Relativizations and Nondeterminism Inf. Comput. 80(1): 1-17 (1989)
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichiel 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
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeen Torenvliet: A Second Step Toward the Strong Polynomial-Time Hierarchy. Mathematical Systems Theory 21(2): 99-123 (1988)
1986
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeen Torenvliet, Peter van Emde Boas: Diagonalisation methods in a polynomial setting. Structure in Complexity Theory Conference 1986: 330-346
1985
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeen Torenvliet, Peter van Emde Boas: Combined Simplicity and Immunity in Relativized NP. STACS 1985: 339-350
1983
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeen Torenvliet, Peter van Emde Boas: The Reconstruction and Optimization of Trie Hashing Functions. VLDB 1983: 142-156

Coauthor Index

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

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Complete | Author
Copyright © Wed Nov 25 14:46:41 2009 by Michael Ley (ley@uni-trier.de)