D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. Journal of Symbolic Computation, 9: 251--290, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Finding a Heaviest Triangle is not Harder than - Matrix Multiplication Artur (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. Journal of Symbolic Computation, 9: 251--290, 1990.
Wu-Ritt Characteristic Sets - And Their Complexity (Correct)
No context found.
Don Coppersmith and Shmuel Winograd. Matrix Multiplication via Arithmetic Progressions. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 1--6, New York City, New York, 25-27, May 1987.
Unknown - (Correct)
No context found.
D. Coppersmith and S. Winograd, `Matrix multiplication via arithmetic progressions', Journal of Symbolic Computation, 9(3), 251--280, (1990).
Loss Functions and Structured Domains for Support Vector Machines - Portera (2005) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251--280, 1990.
An Efficient Recognition Algorithm for Multiple.. - Ryuichi Nakanishi Keita (Correct)
No context found.
D. Coppersmith and S. Winograd: "Matrix Multiplication via Arithmetic Progressions," Proc. 19th Annual ACM Symp. Theory of Computing, 1-6, 1987.
Communication Efficient Secure Linear Algebra - Kobbi Nissim Enav (Correct)
No context found.
D. Coppersmith, and S. Winograd. Matrix Multiplication via Arithmetic Progressions. In Proc. 19th ACN Symp. on Theory of Computing, pp. 1--6, 1987.
Accelerating Cryptanalysis with the Method of Four Russians - Gregory Bard July (2006) (Correct)
No context found.
D. Coppersmith and S. Winograd. "Matrix Multiplication via Arithmetic Progressions." J. of Symbolic Computation, 9. 1990.
Cycle Bases of Graphs and Sampled - Manifolds Craig Gotsman (Correct)
No context found.
D. Coppersmith, S. Winograd, Matrix multiplications via arithmetic progressions., Journal of Symb. Comput. 9 (1990) 251--280.
GLR*: A Robust Grammar-Focused Parser for Spontaneously Spoken.. - Lavie (1996) (1 citation) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix Multiplication via Arithmetic Progressions. In Proceedings of STOC'87, pages 1--6. ACM press, 1987.
Fast Monte-Carlo Algorithms for Approximate Matrix.. - Petros Drineas Yale (2001) (Correct)
No context found.
D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990), no. 3, pp. 251-280. 7
A faster algorithm for Minimum Cycle Basis of graphs - Kavitha, Mehlhorn, Michail, .. (2004) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplications via arithmetic progressions. Journal of Symb. Comput., 9:251-280, 1990.
Optimal 2-Constraint Satisfaction via Sum-Product Algorithms - Koivisto (2005) (Correct)
No context found.
D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (3) (1990) 791--799.
Fast Neighbor Joining - Elias, Lagergren (2005) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In STOC '87, pages 1--6, 1987.
Implementing Minimum Cycle Basis Algorithms - Mehlhorn, Michail (2005) (Correct)
No context found.
Coppersmith, D., Winograd, S.: Matrix multiplications via arithmetic progressions. Journal of Symb. Comput. 9 (1990) 251--280
On the Complexity of Sparse Elimination - Ioannis Emiris Computer (1996) (7 citations) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Computation, 9:251--280, 1990.
Finding Large Sticks and Potatoes in Polygons - Hall-Holt, Katz, Kumar.. (2006) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proc. 9th Annu. ACM Sympos. Theory Comput., pages 1--6, 1987.
An improved bound on Boolean matrix multiplication for.. - Gasieniec, Lingas (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix Multiplication via Arithmetic Progressions. J. of Symbolic Computation 9 (1990), pp. 251-280.
On Exact Algebraic [Non-]Immunity of S-boxes Based on.. - Courtois, Debraize.. (2005) (Correct)
No context found.
Don Coppersmith, Shmuel Winograd: "Matrix multiplication via arithmetic progressions ", J. Symbolic Computation (1990), 9, pp. 251-280.
Error Compensation in Leaf Root Problems - Dom, Guo, Hüffner, Niedermeier (2004) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251--280, 1990. 8
Fully Dynamic Transitive Closure: - Breaking Through The (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251--280, 1990.
On the Power of BFS to Determine a Graph's Diameter - Corneil, Dragan, Köhler (2003) (Correct)
No context found.
D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progression, Proc 19th ACM Symp on Theory of Computing, 1987, pp. 1-- 6.
On Dynamic Shortest Paths Problems - Roditty, Zwick (2004) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251--280, 1990.
Recursion Removal in Fast Matrix Multiplication - Quoc (2003) (Correct)
No context found.
[CopWin1987] D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions The 19th Annual ACM Conference on Theory of computing 1-- 6,New York, New York, United States,ACM Press 1987
Parallel Derandomization Techniques - Yijie Han Department (Correct)
No context found.
D. Coppersmith, S. Winograd. Matrix multiplication via arithmetic progressions. Proc. 19th Ann. ACM Symp. on Theory of Computing, 1-6(1987).
A Fast Derandomization Scheme and Its Applications - Yijie Han Department (1996) (1 citation) (Correct)
No context found.
D. Coppersmith, S. Winograd. Matrix multiplication via arithmetic progressions. Proc. 19th Ann. ACM Symp. on Theory of Computing, 1-6(1987).
An Improvement on Parallel Computation of a Maximal Matching - Han (Correct)
No context found.
D. Coppersmith, S. Winograd. Matrix multiplication via arithmetic progressions. Proc. 19th Ann. ACM Symp. on Theory of Computing, 1-6(1987).
Defying Dimensions Modulo 6 - Grolmusz (2003) (Correct)
No context found.
Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Comput., 9(3):251-280, 1990. 11
Efficient Parallel Algorithms for Optical Computing - With The Discrete (Correct)
No context found.
D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progressions," in Proceedings of the ACM Symposium on the Theory of Computing ~Association for Computing Machinery, New York, 1987!, pp. 1-- 6.
All-Pairs Small-Stretch Paths - Cohen, Zwick (2000) (6 citations) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251--280, 1990.
A 5/2 n² Lower Bound for the Rank of n×n-Matrix.. - Bläser (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. J. Symb. Comp., 9:251--280, 1990.
Unknown - (2001) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. ####### ## ######## ###########, 9:1-6, 1990.
Improved Dynamic Reachability Algorithms for Directed Graphs - Roditty, Zwick (2002) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251--280, 1990.
Exact and Approximate Distances in Graphs - a survey - Zwick (2001) (8 citations) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
Polynomial Time Algorithms for Network Information Flow - Sanders, Egner, Tolhuizen (13 citations) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Computation, 9:251--280, 1990.
Polynomial Time Algorithms for Multicast Network.. - Jaggi, Sanders.. (2003) (1 citation) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
Detecting Short Directed Cycles Using Rectangular Matrix.. - Yuster, Zwick (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251--280, 1990.
Synchronisation-Efficient Parallel All-Pairs Shortest Paths.. - Tiskin (2004) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251-280, March 1990.
Communication-Efficient Parallel Gaussian Elimination - Tiskin (2004) (Correct)
No context found.
D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, Journal of Symbolic Computation 9 (3) (1990) 251-280.
A 5/2 n²-Lower Bound for the Multiplicative Complexity of n.. - Bläser (Correct)
No context found.
Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progression. J. Symbolic Comput., 9:251--280, 1990.
Quantum and Classical Communication-Space Tradeoffs from.. - Klauck (Correct)
No context found.
D. Coppersmith, S. Winograd. Matrix Multiplication via Arithmetic Progressions. J. Symb. Comput. 9(3), pages 251--280, 1990.
Near Quadratic Matrix Multiplication Modulo Composites - Grolmusz (2003) (Correct)
No context found.
Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Comput., 9(3):251--280, 1990.
The Design and Analysis of Bulk-Synchronous Parallel Algorithms - Tiskin (1998) (7 citations) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251--280, March 1990.
Alea jacta est - Verification of Probabilistic, Real-Time and.. - Stoelinga (2002) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proceedings of the 19 Annual ACM Symposium on Theory of Computing, New York City, pages 1--6. ACM, 1987.
All Pairs Almost Shortest Paths - Dor, Halperin, Zwick (1996) (8 citations) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251--280, 1990.
Recognizing Cographs And Threshold Graphs Through A.. - Nikolopoulos (2000) (Correct)
No context found.
A. Coppersmith, S. Winogrand, Matrix multiplication via arithmetic progression, J. Symbolic Comput. 9 (1990) 251-- 280.
Verifying Persistent Security Properties - Bossi, Focardi, Piazza, Rossi (Correct)
No context found.
D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progression, in: Proc. of the 19th Symposium on Theory of Computing, 1987, pp. 1-6.
Fast Multiplication of Interval Matrices - Interval Version Of (2003) (Correct)
No context found.
D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progression", Journal of Symbolic Computation, 1990, Vol. 9, No. 3, pp. 251--280.
The Design and Analysis of Bulk-Synchronous Parallel Algorithms - Tiskin (1998) (7 citations) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251--280, March 1990.
Learning Juntas - Mossel, O'Donnell, Servedio (2003) (1 citation) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proceedings of the Nineteenth Symposium on Theory of Computing, pages 1--6, 1987.
Computational Applications of Noise Sensitivity - O'Donnell (2003) (Correct)
No context found.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Jounal of Symbolic Comp., 9:1--6, 1990.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC