default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRavi Sethi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j35]Randy L. Hackbarth, Audris Mockus
, John Douglas Palframan, Ravi Sethi:
Improving Software Quality as Customers Perceive It. IEEE Softw. 33(4): 40-45 (2016)
2000 – 2009
- 2006
- [c30]Ravi Sethi:
Technology Directions in Enterprise Communications. ICCCN 2006: 335-336 - 2000
- [j34]Debasis Mitra, Kenan E. Sahin, Ravi Sethi, Abraham Silberschatz:
New directions in services management. Bell Labs Tech. J. 5(1): 17-34 (2000)
1990 – 1999
- 1996
- [b3]Ravi Sethi:
Programming languages - concepts and constructs (2. ed.). Addison-Wesley 1996, ISBN 978-0-201-59065-4, pp. I-XV, 1-640 - 1992
- [c29]Gary J. Murakami, Ravi Sethi:
Parallelism as a Structuring Technique: Call Processing using the Estrel Language. IFIP Congress (1) 1992: 10-16 - [c28]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 - [e2]Ravi Sethi:
Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Albuquerque, New Mexico, USA, January 19-22, 1992. ACM Press 1992, ISBN 0-89791-453-8 [contents] - 1990
- [c27]Judith E. Grass, C. Kintala, Ravi Sethi:
Object-Oriented Redesign Using C++: Experience with Parser Generators. C++ Conference 1990: 75-86 - [c26]Sean Dorward, Ravi Sethi, Jonathan E. Shopiro:
Adding New Code to a Running C++ Program. C++ Conference 1990: 279-292
1980 – 1989
- 1988
- [b2]Ravi Sethi:
Programming languages - concepts and constructs. Addison-Wesley 1988, ISBN 978-0-201-10365-6, pp. I-XII, 1-478 - [j33]Alfred V. Aho, Ravi Sethi:
Maintaining Cross References in Manuscripts. Softw. Pract. Exp. 18(1): 1-13 (1988) - 1986
- [b1]Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman:
Compilers: Principles, Techniques, and Tools. Addison-Wesley series in computer science / World student series edition, Addison-Wesley 1986, ISBN 0-201-10088-6, pp. I-X, 1-796 - [j32]David B. MacQueen, Gordon D. Plotkin, Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types. Inf. Control. 71(1/2): 95-130 (1986) - [j31]Gérard Berry, Ravi Sethi:
From Regular Expressions to Deterministic Automata. Theor. Comput. Sci. 48(3): 117-126 (1986) - 1984
- [j30]Ravi Sethi:
Preprocessing Embedded Actions. Softw. Pract. Exp. 14(3): 291-297 (1984) - [c25]Jean-Claude Raoult, Ravi Sethi:
The Global Storage Needs of a Subcomputation. POPL 1984: 148-157 - [c24]David B. MacQueen, Gordon D. Plotkin, Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types. POPL 1984: 165-174 - 1983
- [j29]Edward G. Coffman Jr., Ravi Sethi:
Instruction Sets for Evaluating Arithmetic Expressions. J. ACM 30(3): 457-478 (1983) - [j28]Jean-Claude Raoult, Ravi Sethi:
Properties of a Notation for Combining Functions. J. ACM 30(3): 595-611 (1983) - [j27]Ravi Sethi:
Control Flow Aspects of Semantics-Directed Compiling. ACM Trans. Program. Lang. Syst. 5(4): 554-595 (1983) - 1982
- [j26]Ravi Sethi:
Useless Actions Make a Difference: Strict Serializability of Database Updates. J. ACM 29(2): 394-403 (1982) - [j25]Ravi Sethi:
Circular Expressions: Elimination of Static Environments. Sci. Comput. Program. 1(3): 203-222 (1982) - [j24]Ravi Sethi:
Pebble Games for Studying Storage Sharing. Theor. Comput. Sci. 19: 69-84 (1982) - [c23]Jean-Claude Raoult, Ravi Sethi:
Properties of a Notation for Combining Functions. ICALP 1982: 429-441 - [c22]David B. MacQueen, Ravi Sethi:
A Semantic Model of Types for Applicative Languages. Symposium on LISP and Functional Programming 1982: 243-252 - [c21]Ravi Sethi:
Control Flow Aspects of Semantics Directed Compiling (Summary). SIGPLAN Symposium on Compiler Construction 1982: 245-260 - 1981
- [j23]Peter J. Downey, Benton L. Leong, Ravi Sethi:
Computing Sequences with Addition Chains. SIAM J. Comput. 10(3): 638-646 (1981) - [j22]Ravi Sethi:
Uniform Syntax for Type Expressions and Declarators. Softw. Pract. Exp. 11(6): 623-628 (1981) - [c20]Ravi Sethi:
A model of concurrent database transactions (summary). FOCS 1981: 175-184 - [c19]Ravi Sethi:
Circular Expressions: Elimination of Static Environments. ICALP 1981: 378-392 - 1980
- [j21]Bhaskaram Prabhala, Ravi Sethi:
Efficient Computation of Expressions with Common Subexpressions. J. ACM 27(1): 146-163 (1980) - [j20]Ravi Sethi, Adrian Tang:
Constructing Call-by-Value Continuation Semantics. J. ACM 27(3): 580-597 (1980) - [j19]Peter J. Downey, Ravi Sethi, Robert Endre Tarjan:
Variations on the Common Subexpression Problem. J. ACM 27(4): 758-771 (1980) - [c18]Ravi Sethi:
A Case Study in Specifying the Semantics of a Programming Language. POPL 1980: 117-130
1970 – 1979
- 1979
- [c17]Ravi Sethi, Adrian Tang:
Constructing Call-by-Value Continuation Semantics. ICALP 1979: 556-570 - 1978
- [j18]Peter J. Downey, Ravi Sethi:
Assignment Commands with Array References. J. ACM 25(4): 652-666 (1978) - [j17]Ravi Sethi:
Conditional Expressions with Equality Tests. J. ACM 25(4): 667-674 (1978) - [c16]Peter J. Downey, Hanan Samet, Ravi Sethi:
Off-Line and On-Line Algorithms for Deducing Equalities. POPL 1978: 158-170 - [c15]Bhaskaram Prabhala, Ravi Sethi:
Efficient Computation of Expressions with Common Subexpressions. POPL 1978: 222-230 - 1977
- [j16]Edward C. Horvath, Shui Lam, Ravi Sethi:
A Level Algorithm for Preemptive Scheduling. J. ACM 24(1): 32-43 (1977) - [j15]Douglas Comer, Ravi Sethi:
The Complexity of Trie Index Construction. J. ACM 24(3): 428-440 (1977) - [j14]Ravi Sethi:
On the Complexity of Mean Flow Time Scheduling. Math. Oper. Res. 2(4): 320-330 (1977) - [j13]Shui Lam, Ravi Sethi:
Worst Case Analysis of Two Scheduling Algorithms. SIAM J. Comput. 6(3): 518-536 (1977) - [c14]Alfred V. Aho, Ravi Sethi:
How Hard is Compiler Code Generation? ICALP 1977: 1-15 - [c13]Bhaskaram Prabhala, Ravi Sethi:
A Comparison of Instruction Sets for Stack Machines. STOC 1977: 132-142 - [e1]Robert M. Graham, Michael A. Harrison, Ravi Sethi:
Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977. ACM 1977 [contents] - 1976
- [j12]Edward G. Coffman Jr., Ravi Sethi:
Algorithms Minimizing Mean Flow Time: Schedule-Length Properties. Acta Informatica 6: 1-14 (1976) - [j11]John L. Bruno, Ravi Sethi:
Code Generation for a One-Register Machine. J. ACM 23(3): 502-510 (1976) - [j10]Stephen A. Cook, Ravi Sethi:
Storage Requirements for Deterministic Polynomial Time Recognizable Languages. J. Comput. Syst. Sci. 13(1): 25-37 (1976) - [j9]Michael R. Garey, David S. Johnson, Ravi Sethi:
The Complexity of Flowshop and Jobshop Scheduling. Math. Oper. Res. 1(2): 117-129 (1976) - [j8]Ravi Sethi:
Scheduling Graphs on Two Processors. SIAM J. Comput. 5(1): 73-82 (1976) - [j7]Peter J. Downey, Ravi Sethi:
Correct Computation Rules for Recursive Languages. SIAM J. Comput. 5(3): 378-401 (1976) - [c12]Peter J. Downey, Ravi Sethi:
Assignment Commands and Array Structures. FOCS 1976: 57-66 - [c11]Douglas Comer, Ravi Sethi:
Complexity of Trie Index Construction (Extended Abstract). FOCS 1976: 197-207 - [c10]John L. Bruno, Ravi Sethi:
Task Sequencing in a Batch Environment with Setup Times. Performance 1976: 81-88 - [c9]Edward G. Coffman Jr., Ravi Sethi:
A generalized bound on LPT sequencing. SIGMETRICS 1976: 306-310 - 1975
- [j6]Ravi Sethi:
Errata: "Testing for the Church-Rosser Property". J. ACM 22(3): 424 (1975) - [j5]Ravi Sethi:
Complete Register Allocation Problems. SIAM J. Comput. 4(3): 226-248 (1975) - [c8]Peter J. Downey, Ravi Sethi:
Correct Computation Rules for Recursive Languages (Extended Abstract). FOCS 1975: 48-56 - [c7]Shui Lam, Ravi Sethi:
Analysis of a Level Algorithm for Preemptive Scheduling. SOSP 1975: 178-186 - 1974
- [j4]John L. Bruno, Edward G. Coffman Jr., Ravi Sethi:
Scheduling Independent Tasks to Reduce Mean Finishing Time. Commun. ACM 17(7): 382-387 (1974) - [j3]Ravi Sethi:
Testing for the Church-Rosser Property. J. ACM 21(4): 671-679 (1974) - [c6]John L. Bruno, Edward G. Coffman Jr., Ravi Sethi:
Algorithms for Minimizing Mean Flow Time. IFIP Congress 1974: 504-510 - [c5]Stephen A. Cook, Ravi Sethi:
Storage Requirements for Deterministic Polynomial Time Recognizable Languages. STOC 1974: 33-39 - 1973
- [j2]Ravi Sethi:
A Note on Implementing Parallel Assignment Instructions. Inf. Process. Lett. 2(4): 91-95 (1973) - [c4]John L. Bruno, Edward G. Coffman Jr., Ravi Sethi:
Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract). SOSP 1973: 102-103 - [c3]Ravi Sethi:
Complete Register Allocation Problems. STOC 1973: 182-195 - 1972
- [c2]Ravi Sethi:
Validating Register Allocations for Straight Line Programs. STOC 1972: 222-237 - 1970
- [j1]Ravi Sethi, Jeffrey D. Ullman:
The Generation of Optimal Code for Arithmetic Expressions. J. ACM 17(4): 715-728 (1970) - [c1]Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman:
A formal approach to code optimization. Symposium on Compiler Optimization 1970: 86-100
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-10-07 21:14 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:
