Roy Friedman

Orcid: 0000-0001-6460-9665

Affiliations:
  • Technion - Israel Institute of Technology, Haifa, Israel


According to our database1, Roy Friedman authored at least 171 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Intriguing Properties of Modern GANs.
CoRR, 2024

On Optimizing Deterministic Concurrent Scheduling for Smart Contracts and Blockchains.
CoRR, 2024

2023
Together is Better: Heavy Hitters Quantile Estimation.
Proc. ACM Manag. Data, 2023

An Evaluation of Software Sketches.
CoRR, 2023

PKache: A Generic Framework for Data Plane Caching.
Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023

Sketching the Path to Efficiency: Lightweight Learned Cache Replacement.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

2022
Lightweight Robust Size Aware Cache Management.
ACM Trans. Storage, 2022

Box queries over multi-dimensional streams.
Inf. Syst., 2022

Multilevel Bidirectional Cache Filter.
CoRR, 2022

Limited Associativity Caching in the Data Plane.
CoRR, 2022

SQUAD: combining sketching and sampling is better than either for per-item quantile estimation.
Proceedings of the SYSTOR '22: The 15th ACM International Systems and Storage Conference, Haifa, Israel, June 13, 2022

A Fast Wait-Free Multi-Producers Single-Consumer Queue.
Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

Limited Associativity Makes Concurrent Software Caches a Breeze.
Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

2021
Access Strategies for Network Caching.
IEEE/ACM Trans. Netw., 2021

On the data persistency of replicated erasure codes in distributed storage systems.
CoRR, 2021

Posterior Sampling for Image Restoration using Explicit Patch Priors.
CoRR, 2021

Accelerating Big-Data Sorting Through Programmable Switches.
CoRR, 2021

CELL: counter estimation for per-flow traffic over sliding windows.
Proceedings of the SYSTOR '21: The 14th ACM International Systems and Storage Conference, 2021

Sliding Window CRDT Sketches.
Proceedings of the 40th International Symposium on Reliable Distributed Systems, 2021

Clustreams: Data Plane Clustering.
Proceedings of the SOSR '21: The ACM SIGCOMM Symposium on SDN Research, Virtual Event, USA, October 11, 2021

CELL: Counter Estimation for Per-flow Traffic in Streams and Sliding Windows.
Proceedings of the 29th IEEE International Conference on Network Protocols, 2021

Effective Space Saving.
Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

2020
FireLedger: A High Throughput Blockchain Consensus Protocol.
Proc. VLDB Endow., 2020

Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue.
CoRR, 2020

Brief Announcement: Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

A Generic Efficient Biased Optimizer for Consensus Protocols.
Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

It's Time to Revisit LRU vs. FIFO.
Proceedings of the 12th USENIX Workshop on Hot Topics in Storage and File Systems, 2020

2019
Randomized Admission Policy for Efficient Top-k, Frequency, and Volume Estimation.
IEEE/ACM Trans. Netw., 2019

Give me some slack: Efficient network measurements.
Theor. Comput. Sci., 2019

I Know What You Did Last Summer: Network Monitoring using Interval Queries.
Proc. ACM Meas. Anal. Comput. Syst., 2019

TOY: a Total ordering Optimistic sYstem for Permissioned Blockchains.
CoRR, 2019

Succinct Summing over Sliding Windows.
Algorithmica, 2019

Counting With Tinytable: Every Bit Counts!
IEEE Access, 2019

Nitrosketch: robust and general sketch-based monitoring in software switches.
Proceedings of the ACM Special Interest Group on Data Communication, 2019

Attack Time Localization using Interval Queries.
Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos, 2019

2018
ICE Buckets: Improved Counter Estimation for Network Measurement.
IEEE/ACM Trans. Netw., 2018

Stream Frequency Over Interval Queries.
Proc. VLDB Endow., 2018

Fast flow volume estimation.
Pervasive Mob. Comput., 2018

Heavy Hitters over Interval Queries.
CoRR, 2018

Space Efficient Elephant Flow Detection.
Proceedings of the 11th ACM International Systems and Storage Conference, 2018

Adaptive Software Cache Management.
Proceedings of the 19th International Middleware Conference, 2018

Volumetric Hierarchical Heavy Hitters.
Proceedings of the 26th IEEE International Symposium on Modeling, 2018

Frequent elements on query defined ranges.
Proceedings of the IEEE INFOCOM 2018, 2018

Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

Brief Announcement: Give Me Some Slack: Efficient Network Measurements.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
TinyLFU: A Highly Efficient Cache Admission Policy.
ACM Trans. Storage, 2017

TinySet - An Access Efficient Self Adjusting Bloom Filter Construction.
IEEE/ACM Trans. Netw., 2017

Efficient Network Measurements through Approximated Windows.
CoRR, 2017

Counting distinct elements over sliding windows.
Proceedings of the 10th ACM International Systems and Storage Conference, 2017

Constant Time Updates in Hierarchical Heavy Hitters.
Proceedings of the Conference of the ACM Special Interest Group on Data Communication, 2017

Hardening Cassandra Against Byzantine Failures.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Poster abstract: A sliding counting bloom filter.
Proceedings of the 2017 IEEE Conference on Computer Communications Workshops, 2017

Optimal elephant flow detection.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Randomized admission policy for efficient top-k and frequency estimation.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

An Architecture for SDN Based Sensor Networks.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

Probabilistic Byzantine Tolerance Scheduling in Hybrid Cloud Environments.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

TinyCache - An Effective Cache Admission Filter.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016
COARA: Code Offloading on Android with AspectJ.
CoRR, 2016

Shades: Expediting Kademlia's lookup process.
Comput. Networks, 2016

File System Usage in Android Mobile Phones.
Proceedings of the 9th ACM International on Systems and Storage Conference, 2016

Efficient Summing over Sliding Windows.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Heavy hitters in streams and sliding windows.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015
Energy-aware collaborative sensing for multiple applications in mobile cloud computing.
Sustain. Comput. Informatics Syst., 2015

A generic decentralized trust management framework.
Softw. Pract. Exp., 2015

Chameleon - a group communication framework for smartphones.
Softw. Pract. Exp., 2015

Probabilistic Byzantine Tolerance for Cloud Computing.
Proceedings of the 34th IEEE Symposium on Reliable Distributed Systems, 2015

Distilling the ingredients of P2P live streaming systems.
Proceedings of the 2015 IEEE International Conference on Peer-to-Peer Computing, 2015

Fisheye Consistency: Keeping Data in Synch in a Georeplicated World.
Proceedings of the Networked Systems - Third International Conference, 2015

A formal analysis of conservative update based approximate counting.
Proceedings of the International Conference on Computing, Networking and Communications, 2015

2014
Postman: An Elastic Highly Resilient Publish/Subscribe Framework for Self Sustained Service Independent P2P Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

TinyLFU: A Highly Efficient Cache Admission Policy.
Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

Replicated erasure codes for storage and repair-traffic efficiency.
Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing, 2014

Information Aggregation for Collaborative Sensing in Mobile Cloud Computing.
Proceedings of the 2nd IEEE International Conference on Mobile Cloud Computing, 2014

MOLStream: A Modular Rapid Development and Evaluation Framework for Live P2P Streaming.
Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014

2013
On Power and Throughput Tradeoffs of WiFi and Bluetooth in Smartphones.
IEEE Trans. Mob. Comput., 2013

A density-driven publish subscribe service for mobile ad-hoc networks.
Ad Hoc Networks, 2013

An advertising mechanism for P2P networks.
Proceedings of the 13th IEEE International Conference on Peer-to-Peer Computing, 2013

Kaleidoscope: Adding colors to Kademlia.
Proceedings of the 13th IEEE International Conference on Peer-to-Peer Computing, 2013

Hybrid Distributed Consensus.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

Cloud-based computation offloading for mobile devices: State of the art, challenges and opportunities.
Proceedings of the 2013 Future Network & Mobile Summit, Lisboa, Portugal, July 3-5, 2013, 2013

2012
Efficient and Reliable Multicast in Multi-radio Networks.
Proceedings of the IEEE 31st Symposium on Reliable Distributed Systems, 2012

2011
On Reliable Dissemination in Wireless Ad Hoc Networks.
IEEE Trans. Dependable Secur. Comput., 2011

Efficient and Reliable Dissemination in Mobile Ad Hoc Networks by Location Extrapolation.
J. Comput. Networks Commun., 2011

Deterministic Dominating Set Construction in Networks with Bounded Degree.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010
Probabilistic quorum systems in wireless Ad Hoc networks.
ACM Trans. Comput. Syst., 2010

DEEP: Density-based proactive data dissemination protocol for wireless sensor networks with uncontrolled sink mobility.
Comput. Commun., 2010

Brief announcement: deterministic dominating set construction in networks with bounded degree.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Efficient and reliable dissemination in wireless opportunistic networks by location extrapolation.
Proceedings of the Second International Workshop on Mobile Opportunistic Networking, 2010

2009
Evaluating failure detection in mobile ad-hoc networks.
Int. J. Pervasive Comput. Commun., 2009

Decoupling data dissemination from mobile sink's trajectory in wireless sensor networks.
IEEE Commun. Lett., 2009

Efficient route discovery in hybrid networks.
Ad Hoc Networks, 2009

Brief Announcement: Efficient Utilization of Multiple Interfaces in Wireless Ad Hoc Networks.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

3DLS: density-driven data location service for mobile ad-hoc networks.
Proceedings of the 10th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2009

Power Aware Management Middleware for Multiple Radio Interfaces.
Proceedings of the Middleware 2009, ACM/IFIP/USENIX, 10th International Middleware Conference, Urbana, IL, USA, November 30, 2009

Gossip-Based Dissemination.
Proceedings of the Middleware for Network Eccentric and Mobile Applications, 2009

2008
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks.
ACM Trans. Comput. Syst., 2008

Modularity: a first class concept to address distributed systems.
SIGACT News, 2008

Model-based performance evaluation of distributed checkpointing protocols.
Perform. Evaluation, 2008

On the (Un)Reliability of TCP Connections: The Return of the End-to-End Argument.
IEEE Distributed Syst. Online, 2008

2007
On the Respective Power of *P and *S to Solve One-Shot Agreement Problems.
IEEE Trans. Parallel Distributed Syst., 2007

Asynchronous Agreement and Its Relation with Error-Correcting Codes.
IEEE Trans. Computers, 2007

Gossiping on MANETs: the beauty and the beast.
ACM SIGOPS Oper. Syst. Rev., 2007

Managed Agreement: Generalizing two fundamental distributed agreement problems.
Inf. Process. Lett., 2007

RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks.
Proceedings of the 26th IEEE Symposium on Reliable Distributed Systems (SRDS 2007), 2007

2006
Distributed Wisdom: Analyzing Distributed-System Performance-Latency vs. Throughput.
IEEE Distributed Syst. Online, 2006

Adaptive Batching for Replicated Servers.
Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems (SRDS 2006), 2006

Using Selective Acknowledgements to Reduce the Memory Footprint of Replicated Services.
Proceedings of the On the Move to Meaningful Internet Systems 2006: CoopIS, 2006

Self-stabilizing Wireless Connected Overlays.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

RaWMS -: random walk based lightweight membership service for wireless ad hoc network.
Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2006

Practical Byzantine Group Communication.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

2005
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems.
IEEE Trans. Dependable Secur. Comput., 2005

$\diamondsuit {\mathcal P}_{mute}$-based Consensus for Asynchronous Byzantine Systems.
Parallel Process. Lett., 2005

Asynchronous bounded lifetime failure detectors.
Inf. Process. Lett., 2005

Intersecting Sets: a Basic Abstraction for Asynchronous Agreement Problems.
Proceedings of the 11th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2005), 2005

Brief announcement: abstractions for implementing atomic objects in dynamic systems.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Two Abstractions for Implementing Atomic Objects in Dynamic Systems.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Timed grid routing (TIGR) bites off energy.
Proceedings of the 6th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2005

A Replication- and Checkpoint-Based Approach for Anomaly-Based Intrusion Detection and Recovery.
Proceedings of the 25th International Conference on Distributed Computing Systems Workshops (ICDCS 2005 Workshops), 2005

Building and Using Quorums Despite any Number of Process of Crashes.
Proceedings of the Dependable Computing, 2005

Efficient Byzantine Broadcast in Wireless Ad-Hoc Networks.
Proceedings of the 2005 International Conference on Dependable Systems and Networks (DSN 2005), 28 June, 2005

2004
Quantifying rollback propagation in distributed checkpointing.
J. Parallel Distributed Comput., 2004

A weakest failure detector-based asynchronous consensus protocol for f<n.
Inf. Process. Lett., 2004

The Notion of Veto Number and the Respective Power of OP and OS to Solve One-Shot Agreement Problems.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Brief announcement: veto number and the respective power of eventual failure detectors.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Locating cache proxies in manets.
Proceedings of the 5th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2004

The Notion of Veto Number for Distributed Agreement Problems.
Proceedings of the Distributed Computing, 2004

An Architecture for Dynamic Scalable Self-Managed Persistent Objects.
Proceedings of the On the Move to Meaningful Internet Systems 2004: CoopIS, 2004

2003
On the composability of consistency conditions.
Inf. Process. Lett., 2003

Starfish: Fault-Tolerant Dynamic MPI Programs on Clusters of Workstations.
Clust. Comput., 2003

On the Locality of Consistency Conditions.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Transparent Fault-Tolerant Java Virtual Machine.
Proceedings of the 22nd Symposium on Reliable Distributed Systems (SRDS 2003), 2003

Fault-Tolerant Multi-Server Video-on-Demand Service.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Evaluating Distributed Checkpointing Protocol.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

Topic Introduction.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

On the Performance of a CORBA Caching Service over the Wide Internet.
Proceedings of the On The Move to Meaningful Internet Systems 2003: CoopIS, DOA, and ODBASE, 2003

Using Error-Correcting Codes to Solve Distributed Agreement Problems: A Future Direction in Distributed Computing?
Proceedings of the Future Directions in Distributed Computing, 2003

Fuzzy Group Membership.
Proceedings of the Future Directions in Distributed Computing, 2003

2002
Scalable Stability Detection Using Logical Hypercube.
IEEE Trans. Parallel Distributed Syst., 2002

Virtual-machine-based heterogeneous checkpointing.
Softw. Pract. Exp., 2002

Client-side enhancements using portable interceptors.
Comput. Syst. Sci. Eng., 2002

FTS: A High-Performance CORBA Fault-Tolerance Service.
Proceedings of the 7th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2002), 2002

Distributed Agreement and Its Relation with Error-Correcting Codes.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Caching web services in mobile ad-hoc networks: opportunities and challenges.
Proceedings of the 2002 Workshop on Principles of Mobile Computing, 2002

Soft Real-time Layered Group Communication.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

Replacement Policies for a Distributed Object Caching Service.
Proceedings of the On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002 Irvine, California, USA, October 30, 2002

2001
Symphony: An Infrastructure for Managing Virtual Servers.
Clust. Comput., 2001

A framework for caching multimedia objects in the Internet.
Proceedings of the 2001 International Workshop on Multimedia Middleware, 2001

2000
Consistency Conditions for a CORBA Caching Service.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Implementing a Caching Service for Distributed CORBA Objects.
Proceedings of the Middleware 2000, 2000

1999
Middleware support for distributed multimedia and collaborative computing.
Softw. Pract. Exp., 1999

Load-Balancing Schemes for High-Throughput Distributed Fault-Tolerant Servers.
J. Parallel Distributed Comput., 1999

The hierarchical daisy architecture for causal delivery.
Distributed Syst. Eng., 1999

Symphony: Managing Virtual Servers in the Global Village.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998
A Correctness Condition for High-Performance Multiprocessors.
SIAM J. Comput., 1998

Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies.
SIAM J. Comput., 1998

1997
MILLIPEDE: Easy Parallel Programming in Available Distributed Environments.
Softw. Pract. Exp., 1997

Fast Replicated State Machines Over Partitionable Networks.
Proceedings of the Sixteenth Symposium on Reliable Distributed Systems, 1997

Failure Detectors in Omission Failure Environments.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

The Hierarchical Daisy Architecture for Causal Delivery.
Proceedings of the 17th International Conference on Distributed Computing Systems, 1997

Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols.
Proceedings of the 6th International Symposium on High Performance Distributed Computing, 1997

1996
Limitations of Fast Consistency Conditions for Distributed Shared Memories.
Inf. Process. Lett., 1996

Strong and Weak Virtual Synchrony in Horus.
Proceedings of the 15th Symposium on Reliable Distributed Systems, 1996

Millipede: Easy Parallel Programming in Available Distributed Environments (Extended Abstract).
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
Implementing Hybrid Consistency with High-Level Synchronization Operations.
Distributed Comput., 1995

A Framework for Protocol Composition in Horus.
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

1994
Consistency conditions for distributed shared memories.
PhD thesis, 1994

Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract).
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993
Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Implementing Hybrid Consistency with High-Level Synchronization Operations (Extenced Abstract).
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992
A Correctness Condition for High-Performance Multiprocessors (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992


  Loading...