| Publication | Date of Publication | Type |
|---|
| Normal-form preemption sequences for an open problem in scheduling theory | 2018-02-28 | Paper |
| An approximate model of processor communication rings under heavy load | 2016-05-26 | Paper |
| Scheduling Independent Tasks to Minimize the Makespan on Identical Machines | 2016-05-11 | Paper |
| Markov chains, computer proofs, and average-case analysis of best fit bin packing | 2015-05-07 | Paper |
| A performance analysis of channel fragmentation in dynamic spectrum access systems | 2013-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3145801 | 2012-12-23 | Paper |
| An efficient algorithm for finding ideal schedules | 2012-03-23 | Paper |
| Self-correcting Self-assembly: Growth Models and the Hammersley Process | 2009-04-02 | Paper |
| Random-order bin packing | 2008-10-17 | Paper |
| On Times to Compute Shapes in 2D Tile Self-assembly | 2008-04-04 | Paper |
| Optimal seamless self-assembly of files in linear networks | 2007-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5422555 | 2007-10-26 | Paper |
| Approximation algorithms for extensible bin packing | 2007-05-15 | Paper |
| Stochastic Models of Queue Storage | 2007-01-19 | Paper |
| Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines | 2007-01-19 | Paper |
| Tandem Conveyor Queues | 2007-01-19 | Paper |
| Storage-Limited Queues in Heavy Traffic | 2007-01-19 | Paper |
| Gated, Exhaustive, Parallel Service | 2007-01-19 | Paper |
| DNA Computing | 2006-10-19 | Paper |
| Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines | 2006-09-22 | Paper |
| Space filling and depletion | 2005-04-18 | Paper |
| Ideal preemptive schedules on two processors | 2004-03-11 | Paper |
| Packing rectangles in a strip | 2003-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768352 | 2003-06-19 | Paper |
| Optimizing the number of robots for web search engines | 2003-02-17 | Paper |
| Packing random rectangles | 2002-05-02 | Paper |
| Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing | 2002-04-15 | Paper |
| Polling Systems in Heavy Traffic: A Bessel Process Limit | 2001-11-26 | Paper |
| Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems | 2001-11-26 | Paper |
| COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS | 2001-10-04 | Paper |
| REDIALING POLICIES: OPTIMALITY AND SUCCESS PROBABILITIES | 2001-05-07 | Paper |
| The Maximum of a Random Walk and Its Application to Rectangle Packing | 2001-04-09 | Paper |
| Bandwidth packing | 2001-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508386 | 2000-10-03 | Paper |
| Interval packing: the vacant interval distribution. | 2000-09-04 | Paper |
| Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings | 2000-07-20 | Paper |
| Performance of the move-to-front algorithm with Markov-modulated request sequences | 2000-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252387 | 2000-04-25 | Paper |
| Optimal robot scheduling for web search engines | 1999-04-08 | Paper |
| Packing random intervals on-line | 1999-02-02 | Paper |
| Optimal fault-tolerant computing on multiprocessor systems | 1998-10-01 | Paper |
| Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times | 1998-09-20 | Paper |
| Mutual exclusion scheduling | 1997-09-10 | Paper |
| Bin packing with discrete item sizes, part II: Tight bounds on First Fit | 1997-03-05 | Paper |
| Stochastic limit laws for schedule makespans | 1996-11-07 | Paper |
| Polling systems with zero switchover times: A heavy-traffic averaging principle | 1996-07-22 | Paper |
| Queues served by a rotating ring | 1996-01-15 | Paper |
| Packing random intervals | 1995-08-15 | Paper |
| Parking arcs on the circle with applications to one-dimensional communication networks | 1995-05-14 | Paper |
| Stochastic analysis of a slotted FIFO communication channel | 1994-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138904 | 1994-09-19 | Paper |
| Scheduling saves in fault-tolerant computations | 1994-06-02 | Paper |
| Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling | 1994-04-17 | Paper |
| The processor minimization problem with independent waiting-time constraints | 1994-04-05 | Paper |
| Processor-shared buffers with reneging | 1994-03-22 | Paper |
| A selection-replacement process on the circle | 1994-01-30 | Paper |
| A Stochastic Checkpoint Optimization Problem | 1993-09-01 | Paper |
| Stochastic Machine Minimization with Constant Service Times | 1993-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035170 | 1993-05-18 | Paper |
| Optimal Stochastic Allocation of Machines under Waiting-Time Constraints | 1993-05-17 | Paper |
| The Gated Infinite-Server Queue: Uniform Service Times | 1993-05-16 | Paper |
| Packings in two dimensions: Asymptotic average-case analysis of algorithms | 1993-05-16 | Paper |
| Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands | 1993-04-01 | Paper |
| Service by a Queue and a Cart | 1993-01-16 | Paper |
| Paths through a maze of rectangles | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4002885 | 1992-09-18 | Paper |
| Scheduling Checks and Saves | 1992-08-13 | Paper |
| A distributed clustering process | 1992-06-28 | Paper |
| On the Optimal Stochastic Scheduling of Out-Forests | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3979293 | 1992-06-26 | Paper |
| Controlled stochastic model of a communication system with multiple sources | 1992-06-26 | Paper |
| Height distributions in data communication buffers with locking protocols | 1992-06-26 | Paper |
| A Simple Proof of the $O( \sqrt{n} \log^{3 / 4} n )$ Upright Matching Bound | 1991-01-01 | Paper |
| Average-case analysis of cutting and packing in two dimensions | 1990-01-01 | Paper |
| Batch sizing and job sequencing on a single machine | 1990-01-01 | Paper |
| Largest-first sequential selection with a sum constraint | 1990-01-01 | Paper |
| First-fit allocation of queues: Tight probabilistic bounds on wasted space | 1990-01-01 | Paper |
| Optimal strategies for scheduling checkpoints and preventive maintenance | 1990-01-01 | Paper |
| A provably efficient algorithm for dynamic storage allocation | 1989-01-01 | Paper |
| Algorithms for Packing Squares: A Probabilistic Analysis | 1989-01-01 | Paper |
| Optimal Scheduling of Products with Two Subassemblies on a Single Machine | 1989-01-01 | Paper |
| Analysis of conveyor queue in a flexible manufacturing system | 1988-01-01 | Paper |
| Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4205064 | 1987-01-01 | Paper |
| Optimal selection of stochastic intervals under a sum constraint | 1987-01-01 | Paper |
| Bin packing with divisible item sizes | 1987-01-01 | Paper |
| Polling and greedy servers on a line | 1987-01-01 | Paper |
| The forwarding index of communication networks | 1987-01-01 | Paper |
| Minimizing expected makespans on uniform processor systems | 1987-01-01 | Paper |
| Queueing models of secondary storage devices | 1986-01-01 | Paper |
| Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem | 1986-01-01 | Paper |
| Sequencing two servers on a sphere | 1985-01-01 | Paper |
| On the Expected Relative Performance of List Scheduling | 1985-01-01 | Paper |
| Sequencing Problems in Two-Server Systems | 1985-01-01 | Paper |
| Scheduling File Transfers | 1985-01-01 | Paper |
| A Stochastic Model of Fragmentation in Dynamic Storage Allocation | 1985-01-01 | Paper |
| Algorithms for resolving conflicts in dynamic storage allocation | 1985-01-01 | Paper |
| A performance guarantee for the greedy set-partitioning algorithm | 1984-01-01 | Paper |
| A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors | 1984-01-01 | Paper |
| A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors | 1984-01-01 | Paper |
| Insertion and Compaction Algorithms in Sequentially Allocated Storage | 1984-01-01 | Paper |
| Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347319 | 1984-01-01 | Paper |
| Dynamic, first-fit packings in two or more dimensions | 1984-01-01 | Paper |
| Optimum Head Separation in a Disk System with Two Read/Write Heads | 1984-01-01 | Paper |
| Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle | 1983-01-01 | Paper |
| Dynamic Bin Packing | 1983-01-01 | Paper |
| An Introduction to Combinatorial Models of Dynamic Storage Allocation | 1983-01-01 | Paper |
| Instruction Sets for Evaluating Arithmetic Expressions | 1983-01-01 | Paper |
| On the Expected Performance of Scanning Disks | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3949968 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3957935 | 1982-01-01 | Paper |
| A two-dimensional bin-packing model of preemptive, FIFO storage allocation | 1982-01-01 | Paper |
| Optimization of the Number of Copies in a Distributed Data Base | 1981-01-01 | Paper |
| An analysis of parallel-read sequential-write systems | 1981-01-01 | Paper |
| A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing | 1981-01-01 | Paper |
| Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms | 1980-01-01 | Paper |
| Orthogonal Packings in Two Dimensions | 1980-01-01 | Paper |
| A Characterization of Waiting Time Performance Realizable by Single-Server Queues | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4184311 | 1979-01-01 | Paper |
| Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation | 1979-01-01 | Paper |
| An Application of Bin-Packing to Multiprocessor Scheduling | 1978-01-01 | Paper |
| An efficient algorithm for allocating paged, drum-like storage | 1978-01-01 | Paper |
| A Class of FIFO Queues Arising in Computer Systems | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182227 | 1978-01-01 | Paper |
| Bin packing: Maximizing the number of pieces packed | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138132 | 1977-01-01 | Paper |
| Flow-Time Sequencing of Independent Tasks on Multiple Processors’* | 1977-01-01 | Paper |
| Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4099211 | 1976-01-01 | Paper |
| Algorithms minimizing mean flow time: Schedule-length properties | 1976-01-01 | Paper |
| On batch scheduling of jobs with stochastic service times and cost structures on a single server | 1976-01-01 | Paper |
| Anaysis of interleaved memory systems using blockage buffers | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4051615 | 1974-01-01 | Paper |
| Synthesis of a Feedback Queueing Discipline for Computer Operation | 1974-01-01 | Paper |
| Scheduling independent tasks to reduce mean finishing time | 1974-01-01 | Paper |
| A Problem in Multiprogrammed Storage Allocation | 1974-01-01 | Paper |
| A Combinatorial Problem Related to Interleaved Memory Systems | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3214414 | 1973-01-01 | Paper |
| A study of storage partitioning using a mathematical model of locality | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5656587 | 1972-01-01 | Paper |
| Analysis of Scanning Policies for Reducing Disk Seek Times | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5633643 | 1971-01-01 | Paper |
| On the Performance of Interleaved Memories with Multiple-Word Bandwidths | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5681523 | 1971-01-01 | Paper |
| Performance predictions for extended paged memories | 1971-01-01 | Paper |
| Optimal scheduling for two-processor systems | 1971-01-01 | Paper |
| Waiting Time Distributions for Processor-Sharing Systems | 1970-01-01 | Paper |
| On file structuring for non-uniform access frequencies | 1970-01-01 | Paper |
| File structures using hashing functions | 1970-01-01 | Paper |
| Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems | 1970-01-01 | Paper |
| Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System | 1969-01-01 | Paper |
| Markov chain analyses of multiprogrammed computer systems | 1969-01-01 | Paper |
| Organizing matrices and matrix operations for paged memory systems | 1969-01-01 | Paper |
| Optimal Preemptive Scheduling on Two-Processor Systems | 1969-01-01 | Paper |
| A Random-Walk Model of a Queue Storage Problem | 1968-01-01 | Paper |
| Feedback Queueing Models for Time-Shared Systems | 1968-01-01 | Paper |
| On the Motion of an Unbounded, Markov Queue in Random Access Storage | 1968-01-01 | Paper |
| Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5604886 | 1968-01-01 | Paper |
| Distribution of attained service in time-shared systems | 1967-01-01 | Paper |
| Interarrival statistics for time sharing systems | 1966-01-01 | Paper |
