#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2014

2016

- This year (0)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hicham El-Zein, J. Ian Munro, Siwei Yang
- ISAAC
- 2015

- Hicham El-Zein, J. Ian Munro, Venkatesh Raman
- ISAAC
- 2014

- Hicham El-Zein, J. Ian Munro, Matthew Robertson
- ISAAC
- 2016

Given a permutation of n elements, stored as an array, we address the problem of replacing the permutation by its kth power. We aim to perform this operation quickly using o(n) bits of extra storage. To this end, we first present an algorithm for inverting permutations that uses O(lg2 n) additional bits and runs in O(n lgn) worst case time. This result is… (More)

- Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan
- Algorithmica
- 2016

Given a partition of an n element set into equivalence classes, we study the problem of assigning unique labels to these elements in order to support the query that asks whether the elements corresponding to two given labels belong to the same equivalence class. This has various applications including for testing whether two vertices are in the same… (More)

Let S be a set of n points in an [n] grid, such that each point is assigned a color. Given a query range Q = [a1, b1] × [a2, b2] × . . . × [ad, bd], the geometric range mode query problem asks to report the most frequent color (i.e., a mode) of the multiset of colors corresponding to points in S ∩ Q. When d = 1, Chan et al. (STACS 2012 [2]) gave a data… (More)

In this thesis, we address the problem of quickly inverting the standard representation of a permutation on n elements in place. First, we present a naive algorithm to do it using O(log n) extra bits in O(n) time in the worst case. We then improve that algorithm, using a small bit vector, to use O( √ n) extra bits in O(n √ n) time. Using a different… (More)

- ‹
- 1
- ›