X-Git-Url: https://git.octo.it/?a=blobdiff_plain;f=references.bib;h=20a37c599593b6c00e1bdc2addcb195343681a25;hb=cddd0282fa78e5b560e46c230f4ee80ed75d21f3;hp=30da61b407bdf432ef0d1ff9e93cf074058d950d;hpb=9c25159564439e81b2d237ef32e5697211a63774;p=diplomarbeit.git

diff --git a/references.bib b/references.bib
index 30da61b..20a37c5 100644
--- a/references.bib
+++ b/references.bib
@@ -10,7 +10,7 @@
 }
 
 @inproceedings{B1968,
-	Author = {Kenneth E. Batcher},
+	Author = {Kenneth~E. Batcher},
 	Title = {Sorting Networks and their Applications},
 	Booktitle = {Proc. AFIPS Spring Joint Comput. Conf., Vol. 32},
 	Year = 1968,
@@ -18,3 +18,98 @@
 	Publisher = {ACM},
 	Address = {New York, NY, USA}
 }
+
+@article{P1992,
+	Author = {Ian Parberry},
+	Title = {The Pairwise Sorting Network},
+	Journal = {Parallel Processing Letters},
+	Year = 1992,
+	Pages = {205--211},
+	Volume = 2,
+	Number = {2,3}
+}
+
+@article{BB2009,
+	Author = {Sherenaz~W. Al-Haj Baddar and Kenneth~E. Batcher},
+	Title = {An 11-Step Sorting Network for 18~Elements},
+	Journal = {Parallel Processing Letters},
+	Year = 2009,
+	Pages = {97--104},
+	Volume = 19,
+	Number = 1
+}
+
+@book{KNUTHBOOK,
+	Author = {Donald~E. Knuth},
+	Title = {The Art of Computer Programming},
+	Publisher = {Addison-Wesley},
+	Year = 2007,
+	Volume = 3,
+	Series = {fixme Series fixme},
+	Edition = 2
+}
+
+@inbook{KNUTH,
+	Author = {Donald~E. Knuth},
+	Title = {Sorting and Searching},
+	Chapter = {5.3.4 Networks for Sorting},
+	Pages = {219--247},
+	Publisher = {Addison-Wesley},
+	Year = 2007,
+	Volume = 3,
+	Series = {The Art of Computer Programming},
+	Edition = {second}
+}
+
+@MastersThesis{M2009,
+	Type = {Diplomarbeit},
+	Author = {Moritz Mühlenthaler},
+	Title = {{Konstruktion von Sortiernetzwerken durch Leitungselimination}},
+	School = {Friedrich-Alexander-Universität Erlangen-Nürnberg},
+	Address = {Lehrstuhl für Informatik~12},
+	Year = 2009,
+	Month = {März}
+}
+
+@inproceedings{J1995_WRONG,
+	Author = {Hugues Juillé},
+	Title = {Evolution of Non-Deterministic Incremental Algorithms as a New Approach for Search in State Spaces},
+	Booktitle = {Lecture Notes in Computer Science},
+	Year = 1995,
+	Pages = {246--260}
+}
+@InProceedings{J1995,
+	author =      {Hugues Juillé},
+	title =       {Evolution of Non-Deterministic Incremental Algorithms as a New Approach for Search in State Space},
+	booktitle =    {Proc. 6th Int. Conf. on Genetic Algorithms (ICGA)},
+	pages =       {351--358},
+	year =        1995
+}
+
+@Article{H1990,
+	author =      {W.~Daniel Hillis},
+	title =       {Co-evolving parasites improve simulated evolution as an optimization procedure},
+	journal =     {Physica D: Nonlinear Phenomena},
+	year =        1990,
+	volume =      42,
+	pages =       {228--234},
+	doi =          {10.1016/0167-2789(90)90076-2}
+}
+
+@inbook{H1992,
+	Author = {W.~Daniel Hillis},
+	Title = {Artificial Life II},
+	Chapter = {Co-evolving parasites improve simulated evolution as an optimization procedure},
+	Publisher = {Addison-Wesley},
+	Year = 1992
+}
+
+@inbook{W2006,
+	Author = {Rolf Wanka},
+	Title = {Approximationsalgorithmen},
+	Chapter = {8 Approximate Counting und die Monte-Carlo-Methode},
+	Pages = {151--186},
+	Year = 2006,
+	Publisher = {Teubner Verlag},
+	Address = {Wiesbaden}
+}