Theoretical Computer Science

Journal Papers

2012

M. Cheraghchi, F. Didier and A. Shokrollahi
Invertible Extractors and Wiretap Protocols
Ieee Transactions On Information Theory, Vol. 58, pp. 1254-1274, 2012.
detailed record ] [ full document ] [ bibtex ]

1994

A. Shokrollahi
An introduction to the theory of bilinear complexity
Matemática Contemporânea, Vol. 7, pp. 37-58, 1994.
detailed record ] [ full document ] [ bibtex ]

1992

A. Shokrollahi
Optimal algorithms for multiplication in certain finite fields using elliptic curves
SIAM Journal of Computing, Vol. 21, Nr. 6, pp. 1193-1198, 1992.
detailed record ] [ full document ] [ bibtex ]

A. Shokrollahi
Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
Computational Complexity, Vol. 2, Nr. 1, pp. 67-96, 1992.
detailed record ] [ full document ] [ bibtex ]

Conference Papers

Pending

E. Ben-Sasson, G. Maatouk, A. Shpilka and M. Sudan
Symmetric LDPC codes are not necessarily locally testable
2010.
detailed record ] [ full document ] [ bibtex ]

2009

M. Cheraghchi, F. Didier and A. Shokrollahi
Invertible Extractors and Wiretap Protocols
Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 1934--1938, 2009.
detailed record ] [ full document ] [ bibtex ]

M. Cheraghchi
Capacity Achieving Codes from Randomness Conductors
Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 2639--2643, 2009.
detailed record ] [ full document ] [ bibtex ]

M. Cheraghchi and A. Shokrollahi
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 2009.
detailed record ] [ full document ] [ bibtex ]

2006

M. Cheraghchi, A. Shokrollahi and A. Wigderson
Computational Hardness and Explicit Constructions of Error Correcting Codes
Allerton 2006, 2006.
detailed record ] [ full document ] [ bibtex ]

1997

T. Sander and A. Shokrollahi
Deciding properties of number fields without factoring
Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science, FOCS 1997, pp. 46-55, 1997.
detailed record ] [ full document ] [ bibtex ]

Books

1996

P. Buergisser, M. Clausen and A. Shokrollahi
Algebraic Complexity Theory
Heidelberg : Springer Verlag, 1996.
detailed record ] [ full document ] [ bibtex ]

1993

S. Shokranian and A. Shokrollahi
Coding Theory and Bilinear Complexity
Juelich : International Office of the Forschungszentrum Juelich, 1993.
detailed record ] [ full document ] [ bibtex ]

Get this list in bibtex format

Journal Papers

1994

A. Shokrollahi
An introduction to the theory of bilinear complexity
Matemática Contemporânea, Vol. 7, pp. 37-58, 1994.
detailed record ] [ full document ] [ bibtex ]

1992

A. Shokrollahi
Optimal algorithms for multiplication in certain finite fields using elliptic curves
SIAM Journal of Computing, Vol. 21, Nr. 6, pp. 1193-1198, 1992.
detailed record ] [ full document ] [ bibtex ]

A. Shokrollahi
Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
Computational Complexity, Vol. 2, Nr. 1, pp. 67-96, 1992.
detailed record ] [ full document ] [ bibtex ]

Books

1996

P. Buergisser, M. Clausen and A. Shokrollahi
Algebraic Complexity Theory
Heidelberg : Springer Verlag, 1996.
detailed record ] [ full document ] [ bibtex ]

1993

S. Shokranian and A. Shokrollahi
Coding Theory and Bilinear Complexity
Juelich : International Office of the Forschungszentrum Juelich, 1993.
detailed record ] [ full document ] [ bibtex ]

Technical Reports

2005

M. Cheraghchi
On Matrix Rigidity and the Complexity of Linear Forms
Technical Report, 2005.
detailed record ] [ full document ] [ bibtex ]

Get this list in bibtex format