default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNorbert Hegyvári
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j15]Norbert Hegyvári:
On arithmetic sums of Cantor-type sequences of integers. Discret. Appl. Math. 345: 1-3 (2024)- [j14]Norbert Hegyvári
:
The complexity of subcube partition relates to the additive structure of the support. Inf. Comput. 299: 105170 (2024) - 2019
- [j13]Norbert Hegyvári, François Hennecart, Péter Pál Pach:
On the density of sumsets and product sets. Australas. J Comb. 74: 1-16 (2019) - 2016
- [j12]Norbert Hegyvári, Imre Z. Ruzsa:
Additive structure of difference sets and a theorem of Følner. Australas. J Comb. 64: 437-443 (2016) - 2015
- [j11]Norbert Hegyvári, François Hennecart:
Note on a Result of Chung on Weil Type Sums. Integers 15: A37 (2015) - 2013
- [j10]Norbert Hegyvári, François Hennecart:
Conditional expanding bounds for two-variable functions over prime fields. Eur. J. Comb. 34(8): 1365-1382 (2013) - 2008
- [j9]Norbert Hegyvári:
On additive and multiplicative Hilbert cubes. J. Comb. Theory A 115(2): 354-360 (2008) - 2007
- [j8]Norbert Hegyvári, François Hennecart, Alain Plagne:
Answer to a Question by Burr and Erdös on Restricted Addition, and Related Results. Comb. Probab. Comput. 16(5): 747-756 (2007) - 2005
- [j7]Norbert Hegyvári:
On Intersecting Properties of Partitions of Integers. Comb. Probab. Comput. 14(3): 319-323 (2005) - 2003
- [j6]Norbert Hegyvári:
On a problem of Sárközi. Period. Math. Hung. 47(1-2): 89-93 (2003) - 2002
- [j5]Norbert Hegyvári:
On iterated difference sets in groups. Period. Math. Hung. 43(1-2): 105-110 (2002) - [j4]Norbert Hegyvári:
Note on difference sets in Z n. Period. Math. Hung. 44(2): 183-185 (2002) - 1997
- [j3]Béla Bollobás, Norbert Hegyvári, Guoping Jin:
On a problem of Erdös and Graham. Discret. Math. 175(1-3): 253-257 (1997) - 1996
- [j2]Norbert Hegyvári:
Subset sums in N2. Comb. Probab. Comput. 5: 393-402 (1996) - [j1]Norbert Hegyvári:
Complete Sequences in N2. Eur. J. Comb. 17(8): 741-749 (1996)
Informal and Other Publications
- 2021
- [i2]Bence Bakos, Norbert Hegyvári, Máté Pálfy:
On a Communication Complexity problem in Combinatorial Number Theory. CoRR abs/2103.08174 (2021) - 2020
- [i1]Norbert Hegyvári:
On uncertainty inequalities related to subcube partitions and additive energy. CoRR abs/2009.10127 (2020)
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-19 21:47 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:
