default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom Tseng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]Tom Tseng, Euan McLean, Kellin Pelrine, Tony T. Wang, Adam Gleave:
Can Go AIs be adversarially robust? CoRR abs/2406.12843 (2024)- [i6]Nikolaus H. R. Howe, Michal Zajac, Ian R. McKenzie, Oskar Hollinsworth, Tom Tseng, Pierre-Luc Bacon, Adam Gleave:
Exploring Scaling Trends in LLM Robustness. CoRR abs/2407.18213 (2024) - 2023
- [j1]Ian R. McKenzie, Alexander Lyzhov, Michael Pieler, Alicia Parrish, Aaron Mueller, Ameya Prabhu, Euan McLean, Aaron Kirtland, Alexis Ross, Alisa Liu, Andrew Gritsevskiy, Daniel Wurgaft, Derik Kauffman, Gabriel Recchia, Jiacheng Liu, Joe Cavanagh, Max Weiss, Sicong Huang, The Floating Droid, Tom Tseng, Tomasz Korbak, Xudong Shen, Yuhui Zhang, Zhengping Zhou, Najoung Kim, Samuel R. Bowman, Ethan Perez:
Inverse Scaling: When Bigger Isn't Better. Trans. Mach. Learn. Res. 2023 (2023) - [c5]Tony Tong Wang, Adam Gleave, Tom Tseng
, Kellin Pelrine, Nora Belrose, Joseph Miller, Michael D. Dennis, Yawen Duan, Viktor Pogrebniak, Sergey Levine, Stuart Russell:
Adversarial Policies Beat Superhuman Go AIs. ICML 2023: 35655-35739 - [i5]Ian R. McKenzie, Alexander Lyzhov, Michael Pieler, Alicia Parrish, Aaron Mueller, Ameya Prabhu, Euan McLean, Aaron Kirtland, Alexis Ross, Alisa Liu, Andrew Gritsevskiy, Daniel Wurgaft, Derik Kauffman, Gabriel Recchia, Jiacheng Liu, Joe Cavanagh, Max Weiss, Sicong Huang, The Floating Droid, Tom Tseng, Tomasz Korbak, Xudong Shen, Yuhui Zhang, Zhengping Zhou, Najoung Kim, Samuel R. Bowman, Ethan Perez:
Inverse Scaling: When Bigger Isn't Better. CoRR abs/2306.09479 (2023) - 2022
- [c4]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering. SPAA 2022: 233-245 - [i4]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering. CoRR abs/2205.04956 (2022) - [i3]Tony Tong Wang, Adam Gleave, Nora Belrose, Tom Tseng, Joseph Miller, Michael D. Dennis, Yawen Duan, Viktor Pogrebniak, Sergey Levine, Stuart Russell:
Adversarial Policies Beat Professional-Level Go AIs. CoRR abs/2211.00241 (2022) - 2021
- [c3]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Index-Based Structural Graph Clustering and Its Approximation. SIGMOD Conference 2021: 1851-1864 - 2020
- [c2]Laxman Dhulipala, Jessica Shi, Tom Tseng, Guy E. Blelloch, Julian Shun:
The Graph Based Benchmark Suite (GBBS). GRADES-NDA@SIGMOD 2020: 11:1-11:8 - [i2]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Index-Based Structural Graph Clustering and Its Approximation. CoRR abs/2012.11188 (2020)
2010 – 2019
- 2019
- [c1]Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch:
Batch-Parallel Euler Tour Trees. ALENEX 2019: 92-106 - 2018
- [i1]Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch:
Batch-Parallel Euler Tour Trees. CoRR abs/1810.10738 (2018)
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-09-04 01:20 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:
