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

diff --git a/references.bib b/references.bib
index 30da61b..aa971ad 100644
--- a/references.bib
+++ b/references.bib
@@ -1,7 +1,7 @@
 @inproceedings{MW2010,
 	Author = {Moritz Mühlenthaler and Rolf Wanka},
 	Title = {Improving Bitonic Sorting by Wire Elimination},
-	Booktitle = {Proc. 23rd PARS-Workshop on Parallel Systems and Architectures of the 23rd Int. Conf. on Architecture of Computing Systems (ARCS)},
+	Booktitle = {Proc. 23rd PARS-Workshop on Parallel Systems and Architectures of the 23rd International Conference on Architecture of Computing Systems (ARCS)},
 	Year = 2010,
 	ISBN = {978-3-8007-3222-7},
 	Pages = {15--22},
@@ -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,164 @@
 	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 International Conference 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}
+}
+
+@InProceedings{G1972,
+	author    = {M.~W. Green},
+	title     = {Some improvements in non-adaptive sorting algorithms},
+	booktitle = {Proc. 6th Princeton Conference on Information Sciences and Systems (CISS)},
+	pages     = {387--391},
+	year      = 1972
+}
+
+@inproceedings{V1974,
+	author = {David C. Van Voorhis},
+	title = {An economical construction for sorting networks},
+	booktitle = {Proceedings of the May 6--10, 1974, national computer conference and exposition},
+	series = {AFIPS '74},
+	year = {1974},
+	location = {Chicago, Illinois},
+	pages = {921--927},
+	numpages = {7},
+	url = {http://doi.acm.org/10.1145/1500175.1500347},
+	doi = {http://doi.acm.org/10.1145/1500175.1500347},
+	acmid = {1500347},
+	publisher = {ACM},
+	address = {New York, NY, USA}
+}
+
+@inproceedings{DA1998,
+	author    = {Kalyanmoy Deb and Samir Agrawal},
+	title     = {Understanding Interactions among Genetic Algorithm Parameters},
+	booktitle = {Proceedings of the Fifth Workshop on Foundations of Genetic Algorithms},
+	year      = 1998,
+	pages     = {265--286}
+}
+
+@article{ES1998,
+	author = {A.~E. Eiben and C.~A. Schippers},
+	title = {On evolutionary exploration and exploitation},
+	journal = {Fundamenta Informaticae},
+	volume = {35},
+	issue = {1-4},
+	month = {August},
+	year = {1998},
+	issn = {0169-2968},
+	pages = {35--50},
+	numpages = {16},
+	url = {http://portal.acm.org/citation.cfm?id=297119.297124},
+	acmid = {297124},
+	publisher = {IOS Press},
+	address = {Amsterdam, The Netherlands, The Netherlands}
+}
+
+@article{WW2002,
+	author = {Karsten Weicker and Nicole Weicker},
+	title = {Basic principles for understanding evolutionary algorithms},
+	journal = {Fundamenta Informaticae},
+	volume = {55},
+	issue = {3-4},
+	month = {September},
+	year = {2002},
+	issn = {0169-2968},
+	pages = {387--403},
+	numpages = {17},
+	url = {http://portal.acm.org/citation.cfm?id=958775.958783},
+	acmid = {958783},
+	publisher = {IOS Press},
+	address = {Amsterdam, The Netherlands, The Netherlands},
+}