Ravi Sethi

According to our database1, Ravi Sethi
  • authored at least 67 papers between 1970 and 2016.
  • has a "Dijkstra number"2 of three.

Awards

ACM Fellow

ACM Fellow 1996, "For contributions to compiler technology, computer programming languages, scheduling, and analysis of algorithms.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Improving Software Quality as Customers Perceive It.
IEEE Software, 2016

2006
Technology Directions in Enterprise Communications.
Proceedings of the 15th International Conference On Computer Communications and Networks, 2006

2000
New directions in services management.
Bell Labs Technical Journal, 2000

1996
Programming languages - concepts and constructs (2. ed.).
Addison-Wesley, ISBN: 978-0-201-59065-4, 1996

1992
Control Software for Virtual-Circuit Switches: Call Processing.
Proceedings of the Future Tendencies in Computer Science, 1992

Parallelism as a Structuring Technique: Call Processing using the Estrel Language.
Proceedings of the Algorithms, Software, Architecture, 1992

1990
Object-Oriented Redesign Using C++: Experience with Parser Generators.
Proceedings of the C++ Conference. San Francisco, 1990

Adding New Code to a Running C++ Program.
Proceedings of the C++ Conference. San Francisco, 1990

1988
Maintaining Cross References in Manuscripts.
Softw., Pract. Exper., 1988

Programming languages - concepts and constructs.
Addison-Wesley, ISBN: 978-0-201-10365-6, 1988

1986
From Regular Expressions to Deterministic Automata.
Theor. Comput. Sci., 1986

An Ideal Model for Recursive Polymorphic Types
Information and Control, 1986

Compilers: Principles, Techniques, and Tools.
Addison-Wesley series in computer science / World student series edition, Addison-Wesley, ISBN: 0201101947, 1986

1984
Preprocessing Embedded Actions.
Softw., Pract. Exper., 1984

The Global Storage Needs of a Subcomputation.
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

An Ideal Model for Recursive Polymorphic Types.
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

1983
Properties of a Notation for Combining Functions
J. ACM, July, 1983

Instruction Sets for Evaluating Arithmetic Expressions
J. ACM, July, 1983

Control Flow Aspects of Semantics-Directed Compiling.
ACM Trans. Program. Lang. Syst., 1983

1982
Pebble Games for Studying Storage Sharing.
Theor. Comput. Sci., 1982

Circular Expressions: Elimination of Static Environments.
Sci. Comput. Program., 1982

Useless Actions Make a Difference: Strict Serializability of Database Updates.
J. ACM, 1982

Control Flow Aspects of Semantics Directed Compiling (Summary).
Proceedings of the SIGPLAN '82 Symposium on Compiler Construction, 1982

A Semantic Model of Types for Applicative Languages.
Symposium on LISP and Functional Programming, 1982

Properties of a Notation for Combining Functions.
Proceedings of the Automata, 1982

1981
Uniform Syntax for Type Expressions and Declarators.
Softw., Pract. Exper., 1981

Computing Sequences with Addition Chains.
SIAM J. Comput., 1981

Circular Expressions: Elimination of Static Environments.
Proceedings of the Automata, 1981

A model of concurrent database transactions (summary)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
Constructing Call-by-Value Continuation Semantics.
J. ACM, 1980

Efficient Computation of Expressions with Common Subexpressions.
J. ACM, 1980

Variations on the Common Subexpression Problem.
J. ACM, 1980

A Case Study in Specifying the Semantics of a Programming Language.
Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

1979
Constructing Call-by-Value Continuation Semantics.
Proceedings of the Automata, 1979

1978
Conditional Expressions with Equality Tests.
J. ACM, 1978

Assignment Commands with Array References.
J. ACM, 1978

Efficient Computation of Expressions with Common Subexpressions.
Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

Off-Line and On-Line Algorithms for Deducing Equalities.
Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

1977
Worst Case Analysis of Two Scheduling Algorithms.
SIAM J. Comput., 1977

On the Complexity of Mean Flow Time Scheduling.
Math. Oper. Res., 1977

A Level Algorithm for Preemptive Scheduling.
J. ACM, 1977

The Complexity of Trie Index Construction.
J. ACM, 1977

A Comparison of Instruction Sets for Stack Machines
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

How Hard is Compiler Code Generation?
Proceedings of the Automata, 1977

1976
Scheduling Graphs on Two Processors.
SIAM J. Comput., 1976

Correct Computation Rules for Recursive Languages.
SIAM J. Comput., 1976

The Complexity of Flowshop and Jobshop Scheduling.
Math. Oper. Res., 1976

Storage Requirements for Deterministic Polynomial Time Recognizable Languages.
J. Comput. Syst. Sci., 1976

Code Generation for a One-Register Machine.
J. ACM, 1976

Algorithms Minimizing Mean Flow Time: Schedule-Length Properties.
Acta Inf., 1976

A generalized bound on LPT sequencing.
Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 1976

Task Sequencing in a Batch Environment with Setup Times.
Proceedings of the Modelling and Performance Evaluation of Computer Systems, 1976

Assignment Commands and Array Structures
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

Complexity of Trie Index Construction (Extended Abstract)
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975
Complete Register Allocation Problems.
SIAM J. Comput., 1975

Errata: "Testing for the Church-Rosser Property".
J. ACM, 1975

Analysis of a Level Algorithm for Preemptive Scheduling.
Proceedings of the Fifth Symposium on Operating System Principles, 1975

Correct Computation Rules for Recursive Languages (Extended Abstract)
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1974
Testing for the Church-Rosser Property.
J. ACM, 1974

Scheduling Independent Tasks to Reduce Mean Finishing Time.
Commun. ACM, 1974

Storage Requirements for Deterministic Polynomial Time Recognizable Languages
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

Algorithms for Minimizing Mean Flow Time.
IFIP Congress, 1974

1973
A Note on Implementing Parallel Assignment Instructions.
Inf. Process. Lett., 1973

Complete Register Allocation Problems
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract).
Proceedings of the Fourth Symposium on Operating System Principles, 1973

1972
Validating Register Allocations for Straight Line Programs
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1970
The Generation of Optimal Code for Arithmetic Expressions.
J. ACM, 1970


  Loading...