From Richard Ellmann's foreword to the Nobel Prize Speech Research papers Improved Resolution Lower Bounds for the Weak Pigeonhole Principle , 2001.
English translation is available here .
Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields , joint with D. Grigoriev, in Applicable Algebra in Engineering, Communication and Computing, Vol. Lower Bounds for the Polynomial Calculus , in Computational Complexity , Vol. Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus , joint with A. Wigderson and A. Yao, to appear in Combinatorica . ACM STOC , 1997. Surveys, reviews, lecture scripts etc.