Ravi Sethi

IEEE Softw., 2016

2006

Technology Directions in Enterprise Communications.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference On Computer Communications and Networks, 2006

2000

New directions in services management.

[BibT_eX]

[DOI]

Bell Labs Tech. J., 2000

1996

Programming languages - concepts and constructs (2. ed.).

[BibT_eX]

Addison-Wesley, ISBN: 978-0-201-59065-4, 1996

1992

Control Software for Virtual-Circuit Switches: Call Processing.

[BibT_eX]

[DOI]

Proceedings of the Future Tendencies in Computer Science, 1992

Parallelism as a Structuring Technique: Call Processing using the Estrel Language.

[BibT_eX]

Gary J. Murakami

Proceedings of the Algorithms, Software, Architecture, 1992

1990

Object-Oriented Redesign Using C++: Experience with Parser Generators.

[BibT_eX]

Judith E. Grass

C. Kintala

Proceedings of the C++ Conference. San Francisco, 1990

Adding New Code to a Running C++ Program.

[BibT_eX]

Sean Dorward

Jonathan E. Shopiro

Proceedings of the C++ Conference. San Francisco, 1990

1988

Maintaining Cross References in Manuscripts.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1988

Programming languages - concepts and constructs.

[BibT_eX]

Addison-Wesley, ISBN: 978-0-201-10365-6, 1988

1986

From Regular Expressions to Deterministic Automata.

[BibT_eX]

[DOI]

Gérard Berry

Theor. Comput. Sci., 1986

An Ideal Model for Recursive Polymorphic Types

[BibT_eX]

[DOI]

David B. MacQueen

Gordon D. Plotkin

Inf. Control., 1986

Compilers: Principles, Techniques, and Tools.

[BibT_eX]

[DOI]

Jeffrey D. Ullman

Addison-Wesley series in computer science / World student series edition, Addison-Wesley, ISBN: 0201101947, 1986

1984

Preprocessing Embedded Actions.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1984

The Global Storage Needs of a Subcomputation.

[BibT_eX]

[DOI]

Jean-Claude Raoult

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

[BibT_eX]

[DOI]

Jean-Claude Raoult

J. ACM, July, 1983

Instruction Sets for Evaluating Arithmetic Expressions

[BibT_eX]

[DOI]

J. ACM, July, 1983

Control Flow Aspects of Semantics-Directed Compiling.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1983

1982

Pebble Games for Studying Storage Sharing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Circular Expressions: Elimination of Static Environments.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1982

Useless Actions Make a Difference: Strict Serializability of Database Updates.

[BibT_eX]

[DOI]

J. ACM, 1982

Control Flow Aspects of Semantics Directed Compiling (Summary).

[BibT_eX]

[DOI]

Proceedings of the SIGPLAN '82 Symposium on Compiler Construction, 1982

A Semantic Model of Types for Applicative Languages.

[BibT_eX]

[DOI]

David B. MacQueen

Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, 1982

1981

Uniform Syntax for Type Expressions and Declarators.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1981

Computing Sequences with Addition Chains.

[BibT_eX]

[DOI]

Benton L. Leong

SIAM J. Comput., 1981

A model of concurrent database transactions (summary)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

Constructing Call-by-Value Continuation Semantics.

[BibT_eX]

[DOI]

Adrian Tang

J. ACM, 1980

Efficient Computation of Expressions with Common Subexpressions.

[BibT_eX]

[DOI]

Bhaskaram Prabhala

J. ACM, 1980

Variations on the Common Subexpression Problem.

[BibT_eX]

[DOI]

Robert Endre Tarjan

J. ACM, 1980

A Case Study in Specifying the Semantics of a Programming Language.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

1978

Conditional Expressions with Equality Tests.

[BibT_eX]

[DOI]

J. ACM, 1978

Assignment Commands with Array References.

[BibT_eX]

[DOI]

J. ACM, 1978

Off-Line and On-Line Algorithms for Deducing Equalities.

[BibT_eX]

[DOI]

Hanan Samet

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.

[BibT_eX]

[DOI]

Shui Lam

SIAM J. Comput., 1977

On the Complexity of Mean Flow Time Scheduling.

[BibT_eX]

[DOI]

Math. Oper. Res., 1977

A Level Algorithm for Preemptive Scheduling.

[BibT_eX]

[DOI]

Edward C. Horvath

Shui Lam

J. ACM, 1977

The Complexity of Trie Index Construction.

[BibT_eX]

[DOI]

Douglas Comer

J. ACM, 1977

A Comparison of Instruction Sets for Stack Machines

[BibT_eX]

[DOI]

Bhaskaram Prabhala

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

How Hard is Compiler Code Generation?

[BibT_eX]

[DOI]

Proceedings of the Automata, 1977

1976

Scheduling Graphs on Two Processors.

[BibT_eX]

[DOI]

SIAM J. Comput., 1976

Correct Computation Rules for Recursive Languages.

[BibT_eX]

[DOI]

SIAM J. Comput., 1976

The Complexity of Flowshop and Jobshop Scheduling.

[BibT_eX]

[DOI]

Michael R. Garey

David S. Johnson

Math. Oper. Res., 1976

Storage Requirements for Deterministic Polynomial Time Recognizable Languages.

[BibT_eX]

[DOI]

Stephen A. Cook

J. Comput. Syst. Sci., 1976

Code Generation for a One-Register Machine.

[BibT_eX]

[DOI]

J. ACM, 1976

Algorithms Minimizing Mean Flow Time: Schedule-Length Properties.

[BibT_eX]

[DOI]

Acta Informatica, 1976

A generalized bound on LPT sequencing.

[BibT_eX]

[DOI]

Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 1976

Task Sequencing in a Batch Environment with Setup Times.

[BibT_eX]

Proceedings of the Modelling and Performance Evaluation of Computer Systems, 1976

Assignment Commands and Array Structures

[BibT_eX]

[DOI]

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

Complexity of Trie Index Construction (Extended Abstract)

[BibT_eX]

[DOI]

Douglas Comer

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975

Complete Register Allocation Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1975

Errata: "Testing for the Church-Rosser Property".

[BibT_eX]

[DOI]

J. ACM, 1975

Analysis of a Level Algorithm for Preemptive Scheduling.

[BibT_eX]

[DOI]

Shui Lam

Proceedings of the Fifth Symposium on Operating System Principles, 1975

Correct Computation Rules for Recursive Languages (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1974

Testing for the Church-Rosser Property.

[BibT_eX]

[DOI]

J. ACM, 1974

Scheduling Independent Tasks to Reduce Mean Finishing Time.

[BibT_eX]

[DOI]

Commun. ACM, 1974

Algorithms for Minimizing Mean Flow Time.

[BibT_eX]

Proceedings of the Information Processing, 1974

1973

A Note on Implementing Parallel Assignment Instructions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1973

Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourth Symposium on Operating System Principles, 1973

1972

Validating Register Allocations for Straight Line Programs

[BibT_eX]

[DOI]

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1970

The Generation of Optimal Code for Arithmetic Expressions.

[BibT_eX]

[DOI]

Jeffrey D. Ullman

J. ACM, 1970

A formal approach to code optimization.

[BibT_eX]

[DOI]