Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Leen Torenvliet" ( http://dblp.L3S.de/Authors/Leen_Torenvliet )

URL (Homepage):  http://staff.science.uva.nl/~leen/  Author page on DBLP  Author page in RDF  Community of Leen Torenvliet in ASPL-2

Publication years (Num. hits)
1983-1993 (17) 1994-2000 (17) 2001-2010 (17) 2011 (1)
Publication types (Num. hits)
article(29) inproceedings(22) proceedings(1)
Venues (Conferences, Journals, ...)
IEEE Conference on Computation...(5) CoRR(4) J. Comput. Syst. Sci.(4) STACS(4) Electronic Colloquium on Compu...(3) SIAM J. Comput.(3) Structure in Complexity Theory...(3) Bulletin of the EATCS(2) Computational Complexity(2) Inf. Comput.(2) Mathematical Systems Theory(2) MFCS(2) CiE(1) Complexity Theory: Current Res...(1) Elektronische Informationsvera...(1) FOCS(1) More (+10 of total 28)
Authors
Leen Torenvliet(52) Harry Buhrman(28) Peter van Emde Boas(9) Lance Fortnow(6) Lane A. Hemaspaandra(5) Edith Spaan(4) Andris Ambainis(3) Bala Kalyanasundaram(3) Mark H. Overmars(3) Michiel H. M. Smid(3) Paul M. B. Vitányi(3) Sebastiaan Terwijn(3) William I. Gasarch(3) Albrecht Hoene(2) Falk Unger(2) Frank Stephan(2) More (+10 of total 42)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 17 occurrences of 14 keywords
Results
Found 52 publication records. Showing 52 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Sebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi Nonapproximability of the normalized information distance. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin Sparse Selfreducible Sets and Nonuniform Lower Bounds. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi Normalized Information Distance is Not Semicomputable Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet Non-Uniform Reductions. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  BibTeX  RDF
1Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi Nonapproximablity of the Normalized Information Distance Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Boaz Leskes, Leen Torenvliet The value of agreement a new boosting algorithm. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet Enumerations of the Kolmogorov function. Search on Bibsonomy J. Symb. Log. The full citation details ... 2006 DBLP  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet, Falk Unger Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Selfreducibility, Computational Complexity, Sparseness
1Lane A. Hemaspaandra, Leen Torenvliet P-Selectivity, Immunity, and the Power of One Bit. Search on Bibsonomy SOFSEM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Leen Torenvliet P-Selectivity, Immunity, and the Power of One Bit Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet A Post's Program for Complexity Theory. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2005 DBLP  BibTeX  RDF
1S. 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 Search on Bibsonomy CiE The full citation details ... 2005 DBLP  BibTeX  RDF
1Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet Enumerations of the Kolmogorov Function Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Marnix Kaart, Jan-Pascal van Best, Willem G. Vree, Leen Torenvliet The importance of measurements for Internet policy. Search on Bibsonomy SMC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet Separating Complexity Classes Using Structural Properties. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet The Communication Complexity of Enumeration, Elimination, and Selection Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2001 DBLP  BibTeX  RDF
1Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet Two oracles that force a big crunch. Search on Bibsonomy Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet The Communication Complexity of Enumeration, Elimination, and Selection. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet Randomness is Hard. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet Separating Complexity Classes Using Autoreducibility. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet The Communication Complexity of Enumeration, Elimination, and Selection. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet Complicated Complementations. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Oracles, Kolmogorov Complexity, Complexity Classes, Simplicity, Polynomial Hierarchy, Immunity
1Sebastiaan Terwijn, Leen Torenvliet Arithmetical Measure. Search on Bibsonomy Math. Log. Q. The full citation details ... 1998 DBLP  BibTeX  RDF
1Harry Buhrman, Albrecht Hoene, Leen Torenvliet Splittings, Robustness, and Structure of Complete Sets. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet Randomness is Hard. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Leen Torenvliet Six Hypotheses in Search of a Theorem. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Leen Torenvliet Optimal Advice. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet P-Selektive Self-Reducible Sets: A New Characterization of P. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Leen Torenvliet, Marten Trautwein A Note on the Complexity of Restricted Attribute-Value Grammars Search on Bibsonomy CoRR The full citation details ... 1995 DBLP  BibTeX  RDF
1Sophie Fischer, Leen Torenvliet The Malleability of TSP_{2Opt}. Search on Bibsonomy WG The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). Search on Bibsonomy MFCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Leen Torenvliet Using Autoreducibility to Separate Complexity Classes. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF autoreducibility, doubly exponential space, Turing complete sets, logarithmic space, computational complexity, set theory, oracle, complexity theory, Turing machines, Turing machine, complexity classes, structural properties, polynomial space, diagonalization
1Derek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet Semi-membership algorithms: some recent advances. Search on Bibsonomy SIGACT News The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet On the Cutting Edge of Relativization: The Resource Bounded Injury Method. Search on Bibsonomy ICALP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet On the Structure of Complete Sets. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1994 DBLP  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet, Peter van Emde Boas Twenty Questions to a P-Selector. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Edith Spaan, Leen Torenvliet The Relative Power of Logspace and Polynomial Time Reductions. Search on Bibsonomy Computational Complexity The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Albrecht Hoene, Leen Torenvliet Splittings, Robustness and Structure of Complete Sets. Search on Bibsonomy STACS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Peter van Helden, Leen Torenvliet P-Selective Self-reducibles Sets: A New Characterization of P. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1993 DBLP  BibTeX  RDF
1Harry Buhrman, Edith Spaan, Leen Torenvliet Bounded Reductions. Search on Bibsonomy Complexity Theory: Current Research The full citation details ... 1992 DBLP  BibTeX  RDF
1Harry Buhrman, Steven Homer, Leen Torenvliet Completeness for Nondeterministic Complexity Classes. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Edith Spaan, Leen Torenvliet Bounded Reductions. Search on Bibsonomy STACS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). Search on Bibsonomy MFCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas Maintaining Multiple Representations of Dynamic Data Structures Search on Bibsonomy Inf. Comput. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Leen Torenvliet, Peter van Emde Boas Simplicity, Immunity, Relativizations and Nondeterminism Search on Bibsonomy Inf. Comput. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars Two Models for the Reconstruction Problem for Dynamic Data Structures. Search on Bibsonomy Elektronische Informationsverarbeitung und Kybernetik The full citation details ... 1989 DBLP  BibTeX  RDF
1Edith Spaan, Leen Torenvliet, Peter van Emde Boas Nondeterminism fairness and a fundamental analogy. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1989 DBLP  BibTeX  RDF
1Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas Multiple Representations of Dynamic Data Structures. Search on Bibsonomy IFIP Congress The full citation details ... 1989 DBLP  BibTeX  RDF
1Leen Torenvliet A Second Step Toward the Strong Polynomial-Time Hierarchy. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Leen Torenvliet, Peter van Emde Boas Diagonalisation methods in a polynomial setting. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Leen Torenvliet, Peter van Emde Boas Combined Simplicity and Immunity in Relativized NP. Search on Bibsonomy STACS The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
1Leen Torenvliet, Peter van Emde Boas The Reconstruction and Optimization of Trie Hashing Functions. Search on Bibsonomy VLDB The full citation details ... 1983 DBLP  BibTeX  RDF
Displaying result #1 - #52 of 52 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.