PhD Seminar • Algorithms and Complexity — Lazy Search Trees
Please note: This PhD seminar will be given online.
Bryce Sandlund, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ian Munro
Bryce Sandlund, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ian Munro
Reza Adhitya Saputra, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Craig Kaplan
Riana Pfefferkorn, Associate Director
Surveillance and Cybersecurity, Stanford Center for Internet and Society
Aiman Erbad, College of Science and Engineering
Hamad Bin Khalifa University
Topics covered: Blockchain and machine learning
Thi Xuan Vu, PhD candidate
David R. Cheriton School of Computer Science
Supervisors: Professors Éric Schost and George Labahn
Hong Zhou, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Lap Chi Lau
In this talk, we will present a local search framework to design and analyze both combinatorial algorithms and rounding algorithms for experimental design problems. This framework provides a unifying approach to match and improve all known results in D/A/E-design and to obtain new results in previously unknown settings.
Peter Boncz, Senior researcher, Database Architectures, Centrum Wiskunde & Informatica
Special Chair, Large-Scale Analytical Data Management, Vrije Universiteit Amsterdam
Mustafa Abualsaud, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Mark D. Smucker
When search results fail to satisfy users’ information needs, users often reformulate their search query in the hopes of receiving better results. In many cases, users abandon their queries without clicking on any search results.
Eric Dong, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Raouf Boutaba
Jeremy Hartmann, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Daniel Vogel