Searching for authors named "Rajeev Motwani" – sorted by Relevance.
-
Abstract On the Decidability of Accessibility Problems
- Abstract On the Decidability of Accessibility Problems Rajeev Motwani Stanford University
- Add To MetaCart
-
Average-case Analysis of Algorithms for Matchings and Related Problems
- Average-case Analysis of Algorithms for Matchings and Related Problems Rajeev Motwani Department
- Cited by 14 (0 self) – Add To MetaCart
-
Finding large cycles in hamiltonian graphs
- Finding Large Cycles in Hamiltonian Graphs Tom'as Feder* Rajeev Motwani# Abstract We show how
- Cited by 7 (2 self) – Add To MetaCart
-
Complexity Measures for Assembly Sequences
- Rajeev Motwani y Department of Computer Science Stanford University Stanford, CA 94305-9045 Abstract
- Add To MetaCart
-
A Structural View Of Approximation
- , in scope and in quality, as a dissertation for the degree of Doctor of Philosophy. Rajeev Motwani
- Add To MetaCart
-
Approximation Algorithms For Scheduling Problems
- of Philosophy. Rajeev Motwani (Principal Adviser) I certify that I have read this dissertation and that in my
- Cited by 5 (0 self) – Add To MetaCart
-
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism
- Motwani Department of Computer Science Stanford University Stanford, CA 94305 rajeev
- Cited by 27 (2 self) – Add To MetaCart
-
Lecture Notes on Approximation Algorithms - Volume I
- Lecture Notes on Approximation Algorithms -- Volume I Rajeev Motwani Department of Computer
- Cited by 11 (2 self) – Add To MetaCart
-
Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine
- Chandra Chekuri Rajeev Motwani y Abstract We consider the problem of scheduling a set of jobs on a
- Cited by 12 (0 self) – Add To MetaCart
-
Approximating Capacitated Routing And Delivery Problems
- APPROXIMATING CAPACITATED ROUTING AND DELIVERY PROBLEMS PRASAD CHALASANI AND RAJEEV MOTWANI y
- Cited by 11 (0 self) – Add To MetaCart

