Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Leen Torenvliet
@article{DBLP:journals/algorithmica/BuhrmanTUV19,
author = {Harry Buhrman and
Leen Torenvliet and
Falk Unger and
Nikolai K. Vereshchagin},
title = {Sparse Selfreducible Sets and Nonuniform Lower Bounds},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {179--200},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0439-0},
doi = {10.1007/S00453-018-0439-0},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BuhrmanTUV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/WitteveenBT19,
author = {Jouke Witteveen and
Ralph Bottesch and
Leen Torenvliet},
editor = {Barbara Catania and
Rastislav Kr{\'{a}}lovic and
Jerzy R. Nawrocki and
Giovanni Pighizzini},
title = {A Hierarchy of Polynomial Kernels},
booktitle = {{SOFSEM} 2019: Theory and Practice of Computer Science - 45th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 27-30, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11376},
pages = {504--518},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-10801-4\_39},
doi = {10.1007/978-3-030-10801-4\_39},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/WitteveenBT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-11006,
author = {Jouke Witteveen and
Ralph Bottesch and
Leen Torenvliet},
title = {A Hierarchy of Polynomial Kernels},
journal = {CoRR},
volume = {abs/1902.11006},
year = {2019},
url = {http://arxiv.org/abs/1902.11006},
eprinttype = {arXiv},
eprint = {1902.11006},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-11006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-04699,
author = {Jouke Witteveen and
Leen Torenvliet},
title = {Levelable Sets and the Algebraic Structure of Parameterizations},
journal = {CoRR},
volume = {abs/1709.04699},
year = {2017},
url = {http://arxiv.org/abs/1709.04699},
eprinttype = {arXiv},
eprint = {1709.04699},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-04699.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/WitteveenT16,
author = {Jouke Witteveen and
Leen Torenvliet},
title = {Fixed-parameter decidability: Extending parameterized complexity analysis},
journal = {Math. Log. Q.},
volume = {62},
number = {6},
pages = {596--607},
year = {2016},
url = {https://doi.org/10.1002/malq.201500077},
doi = {10.1002/MALQ.201500077},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mlq/WitteveenT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanLT15,
author = {Harry Buhrman and
Bruno Loff and
Leen Torenvliet},
title = {Hardness of Approximation for Knapsack Problems},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {372--393},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9550-z},
doi = {10.1007/S00224-014-9550-Z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/RomijnNT15,
author = {Lotte B. Romijn and
Breannd{\'{a}}n {\'{O}} Nuall{\'{a}}in and
Leen Torenvliet},
editor = {Giuseppe F. Italiano and
Tiziana Margaria{-}Steffen and
Jaroslav Pokorn{\'{y}} and
Jean{-}Jacques Quisquater and
Roger Wattenhofer},
title = {Discovering Motifs in Real-World Social Networks},
booktitle = {{SOFSEM} 2015: Theory and Practice of Computer Science - 41st International
Conference on Current Trends in Theory and Practice of Computer Science,
Pec pod Sn{\v{e}}{\v{z}}kou, Czech Republic, January 24-29, 2015.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8939},
pages = {463--474},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-46078-8\_38},
doi = {10.1007/978-3-662-46078-8\_38},
timestamp = {Wed, 08 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/RomijnNT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/TerwijnTV11,
author = {Sebastiaan A. Terwijn and
Leen Torenvliet and
Paul M. B. Vit{\'{a}}nyi},
title = {Nonapproximability of the normalized information distance},
journal = {J. Comput. Syst. Sci.},
volume = {77},
number = {4},
pages = {738--742},
year = {2011},
url = {https://doi.org/10.1016/j.jcss.2010.06.018},
doi = {10.1016/J.JCSS.2010.06.018},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/TerwijnTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanHHT10,
author = {Harry Buhrman and
Benjamin J. Hescott and
Steven Homer and
Leen Torenvliet},
title = {Non-Uniform Reductions},
journal = {Theory Comput. Syst.},
volume = {47},
number = {2},
pages = {317--341},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9163-5},
doi = {10.1007/S00224-008-9163-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanHHT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-3275,
author = {Sebastiaan Terwijn and
Leen Torenvliet and
Paul M. B. Vit{\'{a}}nyi},
title = {Normalized Information Distance is Not Semicomputable},
journal = {CoRR},
volume = {abs/1006.3275},
year = {2010},
url = {http://arxiv.org/abs/1006.3275},
eprinttype = {arXiv},
eprint = {1006.3275},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-3275.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BuhrmanTUV10,
author = {Harry Buhrman and
Leen Torenvliet and
Falk Unger and
Nikolai K. Vereshchagin},
title = {Sparse Selfreducible Sets and Nonuniform Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-163}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/163},
eprinttype = {ECCC},
eprint = {TR10-163},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BuhrmanTUV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0910-4353,
author = {Sebastiaan Terwijn and
Leen Torenvliet and
Paul M. B. Vit{\'{a}}nyi},
title = {Nonapproximablity of the Normalized Information Distance},
journal = {CoRR},
volume = {abs/0910.4353},
year = {2009},
url = {http://arxiv.org/abs/0910.4353},
eprinttype = {arXiv},
eprint = {0910.4353},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-4353.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LeskesT08,
author = {Boaz Leskes and
Leen Torenvliet},
title = {The value of agreement a new boosting algorithm},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {4},
pages = {557--586},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.06.005},
doi = {10.1016/J.JCSS.2007.06.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LeskesT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BeigelBFFGLMST06,
author = {Richard Beigel and
Harry Buhrman and
Peter A. Fejer and
Lance Fortnow and
Piotr Grabowski and
Luc Longpr{\'{e}} and
Andrej Muchnik and
Frank Stephan and
Leen Torenvliet},
title = {Enumerations of the Kolmogorov function},
journal = {J. Symb. Log.},
volume = {71},
number = {2},
pages = {501--528},
year = {2006},
url = {https://doi.org/10.2178/jsl/1146620156},
doi = {10.2178/JSL/1146620156},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/BeigelBFFGLMST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/HemaspaandraT06,
author = {Lane A. Hemaspaandra and
Leen Torenvliet},
editor = {Jir{\'{\i}} Wiedermann and
Gerard Tel and
Jaroslav Pokorn{\'{y}} and
M{\'{a}}ria Bielikov{\'{a}} and
Julius Stuller},
title = {P-Selectivity, Immunity, and the Power of One Bit},
booktitle = {{SOFSEM} 2006: Theory and Practice of Computer Science, 32nd Conference
on Current Trends in Theory and Practice of Computer Science, Mer{\'{\i}}n,
Czech Republic, January 21-27, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3831},
pages = {323--331},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11611257\_30},
doi = {10.1007/11611257\_30},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/HemaspaandraT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanTU06,
author = {Harry Buhrman and
Leen Torenvliet and
Falk Unger},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds},
booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
Science, Marseille, France, February 23-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3884},
pages = {455--468},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_37},
doi = {10.1007/11672142\_37},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanTU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/BuhrmanT05,
author = {Harry Buhrman and
Leen Torenvliet},
title = {A Post's Program for Complexity Theory},
journal = {Bull. {EATCS}},
volume = {85},
pages = {41--51},
year = {2005},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/BuhrmanT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cie/2005,
editor = {S. Barry Cooper and
Benedikt L{\"{o}}we and
Leen Torenvliet},
title = {New Computational Paradigms, First Conference on Computability in
Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3526},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/b136981},
doi = {10.1007/B136981},
isbn = {3-540-26179-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0504096,
author = {Lane A. Hemaspaandra and
Leen Torenvliet},
title = {P-Selectivity, Immunity, and the Power of One Bit},
journal = {CoRR},
volume = {abs/cs/0504096},
year = {2005},
url = {http://arxiv.org/abs/cs/0504096},
eprinttype = {arXiv},
eprint = {cs/0504096},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0504096.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanT04,
author = {Harry Buhrman and
Leen Torenvliet},
title = {Separating Complexity Classes Using Structural Properties},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {130--138},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313820},
doi = {10.1109/CCC.2004.1313820},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/smc/KaartBVT04,
author = {Marnix Kaart and
Jan{-}Pascal van Best and
Willem G. Vree and
Leen Torenvliet},
title = {The importance of measurements for Internet policy},
booktitle = {Proceedings of the {IEEE} International Conference on Systems, Man
{\&} Cybernetics: The Hague, Netherlands, 10-13 October 2004},
pages = {4711--4716},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/ICSMC.2004.1401275},
doi = {10.1109/ICSMC.2004.1401275},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/smc/KaartBVT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-015,
author = {Richard Beigel and
Harry Buhrman and
Peter A. Fejer and
Lance Fortnow and
Piotr Grabowski and
Luc Longpr{\'{e}} and
Andrei A. Muchnik and
Frank Stephan and
Leen Torenvliet},
title = {Enumerations of the Kolmogorov Function},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-015}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-015/index.html},
eprinttype = {ECCC},
eprint = {TR04-015},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:series/eatcs/HemaspaandraT03,
author = {Lane A. Hemaspaandra and
Leen Torenvliet},
title = {Theory of Semi-Feasible Algorithms},
series = {Monographs in Theoretical Computer Science. An {EATCS} Series},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-662-05080-4},
doi = {10.1007/978-3-662-05080-4},
isbn = {978-3-642-07581-0},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/eatcs/HemaspaandraT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BuhrmanFFT01,
author = {Harry Buhrman and
Stephen A. Fenner and
Lance Fortnow and
Leen Torenvliet},
title = {Two oracles that force a big crunch},
journal = {Comput. Complex.},
volume = {10},
number = {2},
pages = {93--116},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8190-2},
doi = {10.1007/S00037-001-8190-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BuhrmanFFT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AmbainisBGKT01,
author = {Andris Ambainis and
Harry Buhrman and
William I. Gasarch and
Bala Kalyanasundaram and
Leen Torenvliet},
title = {The Communication Complexity of Enumeration, Elimination, and Selection},
journal = {J. Comput. Syst. Sci.},
volume = {63},
number = {2},
pages = {148--185},
year = {2001},
url = {https://doi.org/10.1006/jcss.2001.1761},
doi = {10.1006/JCSS.2001.1761},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AmbainisBGKT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-019,
author = {Andris Ambainis and
Harry Buhrman and
William I. Gasarch and
Bala Kalyanasundaram and
Leen Torenvliet},
title = {The Communication Complexity of Enumeration, Elimination, and Selection},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-019}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-019/index.html},
eprinttype = {ECCC},
eprint = {TR01-019},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanFMT00,
author = {Harry Buhrman and
Lance Fortnow and
Dieter van Melkebeek and
Leen Torenvliet},
title = {Separating Complexity Classes Using Autoreducibility},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1497--1520},
year = {2000},
url = {https://doi.org/10.1137/S0097539798334736},
doi = {10.1137/S0097539798334736},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanFMT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanT00,
author = {Harry Buhrman and
Leen Torenvliet},
title = {Randomness is Hard},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {5},
pages = {1485--1501},
year = {2000},
url = {https://doi.org/10.1137/S0097539799360148},
doi = {10.1137/S0097539799360148},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisBGKT00,
author = {Andris Ambainis and
Harry Buhrman and
William I. Gasarch and
Bala Kalyanasundaram and
Leen Torenvliet},
title = {The Communication Complexity of Enumeration, Elimination, and Selection},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {44--53},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856734},
doi = {10.1109/CCC.2000.856734},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmbainisBGKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanT99,
author = {Harry Buhrman and
Leen Torenvliet},
title = {Complicated Complementations},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {227--236},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766281},
doi = {10.1109/CCC.1999.766281},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/TerwijnT98,
author = {Sebastiaan Terwijn and
Leen Torenvliet},
title = {Arithmetical Measure},
journal = {Math. Log. Q.},
volume = {44},
pages = {277--286},
year = {1998},
url = {https://doi.org/10.1002/malq.19980440211},
doi = {10.1002/MALQ.19980440211},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/TerwijnT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanHT98,
author = {Harry Buhrman and
Albrecht Hoene and
Leen Torenvliet},
title = {Splittings, Robustness, and Structure of Complete Sets},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {637--653},
year = {1998},
url = {https://doi.org/10.1137/S0097539795279724},
doi = {10.1137/S0097539795279724},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanHT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanT98,
author = {Harry Buhrman and
Leen Torenvliet},
title = {Randomness is Hard},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {249--260},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694616},
doi = {10.1109/CCC.1998.694616},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanFT97,
author = {Harry Buhrman and
Lance Fortnow and
Leen Torenvliet},
title = {Six Hypotheses in Search of a Theorem},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {2--12},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612295},
doi = {10.1109/CCC.1997.612295},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanFT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BuhrmanT96,
author = {Harry Buhrman and
Leen Torenvliet},
title = {P-Selektive Self-Reducible Sets: {A} New Characterization of {P}},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {210--217},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0062},
doi = {10.1006/JCSS.1996.0062},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BuhrmanT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraT96,
author = {Lane A. Hemaspaandra and
Leen Torenvliet},
title = {Optimal Advice},
journal = {Theor. Comput. Sci.},
volume = {154},
number = {2},
pages = {367--377},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00076-3},
doi = {10.1016/0304-3975(95)00076-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BuhrmanFT95,
author = {Harry Buhrman and
Lance Fortnow and
Leen Torenvliet},
title = {Using Autoreducibility to Separate Complexity Classes},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {520--527},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492582},
doi = {10.1109/SFCS.1995.492582},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BuhrmanFT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FischerHT95,
author = {Sophie Fischer and
Lane A. Hemaspaandra and
Leen Torenvliet},
editor = {Jir{\'{\i}} Wiedermann and
Petr H{\'{a}}jek},
title = {Witness-Isomorphic Reductions and the Local Search Problem (Extended
Abstract)},
booktitle = {Mathematical Foundations of Computer Science 1995, 20th International
Symposium, MFCS'95, Prague, Czech Republic, August 28 - September
1, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {969},
pages = {277--287},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60246-1\_134},
doi = {10.1007/3-540-60246-1\_134},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FischerHT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FischerT95,
author = {Sophie Fischer and
Leen Torenvliet},
editor = {Manfred Nagl},
title = {The Malleability of TSP{\_}\{2Opt\}},
booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop,
{WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1017},
pages = {152--166},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60618-1\_73},
doi = {10.1007/3-540-60618-1\_73},
timestamp = {Thu, 14 Oct 2021 10:32:32 +0200},
biburl = {https://dblp.org/rec/conf/wg/FischerT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cmp-lg-9503021,
author = {Leen Torenvliet and
Marten Trautwein},
title = {A Note on the Complexity of Restricted Attribute-Value Grammars},
journal = {CoRR},
volume = {cmp-lg/9503021},
year = {1995},
url = {http://arxiv.org/abs/cmp-lg/9503021},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cmp-lg-9503021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Denny-BrownHHT94,
author = {Derek Denny{-}Brown and
Yenjo Han and
Lane A. Hemaspaandra and
Leen Torenvliet},
title = {Semi-membership algorithms: some recent advances},
journal = {{SIGACT} News},
volume = {25},
number = {3},
pages = {12--23},
year = {1994},
url = {https://doi.org/10.1145/193820.193828},
doi = {10.1145/193820.193828},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Denny-BrownHHT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanT94,
author = {Harry Buhrman and
Leen Torenvliet},
title = {On the Structure of Complete Sets},
booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
Amsterdam, The Netherlands, June 28 - July 1, 1994},
pages = {118--133},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SCT.1994.315811},
doi = {10.1109/SCT.1994.315811},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BuhrmanT94,
author = {Harry Buhrman and
Leen Torenvliet},
editor = {Serge Abiteboul and
Eli Shamir},
title = {On the Cutting Edge of Relativization: The Resource Bounded Injury
Method},
booktitle = {Automata, Languages and Programming, 21st International Colloquium,
ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {820},
pages = {263--273},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58201-0\_74},
doi = {10.1007/3-540-58201-0\_74},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BuhrmanT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BuhrmanST93,
author = {Harry Buhrman and
Edith Spaan and
Leen Torenvliet},
title = {The Relative Power of Logspace and Polynomial Time Reductions},
journal = {Comput. Complex.},
volume = {3},
pages = {231--244},
year = {1993},
url = {https://doi.org/10.1007/BF01271369},
doi = {10.1007/BF01271369},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BuhrmanST93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BuhrmanTB93,
author = {Harry Buhrman and
Leen Torenvliet and
Peter van Emde Boas},
title = {Twenty Questions to a P-Selector},
journal = {Inf. Process. Lett.},
volume = {48},
number = {4},
pages = {201--204},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90146-Z},
doi = {10.1016/0020-0190(93)90146-Z},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BuhrmanTB93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanHT93,
author = {Harry Buhrman and
Peter van Helden and
Leen Torenvliet},
title = {P-Selective Self-reducibles Sets: {A} New Characterization of \emph{P}},
booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
San Diego, CA, USA, May 18-21, 1993},
pages = {44--51},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SCT.1993.336542},
doi = {10.1109/SCT.1993.336542},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanHT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanHT93,
author = {Harry Buhrman and
Albrecht Hoene and
Leen Torenvliet},
editor = {Patrice Enjalbert and
Alain Finkel and
Klaus W. Wagner},
title = {Splittings, Robustness and Structure of Complete Sets},
booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {665},
pages = {175--184},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56503-5\_20},
doi = {10.1007/3-540-56503-5\_20},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanHT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BuhrmanST92,
author = {Harry Buhrman and
Edith Spaan and
Leen Torenvliet},
editor = {Klaus Ambos{-}Spies and
Steven Homer and
Uwe Sch{\"{o}}ning},
title = {Bounded Reductions},
booktitle = {Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8,
1992},
pages = {83--99},
publisher = {Cambridge University Press},
year = {1992},
timestamp = {Mon, 15 Jul 2002 11:29:49 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BuhrmanST92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanHT91,
author = {Harry Buhrman and
Steven Homer and
Leen Torenvliet},
title = {Completeness for Nondeterministic Complexity Classes},
journal = {Math. Syst. Theory},
volume = {24},
number = {3},
pages = {179--200},
year = {1991},
url = {https://doi.org/10.1007/BF02090397},
doi = {10.1007/BF02090397},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanHT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanST91,
author = {Harry Buhrman and
Edith Spaan and
Leen Torenvliet},
editor = {Christian Choffrut and
Matthias Jantzen},
title = {Bounded Reductions},
booktitle = {{STACS} 91, 8th Annual Symposium on Theoretical Aspects of Computer
Science, Hamburg, Germany, February 14-16, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {480},
pages = {410--421},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/BFb0020816},
doi = {10.1007/BFB0020816},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanST91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GavaldaTWB90,
author = {Ricard Gavald{\`{a}} and
Leen Torenvliet and
Osamu Watanabe and
Jos{\'{e}} L. Balc{\'{a}}zar},
editor = {Branislav Rovan},
title = {Generalized Kolmogorov Complexity in Relativized Separations (Extended
Abstract)},
booktitle = {Mathematical Foundations of Computer Science 1990, MFCS'90, Bansk{\'{a}}
Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {452},
pages = {269--276},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0029618},
doi = {10.1007/BFB0029618},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GavaldaTWB90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/SpaanTB89,
author = {Edith Spaan and
Leen Torenvliet and
Peter van Emde Boas},
title = {Nondeterminism fairness and a fundamental analogy},
journal = {Bull. {EATCS}},
volume = {37},
pages = {186--193},
year = {1989},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/SpaanTB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/SmidTBO89,
author = {Michiel H. M. Smid and
Leen Torenvliet and
Peter van Emde Boas and
Mark H. Overmars},
title = {Two Models for the Reconstruction Problem for Dynamic Data Structures},
journal = {J. Inf. Process. Cybern.},
volume = {25},
number = {4},
pages = {131--155},
year = {1989},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/SmidTBO89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/TorenvlietB89,
author = {Leen Torenvliet and
Peter van Emde Boas},
title = {Simplicity, Immunity, Relativizations and Nondeterminism},
journal = {Inf. Comput.},
volume = {80},
number = {1},
pages = {1--17},
year = {1989},
url = {https://doi.org/10.1016/0890-5401(89)90020-5},
doi = {10.1016/0890-5401(89)90020-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/TorenvlietB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/SmidOB89,
author = {Michiel H. M. Smid and
Mark H. Overmars and
Leen Torenvliet and
Peter van Emde Boas},
title = {Maintaining Multiple Representations of Dynamic Data Structures},
journal = {Inf. Comput.},
volume = {83},
number = {2},
pages = {206--233},
year = {1989},
url = {https://doi.org/10.1016/0890-5401(89)90058-8},
doi = {10.1016/0890-5401(89)90058-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/SmidOB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip/SmidOTB89,
author = {Michiel H. M. Smid and
Mark H. Overmars and
Leen Torenvliet and
Peter van Emde Boas},
editor = {Gerhard X. Ritter},
title = {Multiple Representations of Dynamic Data Structures},
booktitle = {Information Processing 89, Proceedings of the {IFIP} 11th World Computer
Congress, San Francisco, USA, August 28 - September 1, 1989},
pages = {437--442},
publisher = {North-Holland/IFIP},
year = {1989},
timestamp = {Wed, 02 Feb 2022 21:17:54 +0100},
biburl = {https://dblp.org/rec/conf/ifip/SmidOTB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Torenvliet88,
author = {Leen Torenvliet},
title = {A Second Step Toward the Strong Polynomial-Time Hierarchy},
journal = {Math. Syst. Theory},
volume = {21},
number = {2},
pages = {99--123},
year = {1988},
url = {https://doi.org/10.1007/BF02088009},
doi = {10.1007/BF02088009},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Torenvliet88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TorenvlietB86,
author = {Leen Torenvliet and
Peter van Emde Boas},
editor = {Alan L. Selman},
title = {Diagonalisation methods in a polynomial setting},
booktitle = {Structure in Complexity Theory, Proceedings of the Conference hold
at the University of California, Berkeley, California, USA, June 2-5,
1986},
series = {Lecture Notes in Computer Science},
volume = {223},
pages = {330--346},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16486-3\_109},
doi = {10.1007/3-540-16486-3\_109},
timestamp = {Thu, 02 Feb 2023 13:27:01 +0100},
biburl = {https://dblp.org/rec/conf/coco/TorenvlietB86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/TorenvlietB85,
author = {Leen Torenvliet and
Peter van Emde Boas},
editor = {Kurt Mehlhorn},
title = {Combined Simplicity and Immunity in Relativized {NP}},
booktitle = {{STACS} 85, 2nd Symposium of Theoretical Aspects of Computer Science,
Saarbr{\"{u}}cken, Germany, January 3-5, 1985, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {182},
pages = {339--350},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0024022},
doi = {10.1007/BFB0024022},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/TorenvlietB85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vldb/TorenvlietB83,
author = {Leen Torenvliet and
Peter van Emde Boas},
editor = {Mario Schkolnick and
Costantino Thanos},
title = {The Reconstruction and Optimization of Trie Hashing Functions},
booktitle = {9th International Conference on Very Large Data Bases, October 31
- November 2, 1983, Florence, Italy, Proceedings},
pages = {142--156},
publisher = {Morgan Kaufmann},
year = {1983},
url = {http://www.vldb.org/conf/1983/P142.PDF},
timestamp = {Wed, 29 Mar 2017 16:45:23 +0200},
biburl = {https://dblp.org/rec/conf/vldb/TorenvlietB83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:40 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:
