Author:
Sleator Daniel D.,Endre Tarjan Robert
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference23 articles.
1. On finding lowest common ancestors in trees;Aho;SIAM J. Comput.,1975
2. Biased 2–3 trees;Bent,1980
3. S. W. Bent, D. D. Sleator and R.E. Tarjan, “Biased Search Trees”SIAM J. Comput., to appear.
4. Linear Programming;Chvatal,1983
5. A Discipline of Programming;Dijkstra,1976
Cited by
629 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Routing on heavy path WSPD spanners;Computational Geometry;2024-12
2. Hierarchical categories in colored searching;Computational Geometry;2024-08
3. A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
4. Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
5. Minimum Cut in $$O(m\log ^2 n)$$ Time;Theory of Computing Systems;2024-06-12