Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
path compression
Description:
Path compression is an algorithmic technique that shortens paths in a data structure, especially in disjoint-set forests, to speed later operations.
Related topics:
Algorithms and Data Compression (18%),
Complexity and Algorithms in Graphs (17%),
Network Packet Processing and Optimization (7%)
OpenAlex ID:
keywords/path-compression
Worst-case Analysis of Set Union Algorithms
1984
·
Robert E. Tarjan
, Jan van Leeuwen
·
Journal of the ACM
·
561
PDF
IP-address lookup using LC-tries
1999
·
S. Nilsson
, G. Karlsson
·
IEEE Journal on Selected Areas in Communications
·
415
Applications of Path Compression on Balanced Trees
1979
·
Robert Endre Tarjan
·
Journal of the ACM
·
329
PDF
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
1986
·
Sergiu Hart
, Micha Sharir
·
COMBINATORICA
·
301
Fast Algorithms for Solving Path Problems
1981
·
Robert Endre Tarjan
·
Journal of the ACM
·
299
PDF
Packet classification for core routers: is there an alternative to CAMs?
2004
·
F. Baboescu
, Sumeet Singh
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
277
A fast algorithm for bottom-up document layout analysis
1997
·
A. Simon
, J.-C. Pret
, et al.
·
IEEE Transactions on Pattern Analysis and Machine Intelligence
·
164
Fast address lookup for Internet routers
1998
·
Stefan Nilsson
, Gunnar Karlsson
·
Springer eBooks
·
162
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
2008
·
Adam L. Buchsbaum
, Loukas Georgiadis
, et al.
·
SIAM Journal on Computing
·
102
Explicit Path Control in Commodity Data Centers: Design and Applications
2015
·
Shuihai Hu
, Kai Chen
, et al.
·
IEEE/ACM Transactions on Networking
·
91
An O(EVIog2V) algorithm for the maximal flow problem
1980
·
Zvi Galil
, Amnon Naamad
·
Journal of Computer and System Sciences
·
83
Hippocampal place cell sequences differ during correct and error trials in a spatial memory task
2021
·
Chenguang Zheng
, Ernie Hwaun
, et al.
·
Nature Communications
·
77
PDF
Efficient implementation of suffix trees
1995
·
Arne Andersson
, Stefan Nilsson
·
Software Practice and Experience
·
74
A new, simpler linear-time dominators algorithm
1998
·
Adam L. Buchsbaum
, Haim Kaplan
, et al.
·
ACM Transactions on Programming Languages and Systems
·
73
PDF
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
2010
·
Md. Mostofa Ali Patwary
, Jean Blair
, et al.
·
Lecture notes in computer science
·
72
Timestamped whole program path representation and its applications
2001
·
Youtao Zhang
, Rajiv Gupta
·
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
·
67
On the complexity of escape analysis
1997
·
Alain Deutsch
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
64
Ultra-Fast Optimal Pathfinding without Runtime Search
2011
·
Adi Botea
·
Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment
·
61
PDF
UAV Trajectory and Communication Co-Design: Flexible Path Discretization and Path Compression
2021
·
Yijun Guo
, Changsheng You
, et al.
·
IEEE Journal on Selected Areas in Communications
·
57
PDF
Skip Strips: maintaining triangle strips for view-dependent rendering
1999
·
J. El-Sana
, E. Azanli
, et al.
·
Visualization
·
57
Skip Strips: Maintaining Triangle Strips for View-dependent Rendering
·
Jihad El-sana
, Elvir Azanli
, et al.
·
57
Decentralized object finding using forwarding address
1985
·
Robert J. Fowler
·
ResearchWorks at the University of Washington (University of Washington)
·
39
Top-Down Analysis of Path Compression
2005
·
Raimund Seidel
, Micha Sharir
·
SIAM Journal on Computing
·
37
Efficient hardware architecture for fast IP address lookup
2003
·
D. Pao
, C. Liu
, et al.
·
IEE Proceedings - Computers and Digital Techniques
·
34
Network flow and generalized path compression
1979
·
Zvi Galil
, Amnon Naamad
·
ACM Symposium on Theory of Computing (STOC)
·
34
PDF
Show more works
View as search
Works count:
217
Citation count:
4,455
Year
Topic
Type