BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Greece
1 × Portugal
1 × Switzerland
1 × United Kingdom
Collaborated with:
J.I.Munro R.Raman S.Kamali S.S.Rao E.Chiniforooshan M.Mirzazadeh
Talks about:
succinct (3) tree (2) rang (2) treewidth (1) represent (1) intersect (1) orthogon (1) univers (1) express (1) distanc (1)

Person: Arash Farzan

DBLP DBLP: Farzan:Arash

Contributed to:

ICALP (1) 20122012
ICALP (1) 20112011
ICALP (1) 20092009
ICALP 20052005

Wrote 5 papers:

ICALP-v1-2012-FarzanMR #orthogonal #query
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima (AF, JIM, RR), pp. 327–338.
ICALP-v1-2011-FarzanK #distance #graph #navigation
Compact Navigation and Distance Oracles for Graphs with Small Treewidth (AF, SK), pp. 268–280.
ICALP-v1-2009-FarzanM #order
Dynamic Succinct Ordered Trees (AF, JIM), pp. 439–450.
ICALP-v1-2009-FarzanRR #question
Universal Succinct Representations of Trees? (AF, RR, SSR), pp. 451–462.
ICALP-2005-ChiniforooshanFM #evaluation
Worst Case Optimal Union-Intersection Expression Evaluation (EC, AF, MM), pp. 179–190.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.