X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;f=ga.bib;h=74bc27ecba48df4c797fa5a9896b1e49d12ca512;hb=87823c08e3c0218717e8d6f5b51568c85e813e0d;hp=c56121fadc94a5bcb431d0f6d61015aed1cc4d4e;hpb=fc369bfdd42151e4975b848c03c2b3c98dbeee52;p=ga.git

diff --git a/ga.bib b/ga.bib
index c56121f..74bc27e 100644
--- a/ga.bib
+++ b/ga.bib
@@ -585,3 +585,118 @@
   year={1972},
   publisher={ACM}
 }
+
+@article{ coppersmith:matmult,
+  title={{Matrix multiplication via arithmetic progressions}},
+  author={Coppersmith, D. and Winograd, S.},
+  journal={Journal of symbolic computation},
+  volume={9},
+  number={3},
+  pages={251--280},
+  issn={0747-7171},
+  year={1990},
+  publisher={Elsevier}
+}
+
+@article{ strassen:matmult,
+  title={{Gaussian elimination is not optimal}},
+  author={Strassen, V.},
+  journal={Numerische Mathematik},
+  volume={13},
+  number={4},
+  pages={354--356},
+  issn={0029-599X},
+  year={1969},
+  publisher={Springer}
+}
+
+@article{ szegedy:matmult,
+    author = {Cohn, Henry and Kleinberg, Robert and Szegedy, Balazs and Umans, Christopher},
+    citeulike-article-id = {8349164},
+    citeulike-linkout-0 = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.39},
+    citeulike-linkout-1 = {http://dx.doi.org/10.1109/SFCS.2005.39},
+    doi = {10.1109/SFCS.2005.39},
+    isbn = {0-7695-2468-0},
+    journal = {Foundations of Computer Science, Annual IEEE Symposium on},
+    keywords = {algebraic, complexity, matrix, multiplication},
+    pages = {379--388},
+    posted-at = {2010-12-02 18:55:57},
+    priority = {3},
+    publisher = {IEEE Computer Society},
+    title = {{Group-theoretic Algorithms for Matrix Multiplication}},
+    url = {http://dx.doi.org/10.1109/SFCS.2005.39},
+    year = {2005}
+}
+
+@article{ zwick:apsp,
+    author = {Zwick, Uri},
+    citeulike-article-id = {1027459},
+    citeulike-linkout-0 = {http://dx.doi.org/10.1007/s00453-005-1199-1},
+    citeulike-linkout-1 = {http://www.ingentaconnect.com/content/klu/453/2006/00000046/00000002/00001199},
+    doi = {10.1007/s00453-005-1199-1},
+    issn = {0178-4617},
+    journal = {Algorithmica},
+    month = {October},
+    number = {2},
+    pages = {181--192},
+    posted-at = {2007-01-06 00:46:43},
+    publisher = {Springer},
+    title = {{A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths}},
+    url = {http://dx.doi.org/10.1007/s00453-005-1199-1},
+    volume = {46},
+    year = {2006}
+}
+
+@article{ chan:apsp,
+    author = {Chan, Timothy},
+    citeulike-article-id = {2315328},
+    citeulike-linkout-0 = {http://dx.doi.org/10.1007/s00453-007-9062-1},
+    doi = {10.1007/s00453-007-9062-1},
+    journal = {Algorithmica},
+    keywords = {algorithms, graph},
+    month = {February},
+    number = {2},
+    pages = {236--243},
+    posted-at = {2008-01-31 15:49:43},
+    priority = {2},
+    title = {{All-Pairs Shortest Paths with Real Weights in $O(n^3/\log n)$ Time}},
+    url = {http://dx.doi.org/10.1007/s00453-007-9062-1},
+    volume = {50},
+    year = {2008}
+}
+
+@article{ fredman:apsp,
+  title={{New bounds on the complexity of the shortest path problem}},
+  author={Fredman, M.L.},
+  journal={SIAM Journal on Computing},
+  volume={5},
+  pages={83},
+  year={1976}
+}
+
+@article{ zwick:apspint,
+  title={{All pairs shortest paths using bridging sets and rectangular matrix multiplication}},
+  author={Zwick, U.},
+  journal={Journal of the ACM (JACM)},
+  volume={49},
+  number={3},
+  pages={289--317},
+  issn={0004-5411},
+  year={2002},
+  publisher={ACM}
+}
+
+@inproceedings{ seidel:unitlength,
+ author = {Seidel, Raimund},
+ title = {On the all-pairs-shortest-path problem},
+ booktitle = {Proceedings of the twenty-fourth annual ACM symposium on Theory of computing},
+ year = {1992},
+ isbn = {0-89791-511-9},
+ location = {Victoria, British Columbia, Canada},
+ pages = {745--749},
+ numpages = {5},
+ url = {http://doi.acm.org/10.1145/129712.129784},
+ doi = {http://doi.acm.org/10.1145/129712.129784},
+ acmid = {129784},
+ publisher = {ACM},
+}