Raphael "Raphi" Rom is an Israeli computer scientist working at Technion – Israel Institute of Technology.[1]

Rom earned his Ph.D. in 1975 from the University of Utah, under the supervision of Thomas Stockham.[2] He is known for his contribution to the development of the Catmull–Rom spline,[3] and for his research on computer networks.

Selected publications

  • Catmull, E.; Rom, R. (1974), "A class of local interpolating splines", in Barnhill, R. E.; Riesenfeld, R. F. (eds.), Computer Aided Geometric Design, New York: Academic Press, pp. 317–326.
  • Rom, R.; Sidi, M. (1990), Multiple Access Protocols: Performance and Analysis, Springer.[4][5]
  • Orda, A.; Rom, R. (1990), "Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length", Journal of the ACM, 37 (3): 607–625, CiteSeerX 10.1.1.392.7997, doi:10.1145/79147.214078, MR 1072271, S2CID 2910521.
  • Orda, A..; Rom, R.; Shimkin, N. (1993), "Competitive routing in multiuser communication networks", IEEE/ACM Transactions on Networking, 1 (5): 510–521, CiteSeerX 10.1.1.380.8744, doi:10.1109/90.251910, S2CID 1184436.
  • Azar, Yossi; Naor, Joseph; Rom, Raphael (1995), "The competitiveness of on-line assignments", Journal of Algorithms, 18 (2): 221–237, CiteSeerX 10.1.1.41.5057, doi:10.1006/jagm.1995.1008, MR 1317665, S2CID 6718477.
  • Cidon, I.; Rom, R.; Shavitt, Y. (1999), "Analysis of multi-path routing", IEEE/ACM Transactions on Networking, 7 (6): 885–896, CiteSeerX 10.1.1.144.962, doi:10.1109/90.811453, S2CID 1056820.

References

  1. ↑ Faculty profile, Technion, retrieved 2014-05-01.
  2. ↑ Raphael Rom at the Mathematics Genealogy Project.
  3. ↑ Greenberg, Ira (2007), Processing: Creative Coding and Computational Art, Apress, p. 281, ISBN 9781430203100.
  4. ↑ Review of Multiple Access Protocols by David Finkel (1991), ACM SIGMETRICS Performance Evaluation Review 18 (4): 11, doi:10.1145/122289.1045553.
  5. ↑ Review of Multiple Access Protocols by Apple van de Liefvoort (1993), ACM SIGMETRICS Performance Evaluation Review 20 (3): 5–6, doi:10.1145/155768.1044950.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.