CG_Hadoop: computational geometry in MapReduce. - Ahmed Eldawy; Yuan Li 013; Mohamed F. Mokbel; Ravi Janardan (SIGSPATIAL/GIS, 2013)

Range search on tuples of points. - Akash Agrawal; Saladi Rahul; Yuan Li 013; Ravi Janardan (J. Discrete Algorithms, 2015)

Colored stochastic dominance problems. - Jie Xue 003; Yuan Li 013 (CoRR, 2016)

Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces. - Jie Xue 003; Yuan Li 013 (WADS, 2017)

On the arrangement of stochastic lines in ℤ2. - Yuan Li 013; Jie Xue 003; Akash Agrawal; Ravi Janardan (J. Discrete Algorithms, 2017)

Approximate Range Closest-Pair Search. - Jie Xue 003; Yuan Li 013; Ravi Janardan (CCCG, 2018)

On the separability of stochastic geometric objects, with applications. - Jie Xue 003; Yuan Li 013; Ravi Janardan (Comput. Geom., 2018)

On the expected diameter, width, and complexity of a stochastic convex hull. - Jie Xue 003; Yuan Li 013; Ravi Janardan (Comput. Geom., 2019)

Scalable computational geometry in MapReduce. - Yuan Li 013; Ahmed Eldawy; Jie Xue 003; Nadezda Knorozova; Mohamed F. Mokbel; Ravi Janardan (VLDB J., 2019)

The most-likely skyline problem for stochastic points. - Akash Agrawal; Yuan Li 013; Jie Xue 003; Ravi Janardan (Comput. Geom., 2020)

Approximate range closest-pair queries. - Jie Xue 003; Yuan Li 013; Ravi Janardan (Comput. Geom., 2020)

Searching for the closest-pair in a query translate. - Jie Xue 003; Yuan Li 013; Saladi Rahul; Ravi Janardan (J. Comput. Geom., 2020)

New Bounds for Range Closest-Pair Problems. - Jie Xue 003; Yuan Li 013; Saladi Rahul; Ravi Janardan (Discret. Comput. Geom., 2022)