 | 2000 |
|---|
| 61 |       | Debasis Mitra,
Kenan E. Sahin,
Ravi Sethi,
Abraham Silberschatz:
New directions in services management.
Bell Labs Technical Journal 5(1): 17-34 (2000) |
| 1992 |
|---|
| 60 |  | Ravi Sethi,
Roy H. Campbell,
Sean Dorward,
Anand Iyengar,
Charles R. Kalmanek,
Gary J. Murakami,
Ce-Kuen Shieh,
See-Mong Tan:
Control Software for Virtual-Circuit Switches: Call Processing.
25th Anniversary of INRIA 1992: 175-186 |
| 59 | | Gary J. Murakami,
Ravi Sethi:
Parallelism as a Structuring Technique: Call Processing using the Estrel Language.
IFIP Congress (1) 1992: 10-16 |
| 1990 |
|---|
| 58 | | Sean Dorward,
Ravi Sethi,
Jonathan E. Shopiro:
Adding New Code to a Running C++ Program.
C++ Conference 1990: 279-292 |
| 57 | | Judith E. Grass,
C. Kintala,
Ravi Sethi:
Object-Oriented Redesign Using C++: Experience with Parser Generators.
C++ Conference 1990: 75-86 |
| 1988 |
|---|
| 56 | | Alfred V. Aho,
Ravi Sethi:
Maintaining Cross References in Manuscripts.
Softw., Pract. Exper. 18(1): 1-13 (1988) |
| 1986 |
|---|
| 55 | | Alfred V. Aho,
Ravi Sethi,
Jeffrey D. Ullman:
Compilers: Princiles, Techniques, and Tools.
Addison-Wesley 1986 |
| 54 | | David B. MacQueen,
Gordon D. Plotkin,
Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types
Information and Control 71(1/2): 95-130 (1986) |
| 53 | | Gérard Berry,
Ravi Sethi:
From Regular Expressions to Deterministic Automata.
Theor. Comput. Sci. 48(3): 117-126 (1986) |
| 1984 |
|---|
| 52 | | Jean-Claude Raoult,
Ravi Sethi:
The Global Storage Needs of a Subcomputation.
POPL 1984: 148-157 |
| 51 | | David B. MacQueen,
Gordon D. Plotkin,
Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types.
POPL 1984: 165-174 |
| 50 | | Ravi Sethi:
Preprocessing Embedded Actions.
Softw., Pract. Exper. 14(3): 291-297 (1984) |
| 1983 |
|---|
| 49 | | Ravi Sethi:
Control Flow Aspects of Semantics-Directed Compiling.
ACM Trans. Program. Lang. Syst. 5(4): 554-595 (1983) |
| 48 | | Edward G. Coffman Jr.,
Ravi Sethi:
Instruction Sets for Evaluating Arithmetic Expressions
J. ACM 30(3): 457-478 (1983) |
| 47 | | Jean-Claude Raoult,
Ravi Sethi:
Properties of a Notation for Combining Functions
J. ACM 30(3): 595-611 (1983) |
| 1982 |
|---|
| 46 | | Jean-Claude Raoult,
Ravi Sethi:
Properties of a Notation for Combining Functions.
ICALP 1982: 429-441 |
| 45 | | Ravi Sethi:
Control Flow Aspects of Semantics Directed Compiling (Summary).
SIGPLAN Symposium on Compiler Construction 1982: 245-260 |
| 44 | | David B. MacQueen,
Ravi Sethi:
A Semantic Model of Types for Applicative Languages.
Symposium on LISP and Functional Programming 1982: 243-252 |
| 43 | | Ravi Sethi:
Useless Actions Make a Difference: Strict Serializability of Database Updates.
J. ACM 29(2): 394-403 (1982) |
| 42 | | Ravi Sethi:
Circular Expressions: Elimination of Static Environments.
Sci. Comput. Program. 1(3): 203-222 (1982) |
| 41 | | Ravi Sethi:
Pebble Games for Studying Storage Sharing.
Theor. Comput. Sci. 19: 69-84 (1982) |
| 1981 |
|---|
| 40 | | Ravi Sethi:
A model of concurrent database transactions (summary)
FOCS 1981: 175-184 |
| 39 | | Ravi Sethi:
Circular Expressions: Elimination of Static Environments.
ICALP 1981: 378-392 |
| 38 | | Peter J. Downey,
Benton L. Leong,
Ravi Sethi:
Computing Sequences with Addition Chains.
SIAM J. Comput. 10(3): 638-646 (1981) |
| 37 | | Ravi Sethi:
Uniform Syntax for Type Expressions and Declarators.
Softw., Pract. Exper. 11(6): 623-628 (1981) |
| 1980 |
|---|
| 36 | | Ravi Sethi:
A Case Study in Specifying the Semantics of a Programming Language.
POPL 1980: 117-130 |
| 35 | | Bhaskaram Prabhala,
Ravi Sethi:
Efficient Computation of Expressions with Common Subexpressions.
J. ACM 27(1): 146-163 (1980) |
| 34 | | Ravi Sethi,
Adrian Tang:
Constructing Call-by-Value Continuation Semantics.
J. ACM 27(3): 580-597 (1980) |
| 33 | | Peter J. Downey,
Ravi Sethi,
Robert Endre Tarjan:
Variations on the Common Subexpression Problem.
J. ACM 27(4): 758-771 (1980) |
| 1979 |
|---|
| 32 | | Ravi Sethi,
Adrian Tang:
Constructing Call-by-Value Continuation Semantics.
ICALP 1979: 556-570 |
| 1978 |
|---|
| 31 | | Peter J. Downey,
Hanan Samet,
Ravi Sethi:
Off-Line and On-Line Algorithms for Deducing Equalities.
POPL 1978: 158-170 |
| 30 | | Bhaskaram Prabhala,
Ravi Sethi:
Efficient Computation of Expressions with Common Subexpressions.
POPL 1978: 222-230 |
| 29 | | Peter J. Downey,
Ravi Sethi:
Assignment Commands with Array References.
J. ACM 25(4): 652-666 (1978) |
| 28 | | Ravi Sethi:
Conditional Expressions with Equality Tests.
J. ACM 25(4): 667-674 (1978) |
| 1977 |
|---|
| 27 | | Alfred V. Aho,
Ravi Sethi:
How Hard is Compiler Code Generation?
ICALP 1977: 1-15 |
| 26 | | Bhaskaram Prabhala,
Ravi Sethi:
A Comparison of Instruction Sets for Stack Machines
STOC 1977: 132-142 |
| 25 | | Edward C. Horvath,
Shui Lam,
Ravi Sethi:
A Level Algorithm for Preemptive Scheduling.
J. ACM 24(1): 32-43 (1977) |
| 24 | | Douglas Comer,
Ravi Sethi:
The Complexity of Trie Index Construction.
J. ACM 24(3): 428-440 (1977) |
| 23 | | Shui Lam,
Ravi Sethi:
Worst Case Analysis of Two Scheduling Algorithms.
SIAM J. Comput. 6(3): 518-536 (1977) |
| 1976 |
|---|
| 22 | | Douglas Comer,
Ravi Sethi:
Complexity of Trie Index Construction (Extended Abstract)
FOCS 1976: 197-207 |
| 21 | | Peter J. Downey,
Ravi Sethi:
Assignment Commands and Array Structures
FOCS 1976: 57-66 |
| 20 | | John L. Bruno,
Ravi Sethi:
Task Sequencing in a Batch Environment with Setup Times.
Performance 1976: 81-88 |
| 19 | | Edward G. Coffman Jr.,
Ravi Sethi:
A generalized bound on LPT sequencing.
SIGMETRICS 1976: 306-310 |
| 18 | | Edward G. Coffman Jr.,
Ravi Sethi:
Algorithms Minimizing Mean Flow Time: Schedule-Length Properties.
Acta Inf. 6: 1-14 (1976) |
| 17 | | John L. Bruno,
Ravi Sethi:
Code Generation for a One-Register Machine.
J. ACM 23(3): 502-510 (1976) |
| 16 | | Stephen A. Cook,
Ravi Sethi:
Storage Requirements for Deterministic Polynomial Time Recognizable Languages.
J. Comput. Syst. Sci. 13(1): 25-37 (1976) |
| 15 | | Ravi Sethi:
Scheduling Graphs on Two Processors.
SIAM J. Comput. 5(1): 73-82 (1976) |
| 14 | | Peter J. Downey,
Ravi Sethi:
Correct Computation Rules for Recursive Languages.
SIAM J. Comput. 5(3): 378-401 (1976) |
| 1975 |
|---|
| 13 | | Peter J. Downey,
Ravi Sethi:
Correct Computation Rules for Recursive Languages (Extended Abstract)
FOCS 1975: 48-56 |
| 12 | | Shui Lam,
Ravi Sethi:
Analysis of a Level Algorithm for Preemptive Scheduling.
SOSP 1975: 178-186 |
| 11 | | Ravi Sethi:
Errata: ``Testing for the Church-Rosser Property''.
J. ACM 22(3): 424 (1975) |
| 10 | | Ravi Sethi:
Complete Register Allocation Problems.
SIAM J. Comput. 4(3): 226-248 (1975) |
| 1974 |
|---|
| 9 | | John L. Bruno,
Edward G. Coffman Jr.,
Ravi Sethi:
Algorithms for Minimizing Mean Flow Time.
IFIP Congress 1974: 504-510 |
| 8 | | Stephen Cook,
Ravi Sethi:
Storage Requirements for Deterministic Polynomial Time Recognizable Languages
STOC 1974: 33-39 |
| 7 | | John L. Bruno,
Edward G. Coffman Jr.,
Ravi Sethi:
Scheduling Independent Tasks to Reduce Mean Finishing Time.
Commun. ACM 17(7): 382-387 (1974) |
| 6 | | Ravi Sethi:
Testing for the Church-Rosser Property.
J. ACM 21(4): 671-679 (1974) |
| 1973 |
|---|
| 5 | | John L. Bruno,
Edward G. Coffman Jr.,
Ravi Sethi:
Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract).
SOSP 1973: 102-103 |
| 4 | | Ravi Sethi:
Complete Register Allocation Problems
STOC 1973: 182-195 |
| 3 | | Ravi Sethi:
A Note on Implementing Parallel Assignment Instructions.
Inf. Process. Lett. 2(4): 91-95 (1973) |
| 1972 |
|---|
| 2 | | Ravi Sethi:
Validating Register Allocations for Straight Line Programs
STOC 1972: 222-237 |
| 1970 |
|---|
| 1 | | Ravi Sethi,
Jeffrey D. Ullman:
The Generation of Optimal Code for Arithmetic Expressions.
J. ACM 17(4): 715-728 (1970) |
