• Home
• Publications

Ravi Sethi

Patents

• G. W. Erhart, D. J. Skiba, V. Krishnaswamy, R. Sethi, V. C. Matula. Computer and telephony integration. US Patent 8,509,419 (Issued August 13, 2013).


• D. R. Burritt, E. Evans, R. M. Klein, J. J. Ordille, R. Sethi, H. Urroz. Dropped call continuation. US Patent 7,228,145 (Issued June 5, 2007).

Journal Publications

• D. Mitra, K. Sahin, R. Sethi, A. Silberschatz. New directions in service management, Bell Labs Technical Journal 5:1, pp. 17-34 (January-March 2000).


• A. V. Aho, R. Sethi. Maintaining cross references in manuscripts, Software–Practice and Experience 18:1, pp. 1-13 (January 1988).


• G. Berry, R. Sethi. From regular expressions to deterministic automata, Theoretical Computer Science 48:1, pp. 117-126 (1986).


• D. B. MacQueen, G. P. Plotkin, R. Sethi. An ideal model of recursive polymorphic types, Information and Control 71 pp. 95-130 (1986).


• R. Sethi. Preprocessing embedded actions, Software–Practice and Experience 14:3, pp. 291-297 (March 1984).


• R. Sethi. Control flow aspects of semantics directed compiling, ACM Trans. Programming Languages and Systems 5:4, pp. 554-595 (October 1983).


• J.-C. Raoult, R. Sethi. Properties of a notation for combining functions, J. ACM 30:3, pp. 595-611 (July 1983).


• E. G. Coffman, Jr., R. Sethi. Instruction sets for evaluating arithmetic expressions, J. ACM 30:3, pp. 457-478 (July 1983).


• R. Sethi. Pebble games for studying storage sharing, Theoretical Computer Science 19:1, pp. 69-84 (July 1982).


• R. Sethi. Circular expressions: elimination of static environments, Science of Computer Programming 1:3, pp. 203-222 (May 1982).


• R. Sethi. Useless actions make a difference: strict serializability of database updates, J. ACM 29:2, pp. 394-403 (April 1982).


• B. L. Leong, P. J. Downey, R. Sethi. Computing sequences with addition chains, SIAM J. Computing 10:3, pp. 638-646 (August 1981).


• R. Sethi. Uniform syntax for type expressions and declarators, Software–Practice and Experience 11:6, pp. 623-628 (June 1981).


• P. J. Downey, R. Sethi, R. E. Tarjan. Variations on the common subexpression problem, J. ACM 27:4, pp. 758-771 (October 1980).


• R. Sethi, A. Tang. Constructing call-by-value continuation semantics, J. ACM 27:3, pp. 580-597 (July 1980).


• B. Prabhala, R. Sethi. Efficient computation of expressions with common subexpressions, J. ACM 27:1, pp. 146-163 (January 1980).


• R. Sethi. Conditional expressions with equality tests, J. ACM 25:4, pp. 667-674 (October 1978).


• P. J. Downey, R. Sethi. Assignment commands with array references, J. ACM 25:4, pp. 652-666 (October 1978).


• J. Bruno, R. Sethi. Task sequencing in a batch environment with setup times, Foundations of Control Engineering 3:3, pp. 105-117 (1978).


• A. V. Aho, R. Sethi. How hard is compiler code generation, J. Computer Society of India 8:1, pp. 8-16 (December 1977).


• R. Sethi. On the complexity of mean flow time scheduling, Mathematics of Operations Research 2:4, pp. 320-330 (November 1977).


• S. Lam, R. Sethi. Worst case analysis of two scheduling algorithms, SIAM J. Computing 6:3, pp. 518-536 (September 1977).


• D. Comer, R. Sethi. The complexity of trie index construction, J. ACM 24:3, pp. 428-440 (July 1977).


• E. C. Horvath, S. Lam, R. Sethi. A level algorithm for preemptive scheduling, J. ACM 24:1, pp. 32-43 (January 1977).


• P. J. Downey, R. Sethi. Correct computation rules for recursive languages, SIAM J. Computing 5:3, pp. 378-401 (September 1976).


• S. A. Cook, R. Sethi. Storage requirements for deterministic polynomial time recognizable languages, J. Computer and System Sciences 13:1, pp. 25-37 (August 1976).


• J. Bruno, R. Sethi. Code generation for a one-register machine, J. ACM 23:3, pp. 502-510 (July 1976).


• M. R. Garey, D. S. Johnson, R. Sethi. The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research 2:2, pp. 117-129 (May 1976).


• E. G. Coffman, Jr., R. Sethi. A generalized bound on LPT sequencing, Revue Francaise d'Automatique, Informatique et Recherche Operationelle (Blue Series) 10:5, pp. 17-26 (May 1976).


• R. Sethi. Scheduling graphs on two processors, SIAM J. Computing 5:1, pp. 73-82 (March 1976).


• D. B. Johnson, R. Sethi. A characterization of LL(1) grammars, BIT 16:3, pp. 275-280 (1976).


• E. G. Coffman, Jr., R. Sethi. Algorithms minimizing mean flow time: schedule length properties, Acta Informatica 6:1, pp. 1-14 (1976).


• R. Sethi. Complete register allocation problems, SIAM J. Computing 4:3, pp. 226-248 (September 1975).


• R. Sethi. Testing for the Church-Rosser property, J. ACM 21:4, pp. 671-679 (October 1974). Errata in J. ACM 22:3, p. 424 (July 1975).


• J. Bruno, E. G. Coffman, Jr, R. Sethi. Scheduling independent tasks to reduce mean finishing time. Comm. ACM 17:7, pp. 382-387 (July 1974).


• R. Sethi. A note on implementing parallel assignment instructions, Information Processing Letters 2, pp. 91-95 (October 1973).


• R. Sethi, J. D. Ullman. The generation of optimal code for arithmetic expressions, J. ACM 17:4, pp. 715-728 (October 1970). Reprinted as pp. 229-247 in Compiler Techniques, ed. B. W. Pollack, Auerbach, Princeton NJ (1972).