PhD in Computer Science
Princeton University, 1990
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
Article
Article
Minmax regret for sink location on dynamic flow paths with general capacities
Article
On Huang and Wong’s algorithm for generalized binary split trees
Article
Speeding Up AIFV-m Dynamic Programs by m-1 Orders of Magnitude
Conference paper
On the cost of unsuccessful searches in search trees with two-way comparisons
Article
Scheduling on a graph with release times
Article
Scheduling with gaps: new models and algorithms
Article
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries
Article
Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities
Article
The Transfer Matrices and The Capacity of the 2-dimensional (1,∞)-runlength Limited Constraint
Article
Polynomial Time Algorithms for Constructing Optimal AIFV Codes
Conference paper
The expected number of maximal points of the convolution of two 2-D distributions
Conference paper
Dynamic Trees with Almost-Optimal Access Cost
Conference paper
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks
Conference paper
Conference paper
Encoding 2D range maximum queries
Article
The channel capacity of read/write isolated memory
Article
Sink Evacuation on Trees with Dynamic Confluent Flows
Conference paper
Minimax regret 1-sink location problem in dynamic path networks
Article
Multiple Sink Location Problems in Dynamic Path Networks
Article
Optimal Search Trees with 2-Way Comparisons
Conference paper
Scheduling with Gaps: New Models and Algorithms
Conference paper
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
Article
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
Conference paper
Multiple Sink Location Problems in Dynamic Path Networks
Conference paper
Paging Mobile Users in Cellular Networks: Optimality versus Complexity and Simplicity
Article
HUFFMAN CODING WITH LETTER COSTS: A LINEAR-TIME APPROXIMATION SCHEME
Article
Vehicle scheduling on a graph revisited
Conference paper
Encoding 2D range maximum queries
Conference paper
Online dynamic programming speedups
Article
The Knuth-Yao Quadrangle-Inequality Speedup is a Consequence of Total Monotonicity
Article
Article
A generic top-down dynamic-programming approach to prefix-free coding
Conference paper
Multidimensional divide-and-conquer and weighted digital sums
Conference paper
Multidimensional Divide-and-Conquer and Weighted Digital Sums
Conference paper
More efficient algorithms and analyses for unequal letter cost prefix-free coding
Article
The number of spanning trees in a class of double fixed-step loop networks
Article
The two-median problem on Manhattan meshes
Article
More efficient algorithms and analyses for unequal letter cost prefix-free coding
Conference paper
Online dynamic programming speedups
Conference paper
Paging Mobile Users Efficiently and Optimally
Conference paper
The Asymptotic Number of Spanning Trees in Circulant Graphs
Conference paper
Online maintenance of k-medians and k-covers on a line
Article
Online Dynamic Programming Speedups
Conference paper
Permanents of Circulants: a Transfer Matrix Approach
Conference paper
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity
Conference paper
Chebyshev polynomials and spanning tree formulas for circulant and related graphs
Article
Curve reconstruction from noisy samples
Article
The structure of optimal prefix-free codes in restricted languages: The uniform probability case
Article
Conference paper
Generalizing the Kraft-McMillan Inequality to restricted languages
Conference paper
Competitive facility location: the Voronoi game
Article
Counting spanning trees and other structures in non-constant-jump circulant graphs
Article
Finding optimal paths in MREP routing
Article
Fun-Sort - or the chaos of unordered binary search
Article
Maximum residual energy routing algorithms
Article
New upper and lower bounds on capacity of read/write isolated the channel memory
Article
Online maintenance of k-medians and k-covers on a line
Article
Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters
Article
Online Maintenance of k-Medians and k-Covers on a Line
Conference paper
Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets
Article
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
Article
Algorithms for Infinite Huffman-Codes
Conference paper
Curve reconstruction from noisy samples
Conference paper
Maximum Residual Energy Routing with Reverse Energy Cost
Conference paper
Maximum residual routing with backward energy cost
Conference paper
Conference paper
Residual Energy Routing with Reverse Energy Cost
Conference paper
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
Article
Protection of keys against modification attack
Article
The convex hull for random lines in the plane
Article
Conference paper
Conference paper
Huffman coding with unequal letter costs
Conference paper
New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memory
Conference paper
The probabilistic complexity of the Voronoi diagram of points on a polyhedron
Conference paper
A combinatorial approach to Golomb forests
Article
Competitive facility location along a highway
Article
Article
Competitive facility location: the Voronoi game
Conference paper
Conference paper
Protection of keys against modification attack
Conference paper
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
Article
An algorithm for finding a k-median in a directed tree
Article
The number of spanning trees in circulant graphs
Article
New upper and lower bounds on the channel capacity of read/write isolated memory
Conference paper
On the expected depth of random circuits
Article
Optimal point-to-point broadcast algorithms via lopsided trees
Article
On the optimal placement of Web proxies in the Internet
Conference paper
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
Article
Dog bites postman: Point location in the moving Voronoi diagram and related problems
Article
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues
Article
Randomized data structures for the dynamic closest-pair problem
Article
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
Conference paper
Convergence and construction of minimal-cost infinite trees
Conference paper
Dynamic and distributed Web caching in active networks
Conference paper
On the optimal placement of web proxies in the Internet: The linear topology
Conference paper
Optimal point-to-point broadcast algorithms via lopsided trees
Conference paper
Prefix codes: Equiprobable words, unequal letter costs
Article
Queries on Voronoi diagrams of moving points
Article
Conference paper
Lopsided trees: Analyses, Algorithms, and Applications
Conference paper
A Simple Randomized Closest Pair Algorithm
Article
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
Article
The Multi-Weighted Spanning Tree Problem
Article
A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes for Unequal Letter Costs
Conference paper
Mimimum Spanning Trees forMultiplyWeighted Graphs
Conference paper
A provably fast linear-expected-time maxima-finding algorithm
Article
MELLIN TRANSFORMS AND ASYMPTOTICS - THE MERGESORT RECURRENCE
Article
Newton"s Method for Quadratics and Nested Intervals
Article
Prefix Codes: Equiprobable Words, Unequal Letter Costs
Conference paper
Article
Article
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems
Conference paper
Exact Asymptotics of Divide-and-Conquer Recurrences
Conference paper
Conference paper
Randomized data structures for the dynamic closest-pair problem
Conference paper
Dynamic Closest Pairs: A Probabilistic Approach
Conference paper
Further Dynamic Computational Geometry
Conference paper
Analysis of a Simple yet Efficient Convex Hull Algorithm
Conference paper
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
Minmax regret for sink location on dynamic flow paths with general capacities
On Huang and Wong’s algorithm for generalized binary split trees
Speeding Up AIFV-m Dynamic Programs by m-1 Orders of Magnitude
Counting spanning trees and other structures in non-constant-jump circulant graphs
New upper and lower bounds on capacity of read/write isolated the channel memory
Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters
Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
Dog bites postman: Point location in the moving Voronoi diagram and related problems
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues
Randomized data structures for the dynamic closest-pair problem
Optimal point-to-point broadcast algorithms via lopsided trees
A provably fast linear-expected-time maxima-finding algorithm
MELLIN TRANSFORMS AND ASYMPTOTICS - THE MERGESORT RECURRENCE
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks
Conference paper
Conference paper
Encoding 2D range maximum queries
Article
The channel capacity of read/write isolated memory
Article
Sink Evacuation on Trees with Dynamic Confluent Flows
Conference paper
Minimax regret 1-sink location problem in dynamic path networks
Article
Multiple Sink Location Problems in Dynamic Path Networks
Article
Optimal Search Trees with 2-Way Comparisons
Conference paper
Scheduling with Gaps: New Models and Algorithms
Conference paper
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
Article
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
Conference paper
Multiple Sink Location Problems in Dynamic Path Networks
Conference paper
Paging Mobile Users in Cellular Networks: Optimality versus Complexity and Simplicity
Article
HUFFMAN CODING WITH LETTER COSTS: A LINEAR-TIME APPROXIMATION SCHEME
Article
Vehicle scheduling on a graph revisited
Conference paper
Encoding 2D range maximum queries
Conference paper
Online dynamic programming speedups
Article
The Knuth-Yao Quadrangle-Inequality Speedup is a Consequence of Total Monotonicity
Article
Article
A generic top-down dynamic-programming approach to prefix-free coding
Conference paper
Multidimensional divide-and-conquer and weighted digital sums
Conference paper
Multidimensional Divide-and-Conquer and Weighted Digital Sums
Conference paper
More efficient algorithms and analyses for unequal letter cost prefix-free coding
Article
The number of spanning trees in a class of double fixed-step loop networks
Article
The two-median problem on Manhattan meshes
Article
More efficient algorithms and analyses for unequal letter cost prefix-free coding
Conference paper
Online dynamic programming speedups
Conference paper
Paging Mobile Users Efficiently and Optimally
Conference paper
The Asymptotic Number of Spanning Trees in Circulant Graphs
Conference paper
Online maintenance of k-medians and k-covers on a line
Article
Online Dynamic Programming Speedups
Conference paper
Permanents of Circulants: a Transfer Matrix Approach
Conference paper
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity
Conference paper
Chebyshev polynomials and spanning tree formulas for circulant and related graphs
Article
Curve reconstruction from noisy samples
Article
The structure of optimal prefix-free codes in restricted languages: The uniform probability case
Article
Conference paper
Generalizing the Kraft-McMillan Inequality to restricted languages
Conference paper
Competitive facility location: the Voronoi game
Article
Counting spanning trees and other structures in non-constant-jump circulant graphs
Article
Finding optimal paths in MREP routing
Article
Fun-Sort - or the chaos of unordered binary search
Article
Maximum residual energy routing algorithms
Article
New upper and lower bounds on capacity of read/write isolated the channel memory
Article
Online maintenance of k-medians and k-covers on a line
Article
Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters
Article
Online Maintenance of k-Medians and k-Covers on a Line
Conference paper
Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets
Article
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
Article
Algorithms for Infinite Huffman-Codes
Conference paper
Curve reconstruction from noisy samples
Conference paper
Maximum Residual Energy Routing with Reverse Energy Cost
Conference paper
Maximum residual routing with backward energy cost
Conference paper
Conference paper
Residual Energy Routing with Reverse Energy Cost
Conference paper
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
Article
Protection of keys against modification attack
Article
The convex hull for random lines in the plane
Article
Conference paper
Conference paper
Huffman coding with unequal letter costs
Conference paper
New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memory
Conference paper
The probabilistic complexity of the Voronoi diagram of points on a polyhedron
Conference paper
A combinatorial approach to Golomb forests
Article
Competitive facility location along a highway
Article
Article
Competitive facility location: the Voronoi game
Conference paper
Conference paper
Protection of keys against modification attack
Conference paper
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
Article
An algorithm for finding a k-median in a directed tree
Article
The number of spanning trees in circulant graphs
Article
New upper and lower bounds on the channel capacity of read/write isolated memory
Conference paper
On the expected depth of random circuits
Article
Optimal point-to-point broadcast algorithms via lopsided trees
Article
On the optimal placement of Web proxies in the Internet
Conference paper
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
Article
Dog bites postman: Point location in the moving Voronoi diagram and related problems
Article
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues
Article
Randomized data structures for the dynamic closest-pair problem
Article
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
Conference paper
Convergence and construction of minimal-cost infinite trees
Conference paper
Dynamic and distributed Web caching in active networks
Conference paper
On the optimal placement of web proxies in the Internet: The linear topology
Conference paper
Optimal point-to-point broadcast algorithms via lopsided trees
Conference paper
Prefix codes: Equiprobable words, unequal letter costs
Article
Queries on Voronoi diagrams of moving points
Article
Conference paper
Lopsided trees: Analyses, Algorithms, and Applications
Conference paper
A Simple Randomized Closest Pair Algorithm
Article
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
Article
The Multi-Weighted Spanning Tree Problem
Article
A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes for Unequal Letter Costs
Conference paper
Mimimum Spanning Trees forMultiplyWeighted Graphs
Conference paper
A provably fast linear-expected-time maxima-finding algorithm
Article
MELLIN TRANSFORMS AND ASYMPTOTICS - THE MERGESORT RECURRENCE
Article
Newton"s Method for Quadratics and Nested Intervals
Article
Prefix Codes: Equiprobable Words, Unequal Letter Costs
Conference paper
Article
Article
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems
Conference paper
Exact Asymptotics of Divide-and-Conquer Recurrences
Conference paper
Conference paper
Randomized data structures for the dynamic closest-pair problem
Conference paper
Dynamic Closest Pairs: A Probabilistic Approach
Conference paper
Further Dynamic Computational Geometry
Conference paper
Analysis of a Simple yet Efficient Convex Hull Algorithm
Conference paper
No Publications |
No Publications |
COMP4900 | Academic and Professional Development |
COMP4981 | Final Year Project |
CPEG4901 | Computer Engineering Final Year Project in COMP |
COMP1021 | Introduction to Computer Science |
COMP4900 | Academic and Professional Development |
COMP4981 | Final Year Project |
UROP1100H | Undergraduate Research Opportunities Series 1 |
COMP4981 | Final Year Project |
UROP1100G | Undergraduate Research Opportunities Series 1 |
COMP4900 | Academic and Professional Development |
COMP4981 | Final Year Project |
COMP4981H | Final Year Thesis |
CPEG4901 | Computer Engineering Final Year Project in COMP |
No Teaching Assignments |
No Teaching Assignments |
GAN, Jinxiang
Computer Science and Engineering
CHAN, Siu Chung
Computer Science and Engineering( Completed in 2022 )
NG, Ting Yin
(co-supervision)
Social Science( Completed in 2021 )
Update your browser to view this website correctly. Update your browser now