Seminar • Algorithms and Complexity — Factoring Polynomials Given as Arithmetic Branching Programs
Please note: This seminar will be given online.
Amit Sinhababu
Aalen University, Germany
Amit Sinhababu
Aalen University, Germany
Ershad Banijamali, PhD candidate
David R. Cheriton School of Computer Science
Reza Adhitya Saputra, PhD candidate
David R. Cheriton School of Computer Science
We present AnimationPak, a technique to create animated packings by arranging animated two-dimensional elements inside a static container. We represent animated elements in a three-dimensional spacetime domain, and view the animated packing problem as a three-dimensional packing in that domain. Every element is represented as a discretized spacetime mesh.
Sebastian Verschoor, PhD candidate
David R. Cheriton School of Computer Science
Stavros Birmpilis, PhD candidate
David R. Cheriton School of Computer Science
Wai Ming Tai, School of Computing
University of Utah
Seminar host: Professor Lap Chi Lau
Junyu Lai, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Justin Wan
Guojun Zhang, PhD candidate
David R. Cheriton School of Computer Science
Supervisors: Professors Yaoliang Yu and Pascal Poupart
Akshay Ramachandran, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Lap Chi Lau
Jennie Rogers, Department of Computer Science
Northwestern University