Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Leen Torenvliet
2010 – today
- 2011
[j22]Sebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi: Nonapproximability of the normalized information distance. J. Comput. Syst. Sci. 77(4): 738-742 (2011)- 2010
- [j21]Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet: Non-Uniform Reductions. Theory Comput. Syst. 47(2): 317-341 (2010)
- [i7]Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi: Normalized Information Distance is Not Semicomputable. CoRR abs/1006.3275 (2010)
- [i6]Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin: Sparse Selfreducible Sets and Nonuniform Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC) 17: 163 (2010)
2000 – 2009
- 2009
- [i5]Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi: Nonapproximablity of the Normalized Information Distance. CoRR abs/0910.4353 (2009)
- 2008
- [j20]Boaz Leskes, Leen Torenvliet: The value of agreement a new boosting algorithm. J. Comput. Syst. Sci. 74(4): 557-586 (2008)
- 2006
- [j19]Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet: Enumerations of the Kolmogorov function. J. Symb. Log. 71(2): 501-528 (2006)
- [c22]Lane A. Hemaspaandra, Leen Torenvliet: P-Selectivity, Immunity, and the Power of One Bit. SOFSEM 2006: 323-331
- [c21]Harry Buhrman, Leen Torenvliet, Falk Unger: Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. STACS 2006: 455-468
- 2005
- [j18]Harry Buhrman, Leen Torenvliet: A Post's Program for Complexity Theory. Bulletin of the EATCS 85: 41-51 (2005)
- [e1]S. Barry Cooper, Benedikt Löwe, Leen Torenvliet (Eds.): New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings. Lecture Notes in Computer Science 3526, Springer 2005, ISBN 3-540-26179-6
- [i4]Lane A. Hemaspaandra, Leen Torenvliet: P-Selectivity, Immunity, and the Power of One Bit. CoRR abs/cs/0504096 (2005)
- 2004
- [c20]Harry Buhrman, Leen Torenvliet: Separating Complexity Classes Using Structural Properties. IEEE Conference on Computational Complexity 2004: 130-138
- [c19]Marnix Kaart, Jan-Pascal van Best, Willem G. Vree, Leen Torenvliet: The importance of measurements for Internet policy. SMC (5) 2004: 4711-4716
- [i3]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
- [j17]Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet: Two oracles that force a big crunch. Computational Complexity 10(2): 93-116 (2001)
- [j16]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)
- [i2]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)
- 2000
- [j15]Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet: Separating Complexity Classes Using Autoreducibility. SIAM J. Comput. 29(5): 1497-1520 (2000)
- [j14]
- [c18]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
1990 – 1999
- 1999
- [c17]Harry Buhrman, Leen Torenvliet: Complicated Complementations. IEEE Conference on Computational Complexity 1999: 227-236
- 1998
- [j13]
- [j12]Harry Buhrman, Albrecht Hoene, Leen Torenvliet: Splittings, Robustness, and Structure of Complete Sets. SIAM J. Comput. 27(3): 637-653 (1998)
- [c16]Harry Buhrman, Leen Torenvliet: Randomness is Hard. IEEE Conference on Computational Complexity 1998: 249-260
- 1997
- [c15]Harry Buhrman, Lance Fortnow, Leen Torenvliet: Six Hypotheses in Search of a Theorem. IEEE Conference on Computational Complexity 1997: 2-12
- 1996
- [j11]Harry Buhrman, Leen Torenvliet: P-Selektive Self-Reducible Sets: A New Characterization of P. J. Comput. Syst. Sci. 53(2): 210-217 (1996)
- [j10]
- 1995
- [c14]Harry Buhrman, Lance Fortnow, Leen Torenvliet: Using Autoreducibility to Separate Complexity Classes. FOCS 1995: 520-527
- [c13]Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet: Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). MFCS 1995: 277-287
- [c12]
- [i1]Leen Torenvliet, Marten Trautwein: A Note on the Complexity of Restricted Attribute-Value Grammars. CoRR cmp-lg/9503021 (1995)
- 1994
- [j9]Derek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet: Semi-membership algorithms: some recent advances. SIGACT News 25(3): 12-23 (1994)
- [c11]Harry Buhrman, Leen Torenvliet: On the Structure of Complete Sets. Structure in Complexity Theory Conference 1994: 118-133
- [c10]Harry Buhrman, Leen Torenvliet: On the Cutting Edge of Relativization: The Resource Bounded Injury Method. ICALP 1994: 263-273
- 1993
- [j8]Harry Buhrman, Edith Spaan, Leen Torenvliet: The Relative Power of Logspace and Polynomial Time Reductions. Computational Complexity 3: 231-244 (1993)
- [j7]Harry Buhrman, Leen Torenvliet, Peter van Emde Boas: Twenty Questions to a P-Selector. Inf. Process. Lett. 48(4): 201-204 (1993)
- [c9]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
- [c8]Harry Buhrman, Albrecht Hoene, Leen Torenvliet: Splittings, Robustness and Structure of Complete Sets. STACS 1993: 175-184
- 1992
- [c7]Harry Buhrman, Edith Spaan, Leen Torenvliet: Bounded Reductions. Complexity Theory: Current Research 1992: 83-99
- 1991
- [j6]Harry Buhrman, Steven Homer, Leen Torenvliet: Completeness for Nondeterministic Complexity Classes. Mathematical Systems Theory 24(3): 179-200 (1991)
- [c6]
- 1990
- [c5]Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar: Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). MFCS 1990: 269-276
1980 – 1989
- 1989
- [j5]Edith Spaan, Leen Torenvliet, Peter van Emde Boas: Nondeterminism fairness and a fundamental analogy. Bulletin of the EATCS 37: 186-193 (1989)
- [j4]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)
- [j3]Leen Torenvliet, Peter van Emde Boas: Simplicity, Immunity, Relativizations and Nondeterminism. Inf. Comput. 80(1): 1-17 (1989)
- [j2]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)
- [c4]Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas: Multiple Representations of Dynamic Data Structures. IFIP Congress 1989: 437-442
- 1988
- [j1]Leen Torenvliet: A Second Step Toward the Strong Polynomial-Time Hierarchy. Mathematical Systems Theory 21(2): 99-123 (1988)
- 1986
- [c3]Leen Torenvliet, Peter van Emde Boas: Diagonalisation methods in a polynomial setting. Structure in Complexity Theory Conference 1986: 330-346
- 1985
- [c2]Leen Torenvliet, Peter van Emde Boas: Combined Simplicity and Immunity in Relativized NP. STACS 1985: 339-350
- 1983
- [c1]Leen Torenvliet, Peter van Emde Boas: The Reconstruction and Optimization of Trie Hashing Functions. VLDB 1983: 142-156
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-21 22:32 CET by the dblp team