.nn Sethi R 
.ty 2
.br
.[
%A A. V. Aho
%A R. Sethi
%A J. D. Ullman
%T A Formal Approach to Code Optimization
%J ACM SIGPLAN Notices
%V 5
%N 7
%D July 1970
%P 86-100
%O From \f2Proc. ACM Symp. on Compiler Optimization,\f1 Univ. of Illinois.
.]
.br
.[
%A R. Sethi
%A J. D. Ullman
%T The Generation of Optimal Code for Arithmetic Expressions
%J J. Assoc. Comp. Mach.
%K acm jacm
%V 17
%N 4
%D October 1970
%P 715-728
.]
.br
.[
%T Code Optimization and Finite Church-Rosser Systems
%A A. V. Aho
%A R. Sethi
%A J. D. Ullman
%B Design and Optimization of Compilers
%P 89-106
%I Prentice-Hall
%E R. Rustin
%D 1972
.]
.br
.[
%A R. Sethi
%T Validating Register Allocations for Straight Line Programs
%J Proc. 4th ACM Symp. on Theory of Computing
%D May 1972
%P 222-237
%C Denver, Col.
.]
.br
.[
%A R. Sethi
%T A Note on Implementing Parallel Assignment Instructions
%J Information Processing Letters
%V 2
%P 91-95
%D 1973
.]
.br
.[
%T Algorithms for Minimizing Mean Flow Time
%A J. Bruno
%A E. G. Coffman, Jr
%A R. Sethi
%J Proc. IFIP 74
%I North Holland
%C Amsterdam
%P 504-510
%D 1974
.]
.br
.[
%T Scheduling Independent Tasks to Reduce Mean Finishing Time
%A J. Bruno
%A E. G. Coffman, Jr.
%A R. Sethi
%J Comm. Assoc. Comp. Mach.
%K acm cacm
%V 17
%N 7
%D July 1974
%P 382-387
.]
.br
.[
%T Testing for the Church-Rosser Property
%A R. Sethi
%J J. Assoc. Comp. Mach.
%K acm jacm
%V 21
%N 4
%D October 1974
%P 671-679
%O Errata in \f2J. Assoc. Comp. Mach.\f1 \f3\&22\f1(3), p. 424 (July 1975)
.]
.br
.[
%A R. Sethi
%T Complete Register Allocation Problems
%J SIAM J. Computing
%V 4
%N 3
%P 226-248
%D September, 1975
.]
.br
.[
%A S. Lam
%A R. Sethi
%T Analysis of a Level Algorithm for Preemptive Scheduling
%J Proc. 5th Symp. on Operating Systems Principles
%C Austin, Texas
%J Operating System Review
%V 9
%N 5
%P 178-186
%D November, 1975
.]
.br
.[
%T Algorithms Minimizing Mean Flow Time:  Schedule Length Properties
%Z ctr127
%A E. G. Coffman, Jr.
%A R. Sethi
%J Acta Informatica
%V 6
%N 1
%P 1-14
%D 1976
.]
.br
.[
%A R. Sethi
%T Chapter 2: Algorithms for Minimal Length Schedules
%E E. G. Coffman, Jr.
%B Computer and Jobshop Scheduling Theory
%I John Wiley
%C New York, NY
%D 1976
%P 51-99
%O Polish translation published by Wydawnictwa Naukowo-Technicze, Warsaw,1980.
Russian translation, 1984.
.]
.br
.[
%T A Characterization of LL(1) Grammars
%A D. B. Johnson
%A R. Sethi
%J BIT
%V 16
%N 3
%P 275-280
%D 1976
.]
.br
.[
%T Scheduling Graphs on Two Processors
%Z ctr127
%A R. Sethi
%J SIAM J. Computing
%V 5
%N 1
%P 73-82
%D March 1976
.]
.br
.[
%T The Complexity of Flowshop and Jobshop Scheduling
%Z ctr127
%A M. R. Garey
%A D. S. Johnson
%A R. Sethi
%J Math. of Op. Res.
%V 2
%N 2
%P 117-129
%D May 1976
%M TM 75-1212-11, 75-1216-37
.]
.br
.[
%T A Generalized Bound on LPT Sequencing
%A E. G. Coffman, Jr.
%A R. Sethi
%J Revue Francaise d'Automatique, Informatique et Recherche Operationelle (Blue Series)
%V 10
%N 5
%P 17-26
%D May 1976
.]
.br
.[
%T Code Generation for a One-Register Machine
%Z ctr127
%A J. Bruno
%A R. Sethi
%J J. Assoc. Comp. Mach.
%K acm jacm
%V 23
%N 3
%P 502-510
%D July 1976
.]
.br
.[
%T Storage Requirements for Deterministic Polynomial Time Recognizable Languages
%A S. Cook
%A R. Sethi
%J J. Comp. Sys. Sci.
%V 13
%N 1
%P 25-37
%D August 1976
.]
.br
.[
%T Correct Computation Rules for Recursive Languages
%A P. J. Downey
%A R. Sethi
%J SIAM J. Computing
%V 5
%N 3
%P 378-401
%D September 1976
.]
.br
.[
%A A. V. Aho
%A R. Sethi
%T How Hard is Compiler Code Generation
%B Automata Languages and Programming, Fourth Colloquium, Turku, Finland
%I Lecture Notes in Computer Science \fB52\fP, Springer Verlag
%C Berlin
%D 1977
%P 1-15
.]
.br
.[
%T A Level Algorithm for Preemptive Scheduling
%A E. C. Horvath
%A S. Lam
%A R. Sethi
%J J. Assoc. Comp. Mach.
%K acm jacm
%V 24
%N 1
%P 32-43
%D January 1977
.]
.br
.[
%T A Comparison of Instruction Sets for Stack Machines
%A B. Prabhala
%A R. Sethi
%J Proc. 9th ACM Symp. on Theory of Computing
%C Boulder, Col.
%D May 1977
%P 132-142
.]
.br
.[
%T The Complexity of Trie Index Construction
%A D. Comer
%A R. Sethi
%J J. Assoc. Comp. Mach.
%K acm jacm
%V 24
%N 3
%P 428-440
%D July 1977
.]
.br
.[
%T Worst Case Analysis of Two Scheduling Algorithms
%A S. Lam
%A R. Sethi
%J SIAM J. Computing
%V 6
%N 3
%P 518-536
%D September 1977
.]
.br
.[
%T On the Complexity of Mean Flow Time Scheduling
%A R. Sethi
%J Mathematics of Operations Research
%V 2
%N 4
%P 320-330
%D November 1977
%M TM 76-1271-17
.]
.br
.[
%A J. Bruno
%A R. Sethi
%T Task Sequencing in a Batch Environment with Setup Times
%J Foundations of Control Engineering
%V 3
%N 3
%D 1978
%P 105-117
.]
.br
.[
%A P. J. Downey
%A H. Samet
%A R. Sethi
%T Off-line and On-line Algorithms for Deducing Equalities
%J Proc. 5th ACM Symp. on Principles of Programming Languages
%C Tucson, Ariz.
%D January 1978
%P 158-170
.]
.br
.[
%A P. J. Downey
%A R. Sethi
%T Assignment Commands With Array References
%J J. Assoc. Comp. Mach.
%V 25
%N 4
%P 652-666
%D October 1978
.]
.br
.[
%A R. Sethi
%T Conditional Expressions With Equality Tests
%J J. Assoc. Comp. Mach.
%V 25
%N 4
%P 667-674
%D October 1978
%M TM 76-1271-12
.]
.br
.[
%T A Case Study in Specifying the Semantics of a Programming Language
%A R. Sethi
%J 7th Annual ACM Symp. on Principles of Programming Languages
%P 117-130
%C Las Vegas, Nev.
%D January 1980
.]
.br
.[
%A B. Prabhala
%A R. Sethi
%T Efficient Computation of Expressions with Common Subexpressions
%J J. Assoc. Comp. Mach.
%V 27
%N 1
%P 146-163
%D January 1980
%M TM 77-1271-8
.]
.br
.[
%T Constructing Call-by-Value Continuation Semantics
%A R. Sethi
%A A. Tang
%J J. Assoc. Comp. Mach.
%V 27
%N 3
%P 580-597
%D July 1980
%M TM 78-1271-8
.]
.br
.[
%T Variations on the Common Subexpression Problem
%A P. J. Downey
%A R. Sethi
%A R. E. Tarjan
%J J. Assoc. Comp. Mach.
%D October 1980
%V 27
%N 4
%P 758-771
.]
.br
.[
%A R. Sethi
%T Uniform Syntax for Type Expressions and Declarators
%J Software - Practice and Experience
%V 11
%N 6
%P 623-628
%D June, 1981
.]
.br
.[
%A P. J. Downey
%A B. L. Leong
%A R. Sethi
%T Computing Sequences with Addition Chains
%J SIAM Journal on Computing
%V 10
%N 3
%P 638-646
%D August, 1981
.]
.br
.[
%A R. Sethi
%T A Model of Concurrent Database Transactions
%J Proc. of the 22nd Annual Symposium on Foundations
of Computer Science
%C Nashville, TN
%P 175-184
%D October, 1981
.]
.br
.[
%A R. Sethi
%T Useless Actions Make a Difference:  Strict Serializability
of Database Updates
%J JACM
%V 29
%N 2
%P 394-403
%D April, 1982
.]
.br
.[
%A R. Sethi
%T Circular Expressions:  Elimination of Static Environments
%J Science of Computer Programming
%V 1
%N 3
%P 203-222
%D May, 1982
%O Also see Automata, Languages and Programming, Eighth Colloquium,
Acre Israel, Lecture Notes in Computer Science \fI115\fR,
pp. 378-392, Springer Verlag, Berlin, 1981.
.]
.br
.[
%A R. Sethi
%T Pebble Games for Studying Storage Sharing
%J Theoretical Computer Science
%V 19
%N 1
%P 69-84
%D July, 1982
.]
.br
.[
%A D. B. MacQueen
%A R. Sethi
%T A Higher Order Polymorphic Type System for
Applicative Languages
%J 1982 Symp. on Lisp and Functional Programming
%C Pittsburgh, PA.
%P 243-252
%D August, 1982
.]
.br
.[
%A E. G. Coffman, Jr.
%A R. Sethi
%T Instruction Sets for Evaluating Arithmetic Expressions
%J JACM
%V 30
%N 3
%P 457-478
%D July 1983
.]
.br
.[
%A J.-C. Raoult
%A R. Sethi
%T Properties of a Notation for Combining Functions
%J JACM
%V 30
%N 3
%P 595-611
%D July, 1983
.]
.br
.[
%A R. Sethi
%T Control Flow Aspects of Semantics Directed Compiling
%J TOPLAS
%V 5
%N 4
%P 554-595
%D October 1983
.]
.br
.[
%A J.-C. Raoult
%A R. Sethi
%T The Global Storage Needs of a Subcomputation
%J 11th Ann. ACM Symp. on Principles of Programming Languages
%C Salt Lake City, UT
%P 148-157
%D January 1984
.]
.br
.[
%A R. Sethi
%T Preprocessing Embedded Actions
%J Software \(en Practice and Experience
%V 14
%N 3
%D March 1984
%P 291-297
.]
.br
.[
%A A. V. Aho
%A R. Sethi
%A J. D. Ullman
%T Compilers: Principles, Techniques, and Tools
%I Addison-Wesley
%C Reading, Mass.
%D 1986
.]
.br
.[
%A G. Berry
%A R. Sethi
%T From Regular Expressions to Deterministic Automata
%J Theoretical Computer Science
%V 48
%N 1
%P 117-126
%D 1986
.]
.br
.[
%A D. B. MacQueen
%A G. D. Plotkin
%A R. Sethi
%T An Ideal Model for Recursive Polymorphic Types
%J Information and Control
%V 71
%P 95-130
%D 1986
.]
.br
.[
%A R. Sethi
%T Programming With Objects in C\h'-.14m'+\h'-.18'+
%J Convention Informatique 1987
%C Paris
%P 171-175
%D April 1987
.]
.br
.[
%A A. V. Aho
%A R. Sethi
%T Maintaining Cross References in Manuscripts
%J Software\(emPractice and Experience
%V 18
%N 1
%P 1-13
%D January 1988
.]
.br
.[
%A R. Sethi
%T Programming Languages: Concepts and Constructs
%I Addison-Wesley
%C Reading, Mass.
%D 1989
.]
.br
.[
%A J. E. Grass
%A C. M. Kintala
%A R. Sethi
%T Object-Oriented Redesign Using C\h'-.14m'+\h'-.18'+: Experience With Parser Generators
%J USENIX C\h'-.14m'+\h'-.18'+ Technical Conference
%C San Francisco
%D April 1990
.]
.br
.[
%A S. M. Dorward
%A R. Sethi
%A J. E. Shopiro
%T Adding New Code to a Running C\h'-.14m'+\h'-.18'+ program
%J USENIX C\h'-.14m'+\h'-.18'+ Technical Conference
%P 279-292
%C San Francisco
%D April 1990
.]
.br
.[
%A S. C. Johnson
%A R. Sethi
%T Yacc: A Parser Generator
%B Unix Research System
%V II
%I Saunders College Publishing
%C Philadelphia, Penna
%D 1990
%P 347-374
.]
.br
.[
%A G. J. Murakami
%A R. Sethi
%T Parallelism as a Structuring Technique: Call Processing Using the Esterel Language
%E J. Van Leeuwen
%B Algorithms, Software, Architecture: Information Processing 92, Volume 1
%I North-Holland
%C Amsterdam
%D 1992
%P 10-16
.]
.br
.[
%A R. H. Campbell
%A S. M. Dorward
%A A. Iyengar
%A C. R. Kalmanek
%A G. J. Murakami
%A R. Sethi
%A C.-K. Shieh
%A S.-M. Tan
%T Control Software for Virtual-Circuit Switches: Call Processing
%B Future Tendencies in Computer Science, Control and Applied Mathematics
%I Lecture Notes in Computer Science \fB653\fP, Springer-Verlag
%C Berlin
%D 1992
%P 175-186
.]
.br
.[
%A R. Sethi
%T Programming Languages: Concepts and Constructs, 2nd Ed.
%I Addison-Wesley
%C Reading, Mass.
%D 1996
.]