Events & News
CS Colloquium
| Category | Lecture |
| Date | Thursday, January 8, 2015 |
| Time | 11:00 am |
| Concludes | 12:15 pm |
| Location | Gould-Simpson 906 |
| Details | Please join us for coffee and light refreshments at 11am in Gould-Simpson 906. Faculty Host: Lester McCann |
| Speaker | Rachel Baumann |
| Title | M.S. Candidate |
| Affiliation | University of Arizona |
An Introduction to Hashing
Computing today is about speed. Wouldn't it be amazing if we could search large databases and dictionaries in constant time? Well, with some extra information and space we can by using directly addressed arrays. However, in some cases this can cause large amounts of space to go unused. Thus sometimes it’s better to compromise a little on time in order to save on space. We will explore some popular techniques with hashing to achieve this.
Biography
Rachel Baumann is a graduate student instructor at the University of Arizona where she is currently finishing her M.S. degree in Mathematics at the University of Arizona while teaching mathematics courses. Prior to this, she taught for the Computer Science department at the University of Arizona during the summer of 2013. Rachel has a B.S. degree in Mathematics with a minor in Computer Science from the University of Arizona. Her research is primarily in computational group theory on which she is currently working with Klaus Lux.