Disioint-set data structure (Union-Find) Problem: maintain a dynamic collection of pairwise-disjoint sets S=(S Each set S; has one element distinguished as the representative element, rep[sil lust support 3 operations
How large should a hash table be? Goal: Make the table as small as possible but large enough so that it wont overflow(or otherwise become inefficient Problem: what if we don 't know the proper size
Quicksort Proposed by C. A.R. Hoare in 1962 Divide-and-conquer algorithm Sorts“ in place”( like insertion sort, but not like merge sort Very practical(with tuning)
Testing for a Fractional Unit Root in Time Series Regression Chingnun Lee, Tzu-Hsiang Liao2 and Fu-Shuen Shie Inst. of Economics, National Sun Yat-sen Univ Kaohsiung, Taiwan Dept. of Finance, National Central Univ, Chung-Li, Taiwan
Ch. 4 Asymptotic Theory From the discussion of last Chapter it is obvious that determining the dis- tribution of h(X1, X2, . . Xr) is by no means a trival exercise. It turns out that more often than not we cannot determine the distribution exactly. Because of the importance of the problem, however, we are forced to develop approximations the subject of this Chapter
Ch. 21 Univariate Unit Root process 1 Introduction Consider OLS estimation of a AR(1)process, Yt= pYt-1+ut where ut w ii d (0, 0), and Yo=0. The OLS estimator of p is given by and we also have
Ch. 11 Panel Data model Data sets that combine time series and cross sections are common in econo- metrics. For example, the published statistics of the OECD contain numerous series of economic aggregate observed yearly for many countries. The PSID is a studies of roughly 6000 families and 15000 individuals who has been interviews periodically from 1968 to the present
