-
Notifications
You must be signed in to change notification settings - Fork 0
/
references.bib
58 lines (52 loc) · 1.6 KB
/
references.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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
@misc{gh:tikzpingus,
author = {Florian Sihler},
title = {\LaTeX-Package, tikzpingus},
url = {https://github.com/EagleoutIce/tikzpingus},
year = {2021}
}
@misc{gh:episode-recursion,
author = {Florian Sihler},
title = {Episode-Rekursion},
url = {https://github.com/EagleoutIce/Episode-Recursion},
year = {2021}
}
@misc{tsk:search-tree,
author = {GeeksforGeeks},
title = {Suchbäume},
url = {https://www.geeksforgeeks.org/binary-search-tree-data-structure/},
year = {2020}
}
@article{dive:heap-cpl,
title={Refined complexity analysis for heap operations},
author={Fredman, Michael L. and Spencer, Thomas H.},
journal={Journal of Computer and System Sciences},
volume={35},
number={3},
pages={269--284},
year={1987},
publisher={Elsevier},
url = {https://www.sciencedirect.com/science/article/pii/002200008790016X}
}
@article{dive:heap-ops,
title={Heap : A Data Structure for Efficient Programs },
author={Sanjay Singh},
year={2013},
url = {https://codepuz.blogspot.com/2013/09/heap-data-structure-for-efficient.html}
}
@article{tsk:data,
title={Exercises for Algorithms and Data Structures},
author={Antonio Carzaniga},
year={2016},
url = {https://www.inf.usi.ch/carzaniga/edu/algo16s/exercises.pdf}
}
@article{dive:bin-tree,
title={The average height of binary trees and other simple trees},
author={Flajolet, Philippe and Odlyzko, Andrew},
journal={Journal of Computer and System Sciences},
volume={25},
number={2},
pages={171--213},
year={1982},
publisher={Elsevier},
url={https://www.sciencedirect.com/science/article/pii/0022000082900046}
}