default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeen Torenvliet
- > Home > Persons > Leen Torenvliet
Publications
- 2019
[j25]Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin
:
Sparse Selfreducible Sets and Nonuniform Lower Bounds. Algorithmica 81(1): 179-200 (2019)- 2015
- [j23]Harry Buhrman, Bruno Loff, Leen Torenvliet:
Hardness of Approximation for Knapsack Problems. Theory Comput. Syst. 56(2): 372-393 (2015) - 2010
- [j21]Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet:
Non-Uniform Reductions. Theory Comput. Syst. 47(2): 317-341 (2010) - [i6]Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin:
Sparse Selfreducible Sets and Nonuniform Lower Bounds. Electron. Colloquium Comput. Complex. TR10 (2010) - 2006
- [j19]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): 501-528 (2006) - [c21]Harry Buhrman, Leen Torenvliet, Falk Unger:
Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. STACS 2006: 455-468 - 2005
- [j18]Harry Buhrman, Leen Torenvliet:
A Post's Program for Complexity Theory. Bull. EATCS 85: 41-51 (2005) - 2004
- [c20]Harry Buhrman, Leen Torenvliet:
Separating Complexity Classes Using Structural Properties. CCC 2004: 130-138 - [i3]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. TR04 (2004) - 2001
- [j17]Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet:
Two oracles that force a big crunch. Comput. Complex. 10(2): 93-116 (2001) - [j16]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): 148-185 (2001) - [i2]Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet:
The Communication Complexity of Enumeration, Elimination, and Selection. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j15]Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet:
Separating Complexity Classes Using Autoreducibility. SIAM J. Comput. 29(5): 1497-1520 (2000) - [j14]Harry Buhrman, Leen Torenvliet:
Randomness is Hard. SIAM J. Comput. 30(5): 1485-1501 (2000) - [c18]Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet:
The Communication Complexity of Enumeration, Elimination, and Selection. CCC 2000: 44-53 - 1999
- [c17]Harry Buhrman, Leen Torenvliet:
Complicated Complementations. CCC 1999: 227-236 - 1998
- [j12]Harry Buhrman, Albrecht Hoene, Leen Torenvliet:
Splittings, Robustness, and Structure of Complete Sets. SIAM J. Comput. 27(3): 637-653 (1998) - [c16]Harry Buhrman, Leen Torenvliet:
Randomness is Hard. CCC 1998: 249-260 - 1997
- [c15]Harry Buhrman, Lance Fortnow, Leen Torenvliet:
Six Hypotheses in Search of a Theorem. CCC 1997: 2-12 - 1996
- [j11]Harry Buhrman, Leen Torenvliet:
P-Selektive Self-Reducible Sets: A New Characterization of P. J. Comput. Syst. Sci. 53(2): 210-217 (1996) - 1995
- [c14]Harry Buhrman, Lance Fortnow, Leen Torenvliet:
Using Autoreducibility to Separate Complexity Classes. FOCS 1995: 520-527 - 1994
- [c11]Harry Buhrman, Leen Torenvliet:
On the Structure of Complete Sets. SCT 1994: 118-133 - [c10]Harry Buhrman, Leen Torenvliet:
On the Cutting Edge of Relativization: The Resource Bounded Injury Method. ICALP 1994: 263-273 - 1993
- [j8]Harry Buhrman, Edith Spaan, Leen Torenvliet:
The Relative Power of Logspace and Polynomial Time Reductions. Comput. Complex. 3: 231-244 (1993) - [j7]Harry Buhrman, Leen Torenvliet, Peter van Emde Boas:
Twenty Questions to a P-Selector. Inf. Process. Lett. 48(4): 201-204 (1993) - [c9]Harry Buhrman, Peter van Helden, Leen Torenvliet:
P-Selective Self-reducibles Sets: A New Characterization of P. SCT 1993: 44-51 - [c8]Harry Buhrman, Albrecht Hoene, Leen Torenvliet:
Splittings, Robustness and Structure of Complete Sets. STACS 1993: 175-184 - 1992
- [c7]Harry Buhrman, Edith Spaan, Leen Torenvliet:
Bounded Reductions. Complexity Theory: Current Research 1992: 83-99 - 1991
- [j6]Harry Buhrman, Steven Homer, Leen Torenvliet:
Completeness for Nondeterministic Complexity Classes. Math. Syst. Theory 24(3): 179-200 (1991) - [c6]Harry Buhrman, Edith Spaan, Leen Torenvliet:
Bounded Reductions. STACS 1991: 410-421
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
