Complexity of union-split-find problems
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.
Main Author: | Lai, Katherine Jane |
---|---|
Other Authors: | Erik D. Demaine. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/45638 |
Similar Items
-
Investigating coevolutionary algorithms for finding Nash equilibria in cybersecurity problems
by: Zhang, Linda(Linda E.)
Published: (2019) -
Supporting finding and re-finding through personalization
by: Teevan, Jaime B. (Jaime Brooks), 1976-
Published: (2007) -
Internet banking in Pakistan: finding complexities
by: Akhlaq, Mohammed ather, et al.
Published: (2011) -
Communication complexity of some problems in distributed computation
by: Luo, Zhi-Quan
Published: (2005) -
Actis: a strictly local Union–Find decoder
by: Chan, T, et al.
Published: (2023)