|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 8 keywords
|
|
|
|
|
Results
Found 25 publication records. Showing 25 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz |
Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz |
Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian |
Colorful Strips.  |
Graphs and Combinatorics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz |
Graph Expansion and Communication Costs of Fast Matrix Multiplication  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Alexander Fish, Shamgar Gurevich, Ronny Hadani, Akbar Sayeed, Oded Schwartz |
Computing the Matched Filter in Linear Time  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz |
Minimizing Communication in Numerical Linear Algebra.  |
SIAM J. Matrix Analysis Applications  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz |
Graph expansion and communication costs of fast matrix multiplication: regular submission.  |
SPAA  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitai Armon, Adi Avidor, Oded Schwartz |
Cooperative TSP.  |
Theor. Comput. Sci.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma |
Quantum Expanders: Motivation and Construction.  |
Theory of Computing  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz |
Communication-optimal Parallel and Sequential Cholesky Decomposition.  |
SIAM J. Scientific Computing  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian |
Colorful Strips.  |
LATIN  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz |
Minimizing Communication in Linear Algebra  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz |
Communication-optimal Parallel and Sequential Cholesky Decomposition  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian |
Colorful Strips  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz |
Communication-optimal parallel and sequential Cholesky decomposition: extended abstract.  |
SPAA  |
2009 |
DBLP DOI BibTeX RDF |
Cholesky decomposition, communication avoiding, algorithm, lower bound, latency, bandwidth |
| 1 | Noga Alon, Oded Schwartz, Asaf Shapira |
An Elementary Construction of Constant-Degree Expanders.  |
Combinatorics, Probability & Computing  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma |
Quantum Expanders: Motivation and Constructions.  |
IEEE Conference on Computational Complexity  |
2008 |
DBLP DOI BibTeX RDF |
Quantum Expanders, Quantum Statistical Zero-Knowledge |
| 1 | Noga Alon, Oded Schwartz, Asaf Shapira |
An elementary construction of constant-degree expanders.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Oded Schwartz, Asaf Shapira |
An Elementary Construction of Constant-Degree Expanders.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Shmuel Safra, Oded Schwartz |
On the complexity of approximating tsp with neighborhoods and related problems.  |
Computational Complexity  |
2006 |
DBLP DOI BibTeX RDF |
68Q25, Subject classification. 68Q17 |
| 1 | Elad Hazan, Shmuel Safra, Oded Schwartz |
On the complexity of approximating k-set packing.  |
Computational Complexity  |
2006 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
| 1 | Amitai Armon, Adi Avidor, Oded Schwartz |
Cooperative TSP.  |
ESA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Hazan, Shmuel Safra, Oded Schwartz |
On the Hardness of Approximating k-Dimensional Matching  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Shmuel Safra, Oded Schwartz |
On the Complexity of Approximating TSP with Neighborhoods and Related Problems.  |
ESA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Hazan, Shmuel Safra, Oded Schwartz |
On the Complexity of Approximating k-Dimensional Matching.  |
RANDOM-APPROX  |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #25 of 25 (100 per page; Change: )
|
|