Arash Farzan

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