1. 1989
  2. Voorintholt, R., Kosters, M. T., Vegter, G., Vriend, G., & Hol, W. G. J. (1989). A very fast program for visualizing protein surfaces, channels and cavities. Journal of molecular graphics, 7(4), 243-245.
  3. Gardner, C., Miękisz, J., Radin, C., & Enter, A. V. (1989). Fractal symmetry in an Ising model. Journal of Physics A, Mathematical and General, 22(21), L1019-L1023.
  4. HALANG, WA. (1989). REAL-TIME SYSTEMS .2. Microprocessing and microprogramming, 27(1-5), 765-765.
  5. GRIES, D., MARTIN, AJ., VANDESNEPSCHEUT, JLA., & UDDING, JT. (1989). AN ALGORITHM FOR TRANSITIVE REDUCTION OF AN ACYCLIC GRAPH. Science of computer programming, 12(2), 151-155.
  6. Hesselink, W. (1989). The induction rule of De Bakker and Scott. In J. W. Klop (Ed.), J.W. de Bakker, 25 jaar semantiek: Liber Amicorum (pp. 261-264). Amsterdam: Stichting Mathematisch Centrum.
  7. Schomaker, L., Thomassen, A. J. W. M., & Teulings, H-L. (1989). A computational model of cursive handwriting. In Computer Recognition and Human Production of Handwriting (pp. 153-177). World Scientific Publishing.
  8. HILBERS, PAJ., & LUKKIEN, JJ. (1989). DEADLOCK-FREE MESSAGE ROUTING IN MULTICOMPUTER NETWORKS. Distributed computing, 3(4), 178-186.
  9. Petkov, N. (1989). Design of bit-level systolic convolvers for image processing. In V. Cantoni, R. Creutzburg, S. Levialdi, & G. Wolf (Eds.), Recent issues in pattern analysis and recognition (pp. 121-131). (Lecture Notes in Computer Science; Vol. 399). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-51815-0
  10. Broer, H., & Takens, F. (1989). Formally symmetric normal forms and genericity. Dynamics Reported, 2, 36-60.
  11. Vegter, G. (1989). Kink-free deformations of polygons. In EPRINTS-BOOK-TITLE University of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science.
  12. Hateren, J. H. V. (1989). Photoreceptor Optics, Theory and Practice. In EPRINTS-BOOK-TITLE University of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science.
  13. Petkov, N. (1989). Running order statistics on a bit-level systolic array. In Parcella'88: Fourth International Workshop on Parallel Processing by Cellular Automata and Arrays (pp. 317-325). Berlin, GDR: Springer Berlin Heidelberg.
  14. Petkov, N. (1989). Systolic array for edge detection. In Proceedings CAIP
  15. Petkov, N. (1989). Systolische Algorithmen und Arrays. Berlin: Akademie Verlag.
  16. Petkov, N., Evans, D. J., Joubert, G. R., & Peters, F. J. (1989). Time-optimal systolic algorithms for some proximity problems'. In Proceedings of International Conference on Parallel Computing (pp. 229-234)
  17. Van der Schaft, AJ. (1989). Transformations of nonlinear systems under external equivalence. In New Trends in Nonlinear Control Theory (pp. 33-43). Springer.
  18. Petkov, N. (1989). Utilizing fixed-size systolic arrays for large computational problems. In Recent issues in pattern analysis and recognition (Vol. 399, pp. 132-142). Springer Berlin Heidelberg.
  19. 1988
  20. Adler, J., Enter, A. C. D. V., & Harris, A. B. (1988). Transmission of order in a correlated spin glass. Physical Review. B: Condensed Matter and Materials Physics, 38(16), 11405-11417.
  21. van Enter, A., Hemmen, J. L. V., & Pospiech, C. (1988). Mean-field theory of random-site q-state Potts models. Journal of Physics A, Mathematical and General, 21(3), 791-801.
  22. Wubs, F. W. (1988). An SWE solver for use on the CYBER 205. In Numerical solution of the shallow-water equations (Vol. 49, pp. 5-76). (CWI Tracts). CWI Amsterdam.
  23. Teulings, H-L., Schomaker, L., & Maarse, F. J. (1988). Automatic handwriting recognition and the keyboardless personal computer. In Computers in psychology: Methods, instrumentation, and psychodiagnostics (pp. 62-66). Amsterdam: Swets & Zeitlinger.

ID: 61696742