Demo Data from EDBT 2026 / reviewers in the wild / expert
Kumar Ramaiyer
dblp:21/1384
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3
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 · 66% Algorithms and data structures · 34% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry
point location |
0.0 | 1 | 1997 | Methods for Achieving Fast Query Times in Point Location Data Structures · SODA 1997 |
Computational geometry › point location
dynamic point location |
0.0 | 1 | 1994 | Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version) · SCG 1994 |
Algorithms and data structures › data structure design › search structures › search trees
finger search trees |
0.0 | 1 | 1994 | Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version) · SCG 1994 |
Algorithms and data structures › data structure design › search structures
search trees |
0.0 | 1 | 1994 | Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version) · SCG 1994 |
Computational geometry
geometric data structures |
0.0 | 1 | 1997 | Methods for Achieving Fast Query Times in Point Location Data Structures · SODA 1997 |
Methods — techniques the papers use, named apart from their topics
data structure design · 0.0biased search trees · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Methods for Achieving Fast Query Times in Point Location Data Structures
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramaiyer |
SODA | 3 |
| 1995 | Topology B-Trees and Their Applications
Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer |
WADS | 3 |
| 1994 | Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version)abstractWe present a method for maintaining biased search trees so as to support fast finger updates (i.e., updates in which one is given a pointer to the part of the tree being changed). We illustrate the power of such biased finger trees by showing how they can be used to derive an optimal O(nlogn) algorithm for the 3-dimensional layers-of-maxima problem and also obtain an improved method for dynamic point location. Mikhail J. Atallah, Michael T. Goodrich, Kumar Ramaiyer |
SCG | 3 |