default search action
Tarik Kaced
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j7]Oriol Farràs
, Tarik Kaced
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. IEEE Trans. Inf. Theory 66(11): 7088-7100 (2020)
2010 – 2019
- 2018
- [j6]Tarik Kaced
A Conditional Information Inequality and Its Combinatorial Applications. IEEE Trans. Inf. Theory 64(5): 3610-3615 (2018) - [j5]Tarik Kaced
Information Inequalities are Not Closed Under Polymatroid Duality. IEEE Trans. Inf. Theory 64(6): 4379-4381 (2018) - [c8]Oriol Farràs
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. EUROCRYPT (1) 2018: 597-621 - 2017
- [j4]Oriol Farràs
On the Information Ratio of Non-perfect Secret Sharing Schemes. Algorithmica 79(4): 987-1013 (2017) - [i12]Oriol Farràs, Tarik Kaced, Sebastià Martín Molleví, Carles Padró:
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. IACR Cryptol. ePrint Arch. 2017: 919 (2017) - 2016
- [j3]Chung Chan
Info-Clustering: A Mathematical Theory for Data Clustering. IEEE Trans. Mol. Biol. Multi Scale Commun. 2(1): 64-91 (2016) - [i11]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tarik Kaced, Tie Liu:
Info-Clustering: A Mathematical Theory for Data Clustering. CoRR abs/1605.01233 (2016) - [i10]Tarik Kaced:
The Entropy Region is not Closed Under Duality. CoRR abs/1611.04109 (2016) - 2015
- [j2]Chung Chan
Multivariate Mutual Information Inspired by Secret-Key Agreement. Proc. IEEE 103(10): 1883-1913 (2015) - [c7]Chung Chan
Successive omniscience. NetCod 2015: 21-25 - [i9]Tarik Kaced, Andrei E. Romashchenko, Nikolay K. Vereshchagin:
Conditional Information Inequalities and Combinatorial Applications. CoRR abs/1501.04867 (2015) - 2014
- [c6]Oriol Farràs
Optimal Non-perfect Uniform Secret Sharing Schemes. CRYPTO (2) 2014: 217-234 - [c5]Tongxin Li
Group testing with prior statistics. ISIT 2014: 2346-2350 - [i8]Tongxin Li, Chun Lam Chan, Wenhao Huang, Tarik Kaced, Sidharth Jaggi:
Group Testing with Prior Statistics. CoRR abs/1401.3667 (2014) - [i7]Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, Carles Padró:
Optimal Non-Perfect Uniform Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2014: 124 (2014) - 2013
- [j1]Tarik Kaced, Andrei E. Romashchenko
Conditional Information Inequalities for Entropic and Almost Entropic Points. IEEE Trans. Inf. Theory 59(11): 7149-7167 (2013) - [c4]Tarik Kaced:
Equivalence of two proof techniques for non-shannon-type inequalities. ISIT 2013: 236-240 - [i6]Tarik Kaced:
Equivalence of Two Proof Techniques for Non-Shannon-type Inequalities. CoRR abs/1302.2994 (2013) - 2012
- [b1]Tarik Kaced:
Secret Sharing and Algorithmic Information Theory. (Partage de secret et the'orie algorithmique de l'information). Montpellier 2 University, France, 2012 - [c3]Tarik Kaced, Andrei E. Romashchenko
On the non-robustness of essentially conditional information inequalities. ITW 2012: 262-266 - [i5]Tarik Kaced, Andrei E. Romashchenko:
Conditional and unconditional information inequalities: an algebraic example. CoRR abs/1201.6398 (2012) - [i4]Tarik Kaced, Andrei E. Romashchenko:
On the Non-robustness of Essentially Conditional Information Inequalities. CoRR abs/1207.5458 (2012) - [i3]Tarik Kaced, Andrei E. Romashchenko:
Conditional Information Inequalities for Entropic and Almost Entropic Points. CoRR abs/1207.5742 (2012) - 2011
- [c2]Tarik Kaced:
Almost-perfect secret sharing. ISIT 2011: 1603-1607 - [c1]Tarik Kaced, Andrei E. Romashchenko
On essentially conditional information inequalities. ISIT 2011: 1935-1939 - [i2]Tarik Kaced:
Almost-perfect secret sharing. CoRR abs/1103.2544 (2011) - [i1]Tarik Kaced, Andrei E. Romashchenko:
Constraint information inequalities revisited. CoRR abs/1103.2545 (2011)
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-05-08 21:02 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: