Arash Farzan

From MaRDI portal
Person:390356

Available identifiers

zbMath Open farzan.arashWikidataQ102364264 ScholiaQ102364264MaRDI QIDQ390356

List of research outcomes





PublicationDate of PublicationType
The Hausdorff core problem on simple polygons2017-03-09Paper
Succinct representation of finite abelian groups2017-02-03Paper
Algorithms in the Ultra-Wide Word Model2015-09-30Paper
Compact navigation and distance oracles for graphs with small treewidth2014-11-19Paper
A uniform paradigm to succinctly encode various families of trees2014-03-25Paper
Succinct encoding of arbitrary graphs2014-01-13Paper
Entropy-bounded representation of point grids2014-01-08Paper
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima2013-08-12Paper
On the hierarchy of distribution-sensitive properties for data structures2013-08-05Paper
A priority queue with the time-finger property2013-01-18Paper
A Unifying Property for Distribution-Sensitive Priority Queues2012-01-13Paper
Compact Representation of Posets2011-12-16Paper
Compact Navigation and Distance Oracles for Graphs with Small Treewidth2011-07-06Paper
Succinct representation of dynamic trees2011-06-07Paper
Entropy-Bounded Representation of Point Grids2010-12-09Paper
Succinct Representations of Separable Graphs2010-07-26Paper
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance2009-10-20Paper
Universal Succinct Representations of Trees?2009-07-14Paper
Dynamic Succinct Ordered Trees2009-07-14Paper
On the Complexity of Finding an Unknown Cut Via Vertex Queries2009-03-06Paper
Evaluation of General Set Expressions2009-01-29Paper
Succinct Representations of Arbitrary Graphs2008-11-25Paper
A Uniform Approach Towards Succinct Representation of Trees2008-07-15Paper
Algorithms – ESA 20052006-06-27Paper
Automata, Languages and Programming2006-01-10Paper

Research outcomes over time

This page was built for person: Arash Farzan