Linear codes for single error correction in symmetric and asymmetric computational processes. - Arthur J. Bernstein; Wan H. Kim (IRE Trans. Inf. Theory, 1962)

Single- and double-adjacent error-correcting codes for arithmetic units (Corresp.). - Arthur J. Bernstein; Wan H. Kim (IEEE Trans. Inf. Theory, 1963)

Reducing variable dependency in combinational circuits - Arthur J. Bernstein (SWCT, 1964)

On the minimum stage realization of switching functions using logic gates with limited fan-in - G. L. Hicks; Arthur J. Bernstein (SWCT, 1964)

Analysis of Programs for Parallel Processing. - Arthur J. Bernstein (IEEE Trans. Electron. Comput., 1966)

Encoding of analog signals for binary symmetric channels. - Arthur J. Bernstein; Kenneth Steiglitz; John E. Hopcroft (IEEE Trans. Inf. Theory, 1966)

A class of binary recurrent codes with limited error propagation. - John P. Robinson; Arthur J. Bernstein (IEEE Trans. Inf. Theory, 1967)

Process control and communication. - Arthur J. Bernstein; G. D. Detlefsen; R. H. Kerr (SOSP, 1969)

Synchronization in a parallel-accessed data base. - Arie Shoshani; Arthur J. Bernstein (Commun. ACM, 1969)

Comment on the working set model for program behavior. - Arthur J. Bernstein (Commun. ACM, 1970)

A Programmer Training Project. - Arthur J. Bernstein (Commun. ACM, 1971)

A Policy-Driven Scheduler for a Time-Sharing System. - Arthur J. Bernstein; J. C. Sharp (Commun. ACM, 1971)

Interprocess communication facilities for network operating systems. - Eralp A. Akkoyunlu; Arthur J. Bernstein; Richard E. Schantz (Computer, 1974)

Analysis of a Feedback Scheduler. - Yap Siong Chua; Arthur J. Bernstein (SIAM J. Comput., 1974)

A Computer Architecture for Level Structured Systems. - Arthur J. Bernstein; Paul Siegel (IEEE Trans. Computers, 1975)

Extending Concurrent Pascal to Allow Dynamic Resource Management (Abstract). - Abraham Silberschatz; Richard B. Kieburtz; Arthur J. Bernstein (ICSE, 1976)

Synthesizing a Response Function with a Feedback Scheduling Algorithm. - Arthur J. Bernstein (SIAM J. Comput., 1976)

Extending Concurrent Pascal to Allow Dynamic Resource Management. - Abraham Silberschatz; Richard B. Kieburtz; Arthur J. Bernstein (IEEE Trans. Software Eng., 1977)

On Language Restrictions to Ensure Deterministic Behavior in Concurrent Systems. - Arthur J. Bernstein; Fred B. Schneider (Jerusalem Conference on Information Technology, 1978)

Some New Transitions In Hierarchical Level Structures. - Kattamuri Ekanadham; Arthur J. Bernstein (ACM SIGOPS Oper. Syst. Rev., 1978)

Scheduling in Concurrent Pascal. - Fred B. Schneider; Arthur J. Bernstein (ACM SIGOPS Oper. Syst. Rev., 1978)

Conditions for the Equivalence of Synchronous and Asynchronous Systems. - Eralp A. Akkoyunlu; Arthur J. Bernstein; Fred B. Schneider; Abraham Silberschatz (IEEE Trans. Software Eng., 1978)

Conditional Capabilities. - Kattamuri Ekanadham; Arthur J. Bernstein (IEEE Trans. Software Eng., 1979)

Output Guards and Nondeterminism in "Communicating Sequential Processes". - Arthur J. Bernstein (ACM Trans. Program. Lang. Syst., 1980)

Proving Real-Time Properties of Programs with Temporal Logic. - Arthur J. Bernstein; Paul K. Harter Jr. (SOSP, 1981)

A Modula Based Language Supporting Hierarchical Development and Verification. - Arthur J. Bernstein; J. Robert Ensor (Softw. Pract. Exp., 1981)

Distributed Communication via Global Buffer. - David Gelernter; Arthur J. Bernstein (PODC, 1982)

Staged circuit switching for network computers. - Mauricio Arango; David Gelernter; Hussein G. Badr; Arthur J. Bernstein (SIGCOMM, 1983)

Group Communication on Netcomputers. - Ariel J. Frank; Larry D. Wittie; Arthur J. Bernstein (ICDCS, 1984)

Efficient Solutions to the Replicated Log and Dictionart Problems. - Gene T. J. Wuu; Arthur J. Bernstein (PODC, 1984)

Multicast Communication in UNIX 4.2BSD. - Mustaque Ahamad; Arthur J. Bernstein (ICDCS, 1985)

Maintaining Weakly-Consistent Replicated Data on Dynamic Groups of Computers. - Ariel J. Frank; Larry D. Wittie; Arthur J. Bernstein (ICPP, 1985)

Multicast Communication on Network Computers. - Ariel J. Frank; Larry D. Wittie; Arthur J. Bernstein (IEEE Softw., 1985)

An Application of Name Based Addressing to Low Level Distributed Algorithms. - Mustaque Ahamad; Arthur J. Bernstein (IEEE Trans. Software Eng., 1985)

A Loosely Coupled Distributed System for Reliably Storing Data. - Arthur J. Bernstein (IEEE Trans. Software Eng., 1985)

False Deadlock Detection in Distributed Systems. - Gene T. J. Wuu; Arthur J. Bernstein (IEEE Trans. Software Eng., 1985)

Distributed Multi-Version Optimistic Concurrency Control for Relational Databases. - Divyakant Agrawal; Arthur J. Bernstein; Pankaj Gupta; Soumitra Sengupta (COMPCON, 1986)

Efficient Solutions to the Replicated Log and Dictionary Problems. - Gene T. J. Wuu; Arthur J. Bernstein (ACM SIGOPS Oper. Syst. Rev., 1986)

Distributed Optimistic Concurrency Control with Reduced Rollback. - Divyakant Agrawal; Arthur J. Bernstein; Pankaj Gupta; Soumitra Sengupta (Distributed Comput., 1987)

Predicate Transfer and Timeout in Message Passing Systems. - Arthur J. Bernstein (Inf. Process. Lett., 1987)

Concurrency control optimizations in a prolog database. - Soumitra Sengupta; Arthur J. Bernstein (Int. J. Parallel Program., 1990)

Bounded Ignorance in Replicated Systems. - Narayanan Krishnakumar; Arthur J. Bernstein (PODS, 1991)

On the relative execution times of distributed protocols. - Gurdip Singh; Arthur J. Bernstein (Int. J. Parallel Program., 1991)

A Nonblocking Quorum Consensus Protocol for Replicated Data. - Divyakant Agrawal; Arthur J. Bernstein (IEEE Trans. Parallel Distributed Syst., 1991)

A Framework for Parallel Composition of Protocols. - Gurdip Singh; Arthur J. Bernstein (PARLE, 1992)

High Throughput Escrow Algorithms for Replicated Databases. - Narayanan Krishnakumar; Arthur J. Bernstein (VLDB, 1992)

Concurrency in programming and database systems. - Arthur J. Bernstein; Philip M. Lewis (Jones and Bartlett Publishers, 1993)

Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated System. - Narayanan Krishnakumar; Arthur J. Bernstein (ACM Trans. Database Syst., 1994)

A Highly Asynchronous Minimum Spanning Tree Protocol. - Gurdip Singh; Arthur J. Bernstein (Distributed Comput., 1995)

Transaction Decomposition Using Transaction Semantics. - Arthur J. Bernstein; Philip M. Lewis (Distributed Parallel Databases, 1996)

Design and Performance of an Assertional Concurrency Control System. - Arthur J. Bernstein; David Scott Gerstl; Wai-Hong Leung; Philip M. Lewis (ICDE, 1998)

Concurrency control for step-decomposed transactions. - Arthur J. Bernstein; David Scott Gerstl; Philip M. Lewis (Inf. Syst., 1999)

Semantic Conditions for Correctness at Different Isolation Levels. - Arthur J. Bernstein; Philip M. Lewis; Shiyong Lu (ICDE, 2000)

Databases and Transaction Processing: An Application-Oriented Approach - Philip M. Lewis; Arthur J. Bernstein; Michael Kifer (Addison-Wesley, 2001)

A model for abstract process specification, verification and composition. - Ziyang Duan; Arthur J. Bernstein; Philip M. Lewis; Shiyong Lu (ICSOC, 2004)

Semantics Based Verification and Synthesis of BPEL4WS Abstract Processes. - Ziyang Duan; Arthur J. Bernstein; Philip M. Lewis; Shiyong Lu (ICWS, 2004)

Correct Execution of Transactions at Different Isolation Levels. - Shiyong Lu; Arthur J. Bernstein; Philip M. Lewis (IEEE Trans. Knowl. Data Eng., 2004)

Completeness and realizability: conditions for automatic generation of workflows. - Shiyong Lu; Arthur J. Bernstein; Philip M. Lewis (Int. J. Found. Comput. Sci., 2006)

Automatic workflow verification and generation. - Shiyong Lu; Arthur J. Bernstein; Philip M. Lewis (Theor. Comput. Sci., 2006)