Back to Results
First PageMeta Content
Big O notation / Mathematical notation / Midpoint circle algorithm / Control table / Analysis of algorithms / Mathematics / Asymptotic analysis


Moderately Hard, Memory-bound Functions Mart´ın Abadi University of California at Santa Cruz Abstract A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending
Add to Reading List

Document Date: 2005-01-15 19:23:53


Open Document

File Size: 156,30 KB

Share Result on Facebook

Company

Microsoft / /

Event

FDA Phase / /

Facility

Memory-bound Functions Mart´ın Abadi University of California / /

IndustryTerm

tree search / higherend computer systems / memory-bound solution / computer systems / problems harder is to interleave applications / memory-bound search / brute-force search / depth-first search / low-end systems / technology commonalities / encryption algorithms / recent systems / roundpof applications / search strategy / computing / possible using tools / Web indexes / 2n applications / /

Organization

University of California at Santa Cruz / /

Person

Mark Manasse / Ted Wobber / Mike Burrows / /

Product

Passport system / P / Passport / /

ProgrammingLanguage

R / /

ProvinceOrState

California / /

Technology

CPUintensive algorithms / cryptography / encryption algorithms / PDA / CPU-intensive algorithms / following alternative protocol / particular CPU-intensive algorithms / /

SocialTag