default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNatalia Silberstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c20]Natalia Silberstein
, Or Shoham, Assaf Klein:
Combating Ad Fatigue via Frequency-Recency Features in Online Advertising Systems. CIKM 2023: 4822-4828- [c19]Blaz Skrlj, Nir Ki-Tov, Lee Edelist, Natalia Silberstein, Hila Weisman-Zohar, Blaz Mramor, Davorin Kopic, Naama Ziporin:
Drifter: Efficient Online Feature Monitoring for Improved Data Integrity in Large-Scale Recommendation Systems. ORSUM@RecSys 2023 - [c18]Jan Hartman, Assaf Klein, Davorin Kopic, Natalia Silberstein:
Unleash the Power of Context: Enhancing Large-Scale Recommender Systems with Context-Based Prediction Models. RecSys 2023: 1075-1077 - [i28]Jan Hartman, Assaf Klein, Davorin Kopic, Natalia Silberstein:
Unleash the Power of Context: Enhancing Large-Scale Recommender Systems with Context-Based Prediction Models. CoRR abs/2308.01231 (2023) - [i27]Blaz Skrlj, Nir Ki-Tov, Lee Edelist, Natalia Silberstein, Hila Weisman-Zohar, Blaz Mramor, Davorin Kopic, Naama Ziporin:
Drifter: Efficient Online Feature Monitoring for Improved Data Integrity in Large-Scale Recommendation Systems. CoRR abs/2309.08617 (2023) - 2020
- [c17]Oleg Zendel, Yaroslav Fyodorov, Fiana Raiber, Natalia Silberstein, Oren Somekh, Ali Tabaja:
Leveraging User Email Actions to Improve Ad-Close Prediction. CIKM 2020: 2293-2296 - [c16]Natalia Silberstein, Oren Somekh, Yair Koren, Michal Aharon, Dror Porat, Avi Shahar, Tingyi Wu:
Ad Close Mitigation for Improved User Experience in Native Advertisements. WSDM 2020: 546-554
2010 – 2019
- 2019
- [j14]Natalia Silberstein, Tuvi Etzion, Moshe Schwartz:
Locality and Availability of Array Codes Constructed From Subspaces. IEEE Trans. Inf. Theory 65(5): 2648-2660 (2019) - 2018
- [j13]Natalia Silberstein, Alexander Zeh:
Anticode-based locally repairable codes with high availability. Des. Codes Cryptogr. 86(2): 419-445 (2018) - [j12]Hui Zhang, Eitan Yaakobi, Natalia Silberstein:
Multiset combinatorial batch codes. Des. Codes Cryptogr. 86(11): 2645-2660 (2018) - [c15]Iftah Gamzu, Liane Lewin-Eytan, Natalia Silberstein:
Unsubscription: A Simple Way to Ease Overload in Email. WSDM 2018: 189-197 - 2017
- [j11]Netanel Raviv, Natalia Silberstein, Tuvi Etzion:
Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields. IEEE Trans. Inf. Theory 63(4): 2015-2038 (2017) - [c14]Natalia Silberstein, Tuvi Etzion, Moshe Schwartz:
Locality and availability of array codes constructed from subspaces. ISIT 2017: 829-833 - [c13]Hui Zhang, Eitan Yaakobi, Natalia Silberstein:
Multiset combinatorial batch codes. ISIT 2017: 2183-2187 - [i26]Hui Zhang, Eitan Yaakobi, Natalia Silberstein:
Multiset Combinatorial Batch Codes. CoRR abs/1701.02708 (2017) - [i25]Natalia Silberstein, Tuvi Etzion, Moshe Schwartz:
Locality and Availability of Array Codes Constructed from Subspaces. CoRR abs/1701.07501 (2017) - 2016
- [j10]Natalia Silberstein, Anna Gál:
Optimal combinatorial batch codes based on block designs. Des. Codes Cryptogr. 78(2): 409-424 (2016) - [c12]Netanel Raviv, Natalia Silberstein, Tuvi Etzion:
Constructions of high-rate minimum storage regenerating codes over small fields. ISIT 2016: 61-65 - 2015
- [j9]Natalia Silberstein, Anna-Lena Trautmann:
Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks. IEEE Trans. Inf. Theory 61(7): 3937-3953 (2015) - [j8]Natalia Silberstein, Tuvi Etzion:
Optimal Fractional Repetition Codes Based on Graphs and Designs. IEEE Trans. Inf. Theory 61(8): 4164-4180 (2015) - [j7]Natalia Silberstein, Ankit Singh Rawat, Sriram Vishwanath:
Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes. IEEE Trans. Inf. Theory 61(11): 5765-5778 (2015) - [c11]Natalia Silberstein, Alexander Zeh:
Optimal binary locally repairable codes via anticodes. ISIT 2015: 1247-1251 - [c10]Natalia Silberstein, Tuvi Etzion:
Optimal fractional repetition codes and fractional repetition batch codes. ISIT 2015: 2046-2050 - [i24]Natalia Silberstein, Tuvi Etzion:
Optimal Fractional Repetition Codes and Fractional Repetition Batch Codes. CoRR abs/1501.05177 (2015) - [i23]Natalia Silberstein, Alexander Zeh:
Optimal Binary Locally Repairable Codes via Anticodes. CoRR abs/1501.07114 (2015) - [i22]Netanel Raviv, Natalia Silberstein, Tuvi Etzion:
Access-optimal MSR Codes with Optimal Sub-packetization over Small Fields. CoRR abs/1505.00919 (2015) - 2014
- [j6]Joachim Rosenthal, Natalia Silberstein, Anna-Lena Trautmann:
On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes. Des. Codes Cryptogr. 73(2): 393-416 (2014) - [c9]Natalia Silberstein:
Fractional Repetition and Erasure Batch Codes. ICMCTA 2014: 335-343 - [c8]Ankit Singh Rawat, Natalia Silberstein, Onur Ozan Koyluoglu, Sriram Vishwanath:
Secure distributed storage systems: Local repair with minimum bandwidth regeneration. ISCCSP 2014: 5-8 - [i21]Natalia Silberstein, Tuvi Etzion:
Optimal Fractional Repetition Codes. CoRR abs/1401.4734 (2014) - [i20]Natalia Silberstein, Anna-Lena Trautmann:
Subspace Codes based on Graph Matchings, Ferrers Diagrams and Pending Blocks. CoRR abs/1404.6723 (2014) - [i19]Natalia Silberstein:
Fractional Repetition Batch Codes. CoRR abs/1405.6157 (2014) - 2013
- [j5]Tuvi Etzion, Natalia Silberstein:
Codes and Designs Related to Lifted MRD Codes. IEEE Trans. Inf. Theory 59(2): 1004-1017 (2013) - [j4]Tuvi Etzion, Natalia Silberstein:
Errata to "Codes and Designs Related to Lifted MRD Codes". IEEE Trans. Inf. Theory 59(7): 4730 (2013) - [c7]Govinda M. Kamath, Natalia Silberstein, N. Prakash, Ankit Singh Rawat, V. Lalitha, Onur Ozan Koyluoglu, P. Vijay Kumar, Sriram Vishwanath:
Explicit MBR all-symbol locality codes. ISIT 2013: 504-508 - [c6]Natalia Silberstein, Anna-Lena Trautmann:
New lower bounds for constant dimension codes. ISIT 2013: 514-518 - [c5]Natalia Silberstein, Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath:
Optimal locally repairable codes via rank-metric codes. ISIT 2013: 1819-1823 - [c4]Ankit Singh Rawat, Onur Ozan Koyluoglu, Natalia Silberstein, Sriram Vishwanath:
Secure locally repairable codes for distributed storage systems. ISIT 2013: 2224-2228 - [c3]Ankit Singh Rawat, Natalia Silberstein, Onur Ozan Koyluoglu, Sriram Vishwanath:
Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes. ITA 2013: 1-8 - [i18]Anna-Lena Trautmann, Natalia Silberstein, Joachim Rosenthal:
List Decoding of Lifted Gabidulin Codes via the Plücker Embedding. CoRR abs/1301.2165 (2013) - [i17]Natalia Silberstein, Anna-Lena Trautmann:
New Lower Bounds for Constant Dimension Codes. CoRR abs/1301.5961 (2013) - [i16]Natalia Silberstein, Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath:
Optimal Locally Repairable Codes via Rank-Metric Codes. CoRR abs/1301.6331 (2013) - [i15]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar, Natalia Silberstein, Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath:
Explicit MBR All-Symbol Locality Codes. CoRR abs/1302.0744 (2013) - [i14]Joachim Rosenthal, Natalia Silberstein, Anna-Lena Trautmann:
On the Geometry of Balls in the Grassmannian and List Decoding of Lifted Gabidulin Codes. CoRR abs/1309.0403 (2013) - [i13]Natalia Silberstein, Ankit Singh Rawat, Sriram Vishwanath:
Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes. CoRR abs/1312.3194 (2013) - [i12]Natalia Silberstein, Anna Gál:
Optimal Combinatorial Batch Codes based on Block Designs. CoRR abs/1312.5505 (2013) - 2012
- [c2]Natalia Silberstein, Ankit Singh Rawat, Sriram Vishwanath:
Error resilience in distributed storage via rank-metric codes. Allerton Conference 2012: 1150-1157 - [i11]Natalia Silberstein, Ankit Singh Rawat, Sriram Vishwanath:
Adversarial Error Resilience in Distributed Storage Using MRD Codes and MDS Array Codes. CoRR abs/1202.0800 (2012) - [i10]Ankit Singh Rawat, Onur Ozan Koyluoglu, Natalia Silberstein, Sriram Vishwanath:
Optimal Locally Repairable and Secure Codes for Distributed Storage Systems. CoRR abs/1210.6954 (2012) - 2011
- [b1]Natalia Silberstein:
Coding theory and projective spaces. Technion - Israel Institute of Technology, Israel, 2011 - [j3]Natalia Silberstein, Tuvi Etzion:
Large constant dimension codes and lexicodes. Adv. Math. Commun. 5(2): 177-189 (2011) - [j2]Natalia Silberstein, Tuvi Etzion:
Enumerative Coding for Grassmannian Space. IEEE Trans. Inf. Theory 57(1): 365-374 (2011) - [c1]Natalia Silberstein, Tuvi Etzion:
Codes and designs related to lifted MRD codes. ISIT 2011: 2288-2292 - [i9]Natalia Silberstein, Tuvi Etzion:
Codes and Designs Related to Lifted MRD Codes. CoRR abs/1102.2593 (2011) - 2010
- [i8]Natalia Silberstein, Tuvi Etzion:
Large Constant Dimension Codes and Lexicodes. CoRR abs/1003.4879 (2010) - [i7]Natalia Silberstein:
Properties of Codes in the Johnson Scheme. CoRR abs/1004.4882 (2010) - [i6]Natalia Silberstein, Tuvi Etzion:
On Perfect Codes in the Johnson Graph. CoRR abs/1004.5195 (2010)
2000 – 2009
- 2009
- [j1]Tuvi Etzion, Natalia Silberstein:
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams. IEEE Trans. Inf. Theory 55(7): 2909-2919 (2009) - [i5]Natalia Silberstein, Tuvi Etzion:
Enumerative Encoding in the Grassmannian Space. CoRR abs/0903.1556 (2009) - [i4]Natalia Silberstein, Tuvi Etzion:
Representation of Subspaces and Enumerative Encoding of the Grassmannian Space. CoRR abs/0911.3256 (2009) - 2008
- [i3]Natalia Silberstein, Tuvi Etzion:
Coding Theory in Projective Space. CoRR abs/0805.3528 (2008) - [i2]Tuvi Etzion, Natalia Silberstein:
Construction of Error-Correcting Codes for Random Network Coding. CoRR abs/0807.2440 (2008) - [i1]Tuvi Etzion, Natalia Silberstein:
Error-Correcting Codes in Projective Spaces via Rank-Metric Codes and Ferrers Diagrams. CoRR abs/0807.4846 (2008)
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-04-25 05:42 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:
