The SCEAS System
| |||||||

## Search the dblp DataBase
Richard R. Weber:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
**A Self Organizing Bin Packing Heuristic.**[Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:246-265 [Conf] - Costas Courcoubetis, Frank P. Kelly, Vasilios A. Siris, Richard R. Weber
**A study of simple usage-based charging schemes for broadband networks.**[Citation Graph (0, 0)][DBLP] Broadband Communications, 1998, pp:209-221 [Conf] - Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
**Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study**[Citation Graph (0, 0)][DBLP] STOC, 1991, pp:230-240 [Conf] - Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber
**Markov chains, computer proofs, and average-case analysis of best fit bin packing.**[Citation Graph (0, 0)][DBLP] STOC, 1993, pp:412-421 [Conf] - János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
**On the sum-of-squares algorithm for bin packing.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:208-217 [Conf] - János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
**On the Sum-of-Squares Algorithm for Bin Packing**[Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal] - János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
**On the Sum-of-Squares algorithm for bin packing.**[Citation Graph (0, 0)][DBLP] J. ACM, 2006, v:53, n:1, pp:1-65 [Journal] - Costas Courcoubetis, P. Konstantopoulos, Jean C. Walrand, Richard R. Weber
**Stabilizing an Uncertain Production System.**[Citation Graph (0, 0)][DBLP] Queueing Syst., 1989, v:5, n:1-3, pp:37-54 [Journal] - Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber
**Bin packing with discrete item sizes, part II: Tight bounds on First Fit.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1997, v:10, n:1-2, pp:69-101 [Journal] - Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
**Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2000, v:13, n:3, pp:384-402 [Journal] - Costas Courcoubetis, Frank P. Kelly, Vasilios A. Siris, Richard R. Weber
**A study of simple usage-based charging schemes for broadband networks.**[Citation Graph (0, 0)][DBLP] Telecommunication Systems, 2000, v:15, n:3-4, pp:323-343 [Journal] - Jochen Mundinger, Richard R. Weber, Gideon Weiss
**Optimal Scheduling of Peer-to-Peer File Dissemination**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **Economic issues in shared infrastructures.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |