Buhrman, H., de Wolf, R. (2002) Complexity measures and decision tree complexity: a survey.

Theoretical Computer Science, Vol. 288 (pp 21-43)

Article | https://doi.org/10.1016/S0304-3975(01)00144-X | UvA-DARE

Buhrman, H., de Wolf, R. (2003) Quantum zero error algorithms cannot be composed.

Information Processing Letters, Vol. 87 (pp 79-84)

Article | https://doi.org/10.1016/S0020-0190(03)00254-0 | UvA-DARE

Buhrman, H., Dürr, C., Heiligman, M., Hoyer, P., Magniez, F., Santha, M., de Wolf, R. (2005) Quantum Algorithms for Element Distinctness.

SIAM Journal on Computing, Vol. 34 (pp 1324-1330)

Article | https://doi.org/10.1137/S0097539702402780 | UvA-DARE

Buhrman, H., Dürr, C., Heiligman, M., Høyer, P., Magniez, F., Santha, M., de Wolf, R. (2001) Quantum algorithms for element distinctness.

In In Proceedings of 16th IEEE Conference on Computational Complexity (pp 131-137)

Buhrman, H., Fehr, S., Schaffner, C., Speelman, F. (2013) The Garden-Hose Model.

In ITCS'13: proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science : January 9-12, 2013, Berkeley, California, USA (pp 145-157). Association for Computing Machinery.

Buhrman, H., Fehr, S., Schaffner, C. (2014) On the Parallel Repetition of Multi-Player Games: The No-Signaling Case.

In Flammia, S.T. Harrow, A.W. (Eds.), 9th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2014, May 21-23, 2014, National University of Singapore, Singapore (pp 24-35) (Leibniz International Proceedings in Informatics, Vol. 27). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Buhrman, H., Fenner, S., Fortnow, L., Torenvliet, L. (2001) Two oracles that force a big crunch.

Computational Complexity, Vol. 10 (pp 93-116)

Article | https://doi.org/10.1007/s00037-001-8190-2 | UvA-DARE

Buhrman, H., Fenner, S., Fortnow, L., van Melkebeek, D. (2000) Optimal Proof Sysytems and Sparse Sets.

Lecture Notes in Computer Science (pp 407-418)

Article | UvA-DARE

Buhrman, H., Fenner, S., Fortnow, L. (1997) Results on resource-bounded measure.

In Proceedings of the 24th International Colloquium on Automata Languages and Programming (pp 188-194). Springer.

Buhrman, H., Fortnow, L., Hitchcock, J.M., Loff Barreto, B.S. (2013) Learning reductions to sparse sets.

In Chatterjee, K. Sgall, J. (Eds.), Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013 : proceedings (pp 243-253) (Lecture Notes in Computer Science, Vol. 8087). Springer.

Buhrman, H., Fortnow, L., Koucký, M., Loff Barreto, B.S. (2010) Derandomizing from random strings.

In 25th Annual IEEE Conference on Computational Complexity: proceedings : CCC 2010 : 9-11 June, 2010, Cambridge, Massachusetts, USA (pp 58-63). IEEE Computer Society.

Buhrman, H., Fortnow, L., Koucký, M., Rogers, J., Vereshchagin, N.K. (2007) Inverting Onto Functions and Polynomial Hierarchy.

In Computer Science - Theory and Applications (pp 92-103) (Lecture Notes in Computer Science). Springer.

Buhrman, H., Fortnow, L., Koucký, M., Rogers, J.D., Vereshchagin, N. (2010) Does the polynomial hierarchy collapse if onto functions are invertible?.

Theory of Computing Systems, Vol. 46 (pp 143-156)

Article | https://doi.org/10.1007/s00224-008-9160-8 | UvA-DARE

Buhrman, H., Fortnow, L., Newman, I., Röhrig, H.P. (2003) Quantum property testing.

In Proceedings of Symposium on Discrete Algorithms (pp 480-488)

Buhrman, H., Fortnow, L., Newman, I., Röhrig, H.P. (2008) Quantum property testing.

SIAM Journal on Computing, Vol. 37 (pp 1387-1400)

Article | https://doi.org/10.1137/S0097539704442416 | UvA-DARE

Buhrman, H., Fortnow, L., Pavan, A. (2003) Some results on derandomization.

In Alt, H. Habib, M. (Eds.), STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science Berlin, Germany, February 27-March 1, 2003 : poceedings (pp 211-222) (Lecture Notes in Computer Science, Vol. 2607). Springer.

Buhrman, H., Fortnow, L., Santhanam, R. (2009) Unconditional lower bounds against advice.

In Albers, S. Marchetti-Spaccamela, A. Matias, Y. Nikoletseas, S. Thomas, W. (Eds.), Automata, Languages and Programming: 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009 : proceedings (pp 195-209) (Lecture Notes in Computer Science, Vol. 5555). Springer.

Buhrman, H., Fortnow, L., Thierauf, T. (1997) Nonrelativizing separations.

Technical Report. University of Chicago.

Report | UvA-DARE

Buhrman, H., Fortnow, L., Torenvliet, L. (1995) Using autoreducibility in separating complexity classes.

In Proc. 36d IEEE Symposium on foundations of Computer Science (pp 520-527)

Buhrman, H., Fortnow, L., Torenvliet, L. (1997) Six hypotheses in search of a theorem.

In Proceedings of the 12th IEEE Conference on Computational Complexity (pp 2-12). IEEE.