The following pages link to Arash Farzan (Q390356):
Displaying 25 items.
- Entropy-bounded representation of point grids (Q390358) (← links)
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Succinct representation of dynamic trees (Q541673) (← links)
- A priority queue with the time-finger property (Q1932364) (← links)
- On the hierarchy of distribution-sensitive properties for data structures (Q2391860) (← links)
- A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
- Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima (Q2843259) (← links)
- Algorithms in the Ultra-Wide Word Model (Q2948478) (← links)
- Succinct representation of finite abelian groups (Q2958975) (← links)
- The Hausdorff core problem on simple polygons (Q2968107) (← links)
- Compact Navigation and Distance Oracles for Graphs with Small Treewidth (Q3012812) (← links)
- Entropy-Bounded Representation of Point Grids (Q3060785) (← links)
- Compact Representation of Posets (Q3104625) (← links)
- A Unifying Property for Distribution-Sensitive Priority Queues (Q3111652) (← links)
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance (Q3183457) (← links)
- A Uniform Approach Towards Succinct Representation of Trees (Q3512457) (← links)
- Succinct Representations of Arbitrary Graphs (Q3541102) (← links)
- Succinct Representations of Separable Graphs (Q3575243) (← links)
- Evaluation of General Set Expressions (Q3596733) (← links)
- On the Complexity of Finding an Unknown Cut Via Vertex Queries (Q3608870) (← links)
- Dynamic Succinct Ordered Trees (Q3638054) (← links)
- Universal Succinct Representations of Trees? (Q3638055) (← links)
- Algorithms – ESA 2005 (Q5475842) (← links)
- Automata, Languages and Programming (Q5716772) (← links)
