Anthony Anthony, Master’s candidate
David R. Cheriton School of Computer Science
Verena Kantere
School of Electrical Engineering and Computer Science, University of Ottawa
Big Data analytics in science and industry are performed on a range of heterogeneous data stores, both traditional and modern, and on a diversity of query engines. Workflows are difficult to design and implement since they span a variety of systems. To reduce development time and processing costs, some automation is needed.
Christian Gorenflo, PhD candidate
David R. Cheriton School of Computer Science
Blockchain technologies are expected to make a significant impact on a variety of industries. However, one issue holding them back is their limited transaction throughput, especially compared to established solutions such as distributed database systems.
Jose Serna, Master’s candidate
David R. Cheriton School of Computer Science
Nolen Scaife, PhD candidate
Florida Institute for Cybersecurity, University of Florida
Credit, debit, and prepaid cards have dominated the payment landscape for decades, empowering the economy. Unfortunately, these legacy systems were not designed for today's adversarial environment, and deployment of new technologies is slow, expensive, and difficult to adopt.
Dan Wolczuk, Faculty of Mathematics
University of Waterloo
In educational psychology, the curse of knowledge refers to the phenomenon that individuals inherently assume that the people they are communicating with have the same knowledge and thought processes as they do.
In this seminar, we will discuss how the curse of knowledge can affect both instructors and students, and we will look at some strategies that instructors can use to try to counteract this and improve student learning.
Yashar Ganjali, Department of Computer Science
University of Toronto
John Wittnebel, Master’s candidate
David R. Cheriton School of Computer Science
In this thesis, we study lower bounds on maximum matchings in 1-planar graphs. We expand upon the tools used for proofs of matching bounds in other classes of graphs as well as some original ideas in order to find these bounds. The first novel results we provide are lower bounds of maximum matching in 1-planar graphs as a function of their minimum degree.
Pedro Velmovitsky, Public Health and Health Systems
University of Waterloo
David Lepofsky, LLB, Osgoode Hall Law School, LL.M, Harvard Law School
Chair, Accessibility for Ontarians with Disabilities Act Alliance
Adjunct Professor, Osgoode Hall Law School