|
Search the dblp DataBase
Arash Farzan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro
Cache-Oblivious Comparison-Based Algorithms on Multisets. [Citation Graph (0, 0)][DBLP] ESA, 2005, pp:305-316 [Conf]
- Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh
Worst Case Optimal Union-Intersection Expression Evaluation. [Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:179-190 [Conf]
- Arash Farzan, J. Ian Munro
Succinct representation of finite abelian groups. [Citation Graph (0, 0)][DBLP] ISSAC, 2006, pp:87-92 [Conf]
- Peyman Afshani, Arash Farzan
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull. [Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:153-155 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:459-469 [Conf]
Succinct Representations of Separable Graphs. [Citation Graph (, )][DBLP]
Succinct Representations of Arbitrary Graphs. [Citation Graph (, )][DBLP]
Universal Succinct Representations of Trees? [Citation Graph (, )][DBLP]
Dynamic Succinct Ordered Trees. [Citation Graph (, )][DBLP]
Min-Max Congestion in Interference-Prone Wireless Mesh Networks. [Citation Graph (, )][DBLP]
Evaluation of General Set Expressions. [Citation Graph (, )][DBLP]
A Uniform Approach Towards Succinct Representation of Trees. [Citation Graph (, )][DBLP]
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|