98 Literaturverzeichnis[GT02]Michael T. Goodrich und Roberto Tamassia. Algorithm Design: Foundations,Analysis, and Internet Examples. John Wiley & Sons, Inc., Chichester, UK,2002.[Hak62] S. Louis Hakimi. On the realizability of a set of integers as degrees of thevertices of a linear graph. I. Journal of the SIAM, 10(3):496–506, 1962.[HY65][Hav55][Hum06]S. Louis Hakimi und S. S. Yau. Distance matrix of a graph and its realizability.Quarterly of Applied Mathematics, 22:305–317, 1965.Václav Havel. Eine Bemerkung über die Existenz der endlichen Graphen. InTschechisch. Casopis pro Pestováni Matematiky, 80:477–480, 1955.Benjamin Frank Hummel. Automata-based IP Packet Classification. Diplomarbeit,Fakultät für Informatik, Technische Universität München, 2006.[Kle03] Jon M. Kleinberg. Detecting a Network Failure. Internet Mathematics, 1(1):37–56, 2003.[KMP77]Donald E. Knuth, James H. Morris, Jr. und Vaughan R. Pratt. Fast patternmatching in strings. SIAM Journal on Computing, 6(2):323–350, 1977.[KMT06] Sven Kosub, Moritz G. Maaß und Hanjo Täubig. Acyclic Type-of-RelationshipProblems on the Internet. In Proceedings of the 3rd Workshop on Combinatorialand Algorithmic Aspects of Networking (CAAN’2006), Band 4235 der LectureNotes in Computer Science, S. 98–111. Springer-Verlag, Berlin, 2006.[KR03] James F. Kurose und Keith W. Ross. Computer Networking: A Top-DownApproach Featuring the Internet. 2. Auflage. Addison-Wesley, Boston, MA,2003.[KSP03][LS62][Myh57][Ner58]Richard M. Karp, Scott J. Shenker, and Christos H. Papadimitriou. A simplealgorithm for finding frequent elements in streams and bags. ACM Transactionson Database Systems, 28(1):51–55, 2003.Roger C. Lyndon und Marcel Paul Schützenberger. The equation a M = b N c Pin a free group. Michigan Mathematical Journal, 9:289–298, 1962.John R. Myhill. Finite automata and the representations of events. WADCTR-57-624, Wright Air Development Center, Air Research and DevelopmentCommand, United States Air Force, Wright-Patterson Air Force Base, Ohio,1957.Anil Nerode. Linear automaton transformations. Proceedings of the AmericanMathematical Society, 9:541–544, 1958.[Rys57] Herbert J. Ryser. Combinatorial properties of matrices of zeroes and ones.Canadian Journal of Mathematics, 9:371–377, 1957.Skriptum zu Internet-Algorithmik WS 2006/2007
Literaturverzeichnis 99[SV99][Var05]Venkatachary Srinivasan und George Varghese. Fast Address Lookups UsingControlled Prefix Expansion. ACM Transactions on Computer Systems,17(1):1–40, 1999.George Varghese. Network Algorithmics: An Interdisciplinary Approach to DesigningFast Networked Devices. Morgan Kaufmann Publishers, San Francisco,CA, 2005.Version 0.6 Fassung vom 16. Februar 2007