Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Dynamic Trees with Alternative Search Trees - riteme.site #80

Open
riteme opened this issue Jun 13, 2019 · 3 comments
Open

Dynamic Trees with Alternative Search Trees - riteme.site #80

riteme opened this issue Jun 13, 2019 · 3 comments
Labels
a9962e7aca2989c02171ea3ad420d451 gitment

Comments

@riteme
Copy link
Owner

riteme commented Jun 13, 2019

https://riteme.site/blog/2019-6-13/dynamic-trees-eap.html
@hld67890
Copy link

薛大爷太强辣QAQ

@hld67890
Copy link

想学splay这套东西的复杂度证明什么论文比较好啊？

@riteme
Copy link
Owner Author

riteme commented Jun 13, 2019

@hld67890
就 LCT [21] 和 splay [22]，biased search tree [4][9] 有点精神污染....
其实我也就半桶水，只看了几篇。均摊分析的可能可以去找几篇 Tarjan 的数据结构来看

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
a9962e7aca2989c02171ea3ad420d451 gitment
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@riteme @hld67890