references.bib

@unpublished{kuko,
 author = {Kováč, Jakub},
 title = {Vyhľadávacie stromy a ich vizualizácia},
 note = {Bakalárska práca, Univerzita Komenského v Bratislave},
 year = {2007},
}

@article{shaffer,
 author = {Shaffer, Clifford A. and Cooper, Matthew L. and Alon, Alexander Joel D. and Akbar, Monika and Stewart, Michael and Ponce, Sean and Edwards, Stephen H.},
 title = {Algorithm Visualization: The State of the Field},
 journal = {Trans. Comput. Educ.},
 issue_date = {August 2010},
 volume = {10},
 issue = {3},
 month = {August},
 year = {2010},
 issn = {1946-6226},
 pages = {9:1--9:22},
 articleno = {9},
 numpages = {22},
 url = {http://doi.acm.org/10.1145/1821996.1821997},
 doi = {http://doi.acm.org/10.1145/1821996.1821997},
 acmid = {1821997},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {AlgoViz Wiki, Algorithm animation, algorithm visualization, community, data structure visualization, free and open source software},
} 

@inproceedings{saraiya,
 author = {Saraiya, Purvi and Shaffer, Clifford A. and McCrickard, D. Scott and North, Chris},
 title = {Effective features of algorithm visualizations},
 booktitle = {Proceedings of the 35th SIGCSE technical symposium on Computer science education},
 series = {SIGCSE '04},
 year = {2004},
 isbn = {1-58113-798-2},
 location = {Norfolk, Virginia, USA},
 pages = {382--386},
 numpages = {5},
 url = {http://doi.acm.org/10.1145/971300.971432},
 doi = {http://doi.acm.org/10.1145/971300.971432},
 acmid = {971432},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {algorithm visualization, courseware, heapsort},
} 

@article{Yao:1985:EPP:3674.3682,
 author = {Yao, Andrew C.},
 title = {On the expected performance of path compression algorithms},
 journal = {SIAM J. Comput.},
 issue_date = {Feb. 1985},
 volume = {14},
 issue = {1},
 month = {February},
 year = {1985},
 issn = {0097-5397},
 pages = {129--133},
 numpages = {5},
 url = {http://dx.doi.org/10.1137/0214010},
 doi = {http://dx.doi.org/10.1137/0214010},
 acmid = {3682},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
} 

@book{Aho:1974:DAC:578775,
 author = {Aho, Alfred V. and Hopcroft, John E.},
 title = {The  Design and Analysis of Computer Algorithms},
 year = {1974},
 isbn = {0201000296},
 edition = {1st},
 publisher = {Addison-Wesley Longman Publishing Co., Inc.},
 address = {Boston, MA, USA},
} 

@article{unif,
 author = {Knight, Kevin},
 title = {Unification: a multidisciplinary survey},
 journal = {ACM Comput. Surv.},
 issue_date = {March 1989},
 volume = {21},
 number = {1},
 month = mar,
 year = {1989},
 issn = {0360-0300},
 pages = {93--124},
 numpages = {32},
 url = {http://doi.acm.org/10.1145/62029.62030},
 doi = {10.1145/62029.62030},
 acmid = {62030},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@article{kruskal, 
 title={On the shortest spanning subtree of a graph and the traveling salesman problem}, 
 volume={7}, 
 url={http://www.ams.org/journals/proc/1956-007-01/S0002-9939-1956-0078686-7/S0002-9939-1956-0078686-7.pdf}, 
 number={1}, 
 journal={Proceedings of the American Mathematical Society}, 
 publisher={American Mathematical Society}, 
 author={Kruskal, Joseph B}, 
 year={1956}, 
 pages={48--50},
}

@article{paths1,
 author = {Tarjan, Robert Endre},
 title = {Applications of Path Compression on Balanced Trees},
 journal = {J. ACM},
 issue_date = {Oct. 1979},
 volume = {26},
 number = {4},
 month = oct,
 year = {1979},
 issn = {0004-5411},
 pages = {690--715},
 numpages = {26},
 url = {http://doi.acm.org/10.1145/322154.322161},
 doi = {10.1145/322154.322161},
 acmid = {322161},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@article{paths2,
 author = {Tarjan, Robert E. and van Leeuwen, Jan},
 title = {Worst-case Analysis of Set Union Algorithms},
 journal = {J. ACM},
 issue_date = {April 1984},
 volume = {31},
 number = {2},
 month = mar,
 year = {1984},
 issn = {0004-5411},
 pages = {245--281},
 numpages = {37},
 url = {http://doi.acm.org/10.1145/62.2160},
 doi = {10.1145/62.2160},
 acmid = {2160},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@article{galil,
 author = {Galil, Zvi and Italiano, Giuseppe F.},
 title = {Data structures and algorithms for disjoint set union problems},
 journal = {ACM Comput. Surv.},
 issue_date = {Sept. 1991},
 volume = {23},
 number = {3},
 month = sep,
 year = {1991},
 issn = {0360-0300},
 pages = {319--344},
 numpages = {26},
 url = {http://doi.acm.org/10.1145/116873.116878},
 doi = {10.1145/116873.116878},
 acmid = {116878},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {equivalence algorithm, partition, set union, time complexity},
} 

@article{comp1,
  author    = {John E. Hopcroft and
               Jeffrey D. Ullman},
  title     = {Set Merging Algorithms},
  journal   = {SIAM J. Comput.},
  volume    = {2},
  number    = {4},
  year      = {1973},
  pages     = {294-303},
  url        = {http://dx.doi.org/10.1137/0202024}
}

@techreport{comp2,
  author		= {Leeuwen, J. and Weide, Th.P. van der},
  title			= {Alternative Path Compression Rules},
  month			= sep,
  institution		= {University of Utrecht, The Netherlands},
  year			= {1977},
  note			= {An outline of the results were presented at the Fachtagung on Algorithms and Complexity Theory, Oberwolfach, Oct 1977.},
  class			= {Conference}
}

@article{fredkin,
 author = {Fredkin, Edward},
 title = {Trie memory},
 journal = {Commun. ACM},
 issue_date = {September 1960},
 volume = {3},
 number = {9},
 month = sep,
 year = {1960},
 issn = {0001-0782},
 pages = {490--499},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/367390.367400},
 doi = {10.1145/367390.367400},
 acmid = {367400},
 publisher = {ACM},
 address = {New York, NY, USA}
} 

@book{knuth,
  author    = {Knuth, Donald E.},
  title     = {The Art of Computer Programming, Volume III: Sorting and Searching},
  publisher = {Addison-Wesley},
  year      = {1973},
  isbn      = {0-201-03803-X}
}

@misc{ca,
    author = {Claudio L. Lucchesi and Cl'audio L. Lucchesi and Tomasz Kowaltowski},
    title = {Applications of Finite Automata Representing Large Vocabularies},
    year = {1992}
}

@book{gusfield,
 author = {Gusfield, Dan},
 title = {Algorithms on strings, trees, and sequences: computer science and computational biology},
 year = {1997},
 isbn = {0-521-58519-8},
 publisher = {Cambridge University Press},
 address = {New York, NY, USA},
} 

@article{burstsort1,
 author = {Sinha, Ranjan and Zobel, Justin},
 title = {Cache-conscious sorting of large sets of strings with dynamic tries},
 journal = {J. Exp. Algorithmics},
 issue_date = {2004},
 volume = {9},
 month = dec,
 year = {2004},
 issn = {1084-6654},
 articleno = {1.5},
 url = {http://doi.acm.org/10.1145/1005813.1041517},
 doi = {10.1145/1005813.1041517},
 acmid = {1041517},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@article{burstsort2,
    author    = {R. Sinha and D. Ring and J. Zobel},
    title     = {Cache-efficient String Sorting using Copying},
    journal   = {J. Exp. Algorithmics},
    volume    = 11,
    year      = {2006},
    issn      = {1084-6654},
    pages     = {1.2},
    publisher = {ACM Press},
    address   = {New York, NY, USA},
}

@phdthesis{liang,
  author={Liang, F.~M.},
  title={Word hy-phen-a-tion by com-put-er},
  school={Stanford University},
  address={Stanford, CA 94305},
  year={1983}
}

@article{patricia,
 author = {Morrison, Donald R.},
 title = {PATRICIA -- Practical Algorithm To Retrieve Information Coded in Alphanumeric},
 journal = {J. ACM},
 issue_date = {Oct. 1968},
 volume = {15},
 number = {4},
 month = oct,
 year = {1968},
 issn = {0004-5411},
 pages = {514--534},
 numpages = {21},
 url = {http://doi.acm.org/10.1145/321479.321481},
 doi = {10.1145/321479.321481},
 acmid = {321481},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@article{scrabble,
  title={The world's fastest Scrabble program},
  author={Appel, A.~W. and Jacobson, G.~J.},
  journal={Communications of the ACM},
  volume={31},
  number={5},
  pages={572--578},
  year={1988},
  publisher={ACM}
}

@inproceedings{radix,
  title={A tree-based packet routing table for Berkeley Unix},
  author={Sklower, K.},
  booktitle={Proceedings of the Winter 1991 USENIX Conference},
  pages={93--104},
  year={1991}
}

@article{ufrem,
  title={Experiments on union-find algorithms for the disjoint-set data structure},
  author={Patwary, M. and Blair, J. and Manne, F.},
  journal={Experimental Algorithms},
  pages={411--423},
  year={2010},
  publisher={Springer}
}

@article{walker,
  title={A node-positioning algorithm for general trees},
  author={Walker~II, John Q.},
  journal={Software: Practice and Experience},
  volume={20},
  number={7},
  pages={685--705},
  year={1990},
  publisher={Wiley Online Library}
}

@article{reingold,
  title={Tidier drawings of trees},
  author={Reingold, E.~M. and Tilford, J.~S.},
  journal={Software Engineering, IEEE Transactions on},
  number={2},
  pages={223--228},
  year={1981},
  publisher={IEEE}
}

@book{left,
 author = {Tarjan, R.~E.},
 title = {Data Structures and Network Algorithms},
 year = {1983},
 edition = {1st},
 publisher = {Society for Industrial and Applied Mathematics}
} 

@article{pairing,
  title={The Pairing Heap: A New Form of Self-Adjusting Heap},
  author={Michael L. Fredman and Robert Sedgewick and Daniel D. Sleator and Robert E. Tarjan},
  journal={Algorithmica},
  pages={111--129},
  year={1986}
}

@article{skew,
  author = {Daniel Dominic Sleator and Robert Endre Tarjan},
  title = {Self-adjusting heaps},
  year = {1986},
  journal = {SIAM J.~COMPUT.}
}

@book{sahni,
author = {D. Mehta,S. Sahni},
title = {Handbook of Data Structures and Applications},
publisher = {Chapman and Hall/CRC Press},
year = {2005},
address = {Boca Raton, New Yourk, Washington D.C., London},
isbn = {1-58488-435-5}
}

@article{chrobak,
  title={A data structure useful for finding Hamiltonian cycles},
  author={Chrobak, M. and Szymacha, T. and Krawczyk, A.},
  journal={Theoretical Computer Science},
  volume={71},
  number={3},
  pages={419--424},
  year={1990},
  publisher={Elsevier}
}

@article{reversals,
  title={Sorting signed permutations by reversals, revisited},
  author={Kaplan, H. and Verbin, E.},
  journal={Journal of Computer and System Sciences},
  volume={70},
  number={3},
  pages={321--341},
  year={2005},
  publisher={Elsevier}
}

@inproceedings{reversals2,
  title={Sorting signed permutations by inversions in {$O(n \log n)$} time},
  author={Swenson, K. and Rajan, V. and Lin, Y. and Moret, B.},
  booktitle={Research in Computational Molecular Biology},
  pages={386--399},
  year={2009},
  organization={Springer}
}

@article{cholesky,
  title={An efficient algorithm to compute row and column counts for sparse Cholesky factorization},
  author={Gilbert, J.R. and Ng, E.G. and Peyton, B.W.},
  journal={SIAM Journal on Matrix Analysis and Applications},
  volume={15},
  pages={1075},
  year={1994}
}

@article{offline-uf,
  title={A linear-time algorithm for a special case of disjoint set union},
  author={Gabow, H.N. and Tarjan, R.E.},
  journal={Journal of computer and system sciences},
  volume={30},
  number={2},
  pages={209--221},
  year={1985},
  publisher={Elsevier}
}

@inproceedings{naps02,
  title={Exploring the role of visualization and engagement in computer science education},
  author={Naps, T.L. and R{\"o}{\ss}ling, G. and Almstrum, V. and Dann, W. and Fleischer, R. and Hundhausen, C. and Korhonen, A. and Malmi, L. and McNally, M. and Rodger, S. and others},
  booktitle={ACM SIGCSE Bulletin},
  volume={35},
  number={2},
  pages={131--152},
  year={2002},
  organization={ACM}
}

@article{hundhausen02,
  title={A meta-study of algorithm visualization effectiveness},
  author={Hundhausen, C.D. and Douglas, S.A. and Stasko, J.T.},
  journal={Journal of Visual Languages \& Computing},
  volume={13},
  number={3},
  pages={259--290},
  year={2002},
  publisher={Elsevier}
}

@article{finger,
  title={A new data structure for representing sorted lists},
  author={Huddleston, S. and Mehlhorn, K.},
  journal={Acta informatica},
  volume={17},
  number={2},
  pages={157--184},
  year={1982},
  publisher={Springer}
}

@inproceedings{pettie,
  title={Towards a final analysis of pairing heaps},
  author={Pettie, S.},
  booktitle={Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on},
  pages={174--183},
  year={2005},
  organization={IEEE}
}

@article{pettie02,
  title={Experimental evaluation of a new shortest path algorithm},
  author={Pettie, S. and Ramachandran, V. and Sridhar, S.},
  journal={Algorithm Engineering and Experiments},
  pages={105--120},
  year={2002},
  publisher={Springer}
}

@article{moret91,
  title={An empirical analysis of algorithms for constructing a minimum spanning tree},
  author={Moret, B. and Shapiro, H.},
  journal={Algorithms and Data Structures},
  pages={400--411},
  year={1991},
  publisher={Springer}
}