Asynchronous Control Networks - John L. Bruno; Stanley M. Altman (SWAT, 1969)

Nearly Optimal Binary Search Trees. - John L. Bruno; Edward G. Coffman Jr. (IFIP Congress (1), 1971)

A Theory of Asynchronous Control Networks. - John L. Bruno; Stanley M. Altman (IEEE Trans. Computers, 1971)

Consistency of Synchronization Nets using P and V Operations - John L. Bruno; Edward G. Coffman Jr.; W. H. Hosken (SWAT, 1972)

The Expression of Algorithms by Charts. - John L. Bruno; Kenneth Steiglitz (J. ACM, 1972)

Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract). - John L. Bruno; Edward G. Coffman Jr.; Ravi Sethi (SOSP, 1973)

Algorithms for Minimizing Mean Flow Time. - John L. Bruno; Edward G. Coffman Jr.; Ravi Sethi (IFIP Congress, 1974)

Scheduling Independent Tasks to Reduce Mean Finishing Time. - John L. Bruno; Edward G. Coffman Jr.; Ravi Sethi (Commun. ACM, 1974)

The Generation of Optimal Code for Stack Machines. - John L. Bruno; T. Lassagne (J. ACM, 1975)

On Scheduling Chains of Jobs on One Processor with Limited Preemption. - John L. Bruno; Micha Hofri (SIAM J. Comput., 1975)

Task Sequencing in a Batch Environment with Setup Times. - John L. Bruno; Ravi Sethi (Performance, 1976)

Sequencing Jobs with Stochastic Task Structures on a Single Machine. - John L. Bruno (J. ACM, 1976)

Code Generation for a One-Register Machine. - John L. Bruno; Ravi Sethi (J. ACM, 1976)

On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server. - John L. Bruno; Edward G. Coffman Jr.; D. B. Johnson (J. Comput. Syst. Sci., 1976)

Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs. - John L. Bruno; Peter J. Downey (SIAM J. Comput., 1978)

Deterministic Scheduling with Pipelined Processors. - John L. Bruno; John W. Jones III; Kimming So (IEEE Trans. Computers, 1980)

Performance Analysis of a Distributed File Cache. - Gautam Barua; John L. Bruno; Peter J. Downey (Berkeley Workshop, 1981)

Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan. - John L. Bruno; Peter J. Downey; Greg N. Frederickson (J. ACM, 1981)

On Scheduling Tasks with Exponential Service Times and In-Tree Precedence Constraints. - John L. Bruno (Acta Informatica, 1985)

Probabilistic Bounds for Dual Bin-Packing. - John L. Bruno; Peter J. Downey (Acta Informatica, 1985)

Probabilistic Bounds on the Performance of List Scheduling. - John L. Bruno; Peter J. Downey (SIAM J. Comput., 1986)

Implementing the beam and warming method on the hypercube. - John L. Bruno; Peter R. Cappello (C³P, 1988)

Single Machine Flow-Time Scheduling With a Single Breakdown. - Igal Adiri; John L. Bruno; Esther Frostig; A. H. G. Rinnooy Kan (Acta Informatica, 1989)

A concurrency Mechanism for Sequential Eiffel. - Murat Karaorman; John L. Bruno (TOOLS (8), 1992)

Introducing Concurrency to a Sequential Language. - Murat Karaorman; John L. Bruno (Commun. ACM, 1993)

Relative Serializbility: An Approach for Relaxing the Atomicity of Transactions. - Divyakant Agrawal; John L. Bruno; Amr El Abbadi; Vasudha Krishnaswamy (PODS, 1994)

Managing Concurrent Activities in Collaborative Environments. - Divyakant Agrawal; John L. Bruno; Amr El Abbadi; Vasudha Krishnaswamy (CoopIS, 1995)

On the Complexity of Concurrency Control Using Semantic Information. - Vasudha Krishnaswamy; John L. Bruno (Acta Informatica, 1995)

Testing Concurrent Data Structures (Abstract). - John L. Bruno; Phillip B. Gibbons; Steven Phillips (PODC, 1996)

Move-to-Rear List Scheduling: A New Scheduling Algorithm for Providing QoS Guarantees. - John L. Bruno; Eran Gabber; Banu Özden; Abraham Silberschatz (ACM Multimedia, 1997)

Optimal Fault-Tolerant Computing on Multiprocessor Systems. - John L. Bruno; Edward G. Coffman Jr. (Acta Informatica, 1997)

Relative Serializability: An Approach for Relaxing the Atomicity of Transactions. - Vasudha Krishnaswamy; Divyakant Agrawal; John L. Bruno; Amr El Abbadi (J. Comput. Syst. Sci., 1997)

The Eclipse Operating System: Providing Quality of Service via Reservation Domains. - John L. Bruno; Eran Gabber; Banu Özden; Avi Silberschatz (USENIX ATC, 1998)

Pebble: A Component-based Operating System for Embedded Applications. - Eran Gabber; Christopher Small 001; John L. Bruno; José Carlos Brustoloni; Avi Silberschatz (USENIX Workshop on Embedded Systems, 1999)

Disk Scheduling with Quality of Service Guarantees. - John L. Bruno; José Carlos Brustoloni; Eran Gabber; Banu Özden; Abraham Silberschatz (ICMCS, Vol. 2, 1999)

jContractor: A Reflective Java Library to Support Design by Contract. - Murat Karaorman; Urs Hölzle; John L. Bruno (Reflection, 1999)

Post-Mortem Black-Box Correctness Tests for Basic Parallel Data Structures. - Phillip B. Gibbons; John L. Bruno; Steven Phillips (SPAA, 1999)

Retrofitting Quality of Service into a Time-Sharing Operating System. - John L. Bruno; José Carlos Brustoloni; Eran Gabber; Banu Özden; Abraham Silberschatz (USENIX ATC, General Track, 1999)

The Pebble Component-Based Operating System. - Eran Gabber; Christopher Small 001; John L. Bruno; José Carlos Brustoloni; Abraham Silberschatz (USENIX ATC, General Track, 1999)

Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems. - John L. Bruno; Edward G. Coffman Jr.; Jeffrey C. Lagarias; Tom J. Richardson; Peter W. Shor (Math. Oper. Res., 1999)

Black-Box Correctness Tests for Basic Parallel Data Structures. - Phillip B. Gibbons; John L. Bruno; Steven Phillips (Theory Comput. Syst., 2002)