X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;f=biblio.bib;h=e74fa0903e9353d2d8125030a23776f5cf998715;hb=2f5c7308e7d6e11493e8ee68bf52dad2d4c1bda3;hp=5f7c413af3d40b2fe5a92e0b0b6badb2796892c8;hpb=136af12f0e36799f53107c35311faf704c232f9a;p=saga.git diff --git a/biblio.bib b/biblio.bib index 5f7c413..e74fa09 100644 --- a/biblio.bib +++ b/biblio.bib @@ -48,18 +48,6 @@ bibsource = {DBLP, http://dblp.uni-trier.de} } -@inproceedings{ thorup:aczero, - author = {Mikkel Thorup}, - title = {On AC0 implementations of fusion trees and atomic heaps}, - booktitle = {SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms}, - year = {2003}, - isbn = {0-89871-538-5}, - pages = {699--707}, - location = {Baltimore, Maryland}, - publisher = {Society for Industrial and Applied Mathematics}, - address = {Philadelphia, PA, USA}, - } - @article{ benamram:pm, author = "Ben-Amram, Amir M.", title = "What is a ``Pointer Machine''?", @@ -165,7 +153,7 @@ @techreport { pettie:ackermann, author = "Seth Pettie", - title = "{Finding minimum spanning trees in $O(m\alpha(m,n))$ time}", + title = "{Finding minimum spanning trees in $\O(m\alpha(m,n))$ time}", institution = "Univ. of Texas at Austin", year = "1999", number = "TR99-23", @@ -266,7 +254,7 @@ publisher = "Springer Verlag" } -@inproceedings{ thorup:ac0, +@inproceedings{ thorup:aczero, author = {Mikkel Thorup}, title = {{On ${\rm AC}^0$ Implementations of Fusion Trees and Atomic Heaps}}, booktitle = {SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms}, @@ -293,13 +281,13 @@ title={{Graph Theory}}, author={Diestel, R.}, year={2005}, - publisher={Springer-Verlag Berlin and Heidelberg GmbH \& Co. K} + publisher={Springer-Verlag Berlin and Heidelberg GmbH \& Co.} } @article{ thorup:pq, title={{Integer priority queues with decrease key in constant time and the single source shortest paths problem}}, author={Thorup, M.}, - journal={Proceedings of the thirty-fifth ACM symposium on Theory of computing}, + journal={Proceedings of the thirty-fifth ACM Symposium on Theory of Computing}, pages={149--158}, year={2003}, publisher={ACM Press New York, NY, USA} @@ -345,21 +333,23 @@ } @article{ choquet:mst, - title={{Etude de certains r{\'e}seaux de routes (in French)}}, + title={{Etude de certains r{\'e}seaux de routes}}, author={Choquet, Gustave}, journal={Comptes-rendus de l'Académie des Sciences}, volume={206}, pages={310}, - year={1938} + year={1938}, + note={French} } @incollection { sollin:mst, - title={{Le trace de canalisation (in French)}}, + title={{Le trace de canalisation}}, author={Sollin, M.}, booktitle={Programming, Games, and Transportation Networks}, editor={Berge, C. and Ghouilla-Houri, A.}, publisher={Wiley, New York}, - year={1965} + year={1965}, + note={French} } @article{ boyer:cutting, @@ -426,7 +416,7 @@ inproceedings{ pettie:minirand, author = {Seth Pettie and Vijaya Ramachandran}, title = {Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms}, - booktitle = {SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms}, + booktitle = {SODA '02: Proceedings of the thirteenth annual ACM-SIAM Symposium on Discrete Algorithms}, year = {2002}, isbn = {0-89871-513-X}, pages = {713--722}, @@ -438,7 +428,7 @@ inproceedings{ pettie:minirand, @article{ buchsbaum:verify, title={{Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators}}, author={Buchsbaum, A.L. and Kaplan, H. and Rogers, A. and Westbrook, J.R.}, - journal={Proceedings of the thirtieth annual ACM symposium on Theory of computing}, + journal={Proceedings of the thirtieth annual ACM Symposium on Theory of Computing}, pages={279--288}, year={1998}, publisher={ACM Press New York, NY, USA} @@ -537,7 +527,7 @@ inproceedings{ pettie:minirand, @inproceedings{ cook:ram, author = {Stephen A. Cook and Robert A. Reckhow}, title = {Time-bounded random access machines}, - booktitle = {STOC '72: Proceedings of the fourth annual ACM symposium on Theory of computing}, + booktitle = {STOC '72: Proceedings of the fourth annual ACM Symposium on Theory of Computing}, year = {1972}, pages = {73--80}, location = {Denver, Colorado, United States}, @@ -572,7 +562,7 @@ inproceedings{ pettie:minirand, } @article{ fredman:sst, - title={{Storing a Sparse Table with 0 (1) Worst Case Access Time}}, + title={{Storing a Sparse Table with $\O(1)$ Worst Case Access Time}}, author={Fredman, M.L. and Koml{\'o}s, J. and Szemer{\'e}di, E.}, journal={Journal of the ACM (JACM)}, volume={31}, @@ -601,16 +591,16 @@ inproceedings{ pettie:minirand, } @article{ han:detsort, - title={{Deterministic sorting in O (nlog log n) time and linear space}}, + title={{Deterministic sorting in $\O(n \log\log n)$ time and linear space}}, author={Han, Y.}, - journal={Proceedings of the thiry-fourth annual ACM symposium on Theory of computing}, + journal={Proceedings of the thiry-fourth annual ACM Symposium on Theory of Computing}, pages={602--608}, year={2002}, publisher={ACM Press New York, NY, USA} } @article{ hanthor:randsort, - title={{Integer Sorting in 0 (n sqrt (log log n)) Expected Time and Linear Space}}, + title={{Integer Sorting in $\O(n\sqrt{\log\log n})$ Expected Time and Linear Space}}, author={Han, Y. and Thorup, M.}, journal={Proceedings of the 43rd Symposium on Foundations of Computer Science}, pages={135--144}, @@ -625,3 +615,27 @@ inproceedings{ pettie:minirand, pages={2--9}, year={1995} } + +@article{ brodnik:lsb, + title={{Computation of the least significant set bit}}, + author={Brodnik, A.}, + journal={Proceedings of the 2nd Electrotechnical and Computer Science Conference, Portoroz, Slovenia}, + year={1993} +} + +@article{ turan:succinct, + title={{Succinct representation of graphs.}}, + author={Tur\'an, G.}, + journal={Discrete Applied Mathematics}, + volume={8}, + number={3}, + pages={289--294}, + year={1984} +} + +@book{ jones:haskell, + title={{Haskell 98 Language and Libraries: The Revised Report}}, + author={Jones, P. and Simon, L.}, + year={2003}, + publisher={Cambridge University Press} +}