Burton Rosenberg
From MaRDI portal
Person:293325
Available identifiers
zbMath Open rosenberg.burtonMaRDI QIDQ293325
List of research outcomes
| Publication | Date of Publication | Type |
|---|---|---|
| Lower bounds on the complexity of simplex range reporting on a pointer machine | 2019-12-04 | Paper |
| Fast nondeterministic recognition of context-free languages using two queues | 2016-06-09 | Paper |
| How to Lose with Least Probability | 2011-12-09 | Paper |
| On the first occurrence of strings | 2009-04-07 | Paper |
| A secretary problem with two decision makers | 1998-11-03 | Paper |
| Constraint programming and graph algorithms. | 1997-05-12 | Paper |
| Simplex range reporting on a pointer machine | 1996-07-14 | Paper |
| THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE | 1991-01-01 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
| Property | Value |
|---|---|
| MaRDI profile type | MaRDI person profile |
| instance of | human |
This page was built for person: Burton Rosenberg
