#### Filter Results:

- Full text PDF available (25)

#### Publication Year

2000

2015

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

#### Organism

Learn More

- Arash Farzan, J. Ian Munro
- SWAT
- 2008

We propose a uniform approach for succinct representation of various families of trees. The method is based on two recursive decomposition of trees into subtrees. Recursive decomposition of a structure into substructures is a common technique in succinct data structures and has been shown fruitful in succinct representation of ordinal trees [7, 10] and… (More)

- Arash Farzan, J. Ian Munro
- Algorithmica
- 2012

We propose a uniform method to encode various types of trees succinctly. These families include ordered (ordinal), k-ary (cardinal), and unordered (free) trees. We will show the approach is intrinsically suitable for obtaining entropy-based encodings of trees (such as the degree-distribution entropy). Previously-existing succinct encodings of trees use ad… (More)

- Arash Farzan, J. Ian Munro
- Theor. Comput. Sci.
- 2011

- Peyman Afshani, Ehsan Chiniforooshan, +4 authors Hamid Zarrabi-Zadeh
- COCOON
- 2007

We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, we make a few assumptions which allow us to obtain an algorithm with the worst case query complexity of O(k) + 2k log n k in which k is the number of vertices adjacent to… (More)

- Arash Farzan, J. Ian Munro
- ESA
- 2008

We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit word RAM model. The adjacency query asks whether there is an edge between two vertices, the neighborhood query reports the neighbors of a given vertex in constant time per neighbor, and the… (More)

- Arash Farzan, Rajeev Raman, S. Srinivasa Rao
- ICALP
- 2009

We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T , our representations support the following operations in O(1) time: (i) BP-substring(i, b), which reports the substring of length b bits (b is at most the wordsize) beginning at position i of the balanced parenthesis representation of… (More)

- Arash Farzan, Travis Gagie, Gonzalo Navarro
- Comput. Geom.
- 2010

We give the first fully compressed representation of a set of m points on an n×n grid, taking H+o(H) bits of space, where H = lg ( n m ) is the entropy of the set. This representation supports range counting, range reporting, and point selection queries, with a performance that is comparable to that of uncompressed structures and that improves upon the only… (More)

- Guy E. Blelloch, Arash Farzan
- CPM
- 2010

We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In particular, we show constanttime support for adjacency, degree and neighborhood queries. For any monotone class of separable graphs, the storage requirement of the representation is optimal… (More)

- Arash Farzan, Shahin Kamali
- Algorithmica
- 2011

Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to build space-efficient encodings (oracles) to perform various queries efficiently. We assume the word RAM model where the size of a word is Ω(logn) bits. The first oracle, we present,… (More)

- Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh
- ICALP
- 2005

We consider the problem of evaluating an expression consisting of unions and intersections of some sorted sets in the comparison model. Given the expression and the sizes of the sets, we are interested in the worst-case complexity of evaluating the expression in terms of the sizes of the sets. We assume the sets in the given expression are independent. We… (More)