Richard R. Weber
Orcid: 0000-0002-2336-5534Affiliations:
- University of Cambridge, Department of Mathematics, UK
According to our database1,
Richard R. Weber
authored at least 36 papers
between 1983 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1985
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
1
1
1
1
1
1
3
2
4
1
3
1
1
2
2
2
1
1
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Math. Methods Oper. Res., October, 2024
2021
IEEE/ACM Trans. Netw., 2021
2018
Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation, 2018
2016
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
2015
2014
Revenue Models, Price Differentiation and Network Neutrality Implications in the Internet.
SIGMETRICS Perform. Evaluation Rev., 2014
2013
2012
Math. Oper. Res., 2012
2011
Indexability and whittle index for restless bandit problems involving reset processes.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011
2009
Proceedings of the 21st International Teletraffic Congress, 2009
2008
Dynamic Bandwidth Pricing: Provision Cost, Market Size, Effective Bandwidths and Price Games.
J. Univers. Comput. Sci., 2008
2006
SIGMETRICS Perform. Evaluation Rev., 2006
Analysis of peer-to-peer file dissemination amongst users of different upload capacities.
SIGMETRICS Perform. Evaluation Rev., 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
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
1999
Proceedings of the Algorithm Engineering and Experimentation, 1999
1997
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
1993
IEEE Trans. Autom. Control., 1993
Queueing Syst. Theory Appl., 1993
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
Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs.
Oper. Res., 1989
1983