Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling. - Timothy Carpenter; Fabrice Rastello; P. Sadayappan; Anastasios Sidiropoulos (SPAA, 2016)

Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities. - Timothy Carpenter; Ilias Diakonikolas; Anastasios Sidiropoulos; Alistair Stewart (COLT, 2018)

Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. - Timothy Carpenter; Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Anastasios Sidiropoulos (SoCG, 2018)

Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion. - Timothy Carpenter; Ario Salmasi; Anastasios Sidiropoulos (APPROX-RANDOM, 2019)