Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
hackermailman
5 months ago
|
parent
|
context
|
favorite
| on:
Ask HN: Fast data structures for disjoint interval...
Erik Demaine's DS class has a bunch of range trees and cascading method to speed up queries
https://courses.csail.mit.edu/6.851/spring21/lectures/
alex5207
5 months ago
|
next
[–]
His explanations are great and just wanted to +1 on the idea of range trees. Adding a reference here to a very lightweight read on range trees:
https://courses.csail.mit.edu/6.851/spring10/scribe/lec03.pd...
grovesNL
5 months ago
|
prev
[–]
Thanks, I came across some of Erik's videos in my research but I didn't realize they were part of a bigger series focused on ranges. Cascading methods are exactly the kind of ideas I'm thinking about.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: