More Like this

1. Forests, Water, and Livelihoods in the Lesser Himalaya

   https://doi.org/10.1029/2024EO240217  

   Bruijnzeel, L; Sun, Ge; Zhang, Jun; Tiwari, Krishna; Hao, Lu (May 2024, Eos)

   Complex changes in land use, land cover, climate, and demographics are combining to stress water security for millions of people in the region. 

   more » « less
2. Mapping canopy nitrogen in European forests using remote sensing and environmental variables with the random forests method

   https://doi.org/10.1016/j.rse.2020.111933  

   Loozen, Yasmina; Rebel, Karin T.; de Jong, Steven M.; Lu, Meng; Ollinger, Scott V.; Wassen, Martin J.; Karssenberg, Derek (September 2020, Remote Sensing of Environment)

   null (Ed.)
3. Overwintering fires in boreal forests

   https://doi.org/10.1038/s41586-021-03437-y  

   Scholten, Rebecca C.; Jandt, Randi; Miller, Eric A.; Rogers, Brendan M.; Veraverbeke, Sander (May 2021, Nature)

   null (Ed.)
4. Incremental Edge Orientation in Forests

   Bender, Michael; Kopelowitz, Tsvi; Kuszmaul, William; Porat, Ely; Stein, Clifford (January 2021, European Symposium on Algorithms)

   For any forest G = (V, E) it is possible to orient the edges E so that no vertex in V has out-degree greater than 1. This paper considers the incremental edge-orientation problem, in which the edges E arrive over time and the algorithm must maintain a low-out-degree edge orientation at all times. We give an algorithm that maintains a maximum out-degree of 3 while flipping at most O(log log n) edge orientations per edge insertion, with high probability in n. The algorithm requires worst-case time O(log n log log n) per insertion, and takes amortized time O(1). The previous state of the art required up to O(log n/ log log n) edge flips per insertion. We then apply our edge-orientation results to the problem of dynamic Cuckoo hashing. The problem of designing simple families H of hash functions that are compatible with Cuckoo hashing has received extensive attention. These families H are known to satisfy static guarantees, but do not come typically with dynamic guarantees for the running time of inserts and deletes. We show how to transform static guarantees (for 1-associativity) into near-state-of-the-art dynamic guarantees (for O(1)-associativity) in a black-box fashion. Rather than relying on the family H to supply randomness, as in past work, we instead rely on randomness within our table-maintenance algorithm. 

   more » « less
5. Incremental Edge Orientation in Forests

   https://doi.org/10.4230/LIPIcs.ESA.2021.12  

   Bender, Michael A.; Kopelowitz, Tsvi; Kuszmaul, William; Porat, Ely; Stein, Clifford (January 2021, Proc.\ 28th Annual European Symposium on Algorithms (ESA))