|
401 |
Pseudorandomness of Expander Walks via Fourier Analysis on Groups
Jeronimo, Fernando Granha. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
402 |
PtrHash: Minimal Perfect Hashing at RAM Throughput
Groot Koerkamp, Ragnar. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
403 |
QSETH Strikes Again: Finer Quantum Lower Bounds for Lattice Problem, Strong Simulation, Hitting Set Problem, and More
Chen, Yanlin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
404 |
Quantitative Automatic Evaluation of Algorithms Assisting in Clinical MRI
Berlin : Prior Art Publishing GmbH, 2025, Date:2025-04-30; File(MD5):7C9A828D30BC8B3415ADBA5B5C38B829
|
|
|
|
405 |
Quantum Approximate k-Minimum Finding
Gao, Minbo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
406 |
Quantum Property Testing in Sparse Directed Graphs
Apers, Simon. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
407 |
Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
Caroppo, Susanna. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
408 |
Randomized algorithms to generate hypergraphs with given degree sequences
Ascolese, Michela. - Hamburg : Technische Universität Hamburg. Universitätsbibliothek, 2025
|
|
|
|
409 |
Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree
Chen, Xiaoyu. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
410 |
Receiving kernel-level insights via eBPF: Can ABR algorithms adapt smarter?
Ghasemi, Mohsen. - Würzburg : Universität Würzburg, 2025
|
|
Administration
