Back to Results
First PageMeta Content
Applied mathematics / L / Complexity / Time complexity / Blum axioms / FO / Theoretical computer science / Computational complexity theory / Complexity classes


How Efficient can Memory Checking be? Cynthia Dwork1 , Moni Naor2,? , Guy N. Rothblum3,?? , and Vinod Vaikuntanathan4,? ? ? 1 2
Add to Reading List

Document Date: 2010-02-04 10:07:19


Open Document

File Size: 200,08 KB

Share Result on Facebook

Company

IBM / Symantec / Microsoft / /

Facility

Microsoft Research The Weizmann Institute of Science / /

IndustryTerm

real-world applications / online and offline memory checking / remote server / online memory checking / remote storage server / online and off-line memory checking / social networks / online memory checker / online checkers / iterative applications / tree-based online memory checker / deterministic and non-adaptive online memory checkers / online checker / deterministic and non-adaptive online memory checker / online memory checkers / /

Organization

National Science Foundation / Israel Science Foundation / MIT / Weizmann Institute of Science / /

Position

Judith Kleeman Professorial Chair / /

ProgrammingLanguage

C / /

Technology

RAM / caching / /

SocialTag