default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomasz Schoen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Christian Reiher, Tomasz Schoen:
Note on the Theorem of Balog, Szemerédi, and Gowers. Comb. 44(3): 691-698 (2024)- 2022
- [j20]Tomasz Schoen
:
A note on bilinear exponential sums in prime fields. Finite Fields Their Appl. 80: 102007 (2022) - 2021
- [j19]Tomasz Schoen:
A Diophantine Ramsey Theorem. Comb. 41(4): 581-599 (2021) - [j18]Tomasz Schoen:
A Subexponential Upper Bound for van der Waerden Numbers $W(3, k)$. Electron. J. Comb. 28(2): 2 (2021)
2010 – 2019
- 2019
- [j17]Tomasz Schoen, Ilya D. Shkredov:
An Upper Bound for Weak Bk-Sets. SIAM J. Discret. Math. 33(2): 837-844 (2019) - 2017
- [j16]Karol Cwalina, Tomasz Schoen:
Tight bounds on additive Ramsey-type numbers. J. Lond. Math. Soc. 96(3): 601-620 (2017) - 2016
- [j15]Tomasz Schoen, Ilya D. Shkredov:
A Remark on A+B and A-A for Compact Sets in Rn. Integers 16: A60 (2016) - 2015
- [j14]Tomasz Schoen:
New bounds in Balog-Szemerédi-Gowers theorem. Comb. 35(6): 695-701 (2015) - 2013
- [j13]Arturas Dubickas, Tomasz Schoen, Manuel Silva, Paulius Sarka:
Finding large co-Sidon subsets in sets with a given additive energy. Eur. J. Comb. 34(7): 1144-1157 (2013) - 2011
- [j12]Tomasz Schoen, Ilya D. Shkredov:
On Sumsets of Convex Sets. Comb. Probab. Comput. 20(5): 793-798 (2011)
2000 – 2009
- 2007
- [j11]Tomasz Schoen:
Difference Covers. Comb. Probab. Comput. 16(5): 775-787 (2007) - 2005
- [j10]Andreas Baltz, Peter Hegarty, Jonas Knape, Urban Larsson, Tomasz Schoen:
The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc. Electron. J. Comb. 12 (2005) - 2002
- [j9]Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz Schoen:
On the discrepancy of combinatorial rectangles. Random Struct. Algorithms 21(3-4): 205-215 (2002) - 2001
- [j8]Geir Agnarsson, Benjamin Doerr, Tomasz Schoen:
Coloring t-dimensional m-Boxes. Discret. Math. 226(1-3): 21-33 (2001) - [j7]Tomasz Luczak, Tomasz Schoen:
Sum-Free Subsets of Right Cancellative Semigroups. Eur. J. Comb. 22(7): 999-1002 (2001) - [j6]Andreas Baltz, Tomasz Schoen, Anand Srivastav:
Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract). Electron. Notes Discret. Math. 7: 42-45 (2001) - [j5]Tomasz Schoen:
On a Problem of Erds and Sárközy. J. Comb. Theory A 94(1): 191-195 (2001) - [c2]Andreas Baltz, Tomasz Schoen, Anand Srivastav:
On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. RANDOM-APPROX 2001: 192-201 - 2000
- [j4]Tomasz Schoen:
A Note on the Number of (k, l)-Sum-Free Sets. Electron. J. Comb. 7 (2000)
1990 – 1999
- 1999
- [j3]Tomasz Schoen:
The Number of Monochromatic Schur Triples. Eur. J. Comb. 20(8): 855-866 (1999) - [j2]Tomasz Schoen:
On Sets of Natural Numbers Whose Sumset is Free of Squares. J. Comb. Theory A 88(2): 385-388 (1999) - [c1]Andreas Baltz, Tomasz Schoen, Anand Srivastav:
Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets. RANDOM-APPROX 1999: 138-143 - 1998
- [j1]Tomasz Luczak, Vojtech Rödl, Tomasz Schoen:
Independent finite sums in graphs defined on the natural numbers. Discret. Math. 181(1-3): 289-294 (1998)
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 20:30 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:
