Leen Torenvliet

Publication Activity (10 Years)

Years Active: 1983-2019
Publications (10 Years): 5

Top Topics

Polynomial Kernels

Algebraic Structure

High Dimensional Feature Space

Top Venues

Theory Comput. Syst.

Publications

Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin
Sparse Selfreducible Sets and Nonuniform Lower Bounds. Algorithmica 81 (1) (2019)
Jouke Witteveen, Ralph Bottesch, Leen Torenvliet
A Hierarchy of Polynomial Kernels. SOFSEM (2019)
Jouke Witteveen, Ralph Bottesch, Leen Torenvliet
A Hierarchy of Polynomial Kernels. CoRR (2019)
Jouke Witteveen, Leen Torenvliet
Levelable Sets and the Algebraic Structure of Parameterizations. CoRR (2017)
Jouke Witteveen, Leen Torenvliet
Fixed-parameter decidability: Extending parameterized complexity analysis. Math. Log. Q. 62 (6) (2016)
Harry Buhrman, Bruno Loff, Leen Torenvliet
Hardness of Approximation for Knapsack Problems. Theory Comput. Syst. 56 (2) (2015)
Lotte B. Romijn, Breanndán Ó Nualláin, Leen Torenvliet
Discovering Motifs in Real-World Social Networks. SOFSEM (2015)
Sebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi
Nonapproximability of the normalized information distance. J. Comput. Syst. Sci. 77 (4) (2011)
Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin
Sparse Selfreducible Sets and Nonuniform Lower Bounds. Electron. Colloquium Comput. Complex. 17 (2010)
Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet
Non-Uniform Reductions. Theory Comput. Syst. 47 (2) (2010)
Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi
Normalized Information Distance is Not Semicomputable CoRR (2010)
Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi
Nonapproximablity of the Normalized Information Distance CoRR (2009)
Boaz Leskes, Leen Torenvliet
The value of agreement a new boosting algorithm. J. Comput. Syst. Sci. 74 (4) (2008)
Lane A. Hemaspaandra, Leen Torenvliet
P-Selectivity, Immunity, and the Power of One Bit. SOFSEM (2006)
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) (2006)
Harry Buhrman, Leen Torenvliet, Falk Unger
Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. STACS (2006)
Lane A. Hemaspaandra, Leen Torenvliet
P-Selectivity, Immunity, and the Power of One Bit CoRR (2005)
Harry Buhrman, Leen Torenvliet
A Post's Program for Complexity Theory. Bull. EATCS 85 (2005)
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 Electron. Colloquium Comput. Complex. (015) (2004)
Harry Buhrman, Leen Torenvliet
Separating Complexity Classes Using Structural Properties. Computational Complexity Conference (2004)
Marnix Kaart, Jan-Pascal van Best, Willem G. Vree, Leen Torenvliet
The importance of measurements for Internet policy. SMC (5) (2004)
Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet
Two oracles that force a big crunch. Comput. Complex. 10 (2) (2001)
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) (2001)
Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
The Communication Complexity of Enumeration, Elimination, and Selection Electron. Colloquium Comput. Complex. 8 (19) (2001)
Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet
Separating Complexity Classes Using Autoreducibility. SIAM J. Comput. 29 (5) (2000)
Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
The Communication Complexity of Enumeration, Elimination, and Selection. Computational Complexity Conference (2000)
Harry Buhrman, Leen Torenvliet
Randomness is Hard. SIAM J. Comput. 30 (5) (2000)
Harry Buhrman, Leen Torenvliet
Complicated Complementations. Computational Complexity Conference (1999)
Harry Buhrman, Albrecht Hoene, Leen Torenvliet
Splittings, Robustness, and Structure of Complete Sets. SIAM J. Comput. 27 (3) (1998)
Sebastiaan Terwijn, Leen Torenvliet
Arithmetical Measure. Math. Log. Q. 44 (1998)
Harry Buhrman, Leen Torenvliet
Randomness is Hard. Computational Complexity Conference (1998)
Harry Buhrman, Lance Fortnow, Leen Torenvliet
Six Hypotheses in Search of a Theorem. Computational Complexity Conference (1997)
Harry Buhrman, Leen Torenvliet
P-Selektive Self-Reducible Sets: A New Characterization of P. J. Comput. Syst. Sci. 53 (2) (1996)
Lane A. Hemaspaandra, Leen Torenvliet
Optimal Advice. Theor. Comput. Sci. 154 (2) (1996)
Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet
Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). MFCS (1995)
Harry Buhrman, Lance Fortnow, Leen Torenvliet
Using Autoreducibility to Separate Complexity Classes. FOCS (1995)
Sophie Fischer, Leen Torenvliet
The Malleability of TSP_{2Opt}. WG (1995)
Leen Torenvliet, Marten Trautwein
A Note on the Complexity of Restricted Attribute-Value Grammars CoRR (1995)
Harry Buhrman, Leen Torenvliet
On the Cutting Edge of Relativization: The Resource Bounded Injury Method. ICALP (1994)
Derek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet
Semi-membership algorithms: some recent advances. SIGACT News 25 (3) (1994)
Harry Buhrman, Leen Torenvliet
On the Structure of Complete Sets. Computational Complexity Conference (1994)
Harry Buhrman, Leen Torenvliet, Peter van Emde Boas
Twenty Questions to a P-Selector. Inf. Process. Lett. 48 (4) (1993)
Harry Buhrman, Peter van Helden, Leen Torenvliet
. Computational Complexity Conference (1993)
Harry Buhrman, Edith Spaan, Leen Torenvliet
The Relative Power of Logspace and Polynomial Time Reductions. Comput. Complex. 3 (1993)
Harry Buhrman, Albrecht Hoene, Leen Torenvliet
Splittings, Robustness and Structure of Complete Sets. STACS (1993)
Harry Buhrman, Edith Spaan, Leen Torenvliet
Bounded Reductions. Complexity Theory: Current Research (1992)
Harry Buhrman, Steven Homer, Leen Torenvliet
Completeness for Nondeterministic Complexity Classes. Math. Syst. Theory 24 (3) (1991)
Harry Buhrman, Edith Spaan, Leen Torenvliet
Bounded Reductions. STACS (1991)
Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar
Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). MFCS (1990)
Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars
Two Models for the Reconstruction Problem for Dynamic Data Structures. J. Inf. Process. Cybern. 25 (4) (1989)
Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
Multiple Representations of Dynamic Data Structures. IFIP Congress (1989)
Edith Spaan, Leen Torenvliet, Peter van Emde Boas
Nondeterminism fairness and a fundamental analogy. Bull. EATCS 37 (1989)
Leen Torenvliet, Peter van Emde Boas
Simplicity, Immunity, Relativizations and Nondeterminism Inf. Comput. 80 (1) (1989)
Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
Maintaining Multiple Representations of Dynamic Data Structures Inf. Comput. 83 (2) (1989)
Leen Torenvliet
A Second Step Toward the Strong Polynomial-Time Hierarchy. Math. Syst. Theory 21 (2) (1988)
Leen Torenvliet, Peter van Emde Boas
Diagonalisation methods in a polynomial setting. Computational Complexity Conference (1986)
Leen Torenvliet, Peter van Emde Boas
Combined Simplicity and Immunity in Relativized NP. STACS (1985)
Leen Torenvliet, Peter van Emde Boas
The Reconstruction and Optimization of Trie Hashing Functions. VLDB (1983)