A Correctness Condition for High-Performance Multiprocessors (Extended Abstract) - Hagit Attiya; Roy Friedman 001 (STOC, 1992)

Implementing Hybrid Consistency with High-Level Synchronization Operations (Extenced Abstract). - Roy Friedman 001 (PODC, 1993)

Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies. - Hagit Attiya; Soma Chaudhuri; Roy Friedman 001; Jennifer L. Welch (SPAA, 1993)

Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract). - Hagit Attiya; Roy Friedman 001 (SPAA, 1994)

Consistency conditions for distributed shared memories. - Roy Friedman 001 (1994)

A Framework for Protocol Composition in Horus. - Robbert van Renesse; Kenneth P. Birman; Roy Friedman 001; Mark Hayden; David A. Karr (PODC, 1995)

Implementing Hybrid Consistency with High-Level Synchronization Operations. - Roy Friedman 001 (Distributed Comput., 1995)

Millipede: Easy Parallel Programming in Available Distributed Environments (Extended Abstract). - Roy Friedman 001; Maxim Goldin; Ayal Itzkovitz; Assaf Schuster (Euro-Par, Vol. I, 1996)

Strong and Weak Virtual Synchrony in Horus. - Roy Friedman 001; Robbert van Renesse (SRDS, 1996)

Limitations of Fast Consistency Conditions for Distributed Shared Memories. - Hagit Attiya; Roy Friedman 001 (Inf. Process. Lett., 1996)

Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols. - Roy Friedman 001; Robbert van Renesse (HPDC, 1997)

The Hierarchical Daisy Architecture for Causal Delivery. - Roberto Baldoni; Roy Friedman 001; Robbert van Renesse (ICDCS, 1997)

Failure Detectors in Omission Failure Environments. - Danny Dolev; Roy Friedman 001; Idit Keidar; Dahlia Malkhi (PODC, 1997)

Load Balancing Schemes for High-Throughput Distributed Fault-Tolerant Servers. - Roy Friedman 001; Daniel Mossé (SRDS, 1997)

Fast Replicated State Machines Over Partitionable Networks. - Roy Friedman 001; Alexey Vaysburd (SRDS, 1997)

MILLIPEDE: Easy Parallel Programming in Available Distributed Environments. - Roy Friedman 001; Maxim Goldin; Ayal Itzkovitz; Assaf Schuster (Softw. Pract. Exp., 1997)

Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies. - Hagit Attiya; Soma Chaudhuri; Roy Friedman 001; Jennifer L. Welch (SIAM J. Comput., 1998)

A Correctness Condition for High-Performance Multiprocessors. - Hagit Attiya; Roy Friedman 001 (SIAM J. Comput., 1998)

Symphony: Managing Virtual Servers in the Global Village. - Roy Friedman 001; Assaf Schuster; Ayal Itzkovitz; Eli Biham; Erez Hadad; Vladislav Kalinovsky; Sergey Kleyman; Roman Vitenberg (Euro-Par, 1999)

Starfish: Fault-Tolerant Dynamic MPI Programs on Clusters of Workstations. - Adnan Agbaria; Roy Friedman 001 (HPDC, 1999)

Scalable Stability Detection using Logical Hypercube. - Roy Friedman 001; Shiri Manor; Katherine Guo (SRDS, 1999)

The hierarchical daisy architecture for causal delivery. - Roberto Baldoni; Roberto Beraldi; Roy Friedman 001; Robbert van Renesse (Distributed Syst. Eng., 1999)

Middleware support for distributed multimedia and collaborative computing. - Kenneth P. Birman; Roy Friedman 001; Mark Hayden; Injong Rhee (Softw. Pract. Exp., 1999)

Implementing a Caching Service for Distributed CORBA Objects. - Gregory V. Chockler; Danny Dolev; Roy Friedman 001; Roman Vitenberg (Middleware, 2000)

Consistency Conditions for a CORBA Caching Service. - Gregory V. Chockler; Roy Friedman 001; Roman Vitenberg (DISC, 2000)

A framework for caching multimedia objects in the Internet. - Roy Friedman 001; Roman Vitenberg (M3W@MM, 2001)

Quantifying Rollback Propagation in Distributed Checkpointing. - Adnan Agbaria; Hagit Attiya; Roy Friedman 001; Roman Vitenberg (SRDS, 2001)

Client-side Enhancements using Portable Interceptors. - Roy Friedman 001; Erez Hadad (WORDS, 2001)

Symphony: An Infrastructure for Managing Virtual Servers. - Roy Friedman 001; Eli Biham; Ayal Itzkovitz; Assaf Schuster (Clust. Comput., 2001)

Replacement Policies for a Distributed Object Caching Service. - Hilla Atzmon; Roy Friedman 001; Roman Vitenberg (OTM, 2002)

Virtual Machine Based Heterogeneous Checkpointing. - Adnan Agbaria; Roy Friedman 001 (IPDPS, 2002)

Caching web services in mobile ad-hoc networks: opportunities and challenges. - Roy Friedman 001 (POMC, 2002)

Distributed Agreement and Its Relation with Error-Correcting Codes. - Roy Friedman 001; Achour Mostéfaoui; Sergio Rajsbaum; Michel Raynal (DISC, 2002)

FTS: A High-Performance CORBA Fault-Tolerance Service. - Roy Friedman 001; Erez Hadad (WORDS, 2002)

Fuzzy Group Membership. - Roy Friedman 001 (Future Directions in Distributed Computing, 2003)

Using Error-Correcting Codes to Solve Distributed Agreement Problems: A Future Direction in Distributed Computing? - Roy Friedman 001; Achour Mostéfaoui; Sergio Rajsbaum; Michel Raynal (Future Directions in Distributed Computing, 2003)

On the Performance of a CORBA Caching Service over the Wide Internet. - Roy Friedman 001; Roman Vitenberg (OTM, 2003)

Evaluating Distributed Checkpointing Protocol. - Adnan Agbaria; Ari Freund 001; Roy Friedman 001 (ICDCS, 2003)

Fault-Tolerant Multi-Server Video-on-Demand Service. - Roy Friedman 001; Lior Baram; Shiri Abarbanel (IPDPS, 2003)

Transparent Fault-Tolerant Java Virtual Machine. - Roy Friedman 001; Alon Kama (SRDS, 2003)

On the Locality of Consistency Conditions. - Roman Vitenberg; Roy Friedman 001 (DISC, 2003)

On the composability of consistency conditions. - Roy Friedman 001; Roman Vitenberg; Gregory V. Chockler (Inf. Process. Lett., 2003)

An Architecture for Dynamic Scalable Self-Managed Persistent Objects. - Emmanuelle Anceaume; Roy Friedman 001; Maria Gradinariu; Matthieu Roy (CoopIS/DOA/ODBASE (2), 2004)

The Notion of Veto Number for Distributed Agreement Problems. - Roy Friedman 001; Achour Mostéfaoui; Michel Raynal (IWDC, 2004)

Locating cache proxies in manets. - Roy Friedman 001; Maria Gradinariu; Gwendal Simon (MobiHoc, 2004)

Brief announcement: veto number and the respective power of eventual failure detectors. - Roy Friedman 001; Achour Mostéfaoui; Michel Raynal (PODC, 2004)

Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems. - Roy Friedman 001; Achour Mostéfaoui; Michel Raynal (SRDS, 2004)

The Notion of Veto Number and the Respective Power of OP and OS to Solve One-Shot Agreement Problems. - Roy Friedman 001; Achour Mostéfaoui; Michel Raynal (DISC, 2004)

A weakest failure detector-based asynchronous consensus protocol for f<n. - Roy Friedman 001; Achour Mostéfaoui; Michel Raynal (Inf. Process. Lett., 2004)

Efficient Byzantine Broadcast in Wireless Ad-Hoc Networks. - Vadim Drabkin; Roy Friedman 001; Marc Segal (DSN, 2005)

Building and Using Quorums Despite any Number of Process of Crashes. - Roy Friedman 001; Achour Mostéfaoui; Michel Raynal (EDCC, 2005)

A Replication- and Checkpoint-Based Approach for Anomaly-Based Intrusion Detection and Recovery. - Adnan Agbaria; Roy Friedman 001 (ICDCS Workshops, 2005)

Timed grid routing (TIGR) bites off energy. - Roy Friedman 001; Guy Korland (MobiHoc, 2005)

Two Abstractions for Implementing Atomic Objects in Dynamic Systems. - Roy Friedman 001; Michel Raynal; Corentin Travers (OPODIS, 2005)

Brief announcement: abstractions for implementing atomic objects in dynamic systems. - Roy Friedman 001; Michel Raynal; Corentin Travers (PODC, 2005)

Intersecting Sets: a Basic Abstraction for Asynchronous Agreement Problems. - Roy Friedman 001; Achour Mostéfaoui; Michel Raynal (PRDC, 2005)

Asynchronous bounded lifetime failure detectors. - Roy Friedman 001; Achour Mostéfaoui; Michel Raynal (Inf. Process. Lett., 2005)

$ diamondsuit { mathcal P}_{mute}$-based Consensus for Asynchronous Byzantine Systems. - Roy Friedman 001; Achour Mostéfaoui; Michel Raynal (Parallel Process. Lett., 2005)

Practical Byzantine Group Communication. - Vadim Drabkin; Roy Friedman 001; Alon Kama (ICDCS, 2006)

RaWMS -: random walk based lightweight membership service for wireless ad hoc network. - Ziv Bar-Yossef; Roy Friedman 001; Gabriel Kliot (MobiHoc, 2006)

Self-stabilizing Wireless Connected Overlays. - Vadim Drabkin; Roy Friedman 001; Maria Gradinariu (OPODIS, 2006)

Using Selective Acknowledgements to Reduce the Memory Footprint of Replicated Services. - Roy Friedman 001; Erez Hadad (OTM Conferences (2), 2006)

Adaptive Batching for Replicated Servers. - Roy Friedman 001; Erez Hadad (SRDS, 2006)

Distributed Wisdom: Analyzing Distributed-System Performance-Latency vs. Throughput. - Roy Friedman 001; Erez Hadad (IEEE Distributed Syst. Online, 2006)

RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks. - Vadim Drabkin; Roy Friedman 001; Gabriel Kliot; Marc Segal (SRDS, 2007)

Managed Agreement: Generalizing two fundamental distributed agreement problems. - Emmanuelle Anceaume; Roy Friedman 001; Maria Gradinariu (Inf. Process. Lett., 2007)

Gossiping on MANETs: the beauty and the beast. - Roy Friedman 001; Daniela Gavidia; Luís E. T. Rodrigues; Aline Carneiro Viana; Spyros Voulgaris (ACM SIGOPS Oper. Syst. Rev., 2007)

Asynchronous Agreement and Its Relation with Error-Correcting Codes. - Roy Friedman 001; Achour Mostéfaoui; Sergio Rajsbaum; Michel Raynal (IEEE Trans. Computers, 2007)

On the Respective Power of *P and *S to Solve One-Shot Agreement Problems. - Roy Friedman 001; Achour Mostéfaoui; Michel Raynal (IEEE Trans. Parallel Distributed Syst., 2007)

Probabilistic quorum systems in wireless ad hoc networks. - Roy Friedman 001; Gabriel Kliot; Chen Avin (DSN, 2008)

On the (Un)Reliability of TCP Connections: The Return of the End-to-End Argument. - Vadim Drabkin; Roy Friedman 001; Gabriel Kliot (IEEE Distributed Syst. Online, 2008)

Model-based performance evaluation of distributed checkpointing protocols. - Adnan Agbaria; Roy Friedman 001 (Perform. Evaluation, 2008)

Modularity: a first class concept to address distributed systems. - Roy Friedman 001; Anne-Marie Kermarrec; Michel Raynal (SIGACT News, 2008)

RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks. - Ziv Bar-Yossef; Roy Friedman 001; Gabriel Kliot (ACM Trans. Comput. Syst., 2008)

Gossip-Based Dissemination. - Roy Friedman 001; Anne-Marie Kermarrec; Hugo Miranda; Luís E. T. Rodrigues (Middleware for Network Eccentric and Mobile Applications, 2009)

Power Aware Management Middleware for Multiple Radio Interfaces. - Roy Friedman 001; Alex Kogan (Middleware, 2009)

3DLS: density-driven data location service for mobile ad-hoc networks. - Roy Friedman 001; Noam Mori (MobiHoc, 2009)

Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks. - Roy Friedman 001; Alex Kogan (OPODIS, 2009)

Brief Announcement: Efficient Utilization of Multiple Interfaces in Wireless Ad Hoc Networks. - Roy Friedman 001; Alex Kogan (DISC, 2009)

Efficient route discovery in hybrid networks. - Roy Friedman 001; Ari Shotland; Gwendal Simon (Ad Hoc Networks, 2009)

Decoupling data dissemination from mobile sink's trajectory in wireless sensor networks. - Aline Carneiro Viana; Artur Ziviani; Roy Friedman 001 (IEEE Commun. Lett., 2009)

Evaluating failure detection in mobile ad-hoc networks. - Roy Friedman 001; Galya Tcharny (Int. J. Pervasive Comput. Commun., 2009)

Efficient and reliable dissemination in wireless opportunistic networks by location extrapolation. - Adnan Agbaria; Roy Friedman 001 (MobiOpp, 2010)

Brief announcement: deterministic dominating set construction in networks with bounded degree. - Roy Friedman 001; Alex Kogan (PODC, 2010)

DEEP: Density-based proactive data dissemination protocol for wireless sensor networks with uncontrolled sink mobility. - Massimo Vecchio; Aline Carneiro Viana; Artur Ziviani; Roy Friedman 001 (Comput. Commun., 2010)

Deterministic Dominating Set Construction in Networks with Bounded Degree. - Roy Friedman 001; Alex Kogan (ICDCN, 2011)

On power and throughput tradeoffs of WiFi and Bluetooth in smartphones. - Roy Friedman 001; Alex Kogan; Yevgeny Krivolapov (INFOCOM, 2011)

Efficient and Reliable Dissemination in Mobile Ad Hoc Networks by Location Extrapolation. - Adnan Agbaria; Muhamad Hugerat; Roy Friedman 001 (J. Comput. Networks Commun., 2011)

On Reliable Dissemination in Wireless Ad Hoc Networks. - Vadim Drabkin; Roy Friedman 001; Gabriel Kliot; Marc Segal (IEEE Trans. Dependable Secur. Comput., 2011)

Efficient and Reliable Multicast in Multi-radio Networks. - Roy Friedman 001; Alex Kogan (SRDS, 2012)

Cloud-based computation offloading for mobile devices: State of the art, challenges and opportunities. - Lei Jiao 002; Roy Friedman 001; Xiaoming Fu 001; Stefano Secci; Zbigniew Smoreda; Hannes Tschofenig (Future Network & Mobile Summit, 2013)

Hybrid Distributed Consensus. - Roy Friedman 001; Gabriel Kliot; Alex Kogan (OPODIS, 2013)

Kaleidoscope: Adding colors to Kademlia. - Gil Einziger; Roy Friedman 001; Eyal Kibbar (P2P, 2013)

An advertising mechanism for P2P networks. - Roy Friedman 001; Alexander Libov (P2P, 2013)

A density-driven publish subscribe service for mobile ad-hoc networks. - Roy Friedman 001; Anna Kaplun Shulman (Ad Hoc Networks, 2013)

Shades: Expediting Kademlia's Lookup Process. - Gil Einziger; Roy Friedman 001; Yoav Kantor (Euro-Par, 2014)

MOLStream: A Modular Rapid Development and Evaluation Framework for Live P2P Streaming. - Roy Friedman 001; Alexander Libov; Ymir Vigfusson (ICDCS, 2014)

Information Aggregation for Collaborative Sensing in Mobile Cloud Computing. - Radhika Loomba; Lei Shi 008; Brendan Jennings; Roy Friedman 001; John Kennedy; Joe Butler (MobileCloud, 2014)

Replicated erasure codes for storage and repair-traffic efficiency. - Roy Friedman 001; Yoav Kantor; Amir Kantor (P2P, 2014)

TinyLFU: A Highly Efficient Cache Admission Policy. - Gil Einziger; Roy Friedman 001 (PDP, 2014)

Postman: An Elastic Highly Resilient Publish/Subscribe Framework for Self Sustained Service Independent P2P Networks. - Gil Einziger; Roy Friedman 001 (SSS, 2014)

TinySet - An Access Efficient Self Adjusting Bloom Filter Construction. - Gil Einziger; Roy Friedman 001 (ICCCN, 2015)

A formal analysis of conservative update based approximate counting. - Gil Einziger; Roy Friedman 001 (ICNC, 2015)

Counting with TinyTable: Every bit counts! - Gil Einziger; Roy Friedman 001 (INFOCOM Workshops, 2015)

Fisheye Consistency: Keeping Data in Synch in a Georeplicated World. - Roy Friedman 001; Michel Raynal; François Taïani (NETYS, 2015)

Distilling the ingredients of P2P live streaming systems. - Roy Friedman 001; Alexander Libov; Ymir Vigfusson (P2P, 2015)

Probabilistic Byzantine Tolerance for Cloud Computing. - Luciana Arantes; Roy Friedman 001; Olivier Marin; Pierre Sens 001 (SRDS, 2015)

Chameleon - a group communication framework for smartphones. - Alex Dvinsky; Roy Friedman 001 (Softw. Pract. Exp., 2015)

A generic decentralized trust management framework. - Roy Friedman 001; Amit Portnoy (Softw. Pract. Exp., 2015)

Energy-aware collaborative sensing for multiple applications in mobile cloud computing. - Radhika Loomba; Lei Shi 008; Brendan Jennings; Roy Friedman 001; John Kennedy; Joe Butler (Sustain. Comput. Informatics Syst., 2015)

Heavy hitters in streams and sliding windows. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001; Yaron Kassner (INFOCOM, 2016)

Efficient Summing over Sliding Windows. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001; Yaron Kassner (SWAT, 2016)

File System Usage in Android Mobile Phones. - Roy Friedman 001; David Sainz (SYSTOR, 2016)

COARA: Code Offloading on Android with AspectJ. - Roy Friedman 001; Nir Hauser (CoRR, 2016)

TinyCache - An Effective Cache Admission Filter. - Dolev Adas; Gil Einziger; Roy Friedman 001 (GLOBECOM, 2017)

Probabilistic Byzantine Tolerance Scheduling in Hybrid Cloud Environments. - Luciana Arantes; Roy Friedman 001; Olivier Marin; Pierre Sens 001 (ICDCN, 2017)

An Architecture for SDN Based Sensor Networks. - Roy Friedman 001; David Sainz (ICDCN, 2017)

Randomized admission policy for efficient top-k and frequency estimation. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001; Yaron Kassner (INFOCOM, 2017)

Optimal elephant flow detection. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001; Yaron Kassner (INFOCOM, 2017)

Poster abstract: A sliding counting bloom filter. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001; Yaron Kassner (INFOCOM Workshops, 2017)

Hardening Cassandra Against Byzantine Failures. - Roy Friedman 001; Roni Licher (OPODIS, 2017)

Constant Time Updates in Hierarchical Heavy Hitters. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001; Marcelo Caggiani Luizelli; Erez Waisbard (SIGCOMM, 2017)

Counting distinct elements over sliding windows. - Eran Assaf; Ran Ben-Basat; Gil Einziger; Roy Friedman 001; Yaron Kassner (SYSTOR, 2017)

Efficient Network Measurements through Approximated Windows. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001 (CoRR, 2017)

TinyLFU: A Highly Efficient Cache Admission Policy. - Gil Einziger; Roy Friedman 001; Ben Manes (ACM Trans. Storage, 2017)

Brief Announcement: Give Me Some Slack: Efficient Network Measurements. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001 (ICALP, 2018)

Fast Flow Volume Estimation. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001 (ICDCN, 2018)

Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free. - Eran Assaf; Ran Ben-Basat; Gil Einziger; Roy Friedman 001 (INFOCOM, 2018)

Frequent elements on query defined ranges. - Ran Ben-Basat; Rana Shahout; Roy Friedman 001 (INFOCOM Workshops, 2018)

Volumetric Hierarchical Heavy Hitters. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001; Marcelo Caggiani Luizelli; Erez Waisbard (MASCOTS, 2018)

Give Me Some Slack: Efficient Network Measurements. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001 (MFCS, 2018)

Adaptive Software Cache Management. - Gil Einziger; Ohad Eytan; Roy Friedman 001; Ben Manes (Middleware, 2018)

Space Efficient Elephant Flow Detection. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001 (SYSTOR, 2018)

Heavy Hitters over Interval Queries. - Ran Ben-Basat; Roy Friedman 001; Rana Shahout (CoRR, 2018)

Stream Frequency Over Interval Queries. - Ran Ben-Basat; Roy Friedman 001; Rana Shahout (Proc. VLDB Endow., 2018)

ICE Buckets: Improved Counter Estimation for Network Measurement. - Gil Einziger; Benny Fellman; Roy Friedman 001; Yaron Kassner (IEEE/ACM Trans. Netw., 2018)

Access Strategies for Network Caching. - Itamar Cohen; Gil Einziger; Roy Friedman 001; Gabriel Scalosub (INFOCOM, 2019)

Attack Time Localization using Interval Queries. - Nikita Ivkin; Ran Ben Basat; Zaoxing Liu; Gil Einziger; Roy Friedman 001; Vladimir Braverman (SIGCOMM Posters and Demos, 2019)

Nitrosketch: robust and general sketch-based monitoring in software switches. - Zaoxing Liu; Ran Ben-Basat; Gil Einziger; Yaron Kassner; Vladimir Braverman; Roy Friedman 001; Vyas Sekar (SIGCOMM, 2019)

Succinct Summing over Sliding Windows. - Ran Ben-Basat; Gil Einziger; Roy Friedman 001; Yaron Kassner (Algorithmica, 2019)

TOY: a Total ordering Optimistic sYstem for Permissioned Blockchains. - Yehonatan Buchnik; Roy Friedman 001 (CoRR, 2019)

Randomized Admission Policy for Efficient Top-k, Frequency, and Volume Estimation. - Ran Ben Basat; Xiaoqi Chen; Gil Einziger; Roy Friedman 001; Yaron Kassner (IEEE/ACM Trans. Netw., 2019)

It's Time to Revisit LRU vs. FIFO. - Ohad Eytan; Danny Harnik; Effi Ofer; Roy Friedman 001; Ronen I. Kat (HotStorage, 2020)

A Generic Efficient Biased Optimizer for Consensus Protocols. - Yehonatan Buchnik; Roy Friedman 001 (ICDCN, 2020)

I Know What You Did Last Summer: Network Monitoring using Interval Queries. - Nikita Ivkin; Ran Ben Basat; Zaoxing Liu; Gil Einziger; Roy Friedman 001; Vladimir Braverman (SIGMETRICS (Abstracts), 2020)

Brief Announcement: Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue. - Dolev Adas; Roy Friedman 001 (DISC, 2020)

Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue. - Dolev Adas; Roy Friedman 001 (CoRR, 2020)

FireLedger: A High Throughput Blockchain Consensus Protocol. - Yehonatan Buchnik; Roy Friedman 001 (Proc. VLDB Endow., 2020)

Box queries over multi-dimensional streams. - Roy Friedman 001; Rana Shahout (DEBS, 2021)

Effective Space Saving. - Roy Friedman 001; Or Goaz; Ori Rottenstreich (ICDCN, 2021)

CELL: Counter Estimation for Per-flow Traffic in Streams and Sliding Windows. - Rana Shahout; Roy Friedman 001; Dolev Adas (ICNP, 2021)

Clustreams: Data Plane Clustering. - Roy Friedman 001; Or Goaz; Ori Rottenstreich (SOSR, 2021)

Sliding Window CRDT Sketches. - Dolev Adas; Roy Friedman 001 (SRDS, 2021)

CELL: counter estimation for per-flow traffic over sliding windows. - Rana Shahout; Dolev Adas; Roy Friedman 001 (SYSTOR, 2021)

Accelerating Big-Data Sorting Through Programmable Switches. - Yamit Barshatz-Schneor; Roy Friedman 001 (CoRR, 2021)

Limited Associativity Makes Concurrent Software Caches a Breeze. - Dolev Adas; Gil Einziger; Roy Friedman 001 (ICDCN, 2022)

A Fast Wait-Free Multi-Producers Single-Consumer Queue. - Dolev Adas; Roy Friedman 001 (ICDCN, 2022)

SQUAD: combining sketching and sampling is better than either for per-item quantile estimation. - Rana Shahout; Roy Friedman 001; Ran Ben Basat (SYSTOR, 2022)

Limited Associativity Caching in the Data Plane. - Roy Friedman 001; Or Goaz; Dor Hovav (CoRR, 2022)

Multilevel Bidirectional Cache Filter. - Ohad Eytan; Roy Friedman 001 (CoRR, 2022)

Lightweight Robust Size Aware Cache Management. - Gil Einziger; Ohad Eytan; Roy Friedman 001; Benjamin Manes (ACM Trans. Storage, 2022)

Sketching the Path to Efficiency: Lightweight Learned Cache Replacement. - Rana Shahout; Roy Friedman 001 (OPODIS, 2023)

PKache: A Generic Framework for Data Plane Caching. - Roy Friedman 001; Or Goaz; Dor Hovav (SAC, 2023)

An Evaluation of Software Sketches. - Roy Friedman 001 (CoRR, 2023)

Together is Better: Heavy Hitters Quantile Estimation. - Rana Shahout; Roy Friedman 001; Ran Ben Basat (Proc. ACM Manag. Data, 2023)

An Evaluation of Software Frequency Sketches. - Roy Friedman 001 (DEBS, 2024)

TrafficGrinder: A 0-RTT-Aware QUIC Load Balancer. - Robert J. Shahla; Reuven Cohen; Roy Friedman 001 (ICNP, 2024)

Practical Heavy-Hitter Detection Algorithms for Programmable Switches. - Rani Abboud; Roy Friedman 001 (IFIP Networking, 2024)

Distributed Recoverable Sketches. - Diana Cohen; Roy Friedman 001; Rana Shahout (OPODIS, 2024)

Batch-Schedule-Execute: On Optimizing Concurrent Deterministic Scheduling for Blockchains. - Yaron Hay; Roy Friedman 001 (SRDS, 2024)

On Optimizing Deterministic Concurrent Scheduling for Smart Contracts and Blockchains. - Yaron Hay; Roy Friedman 001 (CoRR, 2024)

Mean Tail: Top-K and Frequency Estimation with Fewer Counters and More Keys. - Dvir Biton; Roy Friedman 001 (AINA (2), 2025)

Geometric Sketch: The Inflatable-Shrinkable Sketch. - Dvir Biton; Roy Friedman 001; Rana Shahout (AINA (2), 2025)

Ethereum Conflicts Graphed. - Dvir Biton; Roy Friedman 001; Yaron Hay (ICBC, 2025)

On Quorum Sizes in DAG-Based BFT Protocols. - Razya Ladelsky; Roy Friedman 001 (ICBC, 2025)

An Analysis of Sui's Transactions and Conflicts. - Dvir Biton; Roy Friedman 001 (PRDC, 2025)

Efficient Scheduling of Smart Contract Transactions via Conflict Graph Coloring. - Ankit Ravish; Yaron Hay; Manaswini Piduguralla; Rishabh Jain; Roy Friedman 001; Sathya Peri (PRDC, 2025)

On the data persistency of replicated erasure codes in distributed storage systems. - Roy Friedman 001; Rafal Kapelko; Karol Marchwicki (Inf. Comput., 2025)

A New Probabilistic Mobile Byzantine Failure Model for Self-Protecting Systems. - Silvia Bonomi; Giovanni Farina; Roy Friedman 001; Eviatar B. Procaccia; Sébastien Tixeuil (CoRR, 2025)

Distributed Recoverable Sketches (Extended Version). - Diana Cohen; Roy Friedman 001; Rana Shahout (CoRR, 2025)

From Exact Hits to Close Enough: Semantic Caching for LLM Embeddings. - Dvir Biton; Roy Friedman 001 (CoRR, 2026)