Ran Ben-Basat - RankMe

61 papers A* 11A 3B 6Misc 5Journal 29Unranked 7

Year	Rank	Type	Title / Venue / Authors
2024	A*	`conf`	Accelerating Federated Learning with Quick Distributed Mean Estimation. ICML Ran Ben-Basat, Shay Vargaftik, Amit Portnoy, Gil Einziger, Yaniv Ben-Itzhak, Michael Mitzenmacher
2024	A*	`conf`	Optimal and Approximate Adaptive Stochastic Quantization. NeurIPS Ran Ben-Basat, Yaniv Ben-Itzhak, Michael Mitzenmacher, Shay Vargaftik
2024	J	`jnl`	Optimal and Near-Optimal Adaptive Vector Quantization. CoRR Ran Ben-Basat, Yaniv Ben-Itzhak, Michael Mitzenmacher, Shay Vargaftik
2023	J	`jnl`	Optimal distributed covering algorithms. Distributed Comput. Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2022	J	`jnl`	FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches. CoRR Wenchen Han, Vic Feng, Gregory Schwartzman, Michael Mitzenmacher, Minlan Yu, Ran Ben-Basat
2022	J	`jnl`	SQUID: Faster Analytics via Sampled Quantiles Data-structure. CoRR Ran Ben-Basat, Gil Einziger, Wenchen Han, Bilal Tayh
2021	A*	`conf`	DRIVE: One-bit Distributed Mean Estimation. NeurIPS Shay Vargaftik, Ran Ben-Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher
2021	J	`jnl`	Routing-Oblivious Network-Wide Measurements. IEEE/ACM Trans. Netw. Ran Ben-Basat, Gil Einziger, Shir Landau Feibish, Jalil Moraney, Bilal Tayh, Danny Raz
2021	Misc	`conf`	Zero-CPU Collection with Direct Telemetry Access. HotNets Jonatan Langlet, Ran Ben-Basat, Sivaramakrishnan Ramanathan, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi
2020	J	`jnl`	How to send a real number using a single bit (and some shared randomness). CoRR Ran Ben-Basat, Michael Mitzenmacher, Shay Vargaftik
2019	—	`conf`	Cheetah: Accelerating Database Queries with Switch Pruning. SIGCOMM Posters and Demos Muhammad Tirmazi, Ran Ben-Basat, Jiaqi Gao, Minlan Yu
2019	A*	`conf`	Nitrosketch: robust and general sketch-based monitoring in software switches. SIGCOMM Zaoxing Liu, Ran Ben-Basat, Gil Einziger, Yaron Kassner, Vladimir Braverman, Roy Friedman, Vyas Sekar
2019	A*	`conf`	Optimal Distributed Covering Algorithms. PODC Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2019	A	`conf`	Optimal Distributed Covering Algorithms. DISC Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2019	J	`jnl`	Optimal Distributed Covering Algorithms. CoRR Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2019	A	`conf`	Parameterized Distributed Algorithms. DISC Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman
2019	J	`jnl`	Succinct Summing over Sliding Windows. Algorithmica Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner
2018	B	`conf`	A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds. SIROCCO Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2018	J	`jnl`	A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log CoRR Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2018	B	`conf`	Approximate Query Processing over Static Sets and Sliding Windows. ISAAC Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare
2018	J	`jnl`	Approximate Query Processing over Static Sets and Sliding Windows. CoRR Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare
2018	A*	`conf`	Brief Announcement: Give Me Some Slack: Efficient Network Measurements. ICALP Ran Ben-Basat, Gil Einziger, Roy Friedman
2018	B	`conf`	Efficient Measurement on Programmable Switches Using Probabilistic Recirculation. ICNP Ran Ben-Basat, Xiaoqi Chen, Gil Einziger, Ori Rottenstreich
2018	J	`jnl`	Efficient Measurement on Programmable Switches Using Probabilistic Recirculation. CoRR Ran Ben-Basat, Xiaoqi Chen, Gil Einziger, Ori Rottenstreich
2018	Misc	`conf`	Fast Flow Volume Estimation. ICDCN Ran Ben-Basat, Gil Einziger, Roy Friedman
2018	J	`jnl`	Fast flow volume estimation. Pervasive Mob. Comput. Ran Ben-Basat, Gil Einziger, Roy Friedman
2018	—	`conf`	Frequent elements on query defined ranges. INFOCOM Workshops Ran Ben-Basat, Rana Shahout, Roy Friedman
2018	B	`conf`	Give Me Some Slack: Efficient Network Measurements. MFCS Ran Ben-Basat, Gil Einziger, Roy Friedman
2018	J	`jnl`	Heavy Hitters over Interval Queries. CoRR Ran Ben-Basat, Roy Friedman, Rana Shahout
2018	J	`jnl`	Learning Software Constraints via Installation Attempts. CoRR Ran Ben-Basat, Maayan Goldstein, Itai Segall
2018	—	`conf`	Line speed heavy hitters on sliding windows. INFOCOM Workshops Ran Ben-Basat, Gil Einziger, Erez Waisbard
2018	J	`jnl`	Memento: Making Sliding Windows Efficient for Heavy Hitters. CoRR Ran Ben-Basat, Gil Einziger, Isaac Keslassy, Ariel Orda, Shay Vargaftik, Erez Waisbard
2018	A	`conf`	Memento: making sliding windows efficient for heavy hitters. CoNEXT Ran Ben-Basat, Gil Einziger, Isaac Keslassy, Ariel Orda, Shay Vargaftik, Erez Waisbard
2018	—	`conf`	Network-wide routing-oblivious heavy hitters. ANCS Ran Ben-Basat, Gil Einziger, Shir Landau Feibish, Jalil Moraney, Danny Raz
2018	J	`jnl`	Optimal Distributed Weighted Set Cover Approximation. CoRR Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2018	J	`jnl`	Parameterized Distributed Algorithms. CoRR Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman
2018	A*	`conf`	Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free. INFOCOM Eran Assaf, Ran Ben-Basat, Gil Einziger, Roy Friedman
2018	Misc	`conf`	Space Efficient Elephant Flow Detection. SYSTOR Ran Ben-Basat, Gil Einziger, Roy Friedman
2018	J	`jnl`	Stream Frequency Over Interval Queries. Proc. VLDB Endow. Ran Ben-Basat, Roy Friedman, Rana Shahout
2018	B	`conf`	Volumetric Hierarchical Heavy Hitters. MASCOTS Ran Ben-Basat, Gil Einziger, Roy Friedman, Marcelo Caggiani Luizelli, Erez Waisbard
2017	J	`jnl`	A Game Theoretic Analysis of the Adversarial Retrieval Setting. J. Artif. Intell. Res. Ran Ben-Basat, Moshe Tennenholtz, Oren Kurland
2017	A*	`conf`	Constant Time Updates in Hierarchical Heavy Hitters. SIGCOMM Ran Ben-Basat, Gil Einziger, Roy Friedman, Marcelo Caggiani Luizelli, Erez Waisbard
2017	J	`jnl`	Constant Time Updates in Hierarchical Heavy Hitters. CoRR Ran Ben-Basat, Gil Einziger, Roy Friedman, Marcelo Caggiani Luizelli, Erez Waisbard
2017	Misc	`conf`	Counting distinct elements over sliding windows. SYSTOR Eran Assaf, Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner
2017	J	`jnl`	Efficient Network Measurements through Approximated Windows. CoRR Ran Ben-Basat, Gil Einziger, Roy Friedman
2017	J	`jnl`	Fast Flow Volume Estimation. CoRR Ran Ben-Basat, Gil Einziger, Roy Friedman
2017	J	`jnl`	Optimal Elephant Flow Detection. CoRR Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner
2017	A*	`conf`	Optimal elephant flow detection. INFOCOM Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner
2017	J	`jnl`	Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free. CoRR Eran Assaf, Ran Ben-Basat, Gil Einziger, Roy Friedman
2017	—	`conf`	Poster abstract: A sliding counting bloom filter. INFOCOM Workshops Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner
2017	A*	`conf`	Randomized admission policy for efficient top-k and frequency estimation. INFOCOM Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner
2017	J	`jnl`	Succinct Approximate Rank Queries. CoRR Ran Ben-Basat
2016	—	`conf`	Efficient Summing over Sliding Windows. SWAT Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner
2016	J	`jnl`	Efficient Summing over Sliding Windows. CoRR Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner
2016	A*	`conf`	Heavy hitters in streams and sliding windows. INFOCOM Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner
2016	J	`jnl`	Randomized Admission Policy for Efficient Top-k and Frequency Estimation. CoRR Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner
2016	J	`jnl`	The k-distinct language: Parameterized automata constructions. Theor. Comput. Sci. Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi
2016	—	`conf`	The ranking game. WebDB Ran Ben-Basat, Elad Kravi
2015	Misc	`conf`	The Probability Ranking Principle is Not Optimal in Adversarial Retrieval Settings. ICTIR Ran Ben-Basat, Moshe Tennenholtz, Oren Kurland
2014	J	`jnl`	Relations between automata and the simple k-path problem. CoRR Ran Ben-Basat, Ariel Gabizon
2014	B	`conf`	The k -Distinct Language: Parameterized Automata Constructions. IPEC Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi