Demo Data from EDBT 2026 / reviewers in the wild / expert
Kohei Noshita
dblp:94/3520
· DBLP profile ↗
8ranked-venue papers
4as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 5 · 3 first-authorTheory of computation · 5 · 4 first-authorArtificial intelligence and machine learning · 2Systems, 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
2 papers |
Algorithms and data structures · 35% Computational complexity · 35% Computational geometry · 15% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures
comparison-based algorithms |
0.0 | 1 | 1982 | Predicting the Number of Distinct Elements in a Multiset · SIAM J. Comput. 1982 |
Computational complexity › decision problems
decision problem complexity |
0.0 | 1 | 1982 | Predicting the Number of Distinct Elements in a Multiset · SIAM J. Comput. 1982 |
Computational geometry › graph drawing
crossing number |
0.0 | 1 | 1971 | A Property of N-Graphs · IEEE Trans. Computers 1971 |
Computational geometry
graph drawing |
0.0 | 1 | 1971 | A Property of N-Graphs · IEEE Trans. Computers 1971 |
Graph algorithms and graph theory
graph theory |
0.0 | 1 | 1971 | A Property of N-Graphs · IEEE Trans. Computers 1971 |
Graph algorithms and graph theory
planar graphs |
0.0 | 1 | 1971 | A Property of N-Graphs · IEEE Trans. Computers 1971 |
Methods — techniques the papers use, named apart from their topics
lower bound · 0.0asymptotic analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | A fast image-gathering system from the World-Wide Web using a PC cluster
Keiji Yanai, Masaya Shindo, Kohei Noshita |
Image Vis. Comput. | 3 |
| 2001 | A Fast Image-Gathering System on the World-Wide Web Using a PC Cluster
Keiji Yanai, Masaya Shindo, Kohei Noshita |
Web Intelligence | 3 |
| 1985 | Translation of Turner Combinators in O(n log n) Space
Kohei Noshita |
Inf. Process. Lett. | 1 |
| 1982 | Predicting the Number of Distinct Elements in a MultisetabstractThe bounds of the number of comparisons are obtained for the problem of determining whether the number of distinct elements in a given multiset is no more than a given threshold value. Those bounds are asymptotically optimal within constant factors. Two models of the algorithm are considered to derive those bounds. Kohei Noshita |
SIAM J. Comput. | 1 |
| 1979 | A Technique for Implementing Backtrack Algorithms and its Application
Hirosi Hitotumatu, Kohei Noshita |
Inf. Process. Lett. | 2 |
| 1978 | On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs
Kohei Noshita, Etsuo Masuda, Hajime Machida |
Inf. Process. Lett. | 1 |
| 1974 | Median Selection of 9 Elements in 14 Comparisons
Kohei Noshita |
Inf. Process. Lett. | 1 |
| 1971 | A Property of N-GraphsabstractT. A. J. Nicholson has introduced a restricted class of drawn graphs (N-graphs) into the problem of drawing a graph with a minimum number of crosspoints. This short note shows some defects in representing the capability of N-graphs by presenting a planar graph which cannot be represented by any N-graphs. Akihiro Hashimoto, Kohei Noshita |
IEEE Trans. Computers | 2 |