( en | de | ru )

 

Disambiguation of "Witter, R. Teal"

Author of the publication

copydeleteadd this publication to your clipboard
Adaptivity gap of the SBFE problem.

, , , and . ISAIM, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ali Abd-El-Azim Tealeb

Bodo Witter

Alfons Witter

Paul Witter

Susanne Witter

 

Other publications of authors with the same name

I Open at the Close: A Deep Reinforcement Learning Evaluation of Open Streets Initiatives., and . AAAI, page 22429-22437. AAAI Press, (2024)Applications of the Quantum Algorithm for st-Connectivity., , and . TQC, volume 135 of LIPIcs, page 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Robust and Space-Efficient Dual Adversary Quantum Query Algorithms., , and . ESA, volume 274 of LIPIcs, page 36:1-36:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Counterfactual Fairness Is Basically Demographic Parity., and . AAAI, page 14461-14469. AAAI Press, (2023)Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem., , , and . WAOA, volume 13538 of Lecture Notes in Computer Science, page 190-210. Springer, (2022)A Local Search Algorithm for the Min-Sum Submodular Cover Problem.. ISAIM, (2022)A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs., and . WADS, volume 12808 of Lecture Notes in Computer Science, page 543-555. Springer, (2021)A Local Search Algorithm for the Min-Sum Submodular Cover Problem., , and . ISAAC, volume 248 of LIPIcs, page 3:1-3:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Applications of Graph Theory and Probability in the Board Game Ticket to Ride., and . FDG, page 65:1-65:4. ACM, (2020)Backgammon Is Hard.. COCOA, volume 13135 of Lecture Notes in Computer Science, page 484-496. Springer, (2021)