Seminar • Algorithms and Complexity — Testing Noisy Linear Equations for Sparsity
Please note: This seminar will be given online.
Anindya De, Department of Computer and Information Science
University of Pennsylvania
Anindya De, Department of Computer and Information Science
University of Pennsylvania
Brittany Postnikoff, Master’s candidate
David R. Cheriton School of Computer Science
This thesis establishes the new field of Robot Social Engineering. We define Robot Social Engineering as the use of social abilities and techniques by robots to manipulate others in order to achieve a goal. We build the field of Robot Social Engineering on the foundations of Human-Robot Interaction research on social robots as well as information security research on social engineering.
Soumik Ghosh, Master’s candidate
David R. Cheriton School of Computer Science
Amin Bandali, Master’s candidate
David R. Cheriton School of Computer Science
Declarative behavioural modelling is a powerful modelling paradigm that enables users to model system functionality abstractly and formally. An abstract model is a concise and compact representation of key characteristics of a system, and enables the stakeholders to reason about the correctness of the system in the early stages of development.
Soroush Ameli, Master’s candidate
David R. Cheriton School of Computer Science
Amit Sinhababu
Aalen University, Germany
Achyudh Ram, Master’s candidate
David R. Cheriton School of Computer Science
Ershad Banijamali, PhD candidate
David R. Cheriton School of Computer Science
Stavros Birmpilis, PhD candidate
David R. Cheriton School of Computer Science
Any nonsingular matrix $A \in \mathbb{Z}^{n\times n}$ is unimodularly equivalent to a unique diagonal matrix $S = diag(s_1, s_2, \ldots, s_n)$ in Smith form. The diagonal entries, the invariant factors of $A$, are positive with $s_1 \mid s_2 \mid \cdots \mid s_n$, and unimodularly equivalent means that there exist unimodular (with determinant ±1) matrices $U, V \in \mathbb{Z}^{n\times n}$ such that $UAV = S$.
Abel Molina, PhD candidate
David R. Cheriton School of Computer Science
We present results on quantum Turing machines and on prover-verifier interactions.