# Arash Farzan

According to our database

Collaborative distances:

^{1}, Arash Farzan authored at least 26 papers between 2000 and 2015.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2015

Algorithms in the Ultra-Wide Word Model.

Proceedings of the Theory and Applications of Models of Computation, 2015

2014

The Hausdorff Core Problem on Simple Polygons.

JoCG, 2014

A Uniform Paradigm to Succinctly Encode Various Families of Trees.

Algorithmica, 2014

2013

Succinct encoding of arbitrary graphs.

Theor. Comput. Sci., 2013

On the hierarchy of distribution-sensitive properties for data structures.

Acta Inf., 2013

2012

A priority queue with the time-finger property.

J. Discrete Algorithms, 2012

Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima.

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Succinct representation of dynamic trees.

Theor. Comput. Sci., 2011

A Unifying Property for Distribution-Sensitive Priority Queues.

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Compact Representation of Posets.

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Compact Navigation and Distance Oracles for Graphs with Small Treewidth.

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Entropy-Bounded Representation of Point Grids.

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Succinct Representations of Separable Graphs.

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Universal Succinct Representations of Trees?

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Dynamic Succinct Ordered Trees.

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

A Uniform Approach Towards Succinct Representation of Trees.

Proceedings of the Algorithm Theory, 2008

Evaluation of General Set Expressions.

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Succinct Representations of Arbitrary Graphs.

Proceedings of the Algorithms, 2008

2007

Min-Max Congestion in Interference-Prone Wireless Mesh Networks.

Proceedings of IEEE International Conference on Communications, 2007

On the Complexity of Finding an Unknown Cut Via Vertex Queries.

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull.

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Succinct representation of finite abelian groups.

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005

Worst Case Optimal Union-Intersection Expression Evaluation.

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Cache-Oblivious Comparison-Based Algorithms on Multisets.

Proceedings of the Algorithms, 2005

2000

A rule-based approach to farsi language text-to-phoneme conversion.

Proceedings of the Sixth International Conference on Spoken Language Processing, 2000