Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 39
Number of items: 39
  • van Emde Boas, P. (1995). Over mijn relatie tot de Nederlandse taal; een bekentenis. Tilde, 7(2), 17-20.
  • van Emde Boas, P. (1995). De meestertruuk. In Simplex Sigilium Veri; een Liber Amicorum voor prof. dr. F.E.J. Kruseman Aretz (pp. 139-143)
  • Trautwein, M. H. (1995). Computational pitfalls in tractable grammatical formalisms. [Thesis, fully internal, Universiteit van Amsterdam].
  • Fischer, S. T. (1995). The solution sets of local search problems. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Apt, K. R., van Emde Boas, P., & Welling, A. (1995). The STO problem is NP-Hard. Journal of Symbolic Computation, 18, 489-495. https://doi.org/10.1006/jsco.1994.1060
  • van Emde Boas, P. (1994). The full non-renameability result; a lost tale. In A. Schrijver, K. R. Apt, & N. Temme (Eds.), From Universal morphisms to megabytes: a Baayen spacre Odyssey (pp. 301-309). CWI.
  • Huang, Z., & van Emde Boas, P. (1994). Information acquisition from multi-agent resources. In R. Fagin (Ed.), Theoretical aspects of reasoning about knowledge V (pp. 65-79). Morgan Kaufmann.
  • Huang, Z. (1994). Logic for agents with bounded rationality. [Thesis, fully internal, Universiteit van Amsterdam].
  • Groenendijk, J. A. G., Stokhof, M. J. B., & van Emde Boas, P. (1981). The Conway paradox. In J. A. G. Groenendijk, & T. M. V. Janssen (Eds.), Formal methods in the study of language. Vol. I (pp. 87-111). (Mathematical Centre tracts; No. 135). Mathematisch Centrum.
Page 4 of 4