Technical Note - A Note on Waiting Times in Single Server Queues. - Richard R. Weber 003 (Oper. Res., 1983)

Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs. - Shaler Stidham Jr.; Richard R. Weber 003 (Oper. Res., 1989)

Stabilizing an Uncertain Production System. - Costas Courcoubetis; Panagiotis Konstantopoulos; Jean C. Walrand; Richard R. Weber 003 (Queueing Syst. Theory Appl., 1989)

Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study - Edward G. Coffman Jr.; Costas Courcoubetis; M. R. Garey; David S. Johnson 001; Lyle A. McGeoch; Peter W. Shor; Richard R. Weber 003; Mihalis Yannakakis (STOC, 1991)

Markov chains, computer proofs, and average-case analysis of best fit bin packing. - Edward G. Coffman Jr.; David S. Johnson 001; Peter W. Shor; Richard R. Weber 003 (STOC, 1993)

A survey of Markov decision models for control of networks of queues. - Shaler Stidham Jr.; Richard R. Weber 003 (Queueing Syst. Theory Appl., 1993)

On a conjecture about assigning jobs to processors of differing speeds. - Richard Weber 003 (IEEE Trans. Autom. Control., 1993)

Stability of Flexible Manufacturing Systems. - Costas Courcoubetis; Richard R. Weber 003 (Oper. Res., 1994)

The Cafeteria Process - Tandem Queues with 0-1 Dependent Service Times and the Bowl Shape Phenomenon. - Richard R. Weber 003; Gideon Weiss (Oper. Res., 1994)

Admission control and routing in ATM networks using inferences from measured buffer occupancy. - Costas Courcoubetis; George Kesidis; Ad Ridder; Jean C. Walrand; Richard R. Weber 003 (IEEE Trans. Commun., 1995)

Bin packing with discrete item sizes, part II: Tight bounds on First Fit. - Edward G. Coffman Jr.; David S. Johnson 001; Peter W. Shor; Richard R. Weber 003 (Random Struct. Algorithms, 1997)

A Self Organizing Bin Packing Heuristic. - János Csirik; David S. Johnson 001; Claire Kenyon; Peter W. Shor; Richard R. Weber 003 (ALENEX, 1999)

Measurement-Based Usage Charges in Comminucations Networks. - Costas Courcoubetis; Frank P. Kelly; Richard R. Weber 003 (Oper. Res., 2000)

Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. - Edward G. Coffman Jr.; Costas Courcoubetis; M. R. Garey; David S. Johnson 001; Peter W. Shor; Richard R. Weber 003; Mihalis Yannakakis (SIAM J. Discret. Math., 2000)

A study of simple usage-based charging schemes for broadband networks. - Costas Courcoubetis; Frank P. Kelly; Vasilios A. Siris; Richard R. Weber 003 (Telecommun. Syst., 2000)

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing. - Edward G. Coffman Jr.; Costas Courcoubetis; Michael R. Garey; David S. Johnson 001; Peter W. Shor; Richard R. Weber 003; Mihalis Yannakakis (SIAM Rev., 2002)

Pricing communication networks - economics, technology and modelling. - Costas Courcoubetis; Richard R. Weber 003 (Wiley, 2003)

On the Sum-of-Squares algorithm for bin packing. - János Csirik; David S. Johnson 001; Claire Kenyon; James B. Orlin; Peter W. Shor; Richard R. Weber 003 (J. ACM, 2006)

Incentives for large peer-to-peer systems. - Costas Courcoubetis; Richard R. Weber 003 (IEEE J. Sel. Areas Commun., 2006)

Analysis of peer-to-peer file dissemination amongst users of different upload capacities. - Jochen Mundinger; Richard R. Weber 003; Gideon Weiss (SIGMETRICS Perform. Evaluation Rev., 2006)

Analysis of peer-to-peer file dissemination. - Jochen Mundinger; Richard R. Weber 003; Gideon Weiss (SIGMETRICS Perform. Evaluation Rev., 2006)

Dynamic Bandwidth Pricing: Provision Cost, Market Size, Effective Bandwidths and Price Games. - Sergios Soursos; Costas Courcoubetis; Richard R. Weber 003 (J. Univers. Comput. Sci., 2008)

Optimal scheduling of peer-to-peer file dissemination. - Jochen Mundinger; Richard R. Weber 003; Gideon Weiss (J. Sched., 2008)

Optimal call routing in VoIP. - Costas Courcoubetis; Costas Kalogiros; Richard R. Weber 003 (ITC, 2009)

Indexability and whittle index for restless bandit problems involving reset processes. - Keqin Liu; Richard Weber 003; Qing Zhao 001 (CDC/ECC, 2011)

Optimal Symmetric Rendezvous Search on Three Locations. - Richard Weber 003 (Math. Oper. Res., 2012)

Strategy for Quickest Second Meeting of Two Agents in Two Locations. - Richard Weber 003 (Math. Oper. Res., 2012)

Economic Issues in Shared Infrastructures. - Costas Courcoubetis; Richard R. Weber 003 (IEEE/ACM Trans. Netw., 2012)

ABCs of the bomber problem and its relatives. - Richard Weber 003 (Ann. Oper. Res., 2013)

Revenue Models, Price Differentiation and Network Neutrality Implications in the Internet. - Costas Courcoubetis; Kostas Sdrolias; Richard R. Weber 003 (SIGMETRICS Perform. Evaluation Rev., 2014)

A more general Pandora rule? - Wojciech Olszewski; Richard Weber 003 (J. Econ. Theory, 2015)

Pricing the fast-lanes: A qualitative study on the implications of paid peering agreements. - Costas Courcoubetis; Kostas Sdrolias; Richard R. Weber 003 (ICC, 2016)

Special article [paid peering: pricing and adoption incentives]. - Costas Courcoubetis; Kostas Sdrolias; Richard R. Weber 003 (J. Commun. Networks, 2016)

Optimal pricing for a peer-to-peer sharing platform under network externalities. - Yunpeng Li 007; Costas Courcoubetis; Lingjie Duan; Richard R. Weber 003 (NetEcon@SIGMETRICS, 2018)

Optimal Pricing for Peer-to-Peer Sharing With Network Externalities. - Yunpeng Li 007; Costas Courcoubetis; Lingjie Duan; Richard R. Weber 003 (IEEE/ACM Trans. Netw., 2021)

Low-complexity algorithm for restless bandits with imperfect observations. - Keqin Liu; Richard Weber 003; Chengzhong Zhang (Math. Methods Oper. Res., 2024)