default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArash Farzan
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c20]Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinger:
Algorithms in the Ultra-Wide Word Model. TAMC 2015: 335-346- 2014
- [j8]Arash Farzan, J. Ian Munro:
A Uniform Paradigm to Succinctly Encode Various Families of Trees. Algorithmica 68(1): 16-40 (2014) - [j7]Arash Farzan, Shahin Kamali:
Compact Navigation and Distance Oracles for Graphs with Small Treewidth. Algorithmica 69(1): 92-116 (2014) - [j6]Arash Farzan, Travis Gagie
, Gonzalo Navarro:
Entropy-bounded representation of point grids. Comput. Geom. 47(1): 1-14 (2014) - [j5]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): 14-40 (2014) - [i3]Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinger:
Algorithms in the Ultra-Wide Word Model. CoRR abs/1411.7359 (2014) - 2013
- [j4]Amr Elmasry, Arash Farzan, John Iacono:
On the hierarchy of distribution-sensitive properties for data structures. Acta Informatica 50(4): 289-295 (2013) - [j3]Arash Farzan, J. Ian Munro:
Succinct encoding of arbitrary graphs. Theor. Comput. Sci. 513: 38-52 (2013) - 2012
- [j2]Amr Elmasry, Arash Farzan, John Iacono:
A priority queue with the time-finger property. J. Discrete Algorithms 16: 206-212 (2012) - [c19]Arash Farzan, J. Ian Munro, Rajeev Raman:
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. ICALP (1) 2012: 327-338 - [i2]Arash Farzan, J. Ian Munro, Rajeev Raman:
Succinct Indices for Range Queries with applications to Orthogonal Range Maxima. CoRR abs/1204.4835 (2012) - 2011
- [j1]Arash Farzan, J. Ian Munro:
Succinct representation of dynamic trees. Theor. Comput. Sci. 412(24): 2668-2678 (2011) - [c18]Arash Farzan, Shahin Kamali:
Compact Navigation and Distance Oracles for Graphs with Small Treewidth. ICALP (1) 2011: 268-280 - [c17]Arash Farzan, Johannes Fischer:
Compact Representation of Posets. ISAAC 2011: 302-311 - [c16]Amr Elmasry, Arash Farzan, John Iacono:
A Unifying Property for Distribution-Sensitive Priority Queues. IWOCA 2011: 209-222 - 2010
- [c15]Guy E. Blelloch, Arash Farzan:
Succinct Representations of Separable Graphs. CPM 2010: 138-150 - [c14]Arash Farzan, Travis Gagie, Gonzalo Navarro:
Entropy-Bounded Representation of Point Grids. ISAAC (2) 2010: 327-338 - [i1]Amr Elmasry, Arash Farzan, John Iacono:
Priority Queues with Multiple Time Fingers. CoRR abs/1009.5538 (2010)
2000 – 2009
- 2009
- [c13]Arash Farzan, J. Ian Munro:
Dynamic Succinct Ordered Trees. ICALP (1) 2009: 439-450 - [c12]Arash Farzan, Rajeev Raman, S. Srinivasa Rao:
Universal Succinct Representations of Trees? ICALP (1) 2009: 451-462 - [c11]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: 218-229 - 2008
- [c10]Arash Farzan, J. Ian Munro:
Succinct Representations of Arbitrary Graphs. ESA 2008: 393-404 - [c9]Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh:
Evaluation of General Set Expressions. ISAAC 2008: 366-377 - [c8]Arash Farzan, J. Ian Munro:
A Uniform Approach Towards Succinct Representation of Trees. SWAT 2008: 173-184 - 2007
- [c7]Peyman Afshani, Arash Farzan:
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull. CCCG 2007: 153-155 - [c6]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: 459-469 - [c5]Sonia Waharte, Arash Farzan, Raouf Boutaba:
Min-Max Congestion in Interference-Prone Wireless Mesh Networks. ICC 2007: 3746-3751 - 2006
- [c4]Arash Farzan, J. Ian Munro:
Succinct representation of finite abelian groups. ISSAC 2006: 87-92 - 2005
- [c3]Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro:
Cache-Oblivious Comparison-Based Algorithms on Multisets. ESA 2005: 305-316 - [c2]Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh:
Worst Case Optimal Union-Intersection Expression Evaluation. ICALP 2005: 179-190 - 2000
- [c1]Mohammad Reza Sadigh, Hamid Sheikhzadeh, Mohammad Reza Jahangir, Arash Farzan:
A rule-based approach to farsi language text-to-phoneme conversion. INTERSPEECH 2000: 532-535
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
