Added links to other's personal websites

content/research/_index.md

@@ -5,10 +5,10 @@ Description: A list of my research Projects
 
 **[Quick List of Publications](publications)**
 
-**Research Interests:** Automated Reasoning, Artificial Intelligence, Formal Methods
+**Broad Research Interests:** Automated Reasoning, Artificial Intelligence, Formal Methods
 
 ## Symbolic Methods for Cryptography
-Worked with Dr. Andrew Marshall under an ONR grant in collaboration with University at Albany, Clarkson University, University of Texas at Dallas, and the Naval Research lab in order to automatically generated and verify cryptographic algorithms using symbolic (as opposed to computational) methods.
+Worked with [Dr. Andrew Marshall](https://www.marshallandrew.net/) under an ONR grant in collaboration with University at Albany, Clarkson University, University of Texas at Dallas, and the Naval Research lab in order to automatically generated and verify cryptographic algorithms using symbolic (as opposed to computational) methods.
 
 During that time period I built a free algebra library, rewrite library, parts of the crypto tool, and dabbled in Unification algorithms. You can check them out on [Github](https://github.com/symcollab/CryptoSolve).
 
@@ -17,7 +17,7 @@ Currently, I am an external collaborator who mainly helps maintain the codebase
 Through my collaborators, I've learned about term reasoning and algebras. [[Notes]](termreasoning)
 ## Reinforcement Learning
 
-**Deep Reinforcement Learning:** With Dr. Ron Zacharski I focused more on a particular instance of Reinforcement Learning where deep neural networks are used. During this time, I built out a Reinforcement Learning library written in PyTorch. This library helps me have a test bed for trying out different algorithms and attempts to create my own.
+**Deep Reinforcement Learning:** With [Dr. Ron Zacharski](http://zacharski.org/) I focused more on a particular instance of Reinforcement Learning where deep neural networks are used. During this time, I built out a Reinforcement Learning library written in PyTorch. This library helps me have a test bed for trying out different algorithms and attempts to create my own.
 
 One particular problem I'm fascinated by is how to make Reinforcement Learning algoirthms more sample efficient. This means, how can we make it so that it learns more from every observation or make it so that we can achieve our goal quicker?
 
@@ -30,7 +30,7 @@ One particular problem I'm fascinated by is how to make Reinforcement Learning a
 
 
 
-**Reinforcement Learning:** Studied the fundamentals of reinforcement learning with Dr. Stephen Davies. We went over the fundamentals such as value functions, policy functions, how we can describe our environment as a markov decision processes, etc.
+**Reinforcement Learning:** Studied the fundamentals of reinforcement learning with [Dr. Stephen Davies](http://stephendavies.org/). We went over the fundamentals such as value functions, policy functions, how we can describe our environment as a markov decision processes, etc.
 
 [Notes and Other Goodies](reinforcementlearning)
 

content/ta/_index.md

@@ -4,7 +4,7 @@ description: My work as a teaching assistent
 ---
 
 ## Fall 2021
-I am the TA for Dr. Wes Turner and Dr. Uzma Mushtaque's Computer Science 1.
+I am a TA for Dr. Wes Turner and Dr. Uzma Mushtaque's Computer Science 1.
 
 I hold weekly office hours, run two lab sessions, and grade assignments along
 with the other TAs for the class.
@@ -27,7 +27,7 @@ My role involves helping students debug during the lab time. I also create lectu
 
 [Fall 2017/CPSC 220 Lecture Notes](fall2017/cpsc220)
 
-I was the lab aide for Dr. Ron Zacharski's DATA 101 class. My role in his class mostly involved helping students debug during lab time and confirming checkpoints.
+I was the lab aide for [Dr. Ron Zacharski's](http://zacharski.org/) DATA 101 class. My role in his class mostly involved helping students debug during lab time and confirming checkpoints.
 
 I was also a TA for the NVIDIA Computer Vision workshop that he was running at the University. (October 6th 2018)