The following pages link to John L. Bruno (Q1849603):
Displaying 37 items.
- On scheduling tasks with exponential service times and in-tree precedence constraints (Q1060842) (← links)
- Probabilistic bounds for dual bin-packing (Q1060845) (← links)
- Single machine flow-time scheduling with a single breakdown (Q1111018) (← links)
- The principal minors of a matroid (Q1221769) (← links)
- On batch scheduling of jobs with stochastic service times and cost structures on a single server (Q1227237) (← links)
- (Q1376413) (redirect page) (← links)
- (Q1060841) (redirect page) (← links)
- (Q1227235) (redirect page) (← links)
- (Q1060841) (redirect page) (← links)
- Relative serializability: An approach for relaxing the atomicity of transactions (Q1376414) (← links)
- Optimal fault-tolerant computing on multiprocessor systems (Q1386442) (← links)
- Black-box correctness tests for basic parallel data structures (Q1849604) (← links)
- On the complexity of concurrency control using semantic information (Q1892718) (← links)
- Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems (Q2757599) (← links)
- Scheduling Independent Tasks to Minimize the Makespan on Identical Machines (Q2805367) (← links)
- Probabilistic Bounds on the Performance of List Scheduling (Q3727378) (← links)
- Deterministic Scheduling with Pipelined Processors (Q3868759) (← links)
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan (Q3902467) (← links)
- (Q3949970) (← links)
- (Q4051615) (← links)
- The Generation of Optimal Code for Stack Machines (Q4066572) (← links)
- Generalized networks: Networks embedded on a matroid, part I (Q4088732) (← links)
- Code Generation for a One-Register Machine (Q4102724) (← links)
- On Scheduling Chains of Jobs on One Processor with Limited Preemption (Q4102900) (← links)
- Generalized networks: Networks embedded on a matroid, part II (Q4110934) (← links)
- (Q4131658) (← links)
- Sequencing Jobs with Stochastic Task Structures on a Single Machine (Q4143002) (← links)
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs (Q4167580) (← links)
- (Q4193237) (← links)
- Scheduling independent tasks to reduce mean finishing time (Q4769981) (← links)
- Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines (Q5488538) (← links)
- On file structuring for non-uniform access frequencies (Q5615725) (← links)
- A Theory of Asynchronous Control Networks (Q5632462) (← links)
- The Expression of Algorithms by Charts (Q5653551) (← links)
- (Q5656587) (← links)
- PRINCIPAL PARTITION AND PRINCIPAL MINORS OF A MATROID, WITH APPLICATIONS† (Q5668820) (← links)
- (Q5674393) (← links)
- (Q5674402) (← links)
- A new derivation of Frisch's algorithm for calculating vertex-pair connectivity (Q5677065) (← links)
- (Q5685627) (← links)
