Sidiropoulos, Anastasios

1. Computing the Gromov-Hausdorff Distance for Metric Trees
   2015/09/18 by Agarwal, Pankaj K., Fox, Kyle, Nath, Abhinandan +2 · 5 citations
   #Computational Geometry (cs.CG) #FOS: Computer and information sciences
2. Beyond the Euler characteristic: Approximating the genus of general graphs
   2014/12/04 by Kawarabayashi, Ken-ichi, Sidiropoulos, Anastasios · 1 citation
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
3. The limited blessing of low dimensionality: when 1-1/d is the best possible exponent for d-dimensional geometric problems
   2016/12/04 by Marx, Dániel, Sidiropoulos, Anastasios · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
4. Sketching and Clustering Metric Measure Spaces
   2018/01/02 by Mémoli, Facundo, Sidiropoulos, Anastasios, Singhal, Kritika · 1 citation
   #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #FOS: Computer and information sciences
5. On the Complexity of Processing Massive, Unordered, Distributed Data
   2006/11/21 by Jon Feldman, Feldman, Jon, S. Muthukrishnan +8 · 1 voice
   Computer Science · #Advanced Database Systems and Queries #Distributed systems and fault tolerance #Optimization and Search Problems #cs.CC #cs.DC
6. Learning Lines with Ordinal Constraints
   2020/04/27 by Fan, Bohan, Centurion, Diego Ihara, Mohammadi, Neshat +3 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)