Nicole Dillen, Master’s candidate
David R. Cheriton School of Computer Science
Guoliang Li, Department of Computer Science
Tsinghua University
Fiodar Kazhamiaka, PhD candidate
David R. Cheriton School of Computer Science
Braden Hurl, Master’s candidate
David R. Cheriton School of Computer Science
Jian Deng, Master’s candidate
David R. Cheriton School of Computer Science
Mohammed Alliheedi, PhD candidate
David R. Cheriton School of Computer Science
Kaleb Alway, Master’s candidate
David R. Cheriton School of Computer Science
Alex Norton, Master’s candidate
David R. Cheriton School of Computer Science
Abeer Khan, Master’s candidate
David R. Cheriton School of Computer Science
Hamidreza Shahidi, Master’s candidate
David R. Cheriton School of Computer Science
Zhong Sheng Hu, Master’s candidate
David R. Cheriton School of Computer Science
Azin Nazari, Master’s candidate
David R. Cheriton School of Computer Science
In this thesis, we study comparison based problems in a new comparison model called three-way, where a comparison can result in { >, =, < }.
Aman Jhunjhunwala, Master’s candidate
David R. Cheriton School of Computer Science
Alexander Sachs, Master’s candidate
David R. Cheriton School of Computer Science
Yerbol Aussat, Master’s candidate
David R. Cheriton School of Computer Science
Jonathan Vi Perrie, Master’s candidate
David R. Cheriton School of Computer Science
Venkateshwaran Balasubramanian, Master’s candidate
David R. Cheriton School of Computer Science
Mohammed Alliheedi, PhD candidate
David R. Cheriton School of Computer Science
The central focus of this thesis is rhetorical moves in biochemistry articles. Kanoksilapatham has provided a descriptive theory of rhetorical moves that extends Swales’ CARS model to the complete biochemistry article. The thesis begins the construction of a computational model of this descriptive theory. Attention is placed on the Methods section of the articles.
Samin Riasat, Master’s candidate
David R. Cheriton School of Computer Science
Benjamin Cassell, PhD candidate
David R. Cheriton School of Computer Science
Camilo Munoz, Master’s candidate
David R. Cheriton School of Computer Science
Rylo Ashmore, Master’s candidate
David R. Cheriton School of Computer Science
Navid Nasr Esfahani, PhD candidate
David R. Cheriton School of Computer Science
Linear All-or-nothing Transforms are unconditionally secure cryptographic tools with various applications, for example, in secure distributed storage and secure network coding.
Spyros Blanas, Department of Computer Science and Engineering
Ohio State University
Rahul Iyer, Master’s candidate
David R. Cheriton School of Computer Science