Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Burton Rosenberg

dblp:82/3749 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Computational geometry · 63% Computational complexity · 25% Algorithms and data structures · 12%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity
lower bounds		 0.011992
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine · ICALP 1992
Computational geometry › range searching
range reporting		 0.011992
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine · ICALP 1992
Computational geometry › range searching › semialgebraic range searching
simplex range searching		 0.011992
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine · ICALP 1992
Computational geometry › range searching
orthogonal range searching		 0.011989
Computing Partial Sums in Multidimensional Arrays · SCG 1989
Algorithms and data structures › dynamic data structures
partial sums		 0.011989
Computing Partial Sums in Multidimensional Arrays · SCG 1989
Computational geometry
range searching		 0.011989
Computing Partial Sums in Multidimensional Arrays · SCG 1989
Computational complexity › computational models
pointer machine		 0.011992
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine · ICALP 1992

Methods — techniques the papers use, named apart from their topics

semigroup summation · 0.0
YearPublicationVenuePosition
1998 Fast Nondeterministic Recognition of Context-Free Languages Using two Queues
abstract
We show how to accept a context-free language nondeterministically in O ( n log n) time on a two-queue machine. Keywords: Algorithms, Formal Languages, Theory of Computation. 1
Burton Rosenberg
 Inf. Process. Lett.1
1995 Simplex Range Reporting on a Pointer Machine
Bernard Chazelle, Burton Rosenberg
 Comput. Geom.2
1992 Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Bernard Chazelle, Burton Rosenberg
 ICALP2
1989 Computing Partial Sums in Multidimensional Arrays
abstract
1 Introduction The central theme of this paper is the complexity of the partial-sum problem: Given a d-dimensional array A with n entries in a semigroup and a d-rectangle q = [a1; b1] \\Theta \\Delta \\Delta \\Delta \\Theta [ad; bd], compute the sum oe(A; q) = X
Bernard Chazelle, Burton Rosenberg
 SCG2