- SIAM MACRO EXAMPLES 13 [21] C. B. Weinstock and W. A. Wulf, Quickfit: an efficient algorithm for heap storage allocation,
- Incentive Compatible Pricing Strategies for QoS Routing Yannis A. Korilis Ariel Orda
- Computing Shortest Paths for Any Number of Hops Roch Gu erin and Ariel Orda
- IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 13, NO. 8, 1995 1 Architecting Noncooperative Networks
- Routing with End to End QoS Guarantees in Broadband Department of Electrical Engineering, Technion ---Israel Institute of Technology
- ON CONTINUOUS NETWORK FLOWS Raphael Rom +
- DISTRIBUTED SHORTESTPATH PROTOCOLS TIMEDEPENDENT NETWORKS
- , , 1--18 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- MULTIHOMING IN COMPUTER NETWORKS: A TOPOLOGYDESIGN APPROACH
- IEEE/ACM TRANSACTIONS ON NETWORKING 1 The Designer's Perspective to Atomic
- LOCATION OF CENTRAL NODES IN TIME VARYING COMPUTER NETWORKS
- IEEE/ACM TRANSACTIONS ON NETWORKING 1 Optimal Retrial and Timeout Strategies for
- IEEE/ACM TRANSACTIONS ON NETWORKING 1 Achieving Network Optima Using Stackelberg
- MINIMUM WEIGHT PATHS TIMEDEPENDENT NETWORKS
- Avoiding the Braess Paradox in Noncooperative Yannis A. Korilis \Lambda Aurel A. Lazar Ariel Orda yz
- Virtual Path Bandwidth Allocation in MultiUser Networks Aurel A. Lazar \Lambda , Ariel Orda y and Dimitrios E. Pendarakis \Lambda
- MINIMUM DELAY ROUTING IN MULTISATELLITE NETWORKS +
- Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees
- SHORTESTPATH AND MINIMUMDELAY ALGORITHMS NETWORKS WITH TIMEDEPENDENT EDGELENGTH
- Scheduled HotPotato Routing Joseph (Seffi) Naor \Lambda Ariel Orda y Raphael Rom z
- QoS Routing in Networks with Uncertain Parameters Dean H. Lorenz and Ariel Orda
- IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1 Capacity Allocation under Noncooperative Routing
- OPTIMAL PACKET FRAGMENTATION IN COMPUTER NETWORKS Raphael Rom
- [CFL90] E. G. Coffman, Leopold Flatto, and F. T. Leighton. Firstfit storage of linear lists: tight probabilistic bounds on wasted space. In Proc. 1st Annual ACMSIAM Sympo
