Search results

  • Full text

  • Document type

  • Publication year

  • Organisation

Results: 58,357
Number of items: 58,357
  • Lenstra, A. J. (1998). Analyses of the nonparametric mixed proportional hazards model. [Thesis, externally prepared, Universiteit van Amsterdam]. UvA Press.
  • Fokkink, W., & Verhoef, C. (1998). A conservative look at operational semantics with variable binding. Information and Computation, 146(1), 24-54. https://doi.org/10.1006/inco.1998.2729
  • Spee, E. J. (1998). Numerical methods in global transport-chemistry models. [Thesis, externally prepared, Universiteit van Amsterdam]. UvA.
  • Sellink, A., & Verhoef, C. (1998). Native patterns. In Proceedings Fifth Working Conference on Reverse Engineering: October 12-14, 1998 : Honolulu, Hawaii, USA (pp. 89-103). (Proceedings on reverse engineering). IEEE Computer Society. https://doi.org/10.1109/WCRE.1998.723179
  • Boncz, P. A., Wilschut, A. N., & Kersten, M. L. (1998). Flattening an Object Algebra to Provide Performance. In Proc.\ of the Int'1.\ Conf. \ on Data: Orlando, Fl, USA (pp. 147-166)
  • Hoekstra, A. G., Grimminck, M. D., & Sloot, P. M. A. (1998). Large scale simulations of elastic light scattering by a fast dipole approximation. International Journal of Modern Physics C, 87-102.
  • Hoekstra, A. G., & Bode, A. (1998). Guest editorial, high performance computing and networking Europe 1997. Future Generation Computer Systems, 4-5(13), 247-249.
  • Kartawidjaja, M. A., & Hoekstra, A. G. (1998). Memory efficiency of parallel programs and memory bounded speedup. In M. Bubak, P. M. A. Sloot, & L. O. Hertzberger (Eds.), High-performance computign and networking (HPCN Europe '98) (pp. 766-775). (Lectures notes in computer science; No. 1401). Springer Verlag GmbH.
  • Lovasz, L., & Schrijver, A. (1998). A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs. Proceedings of the American Mathematical Society, 126, 1275-1285. https://doi.org/10.1090/S0002-9939-98-04244-0
  • Schrijver, A. (1998). Routing and timetabling by topological search. Documenta Mathematica, Extra Vol.(ICM III), 687-695.
Page 4998 of 5836