図書

Foundations and trends in theoretical computer science

Icons representing 図書

Foundations and trends in theoretical computer science

Material type
図書
Author
-
Publisher
now Publishers
Publication date
-
Material Format
Paper
Capacity, size, etc.
-
NDC
-
View All

Related materials as well as pre- and post-revision versions

On doubly-efficient interactive proof systemsLeave the NDL website. Algorithmic and analysis techniques in property testingLeave the NDL website. The algorithmic foundations of differential privacyLeave the NDL website. Lower bounds in communication complexityLeave the NDL website. Quantum proofsLeave the NDL website. Probabilistic proof systems : a primerLeave the NDL website. Complexity lower bounds using linear algebraLeave the NDL website. Average-case complexityLeave the NDL website. Foundations of cryptography : a primerLeave the NDL website. Mathematical aspects of mixing times in markov chainsLeave the NDL website. Algorithmic results in list decodingLeave the NDL website. Sketching as tool for numerical linear algebraLeave the NDL website. Data streams : algorithms and applicationsLeave the NDL website. Partial derivatives in arithmetic complexity and beyondLeave the NDL website. A decade of lattice cryptographyLeave the NDL website. Lx=bLeave the NDL website. Hashing, load balancing and multiple choiceLeave the NDL website. Paradigms for unconditional pseudorandom generatorsLeave the NDL website. Spectral algorithmsLeave the NDL website. Faster algorithms via approximation theoryLeave the NDL website. Algorithms and data structures for external memoryLeave the NDL website. Communication complexity (for algorithm designers)Leave the NDL website. On the power of small-depth computationLeave the NDL website. A survey of lower bounds for satisfiability and related problemsLeave the NDL website. Pairwise independence and derandomizationLeave the NDL website. Scalable algorithms for data and network analysisLeave the NDL website. Incidence Theorems and Their ApplicationsLeave the NDL website. Bayesian mechanism designLeave the NDL website. Quantum hamiltonian complexityLeave the NDL website. Complexity of linear Boolean operatorsLeave the NDL website. PseudorandomnessLeave the NDL website. The design of competitive online algorithms via a primal-dual approachLeave the NDL website. Complexity theory, game theory, and economics : the Barbados lecturesLeave the NDL website. Semialgebraic proofs and efficient algorithm designLeave the NDL website. Quantified derandomization : how to find water in the oceanLeave the NDL website. Coding for interactive communication :a surveyLeave the NDL website. Arithmetic circuits : a survey of resent results and open questionsLeave the NDL website. Approximate degree in classical and quantum computingLeave the NDL website. Higher-order fourier analysis and applicationsLeave the NDL website. Evasiveness of graph properties and topological fixed-point theoremsLeave the NDL website. Online matching and ad allocationLeave the NDL website.

Search by Bookstore

Table of Contents

  • On doubly-efficient interactive proof systems

  • Algorithmic and analysis techniques in property testing

  • The algorithmic foundations of differential privacy

  • Lower bounds in communication complexity

  • Quantum proofs

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

  • CiNii Research

    Search Service
    Paper
    You can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Paper

Material Type
図書
Publication, Distribution, etc.
Place of Publication (Country Code)
us
Target Audience
一般
Related Material
On doubly-efficient interactive proof systems
Algorithmic and analysis techniques in property testing
The algorithmic foundations of differential privacy
Lower bounds in communication complexity
Quantum proofs
Probabilistic proof systems : a primer
Complexity lower bounds using linear algebra
Average-case complexity
Foundations of cryptography : a primer
Mathematical aspects of mixing times in markov chains
Algorithmic results in list decoding
Sketching as tool for numerical linear algebra
Data streams : algorithms and applications
Partial derivatives in arithmetic complexity and beyond
A decade of lattice cryptography
Lx=b
Hashing, load balancing and multiple choice
Paradigms for unconditional pseudorandom generators
Spectral algorithms
Faster algorithms via approximation theory
Algorithms and data structures for external memory
Communication complexity (for algorithm designers)
On the power of small-depth computation
A survey of lower bounds for satisfiability and related problems
Pairwise independence and derandomization
Scalable algorithms for data and network analysis
Incidence Theorems and Their Applications
Bayesian mechanism design
Quantum hamiltonian complexity
Complexity of linear Boolean operators
Pseudorandomness
The design of competitive online algorithms via a primal-dual approach
Complexity theory, game theory, and economics : the Barbados lectures
Semialgebraic proofs and efficient algorithm design
Quantified derandomization : how to find water in the ocean
Coding for interactive communication :a survey
Arithmetic circuits : a survey of resent results and open questions
Approximate degree in classical and quantum computing
Higher-order fourier analysis and applications
Evasiveness of graph properties and topological fixed-point theorems
Online matching and ad allocation
Data Provider (Database)
国立情報学研究所 : CiNii Research
Original Data Provider (Database)
CiNii Books
NCID
https://ci.nii.ac.jp/ncid/BA81053856 : BA81053856