#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2010

2015

- This year (0)
- Last 5 years (7)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Greg Aloupis, Mirela Damian, +4 authors Stefanie Wuhrer
- CCCG
- 2011

7 Given a set S of points in the plane representing wireless devices, 8 each point equipped with a directional antenna of radius r and aperture 9 angle α ≥ 180◦, our goal is to find orientations and… (More)

- Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
- ICALP
- 2013

We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any… (More)

- John Iacono, Özgür Özkan
- ArXiv
- 2014

We improve the lower bound on the amortized cost of the decrease-key operation in the pure heap model and show that any pure-heap-model heap (that has a O(log n) amortized-time extract-min operation)… (More)

- Lisa Hellerstein, Özgür Özkan, Linda Sellie
- ISAAC
- 2011

The order type of a point set in Rd maps each (d+1)-tuple of points to its orientation (e.g., clockwise or counterclockwise in R2). Two point sets X and Y have the same order type if there exists a… (More)

- Greg Aloupis, Muriel Dulieu, +4 authors Stefanie Wuhrer
- 2012

We consider the problem of computing an order type invariant labeling for a given set of n points. In 2D, such a labeling can be constructed in O(hn2) time, where h is the size of the smallest convex… (More)

- Boris Aronov, John Iacono, Özgür Özkan, Mark V. Yagnatinsky
- CCCG
- 2013

A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two vertices (see Figure 1). We describe a randomized algorithm that, given n points and an integer k ≥… (More)

- Lisa Hellerstein, Özgür Özkan, Linda Sellie
- Algorithmica
- 2015

We define a variant of $$k$$ k -of- $$n$$ n testing that we call conservative $$k$$ k -of- $$n$$ n testing. We present a polynomial-time, combinatorial algorithm for the problem of maximizing… (More)

- John Iacono, Özgür Özkan
- Data Structures
- 2010

A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: PredecessorSearch,… (More)

- Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan
- ESA
- 2014

Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a… (More)