| |
| 1998 | ||
|---|---|---|
| 6 | EE | Burton Rosenberg: Fast Nondeterministic Recognition of Context-Free Languages Using two Queues. Inf. Process. Lett. 67(2): 91-93 (1998) |
| 1995 | ||
| 5 | Bernard Chazelle, Burton Rosenberg: Simplex Range Reporting on a Pointer Machine. Comput. Geom. 5: 237-247 (1995) | |
| 1993 | ||
| 4 | Michel Gangnet, Burton Rosenberg: Constraint Programming and Graph Algorithms. Ann. Math. Artif. Intell. 8(3-4): 271-284 (1993) | |
| 1992 | ||
| 3 | Bernard Chazelle, Burton Rosenberg: Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine. ICALP 1992: 439-449 | |
| 1991 | ||
| 2 | Bernard Chazelle, Burton Rosenberg: The complexity of computing partial sums off-line. Int. J. Comput. Geometry Appl. 1(1): 33-45 (1991) | |
| 1989 | ||
| 1 | EE | Bernard Chazelle, Burton Rosenberg: Computing Partial Sums in Multidimensional Arrays. Symposium on Computational Geometry 1989: 131-139 |
| 1 | Bernard Chazelle | [1] [2] [3] [5] |
| 2 | Michel Gangnet | [4] |