Ran Ben-Basat

Proceedings of the 2020 IFIP Networking Conference, 2020

Routing Oblivious Measurement Analytics.

[BibT_eX]

[DOI]

Proceedings of the 2020 IFIP Networking Conference, 2020

Near Optimal Network-wide Per-Flow Measurement.

[BibT_eX]

[DOI]

Bilal Tayh

Proceedings of the 39th IEEE Conference on Computer Communications, 2020

Faster and More Accurate Measurement through Additive-Error Counters.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE Conference on Computer Communications, 2020

Cooperative Network-wide Flow Selection.

[BibT_eX]

[DOI]

Bilal Tayh

Proceedings of the 28th IEEE International Conference on Network Protocols, 2020

DISCOvering the heavy hitters with disaggregated sketches.

[BibT_eX]

[DOI]

Proceedings of the CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, 2020

A faster and more efficient <i>q</i>-MAX algorithm.

[BibT_eX]

[DOI]

Bilal Tayh

Proceedings of the CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, 2020

Detecting routing loops in the data plane.

[BibT_eX]

[DOI]

Proceedings of the CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, 2020

Learning Software Constraints via Installation Attempts.

[BibT_eX]

[DOI]

Maayan Goldstein

Itai Segall

Proceedings of the 1st Symposium on Algorithmic Principles of Computer Systems, 2020

2019

Randomized Admission Policy for Efficient Top-k, Frequency, and Volume Estimation.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2019

Give me some slack: Efficient network measurements.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

I Know What You Did Last Summer: Network Monitoring using Interval Queries.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2019

Succinct Summing over Sliding Windows.

[BibT_eX]

[DOI]

Algorithmica, 2019

Parameterized Distributed Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Nitrosketch: robust and general sketch-based monitoring in software switches.

[BibT_eX]

[DOI]

Proceedings of the ACM Special Interest Group on Data Communication, 2019

Attack Time Localization using Interval Queries.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos, 2019

A Black-box Method for Accelerating Measurement Algorithms with Accuracy Guarantees.

[BibT_eX]

[DOI]

Marcelo Caggiani Luizelli

Proceedings of the 2019 IFIP Networking Conference, 2019

q-MAX: A Unified Way to Improve Network Measurement Throughput.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2019, 2019

q-MAX: A Unified Scheme for Improving Network Measurement Throughput.

[BibT_eX]

[DOI]

Proceedings of the Internet Measurement Conference, 2019

2018

Big Data Methods for Efficient Network Monitoring.

[BibT_eX]

[DOI]

PhD thesis, 2018

Stream Frequency Over Interval Queries.

[BibT_eX]

[DOI]

Rana Shahout

Proc. VLDB Endow., 2018

Fast flow volume estimation.

[BibT_eX]

[DOI]

Pervasive Mob. Comput., 2018

Optimal Distributed Weighted Set Cover Approximation.

[BibT_eX]

[DOI]

Guy Even

CoRR, 2018

Heavy Hitters over Interval Queries.

[BibT_eX]

[DOI]

Rana Shahout

CoRR, 2018

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log<sup>2</sup> logΔ) Rounds.

[BibT_eX]

[DOI]

Guy Even

CoRR, 2018

Space Efficient Elephant Flow Detection.

[BibT_eX]

[DOI]

Proceedings of the 11th ACM International Systems and Storage Conference, 2018

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds.

[BibT_eX]

[DOI]

Guy Even

Proceedings of the Structural Information and Communication Complexity, 2018

Volumetric Hierarchical Heavy Hitters.

[BibT_eX]

[DOI]

Marcelo Caggiani Luizelli

Proceedings of the 26th IEEE International Symposium on Modeling, 2018

Frequent elements on query defined ranges.

[BibT_eX]

[DOI]

Rana Shahout

Proceedings of the IEEE INFOCOM 2018, 2018

Line speed heavy hitters on sliding windows.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2018, 2018

Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

Efficient Measurement on Programmable Switches Using Probabilistic Recirculation.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE 26th International Conference on Network Protocols, 2018

Brief Announcement: Give Me Some Slack: Efficient Network Measurements.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Network-wide routing-oblivious heavy hitters.

[BibT_eX]

[DOI]

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems, 2018

2017

A Game Theoretic Analysis of the Adversarial Retrieval Setting.

[BibT_eX]

[DOI]

Moshe Tennenholtz

Oren Kurland

J. Artif. Intell. Res., 2017

Efficient Network Measurements through Approximated Windows.

[BibT_eX]

[DOI]

CoRR, 2017

Succinct Approximate Rank Queries.

[BibT_eX]

[DOI]

CoRR, 2017

Counting distinct elements over sliding windows.

[BibT_eX]

[DOI]

Proceedings of the 10th ACM International Systems and Storage Conference, 2017

Constant Time Updates in Hierarchical Heavy Hitters.

[BibT_eX]

[DOI]

Marcelo Caggiani Luizelli

Proceedings of the Conference of the ACM Special Interest Group on Data Communication, 2017

Poster abstract: A sliding counting bloom filter.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications Workshops, 2017

Optimal elephant flow detection.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Randomized admission policy for efficient top-k and frequency estimation.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

2016

The k-distinct language: Parameterized automata constructions.

[BibT_eX]

[DOI]

Ariel Gabizon

Meirav Zehavi

Theor. Comput. Sci., 2016

The ranking game.

[BibT_eX]

[DOI]

Elad Kravi

Proceedings of the 19th International Workshop on Web and Databases, 2016

Efficient Summing over Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Heavy hitters in streams and sliding windows.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015

The Probability Ranking Principle is Not Optimal in Adversarial Retrieval Settings.

[BibT_eX]

[DOI]

Moshe Tennenholtz

Oren Kurland

Proceedings of the 2015 International Conference on The Theory of Information Retrieval, 2015

2014

Relations between automata and the simple k-path problem.

[BibT_eX]

[DOI]