default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. Teal Witter
Person information
- affiliation: New York University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]R. Teal Witter, Lucas Rosenblatt:
I Open at the Close: A Deep Reinforcement Learning Evaluation of Open Streets Initiatives. AAAI 2024: 22429-22437- [i10]R. Teal Witter, Lisa Hellerstein:
Minimizing Cost Rather Than Maximizing Reward in Restless Multi-Armed Bandits. CoRR abs/2409.03071 (2024) - 2023
- [c10]Lucas Rosenblatt, R. Teal Witter:
Counterfactual Fairness Is Basically Demographic Parity. AAAI 2023: 14461-14469 - [c9]Michael Czekanski, Shelby Kimmel, R. Teal Witter:
Robust and Space-Efficient Dual Adversary Quantum Query Algorithms. ESA 2023: 36:1-36:19 - [i9]Michael Czekanski, Shelby Kimmel, R. Teal Witter:
Robust and Space-Efficient Dual Adversary Quantum Query Algorithms. CoRR abs/2306.15040 (2023) - [i8]R. Teal Witter, Lucas Rosenblatt:
I Open at the Close: A Deep Reinforcement Learning Evaluation of Open Streets Initiatives. CoRR abs/2312.07680 (2023) - 2022
- [c8]Lisa Hellerstein, Thomas Lidbetter, R. Teal Witter:
A Local Search Algorithm for the Min-Sum Submodular Cover Problem. ISAAC 2022: 3:1-3:13 - [c7]Lisa Hellerstein, Devorah Kletenik, Naifeng Liu, R. Teal Witter:
Adaptivity gap of the SBFE problem. ISAIM 2022 - [c6]R. Teal Witter:
A Local Search Algorithm for the Min-Sum Submodular Cover Problem. ISAIM 2022 - [c5]Lisa Hellerstein, Devorah Kletenik
, Naifeng Liu, R. Teal Witter:
Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem. WAOA 2022: 190-210 - [i7]Lisa Hellerstein, Devorah Kletenik, Naifeng Liu, R. Teal Witter:
Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem. CoRR abs/2208.03810 (2022) - [i6]Lucas Rosenblatt, R. Teal Witter:
Counterfactual Fairness Is Basically Demographic Parity. CoRR abs/2208.03843 (2022) - [i5]Lisa Hellerstein, Thomas Lidbetter, R. Teal Witter:
A Local Search Algorithm for the Min-Sum Submodular Cover Problem. CoRR abs/2209.03054 (2022) - 2021
- [c4]R. Teal Witter:
Backgammon Is Hard. COCOA 2021: 484-496 - [c3]Shelby Kimmel, R. Teal Witter:
A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs. WADS 2021: 543-555 - [i4]R. Teal Witter:
Backgammon is Hard. CoRR abs/2106.16172 (2021) - [i3]Christopher Musco, Indu Ramesh, Johan Ugander, R. Teal Witter:
How to Quantify Polarization in Models of Opinion Dynamics. CoRR abs/2110.11981 (2021) - 2020
- [c2]R. Teal Witter, Alex Lyford:
Applications of Graph Theory and Probability in the Board Game Ticket to Ride. FDG 2020: 65:1-65:4 - [i2]Shelby Kimmel, R. Teal Witter:
A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs. CoRR abs/2010.02324 (2020)
2010 – 2019
- 2019
- [c1]Kai DeLorenzo, Shelby Kimmel, R. Teal Witter:
Applications of the Quantum Algorithm for st-Connectivity. TQC 2019: 6:1-6:14 - [i1]Kai DeLorenzo, Shelby Kimmel, R. Teal Witter:
Applications of the quantum algorithm for st-connectivity. CoRR abs/1904.05995 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
