Find link

language:

Find link is a tool written by Edward Betts.

searching for Foundations and Trends in Theoretical Computer Science 21 found (26 total)

alternate case: foundations and Trends in Theoretical Computer Science

Dana Ron (335 words) [view diff] exact match in snippet view article find links to article

Algorithmic and Analysis Techniques in Property Testing, Foundations and Trends in Theoretical Computer Science: vol. 5, no. 2, pages 73–205, 2009. D. Ron. Property

Pseudorandomness (858 words) [view diff] exact match in snippet view article find links to article

490–493. Vadhan, S. P. (2012). "Pseudorandomness". Foundations and Trends in Theoretical Computer Science. 7 (1–3): 1–336. doi:10.1561/0400000010. HotBits:

Polynomial identity testing (851 words) [view diff] exact match in snippet view article find links to article

A survey of recent results and open questions." Foundations and Trends in Theoretical Computer Science 5.3–4 (2010): 207-388. Dvir, Zeev, and Amir Shpilka

Budget-additive valuation (850 words) [view diff] exact match in snippet view article find links to article

(2013-10-16). "Online Matching and Ad Allocation". Foundations and Trends in Theoretical Computer Science. 8 (4): 265–368. doi:10.1561/0400000057. ISSN 1551-305X

Cheeger constant (graph theory) (873 words) [view diff] exact match in snippet view article

"Mathematical Aspects of Mixing Times in Markov Chains". Foundations and Trends in Theoretical Computer Science. 1 (3): 237–354. doi:10.1561/0400000003. ISSN 1551-305X

Reconstruction attack (527 words) [view diff] exact match in snippet view article find links to article

Differential Privacy by Cynthia Dwork and Aaron Roth. Foundations and Trends in Theoretical Computer Science. Vol. 9, no. 3–4, pp. 211‐407, Aug. 2014. DOI:10

External memory algorithm (1,031 words) [view diff] exact match in snippet view article find links to article

Structures for External Memory (PDF). Series on Foundations and Trends in Theoretical Computer Science. Vol. 2. Hanover, MA: Now Publishers. pp. 305–474

QMA (1,832 words) [view diff] exact match in snippet view article find links to article

Seung Woo (2015). "Quantum Hamiltonian Complexity". Foundations and Trends in Theoretical Computer Science. 10 (3): 159–282. arXiv:1401.3916. doi:10.1561/0400000066

Toniann Pitassi (990 words) [view diff] exact match in snippet view article find links to article

"Semialgebraic Proofs and Efficient Algorithm Design". Foundations and Trends in Theoretical Computer Science. 14 (1–2). now Publishers: 1–221. doi:10.1561/0400000086

Cynthia Dwork (1,225 words) [view diff] exact match in snippet view article find links to article

Algorithmic Foundations of Differential Privacy (PDF). Foundations and Trends in Theoretical Computer Science. Now Publishers. ISBN 978-1601988188. She was elected

Arthur–Merlin protocol (1,831 words) [view diff] exact match in snippet view article find links to article

Thomas; Watrous, John (2016). "Quantum Proofs". Foundations and Trends in Theoretical Computer Science. 11 (1–2): 1–215. arXiv:1610.01664. doi:10.1561/0400000068

Jeffrey Vitter (1,415 words) [view diff] exact match in snippet view article find links to article

Data Structures for External Memory, Series on Foundations and Trends in Theoretical Computer Science, now Publishers, Hanover, MA, 2008, ISBN 978-1-60198-106-6

Additive noise differential privacy mechanisms (1,438 words) [view diff] exact match in snippet view article find links to article

Algorithmic Foundations of Differential Privacy" (PDF). Foundations and Trends in Theoretical Computer Science. 9 (3–4): 211–407. doi:10.1561/0400000042. ISSN 1551-305X

Polynomial method in combinatorics (1,387 words) [view diff] exact match in snippet view article find links to article

(2012). "Incidence Theorems and Their Applications". Foundations and Trends in Theoretical Computer Science. 6 (4): 257–393. arXiv:1208.5073. Bibcode:2012arXiv1208

External sorting (2,149 words) [view diff] exact match in snippet view article find links to article

Data Structures for External Memory, Series on Foundations and Trends in Theoretical Computer Science, now Publishers, Hanover, MA, 2008, ISBN 978-1-60198-106-6

Arithmetic circuit complexity (2,171 words) [view diff] exact match in snippet view article find links to article

survey of recent results and open questions" (PDF). Foundations and Trends in Theoretical Computer Science. 5 (3–4): 207-388. doi:10.1561/0400000039. Valiant

Average-case complexity (2,834 words) [view diff] exact match in snippet view article find links to article

Bogdanov and L. Trevisan, "Average-Case Complexity," Foundations and Trends in Theoretical Computer Science, Vol. 2, No 1 (2006) 1–106. D. Knuth, The Art of

Computational hardness assumption (3,303 words) [view diff] exact match in snippet view article find links to article

Chris (2016). "A Decade of Lattice Cryptography". Foundations and Trends in Theoretical Computer Science. 10 (4): 283–424. doi:10.1561/0400000074. Fortnow

Computer data storage (6,534 words) [view diff] case mismatch in snippet view article find links to article

structures for external memory (PDF). Series on foundations and trends in theoretical computer science. Hanover, MA: now Publishers. ISBN 978-1-60198-106-6

Differential privacy (5,191 words) [view diff] exact match in snippet view article find links to article

Differential Privacy by Cynthia Dwork and Aaron Roth. Foundations and Trends in Theoretical Computer Science. Vol. 9, no. 3–4, pp. 211‐407, Aug. 2014. doi:10

Johnson–Lindenstrauss lemma (5,136 words) [view diff] exact match in snippet view article find links to article

Sketching as a Tool for Numerical Linear Algebra, Foundations and Trends in Theoretical Computer Science, vol. 10, arXiv:1411.4357, doi:10.1561/0400000060