#### Filter Results:

- Full text PDF available (50)

#### Publication Year

1992

2018

- This year (11)
- Last 5 years (39)
- Last 10 years (65)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina
- ACM Trans. Algorithms
- 2008

A common approach for dealing with large datasets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive datasets, however, even making aâ€¦ (More)

- George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos
- Theor. Comput. Sci.
- 2006

We study the speed of convergence to approximately optimal states in two classes of potential games. We provide bounds in terms of the number of rounds, where a round consists of a sequence ofâ€¦ (More)

A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion embeddings haveâ€¦ (More)

- Mihai Badoiu, Kedar Dhamdhere, +4 authors Anastasios Sidiropoulos
- SODA
- 2005

We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the two-dimensional plane. Among other results, we give anâ€¦ (More)

- Krzysztof Onak, Anastasios Sidiropoulos
- Symposium on Computational Geometry
- 2008

We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small aspect ratio, andâ€¦ (More)

- M. Schneider, Peter Zartner, Anastasios Sidiropoulos, Wolfgang E Konertz, Gerd Hausdorf
- European heart journal
- 1998

AIMS
Little is known about the medium term results after stenting of the arterial duct in neonates and infants with duct-dependent cyanotic congenital heart disease. We report the results of stentâ€¦ (More)

- Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos
- SODA
- 2007

We consider the problem of embedding general metrics into trees. We give the first non-trivial approximation algorithm for minimizing the multiplicative distortion. Our algorithm produces anâ€¦ (More)

- Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos
- ACM Trans. Algorithms
- 2005

We introduce a new notion of embedding, called <i>minimum-relaxation ordinal embedding</i>, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedding, it isâ€¦ (More)

- James R. Lee, Anastasios Sidiropoulos
- STOC
- 2011

We exhibit an infinite doubling metric space (X,d) such that for any non-expansive f : X -> L<sub>1</sub>, there exists a pair x,y ∈ X with d(x,y) arbitrarily large, and such thatâ€¦ (More)

We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into Rd, where d is fixed (and small). For d = 1, it was known that approximatingâ€¦ (More)