By Topic

[Copyright notice]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.

The following topics are dealt with: coin problem, pseudorandom generators; two-party differential privacy; polynomial learning; polynomial learnability; optimal stochastic planarization; monotone complexity; linear systems; fast approximation algorithm; vertex sparsifiers; colorable graphs; information cost tradeoffs; fault tolerance; decidable dichotomy theorem; sublinear optimization; cryptography; minimum cost network design; computational complexity; local list decoding; and backyard cuckoo hashing.

Published in:

Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on

Date of Conference:

23-26 Oct. 2010