This is a course on more complex data structures, and algorithm design and analysis, using the C language. Topics include: advanced and/or balanced search trees; hashing; further asymptotic complexity analysis; standard algorithm design techniques; graph algorithms; complex sort algorithms; and other "classic" algorithms that serve as examples of design techniques.
School: Schaefer School of Engineering & Science
Department: Computer Science
Research & Education
Education
Swarthmore College, BA 1962
MIT, PhD, 1968
Stevens Institute, ME HC, 1978
Research
Mathematical analysis of computational structures; the equational properties of fixed point operations.
Selected Publications
Books
Stephen L Bloom. (1982). Selected Papers of Calvin C. Elgot, Springer-Verlag.
Stephen L Bloom, Zoltan Esik. (1993). Iteration Theories, the equational logic of iterative processes, Springer-Verlag.
Journals
Stephen L Bloom, Zoltan Esik. (2005). "The equational theory of regular words", Information and Computation, 197 (1-2), 55-89.
Stephen L Bloom and C. Choffrut. (2001). "Long words: the theory of concatenation and omega-power", Theoretical Computer Science, (1-2), 533-548.
Stephen L Bloom. (1976). "Varieties of ordered algebras", J. Computers and System Sciences, 13 (2), 200--212.
Stephen L Bloom. (1974). "Some theorems on structural consequence operations", Studia Logica, 34 (1), 1--9.
