 | 2009 |
|---|
| 12 |       | Arash Farzan,
J. Ian Munro:
Dynamic Succinct Ordered Trees.
ICALP (1) 2009: 439-450 |
| 11 | | Arash Farzan,
Rajeev Raman,
S. Srinivasa Rao:
Universal Succinct Representations of Trees?
ICALP (1) 2009: 451-462 |
| 10 | | 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 |
|---|
| 9 | | Arash Farzan,
J. Ian Munro:
Succinct Representations of Arbitrary Graphs.
ESA 2008: 393-404 |
| 8 | | Ehsan Chiniforooshan,
Arash Farzan,
Mehdi Mirzazadeh:
Evaluation of General Set Expressions.
ISAAC 2008: 366-377 |
| 7 | | Arash Farzan,
J. Ian Munro:
A Uniform Approach Towards Succinct Representation of Trees.
SWAT 2008: 173-184 |
| 2007 |
|---|
| 6 |  | Peyman Afshani,
Arash Farzan:
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull.
CCCG 2007: 153-155 |
| 5 | | 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 |
| 4 | | Sonia Waharte,
Arash Farzan,
Raouf Boutaba:
Min-Max Congestion in Interference-Prone Wireless Mesh Networks.
ICC 2007: 3746-3751 |
| 2006 |
|---|
| 3 | | Arash Farzan,
J. Ian Munro:
Succinct representation of finite abelian groups.
ISSAC 2006: 87-92 |
| 2005 |
|---|
| 2 | | Arash Farzan,
Paolo Ferragina,
Gianni Franceschini,
J. Ian Munro:
Cache-Oblivious Comparison-Based Algorithms on Multisets.
ESA 2005: 305-316 |
| 1 | | Ehsan Chiniforooshan,
Arash Farzan,
Mehdi Mirzazadeh:
Worst Case Optimal Union-Intersection Expression Evaluation.
ICALP 2005: 179-190 |
