Theses most similar to Evaluation of boolean formulas with restricted inputs (Zhan, Bohua; 2010) read it
- Advisor: Tom Leighton
- Department of Mathematics
- Advisor: Michel Goemans
- Department of Mathematics
Fully polynomial time approximation schemes for sequential decision problems
Mostagir, Mohamed (2005)
- Advisor: James B. Orlin
- Operations Research Center
- Advisor: Ronald L. Rivest
- Department of Electrical Engineering and Computer Science
A fast algorithm for the string editing problem and decision graph complexity
Masek, William Joseph (1976)
- Advisor: Ronald L. Rivest
- Department of Electrical Engineering and Computer Science
- Advisor: Michel Goemans
- Department of Electrical Engineering and Computer Science
- Advisor: David R. Karger
- Department of Electrical Engineering and Computer Science
Algorithms and approximation schemes for machine scheduling problems
Sengupta, Sudipta, 1974- (1999)
- Advisor: James B. Orlin
- Department of Electrical Engineering and Computer Science
The Directed Steiner Network problem is tractable for a constant number of terminals
Feldman, Jon, 1975- (2000)
- Advisor: David R. Karger
- Department of Electrical Engineering and Computer Science
- Advisor: Charles E. Leiserson
- Department of Electrical Engineering and Computer Science