J. Nievergelt

Publications140
h-index26
Citations5,078
Highly Influential Citations153
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • D. Knuth
  • 430 Publications • 69,280 Citations
  • U. Suter
  • 315 Publications • 11,975 Citations
  • K. Hinrichs
  • 207 Publications • 3,933 Citations
  • K. Fukuda
  • 119 Publications • 4,249 Citations
  • Publications
  • Influence
Extendible hashing—a fast access method for dynamic files
TLDR
This work studies, by analysis and simulation, the performance of extendible hashing and indicates that it provides an attractive alternative to other access methods, such as balanced trees.
The Grid File: An Adaptable, Symmetric Multikey File Structure
TLDR
This work discusses in detail the design decisions that led to the grid file, present simulation results of its behavior, and compare it to other multikey access file structures.
Combinatorial Algorithms: Theory and Practice
Plane-sweep algorithms for intersecting geometric figures
Algorithms in computational geometry are of increasing importance in computer-aided design, for example, in the layout of integrated circuits. The efficient computation of the intersection of several…
Parallel methods for integrating ordinary differential equations
This paper is dedicated to the proposition that, in order to take full advantage for real-time computations of highly parallel computers as can be expected to be available in the near future, much of…
Binary Search Trees of Bounded Balance
A new class of binary search trees, called trees of bounded balance, is introduced. These trees are easy to maintain in their form despite insertions and deletions of nodes, and the search time is…
The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects
Binary search trees of bounded balance
A new class of binary search trees, called trees of bounded balance, is introduced. These trees are easy to maintain in their form despite insertions and deletions of nodes, and the search time is…
The Grid File: An Adaptable, Symmetric Multi-Key File Structure
TLDR
This work starts from a bitmap approach and treats the problem of file design as one of data compression of a large sparse matrix, which leads to the notion of a grid directory, which is the key to a dynamic file structure called the grid file.
The parallel search bench ZRAM and its applications
TLDR
This paper presents ZRAM, a portable parallel library of exhaustive search algorithms, as a case study that proves the feasibility of achieving simultaneously the goals of portability, efficiency, and convenience of use.
...
1
2
3
4
5
...