The following pages link to Ravi Sethi (Q580982):
Displayed 44 items.
- From regular expressions to deterministic automata (Q580983) (← links)
- Pebble games for studying storage sharing (Q1162159) (← links)
- Circular expressions: elimination of static environments (Q1162353) (← links)
- Algorithms minimizing mean flow time: Schedule-length properties (Q1219159) (← links)
- Storage requirements for deterministic polynomial time recognizable languages (Q1230508) (← links)
- A note on implementing parallel assignment instructions (Q1393119) (← links)
- (Q3525697) (← links)
- Control Flow Aspects of Semantics-Directed Compiling (Q3666264) (← links)
- Properties of a Notation for Combining Functions (Q3763563) (← links)
- Instruction Sets for Evaluating Arithmetic Expressions (Q3765252) (← links)
- An ideal model for recursive polymorphic types (Q3776602) (← links)
- Efficient Computation of Expressions with Common Subexpressions (Q3862401) (← links)
- Variations on the Common Subexpression Problem (Q3908476) (← links)
- Computing Sequences with Addition Chains (Q3912017) (← links)
- Constructing Call-by-Value Continuation Semantics (Q3935455) (← links)
- Useless Actions Make a Difference (Q3936233) (← links)
- (Q3940836) (← links)
- (Q3995058) (← links)
- (Q3995059) (← links)
- (Q4051615) (← links)
- (Q4066569) (← links)
- Testing for the Church-Rosser Property (Q4066643) (← links)
- Complete Register Allocation Problems (Q4092979) (← links)
- Scheduling Graphs on Two Processors (Q4094404) (← links)
- (Q4099211) (← links)
- Code Generation for a One-Register Machine (Q4102724) (← links)
- A characterization ofLL(1) grammars (Q4109317) (← links)
- (Q4125732) (← links)
- Correct Computation Rules for Recursive Languages (Q4131609) (← links)
- (Q4131658) (← links)
- The Complexity of Trie Index Construction (Q4136634) (← links)
- (Q4139632) (← links)
- Assignment Commands with Array References (Q4170196) (← links)
- Conditional Expressions with Equality Tests (Q4170197) (← links)
- The Complexity of Flowshop and Jobshop Scheduling (Q4180114) (← links)
- On the Complexity of Mean Flow Time Scheduling (Q4187560) (← links)
- (Q4190091) (← links)
- (Q4193237) (← links)
- (Q4199563) (← links)
- (Q4692471) (← links)
- Scheduling independent tasks to reduce mean finishing time (Q4769981) (← links)
- (Q4864231) (← links)
- (Q5452362) (← links)
- The Generation of Optimal Code for Arithmetic Expressions (Q5613555) (← links)