- CSC 3130: Formal Languages and Automata Theory Lecture 6 The Chinese University of Hong Kong, Fall 2009 Andrej Bogdanov
- CSCI 5440: Cryptography Lecture 6 The Chinese University of Hong Kong 23 February 2011
- CSCI 3130: Formal Languages and Automata Theory Monday 2 November The Chinese University of Hong Kong, Fall 2010 Midterm Exam Solutions
- Pseudorandom bits for polynomials Andrej Bogdanov
- CSC 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2009 Practice Midterm Exam Solutions
- CSCI 5440: Cryptography Lecture 9 The Chinese University of Hong Kong 16 March 2011
- CSCI 3130: Formal Languages and Automata Theory Lecture 16 The Chinese University of Hong Kong, Fall 2010 Andrej Bogdanov
- CSC 5170: Theory of Computational Complexity Lecture 7 The Chinese University of Hong Kong 1 March 2010
- CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2010 Practice Final Exam 2 Solutions
- Pseudorandom generators for low degree polynomials Andrej Bogdanov
- CSCI 5440: Cryptography Lecture 11 The Chinese University of Hong Kong 13 April 2011
- On Worst-Case to Average-Case Reductions for NP Problems Andrej Bogdanov
- Input Locality and Hardness Amplification Andrej Bogdanov
- CSCI 5440: Cryptography Lecture 5 The Chinese University of Hong Kong 16 February 2011
- CSCI 5440: Cryptography Lecture 4 The Chinese University of Hong Kong 11 February 2011
- CSCI 5440: Cryptography Lecture 7 The Chinese University of Hong Kong 2 March 2011
- Foundations and Trends R Theoretical Computer Science
- Hard instances for satisfiability and quasi-one-way functions Andrej Bogdanov
- CSCI 3130: Formal Languages and Automata Theory Tutorial 3 The Chinese University of Hong Kong, Fall 2010 Instructor: Li Fan
- CSCI 3130: Formal Languages and Automata Theory Lecture 15 The Chinese University of Hong Kong, Fall 2010 Andrej Bogdanov
- Gap Amplification Fails Below 1/2 Andrej Bogdanov
- CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2010 Practice Midterm Exam 1
- A stateful implementation of a random function supporting parity queries over hypercubes
- CSC 5170: Theory of Computational Complexity Lecture 2 The Chinese University of Hong Kong 18 January 2010
- CSC 5170: Theory of Computational Complexity Lecture 8 The Chinese University of Hong Kong 8 March 2010
- ON THE SECURITY OF GOLDREICH'S ONE-WAY FUNCTION
- CSCI 5440: Cryptography Lecture 8 The Chinese University of Hong Kong 9 March 2011
- CSC 5170: Theory of Computational Complexity Lecture 10 The Chinese University of Hong Kong 22 March 2010
- CSC 5170: Theory of Computational Complexity Lecture 11 The Chinese University of Hong Kong 29 March 2010
- The Complexity of Distinguishing Markov Random Fields
- CSCI 3130: Formal Languages and Automata Theory Lecture 13 The Chinese University of Hong Kong, Fall 2010 Andrej Bogdanov
- More on Noncommutative Polynomial Identity Testing Andrej Bogdanov Hoeteck Wee
- CSC 5170: Theory of Computational Complexity Lecture 3 The Chinese University of Hong Kong 25 January 2010
- CSCI 3130: Formal Languages and Automata Theory Lecture 7 The Chinese University of Hong Kong, Fall 2010 Andrej Bogdanov
- On extracting common random bits from correlated sources
- Hardness Amplification for Errorless Heuristics Andrej Bogdanov
- Lower Bounds for Testing Bipartiteness in Dense Graphs Andrej Bogdanov
- Power-aware Base Station Positioning for Sensor Networks
- A Linear Lower Bound on the Query Complexity of Property Testing Algorithms for 3-Coloring in
- CSCI 3130: Formal Languages and Automata Theory Monday 25 October The Chinese University of Hong Kong, Fall 2010 Midterm Exam Solutions
- CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2010 Practice Midterm Exam 2
- CSCI 3130: Formal Languages and Automata Theory Tutorial 5 Design CFG and PDA for L = {0n1n : n 0}, where = {0, 1}.
- CSCI 3130: Formal Languages and Automata Theory GUO Siyao The Chinese University of Hong Kong, Fall 2010 Friday 5 November
- CSC 3130: Formal Languages and Automata Theory Lecture 16 The Chinese University of Hong Kong, Fall 2009 Andrej Bogdanov
- CSCI 5440: Cryptography Lecture 1 The Chinese University of Hong Kong 12 January 2011
- CSCI 5440: Cryptography Lecture 2 The Chinese University of Hong Kong 19 January 2011
- CSCI 5440: Cryptography Lecture 3 The Chinese University of Hong Kong 26 January 2011
- CSCI 5440: Cryptography Lecture 10 The Chinese University of Hong Kong 6 April 2011
- CSC 5170: Theory of Computational Complexity Lecture 1 The Chinese University of Hong Kong 11 January 2010
- CSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010
- CSC 5170: Theory of Computational Complexity Lecture 9 The Chinese University of Hong Kong 15 March 2010
- CSC 5170: Theory of Computational Complexity Lecture 12 The Chinese University of Hong Kong 12 April 2010
- CSC 5170: Theory of Computational Complexity Lecture 13 The Chinese University of Hong Kong 19 April 2010
- CSC 3130: Formal Languages and Automata Theory Tutorial 2 The Chinese University of Hong Kong, Fall 2009 Instructor: Li Fan
- CSC 5170: Theory of Computational Complexity Lecture 6 The Chinese University of Hong Kong 22 February 2010
- CSCI 3130: Formal Languages and Automata Theory Tutorial 8 Show ETM = {M : M is a TM and L(M) = } is undecidable.
- CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2010 Practice Final Exam 1 Solutions
- CSC 3130: Formal Languages and Automata Theory Tutorial 6 The Chinese University of Hong Kong, Fall 2009 Instructor: Li Fan
- CSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010
- CSCI 5440: Cryptography Lecture 12 The Chinese University of Hong Kong 20 April 2011
- 29 Aug 2011 Student/Faculty Expectations on Teaching and Learning
- CSCI 3130: Formal Languages and Automata Theory Lecture 16 The Chinese University of Hong Kong, Fall 2011 Andrej Bogdanov
- CSCI 3130: Formal Languages and Automata Theory Lecture 13 The Chinese University of Hong Kong, Fall 2011 Andrej Bogdanov
- CSCI 3130: Formal Languages and Automata Theory Lecture 7 The Chinese University of Hong Kong, Fall 2011 Andrej Bogdanov
- Pseudorandomness for read-once formulas Andrej Bogdanov
- CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2011 Practice Midterm Exam 2
- CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2011 Practice Midterm Exam 1
- CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2011 Practice Midterm Exam
- Homomorphic encryption from codes Andrej Bogdanov
- The Chinese University of Hong Kong, Fall 2011 Friday, October 7 Note on Reducing 3XOR to listing triangles Siyao
- CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2011 Practice Final Exam 2 Solutions
- Quantum Property Testing -A Simple Introduction
- CSCI 3130: Formal Languages and Automata Theory Lecture 13 The Chinese University of Hong Kong, Fall 2011 Andrej Bogdanov
- CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2011 Practice Final Exam 1 Solutions
- CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2011 Practice Midterm Exam 2
- Hard Functions for Low-degree Polynomials over Prime Fields
