| Publication | Date of Publication | Type |
|---|
Normal-form preemption sequences for an open problem in scheduling theory
Journal of Scheduling | 2018-02-28 | Paper |
An approximate model of processor communication rings under heavy load
Information Processing Letters | 2016-05-26 | Paper |
Scheduling independent tasks to minimize the makespan on identical machines
Probability in the Engineering and Informational Sciences | 2016-05-11 | Paper |
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 - STOC '93 | 2015-05-07 | Paper |
A performance analysis of channel fragmentation in dynamic spectrum access systems
Queueing Systems | 2013-11-25 | Paper |
| scientific article; zbMATH DE number 6118219 (Why is no real title available?) | 2012-12-23 | Paper |
An efficient algorithm for finding ideal schedules
Acta Informatica | 2012-03-23 | Paper |
Self-correcting Self-assembly: Growth Models and the Hammersley Process
DNA Computing | 2009-04-02 | Paper |
Random-order bin packing
Discrete Applied Mathematics | 2008-10-17 | Paper |
On Times to Compute Shapes in 2D Tile Self-assembly
DNA Computing | 2008-04-04 | Paper |
Optimal seamless self-assembly of files in linear networks
Optimization Letters | 2007-11-05 | Paper |
| A classification scheme for bin packing theory | 2007-10-26 | Paper |
Approximation algorithms for extensible bin packing
Journal of Scheduling | 2007-05-15 | Paper |
Gated, Exhaustive, Parallel Service
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
Tandem Conveyor Queues
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
Storage-Limited Queues in Heavy Traffic
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
Stochastic Models of Queue Storage
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
DNA Computing
Lecture Notes in Computer Science | 2006-10-19 | Paper |
Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
Probability in the Engineering and Informational Sciences | 2006-09-22 | Paper |
Space filling and depletion
Journal of Applied Probability | 2005-04-18 | Paper |
Ideal preemptive schedules on two processors
Acta Informatica | 2004-03-11 | Paper |
Packing rectangles in a strip
Acta Informatica | 2003-09-01 | Paper |
| Approximation algorithms for extensible bin packing | 2003-06-19 | Paper |
Optimizing the number of robots for web search engines
Telecommunication Systems | 2003-02-17 | Paper |
Packing random rectangles
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2002-05-02 | Paper |
Perfect packing theorems and the average-case behavior of optimal and online bin packing
SIAM Review | 2002-04-15 | Paper |
Processor shadowing: Maximizing expected throughput in fault-tolerant systems
Mathematics of Operations Research | 2001-11-26 | Paper |
Polling systems in heavy traffic: a Bessel process limit
Mathematics of Operations Research | 2001-11-26 | Paper |
COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS
Probability in the Engineering and Informational Sciences | 2001-10-04 | Paper |
REDIALING POLICIES: OPTIMALITY AND SUCCESS PROBABILITIES
Probability in the Engineering and Informational Sciences | 2001-05-07 | Paper |
The Maximum of a Random Walk and Its Application to Rectangle Packing
Probability in the Engineering and Informational Sciences | 2001-04-09 | Paper |
Bandwidth packing
Algorithmica | 2001-02-11 | Paper |
| scientific article; zbMATH DE number 1512697 (Why is no real title available?) | 2000-10-03 | Paper |
Interval packing: the vacant interval distribution.
The Annals of Applied Probability | 2000-09-04 | Paper |
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
Performance of the move-to-front algorithm with Markov-modulated request sequences
Operations Research Letters | 2000-04-29 | Paper |
| scientific article; zbMATH DE number 1305497 (Why is no real title available?) | 2000-04-25 | Paper |
Optimal robot scheduling for web search engines
Journal of Scheduling | 1999-04-08 | Paper |
Packing random intervals on-line
Algorithmica | 1999-02-02 | Paper |
Optimal fault-tolerant computing on multiprocessor systems
Acta Informatica | 1998-10-01 | Paper |
Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times
SIAM Journal on Computing | 1998-09-20 | Paper |
Mutual exclusion scheduling
Theoretical Computer Science | 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
Communications in Statistics. Stochastic Models | 1996-11-07 | Paper |
Polling systems with zero switchover times: A heavy-traffic averaging principle
The Annals of Applied Probability | 1996-07-22 | Paper |
Queues served by a rotating ring
Communications in Statistics. Stochastic Models | 1996-01-15 | Paper |
Packing random intervals
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1995-08-15 | Paper |
Parking arcs on the circle with applications to one-dimensional communication networks
The Annals of Applied Probability | 1995-05-14 | Paper |
Stochastic analysis of a slotted FIFO communication channel
IEEE Transactions on Information Theory | 1994-10-03 | Paper |
| scientific article; zbMATH DE number 432774 (Why is no real title available?) | 1994-09-19 | Paper |
Scheduling saves in fault-tolerant computations
Acta Informatica | 1994-06-02 | Paper |
Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
Journal of the ACM | 1994-04-17 | Paper |
The processor minimization problem with independent waiting-time constraints
Theoretical Computer Science | 1994-04-05 | Paper |
Processor-shared buffers with reneging
Performance Evaluation | 1994-03-22 | Paper |
A selection-replacement process on the circle
The Annals of Applied Probability | 1994-01-30 | Paper |
A Stochastic Checkpoint Optimization Problem
SIAM Journal on Computing | 1993-09-01 | Paper |
Stochastic Machine Minimization with Constant Service Times
Mathematics of Operations Research | 1993-08-05 | Paper |
| scientific article; zbMATH DE number 176070 (Why is no real title available?) | 1993-05-18 | Paper |
Optimal Stochastic Allocation of Machines under Waiting-Time Constraints
SIAM Journal on Computing | 1993-05-17 | Paper |
The Gated Infinite-Server Queue: Uniform Service Times
SIAM Journal on Applied Mathematics | 1993-05-16 | Paper |
Packings in two dimensions: Asymptotic average-case analysis of algorithms
Algorithmica | 1993-05-16 | Paper |
Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
Operations Research | 1993-04-01 | Paper |
Service by a Queue and a Cart
Management Science | 1993-01-16 | Paper |
Paths through a maze of rectangles
Networks | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 52589 (Why is no real title available?) | 1992-09-18 | Paper |
Scheduling Checks and Saves
ORSA Journal on Computing | 1992-08-13 | Paper |
On the Optimal Stochastic Scheduling of Out-Forests
Operations Research | 1992-06-28 | Paper |
A distributed clustering process
Journal of Applied Probability | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 19791 (Why is no real title available?) | 1992-06-26 | Paper |
Height distributions in data communication buffers with locking protocols
Communications in Statistics. Stochastic Models | 1992-06-26 | Paper |
Controlled stochastic model of a communication system with multiple sources
IEEE Transactions on Information Theory | 1992-06-26 | Paper |
A Simple Proof of the $O( \sqrt{n} \log^{3 / 4} n )$ Upright Matching Bound
SIAM Journal on Discrete Mathematics | 1991-01-01 | Paper |
Optimal strategies for scheduling checkpoints and preventive maintenance
IEEE Transactions on Reliability | 1990-01-01 | Paper |
Average-case analysis of cutting and packing in two dimensions
European Journal of Operational Research | 1990-01-01 | Paper |
Batch sizing and job sequencing on a single machine
Annals of Operations Research | 1990-01-01 | Paper |
First-fit allocation of queues: Tight probabilistic bounds on wasted space
Stochastic Processes and their Applications | 1990-01-01 | Paper |
Largest-first sequential selection with a sum constraint
Operations Research Letters | 1990-01-01 | Paper |
Optimal Scheduling of Products with Two Subassemblies on a Single Machine
Operations Research | 1989-01-01 | Paper |
Algorithms for Packing Squares: A Probabilistic Analysis
SIAM Journal on Computing | 1989-01-01 | Paper |
A provably efficient algorithm for dynamic storage allocation
Journal of Computer and System Sciences | 1989-01-01 | Paper |
Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
Management Science | 1988-01-01 | Paper |
Analysis of conveyor queue in a flexible manufacturing system
European Journal of Operational Research | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4124976 (Why is no real title available?) | 1987-01-01 | Paper |
Polling and greedy servers on a line
Queueing Systems | 1987-01-01 | Paper |
Bin packing with divisible item sizes
Journal of Complexity | 1987-01-01 | Paper |
The forwarding index of communication networks
IEEE Transactions on Information Theory | 1987-01-01 | Paper |
Optimal selection of stochastic intervals under a sum constraint
Advances in Applied Probability | 1987-01-01 | Paper |
Minimizing expected makespans on uniform processor systems
Advances in Applied Probability | 1987-01-01 | Paper |
Queueing models of secondary storage devices
Queueing Systems | 1986-01-01 | Paper |
Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem
Communications in Statistics. Stochastic Models | 1986-01-01 | Paper |
Sequencing two servers on a sphere
Communications in Statistics. Stochastic Models | 1985-01-01 | Paper |
Scheduling File Transfers
SIAM Journal on Computing | 1985-01-01 | Paper |
On the Expected Relative Performance of List Scheduling
Operations Research | 1985-01-01 | Paper |
A Stochastic Model of Fragmentation in Dynamic Storage Allocation
SIAM Journal on Computing | 1985-01-01 | Paper |
Sequencing Problems in Two-Server Systems
Mathematics of Operations Research | 1985-01-01 | Paper |
Algorithms for resolving conflicts in dynamic storage allocation
Journal of the ACM | 1985-01-01 | Paper |
Dynamic, first-fit packings in two or more dimensions
Information and Control | 1984-01-01 | Paper |
Insertion and Compaction Algorithms in Sequentially Allocated Storage
SIAM Journal on Computing | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3890754 (Why is no real title available?) | 1984-01-01 | Paper |
A performance guarantee for the greedy set-partitioning algorithm
Acta Informatica | 1984-01-01 | Paper |
Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
Mathematics of Operations Research | 1984-01-01 | Paper |
A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors
Mathematics of Operations Research | 1984-01-01 | Paper |
A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
IEEE Transactions on Computers | 1984-01-01 | Paper |
Optimum Head Separation in a Disk System with Two Read/Write Heads
Journal of the ACM | 1984-01-01 | Paper |
Instruction Sets for Evaluating Arithmetic Expressions
Journal of the ACM | 1983-01-01 | Paper |
Dynamic Bin Packing
SIAM Journal on Computing | 1983-01-01 | Paper |
Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
An Introduction to Combinatorial Models of Dynamic Storage Allocation
SIAM Review | 1983-01-01 | Paper |
A two-dimensional bin-packing model of preemptive, FIFO storage allocation
Journal of Algorithms | 1982-01-01 | Paper |
On the Expected Performance of Scanning Disks
SIAM Journal on Computing | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3768966 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3778732 (Why is no real title available?) | 1982-01-01 | Paper |
An analysis of parallel-read sequential-write systems
Performance Evaluation | 1981-01-01 | Paper |
A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
SIAM Journal on Algebraic Discrete Methods | 1981-01-01 | Paper |
Optimization of the Number of Copies in a Distributed Data Base
IEEE Transactions on Software Engineering | 1981-01-01 | Paper |
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
SIAM Journal on Computing | 1980-01-01 | Paper |
Orthogonal Packings in Two Dimensions
SIAM Journal on Computing | 1980-01-01 | Paper |
A Characterization of Waiting Time Performance Realizable by Single-Server Queues
Operations Research | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3621114 (Why is no real title available?) | 1979-01-01 | Paper |
Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
SIAM Journal on Computing | 1979-01-01 | Paper |
An efficient algorithm for allocating paged, drum-like storage
BIT Numerical Mathematics | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3619595 (Why is no real title available?) | 1978-01-01 | Paper |
An Application of Bin-Packing to Multiprocessor Scheduling
SIAM Journal on Computing | 1978-01-01 | Paper |
Bin packing: Maximizing the number of pieces packed
Acta Informatica | 1978-01-01 | Paper |
A Class of FIFO Queues Arising in Computer Systems
Operations Research | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3566166 (Why is no real title available?) | 1977-01-01 | Paper |
Flow-Time Sequencing of Independent Tasks on Multiple Processors’*
INFOR: Information Systems and Operational Research | 1977-01-01 | Paper |
On batch scheduling of jobs with stochastic service times and cost structures on a single server
Journal of Computer and System Sciences | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3521517 (Why is no real title available?) | 1976-01-01 | Paper |
Algorithms minimizing mean flow time: Schedule-length properties
Acta Informatica | 1976-01-01 | Paper |
Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
Journal of the ACM | 1976-01-01 | Paper |
Anaysis of interleaved memory systems using blockage buffers
Communications of the ACM | 1975-01-01 | Paper |
Synthesis of a Feedback Queueing Discipline for Computer Operation
Journal of the ACM | 1974-01-01 | Paper |
A Problem in Multiprogrammed Storage Allocation
IEEE Transactions on Computers | 1974-01-01 | Paper |
Scheduling independent tasks to reduce mean finishing time
Communications of the ACM | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3466531 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3426883 (Why is no real title available?) | 1973-01-01 | Paper |
A Combinatorial Problem Related to Interleaved Memory Systems
Journal of the ACM | 1973-01-01 | Paper |
A study of storage partitioning using a mathematical model of locality
Communications of the ACM | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3387114 (Why is no real title available?) | 1972-01-01 | Paper |
Analysis of Scanning Policies for Reducing Disk Seek Times
SIAM Journal on Computing | 1972-01-01 | Paper |
Performance predictions for extended paged memories
Acta Informatica | 1971-01-01 | Paper |
On the Performance of Interleaved Memories with Multiple-Word Bandwidths
IEEE Transactions on Computers | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3418612 (Why is no real title available?) | 1971-01-01 | Paper |
Optimal scheduling for two-processor systems
Acta Informatica | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3359777 (Why is no real title available?) | 1971-01-01 | Paper |
On file structuring for non-uniform access frequencies
BIT | 1970-01-01 | Paper |
Waiting Time Distributions for Processor-Sharing Systems
Journal of the ACM | 1970-01-01 | Paper |
File structures using hashing functions
Communications of the ACM | 1970-01-01 | Paper |
Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Journal of the ACM | 1970-01-01 | Paper |
Markov chain analyses of multiprogrammed computer systems
Naval Research Logistics Quarterly | 1969-01-01 | Paper |
Optimal Preemptive Scheduling on Two-Processor Systems
IEEE Transactions on Computers | 1969-01-01 | Paper |
Organizing matrices and matrix operations for paged memory systems
Communications of the ACM | 1969-01-01 | Paper |
Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System
Journal of the ACM | 1969-01-01 | Paper |
A Random-Walk Model of a Queue Storage Problem
IEEE Transactions on Computers | 1968-01-01 | Paper |
Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping
Journal of the ACM | 1968-01-01 | Paper |
On the Motion of an Unbounded, Markov Queue in Random Access Storage
IEEE Transactions on Computers | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3326077 (Why is no real title available?) | 1968-01-01 | Paper |
Feedback Queueing Models for Time-Shared Systems
Journal of the ACM | 1968-01-01 | Paper |
Distribution of attained service in time-shared systems
Journal of Computer and System Sciences | 1967-01-01 | Paper |
Interarrival statistics for time sharing systems
Communications of the ACM | 1966-01-01 | Paper |
