Arash Farzan

Available identifiers

zbMath Open farzan.arashWikidataQ102364264 ScholiaQ102364264MaRDI QIDQ390356

List of research outcomes

Publication	Date of Publication	Type
The Hausdorff core problem on simple polygons	2017-03-09	Paper
Succinct representation of finite abelian groups	2017-02-03	Paper
Algorithms in the Ultra-Wide Word Model	2015-09-30	Paper
Compact navigation and distance oracles for graphs with small treewidth	2014-11-19	Paper
A uniform paradigm to succinctly encode various families of trees	2014-03-25	Paper
Succinct encoding of arbitrary graphs	2014-01-13	Paper
Entropy-bounded representation of point grids	2014-01-08	Paper
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima	2013-08-12	Paper
On the hierarchy of distribution-sensitive properties for data structures	2013-08-05	Paper
A priority queue with the time-finger property	2013-01-18	Paper
A Unifying Property for Distribution-Sensitive Priority Queues	2012-01-13	Paper
Compact Representation of Posets	2011-12-16	Paper
Compact Navigation and Distance Oracles for Graphs with Small Treewidth	2011-07-06	Paper
Succinct representation of dynamic trees	2011-06-07	Paper
Entropy-Bounded Representation of Point Grids	2010-12-09	Paper
Succinct Representations of Separable Graphs	2010-07-26	Paper
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance	2009-10-20	Paper
Universal Succinct Representations of Trees?	2009-07-14	Paper
Dynamic Succinct Ordered Trees	2009-07-14	Paper
On the Complexity of Finding an Unknown Cut Via Vertex Queries	2009-03-06	Paper
Evaluation of General Set Expressions	2009-01-29	Paper
Succinct Representations of Arbitrary Graphs	2008-11-25	Paper
A Uniform Approach Towards Succinct Representation of Trees	2008-07-15	Paper
Algorithms – ESA 2005	2006-06-27	Paper
Automata, Languages and Programming	2006-01-10	Paper

Research outcomes over time

This page was built for person: Arash Farzan