The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Edward G. Coffman Jr.: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edward G. Coffman Jr., M. J. Elphick, Arie Shoshani
    System Deadlocks. [Citation Graph (15, 0)][DBLP]
    ACM Comput. Surv., 1971, v:3, n:2, pp:67-78 [Journal]
  2. Edward G. Coffman Jr., Erol Gelenbe, Brigitte Plateau
    Optimization of the Number of Copies in a Distributed Data Base. [Citation Graph (8, 0)][DBLP]
    IEEE Trans. Software Eng., 1981, v:7, n:1, pp:78-84 [Journal]
  3. Edward G. Coffman Jr., M. R. Garey, David S. Johnson
    An Application of Bin-Packing to Multiprocessor Scheduling. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:1, pp:1-17 [Journal]
  4. A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto
    Optimum Head Separation in a Disk System with Two Read/Write Heads. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:826-838 [Journal]
  5. Richard R. Muntz, Edward G. Coffman Jr.
    Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1970, v:17, n:2, pp:324-338 [Journal]
  6. Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Robert Endre Tarjan
    Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:4, pp:808-826 [Journal]
  7. Edward G. Coffman Jr., L. A. Klimko, Barbara Ryan
    Analysis of Scanning Policies for Reducing Disk Seek Times. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1972, v:1, n:3, pp:269-279 [Journal]
  8. François Baccelli, Edward G. Coffman Jr.
    A Data Base Replication Analysis Using an M/M/m Queue with Service Interruptions. [Citation Graph (2, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 1982, v:11, n:4, pp:102-107 [Journal]
  9. Arie Shoshani, Edward G. Coffman Jr.
    Sequencing Tasks in Multiprocess Systems to Avoid Deadlocks [Citation Graph (1, 0)][DBLP]
    FOCS, 1970, pp:225-235 [Conf]
  10. A. C. McKellar, Edward G. Coffman Jr.
    Organizing Matrices and Matrix Operations for Paged Memory Systems. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:3, pp:153-165 [Journal]
  11. Edward G. Coffman Jr.
    A Note on the Relative Performance of Two Disk Scanning Policies. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:1, pp:15-17 [Journal]
  12. Brenda S. Baker, Edward G. Coffman Jr., Dan E. Willard
    Algorithms for Resolving Conflicts in Dynamic Storage Allocation [Citation Graph (1, 0)][DBLP]
    J. ACM, 1985, v:32, n:2, pp:327-343 [Journal]
  13. A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto
    Optimal directory placement on disk storage devices. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1988, v:35, n:2, pp:433-446 [Journal]
  14. Brenda S. Baker, Edward G. Coffman Jr., Ronald L. Rivest
    Orthogonal Packings in Two Dimensions. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:4, pp:846-855 [Journal]
  15. Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
    Scheduling File Transfers. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:743-780 [Journal]
  16. Edward G. Coffman Jr., M. J. Elphick, Arie Shoshani
    Deadlock Problems in Computer Systems. [Citation Graph (0, 0)][DBLP]
    ARCS, 1970, pp:311-325 [Conf]
  17. Peggy B. McGee, Steven M. Nowick, Edward G. Coffman Jr.
    Efficient performance analysis of asynchronous systems based on periodicity. [Citation Graph (0, 0)][DBLP]
    CODES+ISSS, 2005, pp:225-230 [Conf]
  18. Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic
    DNA-Based Computation Times. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:14-23 [Conf]
  19. Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boonsit Yimwadsana
    On Times to Compute Shapes in 2D Tile Self-assembly. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:215-222 [Conf]
  20. Yuliy M. Baryshnikov, Edward G. Coffman Jr., Nadrian C. Seeman, Teddy Yimwadsana
    Self-correcting Self-assembly: Growth Models and the Hammersley Process. [Citation Graph (0, 0)][DBLP]
    DNA, 2005, pp:1-11 [Conf]
  21. John L. Bruno, Edward G. Coffman Jr., W. H. Hosken
    Consistency of Synchronization Nets using P and V Operations [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:71-77 [Conf]
  22. Edward G. Coffman Jr., Neil D. Jones
    Priority Paging Algorithms and the Extension Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1971, pp:177-181 [Conf]
  23. Edward G. Coffman Jr., Joseph Y.-T. Leung
    Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:214-221 [Conf]
  24. Edward G. Coffman Jr.
    A Survey of Mathematical Results in Flow-Time Scheduling for Computer Systems. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1973, pp:25-46 [Conf]
  25. John L. Bruno, Edward G. Coffman Jr.
    Nearly Optimal Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1971, pp:99-103 [Conf]
  26. John L. Bruno, Edward G. Coffman Jr., Ravi Sethi
    Algorithms for Minimizing Mean Flow Time. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1974, pp:504-510 [Conf]
  27. Edward G. Coffman Jr., Kimming So
    On the Comparison Between Single and Multiple Processor Systems. [Citation Graph (0, 0)][DBLP]
    ISCA, 1980, pp:72-79 [Conf]
  28. Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler
    Average-Case Analysis of Retangle Packings. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:292-297 [Conf]
  29. Edward G. Coffman Jr., Martin I. Reiman
    Diffusion Approximations for Computer/Communications Systems. [Citation Graph (0, 0)][DBLP]
    Computer Performance and Reliability, 1983, pp:33-54 [Conf]
  30. Edward G. Coffman Jr., Leopold Flatto, George S. Lueker
    Expected Makespans for Largest-First Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
    Performance, 1984, pp:491-506 [Conf]
  31. Edward G. Coffman Jr., Guy Fayolle, Isi Mitrani
    Two Queues with Alternating Service Periods. [Citation Graph (0, 0)][DBLP]
    Performance, 1987, pp:227-239 [Conf]
  32. Edward G. Coffman Jr., Micha Hofri
    On Scanning-Disks and the Analysis of their Steady State Behavior. [Citation Graph (0, 0)][DBLP]
    Performance, 1977, pp:251-263 [Conf]
  33. Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
    Scheduling File Transfers in a Distributed Network. [Citation Graph (0, 0)][DBLP]
    PODC, 1983, pp:254-266 [Conf]
  34. Edward G. Coffman Jr.
    Recent Progress in the Performance Evaluation of Fundamental Allocation Algorithms. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 1984, pp:2-6 [Conf]
  35. Edward G. Coffman Jr., Erol Gelenbe, Edgar N. Gilbert
    Analysis of a Conveyor Queue in a Flexible Manufacturing System. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 1986, pp:204-223 [Conf]
  36. Edward G. Coffman Jr., Ravi Sethi
    A generalized bound on LPT sequencing. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 1976, pp:306-310 [Conf]
  37. Jerome Talim, Zhen Liu, Philippe Nain, Edward G. Coffman Jr.
    Controlling the robots of Web search engines. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2001, pp:236-244 [Conf]
  38. Edward G. Coffman Jr., Leopold Flatto, Frank Thomson Leighton
    First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:272-279 [Conf]
  39. Edward G. Coffman Jr., George S. Lueker
    Approximation algorithms for extensible bin packing. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:586-588 [Conf]
  40. Edward G. Coffman Jr., Alexander L. Stolyar
    Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:877-878 [Conf]
  41. Edward G. Coffman Jr., Isi Mitrani
    Selecting a Scheduling Rule that Meets Pre-Specified Response Time Demands. [Citation Graph (0, 0)][DBLP]
    SOSP, 1975, pp:187-191 [Conf]
  42. Edward G. Coffman Jr., T. A. Ryan
    A Study of Storage Partitioning Using a Mathematical Model (Abstract). [Citation Graph (0, 0)][DBLP]
    SOSP, 1971, pp:122-129 [Conf]
  43. John L. Bruno, Edward G. Coffman Jr., Ravi Sethi
    Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SOSP, 1973, pp:102-103 [Conf]
  44. 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]
  45. Edward G. Coffman Jr., M. R. Garey
    Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:241-248 [Conf]
  46. 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]
  47. Edward G. Coffman Jr., Frank Thomson Leighton
    A Provably Efficient Algorithm for Dynamic Storage Allocation [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:77-90 [Conf]
  48. Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler
    Packing rectangles in a strip. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2002, v:38, n:10, pp:673-693 [Journal]
  49. Edward G. Coffman Jr., Leopold Flatto, A. Y. Kreinin
    Scheduling Saves in Fault-Tolerant Computations. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1993, v:30, n:5, pp:409-423 [Journal]
  50. Edward G. Coffman Jr., Ronald L. Graham
    Optimal Scheduling for Two-Processor Systems [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1972, v:1, n:, pp:200-213 [Journal]
  51. Edward G. Coffman Jr., Michael A. Langston
    A Performance Guarantee for the Greedy Set-Partitioning Algorithm. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:409-415 [Journal]
  52. Edward G. Coffman Jr., Joseph Y.-T. Leung, D. W. Ting
    Bin Packing: Maximizing the Number of Pieces Packed. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1978, v:9, n:, pp:263-271 [Journal]
  53. John L. Bruno, Edward G. Coffman Jr.
    Optimal Fault-Tolerant Computing on Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1997, v:34, n:12, pp:881-904 [Journal]
  54. Edward G. Coffman Jr., Brian Randell
    Performance Predictions for Extended Paged Memories [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1971, v:1, n:, pp:1-13 [Journal]
  55. Edward G. Coffman Jr., Ravi Sethi
    Algorithms Minimizing Mean Flow Time: Schedule-Length Properties. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1976, v:6, n:, pp:1-14 [Journal]
  56. Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky
    Ideal preemptive schedules on two processors. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2003, v:39, n:8, pp:597-612 [Journal]
  57. E. Asgeirsson, Urtzi Ayesta, Edward G. Coffman Jr., J. Etra, Petar Momcilovic, D. Phillips, V. Vokhshoori, Z. Wang, J. Wolfe
    Closed On-Line Bin Packing. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2002, v:15, n:3, pp:361-367 [Journal]
  58. Edward G. Coffman Jr., Leopold Flatto, Predrag R. Jelenkovic, Bjorn Poonen
    Packing Random Intervals On-Line. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:4, pp:448-476 [Journal]
  59. Edward G. Coffman Jr., Alexander L. Stolyar
    Bandwidth Packing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:1, pp:70-88 [Journal]
  60. Edward G. Coffman Jr., Peter W. Shor
    Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:3, pp:253-277 [Journal]
  61. John L. Bruno, Edward G. Coffman Jr., Ravi Sethi
    Scheduling Independent Tasks to Reduce Mean Finishing Time. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1974, v:17, n:7, pp:382-387 [Journal]
  62. G. J. Burnett, Edward G. Coffman Jr.
    Analysis of Interleaved Memory Systems Using Blockage Buffers. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1975, v:18, n:2, pp:91-95 [Journal]
  63. Edward G. Coffman Jr., T. A. Ryan
    A Study of Storage Partitioning Using a Mathematical Model of Locality. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1972, v:15, n:3, pp:185-190 [Journal]
  64. Edward G. Coffman Jr., L. C. Varian
    Further experimental data on the behavior of programs in a paging environment. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1968, v:11, n:7, pp:471-474 [Journal]
  65. Edward G. Coffman Jr., Edgar N. Gilbert
    Dynamic, First-Fit Packings in Two or More Dimensions [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:61, n:1, pp:1-14 [Journal]
  66. Edward G. Coffman Jr., Kimming So, Micha Hofri, Andrew Chi-Chih Yao
    A Stochastic Model of Bin-Packing [Citation Graph (0, 0)][DBLP]
    Information and Control, 1980, v:44, n:2, pp:105-115 [Journal]
  67. Edward G. Coffman Jr., Leopold Flatto, Edgar N. Gilbert, Albert G. Greenberg
    An Approximate Model of Processor Communication Rings Under Heavy Load. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:2, pp:61-67 [Journal]
  68. G. J. Burnett, Edward G. Coffman Jr.
    A Combinatorial Problem Related to Interleaved Memory Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1973, v:20, n:1, pp:39-45 [Journal]
  69. R. A. Cody, Edward G. Coffman Jr.
    Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:103-115 [Journal]
  70. R. A. Cody, Edward G. Coffman Jr.
    Errata: ``Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices''. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:3, pp:572- [Journal]
  71. Edward G. Coffman Jr.
    JACM 1976-1979. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:1, pp:16- [Journal]
  72. Edward G. Coffman Jr.
    Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1968, v:15, n:3, pp:341-353 [Journal]
  73. Edward G. Coffman Jr.
    Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1969, v:16, n:1, pp:73-90 [Journal]
  74. Edward G. Coffman Jr.
    Erratum: ``Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System''. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1969, v:16, n:1, pp:646- [Journal]
  75. Edward G. Coffman Jr., M. R. Garey
    Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:5, pp:991-1018 [Journal]
  76. Edward G. Coffman Jr., Leonard Kleinrock
    Feedback Queueing Models for Time-Shared Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1968, v:15, n:4, pp:549-576 [Journal]
  77. Edward G. Coffman Jr., Richard R. Muntz, H. Trotter
    Waiting Time Distributions for Processor-Sharing Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1970, v:17, n:1, pp:123-130 [Journal]
  78. Edward G. Coffman Jr., Ravi Sethi
    Instruction Sets for Evaluating Arithmetic Expressions [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:457-478 [Journal]
  79. J. A. Michel, Edward G. Coffman Jr.
    Synthesis of a Feedback Queueing Discipline for Computer Operation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:2, pp:329-339 [Journal]
  80. Brenda S. Baker, Edward G. Coffman Jr.
    A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:4, pp:303-316 [Journal]
  81. Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic
    The Dyadic Stream Merging Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:1, pp:120-137 [Journal]
  82. Edward G. Coffman Jr., M. R. Garey, David S. Johnson
    Bin packing with divisible item sizes. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:4, pp:406-428 [Journal]
  83. John L. Bruno, Edward G. Coffman Jr., D. B. Johnson
    On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:3, pp:319-335 [Journal]
  84. Edward G. Coffman Jr., Frank Thomson Leighton
    A Provably Efficient Algorithm for Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:1, pp:2-35 [Journal]
  85. Leonard Kleinrock, Edward G. Coffman Jr.
    Distribution of Attained Service in Time-Shared Systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1967, v:1, n:3, pp:287-298 [Journal]
  86. Sem C. Borst, Edward G. Coffman Jr., Edgar N. Gilbert, Philip A. Whiting, Peter M. Winkler
    Optimal Carrier Sharing in Wireless TDMA. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2001, v:2, n:2, pp:189-211 [Journal]
  87. Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein
    Flood search under the California Split rule. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:3, pp:199-206 [Journal]
  88. Edward G. Coffman Jr., Predrag R. Jelenkovic
    Performance of the move-to-front algorithm with Markov-modulated request sequences. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:25, n:3, pp:109-118 [Journal]
  89. Edward G. Coffman Jr., Anatolii A. Puhalskii, Martin I. Reiman, Paul E. Wright
    Processor-Shared Buffers with Reneging. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 1994, v:19, n:1, pp:25-46 [Journal]
  90. Edward G. Coffman Jr., Shimon Even
    A Note on Limited Preemption. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:1, pp:3-6 [Journal]
  91. Edward G. Coffman Jr., Edgar N. Gilbert
    Polling and Greedy Servers on a Line. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 1987, v:2, n:2, pp:115-145 [Journal]
  92. Edward G. Coffman Jr., Micha Hofri
    Queueing Models of Secondary Storage Devices. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 1986, v:1, n:2, pp:129-168 [Journal]
  93. 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]
  94. Edward G. Coffman Jr., George S. Lueker
    Approximation Algorithms for Extensible Bin Packing. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:1, pp:63-69 [Journal]
  95. Brenda S. Baker, Edward G. Coffman Jr.
    Insertion and Compaction Algorithms in Sequentially Allocated Storage. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:3, pp:600-609 [Journal]
  96. Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright
    Optimal Stochastic Allocation of Machines Under Waiting-Time Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:332-348 [Journal]
  97. Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright
    A Stochastic Checkpoint Optimization Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:3, pp:650-659 [Journal]
  98. Edward G. Coffman Jr., M. R. Garey, David S. Johnson
    Dynamic Bin Packing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:227-258 [Journal]
  99. Edward G. Coffman Jr., Micha Hofri
    On the Expected Performance of Scanning Disks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:60-70 [Journal]
  100. Edward G. Coffman Jr., Nabil Kahale, Frank Thomson Leighton
    Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1221-1236 [Journal]
  101. Edward G. Coffman Jr., T. T. Kadota, Larry A. Shepp
    A Stochastic Model of Fragmentation in Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:2, pp:416-425 [Journal]
  102. Edward G. Coffman Jr., Joseph Y.-T. Leung
    Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:2, pp:202-217 [Journal]
  103. Edward G. Coffman Jr., J. C. Lagarias
    Algorithms for Packing Squares: A Probabilistic Analysis. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:1, pp:166-185 [Journal]
  104. 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]
  105. Edward G. Coffman Jr., Peter W. Shor
    A Simple Proof of the O(sqrt(n log3/4 n) Upright Matching Bound. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:48-57 [Journal]
  106. Edward G. Coffman Jr., Andreas Constantinides, Dan Rubenstein, Bruce Shepherd, Angelos Stavrou
    Content distribution for seamless transmission. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2004, v:32, n:2, pp:31-32 [Journal]
  107. Edward G. Coffman Jr., Predrag R. Jelenkovic
    Threshold policies for single-resource reservation systems. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2001, v:28, n:4, pp:9-10 [Journal]
  108. Edward G. Coffman Jr., Philippe Robert, Alexander L. Stolyar
    The interval packing process of linear networks. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 1999, v:27, n:3, pp:3-4 [Journal]
  109. Lachlan L. H. Andrew, Yuliy M. Baryshnikov, Edward G. Coffman Jr., Stephen V. Hanly, Jolyon White
    An asymptotically optimal greedy algorithm for large optical burst switching systems. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2003, v:31, n:2, pp:14-16 [Journal]
  110. Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic
    Kelly's LAN model revisited. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2001, v:29, n:3, pp:28-29 [Journal]
  111. Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein
    Flood search under the California split strategy. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2002, v:30, n:3, pp:15-16 [Journal]
  112. Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic
    Self assembly times in DNA-based computation. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2004, v:32, n:2, pp:35-37 [Journal]
  113. Ashok K. Agrawala, Edward G. Coffman Jr., M. R. Garey, Satish K. Tripathi
    A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:4, pp:351-356 [Journal]
  114. A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto
    A Note Extending the Analysis of Two-Head Disk Systems to More General Seek-Time Characteristics. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:11, pp:1584-1586 [Journal]
  115. Brenda S. Baker, Edward G. Coffman Jr.
    Mutual Exclusion Scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:162, n:2, pp:225-243 [Journal]
  116. Edward G. Coffman Jr., Leopold Flatto, Bjorn Poonen, Paul E. Wright
    The Processor Minimization Problem with Independent Waiting-Time Constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:125, n:1, pp:3-16 [Journal]
  117. Jerome Talim, Zhen Liu, Philippe Nain, Edward G. Coffman Jr.
    Optimizing the Number of Robots for Web Search Engines. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2001, v:17, n:1-2, pp:243-264 [Journal]
  118. Fan R. K. Chung, Edward G. Coffman Jr., Martin I. Reiman, Burton Simon
    The forwarding index of communication networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:2, pp:224-232 [Journal]
  119. Edward G. Coffman Jr., Edgar N. Gilbert
    A continuous polling system with constant service times. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:4, pp:584-591 [Journal]
  120. Edward G. Coffman Jr., Shlomo Halfin, Alain Jean-Marie, Philippe Robert
    Stochastic analysis of a slotted FIFO communication channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1555-1566 [Journal]
  121. Edward G. Coffman Jr., B. M. Igelnik, Yakov A. Kogan
    Controlled stochastic model of a communication system with multiple sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:5, pp:1379-1387 [Journal]
  122. Edward G. Coffman Jr., T. T. Kadota, Larry A. Shepp
    On the Asymptotic Optimality of First-Fit Storage Allocation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1985, v:11, n:2, pp:235-239 [Journal]

  123. Computer scheduling methods and their countermeasures. [Citation Graph (, )][DBLP]


  124. Retransmission in OBS networks with fiber delay lines. [Citation Graph (, )][DBLP]


  125. Stochastic Counting in Sensor Networks, or: Noise Is Good. [Citation Graph (, )][DBLP]


  126. Cyclic Cellular Automata: A Tool for Self-Organizing Sleep Scheduling in Sensor Networks. [Citation Graph (, )][DBLP]


  127. High Performance Sleep-Wake Sensor Systems Based on Cyclic Cellular Automata. [Citation Graph (, )][DBLP]


  128. Channel fragmentation in dynamic spectrum access systems: a theoretical study. [Citation Graph (, )][DBLP]


  129. Diffusion approximations for storage processes in computer systems. [Citation Graph (, )][DBLP]


  130. Self-Organizing Sleep-Wake Sensor Systems. [Citation Graph (, )][DBLP]


  131. Design of Local-Rule Protocols for Large-Scale File-Sharing Networks. [Citation Graph (, )][DBLP]


  132. A Classification Scheme for Bin Packing Theory. [Citation Graph (, )][DBLP]


  133. Channel Fragmentation in Dynamic Spectrum Access Systems - a Theoretical Study [Citation Graph (, )][DBLP]


  134. Random-order bin packing. [Citation Graph (, )][DBLP]


Search in 0.164secs, Finished in 0.167secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002