Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • Buhrman, H. M., & Torenvliet, L. (1996). Complete sets and structure in sub-recursive classes. In Logic Colloquium 96: European Summer Meeting of the Association for Symbolic Logic (pp. 59-64)
  • Open Access
    Buhrman, H. M., & Torenvliet, L. (1996). P-selective self-reducible sets: A new characterization of P. Journal of Computer and System Sciences, 53(2), 210-217. https://doi.org/10.1006/jcss.1996.0062
  • Buhrman, H. M., Hemaspaandra, L., & Longpre, L. (1995). Sparse Reduces Conjunctively to Tally. SIAM Journal on Computing, 24(4), 673-681. https://doi.org/10.1137/0224044
  • Buhrman, H. M., & Mayordomo, E. (1995). An excursion to the Kolmogorov Random Strings. In STRUCTURES'95 (10th Conference on Structure In Complexity Theoy)
  • Balcazar, J., Buhrman, H. M., & Hermo, M. (1995). Learnability of Kolmogorov-Easy Circuit Expressions Via Queries. In EUROCOLT'95 (2nd European Conference on Learning Theory)
  • Buhrman, H. M., 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. M., Garay, J. A., & Hoepman, J. H. (1995). Optimal Resiliency against Mobile Faults. In FTCS'95 (25th International Symposium on Fault Taulerant Computing
  • Buhrman, H. M., 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. M., & Hermo, M. (1995). On the Sparse Set Conjecture for Sets with Low Density. In STACS'95 (Symposium on Theoretical Aspects of Computer Scienc 1995)
  • Buhrman, H. M., & Torenvliet, L. (1994). On the structure of complete sets. In U. Schoening (Ed.), Proc. Structure in Complexity Theory, 9th annual conference (pp. 118-133). IEEE Computer Society Press.
Page 17 of 18