Packet Duplication and Elimination in Distributed Networks. - Ariel Orda; Raphael Rom (ICDCS, 1986)

Shortest-path algorithms for time-dependent networks. - Ariel Orda; Raphael Rom (INFOCOM, 1988)

Routing with packet duplication and elimination in computer networks. - Ariel Orda; Raphael Rom (IEEE Trans. Commun., 1988)

Multihoming in Computer Networks: A Topology-Design Approach. - Ariel Orda; Raphael Rom (Comput. Networks ISDN Syst., 1989)

Shortest-Path and Minimum-Delay Algorithms in Networks with Time-Dependent Edge-Length - Ariel Orda; Raphael Rom (J. ACM, 1990)

Minimum weight paths in time-dependent networks. - Ariel Orda; Raphael Rom (Networks, 1991)

Location of central nodes in time varying computer networks. - Ariel Orda; Raphael Rom (Oper. Res. Lett., 1991)

Optimal Routing with Packet Fragmentation in Computer Networks. - Ariel Orda; Raphael Rom (INFOCOM, 1993)

Competitive Routing in Multi-User Communication Networks. - Ariel Orda; Raphael Rom; Nahum Shimkin (INFOCOM, 1993)

Minimum delay routing in stochastic networks. - Ariel Orda; Raphael Rom; Moshe Sidi (IEEE/ACM Trans. Netw., 1993)

Competitive routing in multiuser communication networks. - Ariel Orda; Raphael Rom; Nahum Shimkin (IEEE/ACM Trans. Netw., 1993)

A Structural Linearization Principle for Processes. - Robert P. Kurshan; Michael Merritt; Ariel Orda; Sonia R. Sachs (Formal Methods Syst. Des., 1994)

The Designer's Perspective to Noncooperative Networks. - Yannis A. Korilis; Aurel A. Lazar; Ariel Orda (INFOCOM, 1995)

Virtual Path Bandwidth Allocation in Multi-User Networks. - Aurel A. Lazar; Ariel Orda; Dimitrios E. Pendarakis (INFOCOM, 1995)

Architecting Noncooperative Networks. - Yannis A. Korilis; Aurel A. Lazar; Ariel Orda (IEEE J. Sel. Areas Commun., 1995)

On continuous network flows. - Ariel Orda; Raphael Rom (Oper. Res. Lett., 1995)

The Role of the Manager in a Noncooperative Network. - Yannis A. Korilis; Aurel A. Lazar; Ariel Orda (INFOCOM, 1996)

An Adaptive Virtual Path Allocation Policy for Broadband Networks. - Ariel Orda; Giovanni Pacifici; Dimitrios E. Pendarakis (INFOCOM, 1996)

Distributed Shortest-Path Protocols for Time-Dependent Networks. - Ariel Orda; Raphael Rom (Distributed Comput., 1996)

Tight Bounds for Dynamic Storage Allocation. - Michael Luby; Joseph Naor; Ariel Orda (SIAM J. Discret. Math., 1996)

QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms. - Roch Guérin; Ariel Orda (INFOCOM, 1997)

Incentive Pricing in Multi-Class Communication Networks. - Ariel Orda; Nahum Shimkin (INFOCOM, 1997)

Formal Verification of a Distributed Computer System. - Michael Merritt; Ariel Orda; Sonia R. Sachs (Formal Methods Syst. Des., 1997)

Efficient Test & Set Constructions for Faulty Shared Memory. - Ariel Orda; Michael Merritt (Inf. Process. Lett., 1997)

Optimal packet fragmentation and routing in computer networks. - Ariel Orda; Raphael Rom (Networks, 1997)

Capacity allocation under noncooperative routing. - Yannis A. Korilis; Aurel A. Lazar; Ariel Orda (IEEE Trans. Autom. Control., 1997)

Achieving network optima using Stackelberg routing strategies. - Yannis A. Korilis; Aurel A. Lazar; Ariel Orda (IEEE/ACM Trans. Netw., 1997)

Virtual path bandwidth allocation in multiuser networks. - Aurel A. Lazar; Ariel Orda; Dimitrios E. Pendarakis (IEEE/ACM Trans. Netw., 1997)

Scheduled Hot-Potato Routing. - Joseph Naor; Ariel Orda; Raphael Rom (J. Graph Algorithms Appl., 1998)

QoS routing in networks with uncertain parameters. - Dean H. Lorenz; Ariel Orda (IEEE/ACM Trans. Netw., 1998)

Best-Effort Resource Sharing by Users with QoS Requirements. - Israel Ben-Shahar; Ariel Orda; Nahum Shimkin (INFOCOM, 1999)

Incentive Compatible Pricing Strategies for QoS Routing. - Yannis A. Korilis; Ariel Orda (INFOCOM, 1999)

Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees. - Dean H. Lorenz; Ariel Orda (INFOCOM, 1999)

Modelling Asynchrony with a Synchronous Model. - Robert P. Kurshan; Michael Merritt; Ariel Orda; Sonia R. Sachs (Formal Methods Syst. Des., 1999)

Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis. - George Apostolopoulos; Roch Guérin; Sanjay Kamat; Ariel Orda; Satish K. Tripathi (IEEE Netw., 1999)

QoS routing in networks with inaccurate information: theory and algorithms. - Roch Guérin; Ariel Orda (IEEE/ACM Trans. Netw., 1999)

The designer's perspective to atomic noncooperative networks. - Lavy Libman; Ariel Orda (IEEE/ACM Trans. Netw., 1999)

Routing with end-to-end QoS guarantees in broadband networks. - Ariel Orda (IEEE/ACM Trans. Netw., 1999)

QoS Routing Mechanisms and OSPF Extensions. - George Apostolopoulos; Sanjay Kamat; Doug Williams; Roch Guérin; Ariel Orda; Tony Przygienda (RFC, 1999)

Networks with Advance Reservations: The Routing Perspective. - Roch Guérin; Ariel Orda (INFOCOM, 2000)

QoS Routing: The Precomputation Perspective. - Ariel Orda; Alexander Sprintson (INFOCOM, 2000)

Dynamic storage allocation with known durations. - Joseph Naor; Ariel Orda; Yael Petruschka (Discret. Appl. Math., 2000)

A market-based architecture for management of geographically dispersed, replicated Web servers. - Mehmet Karaul; Yannis A. Korilis; Ariel Orda (Decis. Support Syst., 2000)

Bandwidth allocation for guaranteed versus best effort service categories. - Eitan Altman; Ariel Orda; Nahum Shimkin (Queueing Syst. Theory Appl., 2000)

Dynamic service sharing with heterogeneous preferences. - Israel Ben-Shahar; Ariel Orda; Nahum Shimkin (Queueing Syst. Theory Appl., 2000)

Incentive pricing in multiclass systems. - Ariel Orda; Nahum Shimkin (Telecommun. Syst., 2000)

Atomic Resource Sharing in Noncooperative Networks. - Lavy Libman; Ariel Orda (Telecommun. Syst., 2001)

Routing and Admission Control in Networks with Advance Reservations. - Liane Lewin-Eytan; Joseph Naor; Ariel Orda (APPROX, 2002)

Computing shortest paths for any number of hops. - Roch Guérin; Ariel Orda (IEEE/ACM Trans. Netw., 2002)

Optimal retrial and timeout strategies for accessing network resources. - Lavy Libman; Ariel Orda (IEEE/ACM Trans. Netw., 2002)

Optimal partition of QoS requirements on unicast paths and multicst trees. - Dean H. Lorenz; Ariel Orda (IEEE/ACM Trans. Netw., 2002)

Optimal Partition of QoS Requirements for Many-to-Many Connections. - Dean H. Lorenz; Ariel Orda; Danny Raz (INFOCOM, 2003)

Precomputation schemes for QoS routing. - Ariel Orda; Alexander Sprintson (IEEE/ACM Trans. Netw., 2003)

Optimal FEC strategies in connections with large delay-bandwidth products. - Lavy Libman; Ariel Orda (ICC, 2004)

Path Protection and Blocking Probability Minimization in Optical Networks. - David Lee; Lavy Libman; Ariel Orda (INFOCOM, 2004)

Efficient Algorithms for Computing Disjoint QoS Paths. - Ariel Orda; Alexander Sprintson (INFOCOM, 2004)

QoS Provision and Routing with Stochastic Guarantees. - Erez Biton; Ariel Orda (QSHINE, 2004)

Admission Control in Networks with Advance Reservations. - Liane Lewin-Eytan; Joseph Naor; Ariel Orda (Algorithmica, 2004)

Optimal sliding-window strategies in networks with long round-trip delays. - Lavy Libman; Ariel Orda (Comput. Networks, 2004)

Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas. - Ariel Orda; Ben-Ami Yassour (MobiHoc, 2005)

QoS Routing: Challenges and Solution Approaches. - Ariel Orda (QSHINE, 2005)

Algorithms for computing QoS paths with restoration. - Yigal Bejerano; Yuri Breitbart; Ariel Orda; Rajeev Rastogi; Alexander Sprintson (IEEE/ACM Trans. Netw., 2005)

A scalable approach to the partition of QoS requirements in unicast and multicast. - Ariel Orda; Alexander Sprintson (IEEE/ACM Trans. Netw., 2005)

The Prediction Approach in QoS Routing. - Eva Marín-Tordera; Xavier Masip-Bruin; Sergio Sánchez-López; Jordi Domingo-Pascual; Ariel Orda (ICC, 2006)

A Comparison of Exact and epsilon-Approximation Algorithms for Constrained Routing. - Fernando A. Kuipers; Ariel Orda; Danny Raz; Piet Van Mieghem (Networking, 2006)

On the challenges of establishing disjoint QoS IP/MPLS paths across multiple domains. - Marcelo Yannuzzi; Xavier Masip-Bruin; Sergio Sánchez-López; Jordi Domingo-Pascual; Ariel Orda; Alex Sprintson (IEEE Commun. Mag., 2006)

Efficient QoS partition and routing of unicast and multicast. - Dean H. Lorenz; Ariel Orda; Danny Raz; Yuval Shavitt (IEEE/ACM Trans. Netw., 2006)

Optimal packet-level fec strategies in connections with large delay-bandwidth products. - Lavy Libman; Ariel Orda (IEEE Trans. Wirel. Commun., 2006)

Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks. - Alexander Sprintson; Marcelo Yannuzzi; Ariel Orda; Xavier Masip-Bruin (INFOCOM, 2007)

Maximum-lifetime routing: system optimization & game-theoretic perspectives. - Liane Lewin-Eytan; Joseph Naor; Ariel Orda (MobiHoc, 2007)

Bottleneck Routing Games in Communication Networks. - Ron Banner; Ariel Orda (IEEE J. Sel. Areas Commun., 2007)

Non-Cooperative Multicast and Facility Location Games. - Chandra Chekuri; Julia Chuzhoy; Liane Lewin-Eytan; Joseph Naor; Ariel Orda (IEEE J. Sel. Areas Commun., 2007)

Multipath routing algorithms for congestion minimization. - Ron Banner; Ariel Orda (IEEE/ACM Trans. Netw., 2007)

The power of tuning: a novel approach for the efficient design of survivable networks. - Ron Banner; Ariel Orda (IEEE/ACM Trans. Netw., 2007)

Quasi-opportunistic Supercomputing in Grid Environments. - Valentin Kravtsov; David Carmeli; Werner Dubitzky; Ariel Orda; Assaf Schuster; Mark Silberstein; Benny Yoshpa (ICA3PP, 2008)

Multi-Objective Topology Control in Wireless Networks. - Ron Banner; Ariel Orda (INFOCOM, 2008)

Maximum Coverage at Minimum Cost for Multi-Domain IP/MPLS Networks. - Marcelo Yannuzzi; Xavier Masip-Bruin; René Serral-Gracià; Eva Marín-Tordera; Alexander Sprintson; Ariel Orda (INFOCOM, 2008)

Toward a new route control model for multidomain optical networks. - Marcelo Yannuzzi; Xavier Masip-Bruin; Guillem Fabrego; Sergio Sánchez-López; Alex Sprintson; Ariel Orda (IEEE Commun. Mag., 2008)

Topology Design and Control: A Game-Theoretic Perspective. - Amir Nahir; Ariel Orda; Ari Freund 001 (INFOCOM, 2009)

Protecting Against Network Infections: A Game Theoretic Perspective. - Jasmina Omic; Ariel Orda; Piet Van Mieghem (INFOCOM, 2009)

On-line survivable routing in WDM networks. - Anteneh Beshir; Fernando A. Kuipers; Piet Van Mieghem; Ariel Orda (ITC, 2009)

EquiCast: Scalable multicast with selfish users. - Idit Keidar; Roie Melamed; Ariel Orda (Comput. Networks, 2009)

Impairment-aware path selection and regenerator placement in translucent optical networks. - Fernando A. Kuipers; Anteneh Beshir; Ariel Orda; Piet Van Mieghem (ICNP, 2010)

Designing Low-Capacity Backup Networks for Fast Restoration. - Ron Banner; Ariel Orda (INFOCOM, 2010)

Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. - Niv Buchbinder; Liane Lewin-Eytan; Ishai Menache; Joseph Naor; Ariel Orda (INFOCOM, 2010)

Non-Cooperative Cost Sharing Games via Subsidies. - Niv Buchbinder; Liane Lewin-Eytan; Joseph Naor; Ariel Orda (Theory Comput. Syst., 2010)

Inter-carrier interconnection services: QoS, economics and business issues. - Costas Courcoubetis; Manos Dramitinos; George D. Stamoulis; Gideon Blocq; Avi Miron; Ariel Orda (ISCC, 2011)

Survivable impairment-aware traffic grooming in WDM rings. - Anteneh Beshir; Fernando A. Kuipers; Ariel Orda; Piet Van Mieghem (ITC, 2011)

Special Issue: Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks: selected papers from WiOpt 2010. - Nidhi Hegde 001; Lavy Libman; Ariel Orda (Perform. Evaluation, 2011)

Distributed oblivious load balancing using prioritized job replication. - Amir Nahir; Ariel Orda; Danny Raz (CNSM, 2012)

Survivable routing and regenerator placement in optical networks. - Anteneh Beshir; Fernando A. Kuipers; Ariel Orda; Piet Van Mieghem (ICUMT, 2012)

Workload factoring with the cloud: A game-theoretic perspective. - Amir Nahir; Ariel Orda; Danny Raz (INFOCOM, 2012)

Message from the general chairs. - Ariel Orda; Francesco De Pellegrini (NetGCooP, 2012)

Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. - Niv Buchbinder; Liane Lewin-Eytan; Ishai Menache; Joseph Naor; Ariel Orda (IEEE/ACM Trans. Netw., 2012)

Schedule first, manage later: Network-aware load balancing. - Amir Nahir; Ariel Orda; Danny Raz (INFOCOM, 2013)

Efficient wireless security through jamming, coding and routing. - Majid Ghaderi; Dennis Goeckel; Ariel Orda; Mostafa Dehghan (SECON, 2013)

Worst-Case Coalitions in Routing Games. - Gideon Blocq; Ariel Orda (CoRR, 2013)

Formation Games and the Internet Structure. - Eli A. Meirom; Shie Mannor; Ariel Orda (CoRR, 2013)

Guest editorial. - Xavi Masip; Ariel Orda; Svetoslav Duhovnikov (Opt. Switch. Netw., 2013)

Constrained Maximum Flow in Stochastic Networks. - Fernando A. Kuipers; Song Yang 002; Stojan Trajanovski; Ariel Orda (ICNP, 2014)

Network formation games with heterogeneous players and the internet structure. - Eli A. Meirom; Shie Mannor; Ariel Orda (EC, 2014)

Topology Design of Communication Networks: A Game-Theoretic Perspective. - Amir Nahir; Ariel Orda; Ari Freund 001 (IEEE/ACM Trans. Netw., 2014)

"Don't let the stack get stuck": A novel approach for designing efficient stackable routers. - Jose Yallouz; Gideon Blocq; Yoram Revah; Aviran Kadosh; Ariel Orda (HPSR, 2015)

Resource allocation and management in Cloud Computing. - Amir Nahir; Ariel Orda; Danny Raz (IM, 2015)

Formation games of reliable networks. - Eli A. Meirom; Shie Mannor; Ariel Orda (INFOCOM, 2015)

"Beat-Your-Rival" Routing Games. - Gideon Blocq; Ariel Orda (SAGT, 2015)

Localized Epidemic Detection in Networks with Overwhelming Noise. - Eli A. Meirom; Chris Milling; Constantine Caramanis; Shie Mannor; Sanjay Shakkottai; Ariel Orda (SIGMETRICS, 2015)

Minimum Energy Routing and Jamming to Thwart Wireless Network Eavesdroppers. - Majid Ghaderi; Dennis Goeckel; Ariel Orda; Mostafa Dehghan (IEEE Trans. Mob. Comput., 2015)

Workload Factoring: A Game-Theoretic Perspective. - Amir Nahir; Ariel Orda; Danny Raz (IEEE/ACM Trans. Netw., 2015)

Composite-Path Switching. - Shay Vargaftik; Katherine Barabash; Yaniv Ben-Itzhak; Ofer Biran; Isaac Keslassy; Dean H. Lorenz; Ariel Orda (CoNEXT, 2016)

Optimal link-disjoint node-"somewhat disjoint" paths. - Jose Yallouz; Ori Rottenstreich; Péter Babarczi; Avi Mendelson; Ariel Orda (ICNP, 2016)

Reversing the supermarket: A distributed approach for handling elasticity in the cloud. - Amir Nahir; Ariel Orda; Danny Raz (NOMS, 2016)

Optics in Data Centers: Adapting to Diverse Modern Workloads. - Shay Vargaftik; Isaac Keslassy; Ariel Orda; Katherine Barabash; Yaniv Ben-Itzhak; Ofer Biran; Dean H. Lorenz (SYSTOR, 2016)

Establishing Multiple Survivable Connections (Extended Version). - Michael Keslassy; Ariel Orda (CoRR, 2016)

How Good is Bargained Routing? - Gideon Blocq; Ariel Orda (IEEE/ACM Trans. Netw., 2016)

Tunable Survivable Spanning Trees. - Jose Yallouz; Ori Rottenstreich; Ariel Orda (IEEE/ACM Trans. Netw., 2016)

Replication-Based Load Balancing. - Amir Nahir; Ariel Orda; Danny Raz (IEEE Trans. Parallel Distributed Syst., 2016)

Proxy Voting for Better Outcomes. - Gal Cohensius; Shie Mannor; Reshef Meir; Eli A. Meirom; Ariel Orda (AAMAS, 2017)

Stable user-defined priorities. - Shay Vargaftik; Isaac Keslassy; Ariel Orda (INFOCOM, 2017)

Packing strictly-shortest paths in a tree for QoS-aware routing. - Jose Yallouz; János Tapolcai; Attila Körösi; Kristóf Bérczi; László Gyimóthi; Ariel Orda (Networking, 2017)

dRMT: Disaggregated Programmable Switching. - Sharad Chole; Andy Fingerhut; Sha Ma; Anirudh Sivaraman; Shay Vargaftik; Alon Berger; Gal Mendelson; Mohammad Alizadeh; Shang-Tse Chuang; Isaac Keslassy; Ariel Orda; Tom Edsall (SIGCOMM, 2017)

Strategic Formation of Heterogeneous Networks. - Eli A. Meirom; Shie Mannor; Ariel Orda (IEEE J. Sel. Areas Commun., 2017)

No Packet Left Behind: Avoiding Starvation in Dynamic Topologies. - Shay Vargaftik; Isaac Keslassy; Ariel Orda (IEEE/ACM Trans. Netw., 2017)

Tunable QoS-Aware Network Survivability. - Jose Yallouz; Ariel Orda (IEEE/ACM Trans. Netw., 2017)

Detecting Cascades from Weak Signatures. - Eli A. Meirom; Constantine Caramanis; Shie Mannor; Ariel Orda; Sanjay Shakkottai (IEEE Trans. Netw. Sci. Eng., 2018)

Minimum-Weight Link-Disjoint Node-"Somewhat Disjoint" Paths. - Jose Yallouz; Ori Rottenstreich; Péter Babarczi; Avi Mendelson; Ariel Orda (IEEE/ACM Trans. Netw., 2018)

The effect of ramp constraints on coalitional storage games. - Diego Kiedanski; Ariel Orda; Daniel Kofman (e-Energy, 2019)

Exploiting Flexibility in Irrigation While Maintaining Optimal Crop Productivity. - Diego Kiedanski; Daniel Kofman; Ariel Orda; José Horta; Alvaro Otero (SmartGridComm, 2019)

Coalitions in Routing Games: A Worst-Case Perspective. - Gideon Blocq; Ariel Orda (IEEE Trans. Netw. Sci. Eng., 2019)

Efficient distributed solutions for sharing energy resources at the local level: a cooperative game approach. - Diego Kiedanski; Ana Busic; Daniel Kofman; Ariel Orda (CDC, 2020)

Discrete and stochastic coalitional storage games. - Diego Kiedanski; Ariel Orda; Daniel Kofman (e-Energy, 2020)

Design of a Combinatorial Double Auction for Local Energy Markets. - Diego Kiedanski; Daniel Kofman; Ariel Orda (NetGCooP, 2020)

Sequential Zeroing: Online Heavy-Hitter Detection on Programmable Hardware. - Belma Turkovic; Jorik Oostenbrink; Fernando A. Kuipers; Isaac Keslassy; Ariel Orda (Networking, 2020)

Combflex: a linear combinatorial auction for local energy markets. - Diego Kiedanski; Ariel Orda; Daniel Kofman (SmartGridComm, 2020)

An Efficient Algorithm for Finding Sets of Optimal Routes. - Ido Zoref; Ariel Orda (CoRR, 2020)

A Game-Theoretic Analysis of Shared/Buy-in Computing Systems. - Zhenpeng Shi; Azer Bestavros; Ariel Orda; David Starobinski (IEEE Open J. Commun. Soc., 2020)

LSQ: Load Balancing in Large-Scale Heterogeneous Systems With Multiple Dispatchers. - Shay Vargaftik; Isaac Keslassy; Ariel Orda (IEEE/ACM Trans. Netw., 2020)

Load balancing with JET: just enough tracking for connection consistency. - Gal Mendelson; Shay Vargaftik; Dean H. Lorenz; Kathy Barabash; Isaac Keslassy; Ariel Orda (CoNEXT, 2021)

Effects of Economic Shocks on Power Systems: COVID-19 as a Case Study. - Aviad Navon; Ariel Orda; Yoash Levron; Juri Belikov (ISGT-Europe, 2021)

RADE: resource-efficient supervised anomaly detection using decision tree-based ensemble methods. - Shay Vargaftik; Isaac Keslassy; Ariel Orda; Yaniv Ben-Itzhak (Mach. Learn., 2021)

Enforcing Fairness in Blockchain Transaction Ordering. - Ariel Orda; Ori Rottenstreich (Peer-to-Peer Netw. Appl., 2021)

AnchorHash: A Scalable Consistent Hash. - Gal Mendelson; Shay Vargaftik; Katherine Barabash; Dean H. Lorenz; Isaac Keslassy; Ariel Orda (IEEE/ACM Trans. Netw., 2021)

Communication-aware Fairness in Blockchain Transaction Ordering. - Mohammad Nassar; Ori Rottenstreich; Ariel Orda (HPSR, 2022)

Special issue on blockchain networks and distributed protocols. - Maria Potop-Butucaru; Ariel Orda; Maurice Herlihy; Stefano Secci (Ann. des Télécommunications, 2022)

Memento: Making Sliding Windows Efficient for Heavy Hitters. - Ran Ben Basat; Gil Einziger; Isaac Keslassy; Ariel Orda; Shay Vargaftik; Erez Waisbard (IEEE/ACM Trans. Netw., 2022)

Social Cost Analysis of Shared/Buy-in Computing Systems. - Zhenpeng Shi; David Starobinski; Ariel Orda (ACM Trans. Economics and Comput., 2023)

On the Stability of Strategic Energy Storage Operation in Wholesale Electricity Markets (Extended Version). - Aviad Navon; Juri Belikov; Ariel Orda; Yoash Levron (CoRR, 2024)

CFTO: Communication-Aware Fairness in Blockchain Transaction Ordering. - Mohammad Nassar; Ori Rottenstreich; Ariel Orda (IEEE Trans. Netw. Serv. Manag., 2024)

Survivable Payment Channel Networks. - Yekaterina Podiatchev; Ariel Orda; Ori Rottenstreich (IEEE Trans. Netw. Serv. Manag., 2024)

Distributed Training under Packet Loss. - Erez Weintraub; Ron Banner; Ariel Orda (CoRR, 2025)