|
351 |
Height-Bounded Lempel-Ziv Encodings
Bannai, Hideo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
352 |
Hilbert Functions and Low-Degree Randomness Extractors
Golovnev, Alexander. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
353 |
Hitting Meets Packing: How Hard Can It Be?
Focke, Jacob. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
354 |
How Can Algorithms Help in Protecting Our Privacy (Invited Talk)
Henzinger, Monika. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
355 |
How Did They Design This Game? Swish: Complexity and Unplayable Positions
Dailly, Antoine. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
356 |
How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik’s Cube
Shinagawa, Kazumasa. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
357 |
Hybrid k-Clustering: Blending k-Median and k-Center
Fomin, Fedor V.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
358 |
Hybridizing genetic random forest and self-attention based CNN-LSTM algorithms for landslide susceptibility mapping in Darjiling and Kurseong, India
Moghimi, Armin. - Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2024
|
|
|
|
359 |
Hypergraph Connectivity Augmentation in Strongly Polynomial Time
Bérczi, Kristóf. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
360 |
Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
Chakrabarti, Amit. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
