Arash Farzan

Publication Activity (10 Years)

Years Active: 2000-2015
Publications (10 Years): 0

Top Topics

Bounded Treewidth

Tree Decompositions

Top Venues

J. Comput. Geom.

Publications

Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinger
Algorithms in the Ultra-Wide Word Model. TAMC (2015)
Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinger
Algorithms in the Ultra-Wide Word Model. CoRR (2014)
Arash Farzan, J. Ian Munro
A Uniform Paradigm to Succinctly Encode Various Families of Trees. Algorithmica 68 (1) (2014)
Arash Farzan, Shahin Kamali
Compact Navigation and Distance Oracles for Graphs with Small Treewidth. Algorithmica 69 (1) (2014)
Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala
The Hausdorff Core Problem on Simple Polygons. J. Comput. Geom. 5 (1) (2014)
Arash Farzan, Travis Gagie, Gonzalo Navarro
Entropy-bounded representation of point grids. Comput. Geom. 47 (1) (2014)
Amr Elmasry, Arash Farzan, John Iacono
On the hierarchy of distribution-sensitive properties for data structures. Acta Informatica 50 (4) (2013)
Arash Farzan, J. Ian Munro
Succinct encoding of arbitrary graphs. Theor. Comput. Sci. 513 (2013)
Amr Elmasry, Arash Farzan, John Iacono
A priority queue with the time-finger property. J. Discrete Algorithms 16 (2012)
Arash Farzan, J. Ian Munro, Rajeev Raman
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. ICALP (1) (2012)
Arash Farzan, J. Ian Munro, Rajeev Raman
Succinct Indices for Range Queries with applications to Orthogonal Range Maxima CoRR (2012)
Arash Farzan, Johannes Fischer
Compact Representation of Posets. ISAAC (2011)
Arash Farzan, J. Ian Munro
Succinct representation of dynamic trees. Theor. Comput. Sci. 412 (24) (2011)
Amr Elmasry, Arash Farzan, John Iacono
A Unifying Property for Distribution-Sensitive Priority Queues. IWOCA (2011)
Arash Farzan, Shahin Kamali
Compact Navigation and Distance Oracles for Graphs with Small Treewidth. ICALP (1) (2011)
Arash Farzan, Travis Gagie, Gonzalo Navarro
Entropy-Bounded Representation of Point Grids. ISAAC (2) (2010)
Amr Elmasry, Arash Farzan, John Iacono
Priority Queues with Multiple Time Fingers CoRR (2010)
Guy E. Blelloch, Arash Farzan
Succinct Representations of Separable Graphs. CPM (2010)
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
Universal Succinct Representations of Trees? ICALP (1) (2009)
Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. WADS (2009)
Arash Farzan, J. Ian Munro
Dynamic Succinct Ordered Trees. ICALP (1) (2009)
Arash Farzan, J. Ian Munro
Succinct Representations of Arbitrary Graphs. ESA (2008)
Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh
Evaluation of General Set Expressions. ISAAC (2008)
Arash Farzan, J. Ian Munro
A Uniform Approach Towards Succinct Representation of Trees. SWAT (2008)
Sonia Waharte, Arash Farzan, Raouf Boutaba
Min-Max Congestion in Interference-Prone Wireless Mesh Networks. ICC (2007)
Peyman Afshani, Arash Farzan
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull. CCCG (2007)
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh
On the Complexity of Finding an Unknown Cut Via Vertex Queries. COCOON (2007)
Arash Farzan, J. Ian Munro
Succinct representation of finite abelian groups. ISSAC (2006)
Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro
Cache-Oblivious Comparison-Based Algorithms on Multisets. ESA (2005)
Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh
Worst Case Optimal Union-Intersection Expression Evaluation. ICALP (2005)
Mohammad Reza Sadigh, Hamid Sheikhzadeh, Mohammad Reza Jahangir, Arash Farzan
A rule-based approach to farsi language text-to-phoneme conversion. INTERSPEECH (2000)