---
_id: '2803'
abstract:
- lang: eng
text: Recent numerical studies suggest that in pipe and related shear flows, the
region of phase space separating laminar from turbulent motion is organized by
a chaotic attractor, called an edge state, which mediates the transition process.
We here confirm the existence of the edge state in laboratory experiments. We
observe that it governs the dynamics during the decay of turbulence underlining
its potential relevance for turbulence control. In addition we unveil two unstable
traveling wave solutions underlying the experimental flow fields. This observation
corroborates earlier suggestions that unstable solutions organize turbulence and
its stability border.
author:
- first_name: Alberto
full_name: de Lózar, Alberto
last_name: De Lózar
- first_name: Fernando
full_name: Mellibovsky, Fernando
last_name: Mellibovsky
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
- first_name: Björn
full_name: Björn Hof
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: De Lózar A, Mellibovsky F, Avila M, Hof B. Edge state in pipe flow experiments.
Physical Review Letters. 2012;108(21). doi:10.1103/PhysRevLett.108.214502
apa: De Lózar, A., Mellibovsky, F., Avila, M., & Hof, B. (2012). Edge state
in pipe flow experiments. Physical Review Letters. American Physical Society.
https://doi.org/10.1103/PhysRevLett.108.214502
chicago: De Lózar, Alberto, Fernando Mellibovsky, Marc Avila, and Björn Hof. “Edge
State in Pipe Flow Experiments.” Physical Review Letters. American Physical
Society, 2012. https://doi.org/10.1103/PhysRevLett.108.214502.
ieee: A. De Lózar, F. Mellibovsky, M. Avila, and B. Hof, “Edge state in pipe flow
experiments,” Physical Review Letters, vol. 108, no. 21. American Physical
Society, 2012.
ista: De Lózar A, Mellibovsky F, Avila M, Hof B. 2012. Edge state in pipe flow experiments.
Physical Review Letters. 108(21).
mla: De Lózar, Alberto, et al. “Edge State in Pipe Flow Experiments.” Physical
Review Letters, vol. 108, no. 21, American Physical Society, 2012, doi:10.1103/PhysRevLett.108.214502.
short: A. De Lózar, F. Mellibovsky, M. Avila, B. Hof, Physical Review Letters 108
(2012).
date_created: 2018-12-11T11:59:41Z
date_published: 2012-05-21T00:00:00Z
date_updated: 2021-01-12T06:59:49Z
day: '21'
doi: 10.1103/PhysRevLett.108.214502
extern: 1
intvolume: ' 108'
issue: '21'
month: '05'
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '4086'
quality_controlled: 0
status: public
title: Edge state in pipe flow experiments
type: journal_article
volume: 108
year: '2012'
...
---
_id: '2804'
abstract:
- lang: eng
text: The analysis of the size distribution of droplets condensing on a substrate
(breath figures) is a test ground for scaling theories. Here, we show that a faithful
description of these distributions must explicitly deal with the growth mechanisms
of the droplets. This finding establishes a gateway connecting nucleation and
growth of the smallest droplets on surfaces to gross features of the evolution
of the droplet size distribution
author:
- first_name: Johannes
full_name: Blaschke, Johannes
last_name: Blaschke
- first_name: Tobias
full_name: Lapp, Tobias
last_name: Lapp
- first_name: Björn
full_name: Björn Hof
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- first_name: Jürgen
full_name: Vollmer, Jürgen T
last_name: Vollmer
citation:
ama: 'Blaschke J, Lapp T, Hof B, Vollmer J. Breath figures: Nucleation, growth,
coalescence, and the size distribution of droplets. Physical Review Letters.
2012;109(6). doi:10.1103/PhysRevLett.109.068701'
apa: 'Blaschke, J., Lapp, T., Hof, B., & Vollmer, J. (2012). Breath figures:
Nucleation, growth, coalescence, and the size distribution of droplets. Physical
Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.109.068701'
chicago: 'Blaschke, Johannes, Tobias Lapp, Björn Hof, and Jürgen Vollmer. “Breath
Figures: Nucleation, Growth, Coalescence, and the Size Distribution of Droplets.”
Physical Review Letters. American Physical Society, 2012. https://doi.org/10.1103/PhysRevLett.109.068701.'
ieee: 'J. Blaschke, T. Lapp, B. Hof, and J. Vollmer, “Breath figures: Nucleation,
growth, coalescence, and the size distribution of droplets,” Physical Review
Letters, vol. 109, no. 6. American Physical Society, 2012.'
ista: 'Blaschke J, Lapp T, Hof B, Vollmer J. 2012. Breath figures: Nucleation, growth,
coalescence, and the size distribution of droplets. Physical Review Letters. 109(6).'
mla: 'Blaschke, Johannes, et al. “Breath Figures: Nucleation, Growth, Coalescence,
and the Size Distribution of Droplets.” Physical Review Letters, vol. 109,
no. 6, American Physical Society, 2012, doi:10.1103/PhysRevLett.109.068701.'
short: J. Blaschke, T. Lapp, B. Hof, J. Vollmer, Physical Review Letters 109 (2012).
date_created: 2018-12-11T11:59:41Z
date_published: 2012-08-10T00:00:00Z
date_updated: 2021-01-12T06:59:50Z
day: '10'
doi: 10.1103/PhysRevLett.109.068701
extern: 1
intvolume: ' 109'
issue: '6'
month: '08'
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '4085'
quality_controlled: 0
status: public
title: 'Breath figures: Nucleation, growth, coalescence, and the size distribution
of droplets'
type: journal_article
volume: 109
year: '2012'
...
---
_id: '2825'
abstract:
- lang: eng
text: 'We study the problem of maximum marginal prediction (MMP) in probabilistic
graphical models, a task that occurs, for example, as the Bayes optimal decision
rule under a Hamming loss. MMP is typically performed as a two-stage procedure:
one estimates each variable''s marginal probability and then forms a prediction
from the states of maximal probability. In this work we propose a simple yet effective
technique for accelerating MMP when inference is sampling-based: instead of the
above two-stage procedure we directly estimate the posterior probability of each
decision variable. This allows us to identify the point of time when we are sufficiently
certain about any individual decision. Whenever this is the case, we dynamically
prune the variables we are confident about from the underlying factor graph. Consequently,
at any time only samples of variables whose decision is still uncertain need to
be created. Experiments in two prototypical scenarios, multi-label classification
and image inpainting, show that adaptive sampling can drastically accelerate MMP
without sacrificing prediction accuracy.'
author:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Lampert C. Dynamic pruning of factor graphs for maximum marginal prediction.
In: Vol 1. Neural Information Processing Systems; 2012:82-90.'
apa: 'Lampert, C. (2012). Dynamic pruning of factor graphs for maximum marginal
prediction (Vol. 1, pp. 82–90). Presented at the NIPS: Neural Information Processing
Systems, Lake Tahoe, NV, United States: Neural Information Processing Systems.'
chicago: Lampert, Christoph. “Dynamic Pruning of Factor Graphs for Maximum Marginal
Prediction,” 1:82–90. Neural Information Processing Systems, 2012.
ieee: 'C. Lampert, “Dynamic pruning of factor graphs for maximum marginal prediction,”
presented at the NIPS: Neural Information Processing Systems, Lake Tahoe, NV,
United States, 2012, vol. 1, pp. 82–90.'
ista: 'Lampert C. 2012. Dynamic pruning of factor graphs for maximum marginal prediction.
NIPS: Neural Information Processing Systems vol. 1, 82–90.'
mla: Lampert, Christoph. Dynamic Pruning of Factor Graphs for Maximum Marginal
Prediction. Vol. 1, Neural Information Processing Systems, 2012, pp. 82–90.
short: C. Lampert, in:, Neural Information Processing Systems, 2012, pp. 82–90.
conference:
end_date: 2012-12-06
location: Lake Tahoe, NV, United States
name: 'NIPS: Neural Information Processing Systems'
start_date: 2012-12-03
date_created: 2018-12-11T11:59:48Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2021-01-12T06:59:59Z
day: '01'
department:
- _id: ChLa
intvolume: ' 1'
language:
- iso: eng
month: '12'
oa_version: None
page: 82 - 90
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '3975'
quality_controlled: '1'
scopus_import: 1
status: public
title: Dynamic pruning of factor graphs for maximum marginal prediction
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2012'
...
---
_id: '2848'
abstract:
- lang: eng
text: We study evolutionary game theory in a setting where individuals learn from
each other. We extend the traditional approach by assuming that a population contains
individuals with different learning abilities. In particular, we explore the situation
where individuals have different search spaces, when attempting to learn the strategies
of others. The search space of an individual specifies the set of strategies learnable
by that individual. The search space is genetically given and does not change
under social evolutionary dynamics. We introduce a general framework and study
a specific example in the context of direct reciprocity. For this example, we
obtain the counter intuitive result that cooperation can only evolve for intermediate
benefit-to-cost ratios, while small and large benefit-to-cost ratios favor defection.
Our paper is a step toward making a connection between computational learning
theory and evolutionary game dynamics.
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Zufferey D, Nowak M. Evolutionary game dynamics in populations
with different learners. Journal of Theoretical Biology. 2012;301:161-173.
doi:10.1016/j.jtbi.2012.02.021
apa: Chatterjee, K., Zufferey, D., & Nowak, M. (2012). Evolutionary game dynamics
in populations with different learners. Journal of Theoretical Biology.
Elsevier. https://doi.org/10.1016/j.jtbi.2012.02.021
chicago: Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary
Game Dynamics in Populations with Different Learners.” Journal of Theoretical
Biology. Elsevier, 2012. https://doi.org/10.1016/j.jtbi.2012.02.021.
ieee: K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations
with different learners,” Journal of Theoretical Biology, vol. 301. Elsevier,
pp. 161–173, 2012.
ista: Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations
with different learners. Journal of Theoretical Biology. 301, 161–173.
mla: Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with
Different Learners.” Journal of Theoretical Biology, vol. 301, Elsevier,
2012, pp. 161–73, doi:10.1016/j.jtbi.2012.02.021.
short: K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301
(2012) 161–173.
date_created: 2018-12-11T11:59:55Z
date_published: 2012-05-21T00:00:00Z
date_updated: 2021-01-12T07:00:12Z
day: '21'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.jtbi.2012.02.021
ec_funded: 1
external_id:
pmid:
- '22394652'
intvolume: ' 301'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3322297/
month: '05'
oa: 1
oa_version: Submitted Version
page: 161 - 173
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Journal of Theoretical Biology
publication_status: published
publisher: Elsevier
publist_id: '3946'
quality_controlled: '1'
scopus_import: 1
status: public
title: Evolutionary game dynamics in populations with different learners
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 301
year: '2012'
...
---
_id: '2849'
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Nataliya
full_name: Strelkova, Nataliya
last_name: Strelkova
citation:
ama: Edelsbrunner H, Strelkova N. On the configuration space of Steiner minimal
trees. Russian Mathematical Surveys. 2012;67(6):1167-1168. doi:10.1070/RM2012v067n06ABEH004820
apa: Edelsbrunner, H., & Strelkova, N. (2012). On the configuration space of
Steiner minimal trees. Russian Mathematical Surveys. IOP Publishing Ltd.
https://doi.org/10.1070/RM2012v067n06ABEH004820
chicago: Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space
of Steiner Minimal Trees.” Russian Mathematical Surveys. IOP Publishing
Ltd., 2012. https://doi.org/10.1070/RM2012v067n06ABEH004820.
ieee: H. Edelsbrunner and N. Strelkova, “On the configuration space of Steiner minimal
trees,” Russian Mathematical Surveys, vol. 67, no. 6. IOP Publishing Ltd.,
pp. 1167–1168, 2012.
ista: Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal
trees. Russian Mathematical Surveys. 67(6), 1167–1168.
mla: Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space
of Steiner Minimal Trees.” Russian Mathematical Surveys, vol. 67, no. 6,
IOP Publishing Ltd., 2012, pp. 1167–68, doi:10.1070/RM2012v067n06ABEH004820.
short: H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.
date_created: 2018-12-11T11:59:55Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:13Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1070/RM2012v067n06ABEH004820
file:
- access_level: open_access
checksum: 44ee8d173487e8ed41a51136816bbeb4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:26Z
date_updated: 2020-07-14T12:45:51Z
file_id: '5078'
file_name: IST-2016-546-v1+1_2014-J-05-SteinerMinTrees.pdf
file_size: 392021
relation: main_file
file_date_updated: 2020-07-14T12:45:51Z
has_accepted_license: '1'
intvolume: ' 67'
issue: '6'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 1167 - 1168
publication: Russian Mathematical Surveys
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '3943'
pubrep_id: '546'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the configuration space of Steiner minimal trees
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 67
year: '2012'
...
---
_id: '2876'
abstract:
- lang: eng
text: Cytokinin (CK) activity is regulated by the complex interplay of their metabolism,
transport, stability and cellular/tissue localization. O-glucosides of zeatin-type
CKs are postulated to be storage and/or transport forms. Active CK levels are
determined in part by their differential distribution of CK metabolites across
different subcellular compartments. We have previously shown that overexpressing
chloroplast-localized Zm-p60.1, a maize β-glucosidase capable of releasing active
cytokinins from their O- and N3-glucosides, perturbs CK homeostasis in transgenic
tobacco. We obtained tobacco (Nicotiana tabacum L., cv Petit Havana SR1) plants
overexpressing a recombinant Zm-p60.1 that is targeted to the vacuole. The protein
is correctly processed and localized to the vacuole. When grown on medium containing
exogenous zeatin, transgenic seedlings rapidly accumulate fresh weight due to
ectopic growths at the base of the hypocotyl. The presence of the enzyme in these
ectopic structures is shown by histochemical staining. CK quantification reveals
that these transgenic seedlings are unable to accumulate zeatin-O-glucoside to
levels similar to those observed in the wild type. When crossed with tobacco overexpressing
the zeatin-O-glucosyltransferase gene from Phaseolus, the vacuolar variant shows
an almost complete reversion in the root elongation assay. This is the first evidence
from intact plants that the vacuole is the storage organelle for CK O-glucosides
and that they are available to attack by Zm-p60.1. We propose the use of Zm-p60.1
as a robust molecular tool that exploits the reversibility of O-glucosylation
and enables delicate manipulations of active CK content at the cellular level.
author:
- first_name: Nagavalli
full_name: Kiran, Nagavalli S
last_name: Kiran
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Alena
full_name: Reková, Alena
last_name: Reková
- first_name: Jaroslava
full_name: Dubová, Jaroslava
last_name: Dubová
- first_name: Jiří
full_name: Malbeck, Jiří
last_name: Malbeck
- first_name: Klaus
full_name: Palme, Klaus
last_name: Palme
- first_name: Břetislav
full_name: Brzobohatý, Břetislav
last_name: Brzobohatý
citation:
ama: Kiran N, Benková E, Reková A, et al. Retargeting a maize β-glucosidase to the
vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the
vacuole. Phytochemistry. 2012;79:67-77. doi:10.1016/j.phytochem.2012.03.012
apa: Kiran, N., Benková, E., Reková, A., Dubová, J., Malbeck, J., Palme, K., &
Brzobohatý, B. (2012). Retargeting a maize β-glucosidase to the vacuole - Evidence
from intact plants that zeatin-O-glucoside is stored in the vacuole. Phytochemistry.
Elsevier. https://doi.org/10.1016/j.phytochem.2012.03.012
chicago: Kiran, Nagavalli, Eva Benková, Alena Reková, Jaroslava Dubová, Jiří Malbeck,
Klaus Palme, and Břetislav Brzobohatý. “Retargeting a Maize β-Glucosidase to the
Vacuole - Evidence from Intact Plants That Zeatin-O-Glucoside Is Stored in the
Vacuole.” Phytochemistry. Elsevier, 2012. https://doi.org/10.1016/j.phytochem.2012.03.012.
ieee: N. Kiran et al., “Retargeting a maize β-glucosidase to the vacuole
- Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole,”
Phytochemistry, vol. 79. Elsevier, pp. 67–77, 2012.
ista: Kiran N, Benková E, Reková A, Dubová J, Malbeck J, Palme K, Brzobohatý B.
2012. Retargeting a maize β-glucosidase to the vacuole - Evidence from intact
plants that zeatin-O-glucoside is stored in the vacuole. Phytochemistry. 79, 67–77.
mla: Kiran, Nagavalli, et al. “Retargeting a Maize β-Glucosidase to the Vacuole
- Evidence from Intact Plants That Zeatin-O-Glucoside Is Stored in the Vacuole.”
Phytochemistry, vol. 79, Elsevier, 2012, pp. 67–77, doi:10.1016/j.phytochem.2012.03.012.
short: N. Kiran, E. Benková, A. Reková, J. Dubová, J. Malbeck, K. Palme, B. Brzobohatý,
Phytochemistry 79 (2012) 67–77.
date_created: 2018-12-11T12:00:05Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2021-01-12T07:00:25Z
day: '01'
doi: 10.1016/j.phytochem.2012.03.012
extern: 1
intvolume: ' 79'
month: '07'
page: 67 - 77
publication: Phytochemistry
publication_status: published
publisher: Elsevier
publist_id: '3886'
quality_controlled: 0
status: public
title: Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants
that zeatin-O-glucoside is stored in the vacuole
type: journal_article
volume: 79
year: '2012'
...
---
_id: '2875'
abstract:
- lang: eng
text: Phytohormones are important plant growth regulators that control many developmental
processes, such as cell division, cell differentiation, organogenesis and morphogenesis.
They regulate a multitude of apparently unrelated physiological processes, often
with overlapping roles, and they mutually modulate their effects. These features
imply important synergistic and antagonistic interactions between the various
plant hormones. Auxin and cytokinin are central hormones involved in the regulation
of plant growth and development, including processes determining root architecture,
such as root pole establishment during early embryogenesis, root meristem maintenance
and lateral root organogenesis. Thus, to control root development both pathways
put special demands on the mechanisms that balance their activities and mediate
their interactions. Here, we summarize recent knowledge on the role of auxin and
cytokinin in the regulation of root architecture with special focus on lateral
root organogenesis, discuss the latest findings on the molecular mechanisms of
their interactions, and present forward genetic screen as a tool to identify novel
molecular components of the auxin and cytokinin crosstalk.
author:
- first_name: Agnieszka
full_name: Bielach, Agnieszka
last_name: Bielach
- first_name: Jérôme
full_name: Duclercq, Jérôme
last_name: Duclercq
- first_name: Peter
full_name: Peter Marhavy
id: 3F45B078-F248-11E8-B48F-1D18A9856A87
last_name: Marhavy
orcid: 0000-0001-5227-5741
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Bielach A, Duclercq J, Marhavý P, Benková E. Genetic approach towards the identification
of auxin - cytokinin crosstalk components involved in root development. Philosophical
Transactions of the Royal Society of London Series B, Biological Sciences.
2012;367(1595):1469-1478. doi:10.1098/rstb.2011.0233
apa: Bielach, A., Duclercq, J., Marhavý, P., & Benková, E. (2012). Genetic approach
towards the identification of auxin - cytokinin crosstalk components involved
in root development. Philosophical Transactions of the Royal Society of London.
Series B, Biological Sciences. Royal Society, The. https://doi.org/10.1098/rstb.2011.0233
chicago: Bielach, Agnieszka, Jérôme Duclercq, Peter Marhavý, and Eva Benková. “Genetic
Approach towards the Identification of Auxin - Cytokinin Crosstalk Components
Involved in Root Development.” Philosophical Transactions of the Royal Society
of London. Series B, Biological Sciences. Royal Society, The, 2012. https://doi.org/10.1098/rstb.2011.0233.
ieee: A. Bielach, J. Duclercq, P. Marhavý, and E. Benková, “Genetic approach towards
the identification of auxin - cytokinin crosstalk components involved in root
development,” Philosophical Transactions of the Royal Society of London. Series
B, Biological Sciences, vol. 367, no. 1595. Royal Society, The, pp. 1469–1478,
2012.
ista: Bielach A, Duclercq J, Marhavý P, Benková E. 2012. Genetic approach towards
the identification of auxin - cytokinin crosstalk components involved in root
development. Philosophical Transactions of the Royal Society of London. Series
B, Biological Sciences. 367(1595), 1469–1478.
mla: Bielach, Agnieszka, et al. “Genetic Approach towards the Identification of
Auxin - Cytokinin Crosstalk Components Involved in Root Development.” Philosophical
Transactions of the Royal Society of London. Series B, Biological Sciences,
vol. 367, no. 1595, Royal Society, The, 2012, pp. 1469–78, doi:10.1098/rstb.2011.0233.
short: A. Bielach, J. Duclercq, P. Marhavý, E. Benková, Philosophical Transactions
of the Royal Society of London. Series B, Biological Sciences 367 (2012) 1469–1478.
date_created: 2018-12-11T12:00:05Z
date_published: 2012-06-05T00:00:00Z
date_updated: 2021-01-12T07:00:25Z
day: '05'
doi: 10.1098/rstb.2011.0233
extern: 1
intvolume: ' 367'
issue: '1595'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3321684/
month: '06'
oa: 1
page: 1469 - 1478
publication: Philosophical Transactions of the Royal Society of London. Series B,
Biological Sciences
publication_status: published
publisher: Royal Society, The
publist_id: '3887'
quality_controlled: 0
status: public
title: Genetic approach towards the identification of auxin - cytokinin crosstalk
components involved in root development
type: journal_article
volume: 367
year: '2012'
...
---
_id: '2878'
abstract:
- lang: eng
text: Phyllotaxis, the regular arrangement of leaves and flowers around the stem,
is a key feature of plant architecture. Current models propose that the spatiotemporal
regulation of organ initiation is controlled by a positive feedback loop between
the plant hormone auxin and its efflux carrier PIN-FORMED1 (PIN1). Consequently,
pin1 mutants give rise to naked inflorescence stalks with few or no flowers, indicating
that PIN1 plays a crucial role in organ initiation. However, pin1 mutants do produce
leaves. In order to understand the regulatory mechanisms controlling leaf initiation
in Arabidopsis (Arabidopsis thaliana) rosettes, we have characterized the vegetative
pin1 phenotype in detail. We show that although the timing of leaf initiation
in vegetative pin1 mutants is variable and divergence angles clearly deviate from
the canonical 137° value, leaves are not positioned at random during early developmental
stages. Our data further indicate that other PIN proteins are unlikely to explain
the persistence of leaf initiation and positioning during pin1 vegetative development.
Thus, phyllotaxis appears to be more complex than suggested by current mechanistic
models.
author:
- first_name: Bernadette
full_name: Guenot, Bernadette
last_name: Guenot
- first_name: Emmanuelle
full_name: Bayer, Emmanuelle
last_name: Bayer
- first_name: Daniel
full_name: Kierzkowski, Daniel
last_name: Kierzkowski
- first_name: Richard
full_name: Smith, Richard S
last_name: Smith
- first_name: Therese
full_name: Mandel, Therese
last_name: Mandel
- first_name: Petra
full_name: Žádníková, Petra
last_name: Žádníková
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Cris
full_name: Kuhlemeier, Cris
last_name: Kuhlemeier
citation:
ama: Guenot B, Bayer E, Kierzkowski D, et al. Pin1 independent leaf initiation in
Arabidopsis. Plant Physiology. 2012;159(4):1501-1510. doi:10.1104/pp.112.200402
apa: Guenot, B., Bayer, E., Kierzkowski, D., Smith, R., Mandel, T., Žádníková, P.,
… Kuhlemeier, C. (2012). Pin1 independent leaf initiation in Arabidopsis. Plant
Physiology. American Society of Plant Biologists. https://doi.org/10.1104/pp.112.200402
chicago: Guenot, Bernadette, Emmanuelle Bayer, Daniel Kierzkowski, Richard Smith,
Therese Mandel, Petra Žádníková, Eva Benková, and Cris Kuhlemeier. “Pin1 Independent
Leaf Initiation in Arabidopsis.” Plant Physiology. American Society of
Plant Biologists, 2012. https://doi.org/10.1104/pp.112.200402.
ieee: B. Guenot et al., “Pin1 independent leaf initiation in Arabidopsis,”
Plant Physiology, vol. 159, no. 4. American Society of Plant Biologists,
pp. 1501–1510, 2012.
ista: Guenot B, Bayer E, Kierzkowski D, Smith R, Mandel T, Žádníková P, Benková
E, Kuhlemeier C. 2012. Pin1 independent leaf initiation in Arabidopsis. Plant
Physiology. 159(4), 1501–1510.
mla: Guenot, Bernadette, et al. “Pin1 Independent Leaf Initiation in Arabidopsis.”
Plant Physiology, vol. 159, no. 4, American Society of Plant Biologists,
2012, pp. 1501–10, doi:10.1104/pp.112.200402.
short: B. Guenot, E. Bayer, D. Kierzkowski, R. Smith, T. Mandel, P. Žádníková, E.
Benková, C. Kuhlemeier, Plant Physiology 159 (2012) 1501–1510.
date_created: 2018-12-11T12:00:06Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2021-01-12T07:00:26Z
day: '01'
doi: 10.1104/pp.112.200402
extern: 1
intvolume: ' 159'
issue: '4'
month: '08'
page: 1501 - 1510
publication: Plant Physiology
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '3884'
quality_controlled: 0
status: public
title: Pin1 independent leaf initiation in Arabidopsis
type: journal_article
volume: 159
year: '2012'
...
---
_id: '2879'
abstract:
- lang: eng
text: Hormones, such as auxin and cytokinin, are involved in the complex molecular
network that regulates the coordinated development of plant organs. Genes controlling
ovule patterning have been identified and studied in detail; however, the roles
of auxin and cytokinin in ovule development are largely unknown. Here we show
that key cytokinin pathway genes, such as isopentenyltransferase and cytokinin
receptors, are expressed during ovule development. Also, in a cre1-12 ahk2-2 ahk3-3
triple mutant with severely reduced cytokinin perception, expression of the auxin
efflux facilitator PIN-FORMED 1 (PIN1) was severely reduced. In sporocyteless/nozzle
(spl/nzz) mutants, which show a similar phenotype to the cre1-12 ahk2-2 ahk3-3
triple mutant, PIN1 expression is also reduced. Treatment with the exogenous cytokinin
N6-benzylaminopurine also altered both auxin distribution and patterning of the
ovule; this process required the homeodomain transcription factor BELL1 (BEL1).
Thus, this article shows that cytokinin regulates ovule development through the
regulation of PIN1. Furthermore, the transcription factors BEL1 and SPL/NZZ, previously
described as key regulators of ovule development, are needed for the auxin and
cytokinin signaling pathways for the correct patterning of the ovule.
author:
- first_name: Stefano
full_name: Bencivenga, Stefano
last_name: Bencivenga
- first_name: Sara
full_name: Simonini, Sara
last_name: Simonini
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Lucia
full_name: Colombo, Lucia
last_name: Colombo
citation:
ama: Bencivenga S, Simonini S, Benková E, Colombo L. The transcription factors BEL1
and SPL are required for cytokinin and auxin signaling during ovule development
in Arabidopsis. Plant Cell. 2012;24(7):2886-2897. doi:10.1105/tpc.112.100164
apa: Bencivenga, S., Simonini, S., Benková, E., & Colombo, L. (2012). The transcription
factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule
development in Arabidopsis. Plant Cell. American Society of Plant Biologists.
https://doi.org/10.1105/tpc.112.100164
chicago: Bencivenga, Stefano, Sara Simonini, Eva Benková, and Lucia Colombo. “The
Transcription Factors BEL1 and SPL Are Required for Cytokinin and Auxin Signaling
during Ovule Development in Arabidopsis.” Plant Cell. American Society
of Plant Biologists, 2012. https://doi.org/10.1105/tpc.112.100164.
ieee: S. Bencivenga, S. Simonini, E. Benková, and L. Colombo, “The transcription
factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule
development in Arabidopsis,” Plant Cell, vol. 24, no. 7. American Society
of Plant Biologists, pp. 2886–2897, 2012.
ista: Bencivenga S, Simonini S, Benková E, Colombo L. 2012. The transcription factors
BEL1 and SPL are required for cytokinin and auxin signaling during ovule development
in Arabidopsis. Plant Cell. 24(7), 2886–2897.
mla: Bencivenga, Stefano, et al. “The Transcription Factors BEL1 and SPL Are Required
for Cytokinin and Auxin Signaling during Ovule Development in Arabidopsis.” Plant
Cell, vol. 24, no. 7, American Society of Plant Biologists, 2012, pp. 2886–97,
doi:10.1105/tpc.112.100164.
short: S. Bencivenga, S. Simonini, E. Benková, L. Colombo, Plant Cell 24 (2012)
2886–2897.
date_created: 2018-12-11T12:00:06Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2021-01-12T07:00:26Z
day: '01'
doi: 10.1105/tpc.112.100164
extern: 1
intvolume: ' 24'
issue: '7'
month: '07'
page: 2886 - 2897
publication: Plant Cell
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '3885'
quality_controlled: 0
status: public
title: The transcription factors BEL1 and SPL are required for cytokinin and auxin
signaling during ovule development in Arabidopsis
type: journal_article
volume: 24
year: '2012'
...
---
_id: '2891'
abstract:
- lang: eng
text: "Quantitative automata are nondeterministic finite automata with edge weights.
They value a\r\nrun by some function from the sequence of visited weights to the
reals, and value a word by its\r\nminimal/maximal run. They generalize boolean
automata, and have gained much attention in\r\nrecent years. Unfortunately, important
automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata,
cannot be determinized. Yet, the quantitative setting provides the potential\r\nof
approximate determinization. We define approximate determinization with respect
to\r\na distance function, and investigate this potential.\r\nWe show that sum
automata cannot be determinized approximately with respect to any\r\ndistance
function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith
respect to some distance functions.\r\nDiscounted-sum automata allow for approximate
determinization, as the influence of a word’s\r\nsuffix is decaying. However,
the naive approach, of unfolding the automaton computations up\r\nto a sufficient
level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative
construction that is singly exponential in the discount factor, in the precision,
and\r\nin the number of states. We prove matching lower bounds, showing exponential
dependency on\r\neach of these three parameters.\r\nAverage and limit-average
automata are shown to prohibit approximate determinization with\r\nrespect to
any distance function, and this is the case even for two weights, 0 and 1."
acknowledgement: We thank Laurent Doyen for great ideas and valuable help in analyzing
discounted-sum automata.
alternative_title:
- LIPIcs
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Boker U, Henzinger TA. Approximate determinization of quantitative automata.
In: Leibniz International Proceedings in Informatics. Vol 18. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2012:362-373. doi:10.4230/LIPIcs.FSTTCS.2012.362'
apa: 'Boker, U., & Henzinger, T. A. (2012). Approximate determinization of quantitative
automata. In Leibniz International Proceedings in Informatics (Vol. 18,
pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362'
chicago: Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative
Automata.” In Leibniz International Proceedings in Informatics, 18:362–73.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362.
ieee: U. Boker and T. A. Henzinger, “Approximate determinization of quantitative
automata,” in Leibniz International Proceedings in Informatics, Hyderabad,
India, 2012, vol. 18, pp. 362–373.
ista: 'Boker U, Henzinger TA. 2012. Approximate determinization of quantitative
automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations
of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373.'
mla: Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative
Automata.” Leibniz International Proceedings in Informatics, vol. 18, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:10.4230/LIPIcs.FSTTCS.2012.362.
short: U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.
conference:
end_date: 2012-12-17
location: Hyderabad, India
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2012-12-15
date_created: 2018-12-11T12:00:10Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2021-01-12T07:00:31Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.FSTTCS.2012.362
ec_funded: 1
file:
- access_level: open_access
checksum: 88da18d3e2cb2e5011d7d10ce38a3864
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:37Z
date_updated: 2020-07-14T12:45:52Z
file_id: '4826'
file_name: IST-2017-805-v1+1_34.pdf
file_size: 559069
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
has_accepted_license: '1'
intvolume: ' 18'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 362 - 373
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Leibniz International Proceedings in Informatics
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '3867'
pubrep_id: '805'
quality_controlled: '1'
scopus_import: 1
status: public
title: Approximate determinization of quantitative automata
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2012'
...
---
_id: '2890'
abstract:
- lang: eng
text: 'Systems are often specified using multiple requirements on their behavior.
In practice, these requirements can be contradictory. The classical approach to
specification, verification, and synthesis demands more detailed specifications
that resolve any contradictions in the requirements. These detailed specifications
are usually large, cumbersome, and hard to maintain or modify. In contrast, quantitative
frameworks allow the formalization of the intuitive idea that what is desired
is an implementation that comes "closest" to satisfying the mutually
incompatible requirements, according to a measure of fit that can be defined by
the requirements engineer. One flexible framework for quantifying how "well"
an implementation satisfies a specification is offered by simulation distances
that are parameterized by an error model. We introduce this framework, study its
properties, and provide an algorithmic solution for the following quantitative
synthesis question: given two (or more) behavioral requirements specified by possibly
incompatible finite-state machines, and an error model, find the finite-state
implementation that minimizes the maximal simulation distance to the given requirements.
Furthermore, we generalize the framework to handle infinite alphabets (for example,
realvalued domains). We also demonstrate how quantitative specifications based
on simulation distances might lead to smaller and easier to modify specifications.
Finally, we illustrate our approach using case studies on error correcting codes
and scheduler synthesis.'
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Sivakanth
full_name: Gopi, Sivakanth
last_name: Gopi
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Nishant
full_name: Totla, Nishant
last_name: Totla
citation:
ama: 'Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. Synthesis from incompatible
specifications. In: Proceedings of the Tenth ACM International Conference on
Embedded Software. ACM; 2012:53-62. doi:10.1145/2380356.2380371'
apa: 'Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., & Totla, N. (2012).
Synthesis from incompatible specifications. In Proceedings of the tenth ACM
international conference on Embedded software (pp. 53–62). Tampere, Finland:
ACM. https://doi.org/10.1145/2380356.2380371'
chicago: Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and
Nishant Totla. “Synthesis from Incompatible Specifications.” In Proceedings
of the Tenth ACM International Conference on Embedded Software, 53–62. ACM,
2012. https://doi.org/10.1145/2380356.2380371.
ieee: P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis
from incompatible specifications,” in Proceedings of the tenth ACM international
conference on Embedded software, Tampere, Finland, 2012, pp. 53–62.
ista: 'Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. 2012. Synthesis from
incompatible specifications. Proceedings of the tenth ACM international conference
on Embedded software. EMSOFT: Embedded Software , 53–62.'
mla: Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.” Proceedings
of the Tenth ACM International Conference on Embedded Software, ACM, 2012,
pp. 53–62, doi:10.1145/2380356.2380371.
short: P. Cerny, S. Gopi, T.A. Henzinger, A. Radhakrishna, N. Totla, in:, Proceedings
of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp.
53–62.
conference:
end_date: 2012-10-12
location: Tampere, Finland
name: 'EMSOFT: Embedded Software '
start_date: 2012-10-07
date_created: 2018-12-11T12:00:10Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:00:30Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2380356.2380371
ec_funded: 1
language:
- iso: eng
month: '10'
oa_version: None
page: 53 - 62
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the tenth ACM international conference on Embedded software
publication_status: published
publisher: ACM
publist_id: '3868'
quality_controlled: '1'
scopus_import: 1
status: public
title: Synthesis from incompatible specifications
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2888'
abstract:
- lang: eng
text: Formal verification aims to improve the quality of hardware and software by
detecting errors before they do harm. At the basis of formal verification lies
the logical notion of correctness, which purports to capture whether or not a
circuit or program behaves as desired. We suggest that the boolean partition into
correct and incorrect systems falls short of the practical need to assess the
behavior of hardware and software in a more nuanced fashion against multiple criteria.
alternative_title:
- LNCS
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Henzinger TA. Quantitative reactive models. In: Conference Proceedings
MODELS 2012. Vol 7590. Springer; 2012:1-2. doi:10.1007/978-3-642-33666-9_1'
apa: 'Henzinger, T. A. (2012). Quantitative reactive models. In Conference proceedings
MODELS 2012 (Vol. 7590, pp. 1–2). Innsbruck, Austria: Springer. https://doi.org/10.1007/978-3-642-33666-9_1'
chicago: Henzinger, Thomas A. “Quantitative Reactive Models.” In Conference Proceedings
MODELS 2012, 7590:1–2. Springer, 2012. https://doi.org/10.1007/978-3-642-33666-9_1.
ieee: T. A. Henzinger, “Quantitative reactive models,” in Conference proceedings
MODELS 2012, Innsbruck, Austria, 2012, vol. 7590, pp. 1–2.
ista: 'Henzinger TA. 2012. Quantitative reactive models. Conference proceedings
MODELS 2012. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol.
7590, 1–2.'
mla: Henzinger, Thomas A. “Quantitative Reactive Models.” Conference Proceedings
MODELS 2012, vol. 7590, Springer, 2012, pp. 1–2, doi:10.1007/978-3-642-33666-9_1.
short: T.A. Henzinger, in:, Conference Proceedings MODELS 2012, Springer, 2012,
pp. 1–2.
conference:
end_date: 2012-10-05
location: Innsbruck, Austria
name: 'MODELS: Model-driven Engineering Languages and Systems'
start_date: 2012-09-30
date_created: 2018-12-11T12:00:09Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2021-01-12T07:00:29Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-642-33666-9_1
ec_funded: 1
intvolume: ' 7590'
language:
- iso: eng
month: '09'
oa_version: None
page: 1 - 2
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Conference proceedings MODELS 2012
publication_status: published
publisher: Springer
publist_id: '3870'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantitative reactive models
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7590
year: '2012'
...
---
_id: '2903'
abstract:
- lang: eng
text: In order to enjoy a digital version of the Jordan Curve Theorem, it is common
to use the closed topology for the foreground and the open topology for the background
of a 2-dimensional binary image. In this paper, we introduce a single topology
that enjoys this theorem for all thresholds decomposing a real-valued image into
foreground and background. This topology is easy to construct and it generalizes
to n-dimensional images.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Olga
full_name: Symonova, Olga
id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87
last_name: Symonova
citation:
ama: 'Edelsbrunner H, Symonova O. The adaptive topology of a digital image. In:
IEEE; 2012:41-48. doi:10.1109/ISVD.2012.11'
apa: 'Edelsbrunner, H., & Symonova, O. (2012). The adaptive topology of a digital
image (pp. 41–48). Presented at the ISVD: International Symposium on Voronoi Diagrams
in Science and Engineering, New Brunswick, NJ, USA : IEEE. https://doi.org/10.1109/ISVD.2012.11'
chicago: Edelsbrunner, Herbert, and Olga Symonova. “The Adaptive Topology of a Digital
Image,” 41–48. IEEE, 2012. https://doi.org/10.1109/ISVD.2012.11.
ieee: 'H. Edelsbrunner and O. Symonova, “The adaptive topology of a digital image,”
presented at the ISVD: International Symposium on Voronoi Diagrams in Science
and Engineering, New Brunswick, NJ, USA , 2012, pp. 41–48.'
ista: 'Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image.
ISVD: International Symposium on Voronoi Diagrams in Science and Engineering,
41–48.'
mla: Edelsbrunner, Herbert, and Olga Symonova. The Adaptive Topology of a Digital
Image. IEEE, 2012, pp. 41–48, doi:10.1109/ISVD.2012.11.
short: H. Edelsbrunner, O. Symonova, in:, IEEE, 2012, pp. 41–48.
conference:
end_date: 2012-06-29
location: 'New Brunswick, NJ, USA '
name: 'ISVD: International Symposium on Voronoi Diagrams in Science and Engineering'
start_date: 2012-06-27
date_created: 2018-12-11T12:00:15Z
date_published: 2012-08-06T00:00:00Z
date_updated: 2021-01-12T07:00:35Z
day: '06'
ddc:
- '000'
department:
- _id: HeEd
- _id: MaJö
doi: 10.1109/ISVD.2012.11
file:
- access_level: open_access
checksum: 444869a4e8abf07834f88b6e5cb5e9c3
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:41Z
date_updated: 2020-07-14T12:45:52Z
file_id: '4765'
file_name: IST-2016-545-v1+1_2012-P-10-AdaptiveTopology.pdf
file_size: 760548
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 41 - 48
publication_status: published
publisher: IEEE
publist_id: '3844'
pubrep_id: '545'
quality_controlled: '1'
scopus_import: 1
status: public
title: The adaptive topology of a digital image
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2916'
abstract:
- lang: eng
text: The classical (boolean) notion of refinement for behavioral interfaces of
system components is the alternating refinement preorder. In this paper, we define
a quantitative measure for interfaces, called interface simulation distance. It
makes the alternating refinement preorder quantitative by, intu- itively, tolerating
errors (while counting them) in the alternating simulation game. We show that
the interface simulation distance satisfies the triangle inequality, that the
distance between two interfaces does not increase under parallel composition with
a third interface, and that the distance between two interfaces can be bounded
from above and below by distances between abstractions of the two interfaces.
We illustrate the framework, and the properties of the distances under composition
of interfaces, with two case studies.
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: 'Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances.
In: Electronic Proceedings in Theoretical Computer Science. Vol 96. EPTCS;
2012:29-42. doi:10.4204/EPTCS.96.3'
apa: 'Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface
Simulation Distances. In Electronic Proceedings in Theoretical Computer Science
(Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. https://doi.org/10.4204/EPTCS.96.3'
chicago: Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna.
“Interface Simulation Distances.” In Electronic Proceedings in Theoretical
Computer Science, 96:29–42. EPTCS, 2012. https://doi.org/10.4204/EPTCS.96.3.
ieee: P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation
Distances,” in Electronic Proceedings in Theoretical Computer Science,
Napoli, Italy, 2012, vol. 96, pp. 29–42.
ista: 'Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation
Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games,
Automata, Logic, and Formal Verification vol. 96, 29–42.'
mla: Cerny, Pavol, et al. “Interface Simulation Distances.” Electronic Proceedings
in Theoretical Computer Science, vol. 96, EPTCS, 2012, pp. 29–42, doi:10.4204/EPTCS.96.3.
short: P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings
in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.
conference:
end_date: 2012-09-08
location: Napoli, Italy
name: 'GandALF: Games, Automata, Logic, and Formal Verification'
start_date: 2012-09-06
date_created: 2018-12-11T12:00:19Z
date_published: 2012-10-07T00:00:00Z
date_updated: 2023-02-23T10:12:05Z
day: '07'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4204/EPTCS.96.3
ec_funded: 1
external_id:
arxiv:
- '1210.2450'
intvolume: ' 96'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1210.2450
month: '10'
oa: 1
oa_version: Submitted Version
page: 29 - 42
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _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: Electronic Proceedings in Theoretical Computer Science
publication_status: published
publisher: EPTCS
publist_id: '3827'
quality_controlled: '1'
related_material:
record:
- id: '1733'
relation: later_version
status: public
scopus_import: 1
status: public
title: Interface Simulation Distances
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2012'
...
---
_id: '2917'
abstract:
- lang: eng
text: 'The search for extra-terrestrial intelligence (SETI) has been performed principally
as a one-way survey, listening of radio frequencies across the Milky Way and other
galaxies. However, scientists have engaged in an active messaging only rarely.
This suggests the simple rationale that if other civilizations exist and take
a similar approach to ours, namely listening but not broadcasting, the result
is a silent universe. A simple game theoretical model, the prisoner''s dilemma,
explains this situation: each player (civilization) can passively search (defect),
or actively search and broadcast (cooperate). In order to maximize the payoff
(or, equivalently, minimize the risks) the best strategy is not to broadcast.
In fact, the active search has been opposed on the basis that it might be dangerous
to expose ourselves. However, most of these ideas have not been based on objective
arguments, and ignore accounting of the possible gains and losses. Thus, the question
stands: should we perform an active search? I develop a game-theoretical framework
where civilizations can be of different types, and explicitly apply it to a situation
where societies are either interested in establishing a two-way communication
or belligerent and in urge to exploit ours. The framework gives a quantitative
solution (a mixed-strategy), which is how frequent we should perform the active
SETI. This frequency is roughly proportional to the inverse of the risk, and can
be extremely small. However, given the immense amount of stars being scanned,
it supports active SETI. The model is compared with simulations, and the possible
actions are evaluated through the San Marino scale, measuring the risks of messaging.'
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. The game of active search for extra terrestrial intelligence Breaking
the Great Silence . International Journal of Astrobiology. 2012;12(1):53-62.
doi:10.1017/S1473550412000407
apa: de Vladar, H. (2012). The game of active search for extra terrestrial intelligence
Breaking the Great Silence . International Journal of Astrobiology. Cambridge
University Press. https://doi.org/10.1017/S1473550412000407
chicago: Vladar, Harold de. “The Game of Active Search for Extra Terrestrial Intelligence
Breaking the Great Silence .” International Journal of Astrobiology. Cambridge
University Press, 2012. https://doi.org/10.1017/S1473550412000407.
ieee: H. de Vladar, “The game of active search for extra terrestrial intelligence
Breaking the Great Silence ,” International Journal of Astrobiology, vol.
12, no. 1. Cambridge University Press, pp. 53–62, 2012.
ista: de Vladar H. 2012. The game of active search for extra terrestrial intelligence
Breaking the Great Silence . International Journal of Astrobiology. 12(1), 53–62.
mla: de Vladar, Harold. “The Game of Active Search for Extra Terrestrial Intelligence
Breaking the Great Silence .” International Journal of Astrobiology, vol.
12, no. 1, Cambridge University Press, 2012, pp. 53–62, doi:10.1017/S1473550412000407.
short: H. de Vladar, International Journal of Astrobiology 12 (2012) 53–62.
date_created: 2018-12-11T12:00:19Z
date_published: 2012-11-06T00:00:00Z
date_updated: 2021-01-12T07:00:41Z
day: '06'
department:
- _id: NiBa
doi: 10.1017/S1473550412000407
intvolume: ' 12'
issue: '1'
language:
- iso: eng
month: '11'
oa_version: None
page: 53 - 62
publication: International Journal of Astrobiology
publication_status: published
publisher: Cambridge University Press
publist_id: '3821'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The game of active search for extra terrestrial intelligence Breaking the
Great Silence '
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2012'
...
---
_id: '2911'
abstract:
- lang: eng
text: |-
We have selected problems that may not yet be well known, but have the
potential to push the research in interesting directions. In particular, we state
problems that do not require specific knowledge outside the standard circle of ideas
in discrete geometry. Despite the relatively simple statements, these problems are
related to current research and their solutions are likely to require new ideas and
approaches. We have chosen problems from different fields to make this short paper
attractive to a wide range of specialists.
author:
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Alexander
full_name: Ivanov, Alexander
last_name: Ivanov
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
citation:
ama: Edelsbrunner H, Ivanov A, Karasev R. Open problems in discrete and computational
geometry. Automatic Control and Computer Sciences. 2012;in print.
apa: Edelsbrunner, H., Ivanov, A., & Karasev, R. (2012). Open problems in discrete
and computational geometry. Automatic Control and Computer Sciences. Springer.
chicago: Edelsbrunner, Herbert, Alexander Ivanov, and Roman Karasev. “Open Problems
in Discrete and Computational Geometry.” Automatic Control and Computer Sciences.
Springer, 2012.
ieee: H. Edelsbrunner, A. Ivanov, and R. Karasev, “Open problems in discrete and
computational geometry,” Automatic Control and Computer Sciences, vol.
in print. Springer, 2012.
ista: Edelsbrunner H, Ivanov A, Karasev R. 2012. Open problems in discrete and computational
geometry. Automatic Control and Computer Sciences. in print.
mla: Edelsbrunner, Herbert, et al. “Open Problems in Discrete and Computational
Geometry.” Automatic Control and Computer Sciences, vol. in print, Springer,
2012.
short: H. Edelsbrunner, A. Ivanov, R. Karasev, Automatic Control and Computer Sciences
in print (2012).
date_created: 2018-12-11T12:00:18Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:38Z
day: '01'
extern: 1
month: '01'
publication: Automatic Control and Computer Sciences
publication_status: published
publisher: Springer
publist_id: '3832'
quality_controlled: 0
status: public
title: Open problems in discrete and computational geometry
type: journal_article
volume: in print
year: '2012'
...
---
_id: '2930'
abstract:
- lang: eng
text: "In this paper we investigate k-submodular functions. This natural family
of discrete functions includes submodular and bisubmodular functions as the special
cases k = 1 and k = 2 respectively.\r\n\r\nIn particular we generalize the known
Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts
that the minimum of the (bi)submodular function can be found by solving a maximization
problem over a (bi)submodular polyhedron. We define a k-submodular polyhedron,
prove a Min-Max-Theorem for k-submodular functions, and give a greedy algorithm
to construct the vertices of the polyhedron.\r\n"
acknowledgement: "We would like to thank Andrei Krokhin for encourag- ing our cooperation,
for helpful discussions, and for his critical reading of the manuscript.\r\n"
alternative_title:
- LNCS
author:
- first_name: Anna
full_name: Huber, Anna
last_name: Huber
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Huber A, Kolmogorov V. Towards minimizing k-submodular functions. In: Vol
7422. Springer; 2012:451-462. doi:10.1007/978-3-642-32147-4_40'
apa: 'Huber, A., & Kolmogorov, V. (2012). Towards minimizing k-submodular functions
(Vol. 7422, pp. 451–462). Presented at the ISCO: International Symposium on Combinatorial
Optimization, Athens, Greece: Springer. https://doi.org/10.1007/978-3-642-32147-4_40'
chicago: Huber, Anna, and Vladimir Kolmogorov. “Towards Minimizing K-Submodular
Functions,” 7422:451–62. Springer, 2012. https://doi.org/10.1007/978-3-642-32147-4_40.
ieee: 'A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,”
presented at the ISCO: International Symposium on Combinatorial Optimization,
Athens, Greece, 2012, vol. 7422, pp. 451–462.'
ista: 'Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO:
International Symposium on Combinatorial Optimization, LNCS, vol. 7422, 451–462.'
mla: Huber, Anna, and Vladimir Kolmogorov. Towards Minimizing K-Submodular Functions.
Vol. 7422, Springer, 2012, pp. 451–62, doi:10.1007/978-3-642-32147-4_40.
short: A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.
conference:
end_date: 2012-04-21
location: Athens, Greece
name: 'ISCO: International Symposium on Combinatorial Optimization'
start_date: 2012-04-19
date_created: 2018-12-11T12:00:24Z
date_published: 2012-04-01T00:00:00Z
date_updated: 2021-01-12T07:00:46Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/978-3-642-32147-4_40
intvolume: ' 7422'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.5469
month: '04'
oa: 1
oa_version: Preprint
page: 451 - 462
publication_status: published
publisher: Springer
publist_id: '3806'
quality_controlled: '1'
scopus_import: 1
status: public
title: Towards minimizing k-submodular functions
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7422
year: '2012'
...
---
_id: '2928'
abstract:
- lang: eng
text: ' This paper addresses the problem of approximate MAP-MRF inference in
general graphical models. Following [36], we consider a family of linear programming
relaxations of the problem where each relaxation is specified by a set of nested
pairs of factors for which the marginalization constraint needs to be enforced.
We develop a generalization of the TRW-S algorithm [9] for this problem, where
we use a decomposition into junction chains, monotonic w.r.t. some ordering on
the nodes. This generalizes the monotonic chains in [9] in a natural way. We also
show how to deal with nested factors in an efficient way. Experiments show an
improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on
a number of computer vision and natural language processing problems. '
article_processing_charge: No
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Thomas
full_name: Schoenemann, Thomas
last_name: Schoenemann
citation:
ama: Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message
passing. arXiv. 2012.
apa: Kolmogorov, V., & Schoenemann, T. (2012). Generalized sequential tree-reweighted
message passing. arXiv. ArXiv.
chicago: Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted
Message Passing.” ArXiv. ArXiv, 2012.
ieee: V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted
message passing,” arXiv. ArXiv, 2012.
ista: Kolmogorov V, Schoenemann T. 2012. Generalized sequential tree-reweighted
message passing. arXiv, .
mla: Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted
Message Passing.” ArXiv, ArXiv, 2012.
short: V. Kolmogorov, T. Schoenemann, ArXiv (2012).
date_created: 2018-12-11T12:00:23Z
date_published: 2012-05-29T00:00:00Z
date_updated: 2021-01-12T07:00:45Z
day: '29'
department:
- _id: VlKo
external_id:
arxiv:
- '1205.6352'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1205.6352
month: '05'
oa: 1
oa_version: Preprint
page: '16'
publication: arXiv
publication_status: published
publisher: ArXiv
publist_id: '3809'
status: public
title: Generalized sequential tree-reweighted message passing
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2929'
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Kolmogorov V. The Power of Linear Programming for Valued CSPs: A Constructive
Characterization. Unknown; 2012.'
apa: 'Kolmogorov, V. (2012). The power of linear programming for valued CSPs:
a constructive characterization. Unknown.'
chicago: 'Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs:
A Constructive Characterization. Unknown, 2012.'
ieee: 'V. Kolmogorov, The power of linear programming for valued CSPs: a constructive
characterization. Unknown, 2012.'
ista: 'Kolmogorov V. 2012. The power of linear programming for valued CSPs: a constructive
characterization, Unknown,p.'
mla: 'Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs:
A Constructive Characterization. Unknown, 2012.'
short: 'V. Kolmogorov, The Power of Linear Programming for Valued CSPs: A Constructive
Characterization, Unknown, 2012.'
date_created: 2018-12-11T12:00:24Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2019-04-26T07:22:21Z
day: '01'
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1207.7213
month: '01'
oa: 1
publication_status: published
publisher: Unknown
publist_id: '3807'
quality_controlled: 0
status: public
title: 'The power of linear programming for valued CSPs: a constructive characterization'
type: report
year: '2012'
...
---
_id: '2937'
abstract:
- lang: eng
text: Developers building cryptography into security-sensitive applications face
a daunting task. Not only must they understand the security guarantees delivered
by the constructions they choose, they must also implement and combine them correctly
and efficiently. Cryptographic compilers free developers from this task by turning
high-level specifications of security goals into efficient implementations. Yet,
trusting such tools is hard as they rely on complex mathematical machinery and
claim security properties that are subtle and difficult to verify. In this paper
we present ZKCrypt, an optimizing cryptographic compiler achieving an unprecedented
level of assurance without sacrificing practicality for a comprehensive class
of cryptographic protocols, known as Zero-Knowledge Proofs of Knowledge. The pipeline
of ZKCrypt integrates purpose-built verified compilers and verifying compilers
producing formal proofs in the CertiCrypt framework. By combining the guarantees
delivered by each stage, ZKCrypt provides assurance that the output implementation
securely realizes the abstract proof goal given as input. We report on the main
characteristics of ZKCrypt, highlight new definitions and concepts at its foundations,
and illustrate its applicability through a representative example of an anonymous
credential system.
acknowledgement: This work was partially funded by National Funds through the FCT
- Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and
Technology) within project ENI-AC/2224/2009, by ENIAC Joint Undertaking under grant
agreement number 120224, European Projects FP7-256980 NESSoS and FP7-229599 AMAROUT,
Spanish National project TIN2009-14599 DESAFIOS 10, and Madrid Regional project
S2009TIC-1465 PROMETIDOS.
author:
- first_name: José
full_name: Almeida, José
last_name: Almeida
- first_name: Manuel
full_name: Barbosa, Manuel
last_name: Barbosa
- first_name: Endre
full_name: Bangerter, Endre
last_name: Bangerter
- first_name: Gilles
full_name: Barthe, Gilles
last_name: Barthe
- first_name: Stephan
full_name: Krenn, Stephan
id: 329FCCF0-F248-11E8-B48F-1D18A9856A87
last_name: Krenn
orcid: 0000-0003-2835-9093
- first_name: Santiago
full_name: Béguelin, Santiago
last_name: Béguelin
citation:
ama: 'Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. Full proof
cryptography: Verifiable compilation of efficient zero-knowledge protocols. In:
Proceedings of the 2012 ACM Conference on Computer and Communications Security.
ACM; 2012:488-500. doi:10.1145/2382196.2382249'
apa: 'Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., & Béguelin,
S. (2012). Full proof cryptography: Verifiable compilation of efficient zero-knowledge
protocols. In Proceedings of the 2012 ACM conference on Computer and communications
security (pp. 488–500). Raleigh, NC, USA: ACM. https://doi.org/10.1145/2382196.2382249'
chicago: 'Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan
Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation
of Efficient Zero-Knowledge Protocols.” In Proceedings of the 2012 ACM Conference
on Computer and Communications Security, 488–500. ACM, 2012. https://doi.org/10.1145/2382196.2382249.'
ieee: 'J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, and S. Béguelin,
“Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols,”
in Proceedings of the 2012 ACM conference on Computer and communications security,
Raleigh, NC, USA, 2012, pp. 488–500.'
ista: 'Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. 2012. Full
proof cryptography: Verifiable compilation of efficient zero-knowledge protocols.
Proceedings of the 2012 ACM conference on Computer and communications security.
CCS: Computer and Communications Security, 488–500.'
mla: 'Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of
Efficient Zero-Knowledge Protocols.” Proceedings of the 2012 ACM Conference
on Computer and Communications Security, ACM, 2012, pp. 488–500, doi:10.1145/2382196.2382249.'
short: J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, S. Béguelin, in:,
Proceedings of the 2012 ACM Conference on Computer and Communications Security,
ACM, 2012, pp. 488–500.
conference:
end_date: 2012-10-18
location: Raleigh, NC, USA
name: 'CCS: Computer and Communications Security'
start_date: 2012-10-16
date_created: 2018-12-11T12:00:26Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:39:53Z
day: '01'
department:
- _id: KrPi
doi: 10.1145/2382196.2382249
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2012/258
month: '10'
oa: 1
oa_version: Submitted Version
page: 488 - 500
publication: Proceedings of the 2012 ACM conference on Computer and communications
security
publication_status: published
publisher: ACM
publist_id: '3798'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Full proof cryptography: Verifiable compilation of efficient zero-knowledge
protocols'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...