forked from sharmaeklavya2/notes-source
-
Notifications
You must be signed in to change notification settings - Fork 0
/
bibdb.bib
35 lines (35 loc) · 1.28 KB
/
bibdb.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
@article{Hwang:recurrence,
author = {Hwang, Hsien-Kuei and Janson, Svante and Tsai, Tsung-Hsi},
title = {Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications},
journal = {ACM Trans. Algorithms},
issue_date = {December 2017},
volume = {13},
number = {4},
month = oct,
year = {2017},
issn = {1549-6325},
pages = {47:1--47:43},
articleno = {47},
numpages = {43},
url = {http://doi.acm.org/10.1145/3127585},
doi = {10.1145/3127585},
acmid = {3127585},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Analysis of algorithms, additivity, asymptotic approximation, asymptotic linearity, functional equation, identity, master theorems, periodic oscillation, recurrence relation, sensitivity analysis, uniform continuity},
}
@misc{selection-comparisons-table,
author = {Kenneth Oksanen \textless{}[email protected]\textgreater{}},
title = {Selecting the $i^\textrm{th}$ largest of $n$ elements},
url = {http://www.cs.hut.fi/~cessu/selection/}
}
@misc{eku-notes-recurrences,
author = {Eklavya Sharma},
title = {Notes: Recurrence Relations},
url = {https://sharmaeklavya2.github.io/dl/notes/math/recurrences.pdf}
}
@misc{eku-notes-heaps,
author = {Eklavya Sharma},
title = {Notes: Heaps},
url = {https://sharmaeklavya2.github.io/dl/notes/algorithms/heaps.pdf}
}