| Publication | Date of Publication | Type |
|---|
Scheduling independent tasks to minimize the makespan on identical machines
Probability in the Engineering and Informational Sciences | 2016-05-11 | Paper |
Pathological and Omega-transitive Representations of Free Groups
(available as arXiv preprint) | 2012-04-25 | 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 |
Black-box correctness tests for basic parallel data structures
Theory of Computing Systems | 2002-12-01 | Paper |
Processor shadowing: Maximizing expected throughput in fault-tolerant systems
Mathematics of Operations Research | 2001-11-26 | Paper |
Optimal fault-tolerant computing on multiprocessor systems
Acta Informatica | 1998-10-01 | Paper |
Relative serializability: An approach for relaxing the atomicity of transactions
Journal of Computer and System Sciences | 1998-06-01 | Paper |
On the complexity of concurrency control using semantic information
Acta Informatica | 1995-11-27 | Paper |
Single machine flow-time scheduling with a single breakdown
Acta Informatica | 1989-01-01 | Paper |
Probabilistic Bounds on the Performance of List Scheduling
SIAM Journal on Computing | 1986-01-01 | Paper |
Probabilistic bounds for dual bin-packing
Acta Informatica | 1985-01-01 | Paper |
On scheduling tasks with exponential service times and in-tree precedence constraints
Acta Informatica | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3768968 (Why is no real title available?) | 1982-01-01 | Paper |
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
Journal of the ACM | 1981-01-01 | Paper |
Deterministic Scheduling with Pipelined Processors
IEEE Transactions on Computers | 1980-01-01 | Paper |
Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
SIAM Journal on Computing | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3632203 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3560747 (Why is no real title available?) | 1977-01-01 | Paper |
Generalized networks: Networks embedded on a matroid, part I
Networks | 1976-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 |
Generalized networks: Networks embedded on a matroid, part II
Networks | 1976-01-01 | Paper |
Code Generation for a One-Register Machine
Journal of the ACM | 1976-01-01 | Paper |
Sequencing Jobs with Stochastic Task Structures on a Single Machine
Journal of the ACM | 1976-01-01 | Paper |
On Scheduling Chains of Jobs on One Processor with Limited Preemption
SIAM Journal on Computing | 1975-01-01 | Paper |
The Generation of Optimal Code for Stack Machines
Journal of the ACM | 1975-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 |
The Expression of Algorithms by Charts
Journal of the ACM | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3387114 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3408901 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3423548 (Why is no real title available?) | 1972-01-01 | Paper |
The principal minors of a matroid
Linear Algebra and its Applications | 1971-01-01 | Paper |
A Theory of Asynchronous Control Networks
IEEE Transactions on Computers | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3408892 (Why is no real title available?) | 1971-01-01 | Paper |
A new derivation of Frisch's algorithm for calculating vertex-pair connectivity
BIT | 1971-01-01 | Paper |
PRINCIPAL PARTITION AND PRINCIPAL MINORS OF A MATROID, WITH APPLICATIONS†
Annals of the New York Academy of Sciences | 1970-01-01 | Paper |
On file structuring for non-uniform access frequencies
BIT | 1970-01-01 | Paper |
