| 2024 | COMSNETS | Survivable Payment Channel Networks. | Yekaterina Podiatchev, Ariel Orda, Ori Rottenstreich |
| 2022 | HPSR | Communication-aware Fairness in Blockchain Transaction Ordering. | Mohammad Nassar, Ori Rottenstreich, Ariel Orda |
| 2021 | CoNEXT | Load balancing with JET: just enough tracking for connection consistency. | Gal Mendelson, Shay Vargaftik, Dean H. Lorenz, Kathy Barabash, Isaac Keslassy, Ariel Orda |
| 2020 | Networking | Sequential Zeroing: Online Heavy-Hitter Detection on Programmable Hardware. | Belma Turkovic, Jorik Oostenbrink, Fernando A. Kuipers, Isaac Keslassy, Ariel Orda |
| 2018 | CoNEXT | Memento: making sliding windows efficient for heavy hitters. | Ran Ben-Basat, Gil Einziger, Isaac Keslassy, Ariel Orda, Shay Vargaftik, Erez Waisbard |
| 2017 | INFOCOM | Stable user-defined priorities. | Shay Vargaftik, Isaac Keslassy, Ariel Orda |
| 2017 | Networking | Packing strictly-shortest paths in a tree for QoS-aware routing. | Jose Yallouz, Jnos Tapolcai, Attila Krsi, Kristf Brczi, Lszl Gyimthi, Ariel Orda |
| 2017 | SIGCOMM | 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 |
| 2016 | CoNEXT | Composite-Path Switching. | Shay Vargaftik, Katherine Barabash, Yaniv Ben-Itzhak, Ofer Biran, Isaac Keslassy, Dean H. Lorenz, Ariel Orda |
| 2016 | ICNP | Optimal link-disjoint node-"somewhat disjoint" paths. | Jose Yallouz, Ori Rottenstreich, Pter Babarczi, Avi Mendelson, Ariel Orda |
| 2016 | NOMS | Reversing the supermarket: A distributed approach for handling elasticity in the cloud. | Amir Nahir, Ariel Orda, Danny Raz |
| 2016 | SYSTOR | 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 |
| 2015 | HPSR | "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 |
| 2015 | IM | Resource allocation and management in Cloud Computing. | Amir Nahir, Ariel Orda, Danny Raz |
| 2015 | INFOCOM | Formation games of reliable networks. | Eli A. Meirom, Shie Mannor, Ariel Orda |
| 2015 | SIGMETRICS | Localized Epidemic Detection in Networks with Overwhelming Noise. | Eli A. Meirom, Chris Milling, Constantine Caramanis, Shie Mannor, Sanjay Shakkottai, Ariel Orda |
| 2015 | SAGT | "Beat-Your-Rival" Routing Games. | Gideon Blocq, Ariel Orda |
| 2014 | ICNP | Constrained Maximum Flow in Stochastic Networks. | Fernando A. Kuipers, Song Yang, Stojan Trajanovski, Ariel Orda |
| 2014 | SIGMETRICS | Tunable survivable spanning trees. | Jose Yallouz, Ori Rottenstreich, Ariel Orda |
| 2013 | INFOCOM | Schedule first, manage later: Network-aware load balancing. | Amir Nahir, Ariel Orda, Danny Raz |
| 2013 | INFOCOM | Tunable QoS-aware network survivability. | Jose Yallouz, Ariel Orda |
| 2013 | SECON | Efficient wireless security through jamming, coding and routing. | Majid Ghaderi, Dennis Goeckel, Ariel Orda, Mostafa Dehghan |
| 2012 | CNSM | Distributed oblivious load balancing using prioritized job replication. | Amir Nahir, Ariel Orda, Danny Raz |
| 2012 | INFOCOM | How good is bargained routing? | Gideon Blocq, Ariel Orda |
| 2012 | INFOCOM | Workload factoring with the cloud: A game-theoretic perspective. | Amir Nahir, Ariel Orda, Danny Raz |
| 2011 | ISCC | Inter-carrier interconnection services: QoS, economics and business issues. | Costas Courcoubetis, Manos Dramitinos, George D. Stamoulis, Gideon Blocq, Avi Miron, Ariel Orda |
| 2010 | ICNP | Impairment-aware path selection and regenerator placement in translucent optical networks. | Fernando A. Kuipers, Anteneh Beshir, Ariel Orda, Piet Van Mieghem |
| 2010 | INFOCOM | Designing Low-Capacity Backup Networks for Fast Restoration. | Ron Banner, Ariel Orda |
| 2010 | INFOCOM | Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. | Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda |
| 2009 | INFOCOM | Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. | Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda |
| 2009 | INFOCOM | Topology Design and Control: A Game-Theoretic Perspective. | Amir Nahir, Ariel Orda, Ari Freund |
| 2009 | INFOCOM | Protecting Against Network Infections: A Game Theoretic Perspective. | Jasmina Omic, Ariel Orda, Piet Van Mieghem |
| 2008 | ICA3PP | Quasi-opportunistic Supercomputing in Grid Environments. | Valentin Kravtsov, David Carmeli, Werner Dubitzky, Ariel Orda, Assaf Schuster, Mark Silberstein, Benny Yoshpa |
| 2008 | INFOCOM | Multi-Objective Topology Control in Wireless Networks. | Ron Banner, Ariel Orda |
| 2008 | INFOCOM | Maximum Coverage at Minimum Cost for Multi-Domain IP/MPLS Networks. | Marcelo Yannuzzi, Xavier Masip-Bruin, Ren Serral-Graci, Eva Marn-Tordera, Alexander Sprintson, Ariel Orda |
| 2008 | SAGT | Non-cooperative Cost Sharing Games Via Subsidies. | Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda |
| 2007 | INFOCOM | Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks. | Alexander Sprintson, Marcelo Yannuzzi, Ariel Orda, Xavier Masip-Bruin |
| 2007 | MOBIHOC | Maximum-lifetime routing: system optimization & game-theoretic perspectives. | Liane Lewin-Eytan, Joseph Naor, Ariel Orda |
| 2006 | INFOCOM | Bottleneck Routing Games in Communication Networks. | Ron Banner, Ariel Orda |
| 2006 | Networking | A Comparison of Exact and | Fernando A. Kuipers, Ariel Orda, Danny Raz, Piet Van Mieghem |
| 2006 | PODC | EquiCast: scalable multicast with selfish users. | Idit Keidar, Roie Melamed, Ariel Orda |
| 2005 | MOBIHOC | Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas. | Ariel Orda, Ben-Ami Yassour |
| 2005 | Networking | Multipath Routing Algorithms for Congestion Minimization. | Ron Banner, Ariel Orda |
| 2005 | Qshine | QoS Routing: Challenges and Solution Approaches. | Ariel Orda |
| 2004 | ICNP | The Power of Tuning: A Novel Approach for the Efficient Design of Survivable Networks. | Ron Banner, Ariel Orda |
| 2004 | INFOCOM | Path Protection and Blocking Probability Minimization in Optical Networks. | David Lee, Lavy Libman, Ariel Orda |
| 2004 | INFOCOM | Efficient Algorithms for Computing Disjoint QoS Paths. | Ariel Orda, Alexander Sprintson |
| 2004 | Qshine | QoS Provision and Routing with Stochastic Guarantees. | Erez Biton, Ariel Orda |
| 2003 | INFOCOM | Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays. | Lavy Libman, Ariel Orda |
| 2003 | INFOCOM | Optimal Partition of QoS Requirements for Many-to-Many Connections. | Dean H. Lorenz, Ariel Orda, Danny Raz |
| 2002 | INFOCOM | A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast. | Ariel Orda, Alexander Sprintson |
| 2000 | INFOCOM | Networks with Advance Reservations: The Routing Perspective. | Roch Gurin, Ariel Orda |
| 2000 | INFOCOM | QoS Routing: The Precomputation Perspective. | Ariel Orda, Alexander Sprintson |
| 1999 | INFOCOM | Best-Effort Resource Sharing by Users with QoS Requirements. | Israel Ben-Shahar, Ariel Orda, Nahum Shimkin |
| 1999 | INFOCOM | Incentive Compatible Pricing Strategies for QoS Routing. | Yannis A. Korilis, Ariel Orda |
| 1999 | INFOCOM | Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees. | Dean H. Lorenz, Ariel Orda |
| 1998 | INFOCOM | Bandwidth Allocation for Guaranteed versus Best Effort Service Categories. | Eitan Altman, Ariel Orda, Nahum Shimkin |
| 1998 | INFOCOM | QoS Routing in Networks with Uncertain Parameters. | Dean H. Lorenz, Ariel Orda |
| 1998 | INFOCOM | Routing with End to End QoS Guarantees in Broadband Networks. | Ariel Orda |
| 1997 | ESA | Dynamic Storage Allocation with Known Durations. | Joseph Naor, Ariel Orda, Yael Petruschka |
| 1997 | INFOCOM | QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms. | Roch Gurin, Ariel Orda |
| 1997 | INFOCOM | Atomic Resource Sharing in Noncooperative Networks. | Lavy Libman, Ariel Orda |
| 1997 | INFOCOM | Incentive Pricing in Multi-Class Communication Networks. | Ariel Orda, Nahum Shimkin |
| 1996 | INFOCOM | The Role of the Manager in a Noncooperative Network. | Yannis A. Korilis, Aurel A. Lazar, Ariel Orda |
| 1996 | INFOCOM | An Adaptive Virtual Path Allocation Policy for Broadband Networks. | Ariel Orda, Giovanni Pacifici, Dimitrios E. Pendarakis |
| 1995 | CAV | Modelling Asynchrony with a Synchronous Model. | Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs |
| 1995 | INFOCOM | The Designer's Perspective to Noncooperative Networks. | Yannis A. Korilis, Aurel A. Lazar, Ariel Orda |
| 1995 | INFOCOM | Virtual Path Bandwidth Allocation in Multi-User Networks. | Aurel A. Lazar, Ariel Orda, Dimitrios E. Pendarakis |
| 1995 | INFOCOM | Scheduled Hot-Potato Routing. | Joseph Naor, Ariel Orda, Raphael Rom |
| 1994 | SODA | Tight Bounds for Dynamic Storage Allocation. | Michael Luby, Joseph Naor, Ariel Orda |
| 1993 | CAV | A Structural Linearization Principle for Processes. | Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs |
| 1993 | INFOCOM | Optimal Routing with Packet Fragmentation in Computer Networks. | Ariel Orda, Raphael Rom |
| 1993 | INFOCOM | Competitive Routing in Multi-User Communication Networks. | Ariel Orda, Raphael Rom, Nahum Shimkin |
| 1992 | INFOCOM | Minimum Delay Routing in Stochastic Networks. | Ariel Orda, Moshe Sidi, Raphael Rom |
| 1989 | INFOCOM | Location of Central Nodes in Time Varying Computer Networks. | Ariel Orda, Raphael Rom |
| 1988 | ICCC | Distributed shortest-path protocols for time-dependent networks. | Ariel Orda, Raphael Rom |
| 1988 | INFOCOM | Shortest-path algorithms for time-dependent networks. | Ariel Orda, Raphael Rom |
| 1988 | INFOCOM | Multihoming in computer networks: a topology-design approach. | Ariel Orda, Raphael Rom |
| 1986 | ICCC | Packet Duplication and Elimination in Distributed Networks. | Ariel Orda, Raphael Rom |
| 1986 | ICDCS | Packet Duplication and Elimination in Distributed Networks. | Ariel Orda, Raphael Rom |