The following pages link to Paniz Abedin (Q1791025):
Displayed 9 items.
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- I/O-efficient data structures for non-overlapping indexing (Q2220773) (← links)
- Complexity of the improper twin edge coloring of graphs (Q2409501) (← links)
- On Computing Average Common Substring Over Run Length Encoded Sequences (Q4611215) (← links)
- Non-Overlapping Indexing - Cache Obliviously (Q5140770) (← links)
- The Heaviest Induced Ancestors Problem Revisited (Q5140784) (← links)
- A linear-space data structure for range-LCP queries in poly-logarithmic time (Q5916260) (← links)
- A linear-space data structure for range-LCP queries in poly-logarithmic time (Q5918832) (← links)
- Improper Twin Edge Coloring of Graphs (Q6269127) (← links)