R. Teal Witter

Orcid: 0000-0003-3096-3767

Affiliations:
  • New York University, USA


According to our database1, R. Teal Witter authored at least 17 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Kernel Banzhaf: A Fast and Robust Estimator for Banzhaf Values.
CoRR, 2024

FairlyUncertain: A Comprehensive Benchmark of Uncertainty in Algorithmic Fairness.
CoRR, 2024

Provably Accurate Shapley Value Estimation via Leverage Score Sampling.
CoRR, 2024

Benchmarking Estimators for Natural Experiments: A Novel Dataset and a Doubly Robust Algorithm.
CoRR, 2024

Minimizing Cost Rather Than Maximizing Reward in Restless Multi-Armed Bandits.
CoRR, 2024

I Open at the Close: A Deep Reinforcement Learning Evaluation of Open Streets Initiatives.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Robust and Space-Efficient Dual Adversary Quantum Query Algorithms.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Counterfactual Fairness Is Basically Demographic Parity.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem.
Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

A Local Search Algorithm for the Min-Sum Submodular Cover Problem.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Adaptivity gap of the SBFE problem.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

A Local Search Algorithm for the Min-Sum Submodular Cover Problem.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
How to Quantify Polarization in Models of Opinion Dynamics.
CoRR, 2021

A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Backgammon Is Hard.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Applications of Graph Theory and Probability in the Board Game Ticket to Ride.
Proceedings of the FDG '20: International Conference on the Foundations of Digital Games, 2020

2019
Applications of the Quantum Algorithm for st-Connectivity.
Proceedings of the 14th Conference on the Theory of Quantum Computation, 2019


  Loading...