Richard R. Weber

According to our database1, Richard R. Weber authored at least 29 papers between 1983 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Optimal Pricing for Peer-to-Peer Sharing With Network Externalities.
IEEE/ACM Trans. Netw., 2021

2018
Optimal pricing for a peer-to-peer sharing platform under network externalities.
Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation, 2018

2016
Special article [paid peering: pricing and adoption incentives].
J. Commun. Networks, 2016

Pricing the fast-lanes: A qualitative study on the implications of paid peering agreements.
Proceedings of the 2016 IEEE International Conference on Communications, 2016

2014
Revenue Models, Price Differentiation and Network Neutrality Implications in the Internet.
SIGMETRICS Perform. Evaluation Rev., 2014

2012
Economic Issues in Shared Infrastructures.
IEEE/ACM Trans. Netw., 2012

2009
Optimal call routing in VoIP.
Proceedings of the 21st International Teletraffic Congress, 2009

2008
Optimal scheduling of peer-to-peer file dissemination.
J. Sched., 2008

Dynamic Bandwidth Pricing: Provision Cost, Market Size, Effective Bandwidths and Price Games.
J. Univers. Comput. Sci., 2008

2006
Analysis of peer-to-peer file dissemination.
SIGMETRICS Perform. Evaluation Rev., 2006

Analysis of peer-to-peer file dissemination amongst users of different upload capacities.
SIGMETRICS Perform. Evaluation Rev., 2006

Incentives for large peer-to-peer systems.
IEEE J. Sel. Areas Commun., 2006

On the Sum-of-Squares algorithm for bin packing.
J. ACM, 2006

2003
Pricing communication networks - economics, technology and modelling.
Wiley-Interscience series in systems and optimization, Wiley, ISBN: 978-0-470-85130-2, 2003

2002
Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing.
SIAM Rev., 2002

2000
A study of simple usage-based charging schemes for broadband networks.
Telecommun. Syst., 2000

Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings.
SIAM J. Discret. Math., 2000

Measurement-Based Usage Charges in Comminucations Networks.
Oper. Res., 2000

1999
A Self Organizing Bin Packing Heuristic.
Proceedings of the Algorithm Engineering and Experimentation, 1999

1997
Bin packing with discrete item sizes, part II: Tight bounds on First Fit.
Random Struct. Algorithms, 1997

1995
Admission control and routing in ATM networks using inferences from measured buffer occupancy.
IEEE Trans. Commun., 1995

1994
The Cafeteria Process - Tandem Queues with 0-1 Dependent Service Times and the Bowl Shape Phenomenon.
Oper. Res., 1994

Stability of Flexible Manufacturing Systems.
Oper. Res., 1994

1993
A survey of Markov decision models for control of networks of queues.
Queueing Syst. Theory Appl., 1993

Markov chains, computer proofs, and average-case analysis of best fit bin packing.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1991
Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

1989
Stabilizing an Uncertain Production System.
Queueing Syst. Theory Appl., 1989

Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs.
Oper. Res., 1989

1983
Technical Note - A Note on Waiting Times in Single Server Queues.
Oper. Res., 1983


  Loading...