Give me some slack: efficient network measurements
type: Item
instance of: scholarly article
title: Give me some slack: efficient network measurements
zbMATH Open document ID: 1430.68445
author: Gil Einziger
author: Roy Friedman
author: Ran Ben-Basat
published in: Theoretical Computer Science
publication date: 2019-09-10T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9616/
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 7102953
zbMATH Keywords: streaming algorithms
zbMATH Keywords: lower bounds
zbMATH Keywords: sliding windows
zbMATH Keywords: approximation algorithms
describes a project that uses: HyperLogLog
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2945734653
cites work: Mergeable summaries
cites work: Q4228450
cites work: Q4440423
cites work: Efficient Summing over Sliding Windows
cites work: An Improved Construction for Counting Bloom Filters
cites work: Q3575017
cites work: Maintaining Stream Statistics over Sliding Windows
cites work: Algorithms - ESA 2003
cites work: Q3576759
cites work: Probabilistic counting algorithms for data base applications
cites work: Estimating the number of Active Flows in a Data Stream over a Sliding Window
cites work: Distributed streams algorithms for sliding windows
cites work: Order statistics and estimating cardinalities of massive data sets
cites work: Sliding Bloom Filters
Wikidata QID: Q127823022
DOI: 10.1016/J.TCS.2019.05.012
description: scientific article; zbMATH DE number 7102953