default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLinda Westrick
Person information
- affiliation: Pennsylvania State University, University Park, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Kirsten Eisenträger
, Russell Miller, Caleb Springer, Linda Westrick:
A Topological Approach to Undefinability in Algebraic Extensions of. Bull. Symb. Log. 29(4): 626-655 (2023)- [j10]Henry Towsner, Rose Weisshaar, Linda Westrick:
Borel combinatorics fail in HYP. J. Math. Log. 23(2): 2250023:1-2250023:19 (2023) - 2022
- [j9]Arno Pauly, Linda Westrick, Liang Yu:
Luzin's (n) and Randomness Reflection. J. Symb. Log. 87(2): 802-828 (2022) - 2021
- [j8]Linda Westrick:
A note on the diamond operator. Comput. 10(2): 107-110 (2021) - [j7]Damir D. Dzhafarov, Stephen Flood, Reed Solomon, Linda Brown Westrick:
Effectiveness for the Dual Ramsey Theorem. Notre Dame J. Formal Log. 62(3) (2021) - [c3]Linda Westrick:
Borel Sets in Reverse Mathematics (Invited Talk). CSL 2021: 4:1-4:2 - 2020
- [j6]Eric P. Astor, Damir D. Dzhafarov, Antonio Montalbán, Reed Solomon, Linda Brown Westrick:
The determined Property of Baire in Reverse Math. J. Symb. Log. 85(1): 166-198 (2020) - [j5]Linda Westrick:
An Effective Analysis of the Denjoy Rank. Notre Dame J. Formal Log. 61(2): 245-263 (2020)
2010 – 2019
- 2019
- [j4]Barbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
The reverse mathematics of Hindman's Theorem for sums of exactly two elements. Comput. 8(3-4): 253-263 (2019) - 2018
- [j3]Linda Brown Westrick:
Weakly 2-Randoms and 1-generics in Scott Sets. J. Symb. Log. 83(1): 392-394 (2018) - [j2]Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick:
Dimension 1 sequences are close to randoms. Theor. Comput. Sci. 705: 99-112 (2018) - 2017
- [c2]Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
Effectiveness of Hindman's Theorem for Bounded Sums. Computability and Complexity 2017: 134-142 - [i1]Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick:
Dimension 1 sequences are close to randoms. CoRR abs/1709.05266 (2017) - 2014
- [j1]Linda Brown Westrick:
A Lightface Analysis of the differentiability rank. J. Symb. Log. 79(1): 240-265 (2014)
2000 – 2009
- 2007
- [c1]Boris Katz, Sue Felshin, Gregory Marton, Federico Mora, Yuan Kui Shen, Gabriel Zaccak, Ammar Ammar, Eric Eisner, Asli Turgut, Linda Brown Westrick:
CSAIL at TREC 2007 Question Answering. TREC 2007
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-11-07 21:34 CET 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:
