Back to Results
First PageMeta Content
Computing / Computer programming / Theoretical computer science / Computational geometry / Tango tree / Disjoint-set data structure / Erik Demaine / Binary trees


Complexity of Union-Split-Find Problems by Katherine Jane Lai S.B., Electrical Engineering and Computer Science, MIT, 2007 S.B., Mathematics, MIT, 2007
Add to Reading List

Document Date: 2008-10-20 18:22:26


Open Document

File Size: 229,43 KB

Share Result on Facebook

Facility

Massachusetts Institute of Technology June / /

Organization

Interval / Cyclic / Ordered / and General Union / Interval and Ordered Union / Cyclic Union / General Union / Massachusetts Institute of Technology / Interval Union / Department of Electrical Engineering and Computer Science / Institute of Technology All / MIT / Department Committee on Graduate Theses / Ordered Union / /

Person

Timothy Abbott / Katherine Jane Lai / David Johnson / Erik D. Demaine / Eric Price / /

Position

Author / Professor of Electrical Engineering Chairman / Professor of Electrical Engineering / thesis supervisor / Associate Professor / Associate Professor of Electrical Engineering and Computer Science Thesis Supervisor / /

ProvinceOrState

Massachusetts / /

Technology

RAM / 2008 Massachusetts Institute of Technology / /

SocialTag