default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSándor Z. Kiss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Márton Erdélyi, Pál Hegedüs
, Sándor Z. Kiss, Gábor Péter Nagy:
On linear codes with random multiplier vectors and the maximum trace dimension property. J. Math. Cryptol. 18(1) (2024)- 2023
- [j12]Sándor Z. Kiss, Péter Kutas:
An identification system based on the explicit isomorphism problem. Appl. Algebra Eng. Commun. Comput. 34(6): 913-930 (2023) - [j11]Sándor Z. Kiss, Csaba Sándor:
Dense sumsets of Sidon sequences. Eur. J. Comb. 107: 103600 (2023) - [i3]Márton Erdélyi, Pál Hegedüs, Sándor Z. Kiss, Gábor Péter Nagy:
On Linear Codes with Random Multiplier Vectors and the Maximum Trace Dimension Property. CoRR abs/2309.00687 (2023) - 2021
- [j10]Sándor Z. Kiss, Csaba Sándor:
Generalized asymptotic Sidon basis. Discret. Math. 344(2): 112208 (2021) - [j9]Sándor Z. Kiss, Éva Hosszu, János Tapolcai, Lajos Rónyai, Ori Rottenstreich:
Bloom Filter With a False Positive Free Zone. IEEE Trans. Netw. Serv. Manag. 18(2): 2334-2349 (2021)
2010 – 2019
- 2019
- [j8]Sándor Z. Kiss, Csaba Sándor:
On the Structure of Sets Which Have Coinciding Representation Functions. Integers 19: A66 (2019) - [j7]Sándor Z. Kiss, Csaba Sándor, Quan-Hui Yang:
On minimal additive complements of integers. J. Comb. Theory A 162: 344-353 (2019) - 2018
- [j6]Sándor Z. Kiss, Csaba Sándor, Quan-Hui Yang:
On a Conjecture of Erdös about Sets without k Pairwise Coprime Integers. SIAM J. Discret. Math. 32(4): 2453-2466 (2018) - [c1]Sándor Z. Kiss, Éva Hosszu, János Tapolcai, Lajos Rónyai, Ori Rottenstreich:
Bloom Filter with a False Positive Free Zone. INFOCOM 2018: 1412-1420 - [i2]Sándor Z. Kiss, Péter Kutas:
An identification system based on the explicit isomorphism problem. CoRR abs/1812.09130 (2018) - 2017
- [j5]Sándor Z. Kiss, Csaba Sándor:
Partitions of the set of nonnegative integers with the same representation functions. Discret. Math. 340(6): 1154-1161 (2017) - 2015
- [j4]Sándor Z. Kiss, Éva Hosszu, Lajos Rónyai, János Tapolcai:
On a Parity Based Group Testing Algorithm. Acta Cybern. 22(2): 423-433 (2015) - 2014
- [j3]István Miklós, Sándor Z. Kiss, Eric Tannier:
Counting and sampling SCJ small parsimony solutions. Theor. Comput. Sci. 552: 83-98 (2014) - 2013
- [i1]István Miklós, Sándor Z. Kiss, Eric Tannier:
On sampling SCJ rearrangement scenarios. CoRR abs/1304.2170 (2013) - 2010
- [j2]Javier Cilleruelo, Sándor Z. Kiss, Imre Z. Ruzsa, Carlos Vinuesa:
Generalization of a theorem of Erdos and Rényi on Sidon sequences. Random Struct. Algorithms 37(4): 455-464 (2010)
2000 – 2009
- 2005
- [j1]Sándor Z. Kiss:
On a regularity property of additive representation functions. Period. Math. Hung. 51(2): 31-35 (2005)
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-10-07 22:06 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:
