Dr. Carson K. Leung's Erdős Number = 3

  1. Béla Bollobás and Pál Erdős. (1962) Gráfelméleti szélsõ értékekre vonatkozó problémákról (Extremal problems in graph theory, in Hungarian). Matematikai Lapok, 13, pages 143-152.

    Béla Bollobás and Paul Erdős. (1976) On a Ramsey-Turán type problem. Journal of Combinatorial Theory, Series B, 21(2), pages 166-168.

  2. Béla Bollobás, Gautam Das, Dimitrios Gunopulos, and Heikki Mannila. (1997) Time-series similarity problems and well-separated geometric sets. In Proceedings of the 13th Annual Symposium on Computational Geometry, Nice, France, pages 454-456.

  3. Carson Kai-Sang Leung, Raymond T. Ng, and Heikki Mannila. (2002) OSSM: A segmentation approach to optimize frequency counting. In Proceedings of the 18th IEEE International Conference on Data Engineering (ICDE 2002), San Jose, CA, USA, pages 583-592.

Reference: MathSciNet Collaboration Distance: Erdős Number