|
99931 |
A fast and improved tunable aggregation model for stochastic simulation of spray fluidized bed agglomeration
Singh, Abhinandan Kumar. - Magdeburg : Universitätsbibliothek Otto-von-Guericke-Universität, 2021
|
|
|
|
99932 |
A fast and novel method for amide proton transfer-chemical exchange saturation transfer multislice imaging
Schüre, Jan-Rüdiger. - Frankfurt am Main : Universitätsbibliothek Johann Christian Senckenberg, 2021
|
|
|
|
99933 |
A Fast and Small Subsampled R-Index
Cobas, Dustin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
99934 |
A Fast and Tight Heuristic for A* in Road Networks
Strasser, Ben. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
99935 |
A Fast Estimator for Binary Choice Models with Spatial, Temporal, and Spatio-Temporal Interdependence
Wucherpfennig, Julian. - Konstanz : KOPS Universität Konstanz, 2021
|
|
|
|
99936 |
A Fast Protocol for Multiparametric Characterisation of Diffusion in the Brain and Brain Tumours
Loução, Ricardo. - Aachen : Universitätsbibliothek der RWTH Aachen, 2021
|
|
|
|
99937 |
A Faster Algorithm for Finding Closest Pairs in Hamming Metric
Esser, Andre. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
99938 |
A Faster Algorithm for Finding Tarski Fixed Points
Fearnley, John. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
99939 |
A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities
Enoch, Julian. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
99940 |
A feasible approach for automatically differentiable unitary coupled-cluster on quantum computers
Kottmann, Jakob. - Augsburg : Universität Augsburg, 2021
|
|
Administration
