---
_id: '1359'
abstract:
- lang: eng
text: "The role of gene interactions in the evolutionary process has long\r\nbeen
controversial. Although some argue that they are not of\r\nimportance, because
most variation is additive, others claim that\r\ntheir effect in the long term
can be substantial. Here, we focus on\r\nthe long-term effects of genetic interactions
under directional\r\nselection assuming no mutation or dominance, and that epistasis
is\r\nsymmetrical overall. We ask by how much the mean of a complex\r\ntrait can
be increased by selection and analyze two extreme\r\nregimes, in which either
drift or selection dominate the dynamics\r\nof allele frequencies. In both scenarios,
epistatic interactions affect\r\nthe long-term response to selection by modulating
the additive\r\ngenetic variance. When drift dominates, we extend Robertson\r\n’\r\ns\r\n[Robertson
A (1960)\r\nProc R Soc Lond B Biol Sci\r\n153(951):234\r\n−\r\n249]\r\nargument
to show that, for any form of epistasis, the total response\r\nof a haploid population
is proportional to the initial total genotypic\r\nvariance. In contrast, the total
response of a diploid population is\r\nincreased by epistasis, for a given initial
genotypic variance. When\r\nselection dominates, we show that the total selection
response can\r\nonly be increased by epistasis when s\r\nome initially deleterious
alleles\r\nbecome favored as the genetic background changes. We find a sim-\r\nple
approximation for this effect and show that, in this regime, it is\r\nthe structure
of the genotype - phenotype map that matters and not\r\nthe variance components
of the population."
article_processing_charge: No
article_type: original
author:
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Paixao T, Barton NH. The effect of gene interactions on the long-term response
to selection. PNAS. 2016;113(16):4422-4427. doi:10.1073/pnas.1518830113
apa: Paixao, T., & Barton, N. H. (2016). The effect of gene interactions on
the long-term response to selection. PNAS. National Academy of Sciences.
https://doi.org/10.1073/pnas.1518830113
chicago: Paixao, Tiago, and Nicholas H Barton. “The Effect of Gene Interactions
on the Long-Term Response to Selection.” PNAS. National Academy of Sciences,
2016. https://doi.org/10.1073/pnas.1518830113.
ieee: T. Paixao and N. H. Barton, “The effect of gene interactions on the long-term
response to selection,” PNAS, vol. 113, no. 16. National Academy of Sciences,
pp. 4422–4427, 2016.
ista: Paixao T, Barton NH. 2016. The effect of gene interactions on the long-term
response to selection. PNAS. 113(16), 4422–4427.
mla: Paixao, Tiago, and Nicholas H. Barton. “The Effect of Gene Interactions on
the Long-Term Response to Selection.” PNAS, vol. 113, no. 16, National
Academy of Sciences, 2016, pp. 4422–27, doi:10.1073/pnas.1518830113.
short: T. Paixao, N.H. Barton, PNAS 113 (2016) 4422–4427.
corr_author: '1'
date_created: 2018-12-11T11:51:34Z
date_published: 2016-04-19T00:00:00Z
date_updated: 2026-06-18T17:31:02Z
day: '19'
ddc:
- '570'
department:
- _id: NiBa
- _id: CaGu
doi: 10.1073/pnas.1518830113
ec_funded: 1
external_id:
isi:
- '000374393800056'
pmid:
- '27044080'
intvolume: ' 113'
isi: 1
issue: '16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4843425/
month: '04'
oa: 1
oa_version: Published Version
page: 4422 - 4427
pmid: 1
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '5886'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The effect of gene interactions on the long-term response to selection
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2016'
...
---
_id: '1263'
abstract:
- lang: eng
text: Linking classical microwave electrical circuits to the optical telecommunication
band is at the core of modern communication. Future quantum information networks
will require coherent microwave-to-optical conversion to link electronic quantum
processors and memories via low-loss optical telecommunication networks. Efficient
conversion can be achieved with electro-optical modulators operating at the single
microwave photon level. In the standard electro-optic modulation scheme, this
is impossible because both up- and down-converted sidebands are necessarily present.
Here, we demonstrate true single-sideband up- or down-conversion in a triply resonant
whispering gallery mode resonator by explicitly addressing modes with asymmetric
free spectral range. Compared to previous experiments, we show a 3 orders of magnitude
improvement of the electro-optical conversion efficiency, reaching 0.1% photon
number conversion for a 10 GHz microwave tone at 0.42 mW of optical pump power.
The presented scheme is fully compatible with existing superconducting 3D circuit
quantum electrodynamics technology and can be used for nonclassical state conversion
and communication. Our conversion bandwidth is larger than 1 MHz and is not fundamentally
limited.
acknowledgement: Alexander von Humboldt Foundation; Studienstiftung des Deutschen
Volkes. We would like to acknowledge our stimulating discussions with Konrad Lehnert
and Alessandro Pitanti.
article_processing_charge: No
author:
- first_name: Alfredo
full_name: Rueda, Alfredo
last_name: Rueda
- first_name: Florian
full_name: Sedlmeir, Florian
last_name: Sedlmeir
- first_name: Michele
full_name: Collodo, Michele
last_name: Collodo
- first_name: Ulrich
full_name: Vogl, Ulrich
last_name: Vogl
- first_name: Birgit
full_name: Stiller, Birgit
last_name: Stiller
- first_name: Gerhard
full_name: Schunk, Gerhard
last_name: Schunk
- first_name: Dmitry
full_name: Strekalov, Dmitry
last_name: Strekalov
- first_name: Christoph
full_name: Marquardt, Christoph
last_name: Marquardt
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: Oskar
full_name: Painter, Oskar
last_name: Painter
- first_name: Gerd
full_name: Leuchs, Gerd
last_name: Leuchs
- first_name: Harald
full_name: Schwefel, Harald
last_name: Schwefel
citation:
ama: 'Rueda A, Sedlmeir F, Collodo M, et al. Efficient microwave to optical photon
conversion: An electro-optical realization. Optica. 2016;3(6):597-604.
doi:10.1364/OPTICA.3.000597'
apa: 'Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., …
Schwefel, H. (2016). Efficient microwave to optical photon conversion: An electro-optical
realization. Optica. Optica Publishing Group. https://doi.org/10.1364/OPTICA.3.000597'
chicago: 'Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit
Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Efficient Microwave to Optical
Photon Conversion: An Electro-Optical Realization.” Optica. Optica Publishing
Group, 2016. https://doi.org/10.1364/OPTICA.3.000597.'
ieee: 'A. Rueda et al., “Efficient microwave to optical photon conversion:
An electro-optical realization,” Optica, vol. 3, no. 6. Optica Publishing
Group, pp. 597–604, 2016.'
ista: 'Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D,
Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Efficient microwave
to optical photon conversion: An electro-optical realization. Optica. 3(6), 597–604.'
mla: 'Rueda, Alfredo, et al. “Efficient Microwave to Optical Photon Conversion:
An Electro-Optical Realization.” Optica, vol. 3, no. 6, Optica Publishing
Group, 2016, pp. 597–604, doi:10.1364/OPTICA.3.000597.'
short: A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov,
C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, Optica 3 (2016) 597–604.
date_created: 2018-12-11T11:51:01Z
date_published: 2016-06-20T00:00:00Z
date_updated: 2026-06-18T17:28:15Z
day: '20'
ddc:
- '580'
department:
- _id: JoFi
doi: 10.1364/OPTICA.3.000597
external_id:
isi:
- '000378847400007'
intvolume: ' 3'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1364/OPTICA.3.000597
month: '06'
oa: 1
oa_version: Published Version
page: 597 - 604
publication: Optica
publication_status: published
publisher: Optica Publishing Group
publist_id: '6061'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Efficient microwave to optical photon conversion: An electro-optical realization'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2016'
...
---
_id: '1321'
abstract:
- lang: eng
text: Most migrating cells extrude their front by the force of actin polymerization.
Polymerization requires an initial nucleation step, which is mediated by factors
establishing either parallel filaments in the case of filopodia or branched filaments
that form the branched lamellipodial network. Branches are considered essential
for regular cell motility and are initiated by the Arp2/3 complex, which in turn
is activated by nucleation-promoting factors of the WASP and WAVE families. Here
we employed rapid amoeboid crawling leukocytes and found that deletion of the
WAVE complex eliminated actin branching and thus lamellipodia formation. The cells
were left with parallel filaments at the leading edge, which translated, depending
on the differentiation status of the cell, into a unipolar pointed cell shape
or cells with multiple filopodia. Remarkably, unipolar cells migrated with increased
speed and enormous directional persistence, while they were unable to turn towards
chemotactic gradients. Cells with multiple filopodia retained chemotactic activity
but their migration was progressively impaired with increasing geometrical complexity
of the extracellular environment. These findings establish that diversified leading
edge protrusions serve as explorative structures while they slow down actual locomotion.
acknowledged_ssus:
- _id: SSU
acknowledgement: "This work was supported by the German Research Foundation (DFG)
Priority Program SP 1464 to T.E.B.S. and M.S., and European Research Council (ERC
GA 281556) and Human Frontiers Program grants to M.S.\r\nService Units of IST Austria
for excellent technical support."
article_processing_charge: No
article_type: original
author:
- first_name: Alexander F
full_name: Leithner, Alexander F
id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
last_name: Leithner
orcid: 0000-0002-1073-744X
- first_name: Alexander
full_name: Eichner, Alexander
id: 4DFA52AE-F248-11E8-B48F-1D18A9856A87
last_name: Eichner
- first_name: Jan
full_name: Müller, Jan
id: AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D
last_name: Müller
- first_name: Anne
full_name: Reversat, Anne
id: 35B76592-F248-11E8-B48F-1D18A9856A87
last_name: Reversat
orcid: 0000-0003-0666-8928
- first_name: Markus
full_name: Brown, Markus
id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Jan
full_name: Schwarz, Jan
id: 346C1EC6-F248-11E8-B48F-1D18A9856A87
last_name: Schwarz
- first_name: Jack
full_name: Merrin, Jack
id: 4515C308-F248-11E8-B48F-1D18A9856A87
last_name: Merrin
orcid: 0000-0001-5145-4609
- first_name: David
full_name: De Gorter, David
last_name: De Gorter
- first_name: Florian
full_name: Schur, Florian
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
- first_name: Jonathan
full_name: Bayerl, Jonathan
last_name: Bayerl
- first_name: Ingrid
full_name: De Vries, Ingrid
id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
last_name: De Vries
- first_name: Stefan
full_name: Wieser, Stefan
id: 355AA5A0-F248-11E8-B48F-1D18A9856A87
last_name: Wieser
orcid: 0000-0002-2670-2217
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Frank
full_name: Lai, Frank
last_name: Lai
- first_name: Markus
full_name: Moser, Markus
last_name: Moser
- first_name: Dontscho
full_name: Kerjaschki, Dontscho
last_name: Kerjaschki
- first_name: Klemens
full_name: Rottner, Klemens
last_name: Rottner
- first_name: Victor
full_name: Small, Victor
last_name: Small
- first_name: Theresia
full_name: Stradal, Theresia
last_name: Stradal
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Leithner AF, Eichner A, Müller J, et al. Diversified actin protrusions promote
environmental exploration but are dispensable for locomotion of leukocytes. Nature
Cell Biology. 2016;18:1253-1259. doi:10.1038/ncb3426
apa: Leithner, A. F., Eichner, A., Müller, J., Reversat, A., Brown, M., Schwarz,
J., … Sixt, M. K. (2016). Diversified actin protrusions promote environmental
exploration but are dispensable for locomotion of leukocytes. Nature Cell Biology.
Nature Publishing Group. https://doi.org/10.1038/ncb3426
chicago: Leithner, Alexander F, Alexander Eichner, Jan Müller, Anne Reversat, Markus
Brown, Jan Schwarz, Jack Merrin, et al. “Diversified Actin Protrusions Promote
Environmental Exploration but Are Dispensable for Locomotion of Leukocytes.” Nature
Cell Biology. Nature Publishing Group, 2016. https://doi.org/10.1038/ncb3426.
ieee: A. F. Leithner et al., “Diversified actin protrusions promote environmental
exploration but are dispensable for locomotion of leukocytes,” Nature Cell
Biology, vol. 18. Nature Publishing Group, pp. 1253–1259, 2016.
ista: Leithner AF, Eichner A, Müller J, Reversat A, Brown M, Schwarz J, Merrin J,
De Gorter D, Schur FK, Bayerl J, de Vries I, Wieser S, Hauschild R, Lai F, Moser
M, Kerjaschki D, Rottner K, Small V, Stradal T, Sixt MK. 2016. Diversified actin
protrusions promote environmental exploration but are dispensable for locomotion
of leukocytes. Nature Cell Biology. 18, 1253–1259.
mla: Leithner, Alexander F., et al. “Diversified Actin Protrusions Promote Environmental
Exploration but Are Dispensable for Locomotion of Leukocytes.” Nature Cell
Biology, vol. 18, Nature Publishing Group, 2016, pp. 1253–59, doi:10.1038/ncb3426.
short: A.F. Leithner, A. Eichner, J. Müller, A. Reversat, M. Brown, J. Schwarz,
J. Merrin, D. De Gorter, F.K. Schur, J. Bayerl, I. de Vries, S. Wieser, R. Hauschild,
F. Lai, M. Moser, D. Kerjaschki, K. Rottner, V. Small, T. Stradal, M.K. Sixt,
Nature Cell Biology 18 (2016) 1253–1259.
corr_author: '1'
date_created: 2018-12-11T11:51:21Z
date_published: 2016-10-24T00:00:00Z
date_updated: 2026-06-21T22:30:18Z
day: '24'
ddc:
- '570'
department:
- _id: MiSi
- _id: NanoFab
- _id: Bio
doi: 10.1038/ncb3426
ec_funded: 1
external_id:
isi:
- '000387165600018'
file:
- access_level: open_access
checksum: e1411cb7c99a2d9089c178a6abef25e7
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T16:33:46Z
date_updated: 2020-07-14T12:44:43Z
file_id: '7844'
file_name: 2018_NatureCell_Leithner.pdf
file_size: 4433280
relation: main_file
file_date_updated: 2020-07-14T12:44:43Z
has_accepted_license: '1'
intvolume: ' 18'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 1253 - 1259
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281556'
name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Nature Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '5949'
quality_controlled: '1'
related_material:
record:
- id: '323'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Diversified actin protrusions promote environmental exploration but are dispensable
for locomotion of leukocytes
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 18
year: '2016'
...
---
_id: '1183'
abstract:
- lang: eng
text: Autism spectrum disorders (ASD) are a group of genetic disorders often overlapping
with other neurological conditions. We previously described abnormalities in the
branched-chain amino acid (BCAA) catabolic pathway as a cause of ASD. Here, we
show that the solute carrier transporter 7a5 (SLC7A5), a large neutral amino acid
transporter localized at the blood brain barrier (BBB), has an essential role
in maintaining normal levels of brain BCAAs. In mice, deletion of Slc7a5 from
the endothelial cells of the BBB leads to atypical brain amino acid profile, abnormal
mRNA translation, and severe neurological abnormalities. Furthermore, we identified
several patients with autistic traits and motor delay carrying deleterious homozygous
mutations in the SLC7A5 gene. Finally, we demonstrate that BCAA intracerebroventricular
administration ameliorates abnormal behaviors in adult mutant mice. Our data elucidate
a neurological syndrome defined by SLC7A5 mutations and support an essential role
for the BCAA in human brain function.
acknowledgement: "This work was supported by NICHD (P01HD070494) and SFARI (grant
275275) to J.G.G., and FWF (SFB35_3523) to G.N.\r\nWe thank A.C. Manzano, Mike Liu,
and F. Marr for technical assistance, and R. Shigemoto and the IST Austria Electron
Microscopy (EM) Facility for assistance. We acknowledge support from CIDR for genome-wide
SNP analysis (X01HG008823) and Broad Institute Center for Mendelian Disorders (UM1HG008900
to D. MacArthur), the Yale Center for Mendelian Disorders (U54HG006504 to M.G.),
the Gregory M. Kiez and Mehmet Kutman Foundation (M.G.), Italian Ministry of Instruction
University and Research (PON01_00937 to C.I.), and NIH (R01-GM108911 to A.S.). This
work was supported by NICHD (P01HD070494) and SFARI (grant 275275) to J.G.G., and
FWF (SFB35_3523) to G.N.\r\n\r\n#EMFacility"
article_processing_charge: No
article_type: original
author:
- first_name: Dora-Clara
full_name: Tarlungeanu, Dora-Clara
id: 2ABCE612-F248-11E8-B48F-1D18A9856A87
last_name: Tarlungeanu
- first_name: Elena
full_name: Deliu, Elena
id: 37A40D7E-F248-11E8-B48F-1D18A9856A87
last_name: Deliu
orcid: 0000-0002-7370-5293
- first_name: Christoph
full_name: Dotter, Christoph
id: 4C66542E-F248-11E8-B48F-1D18A9856A87
last_name: Dotter
orcid: 0000-0002-9033-9096
- first_name: Majdi
full_name: Kara, Majdi
last_name: Kara
- first_name: Philipp
full_name: Janiesch, Philipp
last_name: Janiesch
- first_name: Mariafrancesca
full_name: Scalise, Mariafrancesca
last_name: Scalise
- first_name: Michele
full_name: Galluccio, Michele
last_name: Galluccio
- first_name: Mateja
full_name: Tesulov, Mateja
last_name: Tesulov
- first_name: Emanuela
full_name: Morelli, Emanuela
id: 3F4D1282-F248-11E8-B48F-1D18A9856A87
last_name: Morelli
- first_name: Fatma
full_name: Sönmez, Fatma
last_name: Sönmez
- first_name: Kaya
full_name: Bilgüvar, Kaya
last_name: Bilgüvar
- first_name: Ryuichi
full_name: Ohgaki, Ryuichi
last_name: Ohgaki
- first_name: Yoshikatsu
full_name: Kanai, Yoshikatsu
last_name: Kanai
- first_name: Anide
full_name: Johansen, Anide
last_name: Johansen
- first_name: Seham
full_name: Esharif, Seham
last_name: Esharif
- first_name: Tawfeg
full_name: Ben Omran, Tawfeg
last_name: Ben Omran
- first_name: Meral
full_name: Topcu, Meral
last_name: Topcu
- first_name: Avner
full_name: Schlessinger, Avner
last_name: Schlessinger
- first_name: Cesare
full_name: Indiveri, Cesare
last_name: Indiveri
- first_name: Kent
full_name: Duncan, Kent
last_name: Duncan
- first_name: Ahmet
full_name: Caglayan, Ahmet
last_name: Caglayan
- first_name: Murat
full_name: Günel, Murat
last_name: Günel
- first_name: Joseph
full_name: Gleeson, Joseph
last_name: Gleeson
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: Tarlungeanu D-C, Deliu E, Dotter C, et al. Impaired amino acid transport at
the blood brain barrier is a cause of autism spectrum disorder. Cell. 2016;167(6):1481-1494.
doi:10.1016/j.cell.2016.11.013
apa: Tarlungeanu, D.-C., Deliu, E., Dotter, C., Kara, M., Janiesch, P., Scalise,
M., … Novarino, G. (2016). Impaired amino acid transport at the blood brain barrier
is a cause of autism spectrum disorder. Cell. Cell Press. https://doi.org/10.1016/j.cell.2016.11.013
chicago: Tarlungeanu, Dora-Clara, Elena Deliu, Christoph Dotter, Majdi Kara, Philipp
Janiesch, Mariafrancesca Scalise, Michele Galluccio, et al. “Impaired Amino Acid
Transport at the Blood Brain Barrier Is a Cause of Autism Spectrum Disorder.”
Cell. Cell Press, 2016. https://doi.org/10.1016/j.cell.2016.11.013.
ieee: D.-C. Tarlungeanu et al., “Impaired amino acid transport at the blood
brain barrier is a cause of autism spectrum disorder,” Cell, vol. 167,
no. 6. Cell Press, pp. 1481–1494, 2016.
ista: Tarlungeanu D-C, Deliu E, Dotter C, Kara M, Janiesch P, Scalise M, Galluccio
M, Tesulov M, Morelli E, Sönmez F, Bilgüvar K, Ohgaki R, Kanai Y, Johansen A,
Esharif S, Ben Omran T, Topcu M, Schlessinger A, Indiveri C, Duncan K, Caglayan
A, Günel M, Gleeson J, Novarino G. 2016. Impaired amino acid transport at the
blood brain barrier is a cause of autism spectrum disorder. Cell. 167(6), 1481–1494.
mla: Tarlungeanu, Dora-Clara, et al. “Impaired Amino Acid Transport at the Blood
Brain Barrier Is a Cause of Autism Spectrum Disorder.” Cell, vol. 167,
no. 6, Cell Press, 2016, pp. 1481–94, doi:10.1016/j.cell.2016.11.013.
short: D.-C. Tarlungeanu, E. Deliu, C. Dotter, M. Kara, P. Janiesch, M. Scalise,
M. Galluccio, M. Tesulov, E. Morelli, F. Sönmez, K. Bilgüvar, R. Ohgaki, Y. Kanai,
A. Johansen, S. Esharif, T. Ben Omran, M. Topcu, A. Schlessinger, C. Indiveri,
K. Duncan, A. Caglayan, M. Günel, J. Gleeson, G. Novarino, Cell 167 (2016) 1481–1494.
date_created: 2018-12-11T11:50:35Z
date_published: 2016-12-01T00:00:00Z
date_updated: 2026-06-21T22:31:08Z
day: '01'
ddc:
- '576'
- '616'
department:
- _id: GaNo
doi: 10.1016/j.cell.2016.11.013
external_id:
isi:
- '000389470500012'
file:
- access_level: open_access
checksum: 7fe01ab12a6610d3db421e0136db2f77
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:44Z
date_updated: 2020-07-14T12:44:37Z
file_id: '5030'
file_name: IST-2017-771-v1+1_Tarlungeanu_et_al._Final_edited.pdf
file_size: 73907957
relation: main_file
file_date_updated: 2020-07-14T12:44:37Z
has_accepted_license: '1'
intvolume: ' 167'
isi: 1
issue: '6'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
page: 1481 - 1494
project:
- _id: 25473368-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: F03523
name: Transmembrane Transporters in Health and Disease
publication: Cell
publication_status: published
publisher: Cell Press
publist_id: '6170'
pubrep_id: '771'
quality_controlled: '1'
related_material:
record:
- id: '395'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Impaired amino acid transport at the blood brain barrier is a cause of autism
spectrum disorder
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 167
year: '2016'
...
---
_id: '1100'
abstract:
- lang: eng
text: During metazoan development, the temporal pattern of morphogen signaling is
critical for organizing cell fates in space and time. Yet, tools for temporally
controlling morphogen signaling within the embryo are still scarce. Here, we developed
a photoactivatable Nodal receptor to determine how the temporal pattern of Nodal
signaling affects cell fate specification during zebrafish gastrulation. By using
this receptor to manipulate the duration of Nodal signaling in vivo by light,
we show that extended Nodal signaling within the organizer promotes prechordal
plate specification and suppresses endoderm differentiation. Endoderm differentiation
is suppressed by extended Nodal signaling inducing expression of the transcriptional
repressor goosecoid (gsc) in prechordal plate progenitors, which in turn restrains
Nodal signaling from upregulating the endoderm differentiation gene sox17 within
these cells. Thus, optogenetic manipulation of Nodal signaling identifies a critical
role of Nodal signaling duration for organizer cell fate specification during
gastrulation.
acknowledged_ssus:
- _id: SSU
acknowledgement: 'We are grateful to members of the C.-P.H. and H.J. labs for discussions,
R. Hauschild and the different Scientific Service Units at IST Austria for technical
help, M. Dravecka for performing initial experiments, A. Schier for reading an earlier
version of the manuscript, K.W. Rogers for technical help, and C. Hill, A. Bruce,
and L. Solnica-Krezel for sending plasmids. This work was supported by grants from
the Austrian Science Foundation (FWF): (T560-B17) and (I 812-B12) to V.R. and C.-P.H.,
and from the European Union (EU FP7): (6275) to H.J. A.I.-P. is supported by a Ramon
Areces fellowship.'
article_processing_charge: No
author:
- first_name: Keisuke
full_name: Sako, Keisuke
id: 3BED66BE-F248-11E8-B48F-1D18A9856A87
last_name: Sako
orcid: 0000-0002-6453-8075
- first_name: Saurabh
full_name: Pradhan, Saurabh
last_name: Pradhan
- first_name: Vanessa
full_name: Barone, Vanessa
id: 419EECCC-F248-11E8-B48F-1D18A9856A87
last_name: Barone
orcid: 0000-0003-2676-3367
- first_name: Álvaro
full_name: Inglés Prieto, Álvaro
id: 2A9DB292-F248-11E8-B48F-1D18A9856A87
last_name: Inglés Prieto
orcid: 0000-0002-5409-8571
- first_name: Patrick
full_name: Mueller, Patrick
last_name: Mueller
- first_name: Verena
full_name: Ruprecht, Verena
id: 4D71A03A-F248-11E8-B48F-1D18A9856A87
last_name: Ruprecht
orcid: 0000-0003-4088-8633
- first_name: Daniel
full_name: Capek, Daniel
id: 31C42484-F248-11E8-B48F-1D18A9856A87
last_name: Capek
orcid: 0000-0001-5199-9940
- first_name: Sanjeev
full_name: Galande, Sanjeev
last_name: Galande
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Sako K, Pradhan S, Barone V, et al. Optogenetic control of nodal signaling
reveals a temporal pattern of nodal signaling regulating cell fate specification
during gastrulation. Cell Reports. 2016;16(3):866-877. doi:10.1016/j.celrep.2016.06.036
apa: Sako, K., Pradhan, S., Barone, V., Inglés Prieto, Á., Mueller, P., Ruprecht,
V., … Heisenberg, C.-P. J. (2016). Optogenetic control of nodal signaling reveals
a temporal pattern of nodal signaling regulating cell fate specification during
gastrulation. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2016.06.036
chicago: Sako, Keisuke, Saurabh Pradhan, Vanessa Barone, Álvaro Inglés Prieto, Patrick
Mueller, Verena Ruprecht, Daniel Capek, Sanjeev Galande, Harald L Janovjak, and
Carl-Philipp J Heisenberg. “Optogenetic Control of Nodal Signaling Reveals a Temporal
Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.”
Cell Reports. Cell Press, 2016. https://doi.org/10.1016/j.celrep.2016.06.036.
ieee: K. Sako et al., “Optogenetic control of nodal signaling reveals a temporal
pattern of nodal signaling regulating cell fate specification during gastrulation,”
Cell Reports, vol. 16, no. 3. Cell Press, pp. 866–877, 2016.
ista: Sako K, Pradhan S, Barone V, Inglés Prieto Á, Mueller P, Ruprecht V, Capek
D, Galande S, Janovjak HL, Heisenberg C-PJ. 2016. Optogenetic control of nodal
signaling reveals a temporal pattern of nodal signaling regulating cell fate specification
during gastrulation. Cell Reports. 16(3), 866–877.
mla: Sako, Keisuke, et al. “Optogenetic Control of Nodal Signaling Reveals a Temporal
Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.”
Cell Reports, vol. 16, no. 3, Cell Press, 2016, pp. 866–77, doi:10.1016/j.celrep.2016.06.036.
short: K. Sako, S. Pradhan, V. Barone, Á. Inglés Prieto, P. Mueller, V. Ruprecht,
D. Capek, S. Galande, H.L. Janovjak, C.-P.J. Heisenberg, Cell Reports 16 (2016)
866–877.
date_created: 2018-12-11T11:50:08Z
date_published: 2016-07-19T00:00:00Z
date_updated: 2026-06-21T22:31:19Z
day: '19'
ddc:
- '570'
- '576'
department:
- _id: CaHe
- _id: HaJa
doi: 10.1016/j.celrep.2016.06.036
ec_funded: 1
external_id:
isi:
- '000380264200024'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:04Z
date_updated: 2018-12-12T10:11:04Z
file_id: '4857'
file_name: IST-2017-754-v1+1_1-s2.0-S2211124716307768-main.pdf
file_size: 3921947
relation: main_file
file_date_updated: 2018-12-12T10:11:04Z
has_accepted_license: '1'
intvolume: ' 16'
isi: 1
issue: '3'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 866 - 877
project:
- _id: 2529486C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: T 560-B17
name: Cell- and Tissue Mechanics in Zebrafish Germ Layer Formation
- _id: 2527D5CC-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I812-B12
name: Cell Cortex and Germ Layer Formation in Zebrafish Gastrulation
- _id: 25548C20-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303564'
name: Microbial Ion Channels for Synthetic Neurobiology
publication: Cell Reports
publication_status: published
publisher: Cell Press
publist_id: '6275'
pubrep_id: '754'
quality_controlled: '1'
related_material:
record:
- id: '961'
relation: dissertation_contains
status: public
- id: '50'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Optogenetic control of nodal signaling reveals a temporal pattern of nodal
signaling regulating cell fate specification during gastrulation
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 16
year: '2016'
...
---
_id: '1437'
abstract:
- lang: eng
text: We study algorithmic questions for concurrent systems where the transitions
are labeled from a complete, closed semiring, and path properties are algebraic
with semiring operations. The algebraic path properties can model dataflow analysis
problems, the shortest path problem, and many other natural problems that arise
in program analysis. We consider that each component of the concurrent system
is a graph with constant treewidth, a property satisfied by the controlflow graphs
of most programs. We allow for multiple possible queries, which arise naturally
in demand driven dataflow analysis. The study of multiple queries allows us to
consider the tradeoff between the resource usage of the one-time preprocessing
and for each individual query. The traditional approach constructs the product
graph of all components and applies the best-known graph algorithm on the product.
In this approach, even the answer to a single query requires the transitive closure
(i.e., the results of all possible queries), which provides no room for tradeoff
between preprocessing and query time. Our main contributions are algorithms that
significantly improve the worst-case running time of the traditional approach,
and provide various tradeoffs depending on the number of queries. For example,
in a concurrent system of two components, the traditional approach requires hexic
time in the worst case for answering one query as well as computing the transitive
closure, whereas we show that with one-time preprocessing in almost cubic time,
each subsequent query can be answered in at most linear time, and even the transitive
closure can be computed in almost quartic time. Furthermore, we establish conditional
optimality results showing that the worst-case running time of our algorithms
cannot be improved without achieving major breakthroughs in graph algorithms (i.e.,
improving the worst-case bound for the shortest path problem in general graphs).
Preliminary experimental results show that our algorithms perform favorably on
several benchmarks.
alternative_title:
- POPL
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Algorithms for
algebraic path properties in concurrent systems of constant treewidth components.
In: Vol 20-22. ACM; 2016:733-747. doi:10.1145/2837614.2837624'
apa: 'Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A.
(2016). Algorithms for algebraic path properties in concurrent systems of constant
treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles
of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837624'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen,
and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent
Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. https://doi.org/10.1145/2837614.2837624.
ieee: 'K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms
for algebraic path properties in concurrent systems of constant treewidth components,”
presented at the POPL: Principles of Programming Languages, St. Petersburg, FL,
USA, 2016, vol. 20–22, pp. 733–747.'
ista: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms
for algebraic path properties in concurrent systems of constant treewidth components.
POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.'
mla: Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties
in Concurrent Systems of Constant Treewidth Components. Vol. 20–22, ACM, 2016,
pp. 733–47, doi:10.1145/2837614.2837624.
short: K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM,
2016, pp. 733–747.
conference:
end_date: 2016-01-22
location: St. Petersburg, FL, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2016-01-20
corr_author: '1'
date_created: 2018-12-11T11:52:01Z
date_published: 2016-01-11T00:00:00Z
date_updated: 2026-06-21T22:31:23Z
day: '11'
department:
- _id: KrCh
doi: 10.1145/2837614.2837624
ec_funded: 1
external_id:
arxiv:
- '1510.07565'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1510.07565
month: '01'
oa: 1
oa_version: Preprint
page: 733 - 747
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: ACM
publist_id: '5761'
quality_controlled: '1'
related_material:
record:
- id: '5441'
relation: earlier_version
status: public
- id: '5442'
relation: earlier_version
status: public
- id: '6009'
relation: later_version
status: public
- id: '821'
relation: dissertation_contains
status: public
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Algorithms for algebraic path properties in concurrent systems of constant
treewidth components
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20-22
year: '2016'
...
---
_id: '1386'
abstract:
- lang: eng
text: We consider nondeterministic probabilistic programs with the most basic liveness
property of termination. We present efficient methods for termination analysis
of nondeterministic probabilistic programs with polynomial guards and assignments.
Our approach is through synthesis of polynomial ranking supermartingales, that
on one hand significantly generalizes linear ranking supermartingales and on the
other hand is a counterpart of polynomial ranking-functions for proving termination
of nonprobabilistic programs. The approach synthesizes polynomial ranking-supermartingales
through Positivstellensatz's, yielding an efficient method which is not only sound,
but also semi-complete over a large subclass of programs. We show experimental
results to demonstrate that our approach can handle several classical programs
with complex polynomial guards and assignments, and can synthesize efficient quadratic
ranking-supermartingales when a linear one does not exist even for simple affine
programs.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
citation:
ama: 'Chatterjee K, Fu H, Goharshady AK. Termination analysis of probabilistic programs
through Positivstellensatz’s. In: Vol 9779. Springer; 2016:3-22. doi:10.1007/978-3-319-41528-4_1'
apa: 'Chatterjee, K., Fu, H., & Goharshady, A. K. (2016). Termination analysis
of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22).
Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer.
https://doi.org/10.1007/978-3-319-41528-4_1'
chicago: Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Termination
Analysis of Probabilistic Programs through Positivstellensatz’s,” 9779:3–22. Springer,
2016. https://doi.org/10.1007/978-3-319-41528-4_1.
ieee: 'K. Chatterjee, H. Fu, and A. K. Goharshady, “Termination analysis of probabilistic
programs through Positivstellensatz’s,” presented at the CAV: Computer Aided Verification,
Toronto, Canada, 2016, vol. 9779, pp. 3–22.'
ista: 'Chatterjee K, Fu H, Goharshady AK. 2016. Termination analysis of probabilistic
programs through Positivstellensatz’s. CAV: Computer Aided Verification, LNCS,
vol. 9779, 3–22.'
mla: Chatterjee, Krishnendu, et al. Termination Analysis of Probabilistic Programs
through Positivstellensatz’s. Vol. 9779, Springer, 2016, pp. 3–22, doi:10.1007/978-3-319-41528-4_1.
short: K. Chatterjee, H. Fu, A.K. Goharshady, in:, Springer, 2016, pp. 3–22.
conference:
end_date: 2016-07-23
location: Toronto, Canada
name: 'CAV: Computer Aided Verification'
start_date: 2016-07-17
corr_author: '1'
date_created: 2018-12-11T11:51:43Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2026-06-21T22:31:24Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-319-41528-4_1
ec_funded: 1
external_id:
arxiv:
- '1604.07169'
isi:
- '000387731200001'
intvolume: ' 9779'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1604.07169
month: '07'
oa: 1
oa_version: Preprint
page: 3 - 22
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Springer
publist_id: '5824'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Termination analysis of probabilistic programs through Positivstellensatz's
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9779
year: '2016'
...
---
_id: '11519'
abstract:
- lang: eng
text: 'Faint Lyα emitters become increasingly rarer toward the reionization epoch
(z ∼ 6–7). However, observations from a very large (∼5 deg2) Lyα narrow-band survey
at z = 6.6 show that this is not the case for the most luminous emitters, capable
of ionizing their own local bubbles. Here we present follow-up observations of
the two most luminous Lyα candidates in the COSMOS field: “MASOSA” and “CR7.”
We used X-SHOOTER, SINFONI, and FORS2 on the Very Large Telescope, and DEIMOS
on Keck, to confirm both candidates beyond any doubt. We find redshifts of z =
6.541 and z = 6.604 for “MASOSA” and “CR7,” respectively. MASOSA has a strong
detection in Lyα with a line width of 386 ± 30 km s−1 (FWHM) and with very high
EW0 (>200 Å), but undetected in the continuum, implying very low stellar mass
and a likely young, metal-poor stellar population. “CR7,” with an observed Lyα
luminosity of 1043.92±0.05 erg s−1 is the most luminous Lyα emitter ever found
at z > 6 and is spatially extended (∼16 kpc). “CR7” reveals a narrow Lyα line
with 266 ± 15 km s−1 FWHM, being detected in the near-infrared (NIR) (rest-frame
UV; β = −2.3 ± 0.1) and in IRAC/Spitzer. We detect a narrow He II 1640 Å emission
line (6σ, FWHM = 130 ± 30 km s−1 ) in CR7 which can explain the clear excess seen
in the J-band photometry (EW0 ∼ 80 Å). We find no other emission lines from the
UV to the NIR in our X-SHOOTER spectra (He II/O III] 1663 Å > 3 and He II/C III]
1908 Å > 2.5). We conclude that CR7 is best explained by a combination of a PopIII-like
population, which dominates the rest-frame UV and the nebular emission, and a
more normal stellar population, which presumably dominates the mass. Hubble Space
Telescope/WFC3 observations show that the light is indeed spatially separated
between a very blue component, coincident with Lyα and He II emission, and two
red components (∼5 kpc away), which dominate the mass. Our findings are consistent
with theoretical predictions of a PopIII wave, with PopIII star formation migrating
away from the original sites of star formation.'
acknowledgement: We thank the anonymous reviewer for useful and constructive comments
and suggestions which greatly improved the quality and clarity of our work. D.S.
acknowledges financial support from the Netherlands Organisation for Scientific
research (NWO) through a Veni fellowship, from FCT through a FCT Investigator Starting
Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010), from FCT grant UID/FIS/04434/2013,
and from LSF and LKBF. J.M. acknowledges the award of a Huygens PhD fellowship.
H.R. acknowledges support from the ERC Advanced Investigator program NewClusters
321271. The authors thank Mark Dijkstra, Bhaskar Agarwal, Jarrett Johnson, Andrea
Ferrara, Jarle Brinchmann, Rebecca Bowler, George Becker, Emma Curtis-Lake, Milos
Milosavljevic, Raffaella Schneider, Paul Shapiro, and Erik Zackrisson for interesting,
stimulating and helpful discussions. The authors are extremely grateful to ESO for
the award of ESO DDT time (294.A-5018 and 294.A-5039) which allowed the spectroscopic
confirmation of both sources and the detailed investigation of their nature. Observations
are also based on data from W.M. Keck Observatory. The W.M. Keck Observatory is
operated as a scientific partnership of Caltech, the University of California and
the National Aeronautics and Space Administration. Based on observations obtained
with MegaPrime/Megacam, a joint project of CFHT and CEA/IRFU, at the Canada–France–Hawaii
Telescope (CFHT) which is operated by the National Research Council (NRC) of Canada,
the Institut National des Science de lUnivers of the Centre National de la Recherche
Scientifique (CNRS) of France, and the University of Hawaii. This work is based
in part on data products produced at Terapix available at the Canadian Astronomy
Data Centre as part of the Canada–France–Hawaii Telescope Legacy Survey, a collaborative
project of NRC and CNRS. Based on data products from observations made with ESO
Telescopes at the La Silla Paranal Observatory under ESO programme IDs 294.A-5018,
294.A-5039, and 179.A-2005, and on data products produced by TERAPIX and the Cambridge
Astronomy Survey Unit on behalf of the UltraVISTA consortium. The authors acknowledge
the award of service time (SW2014b20) on the William Herschel Telescope (WHT). WHT
and its service programme are operated on the island of La Palma by the Isaac Newton
Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de
Astrofisica de Canarias.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Behnam
full_name: Darvish, Behnam
last_name: Darvish
- first_name: Daniel
full_name: Schaerer, Daniel
last_name: Schaerer
- first_name: Bahram
full_name: Mobasher, Bahram
last_name: Mobasher
- first_name: Huub
full_name: Röttgering, Huub
last_name: Röttgering
- first_name: Sérgio
full_name: Santos, Sérgio
last_name: Santos
- first_name: Shoubaneh
full_name: Hemmati, Shoubaneh
last_name: Hemmati
citation:
ama: 'Sobral D, Matthee JJ, Darvish B, et al. Evidence for PopIII-like stellar populations
in the most luminous Lyα emitters at the epoch of reionisation: Spectroscopic
confirmation. The Astrophysical Journal. 2015;808(2):139. doi:10.1088/0004-637X/808/2/139'
apa: 'Sobral, D., Matthee, J. J., Darvish, B., Schaerer, D., Mobasher, B., Röttgering,
H., … Hemmati, S. (2015). Evidence for PopIII-like stellar populations in the
most luminous Lyα emitters at the epoch of reionisation: Spectroscopic confirmation.
The Astrophysical Journal. IOP Publishing. https://doi.org/10.1088/0004-637X/808/2/139'
chicago: 'Sobral, David, Jorryt J Matthee, Behnam Darvish, Daniel Schaerer, Bahram
Mobasher, Huub Röttgering, Sérgio Santos, and Shoubaneh Hemmati. “Evidence for
PopIII-like Stellar Populations in the Most Luminous Lyα Emitters at the Epoch
of Reionisation: Spectroscopic Confirmation.” The Astrophysical Journal.
IOP Publishing, 2015. https://doi.org/10.1088/0004-637X/808/2/139.'
ieee: 'D. Sobral et al., “Evidence for PopIII-like stellar populations in
the most luminous Lyα emitters at the epoch of reionisation: Spectroscopic confirmation,”
The Astrophysical Journal, vol. 808, no. 2. IOP Publishing, p. 139, 2015.'
ista: 'Sobral D, Matthee JJ, Darvish B, Schaerer D, Mobasher B, Röttgering H, Santos
S, Hemmati S. 2015. Evidence for PopIII-like stellar populations in the most luminous
Lyα emitters at the epoch of reionisation: Spectroscopic confirmation. The Astrophysical
Journal. 808(2), 139.'
mla: 'Sobral, David, et al. “Evidence for PopIII-like Stellar Populations in the
Most Luminous Lyα Emitters at the Epoch of Reionisation: Spectroscopic Confirmation.”
The Astrophysical Journal, vol. 808, no. 2, IOP Publishing, 2015, p. 139,
doi:10.1088/0004-637X/808/2/139.'
short: D. Sobral, J.J. Matthee, B. Darvish, D. Schaerer, B. Mobasher, H. Röttgering,
S. Santos, S. Hemmati, The Astrophysical Journal 808 (2015) 139.
date_created: 2022-07-07T09:00:58Z
date_published: 2015-07-28T00:00:00Z
date_updated: 2022-08-18T10:30:13Z
day: '28'
doi: 10.1088/0004-637X/808/2/139
extern: '1'
external_id:
arxiv:
- '1504.01734'
intvolume: ' 808'
issue: '2'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- dark ages
- reionization
- 'first stars – early universe – galaxies: evolution'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.01734
month: '07'
oa: 1
oa_version: Preprint
page: '139'
publication: The Astrophysical Journal
publication_identifier:
eissn:
- 1538-4357
issn:
- 0004-637X
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Evidence for PopIII-like stellar populations in the most luminous Lyα emitters
at the epoch of reionisation: Spectroscopic confirmation'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 808
year: '2015'
...
---
_id: '11579'
abstract:
- lang: eng
text: CR7 is the brightest z = 6.6 Ly α emitter (LAE) known to date, and spectroscopic
follow-up by Sobral et al. suggests that CR7 might host Population (Pop) III stars.
We examine this interpretation using cosmological hydrodynamical simulations.
Several simulated galaxies show the same ‘Pop III wave’ pattern observed in CR7.
However, to reproduce the extreme CR7 Ly α/He II1640 line luminosities (Lα/HeII)
a top-heavy initial mass function and a massive ( ≳ 107 M⊙) Pop III burst with
age ≲ 2 Myr are required. Assuming that the observed properties of Ly α and He II
emission are typical for Pop III, we predict that in the COSMOS/UDS/SA22 fields,
14 out of the 30 LAEs at z = 6.6 with Lα > 1043.3 erg s−1 should also host Pop
III stars producing an observable LHeII≳1042.7ergs−1. As an alternate explanation,
we explore the possibility that CR7 is instead powered by accretion on to a direct
collapse black hole. Our model predicts Lα, LHeII, and X-ray luminosities that
are in agreement with the observations. In any case, the observed properties of
CR7 indicate that this galaxy is most likely powered by sources formed from pristine
gas. We propose that further X-ray observations can distinguish between the two
above scenarios.
acknowledgement: SS acknowledges support from the Netherlands Organization for Scientific
research (NWO), VENI grant 639.041.233. RS acknowledges support from the European
Research Council under the European Union (FP/2007-2013)/ERC grant agreement no.
306476. DS acknowledges (i) financial support from the NWO through a Veni fellowship
and (ii) funding from FCT through a FCT Investigator Starting Grant and Start-up
Grant (IF/01154/2012/CP0189/CT0010) and from FCT grant PEstOE/FIS/UI2751/2014.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: A.
full_name: Pallottini, A.
last_name: Pallottini
- first_name: A.
full_name: Ferrara, A.
last_name: Ferrara
- first_name: F.
full_name: Pacucci, F.
last_name: Pacucci
- first_name: S.
full_name: Gallerani, S.
last_name: Gallerani
- first_name: S.
full_name: Salvadori, S.
last_name: Salvadori
- first_name: R.
full_name: Schneider, R.
last_name: Schneider
- first_name: D.
full_name: Schaerer, D.
last_name: Schaerer
- first_name: D.
full_name: Sobral, D.
last_name: Sobral
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
citation:
ama: 'Pallottini A, Ferrara A, Pacucci F, et al. The brightest Lyα emitter: Pop
III or black hole? Monthly Notices of the Royal Astronomical Society. 2015;453(3):2465-2470.
doi:10.1093/mnras/stv1795'
apa: 'Pallottini, A., Ferrara, A., Pacucci, F., Gallerani, S., Salvadori, S., Schneider,
R., … Matthee, J. J. (2015). The brightest Lyα emitter: Pop III or black hole?
Monthly Notices of the Royal Astronomical Society. Oxford University Press.
https://doi.org/10.1093/mnras/stv1795'
chicago: 'Pallottini, A., A. Ferrara, F. Pacucci, S. Gallerani, S. Salvadori, R.
Schneider, D. Schaerer, D. Sobral, and Jorryt J Matthee. “The Brightest Lyα Emitter:
Pop III or Black Hole?” Monthly Notices of the Royal Astronomical Society.
Oxford University Press, 2015. https://doi.org/10.1093/mnras/stv1795.'
ieee: 'A. Pallottini et al., “The brightest Lyα emitter: Pop III or black
hole?,” Monthly Notices of the Royal Astronomical Society, vol. 453, no.
3. Oxford University Press, pp. 2465–2470, 2015.'
ista: 'Pallottini A, Ferrara A, Pacucci F, Gallerani S, Salvadori S, Schneider R,
Schaerer D, Sobral D, Matthee JJ. 2015. The brightest Lyα emitter: Pop III or
black hole? Monthly Notices of the Royal Astronomical Society. 453(3), 2465–2470.'
mla: 'Pallottini, A., et al. “The Brightest Lyα Emitter: Pop III or Black Hole?”
Monthly Notices of the Royal Astronomical Society, vol. 453, no. 3, Oxford
University Press, 2015, pp. 2465–70, doi:10.1093/mnras/stv1795.'
short: A. Pallottini, A. Ferrara, F. Pacucci, S. Gallerani, S. Salvadori, R. Schneider,
D. Schaerer, D. Sobral, J.J. Matthee, Monthly Notices of the Royal Astronomical
Society 453 (2015) 2465–2470.
date_created: 2022-07-14T08:58:36Z
date_published: 2015-11-01T00:00:00Z
date_updated: 2022-08-19T08:19:23Z
day: '01'
doi: 10.1093/mnras/stv1795
extern: '1'
external_id:
arxiv:
- '1506.07173'
intvolume: ' 453'
issue: '3'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- black hole physics
- 'stars: Population III'
- 'galaxies: high-redshift'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1506.07173
month: '11'
oa: 1
oa_version: Preprint
page: 2465-2470
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The brightest Lyα emitter: Pop III or black hole?'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 453
year: '2015'
...
---
_id: '11580'
abstract:
- lang: eng
text: 'We present results from the largest contiguous narrow-band survey in the
near-infrared. We have used the wide-field infrared camera/Canada–France–Hawaii
Telescope and the lowOH2 filter (1.187 ± 0.005 μm) to survey ≈10 deg2 of contiguous
extragalactic sky in the SA22 field. A total of ∼6000 candidate emission-line
galaxies are found. We use deep ugrizJK data to obtain robust photometric redshifts.
We combine our data with the High-redshift(Z) Emission Line Survey (HiZELS), explore
spectroscopic surveys (VVDS, VIPERS) and obtain our own spectroscopic follow-up
with KMOS, FMOS and MOSFIRE to derive large samples of high-redshift emission-line
selected galaxies: 3471 Hα emitters at z = 0.8, 1343 [O III] + Hβ emitters at
z = 1.4 and 572 [O II] emitters at z = 2.2. We probe comoving volumes of >106
Mpc3 and find significant overdensities, including an 8.5σ (spectroscopically
confirmed) overdensity of Hα emitters at z = 0.81. We derive Hα, [O III] + Hβ
and [O II] luminosity functions at z = 0.8, 1.4, 2.2, respectively, and present
implications for future surveys such as Euclid. Our uniquely large volumes/areas
allow us to subdivide the samples in thousands of randomized combinations of areas
and provide a robust empirical measurement of sample/cosmic variance. We show
that surveys for star-forming/emission-line galaxies at a depth similar to ours
can only overcome cosmic-variance (errors <10 per cent) if they are based on volumes
>5 × 105 Mpc3; errors on L* and ϕ* due to sample (cosmic) variance on surveys
probing ∼104 and ∼105 Mpc3 are typically very high: ∼300 and ∼40–60 per cent,
respectively.'
acknowledgement: The authors wish to thank the anonymous reviewer for many helpful
comments and suggestions which greatly improved the clarity and quality of this
work. DS acknowledges financial support from the Netherlands Organization for Scientific
research (NWO) through a Veni fellowship, from FCT through an FCT Investigator Starting
Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010), from FCT grant PEst-OE/FIS/UI2751/2014,
and from LSF and LKBF. JM acknowledges the award of a Huygens PhD fellowship. PNB
is grateful for support from STFC. IRS acknowledges support from STFC, a Leverhulme
Fellowship, the ERC Advanced Investigator programme DUSTYGAL and a Royal Society/Wolfson
Merit Award. BMJ acknowledges support from the ERC-StG grant EGGS-278202. The Dark
Cosmology Centre is funded by the DNRF. The Dark Cosmology Centre is funded by the
DNRF. JWK acknowledges support from the National Research Foundation of Korea (NRF)
grant, no. 2008-0060544, funded by the Korea government (MSIP). JPS acknowledges
support from STFC (ST/I001573/1). JC acknowledges support from the FCT-IF grant
IF/01154/2012/CP0189/CT0010. The work was only possible due to OPTICON/FP7 and the
invaluable access that it granted to the CFHT telescope. We would also like to acknowledge
the excellent work done by CFHT staff in conducting the observations in service
mode, and on delivering truly excellent data. We are also tremendously thankful
to Kentaro Aoki for the incredible support while observing at Subaru with FMOS,
and also to the Keck staff for the help with the observations with MOSFIRE. This
work is based on observations obtained with WIRCam on the CFHT, OPTICON programme
2011B/029, 2012A019 and 2012B/016. Based on observations made with ESO telescopes
at the La Silla Paranal Observatory under programmes IDs 60.A-9460 (data can be
accessed through the ESO data archive), 087.A 0337 and 089.A-0965. Based on observations
done with FMOS on Subaru under programme S14A-084, and on MOSFIRE/Keck observations
under programme U066M. Part of the data on which this analysis is based are available
from Sobral et al. (2013a). Dedicated to the memory of C. M. Sobral (1953-2014).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: D.
full_name: Sobral, D.
last_name: Sobral
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: P. N.
full_name: Best, P. N.
last_name: Best
- first_name: I.
full_name: Smail, I.
last_name: Smail
- first_name: A. A.
full_name: Khostovan, A. A.
last_name: Khostovan
- first_name: B.
full_name: Milvang-Jensen, B.
last_name: Milvang-Jensen
- first_name: J.-W.
full_name: Kim, J.-W.
last_name: Kim
- first_name: J.
full_name: Stott, J.
last_name: Stott
- first_name: J.
full_name: Calhau, J.
last_name: Calhau
- first_name: H.
full_name: Nayyeri, H.
last_name: Nayyeri
- first_name: B.
full_name: Mobasher, B.
last_name: Mobasher
citation:
ama: 'Sobral D, Matthee JJ, Best PN, et al. CF-HiZELS, an ∼10 deg2 emission-line
survey with spectroscopic follow-up: Hα, [O III] + Hβ and [O II] luminosity functions
at z = 0.8, 1.4 and 2.2 . Monthly Notices of the Royal Astronomical Society.
2015;451(3):2303-2323. doi:10.1093/mnras/stv1076'
apa: 'Sobral, D., Matthee, J. J., Best, P. N., Smail, I., Khostovan, A. A., Milvang-Jensen,
B., … Mobasher, B. (2015). CF-HiZELS, an ∼10 deg2 emission-line survey with spectroscopic
follow-up: Hα, [O III] + Hβ and [O II] luminosity functions at z = 0.8, 1.4 and
2.2 . Monthly Notices of the Royal Astronomical Society. Oxford University
Press. https://doi.org/10.1093/mnras/stv1076'
chicago: 'Sobral, D., Jorryt J Matthee, P. N. Best, I. Smail, A. A. Khostovan, B.
Milvang-Jensen, J.-W. Kim, et al. “CF-HiZELS, an ∼10 Deg2 Emission-Line Survey
with Spectroscopic Follow-up: Hα, [O III] + Hβ and [O II] Luminosity Functions
at z = 0.8, 1.4 and 2.2 .” Monthly Notices of the Royal Astronomical Society.
Oxford University Press, 2015. https://doi.org/10.1093/mnras/stv1076.'
ieee: 'D. Sobral et al., “CF-HiZELS, an ∼10 deg2 emission-line survey with
spectroscopic follow-up: Hα, [O III] + Hβ and [O II] luminosity functions at z
= 0.8, 1.4 and 2.2 ,” Monthly Notices of the Royal Astronomical Society,
vol. 451, no. 3. Oxford University Press, pp. 2303–2323, 2015.'
ista: 'Sobral D, Matthee JJ, Best PN, Smail I, Khostovan AA, Milvang-Jensen B, Kim
J-W, Stott J, Calhau J, Nayyeri H, Mobasher B. 2015. CF-HiZELS, an ∼10 deg2 emission-line
survey with spectroscopic follow-up: Hα, [O III] + Hβ and [O II] luminosity functions
at z = 0.8, 1.4 and 2.2 . Monthly Notices of the Royal Astronomical Society. 451(3),
2303–2323.'
mla: 'Sobral, D., et al. “CF-HiZELS, an ∼10 Deg2 Emission-Line Survey with Spectroscopic
Follow-up: Hα, [O III] + Hβ and [O II] Luminosity Functions at z = 0.8, 1.4 and
2.2 .” Monthly Notices of the Royal Astronomical Society, vol. 451, no.
3, Oxford University Press, 2015, pp. 2303–23, doi:10.1093/mnras/stv1076.'
short: D. Sobral, J.J. Matthee, P.N. Best, I. Smail, A.A. Khostovan, B. Milvang-Jensen,
J.-W. Kim, J. Stott, J. Calhau, H. Nayyeri, B. Mobasher, Monthly Notices of the
Royal Astronomical Society 451 (2015) 2303–2323.
date_created: 2022-07-14T09:02:22Z
date_published: 2015-08-11T00:00:00Z
date_updated: 2024-10-14T11:36:57Z
day: '11'
doi: 10.1093/mnras/stv1076
extern: '1'
external_id:
arxiv:
- '1502.06602'
intvolume: ' 451'
issue: '3'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution'
- 'galaxies: formation'
- 'galaxies: luminosity function'
- mass function
- 'cosmology: observations'
- early Universe
- large-scale structure of Universe
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.06602
month: '08'
oa: 1
oa_version: Preprint
page: 2303-2323
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'CF-HiZELS, an ∼10 deg2 emission-line survey with spectroscopic follow-up:
Hα, [O III] + Hβ and [O II] luminosity functions at z = 0.8, 1.4 and 2.2 '
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 451
year: '2015'
...
---
_id: '11581'
abstract:
- lang: eng
text: Using wide-field narrow-band surveys, we provide a new measurement of the
z = 6.6 Lymanα emitter (LAE) luminosity function (LF), which constraints the bright
end for the first time. We use a combination of archival narrow-band NB921 data
in UDS and new NB921 measurements in SA22 and COSMOS/UltraVISTA, all observed
with the Subaru telescope, with a total area of ∼5 deg2. We exclude lower redshift
interlopers by using broad-band optical and near-infrared photometry and also
exclude three supernovae with data split over multiple epochs. Combining the UDS
and COSMOS samples, we find no evolution of the bright end of the Lyα LF between
z = 5.7 and 6.6, which is supported by spectroscopic follow-up, and conclude that
sources with Himiko-like luminosity are not as rare as previously thought, with
number densities of ∼1.5 × 10−5 Mpc−3. Combined with our wide-field SA22 measurements,
our results indicate a non-Schechter-like bright end of the LF at z = 6.6 and
a different evolution of observed faint and bright LAEs, overcoming cosmic variance.
This differential evolution is also seen in the spectroscopic follow-up of UV-selected
galaxies and is now also confirmed for LAEs, and we argue that it may be an effect
of reionization. Using a toy model, we show that such differential evolution of
the LF is expected, since brighter sources are able to ionize their surroundings
earlier, such that Lyα photons are able to escape. Our targets are excellent candidates
for detailed follow-up studies and provide the possibility to give a unique view
on the earliest stages in the formation of galaxies and reionization process.
acknowledgement: "We thank the anonymous referee for the comments and suggestions
which have improved the quality of this work. We thank Masami Ouchi for his useful
comments on an earlier version of this paper. JM acknowledges the support of a Huygens
PhD fellowship from Leiden University and is thankful for the hospitality of the
Center for Astronomy and Astrophysics of the University of Lisbon where part of
this research has been done. DS acknowledges financial support from the Netherlands
Organization for Scientific research (NWO) through a Veni fellowship, from FCT through
a FCT Investigator Starting Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010)
and from FCT grant PEstOE/FIS/UI2751/2014. HR acknowledges support from the ERC
Advanced Investigator programme NewClusters 321271. We acknowledge the award of
ESO DDT time (294.A-5018) for providing the possibility of a timely publication
of this work.\r\nBased on observations with the Subaru Telescope (Programme IDs:
our observations: S14A-086; archival: S05B-027, S06A-025, S06B-010, S07A-013, S07B-008,
S08B-008 and S09A-017) and the W.M. Keck Observatory. The Subaru telescope is operated
by the National Astronomical Observatory of Japan. The W.M. Keck Observatory is
operated as a scientific partnership among the California Institute of Technology,
the University of California and the National Aeronautics and Space Administration.
Based on observations made with ESO Telescopes at the La Silla Paranal Observatory
under programme ID 294.A-5018. Based on observations obtained with MegaPrime/Megacam,
a joint project of CFHT and CEA/IRFU, at the Canada–France-Hawaii Telescope (CFHT)
which is operated by the National Research Council (NRC) of Canada, the Institut
National des Science de l’Univers of the Centre National de la Recherche Scientifique
(CNRS) of France, and the University of Hawaii. This work is based in part on data
products produced at Terapix available at the Canadian Astronomy Data Centre as
part of the CFHT Legacy Survey, a collaborative project of NRC and CNRS. Based on
data products from observations made with ESO Telescopes at the La Silla Paranal
Observatory under ESO programme ID 179.A-2005 and on data products produced by TERAPIX
and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium.\r\nIn
addition to the CFHT-LS and COSMOS-UltraVISTA surveys, we are grateful for the excellent
data sets from the UKIRT-DXS, SXDF and S-COSMOS survey teams, without these legacy
surveys, this research would have been impossible. We have benefited greatly from
the public available programming language PYTHON, including the NUMPY, MATPLOTLIB,
PYFITS, SCIPY and ASTROPY packages, the astronomical imaging tools SEXTRACTOR, SWARP
and SCAMP and the indispensable TOPCAT analysis tool (Taylor 2013)"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: Sérgio
full_name: Santos, Sérgio
last_name: Santos
- first_name: Huub
full_name: Röttgering, Huub
last_name: Röttgering
- first_name: Behnam
full_name: Darvish, Behnam
last_name: Darvish
- first_name: Bahram
full_name: Mobasher, Bahram
last_name: Mobasher
citation:
ama: 'Matthee JJ, Sobral D, Santos S, Röttgering H, Darvish B, Mobasher B. Identification
of the brightest Lyα emitters at z = 6.6: implications for the evolution of the
luminosity function in the reionization era. Monthly Notices of the Royal Astronomical
Society. 2015;451(1):400-417. doi:10.1093/mnras/stv947'
apa: 'Matthee, J. J., Sobral, D., Santos, S., Röttgering, H., Darvish, B., &
Mobasher, B. (2015). Identification of the brightest Lyα emitters at z = 6.6:
implications for the evolution of the luminosity function in the reionization
era. Monthly Notices of the Royal Astronomical Society. Oxford University
Press. https://doi.org/10.1093/mnras/stv947'
chicago: 'Matthee, Jorryt J, David Sobral, Sérgio Santos, Huub Röttgering, Behnam
Darvish, and Bahram Mobasher. “Identification of the Brightest Lyα Emitters at
z = 6.6: Implications for the Evolution of the Luminosity Function in the Reionization
Era.” Monthly Notices of the Royal Astronomical Society. Oxford University
Press, 2015. https://doi.org/10.1093/mnras/stv947.'
ieee: 'J. J. Matthee, D. Sobral, S. Santos, H. Röttgering, B. Darvish, and B. Mobasher,
“Identification of the brightest Lyα emitters at z = 6.6: implications for the
evolution of the luminosity function in the reionization era,” Monthly Notices
of the Royal Astronomical Society, vol. 451, no. 1. Oxford University Press,
pp. 400–417, 2015.'
ista: 'Matthee JJ, Sobral D, Santos S, Röttgering H, Darvish B, Mobasher B. 2015.
Identification of the brightest Lyα emitters at z = 6.6: implications for the
evolution of the luminosity function in the reionization era. Monthly Notices
of the Royal Astronomical Society. 451(1), 400–417.'
mla: 'Matthee, Jorryt J., et al. “Identification of the Brightest Lyα Emitters at
z = 6.6: Implications for the Evolution of the Luminosity Function in the Reionization
Era.” Monthly Notices of the Royal Astronomical Society, vol. 451, no.
1, Oxford University Press, 2015, pp. 400–17, doi:10.1093/mnras/stv947.'
short: J.J. Matthee, D. Sobral, S. Santos, H. Röttgering, B. Darvish, B. Mobasher,
Monthly Notices of the Royal Astronomical Society 451 (2015) 400–417.
date_created: 2022-07-14T11:57:03Z
date_published: 2015-07-21T00:00:00Z
date_updated: 2024-10-14T11:37:15Z
day: '21'
doi: 10.1093/mnras/stv947
extern: '1'
external_id:
arxiv:
- '1502.07355'
intvolume: ' 451'
issue: '1'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.07355
month: '07'
oa: 1
oa_version: Preprint
page: 400-417
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Identification of the brightest Lyα emitters at z = 6.6: implications for
the evolution of the luminosity function in the reionization era'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 451
year: '2015'
...
---
_id: '11668'
abstract:
- lang: eng
text: "We study multiple keyword sponsored search auctions with budgets. Each keyword
has multiple ad slots with a click-through rate. The bidders have additive valuations,
which are linear in the click-through rates, and budgets, which are restricting
their overall payments. Additionally, the number of slots per keyword assigned
to a bidder is bounded.\r\n\r\nWe show the following results: (1) We give the
first mechanism for multiple keywords, where click-through rates differ among
slots. Our mechanism is incentive compatible in expectation, individually rational
in expectation, and Pareto optimal. (2) We study the combinatorial setting, where
each bidder is only interested in a subset of the keywords. We give an incentive
compatible, individually rational, Pareto-optimal, and deterministic mechanism
for identical click-through rates. (3) We give an impossibility result for incentive
compatible, individually rational, Pareto-optimal, and deterministic mechanisms
for bidders with diminishing marginal valuations."
article_number: '2'
article_processing_charge: No
article_type: original
author:
- first_name: Riccardo
full_name: Colini-Baldeschi, Riccardo
last_name: Colini-Baldeschi
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Martin
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: Colini-Baldeschi R, Leonardi S, Henzinger M, Starnberger M. On multiple keyword
sponsored search auctions with budgets. ACM Transactions on Economics and Computation.
2015;4(1). doi:10.1145/2818357
apa: Colini-Baldeschi, R., Leonardi, S., Henzinger, M., & Starnberger, M. (2015).
On multiple keyword sponsored search auctions with budgets. ACM Transactions
on Economics and Computation. Association for Computing Machinery. https://doi.org/10.1145/2818357
chicago: Colini-Baldeschi, Riccardo, Stefano Leonardi, Monika Henzinger, and Martin
Starnberger. “On Multiple Keyword Sponsored Search Auctions with Budgets.” ACM
Transactions on Economics and Computation. Association for Computing Machinery,
2015. https://doi.org/10.1145/2818357.
ieee: R. Colini-Baldeschi, S. Leonardi, M. Henzinger, and M. Starnberger, “On multiple
keyword sponsored search auctions with budgets,” ACM Transactions on Economics
and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.
ista: Colini-Baldeschi R, Leonardi S, Henzinger M, Starnberger M. 2015. On multiple
keyword sponsored search auctions with budgets. ACM Transactions on Economics
and Computation. 4(1), 2.
mla: Colini-Baldeschi, Riccardo, et al. “On Multiple Keyword Sponsored Search Auctions
with Budgets.” ACM Transactions on Economics and Computation, vol. 4, no.
1, 2, Association for Computing Machinery, 2015, doi:10.1145/2818357.
short: R. Colini-Baldeschi, S. Leonardi, M. Henzinger, M. Starnberger, ACM Transactions
on Economics and Computation 4 (2015).
date_created: 2022-07-27T11:54:56Z
date_published: 2015-12-05T00:00:00Z
date_updated: 2024-11-06T12:06:41Z
day: '05'
doi: 10.1145/2818357
extern: '1'
intvolume: ' 4'
issue: '1'
keyword:
- Algorithms
- Economics
- Clinching ascending auction
- auctions with budgets
- Sponsored search auctions
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprints.cs.univie.ac.at/3510/
month: '12'
oa: 1
oa_version: Submitted Version
publication: ACM Transactions on Economics and Computation
publication_identifier:
eissn:
- 2167-8383
issn:
- 2167-8375
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: On multiple keyword sponsored search auctions with budgets
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2015'
...
---
_id: '11669'
abstract:
- lang: eng
text: We study individual rational, Pareto-optimal, and incentive compatible mechanisms
for auctions with heterogeneous items and budget limits. We consider settings
with multiunit demand and additive valuations. For single-dimensional valuations
we prove a positive result for randomized mechanisms, and a negative result for
deterministic mechanisms. While the positive result allows for private budgets,
the negative result is for public budgets. For multidimensional valuations and
public budgets we prove an impossibility result that applies to deterministic
and randomized mechanisms. Taken together this shows the power of randomization
in certain settings with heterogeneous items, but it also shows its limitations.
article_number: '4'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Paul
full_name: Dütting, Paul
last_name: Dütting
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Martin
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: Dütting P, Henzinger M, Starnberger M. Auctions for heterogeneous items and
budget limits. ACM Transactions on Economics and Computation. 2015;4(1).
doi:10.1145/2818351
apa: Dütting, P., Henzinger, M., & Starnberger, M. (2015). Auctions for heterogeneous
items and budget limits. ACM Transactions on Economics and Computation.
Association for Computing Machinery. https://doi.org/10.1145/2818351
chicago: Dütting, Paul, Monika Henzinger, and Martin Starnberger. “Auctions for
Heterogeneous Items and Budget Limits.” ACM Transactions on Economics and Computation.
Association for Computing Machinery, 2015. https://doi.org/10.1145/2818351.
ieee: P. Dütting, M. Henzinger, and M. Starnberger, “Auctions for heterogeneous
items and budget limits,” ACM Transactions on Economics and Computation,
vol. 4, no. 1. Association for Computing Machinery, 2015.
ista: Dütting P, Henzinger M, Starnberger M. 2015. Auctions for heterogeneous items
and budget limits. ACM Transactions on Economics and Computation. 4(1), 4.
mla: Dütting, Paul, et al. “Auctions for Heterogeneous Items and Budget Limits.”
ACM Transactions on Economics and Computation, vol. 4, no. 1, 4, Association
for Computing Machinery, 2015, doi:10.1145/2818351.
short: P. Dütting, M. Henzinger, M. Starnberger, ACM Transactions on Economics and
Computation 4 (2015).
date_created: 2022-07-27T12:09:15Z
date_published: 2015-12-05T00:00:00Z
date_updated: 2024-11-06T12:06:53Z
day: '05'
doi: 10.1145/2818351
extern: '1'
external_id:
arxiv:
- '1209.6448'
intvolume: ' 4'
issue: '1'
keyword:
- Algorithmic game theory
- auction theory
- Clinching auction
- Pareto optimality
- Budget limits
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1209.6448
month: '12'
oa: 1
oa_version: Preprint
publication: ACM Transactions on Economics and Computation
publication_identifier:
eissn:
- 2167-8383
issn:
- 2167-8375
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auctions for heterogeneous items and budget limits
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2015'
...
---
_id: '11670'
abstract:
- lang: eng
text: Auctions are widely used on the Web. Applications range from sponsored search
to platforms such as eBay. In these and in many other applications the auctions
in use are single-/multi-item auctions with unit demand. The main drawback of
standard mechanisms for this type of auctions, such as VCG and GSP, is the limited
expressiveness that they offer to the bidders. The General Auction Mechanism (GAM)
of Aggarwal et al. [2009] takes a first step toward addressing the problem of
limited expressiveness by computing a bidder optimal, envy-free outcome for linear
utility functions with identical slopes and a single discontinuity per bidder-item
pair. We show that in many practical situations this does not suffice to adequately
model the preferences of the bidders, and we overcome this problem by presenting
the first mechanism for piecewise linear utility functions with nonidentical slopes
and multiple discontinuities. Our mechanism runs in polynomial time. Like GAM
it is incentive compatible for inputs that fulfill a certain nondegeneracy assumption,
but our requirement is more general than the requirement of GAM. For discontinuous
utility functions that are nondegenerate as well as for continuous utility functions
the outcome of our mechanism is a competitive equilibrium. We also show how our
mechanism can be used to compute approximately bidder optimal, envy-free outcomes
for a general class of continuous utility functions via piecewise linear approximation.
Finally, we prove hardness results for even more expressive settings.
acknowledgement: We would like to thank Veronika Loitzenbauer and the anonymous referees
for their valuable feedback.
article_number: '1'
article_processing_charge: No
article_type: original
author:
- first_name: Paul
full_name: Dütting, Paul
last_name: Dütting
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Ingmar
full_name: Weber, Ingmar
last_name: Weber
citation:
ama: Dütting P, Henzinger M, Weber I. An expressive mechanism for auctions on the
web. ACM Transactions on Economics and Computation. 2015;4(1). doi:10.1145/2716312
apa: Dütting, P., Henzinger, M., & Weber, I. (2015). An expressive mechanism
for auctions on the web. ACM Transactions on Economics and Computation.
Association for Computing Machinery. https://doi.org/10.1145/2716312
chicago: Dütting, Paul, Monika Henzinger, and Ingmar Weber. “An Expressive Mechanism
for Auctions on the Web.” ACM Transactions on Economics and Computation.
Association for Computing Machinery, 2015. https://doi.org/10.1145/2716312.
ieee: P. Dütting, M. Henzinger, and I. Weber, “An expressive mechanism for auctions
on the web,” ACM Transactions on Economics and Computation, vol. 4, no.
1. Association for Computing Machinery, 2015.
ista: Dütting P, Henzinger M, Weber I. 2015. An expressive mechanism for auctions
on the web. ACM Transactions on Economics and Computation. 4(1), 1.
mla: Dütting, Paul, et al. “An Expressive Mechanism for Auctions on the Web.” ACM
Transactions on Economics and Computation, vol. 4, no. 1, 1, Association for
Computing Machinery, 2015, doi:10.1145/2716312.
short: P. Dütting, M. Henzinger, I. Weber, ACM Transactions on Economics and Computation
4 (2015).
date_created: 2022-07-27T12:43:18Z
date_published: 2015-12-02T00:00:00Z
date_updated: 2024-11-06T12:07:05Z
day: '02'
doi: 10.1145/2716312
extern: '1'
intvolume: ' 4'
issue: '1'
keyword:
- Computational Mathematics
- Marketing
- Economics and Econometrics
- Statistics and Probability
- Computer Science (miscellaneous)
language:
- iso: eng
month: '12'
oa_version: None
publication: ACM Transactions on Economics and Computation
publication_identifier:
eissn:
- 2167-8383
issn:
- 2167-8375
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: An expressive mechanism for auctions on the web
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2015'
...
---
_id: '11773'
abstract:
- lang: eng
text: "Ad exchanges are an emerging platform for trading advertisement slots on
the web with billions of dollars revenue per year. Every time a user visits a
web page, the publisher of that web page can ask an ad exchange to auction off
the ad slots on this page to determine which advertisements are shown at which
price. Due to the high volume of traffic, ad networks typically act as mediators
for individual advertisers at ad exchanges. If multiple advertisers in an ad network
are interested in the ad slots of the same auction, the ad network might use a
“local” auction to resell the obtained ad slots among its advertisers.\r\n\r\nIn
this work we want to deepen the theoretical understanding of these new markets
by analyzing them from the viewpoint of combinatorial auctions. Prior work studied
mostly single-item auctions, while we allow the advertisers to express richer
preferences over multiple items. We develop a game-theoretic model for the entanglement
of the central auction at the ad exchange with the local auctions at the ad networks.
We consider the incentives of all three involved parties and suggest a three-party
competitive equilibrium, an extension of the Walrasian equilibrium that ensures
envy-freeness for all participants. We show the existence of a three-party competitive
equilibrium and a polynomial-time algorithm to find one for gross-substitute bidder
valuations."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Oren
full_name: Ben-Zwi, Oren
last_name: Ben-Zwi
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Ben-Zwi O, Henzinger M, Loitzenbauer V. Ad exchange: Envy-free auctions with
mediators. In: 11th International Conference on Web and Internet Economics.
Vol 9470. Springer Nature; 2015:104–117. doi:10.1007/978-3-662-48995-6_8'
apa: 'Ben-Zwi, O., Henzinger, M., & Loitzenbauer, V. (2015). Ad exchange: Envy-free
auctions with mediators. In 11th International Conference on Web and Internet
Economics (Vol. 9470, pp. 104–117). Amsterdam, Netherlands: Springer Nature.
https://doi.org/10.1007/978-3-662-48995-6_8'
chicago: 'Ben-Zwi, Oren, Monika Henzinger, and Veronika Loitzenbauer. “Ad Exchange:
Envy-Free Auctions with Mediators.” In 11th International Conference on Web
and Internet Economics, 9470:104–117. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-48995-6_8.'
ieee: 'O. Ben-Zwi, M. Henzinger, and V. Loitzenbauer, “Ad exchange: Envy-free auctions
with mediators,” in 11th International Conference on Web and Internet Economics,
Amsterdam, Netherlands, 2015, vol. 9470, pp. 104–117.'
ista: 'Ben-Zwi O, Henzinger M, Loitzenbauer V. 2015. Ad exchange: Envy-free auctions
with mediators. 11th International Conference on Web and Internet Economics. WINE:
International Conference on Web and Internet Economics, LNCS, vol. 9470, 104–117.'
mla: 'Ben-Zwi, Oren, et al. “Ad Exchange: Envy-Free Auctions with Mediators.” 11th
International Conference on Web and Internet Economics, vol. 9470, Springer
Nature, 2015, pp. 104–117, doi:10.1007/978-3-662-48995-6_8.'
short: O. Ben-Zwi, M. Henzinger, V. Loitzenbauer, in:, 11th International Conference
on Web and Internet Economics, Springer Nature, 2015, pp. 104–117.
conference:
end_date: 2015-09-12
location: Amsterdam, Netherlands
name: 'WINE: International Conference on Web and Internet Economics'
start_date: 2015-09-09
date_created: 2022-08-08T13:33:56Z
date_published: 2015-12-09T00:00:00Z
date_updated: 2024-11-06T12:10:25Z
day: '09'
doi: 10.1007/978-3-662-48995-6_8
extern: '1'
external_id:
arxiv:
- '1604.05562'
intvolume: ' 9470'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1604.05562
month: '12'
oa: 1
oa_version: Preprint
page: 104–117
publication: 11th International Conference on Web and Internet Economics
publication_identifier:
eisbn:
- '9783662489956'
isbn:
- '9783662489949'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Ad exchange: Envy-free auctions with mediators'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9470
year: '2015'
...
---
_id: '11774'
abstract:
- lang: eng
text: "Combinatorial auctions (CA) are a well-studied area in algorithmic mechanism
design. However, contrary to the standard model, empirical studies suggest that
a bidder’s valuation often does not depend solely on the goods assigned to him.
For instance, in adwords auctions an advertiser might not want his ads to be displayed
next to his competitors’ ads. In this paper, we propose and analyze several natural
graph-theoretic models that incorporate such negative externalities, in which
bidders form a directed conflict graph with maximum out-degree Δ. We design algorithms
and truthful mechanisms for social welfare maximization that attain approximation
ratios depending on Δ.\r\n\r\nFor CA, our results are twofold: (1) A lottery that
eliminates conflicts by discarding bidders/items independent of the bids. It allows
to apply any truthful \U0001D6FC-approximation mechanism for conflict-free valuations
and yields an \U0001D4AA(\U0001D6FCΔ)-approximation mechanism. (2) For fractionally
sub-additive valuations, we design a rounding algorithm via a novel combination
of a semi-definite program and a linear program, resulting in a cone program;
the approximation ratio is \U0001D4AA((ΔloglogΔ)/logΔ). The ratios are almost
optimal given existing hardness results.\r\n\r\nFor adwords auctions, we present
several algorithms for the most relevant scenario when the number of items is
small. In particular, we design a truthful mechanism with approximation ratio
\U0001D45C(Δ) when the number of items is only logarithmic in the number of bidders."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Yun Kuen
full_name: Cheung, Yun Kuen
last_name: Cheung
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Martin
full_name: Hoefer, Martin
last_name: Hoefer
- first_name: Martin
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: 'Cheung YK, Henzinger M, Hoefer M, Starnberger M. Combinatorial auctions with
conflict-based externalities. In: 11th International Conference on Web and
Internet Economics. Vol 9470. Springer Nature; 2015:230–243. doi:10.1007/978-3-662-48995-6_17'
apa: 'Cheung, Y. K., Henzinger, M., Hoefer, M., & Starnberger, M. (2015). Combinatorial
auctions with conflict-based externalities. In 11th International Conference
on Web and Internet Economics (Vol. 9470, pp. 230–243). Amsterdam, Netherlands:
Springer Nature. https://doi.org/10.1007/978-3-662-48995-6_17'
chicago: Cheung, Yun Kuen, Monika Henzinger, Martin Hoefer, and Martin Starnberger.
“Combinatorial Auctions with Conflict-Based Externalities.” In 11th International
Conference on Web and Internet Economics, 9470:230–243. Springer Nature, 2015.
https://doi.org/10.1007/978-3-662-48995-6_17.
ieee: Y. K. Cheung, M. Henzinger, M. Hoefer, and M. Starnberger, “Combinatorial
auctions with conflict-based externalities,” in 11th International Conference
on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp.
230–243.
ista: 'Cheung YK, Henzinger M, Hoefer M, Starnberger M. 2015. Combinatorial auctions
with conflict-based externalities. 11th International Conference on Web and Internet
Economics. WINE: International Conference on Web and Internet Economics, LNCS,
vol. 9470, 230–243.'
mla: Cheung, Yun Kuen, et al. “Combinatorial Auctions with Conflict-Based Externalities.”
11th International Conference on Web and Internet Economics, vol. 9470,
Springer Nature, 2015, pp. 230–243, doi:10.1007/978-3-662-48995-6_17.
short: Y.K. Cheung, M. Henzinger, M. Hoefer, M. Starnberger, in:, 11th International
Conference on Web and Internet Economics, Springer Nature, 2015, pp. 230–243.
conference:
end_date: 2015-12-12
location: Amsterdam, Netherlands
name: 'WINE: International Conference on Web and Internet Economics'
start_date: 2015-12-09
date_created: 2022-08-08T13:54:32Z
date_published: 2015-12-09T00:00:00Z
date_updated: 2024-11-06T12:10:38Z
day: '09'
doi: 10.1007/978-3-662-48995-6_17
extern: '1'
external_id:
arxiv:
- '1509.09147'
intvolume: ' 9470'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1509.09147
month: '12'
oa: 1
oa_version: Preprint
page: 230–243
publication: 11th International Conference on Web and Internet Economics
publication_identifier:
eisbn:
- '9783662489956'
isbn:
- '9783662489949'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Combinatorial auctions with conflict-based externalities
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9470
year: '2015'
...
---
_id: '11785'
abstract:
- lang: eng
text: "Recently we presented the first algorithm for maintaining the set of nodes
reachable from a source node in a directed graph that is modified by edge deletions
with \U0001D45C(\U0001D45A\U0001D45B) total update time, where \U0001D45A is the
number of edges and \U0001D45B is the number of nodes in the graph [Henzinger
et al. STOC 2014]. The algorithm is a combination of several different algorithms,
each for a different \U0001D45A vs. \U0001D45B trade-off. For the case of \U0001D45A=Θ(\U0001D45B1.5)
the running time is \U0001D442(\U0001D45B2.47), just barely below \U0001D45A\U0001D45B=Θ(\U0001D45B2.5).
In this paper we simplify the previous algorithm using new algorithmic ideas and
achieve an improved running time of \U0001D442̃ (min(\U0001D45A7/6\U0001D45B2/3,\U0001D45A3/4\U0001D45B5/4+\U0001D45C(1),\U0001D45A2/3\U0001D45B4/3+\U0001D45C(1)+\U0001D45A3/7\U0001D45B12/7+\U0001D45C(1))).
This gives, e.g., \U0001D442(\U0001D45B2.36) for the notorious case \U0001D45A=Θ(\U0001D45B1.5).
We obtain the same upper bounds for the problem of maintaining the strongly connected
components of a directed graph undergoing edge deletions. Our algorithms are correct
with high probabililty against an oblivious adversary."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Henzinger M, Krinninger S, Nanongkai D. Improved algorithms for decremental
single-source reachability on directed graphs. In: 42nd International Colloquium
on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:725-736.
doi:10.1007/978-3-662-47672-7_59'
apa: 'Henzinger, M., Krinninger, S., & Nanongkai, D. (2015). Improved algorithms
for decremental single-source reachability on directed graphs. In 42nd International
Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 725–736).
Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_59'
chicago: Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “Improved
Algorithms for Decremental Single-Source Reachability on Directed Graphs.” In
42nd International Colloquium on Automata, Languages and Programming, 9134:725–36.
Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_59.
ieee: M. Henzinger, S. Krinninger, and D. Nanongkai, “Improved algorithms for decremental
single-source reachability on directed graphs,” in 42nd International Colloquium
on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp.
725–736.
ista: 'Henzinger M, Krinninger S, Nanongkai D. 2015. Improved algorithms for decremental
single-source reachability on directed graphs. 42nd International Colloquium on
Automata, Languages and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LNCS, vol. 9134, 725–736.'
mla: Henzinger, Monika, et al. “Improved Algorithms for Decremental Single-Source
Reachability on Directed Graphs.” 42nd International Colloquium on Automata,
Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 725–36, doi:10.1007/978-3-662-47672-7_59.
short: M. Henzinger, S. Krinninger, D. Nanongkai, in:, 42nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 725–736.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T08:51:32Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2024-11-06T12:10:50Z
day: '01'
doi: 10.1007/978-3-662-47672-7_59
extern: '1'
external_id:
arxiv:
- '1612.03856'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1612.03856
month: '01'
oa: 1
oa_version: Preprint
page: 725 - 736
publication: 42nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved algorithms for decremental single-source reachability on directed
graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11786'
abstract:
- lang: eng
text: "In this paper, we develop a dynamic version of the primal-dual method for
optimization problems, and apply it to obtain the following results. (1) For the
dynamic set-cover problem, we maintain an \U0001D442(\U0001D4532)-approximately
optimal solution in \U0001D442(\U0001D453⋅log(\U0001D45A+\U0001D45B)) amortized
update time, where \U0001D453 is the maximum “frequency” of an element, \U0001D45B
is the number of sets, and \U0001D45A is the maximum number of elements in the
universe at any point in time. (2) For the dynamic \U0001D44F-matching problem,
we maintain an \U0001D442(1)-approximately optimal solution in \U0001D442(log3\U0001D45B)
amortized update time, where \U0001D45B is the number of nodes in the graph."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Giuseppe F.
full_name: Italiano, Giuseppe F.
last_name: Italiano
citation:
ama: 'Bhattacharya S, Henzinger M, Italiano GF. Design of dynamic algorithms via
primal-dual method. In: 42nd International Colloquium on Automata, Languages
and Programming. Vol 9134. Springer Nature; 2015:206-218. doi:10.1007/978-3-662-47672-7_17'
apa: 'Bhattacharya, S., Henzinger, M., & Italiano, G. F. (2015). Design of dynamic
algorithms via primal-dual method. In 42nd International Colloquium on Automata,
Languages and Programming (Vol. 9134, pp. 206–218). Kyoto, Japan: Springer
Nature. https://doi.org/10.1007/978-3-662-47672-7_17'
chicago: Bhattacharya, Sayan, Monika Henzinger, and Giuseppe F. Italiano. “Design
of Dynamic Algorithms via Primal-Dual Method.” In 42nd International Colloquium
on Automata, Languages and Programming, 9134:206–18. Springer Nature, 2015.
https://doi.org/10.1007/978-3-662-47672-7_17.
ieee: S. Bhattacharya, M. Henzinger, and G. F. Italiano, “Design of dynamic algorithms
via primal-dual method,” in 42nd International Colloquium on Automata, Languages
and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 206–218.
ista: 'Bhattacharya S, Henzinger M, Italiano GF. 2015. Design of dynamic algorithms
via primal-dual method. 42nd International Colloquium on Automata, Languages and
Programming. ICALP: International Colloquium on Automata, Languages, and Programming,
LNCS, vol. 9134, 206–218.'
mla: Bhattacharya, Sayan, et al. “Design of Dynamic Algorithms via Primal-Dual Method.”
42nd International Colloquium on Automata, Languages and Programming, vol.
9134, Springer Nature, 2015, pp. 206–18, doi:10.1007/978-3-662-47672-7_17.
short: S. Bhattacharya, M. Henzinger, G.F. Italiano, in:, 42nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 206–218.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T09:28:49Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2024-11-06T12:11:02Z
day: '01'
doi: 10.1007/978-3-662-47672-7_17
extern: '1'
external_id:
arxiv:
- '1604.05337'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.05337
month: '01'
oa: 1
oa_version: Preprint
page: 206 - 218
publication: 42nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Design of dynamic algorithms via primal-dual method
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11787'
abstract:
- lang: eng
text: "We present faster algorithms for computing the 2-edge and 2-vertex strongly
connected components of a directed graph. While in undirected graphs the 2-edge
and 2-vertex connected components can be found in linear time, in directed graphs
with m edges and n vertices only rather simple O(m n)-time algorithms were known.
We use a hierarchical sparsification technique to obtain algorithms that run in
time \U0001D442(\U0001D45B2). For 2-edge strongly connected components our algorithm
gives the first running time improvement in 20 years. Additionally we present
an \U0001D442(\U0001D45A2/log\U0001D45B)-time algorithm for 2-edge strongly connected
components, and thus improve over the O(m n) running time also when \U0001D45A=\U0001D442(\U0001D45B).
Our approach extends to k-edge and k-vertex strongly connected components for
any constant k with a running time of \U0001D442(\U0001D45B2log\U0001D45B) for
k-edge-connectivity and \U0001D442(\U0001D45B3) for k-vertex-connectivity."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Henzinger M, Krinninger S, Loitzenbauer V. Finding 2-edge and 2-vertex strongly
connected components in quadratic time. In: 2nd International Colloquium on
Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:713-724.
doi:10.1007/978-3-662-47672-7_58'
apa: 'Henzinger, M., Krinninger, S., & Loitzenbauer, V. (2015). Finding 2-edge
and 2-vertex strongly connected components in quadratic time. In 2nd International
Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 713–724).
Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_58'
chicago: Henzinger, Monika, Sebastian Krinninger, and Veronika Loitzenbauer. “Finding
2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.” In 2nd
International Colloquium on Automata, Languages and Programming, 9134:713–24.
Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_58.
ieee: M. Henzinger, S. Krinninger, and V. Loitzenbauer, “Finding 2-edge and 2-vertex
strongly connected components in quadratic time,” in 2nd International Colloquium
on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp.
713–724.
ista: 'Henzinger M, Krinninger S, Loitzenbauer V. 2015. Finding 2-edge and 2-vertex
strongly connected components in quadratic time. 2nd International Colloquium
on Automata, Languages and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LNCS, vol. 9134, 713–724.'
mla: Henzinger, Monika, et al. “Finding 2-Edge and 2-Vertex Strongly Connected Components
in Quadratic Time.” 2nd International Colloquium on Automata, Languages and
Programming, vol. 9134, Springer Nature, 2015, pp. 713–24, doi:10.1007/978-3-662-47672-7_58.
short: M. Henzinger, S. Krinninger, V. Loitzenbauer, in:, 2nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 713–724.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T09:38:34Z
date_published: 2015-07-06T00:00:00Z
date_updated: 2024-11-06T12:11:13Z
day: '06'
doi: 10.1007/978-3-662-47672-7_58
extern: '1'
external_id:
arxiv:
- '1412.6466'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1412.6466
month: '07'
oa: 1
oa_version: Preprint
page: 713 - 724
publication: 2nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finding 2-edge and 2-vertex strongly connected components in quadratic time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11788'
abstract:
- lang: eng
text: "Ad exchanges are becoming an increasingly popular way to sell advertisement
slots on the internet. An ad exchange is basically a spot market for ad impressions.
A publisher who has already signed contracts reserving advertisement impressions
on his pages can choose between assigning a new ad impression for a new page view
to a contracted advertiser or to sell it at an ad exchange. This leads to an online
revenue maximization problem for the publisher. Given a new impression to sell
decide whether (a) to assign it to a contracted advertiser and if so to which
one or (b) to sell it at the ad exchange and if so at which reserve price. We
make no assumptions about the distribution of the advertiser valuations that participate
in the ad exchange and show that there exists a simple primal-dual based online
algorithm, whose lower bound for the revenue converges to \U0001D445\U0001D434\U0001D437\U0001D44B+\U0001D445\U0001D434(1−1/\U0001D452),
where \U0001D445\U0001D434\U0001D437\U0001D44B is the revenue that the optimum
algorithm achieves from the ad exchange and \U0001D445\U0001D434 is the revenue
that the optimum algorithm achieves from the contracted advertisers."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Dvořák W, Henzinger M. Online ad assignment with an ad exchange. In: 12th
International Workshop of Approximation and Online Algorithms. Vol 8952. Springer
Nature; 2015:156–167. doi:10.1007/978-3-319-18263-6_14'
apa: 'Dvořák, W., & Henzinger, M. (2015). Online ad assignment with an ad exchange.
In 12th International Workshop of Approximation and Online Algorithms (Vol.
8952, pp. 156–167). Wroclaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-319-18263-6_14'
chicago: Dvořák, Wolfgang, and Monika Henzinger. “Online Ad Assignment with an Ad
Exchange.” In 12th International Workshop of Approximation and Online Algorithms,
8952:156–167. Springer Nature, 2015. https://doi.org/10.1007/978-3-319-18263-6_14.
ieee: W. Dvořák and M. Henzinger, “Online ad assignment with an ad exchange,” in
12th International Workshop of Approximation and Online Algorithms, Wroclaw,
Poland, 2015, vol. 8952, pp. 156–167.
ista: 'Dvořák W, Henzinger M. 2015. Online ad assignment with an ad exchange. 12th
International Workshop of Approximation and Online Algorithms. WAOA: International
Workshop on Approximation and Online Algorithms, LNCS, vol. 8952, 156–167.'
mla: Dvořák, Wolfgang, and Monika Henzinger. “Online Ad Assignment with an Ad Exchange.”
12th International Workshop of Approximation and Online Algorithms, vol.
8952, Springer Nature, 2015, pp. 156–167, doi:10.1007/978-3-319-18263-6_14.
short: W. Dvořák, M. Henzinger, in:, 12th International Workshop of Approximation
and Online Algorithms, Springer Nature, 2015, pp. 156–167.
conference:
end_date: 2014-09-12
location: Wroclaw, Poland
name: 'WAOA: International Workshop on Approximation and Online Algorithms'
start_date: 2014-09-11
date_created: 2022-08-11T09:43:32Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2024-11-06T12:11:24Z
day: '01'
doi: 10.1007/978-3-319-18263-6_14
extern: '1'
external_id:
arxiv:
- '1604.05603'
intvolume: ' 8952'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.05603
month: '01'
oa: 1
oa_version: Preprint
page: 156–167
publication: 12th International Workshop of Approximation and Online Algorithms
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Online ad assignment with an ad exchange
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8952
year: '2015'
...