Congratulations to Yanick Fratantonio, who will be joining EURECOM as an Assistant Professor beginning September 2017. Currently, Yanick works in the UCSB Computer Lab with Professors Christopher Kruegel and Giovanni Vigna. His research spans various aspects of mobile security, such as malware detection, vulnerability analysis, characterization of emerging threats, and development of novel protection mechanisms.
Prof. Elizabeth Belding and Graduate Student Morgan Vigil-Hayes receive Best Paper Honorable Mention
CS Newsletter, Winter 2017 The latest newsletter from the Department of Computer Science features profiles of new faculty members, highlights of faculty awards and honors, interviews with accomplished CS undergraduates, and more. To view the full newsletter, please click here.
At the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), Professor Tevfik Bultan presented a keynote talk titled, "Side Channel Analysis Using a Model Counting Constraint Solver and Symbolic Execution." The conference was held at the Chennai Mathematical Institute in Chennai, India from December 13–15, 2016.
The Intelligent User Interface (IUI) steering committee decided in 2016 to acknowledge past IUI papers that had the most impact and highest visibility since being published. The seminal paper, Trust in Recommender Systems by John O’Donovan and Barry Smyth, will be honored with the newly established IUI-Most-Influential-Paper-Award in 2017, during IUI 2017 in Limassol, Cyrus.
Our annual CS holiday party took place December 6, 2016 at Mosher Alumni House on campus. The informal get-together attracted Department of Computer Science faculty, staff, and their family members to enjoy good food and good company as the year draws to a close. Big thanks to CS Business Officer Greta Carl-Halle for organizing this event!
This talk was originally presented at UCSB's Hatlen Theater and hosted by the Office of Summer Sessions
This collaborative project aims to bridge the theoretical and practical aspects of designing efficient and robust solvers for linear systems with Laplacian matrices of graphs. Prof. Gilbert and his team plan to develop code packages that have good practical performance as well as provable guarantees in the worst case.