• Publications
  • Influence
Cache-, hash-, and space-efficient bloom filters
This work proposes several new variants of Bloom filters and replacements with similar functionality that have a better cache-efficiency and need less hash bits than regular Bloom filters, and some use SIMD functionality, while the others provide an even better space efficiency.
MCSTL: the multi-core standard template library
This work presents performance measurements on several architectures and concludes that simple recompilation will provide partial parallelization of applications that make consistent use of the C++ Standard Template Library.
The Filter-Kruskal Minimum Spanning Tree Algorithm
A simple modification of Kruskal's algorithm that avoids sorting edges that are "obviously" not in the MST, and has very good practical performance over the entire range of edge densities.
Theories of Creole Genesis, Sociohistorical Considerations, and the Evaluation of Evidence: The Case of Haitian Creole and the Relexification Hypothesis
In an early Caribbean colony the conversion from other crops to sugar monoculture utterly transformed the colony's society and arguably its language as well. A comparative quantitative analysis of
Why You Can't Do a VARBRUL Study of Quotatives And What Such a Study Can Show Us
The twentieth century saw the introduction of three quotatives into American English. First there was go, whose appearance appears to date at least as far back as the 1940's and 1950's, according to
Parallelization of Bulk Operations for STL Dictionaries
This work considers parallelizing two of their bulk operations, namely the construction from many elements, and the insertion of many elements at a time, which can make programs profit in an easy way from multi-core processing power.
Shortest Paths
This section discusses three algorithms for breadth-first search for unweighted graphs, Dijkstra's algorithm for weighted graphs, and the Floyd-Warshall algorithm for computing distances between all pairs of vertices.
Energy-efficient sorting using solid state disks
Using a low-power processor, solid state disks, and efficient algorithms, this work beats the current records in the JouleSort benchmark for 10GB to 1 TB of data by factors of up to 5.1.
Scalable distributed-memory external sorting
An algorithm whose I/O requirement is close to a lower bound is outlined, in contrast to naive implementations of multiway merging and all other approaches known to us, the algorithm works with just two passes over the data even for the largest conceivable inputs.