---
OA_place: repository
OA_type: green
_id: '772'
abstract:
- lang: eng
text: Lock-free concurrent algorithms guarantee that some concurrent operation will
always make progress in a finite number of steps. Yet programmers prefer to treat
concurrent code as if it were wait-free, guaranteeing that all operations always
make progress. Unfortunately, designing wait-free algorithms is generally a very
complex task, and the resulting algorithms are not always efficient. While obtaining
efficient wait-free algorithms has been a long-time goal for the theory community,
most non-blocking commercial code is only lock-free. This paper suggests a simple
solution to this problem. We show that, for a large class of lock-free algorithms,
under scheduling conditions which approximate those found in commercial hardware
architectures, lock-free algorithms behave as if they are wait-free. In other
words, programmers can keep on designing simple lock-free algorithms instead of
complex wait-free ones, and in practice, they will get wait-free progress. Our
main contribution is a new way of analyzing a general class of lock-free algorithms
under a stochastic scheduler. Our analysis relates the individual performance
of processes with the global performance of the system using Markov chain lifting
between a complex per-process chain and a simpler system progress chain. We show
that lock-free algorithms are not only wait-free with probability 1, but that
in fact a general subset of lock-free algorithms can be closely bounded in terms
of the average number of steps required until an operation completes. To the best
of our knowledge, this is the first attempt to analyze progress conditions, typically
stated in relation to a worst case adversary, in a stochastic model capturing
their expected asymptotic behavior.
acknowledgement: "Dan Alistarh - Part of this work was performed while the author
was a Postdoctoral Associate at MIT CSAIL, where he was supported by SNF\r\nPostdoctoral
Fellows Program, NSF grant CCF-1217921, DoE\r\nASCR grant ER26116/DE-SC0008923,
and by grants from the Oracle and Intel corporations.\r\nKeron Censor-Hillel - Shalon
Fellow\r\nNir Shavit - This work was supported in part by NSF grants CCF-1217921
and\r\nCCF-1301926, DoE ASCR grant ER26116/DE-SC0008923, and\r\nby grants from the
Oracle and Intel corporations."
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Keren
full_name: Censor Hillel, Keren
last_name: Censor Hillel
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Censor Hillel K, Shavit N. Are lock-free concurrent algorithms
practically wait-free? In: Proceedings of the Forty-Sixth Annual ACM Symposium
on Theory of Computing. ACM; 2014:714-723. doi:10.1145/2591796.2591836'
apa: 'Alistarh, D.-A., Censor Hillel, K., & Shavit, N. (2014). Are lock-free
concurrent algorithms practically wait-free? In Proceedings of the forty-sixth
annual ACM symposium on Theory of computing (pp. 714–723). New York, NY, United
States: ACM. https://doi.org/10.1145/2591796.2591836'
chicago: Alistarh, Dan-Adrian, Keren Censor Hillel, and Nir Shavit. “Are Lock-Free
Concurrent Algorithms Practically Wait-Free?” In Proceedings of the Forty-Sixth
Annual ACM Symposium on Theory of Computing, 714–23. ACM, 2014. https://doi.org/10.1145/2591796.2591836.
ieee: D.-A. Alistarh, K. Censor Hillel, and N. Shavit, “Are lock-free concurrent
algorithms practically wait-free?,” in Proceedings of the forty-sixth annual
ACM symposium on Theory of computing, New York, NY, United States, 2014, pp.
714–723.
ista: 'Alistarh D-A, Censor Hillel K, Shavit N. 2014. Are lock-free concurrent algorithms
practically wait-free? Proceedings of the forty-sixth annual ACM symposium on
Theory of computing. STOC: Symposium on Theory of Computing, 714–723.'
mla: Alistarh, Dan-Adrian, et al. “Are Lock-Free Concurrent Algorithms Practically
Wait-Free?” Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of
Computing, ACM, 2014, pp. 714–23, doi:10.1145/2591796.2591836.
short: D.-A. Alistarh, K. Censor Hillel, N. Shavit, in:, Proceedings of the Forty-Sixth
Annual ACM Symposium on Theory of Computing, ACM, 2014, pp. 714–723.
conference:
end_date: 2014-06-03
location: New York, NY, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2014-05-31
date_created: 2018-12-11T11:48:25Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2026-09-09T12:41:19Z
day: '01'
doi: 10.1145/2591796.2591836
extern: '1'
external_id:
arxiv:
- '1311.3200'
fulldoi: https://doi.org/10.1145/2591796.2591836
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1311.3200
month: '01'
oa: 1
oa_version: Preprint
page: 714 - 723
publication: Proceedings of the forty-sixth annual ACM symposium on Theory of computing
publication_identifier:
isbn:
- '9781450327107'
publication_status: published
publisher: ACM
publist_id: '6885'
status: public
title: Are lock-free concurrent algorithms practically wait-free?
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2014'
...
---
OA_place: publisher
OA_type: gold
_id: '809'
abstract:
- lang: eng
text: The assembly of HIV-1 is mediated by oligomerization of the major structural
polyprotein, Gag, into a hexameric protein lattice at the plasma membrane of the
infected cell. This leads to budding and release of progeny immature virus particles.
Subsequent proteolytic cleavage of Gag triggers rearrangement of the particles
to form mature infectious virions. Obtaining a structural model of the assembled
lattice of Gag within immature virus particles is necessary to understand the
interactions that mediate assembly of HIV-1 particles in the infected cell, and
to describe the substrate that is subsequently cleaved by the viral protease.
An 8-Å resolution structure of an immature virus-like tubular array assembled
from a Gag-derived protein of the related retrovirus Mason-Pfizer monkey virus
(M-PMV) has previously been reported, and a model for the arrangement of the HIV-1
capsid (CA) domains has been generated based on homology to this structure. Here
we have assembled tubular arrays of a HIV-1 Gag-derived protein with an immature-like
arrangement of the C-terminal CA domains and have solved their structure by using
hybrid cryo-EM and tomography analysis. The structure reveals the arrangement
of the C-terminal domain of CA within an immature-like HIV-1 Gag lattice, and
provides, to our knowledge, the first high-resolution view of the region immediately
downstream of CA, which is essential for assembly, and is significantly different
from the respective region in M-PMV. Our results reveal a hollow column of density
for this region in HIV-1 that is compatible with the presence of a six-helix bundle
at this position.
acknowledgement: 'The authors thank Leonardo Trabuco for help with running MDFF, Maria
Anders for preparing amprenavir-inhibited virus, Marie-Christine Vaney for help
with X-ray data processing and structure refinement, Ahmed Haouz and Patrick Weber
(robotized crystallization facility Proteopole, Institut Pasteur) for help in crystal
screening, and the European Molecular Biology Laboratory (EMBL) Information Technology
Services Unit and Frank Thommen for technical support. This study was supported
by Deutsche Forschungsgemeinschaft Grants BR 3635/2-1 (to J.A.G.B.) and KR 906/7-1
(to H.-G.K.) and a Federation of European Biochemical Societies long-term fellowship
(to T.A.M.B.). The laboratory of J.A.G.B. acknowledges financial support from EMBL
and the Chica und Heinz Schaller Stiftung. '
article_processing_charge: No
article_type: original
author:
- first_name: Tanmay
full_name: Bharata, Tanmay
last_name: Bharata
- first_name: Luis
full_name: Menendez, Luis
last_name: Menendez
- first_name: Wim
full_name: Hagena, Wim
last_name: Hagena
- first_name: Vanda
full_name: Luxd, Vanda
last_name: Luxd
- first_name: Sebastien
full_name: Igonete, Sebastien
last_name: Igonete
- first_name: Martin
full_name: Schorba, Martin
last_name: Schorba
- first_name: Florian
full_name: Schur, Florian
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
- first_name: Hans
full_name: Kraüsslich, Hans
last_name: Kraüsslich
- first_name: John
full_name: Briggsa, John
last_name: Briggsa
citation:
ama: Bharata T, Menendez L, Hagena W, et al. Cryo electron microscopy of tubular
arrays of HIV-1 Gag resolves structures essential for immature virus assembly.
PNAS. 2014;111(22):8233-8238. doi:10.1073/pnas.1401455111
apa: Bharata, T., Menendez, L., Hagena, W., Luxd, V., Igonete, S., Schorba, M.,
… Briggsa, J. (2014). Cryo electron microscopy of tubular arrays of HIV-1 Gag
resolves structures essential for immature virus assembly. PNAS. National
Academy of Sciences. https://doi.org/10.1073/pnas.1401455111
chicago: Bharata, Tanmay, Luis Menendez, Wim Hagena, Vanda Luxd, Sebastien Igonete,
Martin Schorba, Florian KM Schur, Hans Kraüsslich, and John Briggsa. “Cryo Electron
Microscopy of Tubular Arrays of HIV-1 Gag Resolves Structures Essential for Immature
Virus Assembly.” PNAS. National Academy of Sciences, 2014. https://doi.org/10.1073/pnas.1401455111.
ieee: T. Bharata et al., “Cryo electron microscopy of tubular arrays of HIV-1
Gag resolves structures essential for immature virus assembly,” PNAS, vol.
111, no. 22. National Academy of Sciences, pp. 8233–8238, 2014.
ista: Bharata T, Menendez L, Hagena W, Luxd V, Igonete S, Schorba M, Schur FK, Kraüsslich
H, Briggsa J. 2014. Cryo electron microscopy of tubular arrays of HIV-1 Gag resolves
structures essential for immature virus assembly. PNAS. 111(22), 8233–8238.
mla: Bharata, Tanmay, et al. “Cryo Electron Microscopy of Tubular Arrays of HIV-1
Gag Resolves Structures Essential for Immature Virus Assembly.” PNAS, vol.
111, no. 22, National Academy of Sciences, 2014, pp. 8233–38, doi:10.1073/pnas.1401455111.
short: T. Bharata, L. Menendez, W. Hagena, V. Luxd, S. Igonete, M. Schorba, F.K.
Schur, H. Kraüsslich, J. Briggsa, PNAS 111 (2014) 8233–8238.
date_created: 2018-12-11T11:48:37Z
date_published: 2014-06-03T00:00:00Z
date_updated: 2026-09-09T12:23:40Z
day: '03'
doi: 10.1073/pnas.1401455111
extern: '1'
external_id:
pmid:
- '24843179'
fulldoi: https://doi.org/10.1073/pnas.1401455111
intvolume: ' 111'
issue: '22'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '06'
oa_version: None
page: 8233 - 8238
pmid: 1
publication: PNAS
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
publist_id: '6838'
status: public
title: Cryo electron microscopy of tubular arrays of HIV-1 Gag resolves structures
essential for immature virus assembly
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 111
year: '2014'
...
---
OA_type: closed access
_id: '771'
abstract:
- lang: eng
text: 'We consider the following natural problem: n failure-prone servers, communicating
synchronously through message passing, must assign themselves one-to-one to n
distinct items. Existing literature suggests two possible approaches to this problem.
First, model it as an instance of tight renaming in synchronous message-passing
systems; for deterministic solutions, a tight bound of ©(logn) communication rounds
is known. Second, model the scenario as an instance of randomized load-balancing,
for which elegant sub-logarithmic solutions exist. However, careful examination
reveals that known load-balancing schemes do not apply to our scenario, because
they either do not tolerate faults or do not ensure one-to-one allocation. It
is thus natural to ask if sublogarithmic solutions exist for this apparently simple
but intriguing problem. In this paper, we combine the two approaches to provide
a new randomized solution for tight renaming, which terminates in O (log log n)
communication rounds with high probability, against a strong adaptive adversary.
Our solution, called Balls-into-Leaves, combines the deterministic approach with
a new randomized scheme to obtain perfectly balanced allocations. The algorithm
arranges the items as leaves of a tree, and participants repeatedly perform random
choices among the leaves. The algorithm exchanges information in each round to
split the participants into progressively smaller groups whose random choices
do not conflict. We then extend the algorithm to terminate early in O(log log)
rounds w.h.p., where is the actual number of failures. These results imply an
exponential separation between deterministic and randomized algorithms for the
tight renaming problem in message-passing systems.'
acknowledgement: "Dan Alistarh was partially supported by the SNF Post-\r\ndoctoral
Fellows Program, NSF grant CCF-1217921, DoE\r\nASCR grant ER26116/DE-SC0008923,
and by grants from\r\nthe Oracle and Intel corporations.\r\nOksana Denysyuk and
Lu ́ıs Rodrigues were partially supported by Funda ̧c ̃ao para a Ciˆencia e Tecnologia
(FCT) via\r\nthe project PEPITA (PTDC/EEI-SCR/2776/2012) and via\r\nthe INESC-ID
multi-annual funding through the PIDDAC\r\nProgram fund grant, under project PEst-OE/EEI/LA0021/\r\n2013.\r\nNir
Shavit was supported in part by NSF grants CCF-1217921 and CCF-1301926, DoE ASCR
grant ER26116/DE-SC0008923, and by grants from the Oracle and Intel corporations."
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Oksana
full_name: Denysyuk, Oksana
last_name: Denysyuk
- first_name: Luís
full_name: Rodrígues, Luís
last_name: Rodrígues
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Denysyuk O, Rodrígues L, Shavit N. Balls-into-Leaves: Sub-logarithmic
renaming in synchronous message-passing systems. In: Proceedings of the 2014
ACM Symposium on Principles of Distributed Computing. ACM; 2014:232-241. doi:10.1145/2611462.2611499'
apa: 'Alistarh, D.-A., Denysyuk, O., Rodrígues, L., & Shavit, N. (2014). Balls-into-Leaves:
Sub-logarithmic renaming in synchronous message-passing systems. In Proceedings
of the 2014 ACM symposium on Principles of distributed computing (pp. 232–241).
Paris, France: ACM. https://doi.org/10.1145/2611462.2611499'
chicago: 'Alistarh, Dan-Adrian, Oksana Denysyuk, Luís Rodrígues, and Nir Shavit.
“Balls-into-Leaves: Sub-Logarithmic Renaming in Synchronous Message-Passing Systems.”
In Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing,
232–41. ACM, 2014. https://doi.org/10.1145/2611462.2611499.'
ieee: 'D.-A. Alistarh, O. Denysyuk, L. Rodrígues, and N. Shavit, “Balls-into-Leaves:
Sub-logarithmic renaming in synchronous message-passing systems,” in Proceedings
of the 2014 ACM symposium on Principles of distributed computing, Paris, France,
2014, pp. 232–241.'
ista: 'Alistarh D-A, Denysyuk O, Rodrígues L, Shavit N. 2014. Balls-into-Leaves:
Sub-logarithmic renaming in synchronous message-passing systems. Proceedings of
the 2014 ACM symposium on Principles of distributed computing. PODC: Principles
of Distributed Computing, 232–241.'
mla: 'Alistarh, Dan-Adrian, et al. “Balls-into-Leaves: Sub-Logarithmic Renaming
in Synchronous Message-Passing Systems.” Proceedings of the 2014 ACM Symposium
on Principles of Distributed Computing, ACM, 2014, pp. 232–41, doi:10.1145/2611462.2611499.'
short: D.-A. Alistarh, O. Denysyuk, L. Rodrígues, N. Shavit, in:, Proceedings of
the 2014 ACM Symposium on Principles of Distributed Computing, ACM, 2014, pp.
232–241.
conference:
end_date: 2014-07-18
location: Paris, France
name: 'PODC: Principles of Distributed Computing'
start_date: 2014-07-15
date_created: 2018-12-11T11:48:25Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2026-09-09T12:37:18Z
day: '01'
doi: 10.1145/2611462.2611499
extern: '1'
fulldoi: https://doi.org/10.1145/2611462.2611499
language:
- iso: eng
month: '01'
oa_version: None
page: 232 - 241
publication: Proceedings of the 2014 ACM symposium on Principles of distributed computing
publication_identifier:
isbn:
- '9781450329446'
publication_status: published
publisher: ACM
publist_id: '6884'
status: public
title: 'Balls-into-Leaves: Sub-logarithmic renaming in synchronous message-passing
systems'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2014'
...
---
OA_type: closed access
_id: '774'
abstract:
- lang: eng
text: Lock-free concurrent algorithms guarantee that some concurrent operation will
always make progress in a finite number of steps. Yet programmers would prefer
to treat concurrent code as if it were wait-free, guaranteeing that all operations
always make progress. Unfortunately, designing wait-free algorithms is in general
a complex undertaking, and the resulting algorithms are not always efficient,
so most non-blocking commercial code is only lock-free, and the design of efficient
wait-free algorithms has been left to the academic community. In [2], we suggest
a solution to this problem. We show that, for a large class of lock-free algorithms,
under scheduling conditions which approximate those found in commercial hardware
architectures, lock-free algorithms behave as if they are wait-free. In other
words, programmers can keep on designing simple lock-free algorithms instead of
complex wait-free ones, and in practice, they will get wait-free progress. Our
main contribution is a new way of analyzing a general class of lock-free algorithms
under a stochastic scheduler. Our analysis relates the individual performance
of processes with the global performance of the system using Markov chain lifting
between a complex per-process chain and a simpler system progress chain. We show
that lock-free algorithms are not only wait-free with probability 1, but that
in fact a broad subset of lock-free algorithms can be closely bounded in terms
of the average number of steps required until an operation completes.
acknowledgement: "Dan Alistarh - Part of this work was performed while the
\ author was a\r\nPostdoctoral Associate at MIT CSAIL, where he was supported
\ by SNF Postdoctoral Fellows Program, NSF grant\r\nCCF-1217921, DoE ASCR
grant ER26116/DE-SC0008923,\r\nand by grants from the Oracle and Intel corporations.\r\nKeren
Censor-Hille - Shalon Fellow\r\nNir Shavit - This work was supported in part
\ by NSF grants CCF-1217921 and CCF-1301926, DoE ASCR grant ER26116/DE-\r\nSC0008923,
and by grants from the Oracle and Intel corporations."
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Keren
full_name: Censor Hille, Keren
last_name: Censor Hille
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Censor Hille K, Shavit N. Brief announcement: Are lock-free
concurrent algorithms practically wait-free? In: Proceedings of the 2014 ACM
Symposium on Principles of Distributed Computing. ACM; 2014:50-52. doi:10.1145/2611462.2611502'
apa: 'Alistarh, D.-A., Censor Hille, K., & Shavit, N. (2014). Brief announcement:
Are lock-free concurrent algorithms practically wait-free? In Proceedings of
the 2014 ACM symposium on Principles of distributed computing (pp. 50–52).
Paris, France: ACM. https://doi.org/10.1145/2611462.2611502'
chicago: 'Alistarh, Dan-Adrian, Keren Censor Hille, and Nir Shavit. “Brief Announcement:
Are Lock-Free Concurrent Algorithms Practically Wait-Free?” In Proceedings
of the 2014 ACM Symposium on Principles of Distributed Computing, 50–52. ACM,
2014. https://doi.org/10.1145/2611462.2611502.'
ieee: 'D.-A. Alistarh, K. Censor Hille, and N. Shavit, “Brief announcement: Are
lock-free concurrent algorithms practically wait-free?,” in Proceedings of
the 2014 ACM symposium on Principles of distributed computing, Paris, France,
2014, pp. 50–52.'
ista: 'Alistarh D-A, Censor Hille K, Shavit N. 2014. Brief announcement: Are lock-free
concurrent algorithms practically wait-free? Proceedings of the 2014 ACM symposium
on Principles of distributed computing. PODC: Principles of Distributed Computing,
50–52.'
mla: 'Alistarh, Dan-Adrian, et al. “Brief Announcement: Are Lock-Free Concurrent
Algorithms Practically Wait-Free?” Proceedings of the 2014 ACM Symposium on
Principles of Distributed Computing, ACM, 2014, pp. 50–52, doi:10.1145/2611462.2611502.'
short: D.-A. Alistarh, K. Censor Hille, N. Shavit, in:, Proceedings of the 2014
ACM Symposium on Principles of Distributed Computing, ACM, 2014, pp. 50–52.
conference:
end_date: 2014-07-18
location: Paris, France
name: 'PODC: Principles of Distributed Computing'
start_date: 2014-07-15
date_created: 2018-12-11T11:48:26Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2026-09-09T12:30:17Z
day: '01'
doi: 10.1145/2611462.2611502
extern: '1'
fulldoi: https://doi.org/10.1145/2611462.2611502
language:
- iso: eng
month: '01'
oa_version: None
page: 50 - 52
publication: Proceedings of the 2014 ACM symposium on Principles of distributed computing
publication_identifier:
isbn:
- '9781450329446'
publication_status: published
publisher: ACM
publist_id: '6882'
status: public
title: 'Brief announcement: Are lock-free concurrent algorithms practically wait-free?'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2014'
...
---
OA_type: closed access
_id: '768'
abstract:
- lang: eng
text: 'Task allocation is a classic distributed problem in which a set of p potentially
faulty processes must cooperate to perform a set of tasks. This paper considers
a new dynamic version of the problem, in which tasks are injected adversarially
during an asynchronous execution. We give the first asynchronous shared-memory
algorithm for dynamic task allocation, and we prove that our solution is optimal
within logarithmic factors. The main algorithmic idea is a randomized concurrent
data structure called a dynamic to-do tree, which allows processes to pick new
tasks to perform at random from the set of available tasks, and to insert tasks
at random empty locations in the data structure. Our analysis shows that these
properties avoid duplicating work unnecessarily. On the other hand, since the
adversary controls the input as well the scheduling, it can induce executions
where lots of processes contend for a few available tasks, which is inefficient.
However, we prove that every algorithm has the same problem: given an arbitrary
input, if OPT is the worst-case complexity of the optimal algorithm on that input,
then the expected work complexity of our algorithm on the same input is O(OPT
log3 m), where m is an upper bound on the number of tasks that are present in
the system at any given time.'
acknowledgement: "Dan Alistarh - This author was supported by the SNF Postdoctoral
Fellows Program, NSF grant CCF-1217921, DoE ASCR grant ER26116/DE-SC0008923, and
by grants from the Oracle and Intel corporations.\r\nJames Aspnes - Supported in
part by NSF grant CCF-0916389.\r\nMichael A. Bender - This research was supported
in part by NSF grants CCF 1114809, CCF 1217708, IIS 1247726, and IIS 1251137.\r\nRati
Gelashvili - This work was supported in part by NSF grants CCF-1217921, CCF-1301926,
DoE ASCR grant ER26116/DE-SC0008923, and by grants from the Oracle and Intel corporations.\r\nSeth
Gilbert - Supported by Singapore AcRF-2 MOE2011-T2-2-042.\r\n"
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Michael
full_name: Bender, Michael
last_name: Bender
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
citation:
ama: 'Alistarh D-A, Aspnes J, Bender M, Gelashvili R, Gilbert S. Dynamic task allocation
in asynchronous shared memory. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM
Symposium on Discrete Algorithms. SIAM; 2014:416-435. doi:10.1137/1.9781611973402.31'
apa: 'Alistarh, D.-A., Aspnes, J., Bender, M., Gelashvili, R., & Gilbert, S.
(2014). Dynamic task allocation in asynchronous shared memory. In Proceedings
of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms (pp.
416–435). Portland, OR, United States: SIAM. https://doi.org/10.1137/1.9781611973402.31'
chicago: Alistarh, Dan-Adrian, James Aspnes, Michael Bender, Rati Gelashvili, and
Seth Gilbert. “Dynamic Task Allocation in Asynchronous Shared Memory.” In Proceedings
of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 416–35.
SIAM, 2014. https://doi.org/10.1137/1.9781611973402.31.
ieee: D.-A. Alistarh, J. Aspnes, M. Bender, R. Gelashvili, and S. Gilbert, “Dynamic
task allocation in asynchronous shared memory,” in Proceedings of the twenty-fifth
annual ACM-SIAM symposium on Discrete algorithms, Portland, OR, United States,
2014, pp. 416–435.
ista: 'Alistarh D-A, Aspnes J, Bender M, Gelashvili R, Gilbert S. 2014. Dynamic
task allocation in asynchronous shared memory. Proceedings of the twenty-fifth
annual ACM-SIAM symposium on Discrete algorithms. SODA: Symposium on Discrete
Algorithms, 416–435.'
mla: Alistarh, Dan-Adrian, et al. “Dynamic Task Allocation in Asynchronous Shared
Memory.” Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete
Algorithms, SIAM, 2014, pp. 416–35, doi:10.1137/1.9781611973402.31.
short: D.-A. Alistarh, J. Aspnes, M. Bender, R. Gelashvili, S. Gilbert, in:, Proceedings
of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014,
pp. 416–435.
conference:
end_date: 2014-01-07
location: Portland, OR, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2014-01-05
date_created: 2018-12-11T11:48:24Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2026-09-09T12:45:04Z
day: '01'
doi: 10.1137/1.9781611973402.31
extern: '1'
fulldoi: https://doi.org/10.1137/1.9781611973402.31
language:
- iso: eng
month: '01'
oa_version: None
page: 416 - 435
publication: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete
algorithms
publication_identifier:
isbn:
- '9781611973389'
publication_status: published
publisher: SIAM
publist_id: '6886'
status: public
title: Dynamic task allocation in asynchronous shared memory
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2014'
...
---
OA_type: closed access
_id: '770'
abstract:
- lang: eng
text: 'Dynamic memory reclamation is arguably the biggest open problem in concurrent
data structure design: All known solutions induce high overhead, or must be customized
to the specific data structure by the programmer, or both. This paper presents
StackTrack, the first concurrent memory reclamation scheme that can be applied
automatically by a compiler, while maintaining efficiency. StackTrack eliminates
most of the expensive bookkeeping required for memory reclamation by leveraging
the power of hardware transactional memory (HTM) in a new way: it tracks thread
variables dynamically, and in an atomic fashion. This effectively makes all memory
references visible without having threads pay the overhead of writing out this
information. Our empirical results show that this new approach matches or outperforms
prior, non-automated, techniques.'
acknowledgement: "Dan Alistarh - Part of this work was performed while the
\ author was a Postdoctoral\r\nAssociate a MIT CSAIL, supported in part by NSF
grant CCF-1217921,\r\nDoE ASCR grant ER26116/DE-SC0008923, and by grants from the
Oracle\r\nand Intel corporations.\r\nPatrick Eugester - Supported in part by DARPA
grant N11AP20014 and NSF grant CNS-\r\n1117065.\r\nMaurice Herlihy - Supported by
NSF grant 1301924.\r\nNir Shavit - Supported in part by NSF grants CCF-1217921 and
CCF-1301926, DoE\r\nASCR grant ER26116/DE-SC0008923, and by grants from the Oracle
and\r\nIntel corporations."
article_number: '25'
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Patrick
full_name: Eugster, Patrick
last_name: Eugster
- first_name: Maurice
full_name: Herlihy, Maurice
last_name: Herlihy
- first_name: Alexander
full_name: Matveev, Alexander
last_name: Matveev
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Eugster P, Herlihy M, Matveev A, Shavit N. StackTrack: An automated
transactional approach to concurrent memory reclamation. In: Proceedings of
the Ninth European Conference on Computer Systems. ACM; 2014. doi:10.1145/2592798.2592808'
apa: 'Alistarh, D.-A., Eugster, P., Herlihy, M., Matveev, A., & Shavit, N. (2014).
StackTrack: An automated transactional approach to concurrent memory reclamation.
In Proceedings of the Ninth European Conference on Computer Systems. Amsterdam,
The Netherlands: ACM. https://doi.org/10.1145/2592798.2592808'
chicago: 'Alistarh, Dan-Adrian, Patrick Eugster, Maurice Herlihy, Alexander Matveev,
and Nir Shavit. “StackTrack: An Automated Transactional Approach to Concurrent
Memory Reclamation.” In Proceedings of the Ninth European Conference on Computer
Systems. ACM, 2014. https://doi.org/10.1145/2592798.2592808.'
ieee: 'D.-A. Alistarh, P. Eugster, M. Herlihy, A. Matveev, and N. Shavit, “StackTrack:
An automated transactional approach to concurrent memory reclamation,” in Proceedings
of the Ninth European Conference on Computer Systems, Amsterdam, The Netherlands,
2014.'
ista: 'Alistarh D-A, Eugster P, Herlihy M, Matveev A, Shavit N. 2014. StackTrack:
An automated transactional approach to concurrent memory reclamation. Proceedings
of the Ninth European Conference on Computer Systems. EuroSys: European Conference
on Computer Systems, 25.'
mla: 'Alistarh, Dan-Adrian, et al. “StackTrack: An Automated Transactional Approach
to Concurrent Memory Reclamation.” Proceedings of the Ninth European Conference
on Computer Systems, 25, ACM, 2014, doi:10.1145/2592798.2592808.'
short: D.-A. Alistarh, P. Eugster, M. Herlihy, A. Matveev, N. Shavit, in:, Proceedings
of the Ninth European Conference on Computer Systems, ACM, 2014.
conference:
end_date: 2014-04-16
location: Amsterdam, The Netherlands
name: 'EuroSys: European Conference on Computer Systems'
start_date: 2014-04-14
date_created: 2018-12-11T11:48:24Z
date_published: 2014-04-14T00:00:00Z
date_updated: 2026-09-09T13:08:42Z
day: '14'
doi: 10.1145/2592798.2592808
extern: '1'
fulldoi: https://doi.org/10.1145/2592798.2592808
language:
- iso: eng
month: '04'
oa_version: None
publication: Proceedings of the Ninth European Conference on Computer Systems
publication_identifier:
isbn:
- '9781450327046'
publication_status: published
publisher: ACM
publist_id: '6888'
status: public
title: 'StackTrack: An automated transactional approach to concurrent memory reclamation'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2014'
...
---
OA_type: closed access
_id: '769'
abstract:
- lang: eng
text: 'This article presents the first tight bounds on the time complexity of shared-memory
renaming, a fundamental problem in distributed computing in which a set of processes
need to pick distinct identifiers from a small namespace. We first prove an individual
lower bound of ω(k) process steps for deterministic renaming into any namespace
of size subexponential in k, where k is the number of participants. The bound
is tight: it draws an exponential separation between deterministic and randomized
solutions, and implies new tight bounds for deterministic concurrent fetch-and-increment
counters, queues, and stacks. The proof is based on a new reduction from renaming
to another fundamental problem in distributed computing: mutual exclusion. We
complement this individual bound with a global lower bound of ω(klog(k/c)) on
the total step complexity of renaming into a namespace of size ck, for any c =
1. This result applies to randomized algorithms against a strong adversary, and
helps derive new global lower bounds for randomized approximate counter implementations,
that are tight within logarithmic factors. On the algorithmic side, we give a
protocol that transforms any sorting network into a randomized strong adaptive
renaming algorithm, with expected cost equal to the depth of the sorting network.
This gives a tight adaptive renaming algorithm with expected step complexity O(log
k), where k is the contention in the current execution. This algorithm is the
first to achieve sublinear time, and it is time-optimal as per our randomized
lower bound. Finally, we use this renaming protocol to build monotone-consistent
counters with logarithmic step complexity and linearizable fetch-and-increment
registers with polylogarithmic cost.'
acknowledgement: "The work of J. Aspnes was supported in part by NSF grant CCF-0916389.
The work of S. Gilbert was\r\nsupported by Singapore AcRF-2 MOE 2011-T2-2-042.\r\nK.
Censor-Hillel is a Shalon Fellow. Part of this work was performed while K. Censor-Hillel
was a postdoc at\r\nMIT, supported by the Simons Postdoctoral Fellowship."
article_processing_charge: No
article_type: original
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Keren
full_name: Censor Hillel, Keren
last_name: Censor Hillel
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
citation:
ama: Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Guerraoui R. Tight bounds
for asynchronous renaming. Journal of the ACM. 2014;61(3):1-51. doi:10.1145/2597630
apa: Alistarh, D.-A., Aspnes, J., Censor Hillel, K., Gilbert, S., & Guerraoui,
R. (2014). Tight bounds for asynchronous renaming. Journal of the ACM.
ACM. https://doi.org/10.1145/2597630
chicago: Alistarh, Dan-Adrian, James Aspnes, Keren Censor Hillel, Seth Gilbert,
and Rachid Guerraoui. “Tight Bounds for Asynchronous Renaming.” Journal of
the ACM. ACM, 2014. https://doi.org/10.1145/2597630.
ieee: D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, and R. Guerraoui,
“Tight bounds for asynchronous renaming,” Journal of the ACM, vol. 61,
no. 3. ACM, pp. 1–51, 2014.
ista: Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Guerraoui R. 2014. Tight
bounds for asynchronous renaming. Journal of the ACM. 61(3), 1–51.
mla: Alistarh, Dan-Adrian, et al. “Tight Bounds for Asynchronous Renaming.” Journal
of the ACM, vol. 61, no. 3, ACM, 2014, pp. 1–51, doi:10.1145/2597630.
short: D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, R. Guerraoui, Journal
of the ACM 61 (2014) 1–51.
date_created: 2018-12-11T11:48:24Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2026-09-09T12:47:00Z
day: '01'
doi: 10.1145/2597630
extern: '1'
fulldoi: https://doi.org/10.1145/2597630
intvolume: ' 61'
issue: '3'
language:
- iso: eng
month: '05'
oa_version: None
page: 1-51
publication: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '6887'
status: public
title: Tight bounds for asynchronous renaming
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 61
year: '2014'
...
---
_id: '451'
abstract:
- lang: eng
text: We introduce algorithms for the computation of homology, cohomology, and related
operations on cubical cell complexes, using the technique based on a chain contraction
from the original chain complex to a reduced one that represents its homology.
This work is based on previous results for simplicial complexes, and uses Serre’s
diagonalization for cubical cells. An implementation in C++ of the introduced
algorithms is available at http://www.pawelpilarczyk.com/chaincon/ together with
some examples. The paper is self-contained as much as possible, and is written
at a very elementary level, so that basic knowledge of algebraic topology should
be sufficient to follow it.
acknowledgement: 'This research was partially supported from Fundo Europeu de Desenvolvimento
Regional (FEDER) through COMPETE – Programa Operacional Factores de Compe titividade
(POFC) and from the Portuguese national funds through Fundacaoparaa Ciencia e a
Tecnologia (FCT) in the framework of the research project FCOMP-01-0124-FEDER-010645(ref.
FCT PTDC/MAT/098871/2008), as well as from the funds distributed through the European
Science Foundation (ESF) Research Networking Programme on “Applied and Computational
Algebraic Topology” (ACAT). P.Real was additionally supported by the Spanish Ministry
of Science and Innovation, project no. MTM2009-12716. '
article_processing_charge: No
article_type: original
author:
- first_name: Pawel
full_name: Pilarczyk, Pawel
id: 3768D56A-F248-11E8-B48F-1D18A9856A87
last_name: Pilarczyk
- first_name: Pedro
full_name: Real, Pedro
last_name: Real
citation:
ama: Pilarczyk P, Real P. Computation of cubical homology, cohomology, and (co)homological
operations via chain contraction. Advances in Computational Mathematics.
2014;41(1):253-275. doi:10.1007/s10444-014-9356-1
apa: Pilarczyk, P., & Real, P. (2014). Computation of cubical homology, cohomology,
and (co)homological operations via chain contraction. Advances in Computational
Mathematics. Kluwer. https://doi.org/10.1007/s10444-014-9356-1
chicago: Pilarczyk, Pawel, and Pedro Real. “Computation of Cubical Homology, Cohomology,
and (Co)Homological Operations via Chain Contraction.” Advances in Computational
Mathematics. Kluwer, 2014. https://doi.org/10.1007/s10444-014-9356-1.
ieee: P. Pilarczyk and P. Real, “Computation of cubical homology, cohomology, and
(co)homological operations via chain contraction,” Advances in Computational
Mathematics, vol. 41, no. 1. Kluwer, pp. 253–275, 2014.
ista: Pilarczyk P, Real P. 2014. Computation of cubical homology, cohomology, and
(co)homological operations via chain contraction. Advances in Computational Mathematics.
41(1), 253–275.
mla: Pilarczyk, Pawel, and Pedro Real. “Computation of Cubical Homology, Cohomology,
and (Co)Homological Operations via Chain Contraction.” Advances in Computational
Mathematics, vol. 41, no. 1, Kluwer, 2014, pp. 253–75, doi:10.1007/s10444-014-9356-1.
short: P. Pilarczyk, P. Real, Advances in Computational Mathematics 41 (2014) 253–275.
date_created: 2018-12-11T11:46:33Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2026-09-09T13:17:12Z
day: '01'
doi: 10.1007/s10444-014-9356-1
extern: '1'
fulldoi: https://doi.org/10.1007/s10444-014-9356-1
intvolume: ' 41'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://idus.us.es/xmlui/handle/11441/38719
month: '01'
oa: 1
oa_version: None
page: 253 - 275
publication: Advances in Computational Mathematics
publication_identifier:
eissn:
- 1572-9044
issn:
- 1019-7168
publication_status: published
publisher: Kluwer
publist_id: '7371'
status: public
title: Computation of cubical homology, cohomology, and (co)homological operations
via chain contraction
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 41
year: '2014'
...
---
OA_place: repository
OA_type: green
_id: '589'
abstract:
- lang: eng
text: We demonstrate a many-atom-cavity system with a high-finesse dual-wavelength
standing wave cavity in which all participating rubidium atoms are nearly identically
coupled to a 780-nm cavity mode. This homogeneous coupling is enforced by a one-dimensional
optical lattice formed by the field of a 1560-nm cavity mode.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jongmin
full_name: Lee, Jongmin
last_name: Lee
- first_name: Geert
full_name: Vrijsen, Geert
last_name: Vrijsen
- first_name: Igor
full_name: Teper, Igor
last_name: Teper
- first_name: Onur
full_name: Hosten, Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Mark
full_name: Kasevich, Mark
last_name: Kasevich
citation:
ama: Lee J, Vrijsen G, Teper I, Hosten O, Kasevich M. Many-atom-cavity QED system
with homogeneous atom-cavity coupling. Optics Letters. 2014;39(13):4005-4008.
doi:10.1364/OL.39.004005
apa: Lee, J., Vrijsen, G., Teper, I., Hosten, O., & Kasevich, M. (2014). Many-atom-cavity
QED system with homogeneous atom-cavity coupling. Optics Letters. OSA.
https://doi.org/10.1364/OL.39.004005
chicago: Lee, Jongmin, Geert Vrijsen, Igor Teper, Onur Hosten, and Mark Kasevich.
“Many-Atom-Cavity QED System with Homogeneous Atom-Cavity Coupling.” Optics
Letters. OSA, 2014. https://doi.org/10.1364/OL.39.004005.
ieee: J. Lee, G. Vrijsen, I. Teper, O. Hosten, and M. Kasevich, “Many-atom-cavity
QED system with homogeneous atom-cavity coupling,” Optics Letters, vol.
39, no. 13. OSA, pp. 4005–4008, 2014.
ista: Lee J, Vrijsen G, Teper I, Hosten O, Kasevich M. 2014. Many-atom-cavity QED
system with homogeneous atom-cavity coupling. Optics Letters. 39(13), 4005–4008.
mla: Lee, Jongmin, et al. “Many-Atom-Cavity QED System with Homogeneous Atom-Cavity
Coupling.” Optics Letters, vol. 39, no. 13, OSA, 2014, pp. 4005–08, doi:10.1364/OL.39.004005.
short: J. Lee, G. Vrijsen, I. Teper, O. Hosten, M. Kasevich, Optics Letters 39 (2014)
4005–4008.
date_created: 2018-12-11T11:47:21Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2026-09-09T13:13:54Z
day: '01'
doi: 10.1364/OL.39.004005
extern: '1'
external_id:
arxiv:
- '1311.1805'
pmid:
- '24978793'
fulldoi: https://doi.org/10.1364/OL.39.004005
intvolume: ' 39'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1311.1805
month: '07'
oa: 1
oa_version: None
page: 4005 - 4008
pmid: 1
publication: Optics Letters
publication_identifier:
eissn:
- 1539-4794
issn:
- 0146-9592
publication_status: published
publisher: OSA
publist_id: '7216'
status: public
title: Many-atom-cavity QED system with homogeneous atom-cavity coupling
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 39
year: '2014'
...
---
_id: '355'
abstract:
- lang: eng
text: 'We report on the photocatalytic hydrogen evolution under full-arc light irradiation
of CuIn1-xGaxS2 wurtzite nanocrystals in the presence of SO3 2- and S2- as sacrificial
reagents. We analyzed the hydrogen generation rate as a function of the Ga content
and associated it with the energy band positions. For photocatalytic water splitting,
the CuInS2 bandgap is slightly too low to efficiently overcome the reaction over-potential.
The presence of Ga shifts up the CuInS2 conduction band edge providing a larger
driving force for photogenerated carriers to activate the water splitting reduction
reaction. The larger the Ga content, the more energetically favorable the electron
injection, and thus a more efficient use of the photogenerated carriers is reached.
However, the band gap increase associated with the Ga incorporation reduces the
concentration of photogenerated carriers available for water splitting, and consequently
a lower hydrogen conversion rate is obtained for very high Ga contents. The optimum
Ga concentration was experimentally found at CuIn0.3Ga0.7S2. '
acknowledgement: "The research was supported by the European Regional Development\r\nFunds
(ERDF, “FEDER Programa Competitivitat de\r\nCatalunya 2007-2013”) and the Framework
7 program under\r\nproject SCALENANO (FP7-NMP-ENERGY-2011-284486)."
article_processing_charge: No
article_type: original
author:
- first_name: Xuelian
full_name: Yu, Xuelian
last_name: Yu
- first_name: Xiaoqiang
full_name: An, Xiaoqiang
last_name: An
- first_name: Alexey
full_name: Shavel, Alexey
last_name: Shavel
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Yu X, An X, Shavel A, Ibáñez M, Cabot A. The effect of the Ga content on the
photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals. Journal of
Materials Chemistry A. 2014;2(31):12317-12322. doi:10.1039/c4ta01315h
apa: Yu, X., An, X., Shavel, A., Ibáñez, M., & Cabot, A. (2014). The effect
of the Ga content on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals.
Journal of Materials Chemistry A. Royal Society of Chemistry. https://doi.org/10.1039/c4ta01315h
chicago: Yu, Xuelian, Xiaoqiang An, Alexey Shavel, Maria Ibáñez, and Andreu Cabot.
“The Effect of the Ga Content on the Photocatalytic Hydrogen Evolution of CuIn1-XGaxS2
Nanocrystals.” Journal of Materials Chemistry A. Royal Society of Chemistry,
2014. https://doi.org/10.1039/c4ta01315h.
ieee: X. Yu, X. An, A. Shavel, M. Ibáñez, and A. Cabot, “The effect of the Ga content
on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals,” Journal
of Materials Chemistry A, vol. 2, no. 31. Royal Society of Chemistry, pp.
12317–12322, 2014.
ista: Yu X, An X, Shavel A, Ibáñez M, Cabot A. 2014. The effect of the Ga content
on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals. Journal
of Materials Chemistry A. 2(31), 12317–12322.
mla: Yu, Xuelian, et al. “The Effect of the Ga Content on the Photocatalytic Hydrogen
Evolution of CuIn1-XGaxS2 Nanocrystals.” Journal of Materials Chemistry A,
vol. 2, no. 31, Royal Society of Chemistry, 2014, pp. 12317–22, doi:10.1039/c4ta01315h.
short: X. Yu, X. An, A. Shavel, M. Ibáñez, A. Cabot, Journal of Materials Chemistry
A 2 (2014) 12317–12322.
date_created: 2018-12-11T11:45:59Z
date_published: 2014-08-21T00:00:00Z
date_updated: 2026-09-09T13:18:50Z
day: '21'
doi: 10.1039/c4ta01315h
extern: '1'
fulldoi: https://doi.org/10.1039/c4ta01315h
intvolume: ' 2'
issue: '31'
language:
- iso: eng
month: '08'
oa_version: None
page: 12317 - 12322
publication: Journal of Materials Chemistry A
publication_identifier:
eissn:
- 2050-7496
issn:
- 2050-7488
publication_status: published
publisher: Royal Society of Chemistry
publist_id: '7471'
quality_controlled: '1'
status: public
title: The effect of the Ga content on the photocatalytic hydrogen evolution of CuIn1-xGaxS2
nanocrystals
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2
year: '2014'
...
---
OA_type: closed access
_id: '332'
abstract:
- lang: eng
text: 'Cu2ZnSnS4, based on abundant and environmental friendly elements and with
a direct band gap of 1.5 eV, is a main candidate material for solar energy conversion
through both photovoltaics and photocatalysis. We detail here the synthesis of
quasi-spherical Cu 2ZnSnS4 nanoparticles with unprecedented narrow size distributions.
We further detail their use as seeds to produce CZTS-Au and CZTS-Pt heterostructured
nanoparticles. Such heterostructured nanoparticles are shown to have excellent
photocatalytic properties toward degradation of Rhodamine B and hydrogen generation
by water splitting. '
article_processing_charge: No
article_type: original
author:
- first_name: Xuelian
full_name: Yu, Xuelian
last_name: Yu
- first_name: Alexey
full_name: Shavel, Alexey
last_name: Shavel
- first_name: Xiaoqiang
full_name: An, Xiaoqiang
last_name: An
- first_name: Zhishan
full_name: Luo, Zhishan
last_name: Luo
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au
heterostructured nanoparticles for photocatalytic water splitting and pollutant
degradation. Journal of the American Chemical Society. 2014;136(26):9236-9239.
doi:10.1021/ja502076b
apa: Yu, X., Shavel, A., An, X., Luo, Z., Ibáñez, M., & Cabot, A. (2014). Cu2ZnSnS4-Pt
and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting
and pollutant degradation. Journal of the American Chemical Society. ACS.
https://doi.org/10.1021/ja502076b
chicago: Yu, Xuelian, Alexey Shavel, Xiaoqiang An, Zhishan Luo, Maria Ibáñez, and
Andreu Cabot. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for
Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the American
Chemical Society. ACS, 2014. https://doi.org/10.1021/ja502076b.
ieee: X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, and A. Cabot, “Cu2ZnSnS4-Pt and
Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting
and pollutant degradation,” Journal of the American Chemical Society, vol.
136, no. 26. ACS, pp. 9236–9239, 2014.
ista: Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. 2014. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au
heterostructured nanoparticles for photocatalytic water splitting and pollutant
degradation. Journal of the American Chemical Society. 136(26), 9236–9239.
mla: Yu, Xuelian, et al. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles
for Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the
American Chemical Society, vol. 136, no. 26, ACS, 2014, pp. 9236–39, doi:10.1021/ja502076b.
short: X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, A. Cabot, Journal of the American
Chemical Society 136 (2014) 9236–9239.
date_created: 2018-12-11T11:45:52Z
date_published: 2014-06-11T00:00:00Z
date_updated: 2026-09-09T13:21:36Z
day: '11'
doi: 10.1021/ja502076b
extern: '1'
external_id:
pmid:
- '24946131'
fulldoi: https://doi.org/10.1021/ja502076b
intvolume: ' 136'
issue: '26'
language:
- iso: eng
month: '06'
oa_version: None
page: 9236 - 9239
pmid: 1
publication: Journal of the American Chemical Society
publication_identifier:
eissn:
- 1520-5126
issn:
- 0002-7863
publication_status: published
publisher: ACS
publist_id: '7513'
quality_controlled: '1'
status: public
title: Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic
water splitting and pollutant degradation
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 136
year: '2014'
...
---
OA_type: closed access
_id: '357'
abstract:
- lang: eng
text: 'Near-resonant Raman scattering measurements of zinc sulfide nanoparticles
and thin films have been made and correlated to grain and particle size, respectively,
using a 325 nm wavelength excitation source. The area ratios between the first,
second, and third order peaks of ZnS identified as the T 2(LO) mode decrease with
increasing ZnS grain size. This is an effect attributed to changes in the bandgap
energy from quantum confinement due to the varying grain size between the films/particles,
as noted by a shift in the room temperature photoluminescence emission corresponding
to the free exciton emission energy. While Raman scattering spectroscopy is typically
limited to identification of phases and their crystalline properties, it is possible
to attain more than such straightforward information by calibrating the spectral
features to variations between sets of samples. These results open the possibility
of making a quantitative grain size estimation in ZnS thin films and nanostructures,
as well as in other material systems where ZnS may be expected as a secondary
phase, such as Cu2ZnSnS4. Additionally, more commonly used excitation wavelengths
for Raman scattering, such as 514 and 532 nm, are shown to be of limited use in
characterizing ZnS thin films due to the extremely low Raman scattering efficiency
of ZnS in films with sub-micron thicknesses. '
acknowledgement: "This research was supported by the People Programme\r\n(Marie Curie
Actions) of the European Union's Seventh Framework\r\nProgramme under REA grant
agreement number 269167\r\n(PVICOKEST) and the Spanish Ministerio de Economía y\r\nCompetividad
(MINECO) under KEST-PV (ref. ENE2010-\r\n121541-C03-01/02). Authors from IREC belong
to the M-2E\r\n(Electronic Materials for Energy) Consolidated Research\r\nGroup
and the XaRMAE Network of Excellence on Materials\r\nfor Energy of the “Generalitat
de Catalunya”. A. Fairbrother\r\nthanks the MINECO for support via the FPU program\r\n(FPU12/05508),
V. Izquierdo for the Juan de la Cierva program\r\n(JCI-2011-10782), and E. Saucedo
for the Ramón y Cajal\r\nprogram (RYC-2011-09212)."
article_processing_charge: No
article_type: original
author:
- first_name: Andrew
full_name: Fairbrother, Andrew
last_name: Fairbrother
- first_name: Victor
full_name: Izquierdo Roca, Victor
last_name: Izquierdo Roca
- first_name: Xavier
full_name: Fontané, Xavier
last_name: Fontané
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
- first_name: Edgardo
full_name: Saucedo, Edgardo
last_name: Saucedo
- first_name: Alejandro
full_name: Pérez Rodríguez, Alejandro
last_name: Pérez Rodríguez
citation:
ama: 'Fairbrother A, Izquierdo Roca V, Fontané X, et al. ZnS grain size effects
on near-resonant Raman scattering: Optical non-destructive grain size estimation.
CrystEngComm. 2014;16(20):4120-4125. doi:10.1039/c3ce42578a'
apa: 'Fairbrother, A., Izquierdo Roca, V., Fontané, X., Ibáñez, M., Cabot, A., Saucedo,
E., & Pérez Rodríguez, A. (2014). ZnS grain size effects on near-resonant
Raman scattering: Optical non-destructive grain size estimation. CrystEngComm.
Royal Society of Chemistry. https://doi.org/10.1039/c3ce42578a'
chicago: 'Fairbrother, Andrew, Victor Izquierdo Roca, Xavier Fontané, Maria Ibáñez,
Andreu Cabot, Edgardo Saucedo, and Alejandro Pérez Rodríguez. “ZnS Grain Size
Effects on Near-Resonant Raman Scattering: Optical Non-Destructive Grain Size
Estimation.” CrystEngComm. Royal Society of Chemistry, 2014. https://doi.org/10.1039/c3ce42578a.'
ieee: 'A. Fairbrother et al., “ZnS grain size effects on near-resonant Raman
scattering: Optical non-destructive grain size estimation,” CrystEngComm,
vol. 16, no. 20. Royal Society of Chemistry, pp. 4120–4125, 2014.'
ista: 'Fairbrother A, Izquierdo Roca V, Fontané X, Ibáñez M, Cabot A, Saucedo E,
Pérez Rodríguez A. 2014. ZnS grain size effects on near-resonant Raman scattering:
Optical non-destructive grain size estimation. CrystEngComm. 16(20), 4120–4125.'
mla: 'Fairbrother, Andrew, et al. “ZnS Grain Size Effects on Near-Resonant Raman
Scattering: Optical Non-Destructive Grain Size Estimation.” CrystEngComm,
vol. 16, no. 20, Royal Society of Chemistry, 2014, pp. 4120–25, doi:10.1039/c3ce42578a.'
short: A. Fairbrother, V. Izquierdo Roca, X. Fontané, M. Ibáñez, A. Cabot, E. Saucedo,
A. Pérez Rodríguez, CrystEngComm 16 (2014) 4120–4125.
date_created: 2018-12-11T11:46:00Z
date_published: 2014-05-28T00:00:00Z
date_updated: 2026-09-10T12:23:38Z
day: '28'
doi: 10.1039/c3ce42578a
extern: '1'
fulldoi: https://doi.org/10.1039/c3ce42578a
intvolume: ' 16'
issue: '20'
language:
- iso: eng
month: '05'
oa_version: None
page: 4120 - 4125
publication: CrystEngComm
publication_identifier:
eissn:
- 1466-8033
publication_status: published
publisher: Royal Society of Chemistry
publist_id: '7473'
quality_controlled: '1'
status: public
title: 'ZnS grain size effects on near-resonant Raman scattering: Optical non-destructive
grain size estimation'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 16
year: '2014'
...
---
_id: '1999'
abstract:
- lang: eng
text: Selection for disease control is believed to have contributed to shape the
organisation of insect societies — leading to interaction patterns that mitigate
disease transmission risk within colonies, conferring them ‘organisational immunity’.
Recent studies combining epidemiological models with social network analysis have
identified general properties of interaction networks that may hinder propagation
of infection within groups. These can be prophylactic and/or induced upon pathogen
exposure. Here we review empirical evidence for these two types of organisational
immunity in social insects and describe the individual-level behaviours that underlie
it. We highlight areas requiring further investigation, and emphasise the need
for tighter links between theory and empirical research and between individual-level
and collective-level analyses.
article_processing_charge: No
author:
- first_name: Nathalie
full_name: Stroeymeyt, Nathalie
last_name: Stroeymeyt
- first_name: Barbara E
full_name: Casillas Perez, Barbara E
id: 351ED2AA-F248-11E8-B48F-1D18A9856A87
last_name: Casillas Perez
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Stroeymeyt N, Casillas Perez BE, Cremer S. Organisational immunity in social
insects. Current Opinion in Insect Science. 2014;5(1):1-15. doi:10.1016/j.cois.2014.09.001
apa: Stroeymeyt, N., Casillas Perez, B. E., & Cremer, S. (2014). Organisational
immunity in social insects. Current Opinion in Insect Science. Elsevier.
https://doi.org/10.1016/j.cois.2014.09.001
chicago: Stroeymeyt, Nathalie, Barbara E Casillas Perez, and Sylvia Cremer. “Organisational
Immunity in Social Insects.” Current Opinion in Insect Science. Elsevier,
2014. https://doi.org/10.1016/j.cois.2014.09.001.
ieee: N. Stroeymeyt, B. E. Casillas Perez, and S. Cremer, “Organisational immunity
in social insects,” Current Opinion in Insect Science, vol. 5, no. 1. Elsevier,
pp. 1–15, 2014.
ista: Stroeymeyt N, Casillas Perez BE, Cremer S. 2014. Organisational immunity in
social insects. Current Opinion in Insect Science. 5(1), 1–15.
mla: Stroeymeyt, Nathalie, et al. “Organisational Immunity in Social Insects.” Current
Opinion in Insect Science, vol. 5, no. 1, Elsevier, 2014, pp. 1–15, doi:10.1016/j.cois.2014.09.001.
short: N. Stroeymeyt, B.E. Casillas Perez, S. Cremer, Current Opinion in Insect
Science 5 (2014) 1–15.
corr_author: '1'
date_created: 2018-12-11T11:55:08Z
date_published: 2014-11-01T00:00:00Z
date_updated: 2026-10-23T22:30:18Z
day: '01'
department:
- _id: SyCr
doi: 10.1016/j.cois.2014.09.001
ec_funded: 1
external_id:
isi:
- '000209578900002'
fulldoi: https://doi.org/10.1016/j.cois.2014.09.001
intvolume: ' 5'
isi: 1
issue: '1'
language:
- iso: eng
month: '11'
oa_version: None
page: 1 - 15
project:
- _id: 25DC711C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '243071'
name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society
Effects'
publication: Current Opinion in Insect Science
publication_status: published
publisher: Elsevier
publist_id: '5080'
quality_controlled: '1'
related_material:
record:
- id: '6383'
relation: dissertation_contains
- id: '6435'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Organisational immunity in social insects
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 5
year: '2014'
...
---
_id: '10895'
abstract:
- lang: eng
text: 'Due to their sessile lifestyles, plants need to deal with the limitations
and stresses imposed by the changing environment. Plants cope with these by a
remarkable developmental flexibility, which is embedded in their strategy to survive.
Plants can adjust their size, shape and number of organs, bend according to gravity
and light, and regenerate tissues that were damaged, utilizing a coordinating,
intercellular signal, the plant hormone, auxin. Another versatile signal is the
cation, Ca2+, which is a crucial second messenger for many rapid cellular processes
during responses to a wide range of endogenous and environmental signals, such
as hormones, light, drought stress and others. Auxin is a good candidate for one
of these Ca2+-activating signals. However, the role of auxin-induced Ca2+ signaling
is poorly understood. Here, we will provide an overview of possible developmental
and physiological roles, as well as mechanisms underlying the interconnection
of Ca2+ and auxin signaling. '
article_processing_charge: No
article_type: original
author:
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Vanneste S, Friml J. Calcium: The missing link in auxin action. Plants.
2013;2(4):650-675. doi:10.3390/plants2040650'
apa: 'Vanneste, S., & Friml, J. (2013). Calcium: The missing link in auxin action.
Plants. MDPI. https://doi.org/10.3390/plants2040650'
chicago: 'Vanneste, Steffen, and Jiří Friml. “Calcium: The Missing Link in Auxin
Action.” Plants. MDPI, 2013. https://doi.org/10.3390/plants2040650.'
ieee: 'S. Vanneste and J. Friml, “Calcium: The missing link in auxin action,” Plants,
vol. 2, no. 4. MDPI, pp. 650–675, 2013.'
ista: 'Vanneste S, Friml J. 2013. Calcium: The missing link in auxin action. Plants.
2(4), 650–675.'
mla: 'Vanneste, Steffen, and Jiří Friml. “Calcium: The Missing Link in Auxin Action.”
Plants, vol. 2, no. 4, MDPI, 2013, pp. 650–75, doi:10.3390/plants2040650.'
short: S. Vanneste, J. Friml, Plants 2 (2013) 650–675.
corr_author: '1'
date_created: 2022-03-21T07:13:49Z
date_published: 2013-10-21T00:00:00Z
date_updated: 2024-10-09T21:01:52Z
day: '21'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.3390/plants2040650
external_id:
pmid:
- '27137397'
file:
- access_level: open_access
checksum: fb4ff2e820e344e253c9197544610be6
content_type: application/pdf
creator: dernst
date_created: 2022-03-21T12:12:56Z
date_updated: 2022-03-21T12:12:56Z
file_id: '10916'
file_name: 2013_Plants_Vanneste.pdf
file_size: 670188
relation: main_file
success: 1
file_date_updated: 2022-03-21T12:12:56Z
fulldoi: https://doi.org/10.3390/plants2040650
has_accepted_license: '1'
intvolume: ' 2'
issue: '4'
keyword:
- Plant Science
- Ecology
- Ecology
- Evolution
- Behavior and Systematics
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '10'
oa: 1
oa_version: Published Version
page: 650-675
pmid: 1
publication: Plants
publication_identifier:
issn:
- 2223-7747
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Calcium: The missing link in auxin action'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2013'
...
---
_id: '10897'
abstract:
- lang: eng
text: Taking images is an efficient way to collect data about the physical world.
It can be done fast and in exquisite detail. By definition, image processing is
the field that concerns itself with the computation aimed at harnessing the information
contained in images [10]. This talk is concerned with topological information.
Our main thesis is that persistent homology [5] is a useful method to quantify
and summarize topological information, building a bridge that connects algebraic
topology with applications. We provide supporting evidence for this thesis by
touching upon four technical developments in the overlap between persistent homology
and image processing.
acknowledgement: This research is partially supported by the European Science Foundation
(ESF) under the Research Network Programme, the European Union under the Toposys
Project FP7-ICT-318493-STREP, the Russian Government under the Mega Project 11.G34.31.0053.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Edelsbrunner H. Persistent homology in image processing. In: Graph-Based
Representations in Pattern Recognition. Vol 7877. LNCS. Berlin, Heidelberg:
Springer Nature; 2013:182-183. doi:10.1007/978-3-642-38221-5_19'
apa: 'Edelsbrunner, H. (2013). Persistent homology in image processing. In Graph-Based
Representations in Pattern Recognition (Vol. 7877, pp. 182–183). Berlin, Heidelberg:
Springer Nature. https://doi.org/10.1007/978-3-642-38221-5_19'
chicago: 'Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” In Graph-Based
Representations in Pattern Recognition, 7877:182–83. LNCS. Berlin, Heidelberg:
Springer Nature, 2013. https://doi.org/10.1007/978-3-642-38221-5_19.'
ieee: H. Edelsbrunner, “Persistent homology in image processing,” in Graph-Based
Representations in Pattern Recognition, Vienna, Austria, 2013, vol. 7877,
pp. 182–183.
ista: 'Edelsbrunner H. 2013. Persistent homology in image processing. Graph-Based
Representations in Pattern Recognition. GbRPR: Graph-based Representations in
Pattern RecognitionLNCS vol. 7877, 182–183.'
mla: Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” Graph-Based
Representations in Pattern Recognition, vol. 7877, Springer Nature, 2013,
pp. 182–83, doi:10.1007/978-3-642-38221-5_19.
short: H. Edelsbrunner, in:, Graph-Based Representations in Pattern Recognition,
Springer Nature, Berlin, Heidelberg, 2013, pp. 182–183.
conference:
end_date: 2013-05-17
location: Vienna, Austria
name: 'GbRPR: Graph-based Representations in Pattern Recognition'
start_date: 2013-05-15
corr_author: '1'
date_created: 2022-03-21T07:30:33Z
date_published: 2013-06-01T00:00:00Z
date_updated: 2025-04-15T08:37:54Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-642-38221-5_19
ec_funded: 1
fulldoi: https://doi.org/10.1007/978-3-642-38221-5_19
intvolume: ' 7877'
language:
- iso: eng
month: '06'
oa_version: None
page: 182-183
place: Berlin, Heidelberg
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Graph-Based Representations in Pattern Recognition
publication_identifier:
eisbn:
- '9783642382215'
eissn:
- 1611-3349
isbn:
- '9783642382208'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Persistent homology in image processing
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7877
year: '2013'
...
---
_id: '10898'
abstract:
- lang: eng
text: A prominent remedy to multicore scalability issues in concurrent data structure
implementations is to relax the sequential specification of the data structure.
We present distributed queues (DQ), a new family of relaxed concurrent queue implementations.
DQs implement relaxed queues with linearizable emptiness check and either configurable
or bounded out-of-order behavior or pool behavior. Our experiments show that DQs
outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue
as well as pool implementations that we considered.
acknowledgement: This work has been supported by the European Research Council advanced
grant on Quantitative Reactive Modeling (QUAREM) and the National Research Network
RiSE on Rigorous Systems Engineering (Austrian Science Fund S11402-N23 and S11404-N23).
article_number: '17'
article_processing_charge: No
author:
- first_name: Andreas
full_name: Haas, Andreas
last_name: Haas
- first_name: Michael
full_name: Lippautz, Michael
last_name: Lippautz
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Hannes
full_name: Payer, Hannes
last_name: Payer
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
- first_name: Christoph M.
full_name: Kirsch, Christoph M.
last_name: Kirsch
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
citation:
ama: 'Haas A, Lippautz M, Henzinger TA, et al. Distributed queues in shared memory:
Multicore performance and scalability through quantitative relaxation. In: Proceedings
of the ACM International Conference on Computing Frontiers - CF ’13. ACM;
2013. doi:10.1145/2482767.2482789'
apa: 'Haas, A., Lippautz, M., Henzinger, T. A., Payer, H., Sokolova, A., Kirsch,
C. M., & Sezgin, A. (2013). Distributed queues in shared memory: Multicore
performance and scalability through quantitative relaxation. In Proceedings
of the ACM International Conference on Computing Frontiers - CF ’13. Ischia,
Italy: ACM. https://doi.org/10.1145/2482767.2482789'
chicago: 'Haas, Andreas, Michael Lippautz, Thomas A Henzinger, Hannes Payer, Ana
Sokolova, Christoph M. Kirsch, and Ali Sezgin. “Distributed Queues in Shared Memory:
Multicore Performance and Scalability through Quantitative Relaxation.” In Proceedings
of the ACM International Conference on Computing Frontiers - CF ’13. ACM,
2013. https://doi.org/10.1145/2482767.2482789.'
ieee: 'A. Haas et al., “Distributed queues in shared memory: Multicore performance
and scalability through quantitative relaxation,” in Proceedings of the ACM
International Conference on Computing Frontiers - CF ’13, Ischia, Italy, 2013,
no. 5.'
ista: 'Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin
A. 2013. Distributed queues in shared memory: Multicore performance and scalability
through quantitative relaxation. Proceedings of the ACM International Conference
on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.'
mla: 'Haas, Andreas, et al. “Distributed Queues in Shared Memory: Multicore Performance
and Scalability through Quantitative Relaxation.” Proceedings of the ACM International
Conference on Computing Frontiers - CF ’13, no. 5, 17, ACM, 2013, doi:10.1145/2482767.2482789.'
short: A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch,
A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers
- CF ’13, ACM, 2013.
conference:
end_date: 2013-05-16
location: Ischia, Italy
name: 'CF: Conference on Computing Frontiers'
start_date: 2013-05-14
date_created: 2022-03-21T07:33:22Z
date_published: 2013-05-14T00:00:00Z
date_updated: 2025-05-14T11:23:58Z
day: '14'
department:
- _id: ToHe
doi: 10.1145/2482767.2482789
ec_funded: 1
fulldoi: https://doi.org/10.1145/2482767.2482789
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Proceedings of the ACM International Conference on Computing Frontiers
- CF '13
publication_identifier:
isbn:
- 978-145032053-5
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Distributed queues in shared memory: Multicore performance and scalability
through quantitative relaxation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '10899'
article_processing_charge: No
author:
- 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: 'Barton NH. Differentiation. In: Encyclopedia of Biodiversity. 2nd ed.
Elsevier; 2013:508-515. doi:10.1016/b978-0-12-384719-5.00031-9'
apa: Barton, N. H. (2013). Differentiation. In Encyclopedia of Biodiversity
(2nd ed., pp. 508–515). Elsevier. https://doi.org/10.1016/b978-0-12-384719-5.00031-9
chicago: Barton, Nicholas H. “Differentiation.” In Encyclopedia of Biodiversity,
2nd ed., 508–15. Elsevier, 2013. https://doi.org/10.1016/b978-0-12-384719-5.00031-9.
ieee: N. H. Barton, “Differentiation,” in Encyclopedia of Biodiversity, 2nd
ed., Elsevier, 2013, pp. 508–515.
ista: 'Barton NH. 2013.Differentiation. In: Encyclopedia of Biodiversity. , 508–515.'
mla: Barton, Nicholas H. “Differentiation.” Encyclopedia of Biodiversity,
2nd ed., Elsevier, 2013, pp. 508–15, doi:10.1016/b978-0-12-384719-5.00031-9.
short: N.H. Barton, in:, Encyclopedia of Biodiversity, 2nd ed., Elsevier, 2013,
pp. 508–515.
corr_author: '1'
date_created: 2022-03-21T07:46:22Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2024-10-09T21:02:37Z
day: '01'
department:
- _id: NiBa
doi: 10.1016/b978-0-12-384719-5.00031-9
edition: '2'
fulldoi: https://doi.org/10.1016/b978-0-12-384719-5.00031-9
keyword:
- Adaptive landscape
- Cline
- Coalescent process
- Gene flow
- Hybrid zone
- Local adaptation
- Natural selection
- Neutral theory
- Population structure
- Speciation
language:
- iso: eng
month: '01'
oa_version: None
page: 508-515
publication: Encyclopedia of Biodiversity
publication_identifier:
isbn:
- 978-0-12-384720-1
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Differentiation
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '10900'
abstract:
- lang: eng
text: Leukocyte migration through the interstitial space is crucial for the maintenance
of tolerance and immunity. The main cues for leukocyte trafficking are chemokines
thought to directionally guide these cells towards their targets. However, model
systems that facilitate quantification of chemokine-guided leukocyte migration
in vivo are uncommon. Here we describe an ex vivo crawl-in assay using explanted
mouse ears that allows the visualization of chemokine-dependent dendritic cell
(DC) motility in the dermal interstitium in real time. We present methods for
the preparation of mouse ear sheets and their use in multidimensional confocal
imaging experiments to monitor and analyze the directional migration of fluorescently
labelled DCs through the dermis and into afferent lymphatic vessels. The assay
provides a more physiological approach to study leukocyte migration than in vitro
three-dimensional (3D) or 2-dimensional (2D) migration assays such as collagen
gels and transwell assays.
acknowledgement: We would like to thank Alexander Eichner and Ingrid de Vries for
discussion and critical reading of the manuscript, and Mary Frank for assistance
with the recording of videos and images in Fig. 1. M.S. is supported through funding
from the German Research Foundation (DFG). M.W. acknowledges the Alexander von Humboldt
Foundation for funding.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Michele
full_name: Weber, Michele
id: 3A3FC708-F248-11E8-B48F-1D18A9856A87
last_name: Weber
- 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: 'Weber M, Sixt MK. Live Cell Imaging of Chemotactic Dendritic Cell Migration
in Explanted Mouse Ear Preparations. In: Cardona A, Ubogu E, eds. Chemokines.
Vol 1013. MIMB. Totowa, NJ: Humana Press; 2013:215-226. doi:10.1007/978-1-62703-426-5_14'
apa: 'Weber, M., & Sixt, M. K. (2013). Live Cell Imaging of Chemotactic Dendritic
Cell Migration in Explanted Mouse Ear Preparations. In A. Cardona & E. Ubogu
(Eds.), Chemokines (Vol. 1013, pp. 215–226). Totowa, NJ: Humana Press.
https://doi.org/10.1007/978-1-62703-426-5_14'
chicago: 'Weber, Michele, and Michael K Sixt. “Live Cell Imaging of Chemotactic
Dendritic Cell Migration in Explanted Mouse Ear Preparations.” In Chemokines,
edited by Astrid Cardona and Eroboghene Ubogu, 1013:215–26. MIMB. Totowa, NJ:
Humana Press, 2013. https://doi.org/10.1007/978-1-62703-426-5_14.'
ieee: 'M. Weber and M. K. Sixt, “Live Cell Imaging of Chemotactic Dendritic Cell
Migration in Explanted Mouse Ear Preparations,” in Chemokines, vol. 1013,
A. Cardona and E. Ubogu, Eds. Totowa, NJ: Humana Press, 2013, pp. 215–226.'
ista: 'Weber M, Sixt MK. 2013.Live Cell Imaging of Chemotactic Dendritic Cell Migration
in Explanted Mouse Ear Preparations. In: Chemokines. Methods in Molecular Biology,
vol. 1013, 215–226.'
mla: Weber, Michele, and Michael K. Sixt. “Live Cell Imaging of Chemotactic Dendritic
Cell Migration in Explanted Mouse Ear Preparations.” Chemokines, edited
by Astrid Cardona and Eroboghene Ubogu, vol. 1013, Humana Press, 2013, pp. 215–26,
doi:10.1007/978-1-62703-426-5_14.
short: M. Weber, M.K. Sixt, in:, A. Cardona, E. Ubogu (Eds.), Chemokines, Humana
Press, Totowa, NJ, 2013, pp. 215–226.
corr_author: '1'
date_created: 2022-03-21T07:47:41Z
date_published: 2013-04-03T00:00:00Z
date_updated: 2024-10-09T21:02:37Z
day: '03'
department:
- _id: MiSi
doi: 10.1007/978-1-62703-426-5_14
editor:
- first_name: Astrid
full_name: Cardona, Astrid
last_name: Cardona
- first_name: Eroboghene
full_name: Ubogu, Eroboghene
last_name: Ubogu
external_id:
pmid:
- '23625502'
fulldoi: https://doi.org/10.1007/978-1-62703-426-5_14
intvolume: ' 1013'
language:
- iso: eng
month: '04'
oa_version: None
page: 215-226
place: Totowa, NJ
pmid: 1
publication: Chemokines
publication_identifier:
eisbn:
- '9781627034265'
eissn:
- 1940-6029
isbn:
- '9781627034258'
issn:
- 1064-3745
publication_status: published
publisher: Humana Press
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse
Ear Preparations
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 1013
year: '2013'
...
---
_id: '10902'
abstract:
- lang: eng
text: We consider how to edit strings from a source language so that the edited
strings belong to a target language, where the languages are given as deterministic
finite automata. Non-streaming (or offline) transducers perform edits given the
whole source string. We show that the class of deterministic one-pass transducers
with registers along with increment and min operation suffices for computing optimal
edit distance, whereas the same class of transducers without the min operation
is not sufficient. Streaming (or online) transducers perform edits as the letters
of the source string are received. We present a polynomial time algorithm for
the partial-repair problem that given a bound α asks for the construction of a
deterministic streaming transducer (if one exists) that ensures that the ‘maximum
fraction’ η of the strings of the source language are edited, within cost α, to
the target language.
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph
Games), and Microsoft faculty fellows award. Thanks to Gabriele Puppis for suggesting
the problem of identifying a deterministic transducer to compute the optimal cost,
and to Martin Chmelik for his comments on the introduction.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Siddhesh
full_name: Chaubal, Siddhesh
last_name: Chaubal
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Chatterjee K, Chaubal S, Rubin S. How to travel between languages. In: 7th
International Conference on Language and Automata Theory and Applications.
Vol 7810. LNCS. Berlin, Heidelberg: Springer Nature; 2013:214-225. doi:10.1007/978-3-642-37064-9_20'
apa: 'Chatterjee, K., Chaubal, S., & Rubin, S. (2013). How to travel between
languages. In 7th International Conference on Language and Automata Theory
and Applications (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature.
https://doi.org/10.1007/978-3-642-37064-9_20'
chicago: 'Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel
between Languages.” In 7th International Conference on Language and Automata
Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature,
2013. https://doi.org/10.1007/978-3-642-37064-9_20.'
ieee: K. Chatterjee, S. Chaubal, and S. Rubin, “How to travel between languages,”
in 7th International Conference on Language and Automata Theory and Applications,
Bilbao, Spain, 2013, vol. 7810, pp. 214–225.
ista: 'Chatterjee K, Chaubal S, Rubin S. 2013. How to travel between languages.
7th International Conference on Language and Automata Theory and Applications.
LATA: Language and Automata Theory and ApplicationsLNCS, LNCS, vol. 7810, 214–225.'
mla: Chatterjee, Krishnendu, et al. “How to Travel between Languages.” 7th International
Conference on Language and Automata Theory and Applications, vol. 7810, Springer
Nature, 2013, pp. 214–25, doi:10.1007/978-3-642-37064-9_20.
short: K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on
Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg,
2013, pp. 214–225.
conference:
end_date: 2013-04-05
location: Bilbao, Spain
name: 'LATA: Language and Automata Theory and Applications'
start_date: 2013-04-02
corr_author: '1'
date_created: 2022-03-21T07:56:21Z
date_published: 2013-04-15T00:00:00Z
date_updated: 2025-07-10T11:50:03Z
day: '15'
department:
- _id: KrCh
doi: 10.1007/978-3-642-37064-9_20
ec_funded: 1
fulldoi: https://doi.org/10.1007/978-3-642-37064-9_20
intvolume: ' 7810'
language:
- iso: eng
month: '04'
oa_version: None
page: 214-225
place: Berlin, Heidelberg
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 7th International Conference on Language and Automata Theory and Applications
publication_identifier:
eisbn:
- '9783642370649'
eissn:
- 1611-3349
isbn:
- '9783642370632'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: How to travel between languages
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7810
year: '2013'
...
---
_id: '11083'
abstract:
- lang: eng
text: Nuclear pore complex (NPC) proteins are known for their critical roles in
regulating nucleocytoplasmic traffic of macromolecules across the nuclear envelope.
However, recent findings suggest that some nucleoporins (Nups), including Nup98,
have additional functions in developmental gene regulation. Nup98, which exhibits
transcription-dependent mobility at the NPC but can also bind chromatin away from
the nuclear envelope, is frequently involved in chromosomal translocations in
a subset of patients suffering from acute myeloid leukemia (AML). A common paradigm
suggests that Nup98 translocations cause aberrant transcription when they are
recuited to aberrant genomic loci. Importantly, this model fails to account for
the potential loss of wild type (WT) Nup98 function in the presence of Nup98 translocation
mutants. Here we examine how the cell might regulate Nup98 nucleoplasmic protein
levels to control transcription in healthy cells. In addition, we discuss the
possibility that dominant negative Nup98 fusion proteins disrupt the transcriptional
activity of WT Nup98 in the nucleoplasm to drive AML.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Tobias M.
full_name: Franks, Tobias M.
last_name: Franks
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Franks TM, Hetzer M. The role of Nup98 in transcription regulation in healthy
and diseased cells. Trends in Cell Biology. 2013;23(3):112-117. doi:10.1016/j.tcb.2012.10.013
apa: Franks, T. M., & Hetzer, M. (2013). The role of Nup98 in transcription
regulation in healthy and diseased cells. Trends in Cell Biology. Elsevier.
https://doi.org/10.1016/j.tcb.2012.10.013
chicago: Franks, Tobias M., and Martin Hetzer. “The Role of Nup98 in Transcription
Regulation in Healthy and Diseased Cells.” Trends in Cell Biology. Elsevier,
2013. https://doi.org/10.1016/j.tcb.2012.10.013.
ieee: T. M. Franks and M. Hetzer, “The role of Nup98 in transcription regulation
in healthy and diseased cells,” Trends in Cell Biology, vol. 23, no. 3.
Elsevier, pp. 112–117, 2013.
ista: Franks TM, Hetzer M. 2013. The role of Nup98 in transcription regulation in
healthy and diseased cells. Trends in Cell Biology. 23(3), 112–117.
mla: Franks, Tobias M., and Martin Hetzer. “The Role of Nup98 in Transcription Regulation
in Healthy and Diseased Cells.” Trends in Cell Biology, vol. 23, no. 3,
Elsevier, 2013, pp. 112–17, doi:10.1016/j.tcb.2012.10.013.
short: T.M. Franks, M. Hetzer, Trends in Cell Biology 23 (2013) 112–117.
date_created: 2022-04-07T07:50:33Z
date_published: 2013-03-01T00:00:00Z
date_updated: 2024-10-14T11:23:44Z
day: '01'
doi: 10.1016/j.tcb.2012.10.013
extern: '1'
external_id:
pmid:
- '23246429'
fulldoi: https://doi.org/10.1016/j.tcb.2012.10.013
intvolume: ' 23'
issue: '3'
keyword:
- Cell Biology
language:
- iso: eng
month: '03'
oa_version: None
page: 112-117
pmid: 1
publication: Trends in Cell Biology
publication_identifier:
issn:
- 0962-8924
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: The role of Nup98 in transcription regulation in healthy and diseased cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2013'
...