Changeset eeb0767 for doc/bibliography/pl.bib

Timestamp:

Oct 16, 2018, 7:22:39 PM (6 years ago)

Author:

Aaron Moss <a3moss@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, no_list, persistent-indexer, pthread-emulation, qualifiedEnum

Children:

57b0b1f

Parents:

7b61ce8

Message:

Add discussion of variants of environment data structures to thesis

File:

• doc/bibliography/pl.bib (modified) (5 diffs)

doc/bibliography/pl.bib

@@ -1941 +1941 @@
 }
 
+@article{Galil91,
+  keywords = {union-find},
+  contributer = {a3moss@uwaterloo.ca},
+  title={Data structures and algorithms for disjoint set union problems},
+  author={Galil, Zvi and Italiano, Giuseppe F},
+  journal={ACM Computing Surveys (CSUR)},
+  volume={23},
+  number={3},
+  pages={319--344},
+  year={1991},
+  publisher={ACM}
+}
+
 @article{Liskov75,
     keywords    = {abstract data types, encapsulation, verification},
@@ -2078 +2091 @@
     year        = {1998},
     pages       = {393-407},
+}
+
+@book{Aho74,
+  keywords = {algorithms, textbook, union-find},
+  contributer = {a3moss@uwaterloo.ca},
+  title = {The Design and Analysis of Computer Algorithms},
+  author = {Aho, Alfred V and Hopcroft, John E and Ullman, Jeffrey D},
+  year = {1974},
+  publisher = {Addison-Wesley},
+  address = {Reading, MA, USA}
 }
 
@@ -2877 +2900 @@
     month       = oct,
     year        = 1988,
-    pages       = {143-149}
+    pages       = {143--149}
+}
+
+@InProceedings{Patwary10,
+keywords = {union-find},
+contributer = {a3moss@uwaterloo.ca},
+author={Patwary, Md. Mostofa Ali and Blair, Jean and Manne, Fredrik},
+editor={Festa, Paola},
+title={Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure},
+booktitle={Experimental Algorithms},
+year=2010,
+publisher={Springer Berlin Heidelberg},
+address={Berlin, Heidelberg},
+pages={411--423},
+isbn={978-3-642-13193-6}
 }
 
@@ -3554 +3591 @@
     publisher   = {ACM Press},
     address     = {New York, NY, USA},
+}
+
+@article{Galler64,
+  keywords={union-find, original},
+  contributer={a3moss@uwaterloo.ca},
+  title={An improved equivalence algorithm},
+  author={Galler, Bernard A and Fisher, Michael J},
+  journal={Communications of the ACM},
+  volume={7},
+  number={5},
+  pages={301--303},
+  year={1964},
+  publisher={ACM}
 }
 
@@ -7476 +7526 @@
 }
 
+@article{Tarjan84,
+ keywords = {union-find},
+ contributer = {a3moss@uwaterloo.ca},
+ 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},
+} 
+
 % X