Computer Science - University of Iowa
http://drupal.cs.grinnell.edu/drupal6/taxonomy/term/563/0
en2/21/19: 4+1 Master's in CS with U.Iowa
http://drupal.cs.grinnell.edu/drupal6/node/1007
<p>Come learn about how you can earn a MSc in CS at U. Iowa with one additional year of school there by taking masterâ€™s level courses during your senior year at Grinnell. We will describe how the <a href="https://cs.uiowa.edu/undergraduate-programs/grinnell-bamcs-u2g-program">4+1 program</a> works, how you might apply for it, and why it might be just right for you. Grinnell and UI faculty will be available to answer any questions about the program.</p>
<p>Students from all class years are welcome, and third-year students are especially encouraged to come. </p>
<p>Pizza lunch will be served for those who RSVP by Wednesday Feb 20.</p>
<p><strong>Thursday, February 21, 2019<br />
12:00-1:00 pm<br />
Noyce 3821</strong></p>
http://drupal.cs.grinnell.edu/drupal6/node/1007#commentsgraduate schoolUniversity of IowaTue, 19 Feb 2019 14:01:53 +0000petersos1007 at http://drupal.cs.grinnell.edu/drupal6Thursday Extra: "Toss a coin, throw a ball, and solve a problem"
http://drupal.cs.grinnell.edu/drupal6/node/754
<p>
On Thursday, October 30, Professor Sriram Pemmarju of the Department of Computer Science at the University of Iowa will discuss the uses of randomness in algorithm design:
</p>
<blockquote>
<p>
Randomness has proven itself to be an amazingly useful resource in the design of simple and efficient algorithms. Randomized algorithms are now widespread in all areas of computer science; examples can be found in cryptography, data compression, distributed systems, machine learning, network protocols, online and streaming algorithms, etc. This talk will present a few “gems” of randomization—algorithms that highlight the elegance and power of randomized techniques, while identifying underlying principles that guide the design of randomized algorithms. Time permitting, the talk will also consider the theoretical question of whether randomness provably adds to the power of efficient algorithms.
</p>
</blockquote>
<p>
Refreshments will be served at 4:15 p.m. in the Computer Science Commons (Noyce 3817). Professor Pemmarju's talk, “Toss a coin, throw a ball,and solve a problem,” will begin at 4:30 p.m. in Noyce 3821. Everyone is welcome to attend!
</p>
http://drupal.cs.grinnell.edu/drupal6/node/754#commentsrandomized algorithmsrandomnessThursday ExtrasUniversity of IowaThu, 23 Oct 2014 21:19:41 +0000stone754 at http://drupal.cs.grinnell.edu/drupal6