default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom C. Brown
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j25]Allen R. Freedman, Tom C. Brown:
Sequences on Sets of Four Numbers. Integers 16: A33 (2016)- 2014
- [j24]Tom C. Brown, Veselin Jungic, Andrew Poelstra:
On Double 3-Term Arithmetic Progressions. Integers 14: A43 (2014) - 2012
- [j23]Hayri Ardal, Tom C. Brown, Veselin Jungic, Julian Sahasrabudhe:
On Abelian and Additive Complexity in Infinite Words. Integers 12: A21 (2012) - [j22]Tom C. Brown:
Approximations of Additive Squares in Infinite Words. Integers 12: A22 (2012) - 2011
- [j21]Hayri Ardal, Tom C. Brown, Veselin Jungic:
Chaotic Orderings of the Rationals and Reals. Am. Math. Mon. 118(10): 921-925 (2011)
2000 – 2009
- 2008
- [j20]Tom C. Brown, Bruce M. Landman, Aaron Robertson:
Bounds on some van der Waerden numbers. J. Comb. Theory A 115(7): 1304-1309 (2008) - 2005
- [j19]Hayri Ardal, Tom C. Brown, Peter A. B. Pleasants:
Almost disjoint families of 3-term arithmetic progressions. J. Comb. Theory A 109(1): 75-90 (2005) - 2003
- [j18]Tom C. Brown, Allen R. Freedman, Peter Jau-Shyong Shiue:
Progressions of squares. Australas. J Comb. 27: 187-192 (2003) - [j17]Tom C. Brown, Wun-Seng Chou, Peter J.-S. Shiue:
On the partition function of a finite set. Australas. J Comb. 27: 193-204 (2003) - [j16]Tom C. Brown:
On the Canonical Version of a Theorem in Ramsey Theory. Comb. Probab. Comput. 12(5-6): 513-514 (2003) - 2002
- [j15]Tom C. Brown:
Applications of standard Sturmian words to elementary number theory. Theor. Comput. Sci. 273(1-2): 5-9 (2002)
1990 – 1999
- 1999
- [j14]Tom C. Brown:
A Pseudo Upper Bound for the van der Waerden Function. J. Comb. Theory A 87(1): 233-238 (1999) - 1997
- [j13]Tom C. Brown, Donovan R. Hare:
Arithmetic Progressions in Sequences with Bounded Gaps. J. Comb. Theory A 77(2): 222-227 (1997) - 1996
- [j12]Tom C. Brown, Bruce M. Landman:
The Ramsey property for collections of sequences not containing all arithmetic progressions. Graphs Comb. 12(1): 149-161 (1996) - 1990
- [j11]Tom C. Brown, Paul Erdös, Allen R. Freedman:
Quasi-progressions and descending waves. J. Comb. Theory A 53(1): 81-95 (1990)
1980 – 1989
- 1989
- [j10]Tom C. Brown, Allen R. Freedman:
Small sets which meet all the k(n)-term arithmetic progressions in the interval [1, n]. J. Comb. Theory A 51(2): 244-249 (1989) - 1985
- [j9]Tom C. Brown, Paul Erdös, Fan R. K. Chung, Ronald L. Graham:
Quantitative Forms of a Theorem of Hilbert. J. Comb. Theory A 38(2): 210-216 (1985) - [j8]Tom C. Brown:
Affine and Combinatorial Binary m-Spaces. J. Comb. Theory A 39(1): 25-34 (1985) - [j7]Tom C. Brown:
Monochromatic Affine Lines in Finite Vector Spaces. J. Comb. Theory A 39(1): 35-41 (1985) - 1984
- [j6]Tom C. Brown:
Common transversals for partitions of a finite set. Discret. Math. 51(2): 119-124 (1984) - [j5]Tom C. Brown, J. P. Buhler:
Lines Imply Spaces in Density Ramsey Theory. J. Comb. Theory A 36(2): 214-220 (1984) - 1982
- [j4]Tom C. Brown, J. P. Buhler:
A Density Version of a Geometric Ramsey Theorem. J. Comb. Theory A 32(1): 20-34 (1982) - 1981
- [j3]Tom C. Brown:
On van der Waerden's Theorem and the Theorem of Paris and Harrington. J. Comb. Theory A 30(1): 108-111 (1981)
1970 – 1979
- 1976
- [j2]Tom C. Brown:
Common Transversals. J. Comb. Theory A 21(1): 80-85 (1976) - 1975
- [j1]Tom C. Brown:
Behrend's Theorem for Sequences Containing No k-Element Arithmetic Progression of a Certain Type. J. Comb. Theory A 18(3): 352-356 (1975)
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-06-10 21: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:
