Otmar Ertl

Orcid: 0000-0001-7322-6332

According to our database1, Otmar Ertl authored at least 19 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Cardinality Estimation Adaptive Cuckoo Filters (CE-ACF): Approximate Membership Check and Distinct Query Count for High-Speed Network Monitoring.
IEEE/ACM Trans. Netw., April, 2024

UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting.
Proc. VLDB Endow., March, 2024

High-level Stream Processing: A Complementary Analysis of Fault Recovery.
CoRR, 2024

JumpBackHash: Say Goodbye to the Modulo Operation to Distribute Keys Uniformly to Buckets.
CoRR, 2024

ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale.
CoRR, 2024

ShuffleBench: A Benchmark for Large-Scale Data Shuffling Operations with Distributed Stream Processing Frameworks.
Proceedings of the 15th ACM/SPEC International Conference on Performance Engineering, 2024

A Comprehensive Benchmarking Analysis of Fault Recovery in Stream Processing Frameworks.
Proceedings of the 18th ACM International Conference on Distributed and Event-based Systems, 2024

2023
Benchmarking Stream Processing Frameworks for Large Scale Data Shuffling.
Softwaretechnik-Trends, November, 2023

A systematic mapping of performance in distributed stream processing systems.
Proceedings of the 49th Euromicro Conference on Software Engineering and Advanced Applications, 2023

2022
ProbMinHash - A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity.
IEEE Trans. Knowl. Data Eng., 2022

Computing the Similarity Estimate Using Approximate Memory.
IEEE Trans. Emerg. Top. Comput., 2022

2021
SetSketch: Filling the Gap between MinHash and HyperLogLog.
Proc. VLDB Endow., 2021

Estimation from Partially Sampled Distributed Traces.
CoRR, 2021

2019
Computing Extremely Accurate Quantiles Using t-Digests.
CoRR, 2019

2018
BagMinHash - Minwise Hashing Algorithm for Weighted Sets.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

2017
New Cardinality Estimation Methods for HyperLogLog Sketches.
CoRR, 2017

SuperMinHash - A New Minwise Hashing Algorithm for Jaccard Similarity Estimation.
CoRR, 2017

New cardinality estimation algorithms for HyperLogLog sketches.
CoRR, 2017

2009
A fast level set framework for large three-dimensional topography simulations.
Comput. Phys. Commun., 2009


  Loading...