Shahin Rahbariasl, Master’s candidate
David R. Cheriton School of Computer Science
Corwin Sinnamon, Master’s candidate
David R. Cheriton School of Computer Science
Philipp Kindermann, Postdoctoral Fellow
David R. Cheriton School of Computer Science
The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges.
Anyone who’s poured honey onto a stack of pancakes likely has been intrigued by the golden liquid’s motion as it oozes, buckles and coils like a rope. This behaviour is caused by the high viscosity of honey, a physical property of gooey liquids that makes them resistant to deformation.
Saman Barghi, PhD candidate
David R. Cheriton School of Computer Science
Hamed Haddadi, Senior Lecturer and Deputy Director of Research
Dyson School of Design Engineering
Academic Fellow, Data Science Institute, Imperial College London
Finn Lidbetter, Master’s candidate
David R. Cheriton School of Computer Science
The fundamental problem of additive number theory is to determine whether there exists an integer m such that every nonnegative integer (resp., every sufficiently large nonnegative integer) is the sum of at most m elements of S. If so, we call S an additive basis of order m (resp., an asymptotic additive basis of order m). If such an m exists, we also want to find the smallest such m.
Vern Paxson
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
Chief Scientist, Corelight, Inc.
Lead, Networking and Security Group, International Computer Science Institute
Pavel Valov, PhD candidate
David R. Cheriton School of Computer Science
Pavel Valov, PhD candidate
David R. Cheriton School of Computer Science