---
_id: '3132'
abstract:
- lang: eng
text: 'Reproductive division of labour is a characteristic trait of social insects.
The dominant reproductive individual, often the queen, uses chemical communication
and/or behaviour to maintain her social status. Queens of many social insects
communicate their fertility status via cuticle-bound substances. As these substances
usually possess a low volatility, their range in queen–worker communication is
potentially limited. Here, we investigate the range and impact of behavioural
and chemical queen signals on workers of the ant Temnothorax longispinosus. We
compared the behaviour and ovary development of workers subjected to three different
treatments: workers with direct chemical and physical contact to the queen, those
solely under the influence of volatile queen substances and those entirely separated
from the queen. In addition to short-ranged queen signals preventing ovary development
in workers, we discovered a novel secondary pathway influencing worker behaviour.
Workers with no physical contact to the queen, but exposed to volatile substances,
started to develop their ovaries, but did not change their behaviour compared
to workers in direct contact to the queen. In contrast, workers in queen-separated
groups showed both increased ovary development and aggressive dominance interactions.
We conclude that T. longispinosus queens influence worker ovary development and
behaviour via two independent signals, both ensuring social harmony within the
colony.'
acknowledgement: We like to thank the editor and three anonymous reviewers for their
time and constructive criticism and Inon Scharf, Volker Witte and Andreas Modlmeier
for helpful comments on earlier versions of the manuscript. The first and second
authors appear in alphabetical order and contributed equally to this paper.
author:
- first_name: Matthias
full_name: Konrad, Matthias
id: 46528076-F248-11E8-B48F-1D18A9856A87
last_name: Konrad
- first_name: Tobias
full_name: Pamminger, Tobias
last_name: Pamminger
- first_name: Susanne
full_name: Foitzik, Susanne
last_name: Foitzik
citation:
ama: Konrad M, Pamminger T, Foitzik S. Two pathways ensuring social harmony. Naturwissenschaften.
2012;99(8):627-636. doi:10.1007/s00114-012-0943-z
apa: Konrad, M., Pamminger, T., & Foitzik, S. (2012). Two pathways ensuring
social harmony. Naturwissenschaften. Springer. https://doi.org/10.1007/s00114-012-0943-z
chicago: Konrad, Matthias, Tobias Pamminger, and Susanne Foitzik. “Two Pathways
Ensuring Social Harmony.” Naturwissenschaften. Springer, 2012. https://doi.org/10.1007/s00114-012-0943-z.
ieee: M. Konrad, T. Pamminger, and S. Foitzik, “Two pathways ensuring social harmony,”
Naturwissenschaften, vol. 99, no. 8. Springer, pp. 627–636, 2012.
ista: Konrad M, Pamminger T, Foitzik S. 2012. Two pathways ensuring social harmony.
Naturwissenschaften. 99(8), 627–636.
mla: Konrad, Matthias, et al. “Two Pathways Ensuring Social Harmony.” Naturwissenschaften,
vol. 99, no. 8, Springer, 2012, pp. 627–36, doi:10.1007/s00114-012-0943-z.
short: M. Konrad, T. Pamminger, S. Foitzik, Naturwissenschaften 99 (2012) 627–636.
date_created: 2018-12-11T12:01:34Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2021-01-12T07:41:17Z
day: '01'
department:
- _id: SyCr
doi: 10.1007/s00114-012-0943-z
intvolume: ' 99'
issue: '8'
language:
- iso: eng
month: '08'
oa_version: None
page: 627 - 636
publication: Naturwissenschaften
publication_status: published
publisher: Springer
publist_id: '3565'
quality_controlled: '1'
scopus_import: 1
status: public
title: Two pathways ensuring social harmony
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2012'
...
---
_id: '3161'
abstract:
- lang: eng
text: 'Some inflammatory stimuli trigger activation of the NLRP3 inflammasome by
inducing efflux of cellular potassium. Loss of cellular potassium is known to
potently suppress protein synthesis, leading us to test whether the inhibition
of protein synthesis itself serves as an activating signal for the NLRP3 inflammasome.
Murine bone marrow-derived macrophages, either primed by LPS or unprimed, were
exposed to a panel of inhibitors of ribosomal function: ricin, cycloheximide,
puromycin, pactamycin, and anisomycin. Macrophages were also exposed to nigericin,
ATP, monosodium urate (MSU), and poly I:C. Synthesis of pro-IL-ß and release of
IL-1ß from cells in response to these agents was detected by immunoblotting and
ELISA. Release of intracellular potassium was measured by mass spectrometry. Inhibition
of translation by each of the tested translation inhibitors led to processing
of IL-1ß, which was released from cells. Processing and release of IL-1ß was reduced
or absent from cells deficient in NLRP3, ASC, or caspase-1, demonstrating the
role of the NLRP3 inflammasome. Despite the inability of these inhibitors to trigger
efflux of intracellular potassium, the addition of high extracellular potassium
suppressed activation of the NLRP3 inflammasome. MSU and double-stranded RNA,
which are known to activate the NLRP3 inflammasome, also substantially inhibited
protein translation, supporting a close association between inhibition of translation
and inflammasome activation. These data demonstrate that translational inhibition
itself constitutes a heretofore-unrecognized mechanism underlying IL-1ß dependent
inflammatory signaling and that other physical, chemical, or pathogen-associated
agents that impair translation may lead to IL-1ß-dependent inflammation through
activation of the NLRP3 inflammasome. For agents that inhibit translation through
decreased cellular potassium, the application of high extracellular potassium
restores protein translation and suppresses activation of the NLRP inflammasome.
For agents that inhibit translation through mechanisms that do not involve loss
of potassium, high extracellular potassium suppresses IL-1ß processing through
a mechanism that remains undefined.'
acknowledgement: "Supported by National Institutes of Health grants GM071338 (ML)
and AI059355 (BM).\r\nWe acknowledge the expertise of Dr. Martina Ralle in Department
of Biochemistry and Molecular Biology at OHSU for measurements of potassium using
inductively coupled plasma mass spectrometry."
article_number: e36044
author:
- first_name: Meghan
full_name: Vyleta, Meghan
id: 418901AA-F248-11E8-B48F-1D18A9856A87
last_name: Vyleta
- first_name: John
full_name: Wong, John
last_name: Wong
- first_name: Bruce
full_name: Magun, Bruce
last_name: Magun
citation:
ama: Vyleta M, Wong J, Magun B. Suppression of ribosomal function triggers innate
immune signaling through activation of the NLRP3 inflammasome. PLoS One.
2012;7(5). doi:10.1371/journal.pone.0036044
apa: Vyleta, M., Wong, J., & Magun, B. (2012). Suppression of ribosomal function
triggers innate immune signaling through activation of the NLRP3 inflammasome.
PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0036044
chicago: Vyleta, Meghan, John Wong, and Bruce Magun. “Suppression of Ribosomal Function
Triggers Innate Immune Signaling through Activation of the NLRP3 Inflammasome.”
PLoS One. Public Library of Science, 2012. https://doi.org/10.1371/journal.pone.0036044.
ieee: M. Vyleta, J. Wong, and B. Magun, “Suppression of ribosomal function triggers
innate immune signaling through activation of the NLRP3 inflammasome,” PLoS
One, vol. 7, no. 5. Public Library of Science, 2012.
ista: Vyleta M, Wong J, Magun B. 2012. Suppression of ribosomal function triggers
innate immune signaling through activation of the NLRP3 inflammasome. PLoS One.
7(5), e36044.
mla: Vyleta, Meghan, et al. “Suppression of Ribosomal Function Triggers Innate Immune
Signaling through Activation of the NLRP3 Inflammasome.” PLoS One, vol.
7, no. 5, e36044, Public Library of Science, 2012, doi:10.1371/journal.pone.0036044.
short: M. Vyleta, J. Wong, B. Magun, PLoS One 7 (2012).
date_created: 2018-12-11T12:01:45Z
date_published: 2012-05-14T00:00:00Z
date_updated: 2021-01-12T07:41:29Z
day: '14'
ddc:
- '610'
department:
- _id: SyCr
doi: 10.1371/journal.pone.0036044
file:
- access_level: open_access
checksum: 30cef37e27eaa467f6571b3640282010
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:30Z
date_updated: 2020-07-14T12:46:01Z
file_id: '5082'
file_name: IST-2012-97-v1+1_journal.pone.0036044.pdf
file_size: 2984012
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '05'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '3526'
pubrep_id: '97'
quality_controlled: '1'
scopus_import: 1
status: public
title: Suppression of ribosomal function triggers innate immune signaling through
activation of the NLRP3 inflammasome
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: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2012'
...
---
_id: '3162'
abstract:
- lang: eng
text: Given a dense-time real-valued signal and a parameterized temporal logic formula
with both magnitude and timing parameters, we compute the subset of the parameter
space that renders the formula satisfied by the trace. We provide two preliminary
implementations, one which follows the exact semantics and attempts to compute
the validity domain by quantifier elimination in linear arithmetics and one which
conducts adaptive search in the parameter space.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Eugene
full_name: Asarin, Eugene
last_name: Asarin
- first_name: Alexandre
full_name: Donzé, Alexandre
last_name: Donzé
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
citation:
ama: 'Asarin E, Donzé A, Maler O, Nickovic D. Parametric identification of temporal
properties. In: Vol 7186. Springer; 2012:147-160. doi:10.1007/978-3-642-29860-8_12'
apa: 'Asarin, E., Donzé, A., Maler, O., & Nickovic, D. (2012). Parametric identification
of temporal properties (Vol. 7186, pp. 147–160). Presented at the RV: Runtime
Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-642-29860-8_12'
chicago: Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. “Parametric
Identification of Temporal Properties,” 7186:147–60. Springer, 2012. https://doi.org/10.1007/978-3-642-29860-8_12.
ieee: 'E. Asarin, A. Donzé, O. Maler, and D. Nickovic, “Parametric identification
of temporal properties,” presented at the RV: Runtime Verification, San Francisco,
CA, United States, 2012, vol. 7186, pp. 147–160.'
ista: 'Asarin E, Donzé A, Maler O, Nickovic D. 2012. Parametric identification of
temporal properties. RV: Runtime Verification, LNCS, vol. 7186, 147–160.'
mla: Asarin, Eugene, et al. Parametric Identification of Temporal Properties.
Vol. 7186, Springer, 2012, pp. 147–60, doi:10.1007/978-3-642-29860-8_12.
short: E. Asarin, A. Donzé, O. Maler, D. Nickovic, in:, Springer, 2012, pp. 147–160.
conference:
end_date: 2011-09-30
location: San Francisco, CA, United States
name: 'RV: Runtime Verification'
start_date: 2011-09-27
date_created: 2018-12-11T12:01:45Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:41:29Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-29860-8_12
file:
- access_level: open_access
checksum: ba4a75287008fc64b8fbf78a7476ec32
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T12:50:15Z
date_updated: 2020-07-14T12:46:01Z
file_id: '7862'
file_name: 2012_RV_Asarin.pdf
file_size: 374726
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 7186'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 147 - 160
publication_status: published
publisher: Springer
publist_id: '3525'
quality_controlled: '1'
scopus_import: 1
status: public
title: Parametric identification of temporal properties
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7186
year: '2012'
...
---
_id: '3160'
abstract:
- lang: eng
text: There is a long-running controversy about how early cell fate decisions are
made in the developing mammalian embryo. 1,2 In particular, it is controversial
when the first events that can predict the establishment of the pluripotent and
extra-embryonic lineages in the blastocyst of the pre-implantation embryo occur.
It has long been proposed that the position and polarity of cells at the 16- to
32-cell stage embryo influence their decision to either give rise to the pluripotent
cell lineage that eventually contributes to the inner cell mass (ICM), comprising
the primitive endoderm (PE) and the epiblast (EPI), or the extra-embryonic trophectoderm
(TE) surrounding the blastocoel. The positioning of cells in the embryo at this
developmental stage could largely be the result of random events, making this
a stochastic model of cell lineage allocation. Contrary to such a stochastic model,
some studies have detected putative differences in the lineage potential of individual
blastomeres before compaction, indicating that the first cell fate decisions may
occur as early as at the 4-cell stage. Using a non-invasive, quantitative in vivo
imaging assay to study the kinetic behavior of Oct4 (also known as POU5F1), a
key transcription factor (TF) controlling pre-implantation development in the
mouse embryo, 3-5 a recent study identifies Oct4 kinetics as a predictive measure
of cell lineage patterning in the early mouse embryo. 6 Here, we discuss the implications
of such molecular heterogeneities in early development and offer potential avenues
toward a mechanistic understanding of these observations, contributing to the
resolution of the controversy of developmental cell lineage allocation.
author:
- first_name: Periklis
full_name: Pantazis, Periklis
last_name: Pantazis
- first_name: Tobias
full_name: Bollenbach, Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: Pantazis P, Bollenbach MT. Transcription factor kinetics and the emerging asymmetry
in the early mammalian embryo. Cell Cycle. 2012;11(11):2055-2058. doi:10.4161/cc.20118
apa: Pantazis, P., & Bollenbach, M. T. (2012). Transcription factor kinetics
and the emerging asymmetry in the early mammalian embryo. Cell Cycle. Taylor
and Francis. https://doi.org/10.4161/cc.20118
chicago: Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics
and the Emerging Asymmetry in the Early Mammalian Embryo.” Cell Cycle.
Taylor and Francis, 2012. https://doi.org/10.4161/cc.20118.
ieee: P. Pantazis and M. T. Bollenbach, “Transcription factor kinetics and the emerging
asymmetry in the early mammalian embryo,” Cell Cycle, vol. 11, no. 11.
Taylor and Francis, pp. 2055–2058, 2012.
ista: Pantazis P, Bollenbach MT. 2012. Transcription factor kinetics and the emerging
asymmetry in the early mammalian embryo. Cell Cycle. 11(11), 2055–2058.
mla: Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics
and the Emerging Asymmetry in the Early Mammalian Embryo.” Cell Cycle,
vol. 11, no. 11, Taylor and Francis, 2012, pp. 2055–58, doi:10.4161/cc.20118.
short: P. Pantazis, M.T. Bollenbach, Cell Cycle 11 (2012) 2055–2058.
date_created: 2018-12-11T12:01:44Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T07:41:28Z
day: '01'
department:
- _id: ToBo
doi: 10.4161/cc.20118
intvolume: ' 11'
issue: '11'
language:
- iso: eng
month: '06'
oa_version: None
page: 2055 - 2058
publication: Cell Cycle
publication_status: published
publisher: Taylor and Francis
publist_id: '3531'
quality_controlled: '1'
scopus_import: 1
status: public
title: Transcription factor kinetics and the emerging asymmetry in the early mammalian
embryo
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2012'
...
---
_id: '3164'
abstract:
- lang: eng
text: Overview of the Special Issue on structured prediction and inference.
author:
- first_name: Matthew
full_name: Blaschko, Matthew
last_name: Blaschko
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Blaschko M, Lampert C. Guest editorial: Special issue on structured prediction
and inference. International Journal of Computer Vision. 2012;99(3):257-258.
doi:10.1007/s11263-012-0530-y'
apa: 'Blaschko, M., & Lampert, C. (2012). Guest editorial: Special issue on
structured prediction and inference. International Journal of Computer Vision.
Springer. https://doi.org/10.1007/s11263-012-0530-y'
chicago: 'Blaschko, Matthew, and Christoph Lampert. “Guest Editorial: Special Issue
on Structured Prediction and Inference.” International Journal of Computer
Vision. Springer, 2012. https://doi.org/10.1007/s11263-012-0530-y.'
ieee: 'M. Blaschko and C. Lampert, “Guest editorial: Special issue on structured
prediction and inference,” International Journal of Computer Vision, vol.
99, no. 3. Springer, pp. 257–258, 2012.'
ista: 'Blaschko M, Lampert C. 2012. Guest editorial: Special issue on structured
prediction and inference. International Journal of Computer Vision. 99(3), 257–258.'
mla: 'Blaschko, Matthew, and Christoph Lampert. “Guest Editorial: Special Issue
on Structured Prediction and Inference.” International Journal of Computer
Vision, vol. 99, no. 3, Springer, 2012, pp. 257–58, doi:10.1007/s11263-012-0530-y.'
short: M. Blaschko, C. Lampert, International Journal of Computer Vision 99 (2012)
257–258.
date_created: 2018-12-11T12:01:46Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2021-01-12T07:41:30Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/s11263-012-0530-y
intvolume: ' 99'
issue: '3'
language:
- iso: eng
month: '09'
oa_version: None
page: 257 - 258
publication: International Journal of Computer Vision
publication_status: published
publisher: Springer
publist_id: '3521'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Guest editorial: Special issue on structured prediction and inference'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2012'
...
---
_id: '3166'
abstract:
- lang: eng
text: 'There is evidence that the genetic code was established prior to the existence
of proteins, when metabolism was powered by ribozymes. Also, early proto-organisms
had to rely on simple anaerobic bioenergetic processes. In this work I propose
that amino acid fermentation powered metabolism in the RNA world, and that this
was facilitated by proto-adapters, the precursors of the tRNAs. Amino acids were
used as carbon sources rather than as catalytic or structural elements. In modern
bacteria, amino acid fermentation is known as the Stickland reaction. This pathway
involves two amino acids: the first undergoes oxidative deamination, and the second
acts as an electron acceptor through reductive deamination. This redox reaction
results in two keto acids that are employed to synthesise ATP via substrate-level
phosphorylation. The Stickland reaction is the basic bioenergetic pathway of some
bacteria of the genus Clostridium. Two other facts support Stickland fermentation
in the RNA world. First, several Stickland amino acid pairs are synthesised in
abiotic amino acid synthesis. This suggests that amino acids that could be used
as an energy substrate were freely available. Second, anticodons that have complementary
sequences often correspond to amino acids that form Stickland pairs. The main
hypothesis of this paper is that pairs of complementary proto-adapters were assigned
to Stickland amino acids pairs. There are signatures of this hypothesis in the
genetic code. Furthermore, it is argued that the proto-adapters formed double
strands that brought amino acid pairs into proximity to facilitate their mutual
redox reaction, structurally constraining the anticodon pairs that are assigned
to these amino acid pairs. Significance tests which randomise the code are performed
to study the extent of the variability of the energetic (ATP) yield. Random assignments
can lead to a substantial yield of ATP and maintain enough variability, thus selection
can act and refine the assignments into a proto-code that optimises the energetic
yield. Monte Carlo simulations are performed to evaluate the establishment of
these simple proto-codes, based on amino acid substitutions and codon swapping.
In all cases, donor amino acids are assigned to anticodons composed of U+G, and
have low redundancy (1-2 codons), whereas acceptor amino acids are assigned to
the the remaining codons. These bioenergetic and structural constraints allow
for a metabolic role for amino acids before their co-option as catalyst cofactors.
Reviewers: this article was reviewed by Prof. William Martin, Prof. Eors Szathmary
(nominated by Dr. Gaspar Jekely) and Dr. Adam Kun (nominated by Dr. Sandor Pongor)'
acknowledgement: 'The author was supported by the ERC-2009-AdG Grant for project 250152
SELECTIONINFORMATION. '
article_number: '6'
author:
- first_name: Harold
full_name: Vladar, Harold
id: 2A181218-F248-11E8-B48F-1D18A9856A87
last_name: Vladar
orcid: 0000-0002-5985-7653
citation:
ama: de Vladar H. Amino acid fermentation at the origin of the genetic code. Biology
Direct. 2012;7. doi:10.1186/1745-6150-7-6
apa: de Vladar, H. (2012). Amino acid fermentation at the origin of the genetic
code. Biology Direct. BioMed Central. https://doi.org/10.1186/1745-6150-7-6
chicago: Vladar, Harold de. “Amino Acid Fermentation at the Origin of the Genetic
Code.” Biology Direct. BioMed Central, 2012. https://doi.org/10.1186/1745-6150-7-6.
ieee: H. de Vladar, “Amino acid fermentation at the origin of the genetic code,”
Biology Direct, vol. 7. BioMed Central, 2012.
ista: de Vladar H. 2012. Amino acid fermentation at the origin of the genetic code.
Biology Direct. 7, 6.
mla: de Vladar, Harold. “Amino Acid Fermentation at the Origin of the Genetic Code.”
Biology Direct, vol. 7, 6, BioMed Central, 2012, doi:10.1186/1745-6150-7-6.
short: H. de Vladar, Biology Direct 7 (2012).
date_created: 2018-12-11T12:01:46Z
date_published: 2012-02-10T00:00:00Z
date_updated: 2021-01-12T07:41:31Z
day: '10'
ddc:
- '570'
- '576'
department:
- _id: NiBa
doi: 10.1186/1745-6150-7-6
ec_funded: 1
file:
- access_level: open_access
checksum: e511e401e239ef608a7fd79b21a06d78
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:44Z
date_updated: 2020-07-14T12:46:02Z
file_id: '5166'
file_name: IST-2012-99-v1+1_1745-6150-7-6.pdf
file_size: 4099536
relation: main_file
file_date_updated: 2020-07-14T12:46:02Z
has_accepted_license: '1'
intvolume: ' 7'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Biology Direct
publication_status: published
publisher: BioMed Central
publist_id: '3518'
pubrep_id: '99'
quality_controlled: '1'
status: public
title: Amino acid fermentation at the origin of the genetic code
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: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2012'
...
---
_id: '3167'
article_type: letter_note
author:
- first_name: Michele
full_name: Weber, Michele
id: 3A3FC708-F248-11E8-B48F-1D18A9856A87
last_name: Weber
citation:
ama: Weber M. NextGen speaks 13 . Science. 2012;336(6077):32-34. doi:10.1126/science.336.6077.32
apa: Weber, M. (2012). NextGen speaks 13 . Science. American Association
for the Advancement of Science. https://doi.org/10.1126/science.336.6077.32
chicago: Weber, Michele. “NextGen Speaks 13 .” Science. American Association
for the Advancement of Science, 2012. https://doi.org/10.1126/science.336.6077.32.
ieee: M. Weber, “NextGen speaks 13 ,” Science, vol. 336, no. 6077. American
Association for the Advancement of Science, pp. 32–34, 2012.
ista: Weber M. 2012. NextGen speaks 13 . Science. 336(6077), 32–34.
mla: Weber, Michele. “NextGen Speaks 13 .” Science, vol. 336, no. 6077, American
Association for the Advancement of Science, 2012, pp. 32–34, doi:10.1126/science.336.6077.32.
short: M. Weber, Science 336 (2012) 32–34.
date_created: 2018-12-11T12:01:47Z
date_published: 2012-04-06T00:00:00Z
date_updated: 2021-01-12T07:41:32Z
day: '06'
department:
- _id: MiSi
doi: 10.1126/science.336.6077.32
external_id:
pmid:
- '22491839'
intvolume: ' 336'
issue: '6077'
language:
- iso: eng
month: '04'
oa_version: None
page: 32-34
pmid: 1
popular_science: '1'
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '3516'
status: public
title: 'NextGen speaks 13 '
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 336
year: '2012'
...
---
_id: '3241'
abstract:
- lang: eng
text: 'We prove a negative result concerning error reduction by parallel repetition
for computationally sound protocols, e.g., interactive arguments. Our main result
is a complete and computationally sound eight round interactive argument for which
k-fold parallel repetition does not reduce the error below a constant for any
polynomial k. The starting point for our construction is the work of Bellare,
Impagliazzo and Naor (FOCS''97). For any fixed k, they construct a four round
protocol for which k-fold parallel repetition does not lower the soundness error.
The communication complexity of this protocol is linear in k. By using universal
arguments due to Barak and Goldreich (CCC 2002), we turn this protocol into an
eight-round protocol whose complexity is basically independent of k. '
author:
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Douglas
full_name: Wikström, Douglas
last_name: Wikström
citation:
ama: Pietrzak KZ, Wikström D. Parallel repetition of computationally sound protocols
revisited. Journal of Cryptology. 2012;25(1):116-135. doi:10.1007/s00145-010-9090-x
apa: Pietrzak, K. Z., & Wikström, D. (2012). Parallel repetition of computationally
sound protocols revisited. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-010-9090-x
chicago: Pietrzak, Krzysztof Z, and Douglas Wikström. “Parallel Repetition of Computationally
Sound Protocols Revisited.” Journal of Cryptology. Springer, 2012. https://doi.org/10.1007/s00145-010-9090-x.
ieee: K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound
protocols revisited,” Journal of Cryptology, vol. 25, no. 1. Springer,
pp. 116–135, 2012.
ista: Pietrzak KZ, Wikström D. 2012. Parallel repetition of computationally sound
protocols revisited. Journal of Cryptology. 25(1), 116–135.
mla: Pietrzak, Krzysztof Z., and Douglas Wikström. “Parallel Repetition of Computationally
Sound Protocols Revisited.” Journal of Cryptology, vol. 25, no. 1, Springer,
2012, pp. 116–35, doi:10.1007/s00145-010-9090-x.
short: K.Z. Pietrzak, D. Wikström, Journal of Cryptology 25 (2012) 116–135.
date_created: 2018-12-11T12:02:12Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T07:42:03Z
day: '01'
doi: 10.1007/s00145-010-9090-x
extern: 1
intvolume: ' 25'
issue: '1'
month: '11'
page: 116 - 135
publication: Journal of Cryptology
publication_status: published
publisher: Springer
publist_id: '3439'
quality_controlled: 0
status: public
title: Parallel repetition of computationally sound protocols revisited
type: journal_article
volume: 25
year: '2012'
...
---
_id: '3252'
abstract:
- lang: eng
text: 'We study the automatic synthesis of fair non-repudiation protocols, a class
of fair exchange protocols, used for digital contract signing. First, we show
how to specify the objectives of the participating agents, the trusted third party
(TTP) and the protocols as path formulas in Linear Temporal Logic (LTL) and prove
that the satisfaction of the objectives of the agents and the TTP imply satisfaction
of the protocol objectives. We then show that weak (co-operative) co-synthesis
and classical (strictly competitive) co-synthesis fail in synthesizing these protocols,
whereas assume-guarantee synthesis (AGS) succeeds. We demonstrate the success
of assume-guarantee synthesis as follows: (a) any solution of assume-guarantee
synthesis is attack-free; no subset of participants can violate the objectives
of the other participants without violating their own objectives; (b) the Asokan-Shoup-Waidner
(ASW) certified mail protocol that has known vulnerabilities is not a solution
of AGS; and (c) the Kremer-Markowitch (KM) non-repudiation protocol is a solution
of AGS. To our knowledge this is the first application of synthesis to fair non-repudiation
protocols, and our results show how synthesis can generate correct protocols and
automatically discover vulnerabilities. The solution to assume-guarantee synthesis
can be computed efficiently as the secure equilibrium solution of three-player
graph games. © 2012 Springer-Verlag.'
acknowledgement: "The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23 (Modern Graph Algorithmic Techniques in Formal Verification), FWF
NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award.\r\nThe authors would like to thank Avik Chaudhuri for his
invaluable help and feedback."
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Vishwanath
full_name: Raman, Vishwanath
last_name: Raman
citation:
ama: 'Chatterjee K, Raman V. Synthesizing protocols for digital contract signing.
In: Vol 7148. Springer; 2012:152-168. doi:10.1007/978-3-642-27940-9_11'
apa: 'Chatterjee, K., & Raman, V. (2012). Synthesizing protocols for digital
contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification,
Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_11'
chicago: Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for
Digital Contract Signing,” 7148:152–68. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_11.
ieee: 'K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract
signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation,
Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.'
ista: 'Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract
signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS,
vol. 7148, 152–168.'
mla: Chatterjee, Krishnendu, and Vishwanath Raman. Synthesizing Protocols for
Digital Contract Signing. Vol. 7148, Springer, 2012, pp. 152–68, doi:10.1007/978-3-642-27940-9_11.
short: K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.
conference:
end_date: 2012-01-24
location: Philadelphia, PA, USA
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2012-01-22
date_created: 2018-12-11T12:02:16Z
date_published: 2012-01-20T00:00:00Z
date_updated: 2021-01-12T07:42:08Z
day: '20'
department:
- _id: KrCh
doi: 10.1007/978-3-642-27940-9_11
ec_funded: 1
intvolume: ' 7148'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1004.2697
month: '01'
oa: 1
oa_version: Preprint
page: 152 - 168
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '3405'
quality_controlled: '1'
scopus_import: 1
status: public
title: Synthesizing protocols for digital contract signing
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7148
year: '2012'
...
---
_id: '3255'
abstract:
- lang: eng
text: In this paper we survey results of two-player games on graphs and Markov decision
processes with parity, mean-payoff and energy objectives, and the combination
of mean-payoff and energy objectives with parity objectives. These problems have
applications in verification and synthesis of reactive systems in resource-constrained
environments.
acknowledgement: This work was partially supported by FWF NFN Grant S11407-N23 (RiSE)
and a Microsoft faculty fellowship.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Games and Markov decision processes with mean payoff
parity and energy parity objectives. In: Vol 7119. Springer; 2012:37-46. doi:10.1007/978-3-642-25929-6_3'
apa: 'Chatterjee, K., & Doyen, L. (2012). Games and Markov decision processes
with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented
at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice,
Czech Republic: Springer. https://doi.org/10.1007/978-3-642-25929-6_3'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes
with Mean Payoff Parity and Energy Parity Objectives,” 7119:37–46. Springer, 2012.
https://doi.org/10.1007/978-3-642-25929-6_3.
ieee: 'K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean
payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical
and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol.
7119, pp. 37–46.'
ista: 'Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean
payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering
Methods in Computer Science, LNCS, vol. 7119, 37–46.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Games and Markov Decision Processes
with Mean Payoff Parity and Energy Parity Objectives. Vol. 7119, Springer,
2012, pp. 37–46, doi:10.1007/978-3-642-25929-6_3.
short: K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.
conference:
end_date: 2011-10-16
location: Lednice, Czech Republic
name: 'MEMICS: Mathematical and Engineering Methods in Computer Science'
start_date: 2011-10-14
date_created: 2018-12-11T12:02:17Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:10Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-642-25929-6_3
file:
- access_level: open_access
checksum: eed2cc1e76b160418c977e76e8899a60
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T12:53:12Z
date_updated: 2020-07-14T12:46:05Z
file_id: '7863'
file_name: 2012_MEMICS_Chatterjee.pdf
file_size: 114060
relation: main_file
file_date_updated: 2020-07-14T12:46:05Z
has_accepted_license: '1'
intvolume: ' 7119'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 37 - 46
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '3400'
quality_controlled: '1'
scopus_import: 1
status: public
title: Games and Markov decision processes with mean payoff parity and energy parity
objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7119
year: '2012'
...
---
_id: '3250'
abstract:
- lang: eng
text: The Learning Parity with Noise (LPN) problem has recently found many applications
in cryptography as the hardness assumption underlying the constructions of "provably
secure" cryptographic schemes like encryption or authentication protocols.
Being provably secure means that the scheme comes with a proof showing that the
existence of an efficient adversary against the scheme implies that the underlying
hardness assumption is wrong. LPN based schemes are appealing for theoretical
and practical reasons. On the theoretical side, LPN based schemes offer a very
strong security guarantee. The LPN problem is equivalent to the problem of decoding
random linear codes, a problem that has been extensively studied in the last half
century. The fastest known algorithms run in exponential time and unlike most
number-theoretic problems used in cryptography, the LPN problem does not succumb
to known quantum algorithms. On the practical side, LPN based schemes are often
extremely simple and efficient in terms of code-size as well as time and space
requirements. This makes them prime candidates for light-weight devices like RFID
tags, which are too weak to implement standard cryptographic primitives like the
AES block-cipher. This talk will be a gentle introduction to provable security
using simple LPN based schemes as examples. Starting from pseudorandom generators
and symmetric key encryption, over secret-key authentication protocols, and, if
time admits, touching on recent constructions of public-key identification, commitments
and zero-knowledge proofs.
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Cryptography from learning parity with noise. In: Vol 7147. Springer;
2012:99-114. doi:10.1007/978-3-642-27660-6_9'
apa: 'Pietrzak, K. Z. (2012). Cryptography from learning parity with noise (Vol.
7147, pp. 99–114). Presented at the SOFSEM: Current Trends in Theory and Practice
of Computer Science, Špindlerův Mlýn, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-27660-6_9'
chicago: Pietrzak, Krzysztof Z. “Cryptography from Learning Parity with Noise,”
7147:99–114. Springer, 2012. https://doi.org/10.1007/978-3-642-27660-6_9.
ieee: 'K. Z. Pietrzak, “Cryptography from learning parity with noise,” presented
at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Špindlerův
Mlýn, Czech Republic, 2012, vol. 7147, pp. 99–114.'
ista: 'Pietrzak KZ. 2012. Cryptography from learning parity with noise. SOFSEM:
Current Trends in Theory and Practice of Computer Science, LNCS, vol. 7147, 99–114.'
mla: Pietrzak, Krzysztof Z. Cryptography from Learning Parity with Noise.
Vol. 7147, Springer, 2012, pp. 99–114, doi:10.1007/978-3-642-27660-6_9.
short: K.Z. Pietrzak, in:, Springer, 2012, pp. 99–114.
conference:
end_date: 2012-01-27
location: Špindlerův Mlýn, Czech Republic
name: 'SOFSEM: Current Trends in Theory and Practice of Computer Science'
start_date: 2012-01-21
date_created: 2018-12-11T12:02:15Z
date_published: 2012-02-19T00:00:00Z
date_updated: 2021-01-12T07:42:07Z
day: '19'
department:
- _id: KrPi
doi: 10.1007/978-3-642-27660-6_9
intvolume: ' 7147'
language:
- iso: eng
month: '02'
oa_version: None
page: 99 - 114
publication_status: published
publisher: Springer
publist_id: '3407'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cryptography from learning parity with noise
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7147
year: '2012'
...
---
_id: '3256'
abstract:
- lang: eng
text: We use a distortion to define the dual complex of a cubical subdivision of
ℝ n as an n-dimensional subcomplex of the nerve of the set of n-cubes. Motivated
by the topological analysis of high-dimensional digital image data, we consider
such subdivisions defined by generalizations of quad- and oct-trees to n dimensions.
Assuming the subdivision is balanced, we show that mapping each vertex to the
center of the corresponding n-cube gives a geometric realization of the dual complex
in ℝ n.
acknowledgement: This research is partially supported by the Defense Advanced Research
Projects Agency (DARPA) under grants HR0011-05-1-0057 and HR0011-09-0065 as well
as the National Science Foundation (NSF) under grant DBI-0820624.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
citation:
ama: Edelsbrunner H, Kerber M. Dual complexes of cubical subdivisions of ℝn. Discrete
& Computational Geometry. 2012;47(2):393-414. doi:10.1007/s00454-011-9382-4
apa: Edelsbrunner, H., & Kerber, M. (2012). Dual complexes of cubical subdivisions
of ℝn. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-011-9382-4
chicago: Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions
of ℝn.” Discrete & Computational Geometry. Springer, 2012. https://doi.org/10.1007/s00454-011-9382-4.
ieee: H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of
ℝn,” Discrete & Computational Geometry, vol. 47, no. 2. Springer, pp.
393–414, 2012.
ista: Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of
ℝn. Discrete & Computational Geometry. 47(2), 393–414.
mla: Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions
of ℝn.” Discrete & Computational Geometry, vol. 47, no. 2, Springer,
2012, pp. 393–414, doi:10.1007/s00454-011-9382-4.
short: H. Edelsbrunner, M. Kerber, Discrete & Computational Geometry 47 (2012)
393–414.
date_created: 2018-12-11T12:02:17Z
date_published: 2012-03-01T00:00:00Z
date_updated: 2021-01-12T07:42:10Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s00454-011-9382-4
file:
- access_level: open_access
checksum: 76486f3b2c9e7fd81342f3832ca387e7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:15Z
date_updated: 2020-07-14T12:46:05Z
file_id: '4675'
file_name: IST-2016-543-v1+1_2012-J-08-HierarchyCubeComplex.pdf
file_size: 203636
relation: main_file
file_date_updated: 2020-07-14T12:46:05Z
has_accepted_license: '1'
intvolume: ' 47'
issue: '2'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 393 - 414
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '3398'
pubrep_id: '543'
quality_controlled: '1'
scopus_import: 1
status: public
title: Dual complexes of cubical subdivisions of ℝn
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2012'
...
---
_id: '3254'
abstract:
- lang: eng
text: 'The theory of graph games with ω-regular winning conditions is the foundation
for modeling and synthesizing reactive processes. In the case of stochastic reactive
processes, the corresponding stochastic graph games have three players, two of
them (System and Environment) behaving adversarially, and the third (Uncertainty)
behaving probabilistically. We consider two problems for stochastic graph games:
the qualitative problem asks for the set of states from which a player can win
with probability 1 (almost-sure winning); and the quantitative problem asks for
the maximal probability of winning (optimal winning) from each state. We consider
ω-regular winning conditions formalized as Müller winning conditions. We present
optimal memory bounds for pure (deterministic) almost-sure winning and optimal
winning strategies in stochastic graph games with Müller winning conditions. We
also study the complexity of stochastic Müller games and show that both the qualitative
and quantitative analysis problems are PSPACE-complete. Our results are relevant
in synthesis of stochastic reactive processes.'
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph
Games), and Microsoft faculty fellows award.'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Chatterjee K. The complexity of stochastic Müller games. Information and
Computation. 2012;211:29-48. doi:10.1016/j.ic.2011.11.004
apa: Chatterjee, K. (2012). The complexity of stochastic Müller games. Information
and Computation. Elsevier. https://doi.org/10.1016/j.ic.2011.11.004
chicago: Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information
and Computation. Elsevier, 2012. https://doi.org/10.1016/j.ic.2011.11.004.
ieee: K. Chatterjee, “The complexity of stochastic Müller games,” Information
and Computation, vol. 211. Elsevier, pp. 29–48, 2012.
ista: Chatterjee K. 2012. The complexity of stochastic Müller games. Information
and Computation. 211, 29–48.
mla: Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information
and Computation, vol. 211, Elsevier, 2012, pp. 29–48, doi:10.1016/j.ic.2011.11.004.
short: K. Chatterjee, Information and Computation 211 (2012) 29–48.
date_created: 2018-12-11T12:02:17Z
date_published: 2012-02-01T00:00:00Z
date_updated: 2021-01-12T07:42:09Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.ic.2011.11.004
ec_funded: 1
intvolume: ' 211'
language:
- iso: eng
main_file_link:
- url: http://arise.or.at/pubpdf/The_complexity_of_stochastic_M___u_ller_games.pdf
month: '02'
oa_version: None
page: 29 - 48
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '3403'
quality_controlled: '1'
scopus_import: 1
status: public
title: The complexity of stochastic Müller games
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 211
year: '2012'
...
---
_id: '3253'
abstract:
- lang: eng
text: We describe a framework for reasoning about programs with lists carrying integer
numerical data. We use abstract domains to describe and manipulate complex constraints
on configurations of these programs mixing constraints on the shape of the heap,
sizes of the lists, on the multisets of data stored in these lists, and on the
data at their different positions. Moreover, we provide powerful techniques for
automatic validation of Hoare-triples and invariant checking, as well as for automatic
synthesis of invariants and procedure summaries using modular inter-procedural
analysis. The approach has been implemented in a tool called Celia and experimented
successfully on a large benchmark of programs.
acknowledgement: This work was partly supported by the French National Research Agency
(ANR) project Veridyc (ANR-09-SEGI-016).
alternative_title:
- LNCS
author:
- first_name: Ahmed
full_name: Bouajjani, Ahmed
last_name: Bouajjani
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- first_name: Constantin
full_name: Enea, Constantin
last_name: Enea
- first_name: Mihaela
full_name: Sighireanu, Mihaela
last_name: Sighireanu
citation:
ama: 'Bouajjani A, Dragoi C, Enea C, Sighireanu M. Abstract domains for automated
reasoning about list manipulating programs with infinite data. In: Vol 7148. Springer;
2012:1-22. doi:10.1007/978-3-642-27940-9_1'
apa: 'Bouajjani, A., Dragoi, C., Enea, C., & Sighireanu, M. (2012). Abstract
domains for automated reasoning about list manipulating programs with infinite
data (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking
and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_1'
chicago: Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu.
“Abstract Domains for Automated Reasoning about List Manipulating Programs with
Infinite Data,” 7148:1–22. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_1.
ieee: 'A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Abstract domains for
automated reasoning about list manipulating programs with infinite data,” presented
at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia,
PA, USA, 2012, vol. 7148, pp. 1–22.'
ista: 'Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Abstract domains for automated
reasoning about list manipulating programs with infinite data. VMCAI: Verification,
Model Checking and Abstract Interpretation, LNCS, vol. 7148, 1–22.'
mla: Bouajjani, Ahmed, et al. Abstract Domains for Automated Reasoning about
List Manipulating Programs with Infinite Data. Vol. 7148, Springer, 2012,
pp. 1–22, doi:10.1007/978-3-642-27940-9_1.
short: A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2012, pp.
1–22.
conference:
end_date: 2012-01-24
location: Philadelphia, PA, USA
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2012-01-22
date_created: 2018-12-11T12:02:17Z
date_published: 2012-02-26T00:00:00Z
date_updated: 2021-01-12T07:42:09Z
day: '26'
department:
- _id: ToHe
doi: 10.1007/978-3-642-27940-9_1
intvolume: ' 7148'
language:
- iso: eng
month: '02'
oa_version: None
page: 1 - 22
publication_status: published
publisher: Springer
publist_id: '3404'
quality_controlled: '1'
status: public
title: Abstract domains for automated reasoning about list manipulating programs with
infinite data
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7148
year: '2012'
...
---
_id: '3265'
abstract:
- lang: eng
text: We propose a mid-level statistical model for image segmentation that composes
multiple figure-ground hypotheses (FG) obtained by applying constraints at different
locations and scales, into larger interpretations (tilings) of the entire image.
Inference is cast as optimization over sets of maximal cliques sampled from a
graph connecting all non-overlapping figure-ground segment hypotheses. Potential
functions over cliques combine unary, Gestalt-based figure qualities, and pairwise
compatibilities among spatially neighboring segments, constrained by T-junctions
and the boundary interface statistics of real scenes. Learning the model parameters
is based on maximum likelihood, alternating between sampling image tilings and
optimizing their potential function parameters. State of the art results are reported
on the Berkeley and Stanford segmentation datasets, as well as VOC2009, where
a 28% improvement was achieved.
article_number: '6126486'
author:
- first_name: Adrian
full_name: Ion, Adrian
id: 29F89302-F248-11E8-B48F-1D18A9856A87
last_name: Ion
- first_name: Joao
full_name: Carreira, Joao
last_name: Carreira
- first_name: Cristian
full_name: Sminchisescu, Cristian
last_name: Sminchisescu
citation:
ama: 'Ion A, Carreira J, Sminchisescu C. Image segmentation by figure-ground composition
into maximal cliques. In: IEEE; 2012. doi:10.1109/ICCV.2011.6126486'
apa: 'Ion, A., Carreira, J., & Sminchisescu, C. (2012). Image segmentation by
figure-ground composition into maximal cliques. Presented at the ICCV: International
Conference on Computer Vision, Barcelona, Spain: IEEE. https://doi.org/10.1109/ICCV.2011.6126486'
chicago: Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Image Segmentation
by Figure-Ground Composition into Maximal Cliques.” IEEE, 2012. https://doi.org/10.1109/ICCV.2011.6126486.
ieee: 'A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground
composition into maximal cliques,” presented at the ICCV: International Conference
on Computer Vision, Barcelona, Spain, 2012.'
ista: 'Ion A, Carreira J, Sminchisescu C. 2012. Image segmentation by figure-ground
composition into maximal cliques. ICCV: International Conference on Computer Vision,
6126486.'
mla: Ion, Adrian, et al. Image Segmentation by Figure-Ground Composition into
Maximal Cliques. 6126486, IEEE, 2012, doi:10.1109/ICCV.2011.6126486.
short: A. Ion, J. Carreira, C. Sminchisescu, in:, IEEE, 2012.
conference:
end_date: 2011-11-13
location: Barcelona, Spain
name: 'ICCV: International Conference on Computer Vision'
start_date: 2011-11-06
date_created: 2018-12-11T12:02:21Z
date_published: 2012-01-12T00:00:00Z
date_updated: 2021-01-12T07:42:15Z
day: '12'
department:
- _id: HeEd
doi: 10.1109/ICCV.2011.6126486
language:
- iso: eng
month: '01'
oa_version: None
publication_status: published
publisher: IEEE
publist_id: '3382'
quality_controlled: '1'
status: public
title: Image segmentation by figure-ground composition into maximal cliques
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '3282'
abstract:
- lang: eng
text: 'Traditionally, symmetric-key message authentication codes (MACs) are easily
built from pseudorandom functions (PRFs). In this work we propose a wide variety
of other approaches to building efficient MACs, without going through a PRF first.
In particular, unlike deterministic PRF-based MACs, where each message has a unique
valid tag, we give a number of probabilistic MAC constructions from various other
primitives/assumptions. Our main results are summarized as follows: We show several
new probabilistic MAC constructions from a variety of general assumptions, including
CCA-secure encryption, Hash Proof Systems and key-homomorphic weak PRFs. By instantiating
these frameworks under concrete number theoretic assumptions, we get several schemes
which are more efficient than just using a state-of-the-art PRF instantiation
under the corresponding assumption. For probabilistic MACs, unlike deterministic
ones, unforgeability against a chosen message attack (uf-cma ) alone does not
imply security if the adversary can additionally make verification queries (uf-cmva
). We give an efficient generic transformation from any uf-cma secure MAC which
is "message-hiding" into a uf-cmva secure MAC. This resolves the main
open problem of Kiltz et al. from Eurocrypt''11; By using our transformation on
their constructions, we get the first efficient MACs from the LPN assumption.
While all our new MAC constructions immediately give efficient actively secure,
two-round symmetric-key identification schemes, we also show a very simple, three-round
actively secure identification protocol from any weak PRF. In particular, the
resulting protocol is much more efficient than the trivial approach of building
a regular PRF from a weak PRF. © 2012 International Association for Cryptologic
Research.'
acknowledgement: Supported by the European Research Council under the European Union’s
Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)
alternative_title:
- LNCS
author:
- first_name: Yevgeniy
full_name: Dodis, Yevgeniy
last_name: Dodis
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. Message authentication, revisited.
In: Vol 7237. Springer; 2012:355-374. doi:10.1007/978-3-642-29011-4_22'
apa: 'Dodis, Y., Pietrzak, K. Z., Kiltz, E., & Wichs, D. (2012). Message authentication,
revisited (Vol. 7237, pp. 355–374). Presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, Cambridge, UK: Springer. https://doi.org/10.1007/978-3-642-29011-4_22'
chicago: Dodis, Yevgeniy, Krzysztof Z Pietrzak, Eike Kiltz, and Daniel Wichs. “Message
Authentication, Revisited,” 7237:355–74. Springer, 2012. https://doi.org/10.1007/978-3-642-29011-4_22.
ieee: 'Y. Dodis, K. Z. Pietrzak, E. Kiltz, and D. Wichs, “Message authentication,
revisited,” presented at the EUROCRYPT: Theory and Applications of Cryptographic
Techniques, Cambridge, UK, 2012, vol. 7237, pp. 355–374.'
ista: 'Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. 2012. Message authentication, revisited.
EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 7237,
355–374.'
mla: Dodis, Yevgeniy, et al. Message Authentication, Revisited. Vol. 7237,
Springer, 2012, pp. 355–74, doi:10.1007/978-3-642-29011-4_22.
short: Y. Dodis, K.Z. Pietrzak, E. Kiltz, D. Wichs, in:, Springer, 2012, pp. 355–374.
conference:
end_date: 2012-04-19
location: Cambridge, UK
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2012-04-15
date_created: 2018-12-11T12:02:27Z
date_published: 2012-03-10T00:00:00Z
date_updated: 2021-01-12T07:42:22Z
day: '10'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-642-29011-4_22
ec_funded: 1
file:
- access_level: open_access
checksum: 8557c17a8c2586d06ebfe62d934f5c5f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:23Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5074'
file_name: IST-2016-686-v1+1_059.pdf
file_size: 372292
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 7237'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 355 - 374
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '3364'
pubrep_id: '686'
quality_controlled: '1'
status: public
title: Message authentication, revisited
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7237
year: '2012'
...
---
_id: '3280'
abstract:
- lang: eng
text: 'The (decisional) learning with errors problem (LWE) asks to distinguish "noisy"
inner products of a secret vector with random vectors from uniform. The learning
parities with noise problem (LPN) is the special case where the elements of the
vectors are bits. In recent years, the LWE and LPN problems have found many applications
in cryptography. In this paper we introduce a (seemingly) much stronger adaptive
assumption, called "subspace LWE" (SLWE), where the adversary can learn
the inner product of the secret and random vectors after they were projected into
an adaptively and adversarially chosen subspace. We prove that, surprisingly,
the SLWE problem mapping into subspaces of dimension d is almost as hard as LWE
using secrets of length d (the other direction is trivial.) This result immediately
implies that several existing cryptosystems whose security is based on the hardness
of the LWE/LPN problems are provably secure in a much stronger sense than anticipated.
As an illustrative example we show that the standard way of using LPN for symmetric
CPA secure encryption is even secure against a very powerful class of related
key attacks. '
acknowledgement: Supported by the European Research Council under the European Union’s
Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC).
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Subspace LWE. In: Vol 7194. Springer; 2012:548-563. doi:10.1007/978-3-642-28914-9_31'
apa: 'Pietrzak, K. Z. (2012). Subspace LWE (Vol. 7194, pp. 548–563). Presented at
the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer.
https://doi.org/10.1007/978-3-642-28914-9_31'
chicago: Pietrzak, Krzysztof Z. “Subspace LWE,” 7194:548–63. Springer, 2012. https://doi.org/10.1007/978-3-642-28914-9_31.
ieee: 'K. Z. Pietrzak, “Subspace LWE,” presented at the TCC: Theory of Cryptography
Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 548–563.'
ista: 'Pietrzak KZ. 2012. Subspace LWE. TCC: Theory of Cryptography Conference,
LNCS, vol. 7194, 548–563.'
mla: Pietrzak, Krzysztof Z. Subspace LWE. Vol. 7194, Springer, 2012, pp.
548–63, doi:10.1007/978-3-642-28914-9_31.
short: K.Z. Pietrzak, in:, Springer, 2012, pp. 548–563.
conference:
end_date: 2012-03-21
location: Taormina, Sicily, Italy
name: 'TCC: Theory of Cryptography Conference'
start_date: 2012-03-19
date_created: 2018-12-11T12:02:26Z
date_published: 2012-05-04T00:00:00Z
date_updated: 2021-01-12T07:42:21Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-642-28914-9_31
ec_funded: 1
intvolume: ' 7194'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.iacr.org/archive/tcc2012/71940166/71940166.pdf
month: '05'
oa: 1
oa_version: Submitted Version
page: 548 - 563
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '3366'
quality_controlled: '1'
status: public
title: Subspace LWE
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7194
year: '2012'
...
---
_id: '3281'
abstract:
- lang: eng
text: 'We consider the problem of amplifying the "lossiness" of functions.
We say that an oracle circuit C*: {0,1} m → {0,1}* amplifies relative lossiness
from ℓ/n to L/m if for every function f:{0,1} n → {0,1} n it holds that 1 If f
is injective then so is C f. 2 If f has image size of at most 2 n-ℓ, then C f
has image size at most 2 m-L. The question is whether such C* exists for L/m ≫
ℓ/n. This problem arises naturally in the context of cryptographic "lossy
functions," where the relative lossiness is the key parameter. We show that
for every circuit C* that makes at most t queries to f, the relative lossiness
of C f is at most L/m ≤ ℓ/n + O(log t)/n. In particular, no black-box method making
a polynomial t = poly(n) number of queries can amplify relative lossiness by more
than an O(logn)/n additive term. We show that this is tight by giving a simple
construction (cascading with some randomization) that achieves such amplification.'
acknowledgement: "We would like to thank Oded Goldreich and Omer Rein- gold for discussions
at an early stage of this project, and Scott Aaronson for clarifications regarding
the collision problem.\r\n"
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Alon
full_name: Rosen, Alon
last_name: Rosen
- first_name: Gil
full_name: Segev, Gil
last_name: Segev
citation:
ama: 'Pietrzak KZ, Rosen A, Segev G. Lossy functions do not amplify well. In: Vol
7194. Springer; 2012:458-475. doi:10.1007/978-3-642-28914-9_26'
apa: 'Pietrzak, K. Z., Rosen, A., & Segev, G. (2012). Lossy functions do not
amplify well (Vol. 7194, pp. 458–475). Presented at the TCC: Theory of Cryptography
Conference, Taormina, Sicily, Italy: Springer. https://doi.org/10.1007/978-3-642-28914-9_26'
chicago: Pietrzak, Krzysztof Z, Alon Rosen, and Gil Segev. “Lossy Functions Do Not
Amplify Well,” 7194:458–75. Springer, 2012. https://doi.org/10.1007/978-3-642-28914-9_26.
ieee: 'K. Z. Pietrzak, A. Rosen, and G. Segev, “Lossy functions do not amplify well,”
presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy,
2012, vol. 7194, pp. 458–475.'
ista: 'Pietrzak KZ, Rosen A, Segev G. 2012. Lossy functions do not amplify well.
TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 458–475.'
mla: Pietrzak, Krzysztof Z., et al. Lossy Functions Do Not Amplify Well.
Vol. 7194, Springer, 2012, pp. 458–75, doi:10.1007/978-3-642-28914-9_26.
short: K.Z. Pietrzak, A. Rosen, G. Segev, in:, Springer, 2012, pp. 458–475.
conference:
end_date: 2012-03-21
location: Taormina, Sicily, Italy
name: 'TCC: Theory of Cryptography Conference'
start_date: 2012-03-19
date_created: 2018-12-11T12:02:26Z
date_published: 2012-05-04T00:00:00Z
date_updated: 2021-01-12T07:42:22Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-642-28914-9_26
intvolume: ' 7194'
language:
- iso: eng
main_file_link:
- url: http://www.iacr.org/archive/tcc2012/tcc2012-index.html
month: '05'
oa_version: None
page: 458 - 475
publication_status: published
publisher: Springer
publist_id: '3365'
quality_controlled: '1'
status: public
title: Lossy functions do not amplify well
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7194
year: '2012'
...
---
_id: '3284'
abstract:
- lang: eng
text: |-
We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a constraint language, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimise the sum. Under the unique games conjecture, the approximability of finite-valued VCSPs is well-understood, see Raghavendra [FOCS’08]. However, there is no characterisation of finite-valued VCSPs, let alone general-valued VCSPs, that can be solved exactly in polynomial time, thus giving insights from a combinatorial optimisation perspective.
We consider the case of languages containing all possible unary cost functions. In the case of languages consisting of only {0, ∞}-valued cost functions (i.e. relations), such languages have been called conservative and studied by Bulatov [LICS’03] and recently by Barto [LICS’11]. Since we study valued languages, we call a language conservative if it contains all finite-valued unary cost functions. The computational complexity of conservative valued languages has been studied by Cohen et al. [AIJ’06] for languages over Boolean domains, by Deineko et al. [JACM’08] for {0,1}-valued languages (a.k.a Max-CSP), and by Takhanov [STACS’10] for {0,∞}-valued languages containing all finite- valued unary cost functions (a.k.a. Min-Cost-Hom).
We prove a Schaefer-like dichotomy theorem for conservative valued languages: if all cost functions in the language satisfy a certain condition (specified by a complementary combination of STP and MJN multimorphisms), then any instance can be solved in polynomial time (via a new algorithm developed in this paper), otherwise the language is NP-hard. This is the first complete complexity classification of general-valued constraint languages over non-Boolean domains. It is a common phenomenon that complexity classifications of problems over non-Boolean domains is significantly harder than the Boolean case. The polynomial-time algorithm we present for the tractable cases is a generalisation of the submodular minimisation problem and a result of Cohen et al. [TCS’08].
Our results generalise previous results by Takhanov [STACS’10] and (a subset of results) by Cohen et al. [AIJ’06] and Deineko et al. [JACM’08]. Moreover, our results do not rely on any computer-assisted search as in Deineko et al. [JACM’08], and provide a powerful tool for proving hardness of finite-valued and general-valued languages.
acknowledgement: Vladimir Kolmogorov is supported by the Royal Academy of Eng ineering/EPSRC.
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Stanislav
full_name: Živný, Stanislav
last_name: Živný
citation:
ama: 'Kolmogorov V, Živný S. The complexity of conservative valued CSPs. In: SIAM;
2012:750-759.'
apa: 'Kolmogorov, V., & Živný, S. (2012). The complexity of conservative valued
CSPs (pp. 750–759). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.'
chicago: Kolmogorov, Vladimir, and Stanislav Živný. “The Complexity of Conservative
Valued CSPs,” 750–59. SIAM, 2012.
ieee: 'V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,”
presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 750–759.'
ista: 'Kolmogorov V, Živný S. 2012. The complexity of conservative valued CSPs.
SODA: Symposium on Discrete Algorithms, 750–759.'
mla: Kolmogorov, Vladimir, and Stanislav Živný. The Complexity of Conservative
Valued CSPs. SIAM, 2012, pp. 750–59.
short: V. Kolmogorov, S. Živný, in:, SIAM, 2012, pp. 750–759.
conference:
name: 'SODA: Symposium on Discrete Algorithms'
date_created: 2018-12-11T12:02:27Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:23Z
day: '01'
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1008.1555
month: '01'
oa: 1
page: 750 - 759
publication_status: published
publisher: SIAM
publist_id: '3362'
quality_controlled: 0
status: public
title: The complexity of conservative valued CSPs
type: conference
year: '2012'
...
---
_id: '330'
abstract:
- lang: eng
text: 'A procedure for the continuous production of Cu 2ZnSnS 4 (CZTS) nanoparticles
with controlled composition is presented. CZTS nanoparticles were prepared through
the reaction of the metals'' amino complexes with elemental sulfur in a continuous-flow
reactor at moderate temperatures (300-330 °C). High-resolution transmission electron
microscopy and X-ray diffraction analysis showed the nanocrystals to have a crystallographic
structure compatible with that of the kesterite. Chemical characterization of
the materials showed the presence of the four elements in each individual nanocrystal.
Composition control was achieved by adjusting the solution flow rate through the
reactor and the proper choice of the nominal precursor concentration within the
flowing solution. Single-particle analysis revealed a composition distribution
within each sample, which was optimized at the highest synthesis temperatures
used. '
article_processing_charge: No
article_type: original
author:
- first_name: Alexey
full_name: Shavel, Alexey
last_name: Shavel
- first_name: Doris
full_name: Cadavid, Doris
last_name: Cadavid
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Alex
full_name: Carrete, Alex
last_name: Carrete
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. Continuous production of
Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the
American Chemical Society. 2012;134(3):1438-1441. doi:10.1021/ja209688a
apa: Shavel, A., Cadavid, D., Ibáñez, M., Carrete, A., & Cabot, A. (2012). Continuous
production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal
of the American Chemical Society. ACS. https://doi.org/10.1021/ja209688a
chicago: Shavel, Alexey, Doris Cadavid, Maria Ibáñez, Alex Carrete, and Andreu Cabot.
“Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow
Reactor.” Journal of the American Chemical Society. ACS, 2012. https://doi.org/10.1021/ja209688a.
ieee: A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, and A. Cabot, “Continuous production
of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor,” Journal of
the American Chemical Society, vol. 134, no. 3. ACS, pp. 1438–1441, 2012.
ista: Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. 2012. Continuous production
of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the
American Chemical Society. 134(3), 1438–1441.
mla: Shavel, Alexey, et al. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf
Nanocrystals in a Flow Reactor.” Journal of the American Chemical Society,
vol. 134, no. 3, ACS, 2012, pp. 1438–41, doi:10.1021/ja209688a.
short: A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, A. Cabot, Journal of the American
Chemical Society 134 (2012) 1438–1441.
date_created: 2018-12-11T11:45:51Z
date_published: 2012-01-02T00:00:00Z
date_updated: 2021-01-12T07:42:29Z
day: '02'
doi: 10.1021/ja209688a
extern: '1'
intvolume: ' 134'
issue: '3'
language:
- iso: eng
month: '01'
oa_version: None
page: 1438 - 1441
publication: Journal of the American Chemical Society
publication_status: published
publisher: ACS
publist_id: '7531'
quality_controlled: '1'
status: public
title: Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow
reactor
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 134
year: '2012'
...