Leen Torenvliet

60 papers A* 3A 9B 6C 1Journal 34Unranked 6

Year	Rank	Type	Title / Venue / Authors
2019	B	`conf`	A Hierarchy of Polynomial Kernels. SOFSEM Jouke Witteveen, Ralph Bottesch, Leen Torenvliet
2019	J	`jnl`	A Hierarchy of Polynomial Kernels. CoRR Jouke Witteveen, Ralph Bottesch, Leen Torenvliet
2019	J	`jnl`	Sparse Selfreducible Sets and Nonuniform Lower Bounds. Algorithmica Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin
2017	J	`jnl`	Levelable Sets and the Algebraic Structure of Parameterizations. CoRR Jouke Witteveen, Leen Torenvliet
2016	J	`jnl`	Fixed-parameter decidability: Extending parameterized complexity analysis. Math. Log. Q. Jouke Witteveen, Leen Torenvliet
2015	B	`conf`	Discovering Motifs in Real-World Social Networks. SOFSEM Lotte B. Romijn, Breanndán Ó Nualláin, Leen Torenvliet
2015	J	`jnl`	Hardness of Approximation for Knapsack Problems. Theory Comput. Syst. Harry Buhrman, Bruno Loff, Leen Torenvliet
2011	J	`jnl`	Nonapproximability of the normalized information distance. J. Comput. Syst. Sci. Sebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi
2010	J	`jnl`	Non-Uniform Reductions. Theory Comput. Syst. Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet
2010	J	`jnl`	Normalized Information Distance is Not Semicomputable CoRR Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi
2010	J	`jnl`	Sparse Selfreducible Sets and Nonuniform Lower Bounds. Electron. Colloquium Comput. Complex. Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin
2009	J	`jnl`	Nonapproximablity of the Normalized Information Distance CoRR Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi
2008	J	`jnl`	The value of agreement a new boosting algorithm. J. Comput. Syst. Sci. Boaz Leskes, Leen Torenvliet
2006	J	`jnl`	Enumerations of the Kolmogorov function. J. Symb. Log. Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet
2006	B	`conf`	P-Selectivity, Immunity, and the Power of One Bit. SOFSEM Lane A. Hemaspaandra, Leen Torenvliet
2006	A	`conf`	Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. STACS Harry Buhrman, Leen Torenvliet, Falk Unger
2005	J	`jnl`	A Post's Program for Complexity Theory. Bull. EATCS Harry Buhrman, Leen Torenvliet
2005	C	`ed.`	New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings CiE S. Barry Cooper, Benedikt Löwe, Leen Torenvliet
2005	J	`jnl`	P-Selectivity, Immunity, and the Power of One Bit CoRR Lane A. Hemaspaandra, Leen Torenvliet
2004	J	`jnl`	Enumerations of the Kolmogorov Function Electron. Colloquium Comput. Complex. Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet
2004	A	`conf`	Separating Complexity Classes Using Structural Properties. CCC Harry Buhrman, Leen Torenvliet
2004	—	`conf`	The importance of measurements for Internet policy. SMC (5) Marnix Kaart, Jan-Pascal van Best, Willem G. Vree, Leen Torenvliet
2003	—	`book`	Theory of Semi-Feasible Algorithms Lane A. Hemaspaandra, Leen Torenvliet
2001	J	`jnl`	The Communication Complexity of Enumeration, Elimination, and Selection Electron. Colloquium Comput. Complex. Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
2001	J	`jnl`	The Communication Complexity of Enumeration, Elimination, and Selection. J. Comput. Syst. Sci. Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
2001	J	`jnl`	Two oracles that force a big crunch. Comput. Complex. Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet
2000	J	`jnl`	Randomness is Hard. SIAM J. Comput. Harry Buhrman, Leen Torenvliet
2000	J	`jnl`	Separating Complexity Classes Using Autoreducibility. SIAM J. Comput. Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet
2000	A	`conf`	The Communication Complexity of Enumeration, Elimination, and Selection. CCC Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
1999	A	`conf`	Complicated Complementations. CCC Harry Buhrman, Leen Torenvliet
1998	J	`jnl`	Arithmetical Measure. Math. Log. Q. Sebastiaan Terwijn, Leen Torenvliet
1998	A	`conf`	Randomness is Hard. CCC Harry Buhrman, Leen Torenvliet
1998	J	`jnl`	Splittings, Robustness, and Structure of Complete Sets. SIAM J. Comput. Harry Buhrman, Albrecht Hoene, Leen Torenvliet
1997	A	`conf`	Six Hypotheses in Search of a Theorem. CCC Harry Buhrman, Lance Fortnow, Leen Torenvliet
1996	J	`jnl`	Optimal Advice. Theor. Comput. Sci. Lane A. Hemaspaandra, Leen Torenvliet
1996	J	`jnl`	P-Selektive Self-Reducible Sets: A New Characterization of P. J. Comput. Syst. Sci. Harry Buhrman, Leen Torenvliet
1995	J	`jnl`	A Note on the Complexity of Restricted Attribute-Value Grammars CoRR Leen Torenvliet, Marten Trautwein
1995	B	`conf`	The Malleability of TSP_{2Opt}. WG Sophie Fischer, Leen Torenvliet
1995	A*	`conf`	Using Autoreducibility to Separate Complexity Classes. FOCS Harry Buhrman, Lance Fortnow, Leen Torenvliet
1995	B	`conf`	Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). MFCS Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet
1994	A*	`conf`	On the Cutting Edge of Relativization: The Resource Bounded Injury Method. ICALP Harry Buhrman, Leen Torenvliet
1994	—	`conf`	On the Structure of Complete Sets. SCT Harry Buhrman, Leen Torenvliet
1994	J	`jnl`	Semi-membership algorithms: some recent advances. SIGACT News Derek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet
1993	—	`conf`	P-Selective Self-reducibles Sets: A New Characterization of SCT Harry Buhrman, Peter van Helden, Leen Torenvliet
1993	A	`conf`	Splittings, Robustness and Structure of Complete Sets. STACS Harry Buhrman, Albrecht Hoene, Leen Torenvliet
1993	J	`jnl`	The Relative Power of Logspace and Polynomial Time Reductions. Comput. Complex. Harry Buhrman, Edith Spaan, Leen Torenvliet
1993	J	`jnl`	Twenty Questions to a P-Selector. Inf. Process. Lett. Harry Buhrman, Leen Torenvliet, Peter van Emde Boas
1992	—	`conf`	Bounded Reductions. Complexity Theory: Current Research Harry Buhrman, Edith Spaan, Leen Torenvliet
1991	A	`conf`	Bounded Reductions. STACS Harry Buhrman, Edith Spaan, Leen Torenvliet
1991	J	`jnl`	Completeness for Nondeterministic Complexity Classes. Math. Syst. Theory Harry Buhrman, Steven Homer, Leen Torenvliet
1990	B	`conf`	Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). MFCS Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar
1989	J	`jnl`	Maintaining Multiple Representations of Dynamic Data Structures Inf. Comput. Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
1989	—	`conf`	Multiple Representations of Dynamic Data Structures. IFIP Congress Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
1989	J	`jnl`	Nondeterminism fairness and a fundamental analogy. Bull. EATCS Edith Spaan, Leen Torenvliet, Peter van Emde Boas
1989	J	`jnl`	Simplicity, Immunity, Relativizations and Nondeterminism Inf. Comput. Leen Torenvliet, Peter van Emde Boas
1989	J	`jnl`	Two Models for the Reconstruction Problem for Dynamic Data Structures. J. Inf. Process. Cybern. Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars
1988	J	`jnl`	A Second Step Toward the Strong Polynomial-Time Hierarchy. Math. Syst. Theory Leen Torenvliet
1986	—	`conf`	Diagonalisation methods in a polynomial setting. SCT Leen Torenvliet, Peter van Emde Boas
1985	A	`conf`	Combined Simplicity and Immunity in Relativized NP. STACS Leen Torenvliet, Peter van Emde Boas
1983	A*	`conf`	The Reconstruction and Optimization of Trie Hashing Functions. VLDB Leen Torenvliet, Peter van Emde Boas