EDBT 2026 Demo / reviewers in the wild / expert
Sohit Bansal
dblp:51/471
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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
1 paper |
Computational geometry · 100% | |
| Computer networks
1 paper |
Internet of things and sensor networks · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry
geometric graph theory |
0.1 | 1 | 2008 | Nearest-neighbor graphs on random point sets and their applications to sensor networks · PODC 2008 |
Computational geometry › proximity problems
nearest neighbor graph |
0.1 | 1 | 2008 | Nearest-neighbor graphs on random point sets and their applications to sensor networks · PODC 2008 |
Internet of things and sensor networks
wireless sensor network |
0.0 | 1 | 2008 | Nearest-neighbor graphs on random point sets and their applications to sensor networks · PODC 2008 |
Methods — techniques the papers use, named apart from their topics
poisson point process · 0.2percolation theory · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Nearest-neighbor graphs on random point sets and their applications to sensor networksabstractWe study the graph NN(d,k) constructed on a Poisson point process in d dimensions by connecting each point to the k points nearest to it. We show that if k geq 188, NN(2,k) has an infinite connected component and this infinite component has an infinite subset of points with the property that the distance along the edges of the graphs between any pair of these points is at most a constant factor larger than their Euclidean distance. Finally we discuss the relevance of our results to the study of wireless sensor networks. Amitabha Bagchi, Sohit Bansal |
PODC | 2 |