Foundations and Trends® in Theoretical Computer Science

Editor-in-chief

Salil Vadhan
Harvard University
 

Founding Editor

Madhu Sudan, Harvard University, Personal homepage
 
Print ISSN: 1551-305X
Online ISSN: 1551-3068
 
Publisher
Mike Casey

TCS

Indexed in: ACM Guide, Cabell's International, Computing Reviews, DBLP, EI Compendex, Electronic Journals Library, Genamics Journal Seek, Emerging Sources Citation Index (ESCI), Google Scholar, INSPEC, MathSciNet, PubGet, SCOPUS, Ulrich's, Zentralblatt Math

About this journal

Journal Home Editorial Aims Editorial Board Submission Instructions LaTeX Style Files Pricing Recommend to Library Alert Me
Search

Volume 15

Volume 15, Issue 3-4

Approximate Degree in Classical and Quantum Computing

 
Mark Bun | Justin Thaler
Volume 15, Issue 2

Multi-Valued Reasoning about Reactive Systems

 
Orna Kupferman
Volume 15, Issue 1

Quantified Derandomization: How to Find Water in the Ocean

 
Roei Tell

Volume 14

Volume 14, Issue 3–4

Complexity Theory, Game Theory, and Economics: The Barbados Lectures

 
Tim Roughgarden
Volume 14, Issue 1-2

Semialgebraic Proofs and Efficient Algorithm Design

 
Noah Fleming | Pravesh Kothari | Toniann Pitassi

Volume 13

Volume 13, Issue 4

Higher-order Fourier Analysis and Applications

 
Hamed Hatami | Pooya Hatami | Shachar Lovett
Volume 13, Issue 3

On Doubly-Efficient Interactive Proof Systems

 
Oded Goldreich
Volume 13, Issue 1–2

Coding for Interactive Communication: A Survey

 
Ran Gelles

Volume 12

Volume 12, Issue 3–4

Hashing, Load Balancing and Multiple Choice

 
Udi Wieder
Volume 12, Issue 1–2

Scalable Algorithms for Data and Network Analysis

 
Shang-Hua Teng

Volume 11

Volume 11, Issue 3–4

Communication Complexity (for Algorithm Designers)

 
Tim Roughgarden
Volume 11, Issue 1-2

Quantum Proofs

 
Thomas Vidick | John Watrous

Volume 10

Volume 10, Issue 4

A Decade of Lattice Cryptography

 
Chris Peikert
Volume 10, Issue 3

Quantum Hamiltonian Complexity

 
Sevag Gharibian | Yichen Huang | Zeph Landau | Seung Woo Shin
Volume 10, Issue 1–2

Sketching as a Tool for Numerical Linear Algebra

 
David P. Woodruff

Volume 9

Volume 9, Issue 3–4

The Algorithmic Foundations of Differential Privacy

 
Cynthia Dwork | Aaron Roth
Volume 9, Issue 2

Faster Algorithms via Approximation Theory

 
Sushant Sachdeva | Nisheeth K. Vishnoi
Volume 9, Issue 1

Complexity of Linear Boolean Operators

 
Stasys Jukna | Igor Sergeev

Volume 8

Volume 8, Issue 4

Online Matching and Ad Allocation

 
Aranyak Mehta
Volume 8, Issue 3

Bayesian Mechanism Design

 
Jason D. Hartline
Volume 8, Issue 1–2

Lx = b

 
Nisheeth K. Vishnoi

Volume 7

Volume 7, Issue 4

Evasiveness of Graph Properties and Topological Fixed-Point Theorems

 
Carl A. Miller
Volume 7, Issue 1–3

Pseudorandomness

 
Salil P. Vadhan

Volume 6

Volume 6, Issue 4

Incidence Theorems and Their Applications

 
Zeev Dvir
Volume 6, Issue 3

Locally Decodable Codes

 
Sergey Yekhanin
Volume 6, Issue 1–2

Partial Derivatives in Arithmetic Complexity and Beyond

 
Xi Chen | Neeraj Kayal | Avi Wigderson

Volume 5

Volume 5, Issue 3–4

Arithmetic Circuits: A Survey of Recent Results and Open Questions

 
Amir Shpilka | Amir Yehudayoff
Volume 5, Issue 2

Algorithmic and Analysis Techniques in Property Testing

 
Dana Ron
Volume 5, Issue 1

On the Power of Small-Depth Computation

 
Emanuele Viola

Volume 4

Volume 4, Issue 3–4

Spectral Algorithms

 
Ravindran Kannan | Santosh Vempala
Volume 4, Issue 1–2

Complexity Lower Bounds using Linear Algebra

 
Satyanarayana V. Lokam

Volume 3

Volume 3, Issue 4

Lower Bounds in Communication Complexity

 
Troy Lee | Adi Shraibman
Volume 3, Issue 2–3

The Design of Competitive Online Algorithms via a Primal–Dual Approach

 
Niv Buchbinder | Joseph (Seffi) Naor
Volume 3, Issue 1

Probabilistic Proof Systems: A Primer

 
Oded Goldreich

Volume 2

Volume 2, Issue 4

Algorithms and Data Structures for External Memory

 
Jeffrey Scott Vitter
Volume 2, Issue 3

A Survey of Lower Bounds for Satisfiability and Related Problems

 
Dieter van Melkebeek
Volume 2, Issue 2

Algorithmic Results in List Decoding

 
Venkatesan Guruswami
Volume 2, Issue 1

Average-Case Complexity

 
Andrej Bogdanov | Luca Trevisan

Volume 1

Volume 1, Issue 4

Pairwise Independence and Derandomization

 
Michael Luby | Avi Wigderson
Volume 1, Issue 3

Mathematical Aspects of Mixing Times in Markov Chains

 
Ravi Montenegro | Prasad Tetali
Volume 1, Issue 2

Data Streams: Algorithms and Applications

 
S. Muthukrishnan
Volume 1, Issue 1

Foundations of Cryptography – A Primer

 
Oded Goldreich