Journal Homepage
 Editorial Board
 Editorial Aims
 Editorial Scope
 Review Updates
 Author instructions
 Download LaTeX Styles
 Alert Me
 Submit an article
 Library Recommendation Card
 Free Sample
 Subscribe





 

Foundations and TrendsĀ® in
Theoretical Computer Science

Editor-in-Chief:
Madhu Sudan,
Dept of CS and EE
M.I.T
Stata Center, Room G640
32 Vassar Street
Cambridge, Massachusetts 02139
USA
people.csail.mit.edu/madhu/

Print ISSN: 1551-305X
Online ISSN: 1551-3068


Americas USD 360 / All other countries EURO 360 (electronic)
Americas USD 410 / All other countries EURO 410 (combined)

Published Issues

Each issue of the journal is available online. If your institution subscribes you will have access to the full text HTML and PDF of the journal. See "Do I have Online Access?
If your institution does not subscribe, each issue is available for purchase as a book or e-book.

Volume 5, Issue 2new
Algorithmic and Analysis Techniques in Property Testing
By Dana Ron (Tel-Aviv University)

Volume 5, Issue 1
On the Power of Small-Depth Computation
By Emanuele Viola (Northeastern University)

Volume 4, Issue 3-4
Spectral Algorithms
By Ravindran Kannan (Microsoft Research) and Santosh Vempala (Georgia Institute of Technology)

Volume 4, Issue 1-2
Complexity Lower Bounds using Linear Algebra
By Satya Lokam (Microsoft Research)

Volume 3, Issue 4
Lower Bounds in Communication Complexity
By Troy Lee (Columbia University) and Adi Shraibman (Weizmann Institute)

Volume 3, Issue 2-3
The Design of Competitive Online Algorithms via a Primal-Dual Approach
By Niv Buchbinder and Joseph (Seffi) Naor (Technion)

Volume 3, Issue 1
Probabilistic Proof Systems: A Primer
By Oded Goldreich (Weizmann Institute of Science, Israel)

Volume 2, Issue 4
Algorithms and Data Structures for External Memory
By Jeff S. Vitter (Purdue)

Volume 2, Issue 3
A Survey of Lower Bounds for Satisfiability and Related Problems
By Dieter van Melkebeek (Wisconsin)

Volume 2, Issue 2
Algorithmic Results in List Decoding
By Venkatesan Guruswami (U. Washington)

Volume 2, Issue 1
Average-Case Complexity
By Andrej Bogdanov (Rutgers) and Luca Trevisan (UC Berkeley)

Volume 1, Issue 4
Pairwise Independence and Derandomization
By Mike Luby and Avi Widgerson

Volume 1, Issue 3
Mathematical Aspects of Mixing Times in Markov Chains
By Ravi Montenegro (U. Mass, Lowell) and Prasad Tetali (Georgia Inst. of Technology)

Volume 1, Issue 2
Data Streams: Algorithms and Applications
By S. Muthukrishnan (Rutgers)

Volume 1, Issue 1free
Foundations of Cryptography - A Primer
By Oded Goldreich (Weizmann Institute)


 

Do I have online access?
If your institution subscribes to this journal or has purchased an issue as an e-book you will be able to access the relevant PDF. To see if you have access to an issue
  • Click on the issue title
  • If you have access you will either see a link to download the journal PDF or open the ebook PDF.
Alert Me
Join our email notification list to receive alerts of published papers and discount book offers.
Alert Me

rss