Leen Torenvliet - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 53 from 53

2019

Sparse Selfreducible Sets and Nonuniform Lower BoundsHarry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin. algorithmica, 81(1):179-200, 2019. [doi]

A Hierarchy of Polynomial KernelsJouke Witteveen, Ralph Bottesch, Leen Torenvliet. sofsem 2019: 504-518 [doi]

2016

Fixed-parameter decidability: Extending parameterized complexity analysisJouke Witteveen, Leen Torenvliet. mlq, 62(6):596-607, 2016. [doi]

2015

Hardness of Approximation for Knapsack ProblemsHarry Buhrman, Bruno Loff, Leen Torenvliet. mst, 56(2):372-393, 2015. [doi]

Discovering Motifs in Real-World Social NetworksLotte Romijn, Breanndán Ó. Nualláin, Leen Torenvliet. sofsem 2015: 463-474 [doi]

2011

Nonapproximability of the normalized information distanceSebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi. jcss, 77(4):738-742, 2011. [doi]

2010

Non-Uniform ReductionsHarry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet. mst, 47(2):317-341, 2010. [doi]

Sparse Selfreducible Sets and Nonuniform Lower BoundsHarry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin. eccc, 17:163, 2010. [doi]

2008

The value of agreement a new boosting algorithmBoaz Leskes, Leen Torenvliet. jcss, 74(4):557-586, 2008. [doi]

2006

2005

A Post s Program for Complexity TheoryHarry Buhrman, Leen Torenvliet. eatcs, 85:41-51, 2005.

2004

2003

Theory of Semi-Feasible AlgorithmsLane A. Hemaspaandra, Leen Torenvliet. Monographs in Theoretical Computer Science. An EATCS Series, Springer, 2003. [doi]

2001

2000

The Communication Complexity of Enumeration, Elimination, and SelectionAndris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet. cocoon 2000: 44-53 [doi]

Randomness is HardHarry Buhrman, Leen Torenvliet. SICOMP, 30(5):1485-1501, 2000. [doi]

Separating Complexity Classes Using AutoreducibilityHarry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet. SICOMP, 29(5):1497-1520, 2000.

1999

Complicated ComplementationsHarry Buhrman, Leen Torenvliet. cocoon 1999: 227-236 [doi]

1998

Randomness is HardHarry Buhrman, Leen Torenvliet. cocoon 1998: 249-260 [doi]

Splittings, Robustness, and Structure of Complete SetsHarry Buhrman, Albrecht Hoene, Leen Torenvliet. SICOMP, 27(3):637-653, 1998.

Arithmetical MeasureSebastiaan Terwijn, Leen Torenvliet. mlq, 44:277-286, 1998.

1997

Six Hypotheses in Search of a TheoremHarry Buhrman, Lance Fortnow, Leen Torenvliet. cocoon 1997: 2-12 [doi]

1996

P-Selektive Self-Reducible Sets: A New Characterization of PHarry Buhrman, Leen Torenvliet. jcss, 53(2):210-217, 1996.

Optimal AdviceLane A. Hemaspaandra, Leen Torenvliet. TCS, 154(2):367-377, 1996. [doi]

1995

Using Autoreducibility to Separate Complexity ClassesHarry Buhrman, Lance Fortnow, Leen Torenvliet. focs 1995: 520-527

The Malleability of TSP_{2Opt}Sophie Fischer, Leen Torenvliet. criwg 1995: 152-166

Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract)Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet. mfcs 1995: 277-287

1994

On the Cutting Edge of Relativization: The Resource Bounded Injury MethodHarry Buhrman, Leen Torenvliet. icalp 1994: 263-273

On the Structure of Complete SetsHarry Buhrman, Leen Torenvliet. cocoon 1994: 118-133

Semi-membership algorithms: some recent advancesDerek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet. sigact, 25(3):12-23, 1994. [doi]

1993

1992

Bounded ReductionsHarry Buhrman, Edith Spaan, Leen Torenvliet. Dagstuhl 1993: 83-99

1991

Bounded ReductionsHarry Buhrman, Edith Spaan, Leen Torenvliet. STACS 1991: 410-421

Completeness for Nondeterministic Complexity ClassesHarry Buhrman, Steven Homer, Leen Torenvliet. mst, 24(3):179-200, 1991.

1990

Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract)Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar. mfcs 1990: 269-276

1989

1988

A Second Step Toward the Strong Polynomial-Time HierarchyLeen Torenvliet. mst, 21(2):99-123, 1988.

1986

Diagonalisation methods in a polynomial settingLeen Torenvliet, Peter van Emde Boas. cocoon 1986: 330-346

1985

Combined Simplicity and Immunity in Relativized NPLeen Torenvliet, Peter van Emde Boas. STACS 1985: 339-350

1983

The Reconstruction and Optimization of Trie Hashing FunctionsLeen Torenvliet, Peter van Emde Boas. VLDB 1983: 142-156 [doi]

Sign in or sign up to see more results.

runs on WebDSL