You See the Whole Picture When the Puzzle Pieces Match

YU Haifeng

Massively Parallel Aggregation in Dynamic Networks

YU Haifeng

Rank Aggregation: Fairness and Computational Challenges

Diptarka CHAKRABORTY

• Combinatorial Algorithms, Optimisation

Handling Massive Data under the Edit Metric: Clustering, Finding Median and Computational Hardness

Diptarka CHAKRABORTY

• Combinatorial Algorithms, Optimisation

Finding String Similarity: Approximation, Streaming and Pattern Matching

Diptarka CHAKRABORTY

Computational Hardness Assumptions and the Foundations of Cryptography

Prashant Nalini VASUDEVAN

This program seeks to broaden and diversify the foundations of cryptography by identifying new plausible computational hardness assumptions that can be used to construct cryptosystems. Our current approach is to study and construct "fine-grained" cryptographic primitives based on the conjectured hardness of various well-studied algorithmic problems.

• 
• Complexity Theory, Cryptography

Algorithmic Solutions for Fair Resource Allocation

Warut SUKSOMPONG

Computational Methods for Tournament Selection

Warut SUKSOMPONG