---
_id: '507'
abstract:
- lang: eng
text: Fertilization in flowering plants requires the temporal and spatial coordination
of many developmental processes, including pollen production, anther dehiscence,
ovule production, and pollen tube elongation. However, it remains elusive as to
how this coordination occurs during reproduction. Here, we present evidence that
endocytosis, involving heterotetrameric adaptor protein complex 2 (AP-2), plays
a crucial role in fertilization. An Arabidopsis thaliana mutant ap2m displays
multiple defects in pollen production and viability, as well as elongation of
staminal filaments and pollen tubes, all of which are pivotal processes needed
for fertilization. Of these abnormalities, the defects in elongation of staminal
filaments and pollen tubes were partially rescued by exogenous auxin. Moreover,
DR5rev:GFP (for green fluorescent protein) expression was greatly reduced in filaments
and anthers in ap2m mutant plants. At the cellular level, ap2m mutants displayed
defects in both endocytosis of N-(3-triethylammonium-propyl)-4- (4-diethylaminophenylhexatrienyl)
pyridinium dibromide, a lypophilic dye used as an endocytosis marker, and polar
localization of auxin-efflux carrier PIN FORMED2 (PIN2) in the stamen filaments.
Moreover, these defects were phenocopied by treatment with Tyrphostin A23, an
inhibitor of endocytosis. Based on these results, we propose that AP-2-dependent
endocytosis plays a crucial role in coordinating the multiple developmental aspects
of male reproductive organs by modulating cellular auxin level through the regulation
of the amount and polarity of PINs.
author:
- first_name: Soo
full_name: Kim, Soo
last_name: Kim
- first_name: Zheng
full_name: Xu, Zheng
last_name: Xu
- first_name: Kyungyoung
full_name: Song, Kyungyoung
last_name: Song
- first_name: Dae
full_name: Kim, Dae
last_name: Kim
- first_name: Hyangju
full_name: Kang, Hyangju
last_name: Kang
- first_name: Ilka
full_name: Reichardt, Ilka
last_name: Reichardt
- first_name: Eun
full_name: Sohn, Eun
last_name: Sohn
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Gerd
full_name: Juergens, Gerd
last_name: Juergens
- first_name: Inhwan
full_name: Hwang, Inhwan
last_name: Hwang
citation:
ama: Kim S, Xu Z, Song K, et al. Adaptor protein complex 2-mediated endocytosis
is crucial for male reproductive organ development in arabidopsis. Plant Cell.
2013;25(8):2970-2985. doi:10.1105/tpc.113.114264
apa: Kim, S., Xu, Z., Song, K., Kim, D., Kang, H., Reichardt, I., … Hwang, I. (2013).
Adaptor protein complex 2-mediated endocytosis is crucial for male reproductive
organ development in arabidopsis. Plant Cell. American Society of Plant
Biologists. https://doi.org/10.1105/tpc.113.114264
chicago: Kim, Soo, Zheng Xu, Kyungyoung Song, Dae Kim, Hyangju Kang, Ilka Reichardt,
Eun Sohn, Jiří Friml, Gerd Juergens, and Inhwan Hwang. “Adaptor Protein Complex
2-Mediated Endocytosis Is Crucial for Male Reproductive Organ Development in Arabidopsis.”
Plant Cell. American Society of Plant Biologists, 2013. https://doi.org/10.1105/tpc.113.114264.
ieee: S. Kim et al., “Adaptor protein complex 2-mediated endocytosis is crucial
for male reproductive organ development in arabidopsis,” Plant Cell, vol.
25, no. 8. American Society of Plant Biologists, pp. 2970–2985, 2013.
ista: Kim S, Xu Z, Song K, Kim D, Kang H, Reichardt I, Sohn E, Friml J, Juergens
G, Hwang I. 2013. Adaptor protein complex 2-mediated endocytosis is crucial for
male reproductive organ development in arabidopsis. Plant Cell. 25(8), 2970–2985.
mla: Kim, Soo, et al. “Adaptor Protein Complex 2-Mediated Endocytosis Is Crucial
for Male Reproductive Organ Development in Arabidopsis.” Plant Cell, vol.
25, no. 8, American Society of Plant Biologists, 2013, pp. 2970–85, doi:10.1105/tpc.113.114264.
short: S. Kim, Z. Xu, K. Song, D. Kim, H. Kang, I. Reichardt, E. Sohn, J. Friml,
G. Juergens, I. Hwang, Plant Cell 25 (2013) 2970–2985.
date_created: 2018-12-11T11:46:52Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2021-01-12T08:01:12Z
day: '01'
department:
- _id: JiFr
doi: 10.1105/tpc.113.114264
external_id:
pmid:
- '23975898'
intvolume: ' 25'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3784592/
month: '08'
oa: 1
oa_version: Submitted Version
page: 2970 - 2985
pmid: 1
publication: Plant Cell
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '7312'
quality_controlled: '1'
scopus_import: 1
status: public
title: Adaptor protein complex 2-mediated endocytosis is crucial for male reproductive
organ development in arabidopsis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2013'
...
---
_id: '508'
abstract:
- lang: eng
text: The phagocyte NADPH oxidase catalyzes the reduction of O2 to reactive oxygen
species with microbicidal activity. It is composed of two membrane-spanning subunits,
gp91-phox and p22-phox (encoded by CYBB and CYBA, respectively), and three cytoplasmic
subunits, p40-phox, p47-phox, and p67-phox (encoded by NCF4, NCF1, and NCF2, respectively).
Mutations in any of these genes can result in chronic granulomatous disease, a
primary immunodeficiency characterized by recurrent infections. Using evolutionary
mapping, we determined that episodes of adaptive natural selection have shaped
the extracellular portion of gp91-phox during the evolution of mammals, which
suggests that this region may have a function in host-pathogen interactions. On
the basis of a resequencing analysis of approximately 35 kb of CYBB, CYBA, NCF2,
and NCF4 in 102 ethnically diverse individuals (24 of African ancestry, 31 of
European ancestry, 24 of Asian/Oceanians, and 23 US Hispanics), we show that the
pattern of CYBA diversity is compatible with balancing natural selection, perhaps
mediated by catalase-positive pathogens. NCF2 in Asian populations shows a pattern
of diversity characterized by a differentiated haplotype structure. Our study
provides insight into the role of pathogen-driven natural selection in an innate
immune pathway and sheds light on the role of CYBA in endothelial, nonphagocytic
NADPH oxidases, which are relevant in the pathogenesis of cardiovascular and other
complex diseases.
author:
- first_name: Eduardo
full_name: Tarazona Santos, Eduardo
last_name: Tarazona Santos
- first_name: Moara
full_name: Machado, Moara
last_name: Machado
- first_name: Wagner
full_name: Magalhães, Wagner
last_name: Magalhães
- first_name: Renee
full_name: Chen, Renee
last_name: Chen
- first_name: Fernanda
full_name: Lyon, Fernanda
last_name: Lyon
- first_name: Laurie
full_name: Burdett, Laurie
last_name: Burdett
- first_name: Andrew
full_name: Crenshaw, Andrew
last_name: Crenshaw
- first_name: Cristina
full_name: Fabbri, Cristina
last_name: Fabbri
- first_name: Latife
full_name: Pereira, Latife
last_name: Pereira
- first_name: Laelia
full_name: Pinto, Laelia
last_name: Pinto
- first_name: Rodrigo A
full_name: Fernandes Redondo, Rodrigo A
id: 409D5C96-F248-11E8-B48F-1D18A9856A87
last_name: Fernandes Redondo
orcid: 0000-0002-5837-2793
- first_name: Ben
full_name: Sestanovich, Ben
last_name: Sestanovich
- first_name: Meredith
full_name: Yeager, Meredith
last_name: Yeager
- first_name: Stephen
full_name: Chanock, Stephen
last_name: Chanock
citation:
ama: 'Tarazona Santos E, Machado M, Magalhães W, et al. Evolutionary dynamics of
the human NADPH oxidase genes CYBB, CYBA, NCF2, and NCF4: Functional implications.
Molecular Biology and Evolution. 2013;30(9):2157-2167. doi:10.1093/molbev/mst119'
apa: 'Tarazona Santos, E., Machado, M., Magalhães, W., Chen, R., Lyon, F., Burdett,
L., … Chanock, S. (2013). Evolutionary dynamics of the human NADPH oxidase genes
CYBB, CYBA, NCF2, and NCF4: Functional implications. Molecular Biology and
Evolution. Oxford University Press. https://doi.org/10.1093/molbev/mst119'
chicago: 'Tarazona Santos, Eduardo, Moara Machado, Wagner Magalhães, Renee Chen,
Fernanda Lyon, Laurie Burdett, Andrew Crenshaw, et al. “Evolutionary Dynamics
of the Human NADPH Oxidase Genes CYBB, CYBA, NCF2, and NCF4: Functional Implications.”
Molecular Biology and Evolution. Oxford University Press, 2013. https://doi.org/10.1093/molbev/mst119.'
ieee: 'E. Tarazona Santos et al., “Evolutionary dynamics of the human NADPH
oxidase genes CYBB, CYBA, NCF2, and NCF4: Functional implications,” Molecular
Biology and Evolution, vol. 30, no. 9. Oxford University Press, pp. 2157–2167,
2013.'
ista: 'Tarazona Santos E, Machado M, Magalhães W, Chen R, Lyon F, Burdett L, Crenshaw
A, Fabbri C, Pereira L, Pinto L, Fernandes Redondo RA, Sestanovich B, Yeager M,
Chanock S. 2013. Evolutionary dynamics of the human NADPH oxidase genes CYBB,
CYBA, NCF2, and NCF4: Functional implications. Molecular Biology and Evolution.
30(9), 2157–2167.'
mla: 'Tarazona Santos, Eduardo, et al. “Evolutionary Dynamics of the Human NADPH
Oxidase Genes CYBB, CYBA, NCF2, and NCF4: Functional Implications.” Molecular
Biology and Evolution, vol. 30, no. 9, Oxford University Press, 2013, pp.
2157–67, doi:10.1093/molbev/mst119.'
short: E. Tarazona Santos, M. Machado, W. Magalhães, R. Chen, F. Lyon, L. Burdett,
A. Crenshaw, C. Fabbri, L. Pereira, L. Pinto, R.A. Fernandes Redondo, B. Sestanovich,
M. Yeager, S. Chanock, Molecular Biology and Evolution 30 (2013) 2157–2167.
date_created: 2018-12-11T11:46:52Z
date_published: 2013-09-01T00:00:00Z
date_updated: 2021-01-12T08:01:12Z
day: '01'
department:
- _id: JoBo
doi: 10.1093/molbev/mst119
external_id:
pmid:
- '23821607'
intvolume: ' 30'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3748357/
month: '09'
oa: 1
oa_version: Submitted Version
page: 2157 - 2167
pmid: 1
publication: Molecular Biology and Evolution
publication_status: published
publisher: Oxford University Press
publist_id: '7310'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Evolutionary dynamics of the human NADPH oxidase genes CYBB, CYBA, NCF2, and
NCF4: Functional implications'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2013'
...
---
_id: '509'
abstract:
- lang: eng
text: 'Clathrin-mediated endocytosis (CME) regulates many aspects of plant development,
including hormone signaling and responses to environmental stresses. Despite the
importance of this process, the machinery that regulates CME in plants is largely
unknown. In mammals, the heterotetrameric ADAPTOR PROTEIN COMPLEX-2 (AP-2) is
required for the formation of clathrin-coated vesicles at the plasma membrane
(PM). Although the existence of AP-2 has been predicted in Arabidopsis thaliana,
the biochemistry and functionality of the complex is still uncharacterized. Here,
we identified all the subunits of the Arabidopsis AP-2 by tandem affinity purification
and found that one of the large AP-2 subunits, AP2A1, localized at the PM and
interacted with clathrin. Furthermore, endocytosis of the leucine-rich repeat
receptor kinase, BRASSINOSTEROID INSENSITIVE1 (BRI1), was shown to depend on AP-2.
Knockdown of the two Arabidopsis AP2A genes or overexpression of a dominant-negative
version of the medium AP-2 subunit, AP2M, impaired BRI1 endocytosis and enhanced
the brassinosteroid signaling. Our data reveal that the CME machinery in Arabidopsis
is evolutionarily conserved and that AP-2 functions in receptormediated endocytosis. '
author:
- first_name: Simone
full_name: Di Rubbo, Simone
last_name: Di Rubbo
- first_name: Niloufer
full_name: Irani, Niloufer
last_name: Irani
- first_name: Soo
full_name: Kim, Soo
last_name: Kim
- first_name: Zheng
full_name: Xu, Zheng
last_name: Xu
- first_name: Astrid
full_name: Gadeyne, Astrid
last_name: Gadeyne
- first_name: Wim
full_name: Dejonghe, Wim
last_name: Dejonghe
- first_name: Isabelle
full_name: Vanhoutte, Isabelle
last_name: Vanhoutte
- first_name: Geert
full_name: Persiau, Geert
last_name: Persiau
- first_name: Dominique
full_name: Eeckhout, Dominique
last_name: Eeckhout
- first_name: Sibu
full_name: Simon, Sibu
id: 4542EF9A-F248-11E8-B48F-1D18A9856A87
last_name: Simon
orcid: 0000-0002-1998-6741
- first_name: Kyungyoung
full_name: Song, Kyungyoung
last_name: Song
- first_name: Jürgen
full_name: Kleine Vehn, Jürgen
last_name: Kleine Vehn
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Geert
full_name: De Jaeger, Geert
last_name: De Jaeger
- first_name: Daniël
full_name: Van Damme, Daniël
last_name: Van Damme
- first_name: Inhwan
full_name: Hwang, Inhwan
last_name: Hwang
- first_name: Eugenia
full_name: Russinova, Eugenia
last_name: Russinova
citation:
ama: Di Rubbo S, Irani N, Kim S, et al. The clathrin adaptor complex AP-2 mediates
endocytosis of brassinosteroid INSENSITIVE1 in arabidopsis. Plant Cell.
2013;25(8):2986-2997. doi:10.1105/tpc.113.114058
apa: Di Rubbo, S., Irani, N., Kim, S., Xu, Z., Gadeyne, A., Dejonghe, W., … Russinova,
E. (2013). The clathrin adaptor complex AP-2 mediates endocytosis of brassinosteroid
INSENSITIVE1 in arabidopsis. Plant Cell. American Society of Plant Biologists.
https://doi.org/10.1105/tpc.113.114058
chicago: Di Rubbo, Simone, Niloufer Irani, Soo Kim, Zheng Xu, Astrid Gadeyne, Wim
Dejonghe, Isabelle Vanhoutte, et al. “The Clathrin Adaptor Complex AP-2 Mediates
Endocytosis of Brassinosteroid INSENSITIVE1 in Arabidopsis.” Plant Cell.
American Society of Plant Biologists, 2013. https://doi.org/10.1105/tpc.113.114058.
ieee: S. Di Rubbo et al., “The clathrin adaptor complex AP-2 mediates endocytosis
of brassinosteroid INSENSITIVE1 in arabidopsis,” Plant Cell, vol. 25, no.
8. American Society of Plant Biologists, pp. 2986–2997, 2013.
ista: Di Rubbo S, Irani N, Kim S, Xu Z, Gadeyne A, Dejonghe W, Vanhoutte I, Persiau
G, Eeckhout D, Simon S, Song K, Kleine Vehn J, Friml J, De Jaeger G, Van Damme
D, Hwang I, Russinova E. 2013. The clathrin adaptor complex AP-2 mediates endocytosis
of brassinosteroid INSENSITIVE1 in arabidopsis. Plant Cell. 25(8), 2986–2997.
mla: Di Rubbo, Simone, et al. “The Clathrin Adaptor Complex AP-2 Mediates Endocytosis
of Brassinosteroid INSENSITIVE1 in Arabidopsis.” Plant Cell, vol. 25, no.
8, American Society of Plant Biologists, 2013, pp. 2986–97, doi:10.1105/tpc.113.114058.
short: S. Di Rubbo, N. Irani, S. Kim, Z. Xu, A. Gadeyne, W. Dejonghe, I. Vanhoutte,
G. Persiau, D. Eeckhout, S. Simon, K. Song, J. Kleine Vehn, J. Friml, G. De Jaeger,
D. Van Damme, I. Hwang, E. Russinova, Plant Cell 25 (2013) 2986–2997.
date_created: 2018-12-11T11:46:52Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2021-01-12T08:01:13Z
day: '01'
department:
- _id: JiFr
doi: 10.1105/tpc.113.114058
external_id:
pmid:
- '23975899'
intvolume: ' 25'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3784593/
month: '08'
oa: 1
oa_version: Submitted Version
page: 2986 - 2997
pmid: 1
publication: Plant Cell
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '7311'
quality_controlled: '1'
scopus_import: 1
status: public
title: The clathrin adaptor complex AP-2 mediates endocytosis of brassinosteroid INSENSITIVE1
in arabidopsis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2013'
...
---
_id: '511'
abstract:
- lang: eng
text: The native auxin, indole-3-acetic acid (IAA), is a major regulator of plant
growth and development. Its nonuniform distribution between cells and tissues
underlies the spatiotemporal coordination of many developmental events and responses
to environmental stimuli. The regulation of auxin gradients and the formation
of auxin maxima/minima most likely involve the regulation of both metabolic and
transport processes. In this article, we have demonstrated that 2-oxindole-3-acetic
acid (oxIAA) is a major primary IAA catabolite formed in Arabidopsis thaliana
root tissues. OxIAA had little biological activity and was formed rapidly and
irreversibly in response to increases in auxin levels. We further showed that
there is cell type-specific regulation of oxIAA levels in the Arabidopsis root
apex. We propose that oxIAA is an important element in the regulation of output
from auxin gradients and, therefore, in the regulation of auxin homeostasis and
response mechanisms.
author:
- first_name: Aleš
full_name: Pěnčík, Aleš
last_name: Pěnčík
- first_name: Biljana
full_name: Simonovik, Biljana
last_name: Simonovik
- first_name: Sara
full_name: Petersson, Sara
last_name: Petersson
- first_name: Eva
full_name: Henyková, Eva
last_name: Henyková
- first_name: Sibu
full_name: Simon, Sibu
id: 4542EF9A-F248-11E8-B48F-1D18A9856A87
last_name: Simon
orcid: 0000-0002-1998-6741
- first_name: Kathleen
full_name: Greenham, Kathleen
last_name: Greenham
- first_name: Yi
full_name: Zhang, Yi
last_name: Zhang
- first_name: Mariusz
full_name: Kowalczyk, Mariusz
last_name: Kowalczyk
- first_name: Mark
full_name: Estelle, Mark
last_name: Estelle
- first_name: Eva
full_name: Zažímalová, Eva
last_name: Zažímalová
- first_name: Ondřej
full_name: Novák, Ondřej
last_name: Novák
- first_name: Göran
full_name: Sandberg, Göran
last_name: Sandberg
- first_name: Karin
full_name: Ljung, Karin
last_name: Ljung
citation:
ama: Pěnčík A, Simonovik B, Petersson S, et al. Regulation of auxin homeostasis
and gradients in Arabidopsis roots through the formation of the indole-3-acetic
acid catabolite 2-oxindole-3-acetic acid. Plant Cell. 2013;25(10):3858-3870.
doi:10.1105/tpc.113.114421
apa: Pěnčík, A., Simonovik, B., Petersson, S., Henyková, E., Simon, S., Greenham,
K., … Ljung, K. (2013). Regulation of auxin homeostasis and gradients in Arabidopsis
roots through the formation of the indole-3-acetic acid catabolite 2-oxindole-3-acetic
acid. Plant Cell. American Society of Plant Biologists. https://doi.org/10.1105/tpc.113.114421
chicago: Pěnčík, Aleš, Biljana Simonovik, Sara Petersson, Eva Henyková, Sibu Simon,
Kathleen Greenham, Yi Zhang, et al. “Regulation of Auxin Homeostasis and Gradients
in Arabidopsis Roots through the Formation of the Indole-3-Acetic Acid Catabolite
2-Oxindole-3-Acetic Acid.” Plant Cell. American Society of Plant Biologists,
2013. https://doi.org/10.1105/tpc.113.114421.
ieee: A. Pěnčík et al., “Regulation of auxin homeostasis and gradients in
Arabidopsis roots through the formation of the indole-3-acetic acid catabolite
2-oxindole-3-acetic acid,” Plant Cell, vol. 25, no. 10. American Society
of Plant Biologists, pp. 3858–3870, 2013.
ista: Pěnčík A, Simonovik B, Petersson S, Henyková E, Simon S, Greenham K, Zhang
Y, Kowalczyk M, Estelle M, Zažímalová E, Novák O, Sandberg G, Ljung K. 2013. Regulation
of auxin homeostasis and gradients in Arabidopsis roots through the formation
of the indole-3-acetic acid catabolite 2-oxindole-3-acetic acid. Plant Cell. 25(10),
3858–3870.
mla: Pěnčík, Aleš, et al. “Regulation of Auxin Homeostasis and Gradients in Arabidopsis
Roots through the Formation of the Indole-3-Acetic Acid Catabolite 2-Oxindole-3-Acetic
Acid.” Plant Cell, vol. 25, no. 10, American Society of Plant Biologists,
2013, pp. 3858–70, doi:10.1105/tpc.113.114421.
short: A. Pěnčík, B. Simonovik, S. Petersson, E. Henyková, S. Simon, K. Greenham,
Y. Zhang, M. Kowalczyk, M. Estelle, E. Zažímalová, O. Novák, G. Sandberg, K. Ljung,
Plant Cell 25 (2013) 3858–3870.
date_created: 2018-12-11T11:46:53Z
date_published: 2013-10-01T00:00:00Z
date_updated: 2021-01-12T08:01:15Z
day: '01'
department:
- _id: JiFr
doi: 10.1105/tpc.113.114421
external_id:
pmid:
- '24163311'
intvolume: ' 25'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: www.doi.org/10.1105/tpc.113.114421
month: '10'
oa: 1
oa_version: Published Version
page: 3858 - 3870
pmid: 1
publication: Plant Cell
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '7309'
quality_controlled: '1'
scopus_import: 1
status: public
title: Regulation of auxin homeostasis and gradients in Arabidopsis roots through
the formation of the indole-3-acetic acid catabolite 2-oxindole-3-acetic acid
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2013'
...
---
_id: '516'
abstract:
- lang: eng
text: In plants, changes in local auxin concentrations can trigger a range of developmental
processes as distinct tissues respond differently to the same auxin stimulus.
However, little is known about how auxin is interpreted by individual cell types.
We performed a transcriptomic analysis of responses to auxin within four distinct
tissues of the Arabidopsis thaliana root and demonstrate that different cell types
show competence for discrete responses. The majority of auxin‐responsive genes
displayed a spatial bias in their induction or repression. The novel data set
was used to examine how auxin influences tissue‐specific transcriptional regulation
of cell‐identity markers. Additionally, the data were used in combination with
spatial expression maps of the root to plot a transcriptomic auxin‐response gradient
across the apical and basal meristem. The readout revealed a strong correlation
for thousands of genes between the relative response to auxin and expression along
the longitudinal axis of the root. This data set and comparative analysis provide
a transcriptome‐level spatial breakdown of the response to auxin within an organ
where this hormone mediates many aspects of development.
article_number: '688'
article_processing_charge: No
author:
- first_name: Bastiaan
full_name: Bargmann, Bastiaan
last_name: Bargmann
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Gabriel
full_name: Krouk, Gabriel
last_name: Krouk
- first_name: Tal
full_name: Nawy, Tal
last_name: Nawy
- first_name: Idan
full_name: Efroni, Idan
last_name: Efroni
- first_name: Eilon
full_name: Shani, Eilon
last_name: Shani
- first_name: Goh
full_name: Choe, Goh
last_name: Choe
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Dominique
full_name: Bergmann, Dominique
last_name: Bergmann
- first_name: Mark
full_name: Estelle, Mark
last_name: Estelle
- first_name: Kenneth
full_name: Birnbaum, Kenneth
last_name: Birnbaum
citation:
ama: Bargmann B, Vanneste S, Krouk G, et al. A map of cell type‐specific auxin responses.
Molecular Systems Biology. 2013;9(1). doi:10.1038/msb.2013.40
apa: Bargmann, B., Vanneste, S., Krouk, G., Nawy, T., Efroni, I., Shani, E., … Birnbaum,
K. (2013). A map of cell type‐specific auxin responses. Molecular Systems Biology.
Nature Publishing Group. https://doi.org/10.1038/msb.2013.40
chicago: Bargmann, Bastiaan, Steffen Vanneste, Gabriel Krouk, Tal Nawy, Idan Efroni,
Eilon Shani, Goh Choe, et al. “A Map of Cell Type‐specific Auxin Responses.” Molecular
Systems Biology. Nature Publishing Group, 2013. https://doi.org/10.1038/msb.2013.40.
ieee: B. Bargmann et al., “A map of cell type‐specific auxin responses,”
Molecular Systems Biology, vol. 9, no. 1. Nature Publishing Group, 2013.
ista: Bargmann B, Vanneste S, Krouk G, Nawy T, Efroni I, Shani E, Choe G, Friml
J, Bergmann D, Estelle M, Birnbaum K. 2013. A map of cell type‐specific auxin
responses. Molecular Systems Biology. 9(1), 688.
mla: Bargmann, Bastiaan, et al. “A Map of Cell Type‐specific Auxin Responses.” Molecular
Systems Biology, vol. 9, no. 1, 688, Nature Publishing Group, 2013, doi:10.1038/msb.2013.40.
short: B. Bargmann, S. Vanneste, G. Krouk, T. Nawy, I. Efroni, E. Shani, G. Choe,
J. Friml, D. Bergmann, M. Estelle, K. Birnbaum, Molecular Systems Biology 9 (2013).
date_created: 2018-12-11T11:46:55Z
date_published: 2013-09-10T00:00:00Z
date_updated: 2021-01-12T08:01:17Z
day: '10'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1038/msb.2013.40
file:
- access_level: open_access
checksum: 9c4fbe793af4bb22b3fe50cc677a39bf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:46Z
date_updated: 2020-07-14T12:46:36Z
file_id: '4644'
file_name: IST-2018-936-v1+1_2008_Barton_A_map.pdf
file_size: 3257692
relation: main_file
file_date_updated: 2020-07-14T12:46:36Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '09'
oa: 1
oa_version: Published Version
publication: Molecular Systems Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '7303'
pubrep_id: '936'
quality_controlled: '1'
scopus_import: 1
status: public
title: A map of cell type‐specific auxin responses
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2013'
...
---
_id: '522'
abstract:
- lang: eng
text: Podoplanin, a mucin-like plasma membrane protein, is expressed by lymphatic
endothelial cells and responsible for separation of blood and lymphatic circulation
through activation of platelets. Here we show that podoplanin is also expressed
by thymic fibroblastic reticular cells (tFRC), a novel thymic medulla stroma cell
type associated with thymic conduits, and involved in development of natural regulatory
T cells (nTreg). Young mice deficient in podoplanin lack nTreg owing to retardation
of CD4+CD25+ thymocytes in the cortex and missing differentiation of Foxp3+ thymocytes
in the medulla. This might be due to CCL21 that delocalizes upon deletion of the
CCL21-binding podoplanin from medullar tFRC to cortex areas. The animals do not
remain devoid of nTreg but generate them delayed within the first month resulting
in Th2-biased hypergammaglobulinemia but not in the death-causing autoimmune phenotype
of Foxp3-deficient Scurfy mice.
author:
- first_name: Elke
full_name: Fuertbauer, Elke
last_name: Fuertbauer
- first_name: Jan
full_name: Zaujec, Jan
last_name: Zaujec
- first_name: Pavel
full_name: Uhrin, Pavel
last_name: Uhrin
- first_name: Ingrid
full_name: Raab, Ingrid
last_name: Raab
- first_name: Michele
full_name: Weber, Michele
id: 3A3FC708-F248-11E8-B48F-1D18A9856A87
last_name: Weber
- first_name: Helga
full_name: Schachner, Helga
last_name: Schachner
- first_name: Miroslav
full_name: Bauer, Miroslav
last_name: Bauer
- first_name: Gerhard
full_name: Schütz, Gerhard
last_name: Schütz
- first_name: Bernd
full_name: Binder, Bernd
last_name: Binder
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Dontscho
full_name: Kerjaschki, Dontscho
last_name: Kerjaschki
- first_name: Hannes
full_name: Stockinger, Hannes
last_name: Stockinger
citation:
ama: Fuertbauer E, Zaujec J, Uhrin P, et al. Thymic medullar conduits-associated
podoplanin promotes natural regulatory T cells. Immunology Letters. 2013;154(1-2):31-41.
doi:10.1016/j.imlet.2013.07.007
apa: Fuertbauer, E., Zaujec, J., Uhrin, P., Raab, I., Weber, M., Schachner, H.,
… Stockinger, H. (2013). Thymic medullar conduits-associated podoplanin promotes
natural regulatory T cells. Immunology Letters. Elsevier. https://doi.org/10.1016/j.imlet.2013.07.007
chicago: Fuertbauer, Elke, Jan Zaujec, Pavel Uhrin, Ingrid Raab, Michele Weber,
Helga Schachner, Miroslav Bauer, et al. “Thymic Medullar Conduits-Associated Podoplanin
Promotes Natural Regulatory T Cells.” Immunology Letters. Elsevier, 2013.
https://doi.org/10.1016/j.imlet.2013.07.007.
ieee: E. Fuertbauer et al., “Thymic medullar conduits-associated podoplanin
promotes natural regulatory T cells,” Immunology Letters, vol. 154, no.
1–2. Elsevier, pp. 31–41, 2013.
ista: Fuertbauer E, Zaujec J, Uhrin P, Raab I, Weber M, Schachner H, Bauer M, Schütz
G, Binder B, Sixt MK, Kerjaschki D, Stockinger H. 2013. Thymic medullar conduits-associated
podoplanin promotes natural regulatory T cells. Immunology Letters. 154(1–2),
31–41.
mla: Fuertbauer, Elke, et al. “Thymic Medullar Conduits-Associated Podoplanin Promotes
Natural Regulatory T Cells.” Immunology Letters, vol. 154, no. 1–2, Elsevier,
2013, pp. 31–41, doi:10.1016/j.imlet.2013.07.007.
short: E. Fuertbauer, J. Zaujec, P. Uhrin, I. Raab, M. Weber, H. Schachner, M. Bauer,
G. Schütz, B. Binder, M.K. Sixt, D. Kerjaschki, H. Stockinger, Immunology Letters
154 (2013) 31–41.
date_created: 2018-12-11T11:46:57Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2021-01-12T08:01:22Z
day: '01'
department:
- _id: MiSi
doi: 10.1016/j.imlet.2013.07.007
intvolume: ' 154'
issue: 1-2
language:
- iso: eng
month: '07'
oa_version: None
page: 31 - 41
publication: Immunology Letters
publication_status: published
publisher: Elsevier
publist_id: '7300'
quality_controlled: '1'
scopus_import: 1
status: public
title: Thymic medullar conduits-associated podoplanin promotes natural regulatory
T cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 154
year: '2013'
...
---
_id: '527'
abstract:
- lang: eng
text: The apical-basal axis of the early plant embryo determines the body plan of
the adult organism. To establish a polarized embryonic axis, plants evolved a
unique mechanism that involves directional, cell-to-cell transport of the growth
regulator auxin. Auxin transport relies on PIN auxin transporters [1], whose polar
subcellular localization determines the flow directionality. PIN-mediated auxin
transport mediates the spatial and temporal activity of the auxin response machinery
[2-7] that contributes to embryo patterning processes, including establishment
of the apical (shoot) and basal (root) embryo poles [8]. However, little is known
of upstream mechanisms guiding the (re)polarization of auxin fluxes during embryogenesis
[9]. Here, we developed a model of plant embryogenesis that correctly generates
emergent cell polarities and auxin-mediated sequential initiation of apical-basal
axis of plant embryo. The model relies on two precisely localized auxin sources
and a feedback between auxin and the polar, subcellular PIN transporter localization.
Simulations reproduced PIN polarity and auxin distribution, as well as previously
unknown polarization events during early embryogenesis. The spectrum of validated
model predictions suggests that our model corresponds to a minimal mechanistic
framework for initiation and orientation of the apical-basal axis to guide both
embryonic and postembryonic plant development.
author:
- first_name: Krzysztof T
full_name: Wabnik, Krzysztof T
id: 4DE369A4-F248-11E8-B48F-1D18A9856A87
last_name: Wabnik
orcid: 0000-0001-7263-0560
- first_name: Hélène
full_name: Robert, Hélène
last_name: Robert
- first_name: Richard
full_name: Smith, Richard
last_name: Smith
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Wabnik KT, Robert H, Smith R, Friml J. Modeling framework for the establishment
of the apical-basal embryonic axis in plants. Current Biology. 2013;23(24):2513-2518.
doi:10.1016/j.cub.2013.10.038
apa: Wabnik, K. T., Robert, H., Smith, R., & Friml, J. (2013). Modeling framework
for the establishment of the apical-basal embryonic axis in plants. Current
Biology. Cell Press. https://doi.org/10.1016/j.cub.2013.10.038
chicago: Wabnik, Krzysztof T, Hélène Robert, Richard Smith, and Jiří Friml. “Modeling
Framework for the Establishment of the Apical-Basal Embryonic Axis in Plants.”
Current Biology. Cell Press, 2013. https://doi.org/10.1016/j.cub.2013.10.038.
ieee: K. T. Wabnik, H. Robert, R. Smith, and J. Friml, “Modeling framework for the
establishment of the apical-basal embryonic axis in plants,” Current Biology,
vol. 23, no. 24. Cell Press, pp. 2513–2518, 2013.
ista: Wabnik KT, Robert H, Smith R, Friml J. 2013. Modeling framework for the establishment
of the apical-basal embryonic axis in plants. Current Biology. 23(24), 2513–2518.
mla: Wabnik, Krzysztof T., et al. “Modeling Framework for the Establishment of the
Apical-Basal Embryonic Axis in Plants.” Current Biology, vol. 23, no. 24,
Cell Press, 2013, pp. 2513–18, doi:10.1016/j.cub.2013.10.038.
short: K.T. Wabnik, H. Robert, R. Smith, J. Friml, Current Biology 23 (2013) 2513–2518.
date_created: 2018-12-11T11:46:58Z
date_published: 2013-12-16T00:00:00Z
date_updated: 2021-01-12T08:01:24Z
day: '16'
department:
- _id: EvBe
- _id: JiFr
doi: 10.1016/j.cub.2013.10.038
ec_funded: 1
intvolume: ' 23'
issue: '24'
language:
- iso: eng
month: '12'
oa_version: None
page: 2513 - 2518
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '7292'
quality_controlled: '1'
scopus_import: 1
status: public
title: Modeling framework for the establishment of the apical-basal embryonic axis
in plants
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2013'
...
---
_id: '528'
abstract:
- lang: eng
text: Establishment of the embryonic axis foreshadows the main body axis of adults
both in plants and in animals, but underlying mechanisms are considered distinct.
Plants utilize directional, cell-to-cell transport of the growth hormone auxin
[1, 2] to generate an asymmetric auxin response that specifies the embryonic apical-basal
axis [3-6]. The auxin flow directionality depends on the polarized subcellular
localization of PIN-FORMED (PIN) auxin transporters [7, 8]. It remains unknown
which mechanisms and spatial cues guide cell polarization and axis orientation
in early embryos. Herein, we provide conceptually novel insights into the formation
of embryonic axis in Arabidopsis by identifying a crucial role of localized tryptophan-dependent
auxin biosynthesis [9-12]. Local auxin production at the base of young embryos
and the accompanying PIN7-mediated auxin flow toward the proembryo are required
for the apical auxin response maximum and the specification of apical embryonic
structures. Later in embryogenesis, the precisely timed onset of localized apical
auxin biosynthesis mediates PIN1 polarization, basal auxin response maximum, and
specification of the root pole. Thus, the tight spatiotemporal control of distinct
local auxin sources provides a necessary, non-cell-autonomous trigger for the
coordinated cell polarization and subsequent apical-basal axis orientation during
embryogenesis and, presumably, also for other polarization events during postembryonic
plant life [13, 14].
author:
- first_name: Hélène
full_name: Robert, Hélène
last_name: Robert
- first_name: Peter
full_name: Grones, Peter
id: 399876EC-F248-11E8-B48F-1D18A9856A87
last_name: Grones
- first_name: Anna
full_name: Stepanova, Anna
last_name: Stepanova
- first_name: Linda
full_name: Robles, Linda
last_name: Robles
- first_name: Annemarie
full_name: Lokerse, Annemarie
last_name: Lokerse
- first_name: Jose
full_name: Alonso, Jose
last_name: Alonso
- first_name: Dolf
full_name: Weijers, Dolf
last_name: Weijers
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Robert H, Grones P, Stepanova A, et al. Local auxin sources orient the apical
basal axis in arabidopsis embryos. Current Biology. 2013;23(24):2506-2512.
doi:10.1016/j.cub.2013.09.039
apa: Robert, H., Grones, P., Stepanova, A., Robles, L., Lokerse, A., Alonso, J.,
… Friml, J. (2013). Local auxin sources orient the apical basal axis in arabidopsis
embryos. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2013.09.039
chicago: Robert, Hélène, Peter Grones, Anna Stepanova, Linda Robles, Annemarie Lokerse,
Jose Alonso, Dolf Weijers, and Jiří Friml. “Local Auxin Sources Orient the Apical
Basal Axis in Arabidopsis Embryos.” Current Biology. Cell Press, 2013.
https://doi.org/10.1016/j.cub.2013.09.039.
ieee: H. Robert et al., “Local auxin sources orient the apical basal axis
in arabidopsis embryos,” Current Biology, vol. 23, no. 24. Cell Press,
pp. 2506–2512, 2013.
ista: Robert H, Grones P, Stepanova A, Robles L, Lokerse A, Alonso J, Weijers D,
Friml J. 2013. Local auxin sources orient the apical basal axis in arabidopsis
embryos. Current Biology. 23(24), 2506–2512.
mla: Robert, Hélène, et al. “Local Auxin Sources Orient the Apical Basal Axis in
Arabidopsis Embryos.” Current Biology, vol. 23, no. 24, Cell Press, 2013,
pp. 2506–12, doi:10.1016/j.cub.2013.09.039.
short: H. Robert, P. Grones, A. Stepanova, L. Robles, A. Lokerse, J. Alonso, D.
Weijers, J. Friml, Current Biology 23 (2013) 2506–2512.
date_created: 2018-12-11T11:46:59Z
date_published: 2013-12-16T00:00:00Z
date_updated: 2021-01-12T08:01:25Z
day: '16'
department:
- _id: JiFr
doi: 10.1016/j.cub.2013.09.039
ec_funded: 1
intvolume: ' 23'
issue: '24'
language:
- iso: eng
month: '12'
oa_version: None
page: 2506 - 2512
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '7291'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local auxin sources orient the apical basal axis in arabidopsis embryos
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2013'
...
---
_id: '2181'
abstract:
- lang: eng
text: 'There is a trade-off between performance and correctness in implementing
concurrent data structures. Better performance may be achieved at the expense
of relaxing correctness, by redefining the semantics of data structures. We address
such a redefinition of data structure semantics and present a systematic and formal
framework for obtaining new data structures by quantitatively relaxing existing
ones. We view a data structure as a sequential specification S containing all
"legal" sequences over an alphabet of method calls. Relaxing the data
structure corresponds to defining a distance from any sequence over the alphabet
to the sequential specification: the k-relaxed sequential specification contains
all sequences over the alphabet within distance k from the original specification.
In contrast to other existing work, our relaxations are semantic (distance in
terms of data structure states). As an instantiation of our framework, we present
two simple yet generic relaxation schemes, called out-of-order and stuttering
relaxation, along with several ways of computing distances. We show that the out-of-order
relaxation, when further instantiated to stacks, queues, and priority queues,
amounts to tolerating bounded out-of-order behavior, which cannot be captured
by a purely syntactic relaxation (distance in terms of sequence manipulation,
e.g. edit distance). We give concurrent implementations of relaxed data structures
and demonstrate that bounded relaxations provide the means for trading correctness
for performance in a controlled way. The relaxations are monotonic which further
highlights the trade-off: increasing k increases the number of permitted sequences,
which as we demonstrate can lead to better performance. Finally, since a relaxed
stack or queue also implements a pool, we actually have new concurrent pool implementations
that outperform the state-of-the-art ones.'
acknowledgement: ' and an Elise Richter Fellowship (Austrian Science Fund V00125). '
author:
- 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: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Hannes
full_name: Payer, Hannes
last_name: Payer
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
citation:
ama: 'Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation
of concurrent data structures. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Language. ACM; 2013:317-328. doi:10.1145/2429069.2429109'
apa: 'Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., & Sokolova, A. (2013).
Quantitative relaxation of concurrent data structures. In Proceedings of the
40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language
(pp. 317–328). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429109'
chicago: Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana
Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In Proceedings
of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language,
317–28. ACM, 2013. https://doi.org/10.1145/2429069.2429109.
ieee: T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative
relaxation of concurrent data structures,” in Proceedings of the 40th annual
ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome,
Italy, 2013, pp. 317–328.
ista: 'Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative
relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT
symposium on Principles of programming language. POPL: Principles of Programming
Languages, 317–328.'
mla: Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.”
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of
Programming Language, ACM, 2013, pp. 317–28, doi:10.1145/2429069.2429109.
short: T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings
of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language,
ACM, 2013, pp. 317–328.
conference:
end_date: 2013-01-25
location: Rome, Italy
name: 'POPL: Principles of Programming Languages'
start_date: 2013-01-23
date_created: 2018-12-11T11:56:11Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2023-02-21T16:06:49Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.1145/2429069.2429109
ec_funded: 1
file:
- access_level: open_access
checksum: adf465e70948f4e80e48057524516456
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:33Z
date_updated: 2020-07-14T12:45:31Z
file_id: '5086'
file_name: IST-2014-198-v1+1_popl128-henzinger-clean.pdf
file_size: 294689
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 317 - 328
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles
of programming language
publication_identifier:
isbn:
- 978-1-4503-1832-7
publication_status: published
publisher: ACM
publist_id: '4801'
pubrep_id: '198'
quality_controlled: '1'
related_material:
record:
- id: '10901'
relation: later_version
status: deleted
scopus_import: 1
status: public
title: Quantitative relaxation of concurrent data structures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2182'
abstract:
- lang: eng
text: We propose a general framework for abstraction with respect to quantitative
properties, such as worst-case execution time, or power consumption. Our framework
provides a systematic way for counter-example guided abstraction refinement for
quantitative properties. The salient aspect of the framework is that it allows
anytime verification, that is, verification algorithms that can be stopped at
any time (for example, due to exhaustion of memory), and report approximations
that improve monotonically when the algorithms are given more time. We instantiate
the framework with a number of quantitative abstractions and refinement schemes,
which differ in terms of how much quantitative information they keep from the
original system. We introduce both state-based and trace-based quantitative abstractions,
and we describe conditions that define classes of quantitative properties for
which the abstractions provide over-approximations. We give algorithms for evaluating
the quantitative properties on the abstract systems. We present algorithms for
counter-example based refinements for quantitative properties for both state-based
and segment-based abstractions. We perform a case study on worst-case execution
time of executables to evaluate the anytime verification aspect and the quantitative
abstractions we proposed.
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- 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, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement.
In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles
of Programming Language. ACM; 2013:115-128. doi:10.1145/2429069.2429085'
apa: 'Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2013). Quantitative abstraction
refinement. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium
on Principles of programming language (pp. 115–128). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429085'
chicago: Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative
Abstraction Refinement.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Language, 115–28. ACM, 2013. https://doi.org/10.1145/2429069.2429085.
ieee: P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction
refinement,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium
on Principles of programming language, Rome, Italy, 2013, pp. 115–128.
ista: 'Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement.
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming
language. POPL: Principles of Programming Languages, 115–128.'
mla: Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” Proceedings
of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language,
ACM, 2013, pp. 115–28, doi:10.1145/2429069.2429085.
short: P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013,
pp. 115–128.
conference:
end_date: 2013-01-25
location: Rome, Italy
name: 'POPL: Principles of Programming Languages'
start_date: 2013-07-23
date_created: 2018-12-11T11:56:11Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:50Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2429069.2429085
ec_funded: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 115 - 128
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles
of programming language
publication_status: published
publisher: ACM
publist_id: '4800'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantitative abstraction refinement
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2209'
abstract:
- lang: eng
text: "A straight skeleton is a well-known geometric structure, and several algorithms
exist to construct the straight skeleton for a given polygon or planar straight-line
graph. In this paper, we ask the reverse question: Given the straight skeleton
(in form of a planar straight-line graph, with some rays to infinity), can we
reconstruct a planar straight-line graph for which this was the straight skeleton?
We show how to reduce this problem to the problem of finding a line that intersects
a set of convex polygons. We can find these convex polygons and all such lines
in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number
of edges of the input graph. We also explain how our approach can be used for
recognizing Voronoi diagrams of points, thereby completing a partial solution
provided by Ash and Bolker in 1985.\r\n"
alternative_title:
- '2013 10th International Symposium on Voronoi Diagrams in Science and Engineering
(ISVD 2013) '
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
citation:
ama: 'Biedl T, Held M, Huber S. Recognizing straight skeletons and Voronoi diagrams
and reconstructing their input. In: IEEE; 2013:37-46. doi:10.1109/ISVD.2013.11'
apa: 'Biedl, T., Held, M., & Huber, S. (2013). Recognizing straight skeletons
and Voronoi diagrams and reconstructing their input (pp. 37–46). Presented at
the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia:
IEEE. https://doi.org/10.1109/ISVD.2013.11'
chicago: Biedl, Therese, Martin Held, and Stefan Huber. “Recognizing Straight Skeletons
and Voronoi Diagrams and Reconstructing Their Input,” 37–46. IEEE, 2013. https://doi.org/10.1109/ISVD.2013.11.
ieee: 'T. Biedl, M. Held, and S. Huber, “Recognizing straight skeletons and Voronoi
diagrams and reconstructing their input,” presented at the ISVD: Voronoi Diagrams
in Science and Engineering, St. Petersburg, Russia, 2013, pp. 37–46.'
ista: 'Biedl T, Held M, Huber S. 2013. Recognizing straight skeletons and Voronoi
diagrams and reconstructing their input. ISVD: Voronoi Diagrams in Science and
Engineering, 2013 10th International Symposium on Voronoi Diagrams in Science
and Engineering (ISVD 2013) , , 37–46.'
mla: Biedl, Therese, et al. Recognizing Straight Skeletons and Voronoi Diagrams
and Reconstructing Their Input. IEEE, 2013, pp. 37–46, doi:10.1109/ISVD.2013.11.
short: T. Biedl, M. Held, S. Huber, in:, IEEE, 2013, pp. 37–46.
conference:
end_date: 2013-07-10
location: St. Petersburg, Russia
name: 'ISVD: Voronoi Diagrams in Science and Engineering'
start_date: 2013-07-08
date_created: 2018-12-11T11:56:20Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2021-01-12T06:56:00Z
day: '01'
department:
- _id: HeEd
doi: 10.1109/ISVD.2013.11
language:
- iso: eng
month: '12'
oa_version: None
page: 37 - 46
publication_identifier:
eisbn:
- '978-0-7695-5037-4 '
publication_status: published
publisher: IEEE
publist_id: '4763'
quality_controlled: '1'
scopus_import: 1
status: public
title: Recognizing straight skeletons and Voronoi diagrams and reconstructing their
input
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2210'
abstract:
- lang: eng
text: 'A straight skeleton is a well-known geometric structure, and several algorithms
exist to construct the straight skeleton for a given polygon. In this paper, we
ask the reverse question: Given the straight skeleton (in form of a tree with
a drawing in the plane, but with the exact position of the leaves unspecified),
can we reconstruct the polygon? We show that in most cases there exists at most
one polygon; in the remaining case there is an infinite number of polygons determined
by one angle that can range in an interval. We can find this (set of) polygon(s)
in linear time in the Real RAM computer model.'
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
citation:
ama: 'Biedl T, Held M, Huber S. Reconstructing polygons from embedded straight skeletons.
In: 29th European Workshop on Computational Geometry. TU Braunschweig;
2013:95-98.'
apa: 'Biedl, T., Held, M., & Huber, S. (2013). Reconstructing polygons from
embedded straight skeletons. In 29th European Workshop on Computational Geometry
(pp. 95–98). Braunschweig, Germany: TU Braunschweig.'
chicago: Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons
from Embedded Straight Skeletons.” In 29th European Workshop on Computational
Geometry, 95–98. TU Braunschweig, 2013.
ieee: T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight
skeletons,” in 29th European Workshop on Computational Geometry, Braunschweig,
Germany, 2013, pp. 95–98.
ista: 'Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight
skeletons. 29th European Workshop on Computational Geometry. EuroCG: European
Workshop on Computational Geometry, 95–98.'
mla: Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.”
29th European Workshop on Computational Geometry, TU Braunschweig, 2013,
pp. 95–98.
short: T. Biedl, M. Held, S. Huber, in:, 29th European Workshop on Computational
Geometry, TU Braunschweig, 2013, pp. 95–98.
conference:
end_date: 2013-03-20
location: Braunschweig, Germany
name: 'EuroCG: European Workshop on Computational Geometry'
start_date: 2013-03-17
date_created: 2018-12-11T11:56:21Z
date_published: 2013-03-01T00:00:00Z
date_updated: 2021-01-12T06:56:00Z
day: '01'
department:
- _id: HeEd
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf
month: '03'
oa: 1
oa_version: Submitted Version
page: 95 - 98
publication: 29th European Workshop on Computational Geometry
publication_status: published
publisher: TU Braunschweig
publist_id: '4762'
status: public
title: Reconstructing polygons from embedded straight skeletons
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2237'
abstract:
- lang: eng
text: We describe new extensions of the Vampire theorem prover for computing tree
interpolants. These extensions generalize Craig interpolation in Vampire, and
can also be used to derive sequence interpolants. We evaluated our implementation
on a large number of examples over the theory of linear integer arithmetic and
integer-indexed arrays, with and without quantifiers. When compared to other methods,
our experiments show that some examples could only be solved by our implementation.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Régis
full_name: Blanc, Régis
last_name: Blanc
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Laura
full_name: Kovács, Laura
last_name: Kovács
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
citation:
ama: Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181.
doi:10.1007/978-3-642-45221-5_13
apa: 'Blanc, R., Gupta, A., Kovács, L., & Kragl, B. (2013). Tree interpolation
in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence,
and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_13'
chicago: Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation
in Vampire.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_13.
ieee: R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,”
vol. 8312. Springer, pp. 173–181, 2013.
ista: Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire.
8312, 173–181.
mla: Blanc, Régis, et al. Tree Interpolation in Vampire. Vol. 8312, Springer,
2013, pp. 173–81, doi:10.1007/978-3-642-45221-5_13.
short: R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.
conference:
end_date: 2013-12-19
location: Stellenbosch, South Africa
name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning'
start_date: 2013-12-14
date_created: 2018-12-11T11:56:29Z
date_published: 2013-01-14T00:00:00Z
date_updated: 2020-08-11T10:09:42Z
day: '14'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-45221-5_13
file:
- access_level: open_access
checksum: 9cebaafca032e6769d273f393305c705
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T11:10:40Z
date_updated: 2020-07-14T12:45:34Z
file_id: '7858'
file_name: 2013_LPAR_Blanc.pdf
file_size: 279206
relation: main_file
file_date_updated: 2020-07-14T12:45:34Z
has_accepted_license: '1'
intvolume: ' 8312'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 173 - 181
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: '4724'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Tree interpolation in Vampire
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8312
year: '2013'
...
---
_id: '2238'
abstract:
- lang: eng
text: "We study the problem of achieving a given value in Markov decision processes
(MDPs) with several independent discounted reward objectives. We consider a generalised
version of discounted reward objectives, in which the amount of discounting depends
on the states visited and on the objective. This definition extends the usual
definition of discounted reward, and allows to capture the systems in which the
value of different commodities diminish at different and variable rates.\r\n\r\nWe
establish results for two prominent subclasses of the problem, namely state-discount
models where the discount factors are only dependent on the state of the MDP (and
independent of the objective), and reward-discount models where they are only
dependent on the objective (but not on the state of the MDP). For the state-discount
models we use a straightforward reduction to expected total reward and show that
the problem whether a value is achievable can be solved in polynomial time. For
the reward-discount model we show that memory and randomisation of the strategies
are required, but nevertheless that the problem is decidable and it is sufficient
to consider strategies which after a certain number of steps behave in a memoryless
way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e.
MDPs with no randomisation), pure strategies and discount factors of the form
1/n where n is an integer, the problem is in PSPACE and finite memory suffices
for achieving a given value. We also show that when the discount factors are not
of the form 1/n, the memory required by a strategy can be infinite.\r\n"
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: Vojtěch
full_name: Forejt, Vojtěch
last_name: Forejt
- first_name: Dominik
full_name: Wojtczak, Dominik
last_name: Wojtczak
citation:
ama: Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification
in graphs and MDPs. 2013;8312:228-242. doi:10.1007/978-3-642-45221-5_17
apa: 'Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted
reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming,
Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer.
https://doi.org/10.1007/978-3-642-45221-5_17'
chicago: Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective
Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer
Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_17.
ieee: K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward
verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.
ista: Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward
verification in graphs and MDPs. 8312, 228–242.
mla: Chatterjee, Krishnendu, et al. Multi-Objective Discounted Reward Verification
in Graphs and MDPs. Vol. 8312, Springer, 2013, pp. 228–42, doi:10.1007/978-3-642-45221-5_17.
short: K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.
conference:
end_date: 2013-12-19
location: Stellenbosch, South Africa
name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning'
start_date: 2013-12-14
date_created: 2018-12-11T11:56:30Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2020-08-11T10:09:42Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-45221-5_17
ec_funded: 1
intvolume: ' 8312'
language:
- iso: eng
month: '12'
oa_version: None
page: 228 - 242
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Springer
publist_id: '4723'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Multi-objective discounted reward verification in graphs and MDPs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8312
year: '2013'
...
---
_id: '2243'
abstract:
- lang: eng
text: We show that modal logic over universally first-order definable classes of
transitive frames is decidable. More precisely, let K be an arbitrary class of
transitive Kripke frames definable by a universal first-order sentence. We show
that the global and finite global satisfiability problems of modal logic over
K are decidable in NP, regardless of choice of K. We also show that the local
satisfiability and the finite local satisfiability problems of modal logic over
K are decidable in NEXPTIME.
alternative_title:
- LIPIcs
author:
- first_name: Jakub
full_name: Michaliszyn, Jakub
last_name: Michaliszyn
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Michaliszyn J, Otop J. Elementary modal logics over transitive structures.
2013;23:563-577. doi:10.4230/LIPIcs.CSL.2013.563
apa: 'Michaliszyn, J., & Otop, J. (2013). Elementary modal logics over transitive
structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.563'
chicago: Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive
Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.563.
ieee: J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,”
vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.
ista: Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures.
23, 563–577.
mla: Michaliszyn, Jakub, and Jan Otop. Elementary Modal Logics over Transitive
Structures. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013,
pp. 563–77, doi:10.4230/LIPIcs.CSL.2013.563.
short: J. Michaliszyn, J. Otop, 23 (2013) 563–577.
conference:
end_date: 2013-09-05
location: Torino, Italy
name: 'CSL: Computer Science Logic'
start_date: 2013-09-02
date_created: 2018-12-11T11:56:32Z
date_published: 2013-09-01T00:00:00Z
date_updated: 2020-08-11T10:09:42Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CSL.2013.563
ec_funded: 1
file:
- access_level: open_access
checksum: e0732e73a8b1e39483df7717d53e3e35
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:11Z
date_updated: 2020-07-14T12:45:34Z
file_id: '4929'
file_name: IST-2016-136-v1+2_39.pdf
file_size: 454915
relation: main_file
file_date_updated: 2020-07-14T12:45:34Z
has_accepted_license: '1'
intvolume: ' 23'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 563 - 577
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_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4708'
pubrep_id: '136'
quality_controlled: '1'
scopus_import: 1
series_title: Leibniz International Proceedings in Informatics
status: public
title: Elementary modal logics over transitive structures
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2013'
...
---
_id: '2244'
abstract:
- lang: eng
text: 'We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a
compact two-dimensional surface ℳ with boundary. Each αi and each βj is either
an arc meeting the boundary of ℳ at its two endpoints, or a closed curve. The
αi are pairwise disjoint except for possibly sharing endpoints, and similarly
for the βj. We want to "untangle" the βj from the αi by a self-homeomorphism
of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of
ℳ pointwise such that the total number of crossings of the αi with the φ(βj) is
as small as possible. This problem is motivated by an application in the algorithmic
theory of embeddings and 3-manifolds. We prove that if ℳ is planar, i.e., a sphere
with h ≥ 0 boundary components ("holes"), then O(mn) crossings can be
achieved (independently of h), which is asymptotically tight, as an easy lower
bound shows. In general, for an arbitrary (orientable or nonorientable) surface
ℳ with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an
O((m + n)4) upper bound, again independent of h and g. '
acknowledgement: We would like to thank the authors of [GHR13] for mak- ing a draft
of their paper available to us, and, in particular, T. Huynh for an e-mail correspondence.
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Jiří
full_name: Matoušek, Jiří
last_name: Matoušek
- first_name: Eric
full_name: Sedgwick, Eric
last_name: Sedgwick
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Matoušek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing
curves. 2013;8242:472-483. doi:10.1007/978-3-319-03841-4_41
apa: 'Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2013). Untangling
two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network
Visualization, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-319-03841-4_41'
chicago: Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling
Two Systems of Noncrossing Curves.” Lecture Notes in Computer Science. Springer,
2013. https://doi.org/10.1007/978-3-319-03841-4_41.
ieee: J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems
of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013.
ista: Matoušek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of
noncrossing curves. 8242, 472–483.
mla: Matoušek, Jiří, et al. Untangling Two Systems of Noncrossing Curves.
Vol. 8242, Springer, 2013, pp. 472–83, doi:10.1007/978-3-319-03841-4_41.
short: J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483.
conference:
end_date: 2013-09-25
location: Bordeaux, France
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2013-09-23
date_created: 2018-12-11T11:56:32Z
date_published: 2013-09-01T00:00:00Z
date_updated: 2023-02-21T17:03:07Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/978-3-319-03841-4_41
external_id:
arxiv:
- '1302.6475'
intvolume: ' 8242'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1302.6475
month: '09'
oa: 1
oa_version: Preprint
page: 472 - 483
project:
- _id: 25FA3206-B435-11E9-9278-68D0E5697425
grant_number: PP00P2_138948
name: 'Embeddings in Higher Dimensions: Algorithms and Combinatorics'
publication_status: published
publisher: Springer
publist_id: '4707'
quality_controlled: '1'
related_material:
record:
- id: '1411'
relation: later_version
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Untangling two systems of noncrossing curves
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8242
year: '2013'
...
---
_id: '2247'
abstract:
- lang: eng
text: Cooperative behavior, where one individual incurs a cost to help another,
is a wide spread phenomenon. Here we study direct reciprocity in the context of
the alternating Prisoner's Dilemma. We consider all strategies that can be implemented
by one and two-state automata. We calculate the payoff matrix of all pairwise
encounters in the presence of noise. We explore deterministic selection dynamics
with and without mutation. Using different error rates and payoff values, we observe
convergence to a small number of distinct equilibria. Two of them are uncooperative
strict Nash equilibria representing always-defect (ALLD) and Grim. The third equilibrium
is mixed and represents a cooperative alliance of several strategies, dominated
by a strategy which we call Forgiver. Forgiver cooperates whenever the opponent
has cooperated; it defects once when the opponent has defected, but subsequently
Forgiver attempts to re-establish cooperation even if the opponent has defected
again. Forgiver is not an evolutionarily stable strategy, but the alliance, which
it rules, is asymptotically stable. For a wide range of parameter values the most
commonly observed outcome is convergence to the mixed equilibrium, dominated by
Forgiver. Our results show that although forgiving might incur a short-term loss
it can lead to a long-term gain. Forgiveness facilitates stable cooperation in
the presence of exploitation and noise.
article_number: e80814
author:
- first_name: Benjamin
full_name: Zagorsky, Benjamin
last_name: Zagorsky
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Zagorsky B, Reiter J, Chatterjee K, Nowak M. Forgiver triumphs in alternating
prisoner’s dilemma . PLoS One. 2013;8(12). doi:10.1371/journal.pone.0080814
apa: Zagorsky, B., Reiter, J., Chatterjee, K., & Nowak, M. (2013). Forgiver
triumphs in alternating prisoner’s dilemma . PLoS One. Public Library of
Science. https://doi.org/10.1371/journal.pone.0080814
chicago: Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin
Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” PLoS One.
Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0080814.
ieee: B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in
alternating prisoner’s dilemma ,” PLoS One, vol. 8, no. 12. Public Library
of Science, 2013.
ista: Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating
prisoner’s dilemma . PLoS One. 8(12), e80814.
mla: Zagorsky, Benjamin, et al. “Forgiver Triumphs in Alternating Prisoner’s Dilemma
.” PLoS One, vol. 8, no. 12, e80814, Public Library of Science, 2013, doi:10.1371/journal.pone.0080814.
short: B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, PLoS One 8 (2013).
date_created: 2018-12-11T11:56:33Z
date_published: 2013-12-12T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '12'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1371/journal.pone.0080814
ec_funded: 1
file:
- access_level: open_access
checksum: 808e8b9e6e89658bee4ffbbfac1bd19d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:15Z
date_updated: 2020-07-14T12:45:34Z
file_id: '4868'
file_name: IST-2016-409-v1+1_journal.pone.0080814.pdf
file_size: 1050042
relation: main_file
file_date_updated: 2020-07-14T12:45:34Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
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: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '4702'
pubrep_id: '409'
quality_controlled: '1'
related_material:
record:
- id: '9749'
relation: research_data
status: public
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: 'Forgiver triumphs in alternating prisoner''s dilemma '
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2013'
...
---
_id: '2256'
abstract:
- lang: eng
text: Linked (Open) Data - bibliographic data on the Semantic Web. Report of the
Working Group on Linked Data to the plenary assembly of the Austrian Library Network
(translation of the title). Linked Data stands for a certain approach to publishing
data on the Web. The underlying idea is to harmonise heterogeneous data sources
of different origin in order to improve their accessibility and interoperability,
effectively making them queryable as a big distributed database. This report summarises
relevant developments in Europe as well as the Linked Data Working Group‘s strategic
and technical considerations regarding the publishing of the Austrian Library
Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement
that the implementation of Linked Data principles within the OBV can only be taken
into consideration accompanied by a discussion about the provision of the datasets
under a free license.
- lang: ger
text: "Linked Data steht für eine bestimmte Form der Veröffentlichung von Daten
via Internet. Die zu Grunde liegende Idee ist es, Daten verschiedenster Provenienz,
die derzeit teilweise gar nicht oder nur schwer zugänglich sind, in möglichst
\r\neinheitlicher Form miteinander zu verknüpfen und dadurch in ihrer Gesamtheit
abfragbar zu machen.\r\nDieser Bericht fasst die Entwicklungen im europäischen
Raum, sowie strategische und technische Überlegungen der AG Linked Data hinsichtlich
der Veröffentlichung von bibliothekarischen Daten des Österreichischen Bibliothekenverbundes
(OBV) zusammen und schließt mit der gemeinsamen Übereinkunft, dass die Umsetzung
von Linked Data-Prinzipien im OBV nur in Zusammenhang mit einer Diskussion über
die damit einhergehende Veröffentlichung der Daten unter einer freien Lizenz angedacht
werden sollte."
author:
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Doron
full_name: Goldfarb, Doron
last_name: Goldfarb
- first_name: Verena
full_name: Schaffner, Verena
last_name: Schaffner
- first_name: Wolfram
full_name: Seidler, Wolfram
last_name: Seidler
citation:
ama: Danowski P, Goldfarb D, Schaffner V, Seidler W. Linked (Open) Data - Bibliographische
Daten im Semantic Web. VÖB Mitteilungen. 2013;66(3/4):559-587.
apa: Danowski, P., Goldfarb, D., Schaffner, V., & Seidler, W. (2013). Linked
(Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen.
Verein Österreichischer Bibliothekarinnen und Bibliothekare.
chicago: Danowski, Patrick, Doron Goldfarb, Verena Schaffner, and Wolfram Seidler.
“Linked (Open) Data - Bibliographische Daten Im Semantic Web.” VÖB Mitteilungen.
Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013.
ieee: P. Danowski, D. Goldfarb, V. Schaffner, and W. Seidler, “Linked (Open) Data
- Bibliographische Daten im Semantic Web,” VÖB Mitteilungen, vol. 66, no.
3/4. Verein Österreichischer Bibliothekarinnen und Bibliothekare, pp. 559–587,
2013.
ista: Danowski P, Goldfarb D, Schaffner V, Seidler W. 2013. Linked (Open) Data -
Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 66(3/4), 559–587.
mla: Danowski, Patrick, et al. “Linked (Open) Data - Bibliographische Daten Im Semantic
Web.” VÖB Mitteilungen, vol. 66, no. 3/4, Verein Österreichischer Bibliothekarinnen
und Bibliothekare, 2013, pp. 559–87.
short: P. Danowski, D. Goldfarb, V. Schaffner, W. Seidler, VÖB Mitteilungen 66 (2013)
559–587.
date_created: 2018-12-11T11:56:36Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2021-01-12T06:56:20Z
day: '01'
ddc:
- '020'
department:
- _id: E-Lib
file:
- access_level: open_access
checksum: ae57ffcee3720adcc27b0f2767a1e04b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:09Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4669'
file_name: IST-2016-719-v1+1_Patrick_Danowski__Doron_Goldfarb__Verena_Schaffner__Wolfram_Seidler_Linked__Open__Data_Bibliographische_Daten_im_Semantic_Web.pdf
file_size: 881545
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 66'
issue: 3/4
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 559 - 587
popular_science: '1'
publication: VÖB Mitteilungen
publication_status: published
publisher: Verein Österreichischer Bibliothekarinnen und Bibliothekare
publist_id: '4690'
pubrep_id: '719'
status: public
title: Linked (Open) Data - Bibliographische Daten im Semantic Web
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2013'
...
---
_id: '2258'
abstract:
- lang: eng
text: "In a digital signature scheme with message recovery, rather than transmitting
the message m and its signature σ, a single enhanced signature τ is transmitted.
The verifier is able to recover m from τ and at the same time verify its authenticity.
The two most important parameters of such a scheme are its security and overhead
|τ| − |m|. A simple argument shows that for any scheme with “n bits security”
|τ| − |m| ≥ n, i.e., the overhead is lower bounded by the security parameter n.
Currently, the best known constructions in the random oracle model are far from
this lower bound requiring an overhead of n + logq h , where q h is the number
of queries to the random oracle. In this paper we give a construction which basically
matches the n bit lower bound. We propose a simple digital signature scheme with
n + o(logq h ) bits overhead, where q h denotes the number of random oracle queries.\r\n\r\nOur
construction works in two steps. First, we propose a signature scheme with message
recovery having optimal overhead in a new ideal model, the random invertible function
model. Second, we show that a four-round Feistel network with random oracles as
round functions is tightly “public-indifferentiable” from a random invertible
function. At the core of our indifferentiability proof is an almost tight upper
bound for the expected number of edges of the densest “small” subgraph of a random
Cayley graph, which may be of independent interest.\r\n"
alternative_title:
- LNCS
author:
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- 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: Mario
full_name: Szegedy, Mario
last_name: Szegedy
citation:
ama: Kiltz E, Pietrzak KZ, Szegedy M. Digital signatures with minimal overhead from
indifferentiable random invertible functions. 2013;8042:571-588. doi:10.1007/978-3-642-40041-4_31
apa: 'Kiltz, E., Pietrzak, K. Z., & Szegedy, M. (2013). Digital signatures with
minimal overhead from indifferentiable random invertible functions. Presented
at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United
States: Springer. https://doi.org/10.1007/978-3-642-40041-4_31'
chicago: Kiltz, Eike, Krzysztof Z Pietrzak, and Mario Szegedy. “Digital Signatures
with Minimal Overhead from Indifferentiable Random Invertible Functions.” Lecture
Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_31.
ieee: E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal
overhead from indifferentiable random invertible functions,” vol. 8042. Springer,
pp. 571–588, 2013.
ista: Kiltz E, Pietrzak KZ, Szegedy M. 2013. Digital signatures with minimal overhead
from indifferentiable random invertible functions. 8042, 571–588.
mla: Kiltz, Eike, et al. Digital Signatures with Minimal Overhead from Indifferentiable
Random Invertible Functions. Vol. 8042, Springer, 2013, pp. 571–88, doi:10.1007/978-3-642-40041-4_31.
short: E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.
conference:
end_date: 2013-08-22
location: Santa Barbara, CA, United States
name: 'CRYPTO: International Cryptology Conference'
start_date: 2013-08-18
date_created: 2018-12-11T11:56:37Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:21Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-642-40041-4_31
ec_funded: 1
file:
- access_level: open_access
checksum: 18a3f602cb41de184dc0e16a0e907633
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:20Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4744'
file_name: IST-2016-685-v1+1_658.pdf
file_size: 493175
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 8042'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 571 - 588
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: '4688'
pubrep_id: '685'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Digital signatures with minimal overhead from indifferentiable random invertible
functions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8042
year: '2013'
...
---
_id: '2259'
abstract:
- lang: eng
text: "The learning with rounding (LWR) problem, introduced by Banerjee, Peikert
and Rosen at EUROCRYPT ’12, is a variant of learning with errors (LWE), where
one replaces random errors with deterministic rounding. The LWR problem was shown
to be as hard as LWE for a setting of parameters where the modulus and modulus-to-error
ratio are super-polynomial. In this work we resolve the main open problem and
give a new reduction that works for a larger range of parameters, allowing for
a polynomial modulus and modulus-to-error ratio. In particular, a smaller modulus
gives us greater efficiency, and a smaller modulus-to-error ratio gives us greater
security, which now follows from the worst-case hardness of GapSVP with polynomial
(rather than super-polynomial) approximation factors.\r\n\r\nAs a tool in the
reduction, we show that there is a “lossy mode” for the LWR problem, in which
LWR samples only reveal partial information about the secret. This property gives
us several interesting new applications, including a proof that LWR remains secure
with weakly random secrets of sufficient min-entropy, and very simple constructions
of deterministic encryption, lossy trapdoor functions and reusable extractors.\r\n\r\nOur
approach is inspired by a technique of Goldwasser et al. from ICS ’10, which implicitly
showed the existence of a “lossy mode” for LWE. By refining this technique, we
also improve on the parameters of that work to only requiring a polynomial (instead
of super-polynomial) modulus and modulus-to-error ratio.\r\n"
alternative_title:
- LNCS
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Stephan
full_name: Krenn, Stephan
id: 329FCCF0-F248-11E8-B48F-1D18A9856A87
last_name: Krenn
orcid: 0000-0003-2835-9093
- 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: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Alwen JF, Krenn S, Pietrzak KZ, Wichs D. Learning with rounding, revisited:
New reduction properties and applications. 2013;8042(1):57-74. doi:10.1007/978-3-642-40041-4_4'
apa: 'Alwen, J. F., Krenn, S., Pietrzak, K. Z., & Wichs, D. (2013). Learning
with rounding, revisited: New reduction properties and applications. Presented
at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United
States: Springer. https://doi.org/10.1007/978-3-642-40041-4_4'
chicago: 'Alwen, Joel F, Stephan Krenn, Krzysztof Z Pietrzak, and Daniel Wichs.
“Learning with Rounding, Revisited: New Reduction Properties and Applications.”
Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_4.'
ieee: 'J. F. Alwen, S. Krenn, K. Z. Pietrzak, and D. Wichs, “Learning with rounding,
revisited: New reduction properties and applications,” vol. 8042, no. 1. Springer,
pp. 57–74, 2013.'
ista: 'Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited:
New reduction properties and applications. 8042(1), 57–74.'
mla: 'Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction
Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74,
doi:10.1007/978-3-642-40041-4_4.'
short: J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.
conference:
end_date: 2013-08-22
location: Santa Barbara, CA, United States
name: 'CRYPTO: International Cryptology Conference'
start_date: 2013-08-18
date_created: 2018-12-11T11:56:37Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:21Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-642-40041-4_4
ec_funded: 1
file:
- access_level: open_access
checksum: 16d428408a806b8e49eecc607deab115
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:55Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4912'
file_name: IST-2016-684-v1+1_098.pdf
file_size: 587898
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 8042'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 57 - 74
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: '4687'
pubrep_id: '684'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: 'Learning with rounding, revisited: New reduction properties and applications'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8042
year: '2013'
...