Computing Partial Sums in Multidimensional Arrays. - Bernard Chazelle; Burton Rosenberg (SCG, 1989)

The complexity of computing partial sums off-line. - Bernard Chazelle; Burton Rosenberg (Int. J. Comput. Geom. Appl., 1991)

Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine. - Bernard Chazelle; Burton Rosenberg (ICALP, 1992)

Constraint Programming and Graph Algorithms. - Michel Gangnet; Burton Rosenberg (Ann. Math. Artif. Intell., 1993)

Simplex Range Reporting on a Pointer Machine. - Bernard Chazelle; Burton Rosenberg (Comput. Geom., 1995)

Fast Nondeterministic Recognition of Context-Free Languages Using two Queues. - Burton Rosenberg (Inf. Process. Lett., 1998)

On the First Occurrence of Strings. - Robert W. Chen; Alan Zame; Burton Rosenberg (Electron. J. Comb., 2009)

How to Lose with Least Probability - Robert W. Chen; Burton Rosenberg (CoRR, 2011)