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., Folkertsma, Marten, Loff, B., Neumann, N.P.M. (2024) State preparation by shallow circuits using feed forward.

Quantum, Vol. 8 (pp 1552)

Article | https://doi.org/10.22331/q-2024-12-09-1552 | UvA-DARE

Buhrman, H., Fortnow, L., Hitchcock, J.M., Loff, B. (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, B. (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. (2003) Quantum property testing.

In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms: SODA '03 : Baltimore, MD, January 12-13, 2003 (pp 480-488). Association for Computing Machinery.

Buhrman, H., Fortnow, L., Newman, I., Röhrig, H. (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.

Buhrman, H., Fortnow, L., van Melkebeek, D., Torenvliet, L. (2000) Separating complexity classes using autoreducibility.

SIAM Journal on Computing, Vol. 29 (pp 1497-1520)

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

Buhrman, H., Fortnow, L. (1997) Resource-bounded kolmogorov complexity revisited.

In Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science (pp 105-116). Springer.

Buhrman, H., Garay, J.A., Hoepman, J.H., Moir, M. (1995) Long-Lived Renaming Made Fast.

In POCD'95 (14th Symposium on Principles of Distributed Computing)

Buhrman, H., Garay, J.A., Hoepman, J.H. (1995) Optimal Resiliency against Mobile Faults.

In FTCS'95 (25th International Symposium on Fault Taulerant Computing

Buhrman, H., García-Soriano, D., Matsliah, A., de Wolf, R. (2013) The non-adaptive query complexity of testing k-parities.

Chicago Journal of Theoretical Computer Science, Vol. 2013

Article | https://doi.org/10.4086/cjtcs.2013.006 | UvA-DARE