A randomized memory model and its applications in distributed computing /
Randomization is a powerful tool in the design of algorithms. As summarized by Motwani and Raghavan, and by Gupta et al., randomized algorithms are often simpler and more efficient than deterministic algorithms for the same problem. Simpler algorithms have the advantages of being easier to analyze...
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
2001.
|
| Subjects: | |
| Online Access: | http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=726104521&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQD |
Internet
http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=726104521&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQDCushing: Theses & Dissertations Microforms (Does not check out)
| Call Number: |
2001 Dissertation L4354 |
|
|---|---|---|
| Call Number | Status | Get It |
| 2001 Dissertation L4354 | Available | |
Available Online
| Call Number: |
2001 Dissertation L4354 |
|
|---|---|---|
| Call Number | Status | Get It |
| 2001 Dissertation L4354 | Available | |