The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Leen Torenvliet: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Leen Torenvliet, Peter van Emde Boas
    The Reconstruction and Optimization of Trie Hashing Functions. [Citation Graph (2, 0)][DBLP]
    VLDB, 1983, pp:142-156 [Conf]
  2. Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
    The Communication Complexity of Enumeration, Elimination, and Selection. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:44-53 [Conf]
  3. Harry Buhrman, Lance Fortnow, Leen Torenvliet
    Six Hypotheses in Search of a Theorem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:2-12 [Conf]
  4. Harry Buhrman, Peter van Helden, Leen Torenvliet
    P-Selective Self-reducibles Sets: A New Characterization of P. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:44-51 [Conf]
  5. Harry Buhrman, Leen Torenvliet
    Separating Complexity Classes Using Structural Properties. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:130-138 [Conf]
  6. Harry Buhrman, Leen Torenvliet
    On the Structure of Complete Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:118-133 [Conf]
  7. Harry Buhrman, Leen Torenvliet
    Randomness is Hard. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:249-260 [Conf]
  8. Harry Buhrman, Leen Torenvliet
    Complicated Complementations. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:227-236 [Conf]
  9. Leen Torenvliet, Peter van Emde Boas
    Diagonalisation methods in a polynomial setting. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:330-346 [Conf]
  10. Harry Buhrman, Edith Spaan, Leen Torenvliet
    Bounded Reductions. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:83-99 [Conf]
  11. Harry Buhrman, Lance Fortnow, Leen Torenvliet
    Using Autoreducibility to Separate Complexity Classes. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:520-527 [Conf]
  12. Harry Buhrman, Leen Torenvliet
    On the Cutting Edge of Relativization: The Resource Bounded Injury Method. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:263-273 [Conf]
  13. Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
    Multiple Representations of Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:437-442 [Conf]
  14. Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet
    Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:277-287 [Conf]
  15. Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar
    Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:269-276 [Conf]
  16. Marnix Kaart, Jan-Pascal van Best, Willem Vree, Leen Torenvliet
    The importance of measurements for Internet policy. [Citation Graph (0, 0)][DBLP]
    SMC (5), 2004, pp:4711-4716 [Conf]
  17. Lane A. Hemaspaandra, Leen Torenvliet
    P-Selectivity, Immunity, and the Power of One Bit. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:323-331 [Conf]
  18. Harry Buhrman, Albrecht Hoene, Leen Torenvliet
    Splittings, Robustness and Structure of Complete Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:175-184 [Conf]
  19. Harry Buhrman, Edith Spaan, Leen Torenvliet
    Bounded Reductions. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:410-421 [Conf]
  20. Harry Buhrman, Leen Torenvliet, Falk Unger
    Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:455-468 [Conf]
  21. Leen Torenvliet, Peter van Emde Boas
    Combined Simplicity and Immunity in Relativized NP. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:339-350 [Conf]
  22. Sophie Fischer, Leen Torenvliet
    The Malleability of TSP_{2Opt}. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:152-166 [Conf]
  23. Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet
    Two oracles that force a big crunch. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:2, pp:93-116 [Journal]
  24. Harry Buhrman, Edith Spaan, Leen Torenvliet
    The Relative Power of Logspace and Polynomial Time Reductions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:231-244 [Journal]
  25. Leen Torenvliet, Marten Trautwein
    A Note on the Complexity of Restricted Attribute-Value Grammars [Citation Graph (0, 0)][DBLP]
    CoRR, 1995, v:0, n:, pp:- [Journal]
  26. Harry Buhrman, Leen Torenvliet
    A Post's Program for Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:85, n:, pp:41-51 [Journal]
  27. Edith Spaan, Leen Torenvliet, Peter van Emde Boas
    Nondeterminism fairness and a fundamental analogy. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:37, n:, pp:186-193 [Journal]
  28. Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
    The Communication Complexity of Enumeration, Elimination, and Selection [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:19, pp:- [Journal]
  29. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:015, pp:- [Journal]
  30. Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars
    Two Models for the Reconstruction Problem for Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:4, pp:131-155 [Journal]
  31. Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
    Maintaining Multiple Representations of Dynamic Data Structures [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:2, pp:206-233 [Journal]
  32. Leen Torenvliet, Peter van Emde Boas
    Simplicity, Immunity, Relativizations and Nondeterminism [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:80, n:1, pp:1-17 [Journal]
  33. Harry Buhrman, Leen Torenvliet, Peter van Emde Boas
    Twenty Questions to a P-Selector. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:4, pp:201-204 [Journal]
  34. Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
    The Communication Complexity of Enumeration, Elimination, and Selection. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:2, pp:148-185 [Journal]
  35. Harry Buhrman, Leen Torenvliet
    P-Selektive Self-Reducible Sets: A New Characterization of P. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:210-217 [Journal]
  36. Sebastiaan Terwijn, Leen Torenvliet
    Arithmetical Measure. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1998, v:44, n:, pp:277-286 [Journal]
  37. Harry Buhrman, Steven Homer, Leen Torenvliet
    Completeness for Nondeterministic Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:3, pp:179-200 [Journal]
  38. Leen Torenvliet
    A Second Step Toward the Strong Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1988, v:21, n:2, pp:99-123 [Journal]
  39. Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet
    Separating Complexity Classes Using Autoreducibility. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1497-1520 [Journal]
  40. Harry Buhrman, Albrecht Hoene, Leen Torenvliet
    Splittings, Robustness, and Structure of Complete Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:637-653 [Journal]
  41. Harry Buhrman, Leen Torenvliet
    Randomness is Hard. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1485-1501 [Journal]
  42. Lane A. Hemaspaandra, Leen Torenvliet
    Optimal Advice. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:154, n:2, pp:367-377 [Journal]
  43. Lane A. Hemaspaandra, Leen Torenvliet
    P-Selectivity, Immunity, and the Power of One Bit [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]

  44. Nonapproximablity of the Normalized Information Distance [Citation Graph (, )][DBLP]


  45. Normalized Information Distance is Not Semicomputable [Citation Graph (, )][DBLP]


Search in 0.076secs, Finished in 0.078secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002