default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArthur J. Bernstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j37]Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis:
Completeness and realizability: conditions for automatic generation of workflows. Int. J. Found. Comput. Sci. 17(1): 223-245 (2006)- [j36]Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis:
Automatic workflow verification and generation. Theor. Comput. Sci. 353(1-3): 71-92 (2006) - 2004
- [j35]Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis:
Correct Execution of Transactions at Different Isolation Levels. IEEE Trans. Knowl. Data Eng. 16(9): 1070-1081 (2004) - [c21]Ziyang Duan, Arthur J. Bernstein, Philip M. Lewis, Shiyong Lu:
A model for abstract process specification, verification and composition. ICSOC 2004: 232-241 - [c20]Ziyang Duan, Arthur J. Bernstein, Philip M. Lewis, Shiyong Lu:
Semantics Based Verification and Synthesis of BPEL4WS Abstract Processes. ICWS 2004: 734-737 - 2001
- [b2]Philip M. Lewis, Arthur J. Bernstein, Michael Kifer:
Databases and Transaction Processing: An Application-Oriented Approach. Addison-Wesley 2001, ISBN 0-201-70872-8 - 2000
- [c19]Arthur J. Bernstein, Philip M. Lewis, Shiyong Lu:
Semantic Conditions for Correctness at Different Isolation Levels. ICDE 2000: 57-66
1990 – 1999
- 1999
- [j34]Arthur J. Bernstein, David Scott Gerstl
, Philip M. Lewis:
Concurrency control for step-decomposed transactions. Inf. Syst. 24(8): 673-698 (1999) - 1998
- [c18]Arthur J. Bernstein, David Scott Gerstl, Wai-Hong Leung, Philip M. Lewis:
Design and Performance of an Assertional Concurrency Control System. ICDE 1998: 436-445 - 1996
- [j33]Arthur J. Bernstein, Philip M. Lewis:
Transaction Decomposition Using Transaction Semantics. Distributed Parallel Databases 4(1): 25-47 (1996) - 1995
- [j32]Gurdip Singh, Arthur J. Bernstein:
A Highly Asynchronous Minimum Spanning Tree Protocol. Distributed Comput. 8(3): 151-161 (1995) - 1994
- [j31]Narayanan Krishnakumar, Arthur J. Bernstein:
Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated System. ACM Trans. Database Syst. 19(4): 586-625 (1994) - 1993
- [b1]Arthur J. Bernstein, Philip M. Lewis:
Concurrency in programming and database systems. Jones and Bartlett Publishers 1993, ISBN 978-0-86720-205-2, pp. I-XVII, 1-548 - 1992
- [c17]Gurdip Singh, Arthur J. Bernstein:
A Framework for Parallel Composition of Protocols. PARLE 1992: 927-942 - [c16]Narayanan Krishnakumar, Arthur J. Bernstein:
High Throughput Escrow Algorithms for Replicated Databases. VLDB 1992: 175-186 - 1991
- [j30]Gurdip Singh, Arthur J. Bernstein:
On the relative execution times of distributed protocols. Int. J. Parallel Program. 20(3): 203-235 (1991) - [j29]Divyakant Agrawal, Arthur J. Bernstein:
A Nonblocking Quorum Consensus Protocol for Replicated Data. IEEE Trans. Parallel Distributed Syst. 2(2): 171-179 (1991) - [c15]Narayanan Krishnakumar, Arthur J. Bernstein:
Bounded Ignorance in Replicated Systems. PODS 1991: 63-74 - 1990
- [j28]Soumitra Sengupta, Arthur J. Bernstein:
Concurrency control optimizations in a prolog database. Int. J. Parallel Program. 19(3): 185-211 (1990) - [c14]Gurdip Singh, Arthur J. Bernstein:
On the Relative Execution Times of Distributed Protocols. ICDCS 1990: 80-87
1980 – 1989
- 1987
- [j27]Divyakant Agrawal, Arthur J. Bernstein, Pankaj Gupta, Soumitra Sengupta:
Distributed Optimistic Concurrency Control with Reduced Rollback. Distributed Comput. 2(1): 45-59 (1987) - [j26]Arthur J. Bernstein:
Predicate Transfer and Timeout in Message Passing Systems. Inf. Process. Lett. 24(1): 43-52 (1987) - 1986
- [j25]Gene T. J. Wuu, Arthur J. Bernstein:
Efficient Solutions to the Replicated Log and Dictionary Problems. ACM SIGOPS Oper. Syst. Rev. 20(1): 57-66 (1986) - [c13]Divyakant Agrawal, Arthur J. Bernstein, Pankaj Gupta, Soumitra Sengupta:
Distributed Multi-Version Optimistic Concurrency Control for Relational Databases. COMPCON 1986: 416-421 - 1985
- [j24]Ariel J. Frank, Larry D. Wittie, Arthur J. Bernstein:
Multicast Communication on Network Computers. IEEE Softw. 2(3): 49-61 (1985) - [j23]Mustaque Ahamad, Arthur J. Bernstein:
An Application of Name Based Addressing to Low Level Distributed Algorithms. IEEE Trans. Software Eng. 11(1): 59-67 (1985) - [j22]Arthur J. Bernstein:
A Loosely Coupled Distributed System for Reliably Storing Data. IEEE Trans. Software Eng. 11(5): 446-454 (1985) - [j21]Gene T. J. Wuu, Arthur J. Bernstein:
False Deadlock Detection in Distributed Systems. IEEE Trans. Software Eng. 11(8): 820-821 (1985) - [c12]Mustaque Ahamad, Arthur J. Bernstein:
Multicast Communication in UNIX 4.2BSD. ICDCS 1985: 80-87 - [c11]Ariel J. Frank, Larry D. Wittie, Arthur J. Bernstein:
Maintaining Weakly-Consistent Replicated Data on Dynamic Groups of Computers. ICPP 1985: 155-162 - 1984
- [c10]Ariel J. Frank, Larry D. Wittie, Arthur J. Bernstein:
Group Communication on Netcomputers. ICDCS 1984: 326-335 - [c9]Gene T. J. Wuu, Arthur J. Bernstein:
Efficient Solutions to the Replicated Log and Dictionart Problems. PODC 1984: 233-242 - 1983
- [c8]Mauricio Arango, David Gelernter, Hussein G. Badr, Arthur J. Bernstein:
Staged circuit switching for network computers. SIGCOMM 1983: 94-100 - 1982
- [c7]David Gelernter, Arthur J. Bernstein:
Distributed Communication via Global Buffer. PODC 1982: 10-18 - 1981
- [j20]Arthur J. Bernstein, J. Robert Ensor:
A Modula Based Language Supporting Hierarchical Development and Verification. Softw. Pract. Exp. 11(3): 237-255 (1981) - [c6]Arthur J. Bernstein, Paul K. Harter Jr.:
Proving Real-Time Properties of Programs with Temporal Logic. SOSP 1981: 1-11 - 1980
- [j19]Arthur J. Bernstein:
Output Guards and Nondeterminism in "Communicating Sequential Processes". ACM Trans. Program. Lang. Syst. 2(2): 234-238 (1980)
1970 – 1979
- 1979
- [j18]Kattamuri Ekanadham, Arthur J. Bernstein:
Conditional Capabilities. IEEE Trans. Software Eng. 5(5): 458-464 (1979) - 1978
- [j17]Fred B. Schneider, Arthur J. Bernstein:
Scheduling in Concurrent Pascal. ACM SIGOPS Oper. Syst. Rev. 12(2): 15-20 (1978) - [j16]Kattamuri Ekanadham, Arthur J. Bernstein:
Some New Transitions In Hierarchical Level Structures. ACM SIGOPS Oper. Syst. Rev. 12(4): 34-38 (1978) - [j15]Eralp A. Akkoyunlu, Arthur J. Bernstein, Fred B. Schneider, Abraham Silberschatz:
Conditions for the Equivalence of Synchronous and Asynchronous Systems. IEEE Trans. Software Eng. 4(6): 507-516 (1978) - [c5]Arthur J. Bernstein, Fred B. Schneider:
On Language Restrictions to Ensure Deterministic Behavior in Concurrent Systems. Jerusalem Conference on Information Technology 1978: 537-541 - 1977
- [j14]Abraham Silberschatz, Richard B. Kieburtz, Arthur J. Bernstein:
Extending Concurrent Pascal to Allow Dynamic Resource Management. IEEE Trans. Software Eng. 3(3): 210-217 (1977) - 1976
- [j13]Arthur J. Bernstein:
Synthesizing a Response Function with a Feedback Scheduling Algorithm. SIAM J. Comput. 5(2): 309-317 (1976) - [c4]Abraham Silberschatz, Richard B. Kieburtz, Arthur J. Bernstein:
Extending Concurrent Pascal to Allow Dynamic Resource Management (Abstract). ICSE 1976: 236 - 1975
- [j12]Arthur J. Bernstein, Paul Siegel:
A Computer Architecture for Level Structured Systems. IEEE Trans. Computers 24(8): 785-793 (1975) - 1974
- [j11]Eralp A. Akkoyunlu, Arthur J. Bernstein, Richard E. Schantz:
Interprocess communication facilities for network operating systems. Computer 7(6): 46-55 (1974) - [j10]Yap Siong Chua, Arthur J. Bernstein:
Analysis of a Feedback Scheduler. SIAM J. Comput. 3(3): 159-176 (1974) - 1971
- [j9]Arthur J. Bernstein, J. C. Sharp:
A Policy-Driven Scheduler for a Time-Sharing System. Commun. ACM 14(2): 74-78 (1971) - [j8]Arthur J. Bernstein:
A Programmer Training Project. Commun. ACM 14(7): 449-452 (1971) - 1970
- [j7]Arthur J. Bernstein:
Comment on the working set model for program behavior. Commun. ACM 13(11): 698-699 (1970)
1960 – 1969
- 1969
- [j6]Arie Shoshani, Arthur J. Bernstein:
Synchronization in a parallel-accessed data base. Commun. ACM 12(11): 604-607 (1969) - [c3]Arthur J. Bernstein, G. D. Detlefsen, R. H. Kerr:
Process control and communication. SOSP 1969: 60-66 - 1967
- [j5]John P. Robinson, Arthur J. Bernstein:
A class of binary recurrent codes with limited error propagation. IEEE Trans. Inf. Theory 13(1): 106-113 (1967) - 1966
- [j4]Arthur J. Bernstein:
Analysis of Programs for Parallel Processing. IEEE Trans. Electron. Comput. 15(5): 757-763 (1966) - [j3]Arthur J. Bernstein, Kenneth Steiglitz, John E. Hopcroft:
Encoding of analog signals for binary symmetric channels. IEEE Trans. Inf. Theory 12(4): 425-430 (1966) - 1964
- [c2]G. L. Hicks, Arthur J. Bernstein:
On the minimum stage realization of switching functions using logic gates with limited fan-in. SWCT 1964: 149-155 - [c1]Arthur J. Bernstein:
Reducing variable dependency in combinational circuits. SWCT 1964: 156-164 - 1963
- [j2]Arthur J. Bernstein, Wan H. Kim:
Single- and double-adjacent error-correcting codes for arithmetic units (Corresp.). IEEE Trans. Inf. Theory 9(3): 209-210 (1963) - 1962
- [j1]Arthur J. Bernstein, Wan H. Kim:
Linear codes for single error correction in symmetric and asymmetric computational processes. IRE Trans. Inf. Theory 8(1): 29-34 (1962)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
