Burton Rosenberg

According to our database, Burton Rosenberg authored at least 8 papers between 1989 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

How to Lose with Least Probability

Robert W. Chen, Burton Rosenberg

CoRR, 2011

2009

On the First Occurrence of Strings.

Robert W. Chen, Alan Zame, Burton Rosenberg

Electron. J. Comb., 2009

1998

Fast Nondeterministic Recognition of Context-Free Languages Using two Queues.

Burton Rosenberg

Inf. Process. Lett., 1998

1995

Simplex Range Reporting on a Pointer Machine.

Bernard Chazelle, Burton Rosenberg

Comput. Geom., 1995

1993

Constraint Programming and Graph Algorithms.

Michel Gangnet, Burton Rosenberg

Ann. Math. Artif. Intell., 1993

1992

Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine.

Bernard Chazelle, Burton Rosenberg

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

The complexity of computing partial sums off-line.

Bernard Chazelle, Burton Rosenberg

Int. J. Comput. Geom. Appl., 1991

1989

Computing Partial Sums in Multidimensional Arrays.

Bernard Chazelle, Burton Rosenberg

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989