Gerald Huang

Intro

Hi there!

I am a first year PhD student at the University of Melbourne with interest in theoretical computer science. At the core, my research interests try to ask: given our computational resources, what sort of problems can we compute efficiently? The vast enterprise of the theory of computation led me to algorithm theory (a subfield of theoretical computer science where we describe methods to solve problems efficiently) and complexity theory (a subfield where we describe methods to show that other problems cannot be solved efficiently). In particular, I study various algorithmic methods such as quantum algorithms, exact and exponential algorithms, and parameterised algorithms. I also study circuit and proof complexity on the complexity theory side, as well as various hardness proofs for other kinds of puzzles that I like.

When I'm not doing research, you may see me working on leisure articles on interesting topics that I share as well as learning about recreational algorithmic and mathematical puzzles.

Education

Doctor of Philosophy in Computer Science, University of Melbourne, 2024 – 2028.
Bachelor of Science in Computer Science with Honours Class I, Bachelor of Science in Mathematics (Pure Mathematics) with Distinction, University of New South Wales, 2018 – 2024.

Research Interests

I am a theoretical computer scientist with deep interests in computational complexity theory, algorithm design, number theory, combinatorics, and cryptography. I am currently authoring two books: An Invitation to Algorithm Design and Analysis and An Invitation to Combinatorics. See here for some of my work!

Teaching

I have previously taught courses in algorithm design, theory of computation, and have mentored students in the capstone computer science project, at the undergraduate and graduate level. See here for more details!

Work

Publications

Quantum Algorithms for the Steiner Tree Problem. Serge Gaspers, Gerald Huang.

Talks

Revision Sessions

Notes and Articles

I have listed below some notes, many of which are still in (draft) form. Notes that are in draft form are labelled as "draft". You can find a complete list here! You can also find a complete list of lecture notes!

Teaching

I have taught at several universities, particularly in the topics of algorithm design, theory of computation, and verification. I have listed below all of the courses that I have tutored, either as a lab assistant or as a teaching assistant. Where applicable, I have also included the ratings as reported by the student survey at the end of every term.

Instructions

University of New South Wales (2024)

Teaching Assistant (Postgraduate)

The University of Melbourne

Teaching Assistant (Undergraduate)

University of New South Wales (2021 – 2024)

University of Sydney (2023 – 2024)

About

Lorem ipsum dolor sit amet, consectetur et adipiscing elit. Praesent eleifend dignissim arcu, at eleifend sapien imperdiet ac. Aliquam erat volutpat. Praesent urna nisi, fringila lorem et vehicula lacinia quam. Integer sollicitudin mauris nec lorem luctus ultrices. Aliquam libero et malesuada fames ac ante ipsum primis in faucibus. Cras viverra ligula sit amet ex mollis mattis lorem ipsum dolor sit amet.

Articles

In my undergraduate studies, I decided to document a lot of concepts that I find interesting. Naturally, I write a lot about subjects that I've either extensively studied on my own or have come across in class. Drafts are labelled as such and appear after all of the finished notes. I hope you enjoy perusing through my collection and have learned something new in the process.

Lecture Notes

Here are some lecture notes that I've taken over my undergraduate career. Many of the notes are still in draft form and will most likely have errors. Use with caution!

Contact

• Twitter
• Facebook
• Instagram
• GitHub

Elements

i = 0;

while (!deck.isInOrder()) {
    print 'Iteration ' + i;
    deck.shuffle();
    i++;
}

print 'It took ' + i + ' iterations to sort the deck.';