C2 - Ed. Board
Special Issue: FOCS 2003
Hardness of approximating the Shortest Vector Problem in high ℓp norms
Polynomial degree vs. quantum query complexity
On certain connectivity properties of the internet topology
Symmetric polynomials over Zm and simultaneous communication protocols
Logics for reasoning about cryptographic constructions
Lower bounds for non-black-box zero knowledge
Simulated annealing in convex bodies and an O*(n4) volume algorithm
Papers to Appear
C4 - TOC