default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBence Csajbók
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Angela Aguglia, Bence Csajbók, Luca Giuzzi
:
On regular sets of affine type in finite Desarguesian planes and related codes. Discret. Math. 347(4): 113835 (2024)- 2023
- [j19]Bence Csajbók, Angela Aguglia, Zsuzsa Weiner:
Intersecting families of graphs of functions over a finite field. Ars Math. Contemp. 24(1): 1 (2023) - [j18]Bence Csajbók, Péter Sziklai, Zsuzsa Weiner:
Renitent lines. Eur. J. Comb. 114: 103792 (2023) - [i1]Angela Aguglia, Bence Csajbók, Luca Giuzzi:
On regular sets of affine type in finite Desarguesian planes and related codes. CoRR abs/2305.17103 (2023) - 2021
- [j17]Bence Csajbók, Giuseppe Marino, Olga Polverino, Ferdinando Zullo:
Generalising the Scattered Property of Subspaces. Comb. 41(2): 237-262 (2021) - [j16]Bence Csajbók, Zsuzsa Weiner:
Generalizing Korchmáros - Mazzocca Arcs. Comb. 41(5): 601-623 (2021) - 2020
- [j15]Simeon Ball, Bence Csajbók:
On sets of points with few odd secants. Comb. Probab. Comput. 29(1): 31-43 (2020) - [j14]Bence Csajbók, Giuseppe Marino, Olga Polverino, Yue Zhou:
MRD codes with maximum idealizers. Discret. Math. 343(9): 111985 (2020)
2010 – 2019
- 2019
- [j13]Bence Csajbók, Giuseppe Marino, Olga Polverino:
A Carlitz type result for linearized polynomials. Ars Math. Contemp. 16(2): 585-608 (2019) - [j12]Bence Csajbók, Tamás Héger:
Double blocking sets of size 3q-1 in PG(2, q). Eur. J. Comb. 78: 73-89 (2019) - [j11]Bence Csajbók, Giuseppe Marino, Olga Polverino, Ferdinando Zullo:
A characterization of linearized polynomials with maximum kernel. Finite Fields Their Appl. 56: 109-130 (2019) - 2018
- [j10]Bence Csajbók:
On Bisecants of Rédei Type Blocking Sets and Applications. Comb. 38(1): 143-166 (2018) - [j9]Bence Csajbók, Corrado Zanella:
Maximum scattered 픽q-linear sets of PG(1, q4). Discret. Math. 341(1): 74-80 (2018) - [j8]Simeon Ball, Bence Csajbók:
On Segre's Lemma of Tangents. Electron. Notes Discret. Math. 68: 11-16 (2018) - [j7]Bence Csajbók, Giuseppe Marino, Ferdinando Zullo:
New maximum scattered linear sets of the projective line. Finite Fields Their Appl. 54: 133-150 (2018) - [j6]Bence Csajbók, Giuseppe Marino, Olga Polverino:
Classes and equivalence of linear sets in PG(1, qn). J. Comb. Theory A 157: 402-426 (2018) - 2016
- [j5]Bence Csajbók, Corrado Zanella:
On the equivalence of linear sets. Des. Codes Cryptogr. 81(2): 269-281 (2016) - [j4]Bence Csajbók, Corrado Zanella:
On scattered linear sets of pseudoregulus type in PG(1, qt). Finite Fields Their Appl. 41: 34-54 (2016) - 2014
- [j3]Bence Csajbók:
Semiarcs with Long Secants. Electron. J. Comb. 21(1): 1 (2014) - 2013
- [j2]Bence Csajbók:
Semiarcs with long secants. Electron. Notes Discret. Math. 40: 95-99 (2013) - [j1]Bence Csajbók:
Linear subspaces of finite fields with large inverse-closed subsets. Finite Fields Their Appl. 19(1): 55-66 (2013)
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 2025-01-04 03:19 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:
