ECCC - Pointers to

Login | Register | Classic Style

icon Submit Paper

• Home
• Call for Papers
• Reports
  • A-Z
  • 2025
  • 2024
  • 2023
  • 2025...1994
  • Keywords
• Authors
• Books + Lectures
  • Monographs
  • Lecture Notes
  • Online Lectures
  • Survey Papers
  • Theses
  • Position papers
• About ECCC
  • Call for Papers
  • How to use
  • Scientific Board
  • Local Office
  • Copyright Notice
  • Read more...
• Pointers to
  • Books
  • Lecture Notes
  • Surveys
  • Home pages of theorists
  • Current discussions
  • ECCC Impressions
• Further links
  • Bibliography Data Bases
  • Mathematical Resources
  • Journals
  • People
  • Preprint Servers
  • Electronic Forums
• Newsletter

RSS-Feed

E. Allender:
Complexity Theory Lecture Notes
Availability:

• via Web at http://athos.rutgers.edu:80/~allender/lecture.notes/ as a bunch of 15 Notes.

D. Breslauer and D.P. Dubhashi:
Combinatorics for Computer Scientists
Availability:

• via Web at http://www.brics.aau.dk/BRICS/LS/95/Ref/BRICS-LS-95-Ref/BRICS-LS-95-Ref.html
as one PostScript file BRICS-LS-95-4.ps.gz (~400KB)

D.P. Dubhashi:
Complexity of Logical Theories
Availability:

• via Web as one PostScript file BRICS-LS-95-5.ps.gz (~90KB)

O. Goldreich:
Lecture Notes on Encryption, Signatures and Cryptographic Protocols (1989)
Availability:

• via Web at http://theory.lcs.mit.edu/~oded/ln89.html

O. Goldreich:
Introduction to Complexity Theory
Availability:

• via Web at http://www.wisdom.weizmann.ac.il/~oded/cc.html

J. Hastad:
Complexity Theory
Availability:

• via Web

S. Jukna:
Combinatorial Methods in Complexity Theory
Availability:

• via Web at http://www.thi.informatik.uni-frankfurt.de/~jukna/EC_Book/Topics.

Additional topics for the book Extremal Combinatorics With Applications in Computer Science

M. Karpinski:
Lectures on Randomized Approximation Algorithms
Availability:

• via Web at http://www.thi.informatik.uni-frankfurt.de/~jukna/EC_Book/Topics.

S. Khuller:
Advanced Algorithms
Availability:

• via Web at University Maryland (PostScript 0.5 Mb)

L. Levin:
Fundamentals of Computing
Availability:

• via Web. Notes for the course taught in the Fall of 1986 at UC Berkeley.

L. Lovasz:
Computation Complexity
Availability:

• via ftp as the file "pub/lovasz.pub/complex.ps" at the anonymous ftp site "ftp.cs.yale.edu", as a PostScript file (1,2 Mb).

M. Luby and A. Wigderson:
Pairwise Independence and Derandomization
Availability:

• via Web at ICSI Berkley. Approximately 60 pages.

J. Spencer:
Random Graphs
Availability:

• via Web . A series of nine lectures given at the IMA Summer Graduate Student School held at Ohio State University, August 1993

M. Tompa:
Probabilistic Algorithms and Pseudorandom Generators
Availability:

• via Web
• via ftp as the file /tr/1991/07/UW-CSE-91-07-05.PS.Z at the anonymous ftp site "ftp.cs.washington.edu"

A. Wigderson:
Lectures on the Fusion Method and Derandomization
Availability:

• via Web, or
• via ftp as the file "/pub/tech-reports/library/reports/95/TR95.2.ps.gz" at the anonymous ftp site "ftp.cs.mcgill.ca".

H. Wilf:
Identities and their Computer Proofs
Availability:

• via Web , or
• via ftp as the file "pub/wilf/lecnotes.ps.Z" at the anonymous ftp site "ftp.cis.upenn.edu"; a compressed PostScript file (207 Kb). See the file "pub/wilf/readme.doc", at the same site, for more information.

U. Zwick:
Boolean Circuit Complexity
Availability:

• via Web as a bunch of 12 Notes.

---

ISSN 1433-8092 | Imprint