Education:

• Princeton University, Doctor of Philosophy in Computer Science, October 1991.
• Princeton University, Master of the Arts in Computer Science, May 1988.
• Columbia University, Master of Science in Computer Science, June 1986.
• Massachusetts Institute of Technology, Bachelor of Science in Electrical Engineering, June 1980.

Experience:

• University of Miami. Associate Professor. 2000 - present.
• University of Miami. Assistant Professor. 1992 - 1998.
• Dartmouth College. Visiting Assistant Professor. 1991 - 1992.

• Citrix Systems, Ft. Lauderdale, Florida. Senior Software Engineer. 1998-200.
• Paris Research Laboratory, Digital Equipment Corporation, Paris, France. Visiting Researcher. 1990.
• Bell Communications Research, Morristown, New Jersey. Visiting Researcher. 1987,
• Medical Laboratory Automation, Pleasantville, New York. Software Engineer. 1984-1986.
• Centre George Pompidou, Paris, France. Consulting engineer. 1982-1984.
• Acoustic Research, Norwood, Massachusetts. Consulting Engineer. 1982.

Grants:

• Amazon Web Services in Education Teaching Grant. for cloud computing in teaching, 10 August 2011.
• Amazon Web Services in Education Teaching Grant. for cloud computing in teaching, 25 August 2010.
• Amazon Web Services in Education Teaching Grant. $1,600 for cloud computing in teaching, 25 August 2009.
• National Science Foundation grant DUE-0630894, S-STEM: Computer Science and Mathematics for Scientists, $467,575. January 1, 2007 - December 31, 2011. co-P.I.
• National Science Foundation grant DUE-0230612, PHASER: A Universal Simulator for Dynamical Systems, $299,828. February 1, 2003 - January 31, 2006. co-P.I.
• IBM Boca Raton, contract PSP950359: Microkernel Research Agreement, $150,00 software grant. August 1995 - May 1997. PI

Publications:

• Robert Chen, Burton Rosenberg, >How to Lose with Least Probability, arXiv:1112.2117v2, 9 December 2011. (ArXiv)
• Robert Chen, Alan Zame and Burton Rosenberg, On the first occurrence of strings, The Electronic Journal of Combinatorics, 16 (1) (2009), R29.
• Robert Chen, Burton Rosenberg, Optimal exercise of russian options in the binomial model, International Conference on Computational Finance and its Applications, WIT Press (2006), 171-181.
• Robert Chen, Burton Rosenberg, Yi-Tsung Lee, Inferring model parameters in markets with collars, International Conference on Computational Finance and its Applications, WIT Press (2004), 167-175.
• Robert W. Chen, Burton Rosenberg and Larry A. Shepp, A secretary problem with two decision makers, Journal of Applied Probability, 34 (1997), 1068-1074.
• Burton Rosenberg, Fast nondeterministic recognition of context free languages using two queues, Information Processing Letters, 67 (1998), 91-93.
• Bernard Chazelle and Burton Rosenberg, Simplex range reporting on a pointer machine, Computational Geometry: Theory and Applications, 5 (1996), 237-247.
• Burton Rosenberg, Two experiments in the stability of stock statistics, Third International Conference on Artificial Intelligence Applications on Wall Street (1995), 182-187.
• Michel Gangnet and Burton Rosenberg, Constraint programming and graph algorithms, Annals of Mathematics and Artificial Intelligence, 8:3-4 (1993), 271-284.
• Burton Rosenberg, Simulating a stack by queues, Proceedings of the XIX Latinamerican Conference on Computer Science 1 (1993), 3-13.
• Bernard Chazelle and Burton Rosenberg, Lower bounds on simplex range reporting on a pointer machine, Nineteenth International Colloquium on Automata, Languages and Programming, LNCS 623 (1992), 439-449.
• Bernard Chazelle and Burton Rosenberg, The complexity of computing partial sums off-line, International Journal of Computational Geometry and Applications 1:1 (1991) 33-45.
• Bernard Chazelle and Burton Rosenberg, Computing partial sums in multidimensional arrays, Proceedings of the Fifth Annual ACM Symposium on Computational Geometry, ACM Press, (1989) 131-139.