V
Victor Alvarez
Researcher at Saarland University
Publications - 18
Citations - 198
Victor Alvarez is an academic researcher from Saarland University. The author has contributed to research in topics: Planar graph & Jump-and-Walk algorithm. The author has an hindex of 9, co-authored 18 publications receiving 191 citations. Previous affiliations of Victor Alvarez include National Autonomous University of Mexico.
Papers
More filters
Proceedings ArticleDOI
Main memory adaptive indexing for multi-core systems
TL;DR: Three alternative parallel algorithms for adaptive indexing are described, including a second variant of a parallel standard cracking algorithm, a hybrid parallel sorting algorithm, and a NUMA-aware method based on sorting which serve as a realistic baseline for multi-threaded adaptive indexer techniques.
Proceedings ArticleDOI
A simple aggregative algorithm for counting triangulations of planar point sets and related problems
Victor Alvarez,Raimund Seidel +1 more
TL;DR: An algorithm that determines the number (S) of straight line triangulations of a set S of n points in the plane in worst case time O(n2 2n) is given, the first algorithm that is provably faster than enumeration.
Proceedings ArticleDOI
A comparison of adaptive radix trees and hash tables
TL;DR: A thorough experimental comparison between ART, Judy, two variants of hashing via quadratic probing, and three variants of Cuckoo hashing is presented, which indicates that neither ART nor Judy are competitive to the aforementioned hashing schemes in terms of performance, and, in the case of ART, sometimes not even in Terms of space.
Proceedings ArticleDOI
Counting crossing-free structures
TL;DR: This paper develops a general technique for computing the number of crossing-free structures of an input set P and shows that the techniques are general enough to solve the restricted triangulation counting problem, which is proved to be W[2]-hard in the parameter k.
Posted Content
Main Memory Adaptive Indexing for Multi-core Systems
TL;DR: In this article, the authors describe three alternative parallel algorithms for adaptive indexing, including a second variant of a parallel standard cracking algorithm, and a NUMA-aware method based on sorting.