The following pages link to Ignat Kolesnichenko (Q294950):
Displayed 6 items.
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks (Q3401090) (← links)
- On Minimal and Maximal Suffixes of a Substring (Q4928556) (← links)
- External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs (Q5127184) (← links)
- Cascade heap: towards time-optimal extractions (Q5919538) (← links)
- Cascade heap: towards time-optimal extractions (Q5920058) (← links)