Ming Lam Leung

  • Citations Per Year
Learn More
We study the communication complexity of symmetric XOR functions, namely functions f : {0, 1}×{0, 1} → {0, 1} that can be formulated as f(x, y) = D(|x⊕ y|) for some predicate D : {0, 1, ..., n} → {0, 1}, where |x⊕ y| is the Hamming weight of the bitwise XOR of x and y. We give a public-coin randomized protocol in the Simultaneous Message Passing (SMP)(More)
We study the communication complexity of symmetric XOR functions, namely functions f : {0, 1}×{0, 1} → {0, 1} that can be formulated as f(x, y) = D(|x⊕ y|) for some predicate D : {0, 1, ..., n} → {0, 1}, where |x⊕ y| is the Hamming weight of the bitwise XOR of x and y. We give a public-coin randomized protocol in the Simultaneous Message Passing (SMP)(More)
Integrating prior molecular network knowledge into interpretation of new experimental data is routine practice in biology research. However, a dilemma for deciphering interactome using Bayes' rule is the demotion of novel interactions with low prior probabilities. Here the authors present constrained generalised logical network (CGLN) inference to predict(More)
In this thesis we extend the recent algebraic approach to design fast algorithms for two problems in combinatorial optimization. First we study the linear matroid parity problem, a common generalization of graph matching and linear matroid intersection, that has applications in various areas. We show that Harvey’s algorithm for linear matroid intersection(More)
  • 1