From randomizing polynomials to parallel algorithms
暂无分享,去创建一个
Anat Paskin-Cherniavsky | Yuval Ishai | Eyal Kushilevitz | E. Kushilevitz | Y. Ishai | Anat Paskin-Cherniavsky
[1] C. Arf. Untersuchungen über quadratische Formen in Körpern der Charakteristik 2. (Teil I.). , 1941 .
[2] Christopher S. Wallace,et al. A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..
[3] H. Groß,et al. Untersuchungen über quadratische Formen in Körpern der Charakteristik 2. , 1978 .
[4] Leslie G. Valiant,et al. Fast Parallel Computation of Polynomials Using Few Processes , 1981, MFCS.
[5] Allan Borodin,et al. Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[6] Faith Ellen,et al. The parallel complexity of exponentiating polynomials over finite fields , 1985, STOC '85.
[7] Ketan Mulmuley,et al. A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , 1986, STOC '86.
[8] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[9] Judit Bar-Ilan,et al. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction , 1989, PODC '89.
[10] Richard J. Lipton,et al. New Directions In Testing , 1989, Distributed Computing And Cryptography.
[11] A. Ehrenfeucht,et al. The Computational Complexity of ({\it XOR, AND\/})-Counting Problems , 1990 .
[12] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.
[13] Marek Karpinski,et al. An approximation algorithm for the number of zeros or arbitrary polynomials over GF(q) , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[14] Marek Karpinski,et al. Approximating the number of zeroes of a GF[2] polynomial , 1991, SODA '91.
[15] Harald Niederreiter,et al. Introduction to finite fields and their applications: Theoretical Applications of Finite Fields , 1994 .
[16] Yuval Ishai,et al. Randomizing polynomials: A new representation with applications to round-efficient secure computation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[17] Yuval Ishai,et al. Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials , 2002, ICALP.
[18] Yuval Ishai,et al. Efficient Multi-party Computation over Rings , 2003, EUROCRYPT.
[19] Yuval Ishai,et al. Cryptography in NC0 , 2004, FOCS.
[20] Yuval Ishai,et al. COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[21] Venkatesan Guruswami,et al. Algorithms for Modular Counting of Roots of Multivariate Polynomials , 2006, Algorithmica.
[22] Guy N. Rothblum,et al. Verifying and decoding in constant depth , 2007, STOC '07.
[23] Guy N. Rothblum,et al. A (de)constructive approach to program checking , 2008, STOC.
[24] Guy N. Rothblum,et al. On Approximating the Entropy of Polynomial Mappings , 2011, ICS.