INSTITUTFÜRINFORMATIK - Lehrstuhl für Effiziente Algorithmen ...

Literaturverzeichnis[AC75][AMS99]Alfred V. Aho und Margaret J. Corasick. Efficient string matching: An aid tobibliographic search. Communications of the ACM, 18(6):333–340, 1975.Noga Alon, Yossi Matias und Mario Szegedy. The space complexity of approximatingfrequency moments. Journal of Computer and System Sciences,58(1):137–147, 1999.[BEHW89] Anselm Blumer, Andrzej Ehrenfeucht, David Haussler und Manfred K. Warmuth.Learnability and the Vapnik-Chervonenkis-Dimension. Journal of theACM, 36(4):929–965, 1989.[BM77] Robert S. Boyer und J. Strother Moore. A fast string searching algorithm.Communications of the ACM, 20(10):762–772, 1977.[CLRS01] Thomas H. Cormen, Charles E. Leiserson, Ron L. Rivest und Clifford Stein.Introduction to Algorithms. 2. Auflage. The MIT Press, Cambridge, MA, 2001.[Col94][CR89]Richard Cole. Tight bounds on the complexity of the Boyer-Moore string matchingalgorithm. SIAM Journal on Computing, 23(5):1075–1091, 1994.Joseph C. Culberson und Piotr Rudnicki. A fast algorithm for constructingtrees from distance matrices. Information Processing Letters, 30(4):215–220,1989.[DGIM02] Mayur Datar, Aristides Gionis, Piotr Indyk und Rajeev Motwani. Maintaininstream statistics over sliding windows. SIAM Journal on Computing,31(6):1794–1813, 2002.[FM85][Gal57][Gal79]Philippe Flajolet und G. Nigel Martin. Probabilistic Counting Algorithms forData Base Applications. Journal of Computer and Systems Sciences, 31(2):182–209, 1985.David A. Gale. A theorem on flows in networks. Pacific Journal of Mathematics,7:1073–1082, 1957.Zvi Galil. On improving the worst case running time of the Boyer-Moore stringmatching algorithm. Communications of the ACM, 22(9):505–508, 1979.[Gao01] Lixin Gao. On inferring autonomous system relationships in the Internet.IEEE/ACM Transactions on Networking, 9(6)733–745, 2001.[GT04]Phillip B. Gibbons und Srikanta N. Tirthapura. Distributed Stream Algorithmsfor Sliding Windows. Theory of Computing Systems, 37(3):457–478, 2004.Version 0.6 Fassung vom 16. Februar 2007