---
_id: '6628'
abstract:
- lang: eng
text: Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces
in Euclidean space by piecewise flat triangular meshes with a given number
of vertices on the hypersurface that are optimal with respect to Hausdorff distance. They proved that this
Hausdorff distance decreases inversely proportional with m 2/(d−1), where m is the number of vertices and
d is the dimension of Euclidean space. Moreover the pro-portionality constant
can be expressed in terms of the Gaussian curvature, an intrinsic quantity. In
this short note, we prove the extrinsic nature of this constant for manifolds
of sufficiently high codimension. We do so by constructing an family of isometric
embeddings of the flat torus in Euclidean space.
author:
- first_name: Gert
full_name: Vegter, Gert
last_name: Vegter
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: 'Vegter G, Wintraecken M. The extrinsic nature of the Hausdorff distance of
optimal triangulations of manifolds. In: The 31st Canadian Conference in Computational
Geometry. ; 2019:275-279.'
apa: Vegter, G., & Wintraecken, M. (2019). The extrinsic nature of the Hausdorff
distance of optimal triangulations of manifolds. In The 31st Canadian Conference
in Computational Geometry (pp. 275–279). Edmonton, Canada.
chicago: Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff
Distance of Optimal Triangulations of Manifolds.” In The 31st Canadian Conference
in Computational Geometry, 275–79, 2019.
ieee: G. Vegter and M. Wintraecken, “The extrinsic nature of the Hausdorff distance
of optimal triangulations of manifolds,” in The 31st Canadian Conference in
Computational Geometry, Edmonton, Canada, 2019, pp. 275–279.
ista: 'Vegter G, Wintraecken M. 2019. The extrinsic nature of the Hausdorff distance
of optimal triangulations of manifolds. The 31st Canadian Conference in Computational
Geometry. CCCG: Canadian Conference in Computational Geometry, 275–279.'
mla: Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff
Distance of Optimal Triangulations of Manifolds.” The 31st Canadian Conference
in Computational Geometry, 2019, pp. 275–79.
short: G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational
Geometry, 2019, pp. 275–279.
conference:
end_date: 2019-08-10
location: Edmonton, Canada
name: 'CCCG: Canadian Conference in Computational Geometry'
start_date: 2019-08-08
date_created: 2019-07-12T08:34:57Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2021-01-12T08:08:16Z
day: '01'
ddc:
- '004'
department:
- _id: HeEd
ec_funded: 1
file:
- access_level: open_access
checksum: ceabd152cfa55170d57763f9c6c60a53
content_type: application/pdf
creator: mwintrae
date_created: 2019-07-12T08:32:46Z
date_updated: 2020-07-14T12:47:34Z
file_id: '6629'
file_name: IntrinsicExtrinsicCCCG2019.pdf
file_size: 321176
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 275-279
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: The 31st Canadian Conference in Computational Geometry
publication_status: published
quality_controlled: '1'
scopus_import: 1
status: public
title: The extrinsic nature of the Hausdorff distance of optimal triangulations of
manifolds
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6648'
abstract:
- lang: eng
text: "Various kinds of data are routinely represented as discrete probability distributions.
Examples include text documents summarized by histograms of word occurrences and
images represented as histograms of oriented gradients. Viewing a discrete probability
distribution as a point in the standard simplex of the appropriate dimension,
we can understand collections of such objects in geometric and topological terms.
Importantly, instead of using the standard Euclidean distance, we look into dissimilarity
measures with information-theoretic justification, and we develop the theory\r\nneeded
for applying topological data analysis in this setting. In doing so, we emphasize
constructions that enable the usage of existing computational topology software
in this context."
alternative_title:
- LIPIcs
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ziga
full_name: Virk, Ziga
last_name: Virk
- first_name: Hubert
full_name: Wagner, Hubert
id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
citation:
ama: 'Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information
space. In: 35th International Symposium on Computational Geometry. Vol
129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:31:1-31:14. doi:10.4230/LIPICS.SOCG.2019.31'
apa: 'Edelsbrunner, H., Virk, Z., & Wagner, H. (2019). Topological data analysis
in information space. In 35th International Symposium on Computational Geometry
(Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.31'
chicago: Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data
Analysis in Information Space.” In 35th International Symposium on Computational
Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019. https://doi.org/10.4230/LIPICS.SOCG.2019.31.
ieee: H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information
space,” in 35th International Symposium on Computational Geometry, Portland,
OR, United States, 2019, vol. 129, p. 31:1-31:14.
ista: 'Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information
space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium
on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.'
mla: Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.”
35th International Symposium on Computational Geometry, vol. 129, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:10.4230/LIPICS.SOCG.2019.31.
short: H. Edelsbrunner, Z. Virk, H. Wagner, in:, 35th International Symposium on
Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019,
p. 31:1-31:14.
conference:
end_date: 2019-06-21
location: Portland, OR, United States
name: 'SoCG 2019: Symposium on Computational Geometry'
start_date: 2019-06-18
date_created: 2019-07-17T10:36:09Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2021-01-12T08:08:23Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.4230/LIPICS.SOCG.2019.31
external_id:
arxiv:
- '1903.08510'
file:
- access_level: open_access
checksum: 8ec8720730d4c789bf7b06540f1c29f4
content_type: application/pdf
creator: dernst
date_created: 2019-07-24T06:40:01Z
date_updated: 2020-07-14T12:47:35Z
file_id: '6666'
file_name: 2019_LIPICS_Edelsbrunner.pdf
file_size: 1355179
relation: main_file
file_date_updated: 2020-07-14T12:47:35Z
has_accepted_license: '1'
intvolume: ' 129'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '06'
oa: 1
oa_version: Published Version
page: 31:1-31:14
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: 35th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771047'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Topological data analysis in information space
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 129
year: '2019'
...
---
_id: '6659'
abstract:
- lang: eng
text: Chemical labeling of proteins with synthetic molecular probes offers the possibility
to probe the functions of proteins of interest in living cells. However, the methods
for covalently labeling targeted proteins using complementary peptide tag-probe
pairs are still limited, irrespective of the versatility of such pairs in biological
research. Herein, we report the new CysHis tag-Ni(II) probe pair for the specific
covalent labeling of proteins. A broad-range evaluation of the reactivity profiles
of the probe and the CysHis peptide tag afforded a tag-probe pair with an optimized
and high labeling selectivity and reactivity. In particular, the labeling specificity
of this pair was notably improved compared to the previously reported one. This
pair was successfully utilized for the fluorescence imaging of membrane proteins
on the surfaces of living cells, demonstrating its potential utility in biological
research.
acknowledgement: his work was supported by the Grant-in-Aid for Scientific Research
B (JSPS KAKENHI grant no. JP17H03090 to A. O.); the Scientific Research on Innovative
Areas “Chemistry for Multimolecular Crowding Biosystems” (JSPS KAKENHI grant no.
JP17H06349 to A. O.); and the European Union (European Research Council Advanced
grant no. 694539 and Human Brain Project Ref. 720270 to R. S.). A. O. acknowledges
the financial support of the Takeda Science Foundation.
article_processing_charge: No
article_type: original
author:
- first_name: Naoki
full_name: Zenmyo, Naoki
last_name: Zenmyo
- first_name: Hiroki
full_name: Tokumaru, Hiroki
last_name: Tokumaru
- first_name: Shohei
full_name: Uchinomiya, Shohei
last_name: Uchinomiya
- first_name: Hirokazu
full_name: Fuchida, Hirokazu
last_name: Fuchida
- first_name: Shigekazu
full_name: Tabata, Shigekazu
id: 4427179E-F248-11E8-B48F-1D18A9856A87
last_name: Tabata
- first_name: Itaru
full_name: Hamachi, Itaru
last_name: Hamachi
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Akio
full_name: Ojida, Akio
last_name: Ojida
citation:
ama: Zenmyo N, Tokumaru H, Uchinomiya S, et al. Optimized reaction pair of the CysHis
tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins.
Bulletin of the Chemical Society of Japan. 2019;92(5):995-1000. doi:10.1246/bcsj.20190034
apa: Zenmyo, N., Tokumaru, H., Uchinomiya, S., Fuchida, H., Tabata, S., Hamachi,
I., … Ojida, A. (2019). Optimized reaction pair of the CysHis tag and Ni(II)-NTA
probe for highly selective chemical labeling of membrane proteins. Bulletin
of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan.
https://doi.org/10.1246/bcsj.20190034
chicago: Zenmyo, Naoki, Hiroki Tokumaru, Shohei Uchinomiya, Hirokazu Fuchida, Shigekazu
Tabata, Itaru Hamachi, Ryuichi Shigemoto, and Akio Ojida. “Optimized Reaction
Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling
of Membrane Proteins.” Bulletin of the Chemical Society of Japan. Bulletin
of the Chemical Society of Japan, 2019. https://doi.org/10.1246/bcsj.20190034.
ieee: N. Zenmyo et al., “Optimized reaction pair of the CysHis tag and Ni(II)-NTA
probe for highly selective chemical labeling of membrane proteins,” Bulletin
of the Chemical Society of Japan, vol. 92, no. 5. Bulletin of the Chemical
Society of Japan, pp. 995–1000, 2019.
ista: Zenmyo N, Tokumaru H, Uchinomiya S, Fuchida H, Tabata S, Hamachi I, Shigemoto
R, Ojida A. 2019. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe
for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical
Society of Japan. 92(5), 995–1000.
mla: Zenmyo, Naoki, et al. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA
Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin
of the Chemical Society of Japan, vol. 92, no. 5, Bulletin of the Chemical
Society of Japan, 2019, pp. 995–1000, doi:10.1246/bcsj.20190034.
short: N. Zenmyo, H. Tokumaru, S. Uchinomiya, H. Fuchida, S. Tabata, I. Hamachi,
R. Shigemoto, A. Ojida, Bulletin of the Chemical Society of Japan 92 (2019) 995–1000.
date_created: 2019-07-21T21:59:16Z
date_published: 2019-05-15T00:00:00Z
date_updated: 2021-01-12T08:08:26Z
day: '15'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1246/bcsj.20190034
ec_funded: 1
file:
- access_level: open_access
checksum: 186de511d6e0ca93f5d981e2443eb8cd
content_type: application/pdf
creator: dernst
date_created: 2020-10-02T08:49:58Z
date_updated: 2020-10-02T08:49:58Z
file_id: '8594'
file_name: 2019_BCSJ_Zenmyo.pdf
file_size: 2464903
relation: main_file
success: 1
file_date_updated: 2020-10-02T08:49:58Z
has_accepted_license: '1'
intvolume: ' 92'
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 995-1000
project:
- _id: 25CA28EA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694539'
name: 'In situ analysis of single channel subunit composition in neurons: physiological
implication in synaptic plasticity and behaviour'
publication: Bulletin of the Chemical Society of Japan
publication_identifier:
issn:
- '00092673'
publication_status: published
publisher: Bulletin of the Chemical Society of Japan
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective
chemical labeling of membrane proteins
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 92
year: '2019'
...
---
_id: '6725'
abstract:
- lang: eng
text: "A Valued Constraint Satisfaction Problem (VCSP) provides a common framework
that can express a wide range of discrete optimization problems. A VCSP instance
is given by a finite set of variables, a finite domain of labels, and an objective
function to be minimized. This function is represented as a sum of terms where
each term depends on a subset of the variables. To obtain different classes of
optimization problems, one can restrict all terms to come from a fixed set Γ of
cost functions, called a language. \r\nRecent breakthrough results have established
a complete complexity classification of such classes with respect to language
Γ: if all cost functions in Γ satisfy a certain algebraic condition then all Γ-instances
can be solved in polynomial time, otherwise the problem is NP-hard. Unfortunately,
testing this condition for a given language Γ is known to be NP-hard. We thus
study exponential algorithms for this meta-problem. We show that the tractability
condition of a finite-valued language Γ can be tested in O(3‾√3|D|⋅poly(size(Γ)))
time, where D is the domain of Γ and poly(⋅) is some fixed polynomial. We also
obtain a matching lower bound under the Strong Exponential Time Hypothesis (SETH).
More precisely, we prove that for any constant δ<1 there is no O(3‾√3δ|D|) algorithm,
assuming that SETH holds."
alternative_title:
- LIPIcs
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th
International Colloquium on Automata, Languages and Programming. Vol 132.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77'
apa: 'Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In
46th International Colloquium on Automata, Languages and Programming (Vol.
132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.ICALP.2019.77'
chicago: Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.”
In 46th International Colloquium on Automata, Languages and Programming,
132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.77.
ieee: V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th
International Colloquium on Automata, Languages and Programming, Patras, Greece,
2019, vol. 132, p. 77:1-77:12.
ista: 'Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th
International Colloquium on Automata, Languages and Programming. ICALP 2019: International
Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.'
mla: Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th
International Colloquium on Automata, Languages and Programming, vol. 132,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.
short: V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages
and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.
conference:
end_date: 2019-07-12
location: Patras, Greece
name: 'ICALP 2019: International Colloquim on Automata, Languages and Programming'
start_date: 2019-07-08
date_created: 2019-07-29T12:23:29Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2021-01-12T08:08:40Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.4230/LIPICS.ICALP.2019.77
ec_funded: 1
external_id:
arxiv:
- '1803.02289'
file:
- access_level: open_access
checksum: f5ebee8eec6ae09e30365578ee63a492
content_type: application/pdf
creator: dernst
date_created: 2019-07-31T07:01:45Z
date_updated: 2020-07-14T12:47:38Z
file_id: '6738'
file_name: 2019_LIPICS_Kolmogorov.pdf
file_size: 575475
relation: main_file
file_date_updated: 2020-07-14T12:47:38Z
has_accepted_license: '1'
intvolume: ' 132'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 77:1-77:12
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: 46th International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- 978-3-95977-109-2
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Testing the complexity of a valued CSP language
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 132
year: '2019'
...
---
_id: '6726'
abstract:
- lang: eng
text: Randomness is an essential part of any secure cryptosystem, but many constructions
rely on distributions that are not uniform. This is particularly true for lattice
based cryptosystems, which more often than not make use of discrete Gaussian distributions
over the integers. For practical purposes it is crucial to evaluate the impact
that approximation errors have on the security of a scheme to provide the best
possible trade-off between security and performance. Recent years have seen surprising
results allowing to use relatively low precision while maintaining high levels
of security. A key insight in these results is that sampling a distribution with
low relative error can provide very strong security guarantees. Since floating
point numbers provide guarantees on the relative approximation error, they seem
a suitable tool in this setting, but it is not obvious which sampling algorithms
can actually profit from them. While previous works have shown that inversion
sampling can be adapted to provide a low relative error (Pöppelmann et al., CHES
2014; Prest, ASIACRYPT 2017), other works have called into question if this is
possible for other sampling techniques (Zheng et al., Eprint report 2018/309).
In this work, we consider all sampling algorithms that are popular in the cryptographic
setting and analyze the relationship of floating point precision and the resulting
relative error. We show that all of the algorithms either natively achieve a low
relative error or can be adapted to do so.
article_processing_charge: No
author:
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
citation:
ama: 'Walter M. Sampling the integers with low relative error. In: Buchmann J, Nitaj
A, Rachidi T, eds. Progress in Cryptology – AFRICACRYPT 2019. Vol 11627.
LNCS. Cham: Springer Nature; 2019:157-180. doi:10.1007/978-3-030-23696-0_9'
apa: 'Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann,
A. Nitaj, & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019
(Vol. 11627, pp. 157–180). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-23696-0_9'
chicago: 'Walter, Michael. “Sampling the Integers with Low Relative Error.” In Progress
in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi,
11627:157–80. LNCS. Cham: Springer Nature, 2019. https://doi.org/10.1007/978-3-030-23696-0_9.'
ieee: 'M. Walter, “Sampling the integers with low relative error,” in Progress
in Cryptology – AFRICACRYPT 2019, vol. 11627, J. Buchmann, A. Nitaj, and T.
Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.'
ista: 'Walter M. 2019.Sampling the integers with low relative error. In: Progress
in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.'
mla: Walter, Michael. “Sampling the Integers with Low Relative Error.” Progress
in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627,
Springer Nature, 2019, pp. 157–80, doi:10.1007/978-3-030-23696-0_9.
short: M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology
– AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.
conference:
end_date: 2019-07-11
location: Rabat, Morocco
name: 'AFRICACRYPT: International Conference on Cryptology in Africa'
start_date: 2019-07-09
date_created: 2019-07-29T12:25:31Z
date_published: 2019-06-29T00:00:00Z
date_updated: 2023-02-23T12:50:15Z
day: '29'
department:
- _id: KrPi
doi: 10.1007/978-3-030-23696-0_9
ec_funded: 1
editor:
- first_name: J
full_name: Buchmann, J
last_name: Buchmann
- first_name: A
full_name: Nitaj, A
last_name: Nitaj
- first_name: T
full_name: Rachidi, T
last_name: Rachidi
intvolume: ' 11627'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/068
month: '06'
oa: 1
oa_version: Preprint
page: 157-180
place: Cham
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Progress in Cryptology – AFRICACRYPT 2019
publication_identifier:
eisbn:
- 978-3-0302-3696-0
isbn:
- 978-3-0302-3695-3
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Sampling the integers with low relative error
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 11627
year: '2019'
...