-
Dynatrace Research
- Linz, Austria
- research.dynatrace.com
- https://orcid.org/0000-0001-7322-6332
- in/otmar-ertl
- https://scholar.google.at/citations?user=7Pt9nSkAAAAJ&hl
Stars
Fast, high-quality hash function for hash-tables and hash-maps (non-cryptographic, inline C/C++) + PRNG
This repository contains supplementary information and data corresponding to the paper "Analyzing Logs of Large-Scale Software Systems using Time Curves Visualization"
Very fast, high quality, platform-independent hashing algorithm.
Java implementations of the most popular and best performing consistent hashing algorithms for non-peer-to-peer contexts.
A Rust implementation of HyperLogLog trying to be parsimonious with memory.
A benchmark for generic, large-scale shuffle operations on continuous stream of data, implemented with state-of-the-art stream processing frameworks.
A PowerPoint add-in to insert LaTeX equations into PowerPoint presentations on Windows and Mac
The FASTEST QUALITY hash function, random number generators (PRNG) and hash map.
Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, inline C/C++) 26GB/s + PRNG
PRVHASH - Pseudo-Random-Value Hash. Hash functions, PRNG with unlimited period, randomness extractor, and a glimpse into abyss. (inline C/C++) (Codename Gradilac/Градилак)
TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation
DynaHist: A Dynamic Histogram Library for Java
ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
MinHash, LSH, LSH Forest, Weighted MinHash, HyperLogLog, HyperLogLog++, LSH Ensemble and HNSW
Automatically exported from code.google.com/p/smhasher
Paper about the generation of random numbers distributed according to the Zipf-Mandelbrot law
A toolkit for making real world machine learning and data analysis applications in C++
An efficient, general-purpose mathematics components library in the Java programming language
A software library of stochastic streaming algorithms, a.k.a. sketches.
A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means