A rule-based approach to farsi language text-to-phoneme conversion. - Mohammad Reza Sadigh; Hamid Sheikhzadeh; Mohammad Reza Jahangir; Arash Farzan (INTERSPEECH, 2000)

Cache-Oblivious Comparison-Based Algorithms on Multisets. - Arash Farzan; Paolo Ferragina; Gianni Franceschini; J. Ian Munro (ESA, 2005)

Worst Case Optimal Union-Intersection Expression Evaluation. - Ehsan Chiniforooshan; Arash Farzan; Mehdi Mirzazadeh (ICALP, 2005)

Succinct representation of finite abelian groups. - Arash Farzan; J. Ian Munro (ISSAC, 2006)

Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull. - Peyman Afshani; Arash Farzan (CCCG, 2007)

On the Complexity of Finding an Unknown Cut Via Vertex Queries. - Peyman Afshani; Ehsan Chiniforooshan; Reza Dorrigiv; Arash Farzan; Mehdi Mirzazadeh; Narges Simjour; Hamid Zarrabi-Zadeh (COCOON, 2007)

Min-Max Congestion in Interference-Prone Wireless Mesh Networks. - Sonia Waharte; Arash Farzan; Raouf Boutaba (ICC, 2007)

Succinct Representations of Arbitrary Graphs. - Arash Farzan; J. Ian Munro (ESA, 2008)

Evaluation of General Set Expressions. - Ehsan Chiniforooshan; Arash Farzan; Mehdi Mirzazadeh (ISAAC, 2008)

A Uniform Approach Towards Succinct Representation of Trees. - Arash Farzan; J. Ian Munro (SWAT, 2008)

Dynamic Succinct Ordered Trees. - Arash Farzan; J. Ian Munro (ICALP (1), 2009)

Universal Succinct Representations of Trees? - Arash Farzan; Rajeev Raman; S. Srinivasa Rao 001 (ICALP (1), 2009)

Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. - Reza Dorrigiv; Stephane Durocher; Arash Farzan; Robert Fraser; Alejandro López-Ortiz; J. Ian Munro; Alejandro Salinger; Matthew Skala (WADS, 2009)

Succinct Representations of Separable Graphs. - Guy E. Blelloch; Arash Farzan (CPM, 2010)

Priority Queues with Multiple Time Fingers - Amr Elmasry; Arash Farzan; John Iacono (CoRR, 2010)

Compact Representation of Posets. - Arash Farzan; Johannes Fischer 001 (ISAAC, 2011)

A Unifying Property for Distribution-Sensitive Priority Queues. - Amr Elmasry; Arash Farzan; John Iacono (IWOCA, 2011)

Succinct representation of dynamic trees. - Arash Farzan; J. Ian Munro (Theor. Comput. Sci., 2011)

Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. - Arash Farzan; J. Ian Munro; Rajeev Raman (ICALP (1), 2012)

A priority queue with the time-finger property. - Amr Elmasry; Arash Farzan; John Iacono (J. Discrete Algorithms, 2012)

On the hierarchy of distribution-sensitive properties for data structures. - Amr Elmasry; Arash Farzan; John Iacono (Acta Informatica, 2013)

Succinct encoding of arbitrary graphs. - Arash Farzan; J. Ian Munro (Theor. Comput. Sci., 2013)

Compact Navigation and Distance Oracles for Graphs with Small Treewidth. - Arash Farzan; Shahin Kamali (Algorithmica, 2014)

A Uniform Paradigm to Succinctly Encode Various Families of Trees. - Arash Farzan; J. Ian Munro (Algorithmica, 2014)

Entropy-bounded representation of point grids. - Arash Farzan; Travis Gagie; Gonzalo Navarro 001 (Comput. Geom., 2014)

The Hausdorff Core Problem on Simple Polygons. - Reza Dorrigiv; Stephane Durocher; Arash Farzan; Robert Fraser; Alejandro López-Ortiz; J. Ian Munro; Alejandro Salinger; Matthew Skala (J. Comput. Geom., 2014)

Algorithms in the Ultra-Wide Word Model. - Arash Farzan; Alejandro López-Ortiz; Patrick K. Nicholson; Alejandro Salinger (TAMC, 2015)