Differences
This shows you the differences between two versions of the page.
|
fischer:teaching:ads-ss2020 [2020-02-12 10:00] |
fischer:teaching:ads-ss2020 [2020-02-12 10:01] |
||
|---|---|---|---|
| Line 38: | Line 38: | ||
| * **(20)** Naila Rahman, Richard Cole, Rajeev Raman: Optimised Predecessor Data Structures for Internal Memory. Algorithm Engineering 2001: 67-78 | * **(20)** Naila Rahman, Richard Cole, Rajeev Raman: Optimised Predecessor Data Structures for Internal Memory. Algorithm Engineering 2001: 67-78 | ||
| * **(21)** Mihai Patrascu, Mikkel Thorup: Time-space trade-offs for predecessor search. STOC 2006: 232-240 | * **(21)** Mihai Patrascu, Mikkel Thorup: Time-space trade-offs for predecessor search. STOC 2006: 232-240 | ||
| - | * **(22)** Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti: Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. 638: 33-43 (2016) | + | * **(22)** Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti: Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. 638: 33-43 (2016) (Maximilian Freese) |
| ===== Zeitlicher Ablauf ===== | ===== Zeitlicher Ablauf ===== | ||