---
_id: '15037'
abstract:
- lang: eng
text: Protein abundance and localization at the plasma membrane (PM) shapes plant
development and mediates adaptation to changing environmental conditions. It is
regulated by ubiquitination, a post-translational modification crucial for the
proper sorting of endocytosed PM proteins to the vacuole for subsequent degradation.
To understand the significance and the variety of roles played by this reversible
modification, the function of ubiquitin receptors, which translate the ubiquitin
signature into a cellular response, needs to be elucidated. In this study, we
show that TOL (TOM1-like) proteins function in plants as multivalent ubiquitin
receptors, governing ubiquitinated cargo delivery to the vacuole via the conserved
Endosomal Sorting Complex Required for Transport (ESCRT) pathway. TOL2 and TOL6
interact with components of the ESCRT machinery and bind to K63-linked ubiquitin
via two tandemly arranged conserved ubiquitin-binding domains. Mutation of these
domains results not only in a loss of ubiquitin binding but also altered localization,
abolishing TOL6 ubiquitin receptor activity. Function and localization of TOL6
is itself regulated by ubiquitination, whereby TOL6 ubiquitination potentially
modulates degradation of PM-localized cargoes, assisting in the fine-tuning of
the delicate interplay between protein recycling and downregulation. Taken together,
our findings demonstrate the function and regulation of a ubiquitin receptor that
mediates vacuolar degradation of PM proteins in higher plants.
article_processing_charge: No
article_type: original
author:
- first_name: Jeanette
full_name: Moulinier-Anzola, Jeanette
last_name: Moulinier-Anzola
- first_name: Maximilian
full_name: Schwihla, Maximilian
last_name: Schwihla
- first_name: Lucinda
full_name: De-Araújo, Lucinda
last_name: De-Araújo
- first_name: Christina
full_name: Artner, Christina
id: 45DF286A-F248-11E8-B48F-1D18A9856A87
last_name: Artner
- first_name: Lisa
full_name: Jörg, Lisa
last_name: Jörg
- first_name: Nataliia
full_name: Konstantinova, Nataliia
last_name: Konstantinova
- first_name: Christian
full_name: Luschnig, Christian
last_name: Luschnig
- first_name: Barbara
full_name: Korbei, Barbara
last_name: Korbei
citation:
ama: Moulinier-Anzola J, Schwihla M, De-Araújo L, et al. TOLs function as ubiquitin
receptors in the early steps of the ESCRT pathway in higher plants. Molecular
Plant. 2020;13(5):717-731. doi:10.1016/j.molp.2020.02.012
apa: Moulinier-Anzola, J., Schwihla, M., De-Araújo, L., Artner, C., Jörg, L., Konstantinova,
N., … Korbei, B. (2020). TOLs function as ubiquitin receptors in the early steps
of the ESCRT pathway in higher plants. Molecular Plant. Elsevier. https://doi.org/10.1016/j.molp.2020.02.012
chicago: Moulinier-Anzola, Jeanette, Maximilian Schwihla, Lucinda De-Araújo, Christina
Artner, Lisa Jörg, Nataliia Konstantinova, Christian Luschnig, and Barbara Korbei.
“TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway
in Higher Plants.” Molecular Plant. Elsevier, 2020. https://doi.org/10.1016/j.molp.2020.02.012.
ieee: J. Moulinier-Anzola et al., “TOLs function as ubiquitin receptors in
the early steps of the ESCRT pathway in higher plants,” Molecular Plant,
vol. 13, no. 5. Elsevier, pp. 717–731, 2020.
ista: Moulinier-Anzola J, Schwihla M, De-Araújo L, Artner C, Jörg L, Konstantinova
N, Luschnig C, Korbei B. 2020. TOLs function as ubiquitin receptors in the early
steps of the ESCRT pathway in higher plants. Molecular Plant. 13(5), 717–731.
mla: Moulinier-Anzola, Jeanette, et al. “TOLs Function as Ubiquitin Receptors in
the Early Steps of the ESCRT Pathway in Higher Plants.” Molecular Plant,
vol. 13, no. 5, Elsevier, 2020, pp. 717–31, doi:10.1016/j.molp.2020.02.012.
short: J. Moulinier-Anzola, M. Schwihla, L. De-Araújo, C. Artner, L. Jörg, N. Konstantinova,
C. Luschnig, B. Korbei, Molecular Plant 13 (2020) 717–731.
date_created: 2024-02-28T08:55:56Z
date_published: 2020-05-04T00:00:00Z
date_updated: 2024-02-28T12:41:52Z
day: '04'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.1016/j.molp.2020.02.012
external_id:
pmid:
- '32087370'
file:
- access_level: open_access
checksum: c538a5008f7827f62d17d40a3bfabe65
content_type: application/pdf
creator: dernst
date_created: 2024-02-28T12:39:56Z
date_updated: 2024-02-28T12:39:56Z
file_id: '15038'
file_name: 2020_MolecularPlant_MoulinierAnzola.pdf
file_size: 3089212
relation: main_file
success: 1
file_date_updated: 2024-02-28T12:39:56Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '5'
keyword:
- Plant Science
- Molecular Biology
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 717-731
pmid: 1
publication: Molecular Plant
publication_identifier:
issn:
- 1674-2052
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway
in higher plants
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2020'
...
---
_id: '15036'
abstract:
- lang: eng
text: The assembly of a septin filament requires that homologous monomers must distinguish
between one another in establishing appropriate interfaces with their neighbors.
To understand this phenomenon at the molecular level, we present the first four
crystal structures of heterodimeric septin complexes. We describe in detail the
two distinct types of G-interface present within the octameric particles, which
must polymerize to form filaments. These are formed between SEPT2 and SEPT6 and
between SEPT7 and SEPT3, and their description permits an understanding of the
structural basis for the selectivity necessary for correct filament assembly.
By replacing SEPT6 by SEPT8 or SEPT11, it is possible to rationalize Kinoshita's
postulate, which predicts the exchangeability of septins from within a subgroup.
Switches I and II, which in classical small GTPases provide a mechanism for nucleotide-dependent
conformational change, have been repurposed in septins to play a fundamental role
in molecular recognition. Specifically, it is switch I which holds the key to
discriminating between the two different G-interfaces. Moreover, residues which
are characteristic for a given subgroup play subtle, but pivotal, roles in guaranteeing
that the correct interfaces are formed.
article_processing_charge: No
article_type: original
author:
- first_name: Higor Vinícius Dias
full_name: Rosa, Higor Vinícius Dias
last_name: Rosa
- first_name: Diego Antonio
full_name: Leonardo, Diego Antonio
last_name: Leonardo
- first_name: Gabriel
full_name: Brognara, Gabriel
id: D96FFDA0-A884-11E9-9968-DC26E6697425
last_name: Brognara
- first_name: José
full_name: Brandão-Neto, José
last_name: Brandão-Neto
- first_name: Humberto
full_name: D'Muniz Pereira, Humberto
last_name: D'Muniz Pereira
- first_name: Ana Paula Ulian
full_name: Araújo, Ana Paula Ulian
last_name: Araújo
- first_name: Richard Charles
full_name: Garratt, Richard Charles
last_name: Garratt
citation:
ama: 'Rosa HVD, Leonardo DA, Brognara G, et al. Molecular recognition at septin
interfaces: The switches hold the key. Journal of Molecular Biology. 2020;432(21):5784-5801.
doi:10.1016/j.jmb.2020.09.001'
apa: 'Rosa, H. V. D., Leonardo, D. A., Brognara, G., Brandão-Neto, J., D’Muniz Pereira,
H., Araújo, A. P. U., & Garratt, R. C. (2020). Molecular recognition at septin
interfaces: The switches hold the key. Journal of Molecular Biology. Elsevier.
https://doi.org/10.1016/j.jmb.2020.09.001'
chicago: 'Rosa, Higor Vinícius Dias, Diego Antonio Leonardo, Gabriel Brognara, José
Brandão-Neto, Humberto D’Muniz Pereira, Ana Paula Ulian Araújo, and Richard Charles
Garratt. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.”
Journal of Molecular Biology. Elsevier, 2020. https://doi.org/10.1016/j.jmb.2020.09.001.'
ieee: 'H. V. D. Rosa et al., “Molecular recognition at septin interfaces:
The switches hold the key,” Journal of Molecular Biology, vol. 432, no.
21. Elsevier, pp. 5784–5801, 2020.'
ista: 'Rosa HVD, Leonardo DA, Brognara G, Brandão-Neto J, D’Muniz Pereira H, Araújo
APU, Garratt RC. 2020. Molecular recognition at septin interfaces: The switches
hold the key. Journal of Molecular Biology. 432(21), 5784–5801.'
mla: 'Rosa, Higor Vinícius Dias, et al. “Molecular Recognition at Septin Interfaces:
The Switches Hold the Key.” Journal of Molecular Biology, vol. 432, no.
21, Elsevier, 2020, pp. 5784–801, doi:10.1016/j.jmb.2020.09.001.'
short: H.V.D. Rosa, D.A. Leonardo, G. Brognara, J. Brandão-Neto, H. D’Muniz Pereira,
A.P.U. Araújo, R.C. Garratt, Journal of Molecular Biology 432 (2020) 5784–5801.
date_created: 2024-02-28T08:50:34Z
date_published: 2020-10-02T00:00:00Z
date_updated: 2024-02-28T12:37:54Z
day: '02'
department:
- _id: MaLo
doi: 10.1016/j.jmb.2020.09.001
external_id:
pmid:
- '32910969'
intvolume: ' 432'
issue: '21'
keyword:
- Molecular Biology
- Structural Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.jmb.2020.09.001
month: '10'
oa: 1
oa_version: Published Version
page: 5784-5801
pmid: 1
publication: Journal of Molecular Biology
publication_identifier:
issn:
- 0022-2836
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: 'Molecular recognition at septin interfaces: The switches hold the key'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 432
year: '2020'
...
---
_id: '8384'
abstract:
- lang: eng
text: Previous research on animations of soap bubbles, films, and foams largely
focuses on the motion and geometric shape of the bubble surface. These works neglect
the evolution of the bubble’s thickness, which is normally responsible for visual
phenomena like surface vortices, Newton’s interference patterns, capillary waves,
and deformation-dependent rupturing of films in a foam. In this paper, we model
these natural phenomena by introducing the film thickness as a reduced degree
of freedom in the Navier-Stokes equations and deriving their equations of motion.
We discretize the equations on a nonmanifold triangle mesh surface and couple
it to an existing bubble solver. In doing so, we also introduce an incompressible
fluid solver for 2.5D films and a novel advection algorithm for convecting fields
across non-manifold surface junctions. Our simulations enhance state-of-the-art
bubble solvers with additional effects caused by convection, rippling, draining,
and evaporation of the thin film.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "We wish to thank the anonymous reviewers and the members of the
Visual Computing Group at IST Austria for their valuable feedback, especially Camille
Schreck for her help in rendering. This research was supported by the Scientific
Service Units (SSU) of IST Austria through resources provided by Scientific Computing.
We would like to thank the authors of [Belcour and Barla 2017] for providing their
implementation, the authors of [Atkins and Elliott 2010] and [Seychelles et al.
2008] for allowing us to use their results, and Rok Grah for helpful discussions.
Finally, we thank Ryoichi Ando for many discussions from the beginning of the project
that resulted in important contents of the paper including our formulation, numerical
scheme, and initial implementation. This project has received funding from the\r\nEuropean
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme under grant agreement No. 638176."
article_number: '31'
article_processing_charge: No
article_type: original
author:
- first_name: Sadashige
full_name: Ishida, Sadashige
id: 6F7C4B96-A8E9-11E9-A7CA-09ECE5697425
last_name: Ishida
- first_name: Peter
full_name: Synak, Peter
id: 331776E2-F248-11E8-B48F-1D18A9856A87
last_name: Synak
- first_name: Fumiya
full_name: Narita, Fumiya
last_name: Narita
- first_name: Toshiya
full_name: Hachisuka, Toshiya
last_name: Hachisuka
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. A model for soap film dynamics
with evolving thickness. ACM Transactions on Graphics. 2020;39(4). doi:10.1145/3386569.3392405
apa: Ishida, S., Synak, P., Narita, F., Hachisuka, T., & Wojtan, C. (2020).
A model for soap film dynamics with evolving thickness. ACM Transactions on
Graphics. Association for Computing Machinery. https://doi.org/10.1145/3386569.3392405
chicago: Ishida, Sadashige, Peter Synak, Fumiya Narita, Toshiya Hachisuka, and Chris
Wojtan. “A Model for Soap Film Dynamics with Evolving Thickness.” ACM Transactions
on Graphics. Association for Computing Machinery, 2020. https://doi.org/10.1145/3386569.3392405.
ieee: S. Ishida, P. Synak, F. Narita, T. Hachisuka, and C. Wojtan, “A model for
soap film dynamics with evolving thickness,” ACM Transactions on Graphics,
vol. 39, no. 4. Association for Computing Machinery, 2020.
ista: Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. 2020. A model for soap
film dynamics with evolving thickness. ACM Transactions on Graphics. 39(4), 31.
mla: Ishida, Sadashige, et al. “A Model for Soap Film Dynamics with Evolving Thickness.”
ACM Transactions on Graphics, vol. 39, no. 4, 31, Association for Computing
Machinery, 2020, doi:10.1145/3386569.3392405.
short: S. Ishida, P. Synak, F. Narita, T. Hachisuka, C. Wojtan, ACM Transactions
on Graphics 39 (2020).
date_created: 2020-09-13T22:01:18Z
date_published: 2020-07-08T00:00:00Z
date_updated: 2024-02-28T12:57:31Z
day: '08'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3386569.3392405
ec_funded: 1
external_id:
isi:
- '000583700300004'
file:
- access_level: open_access
checksum: 813831ca91319d794d9748c276b24578
content_type: application/pdf
creator: dernst
date_created: 2020-11-23T09:03:19Z
date_updated: 2020-11-23T09:03:19Z
file_id: '8795'
file_name: 2020_soapfilm_submitted.pdf
file_size: 14935529
relation: main_file
success: 1
file_date_updated: 2020-11-23T09:03:19Z
has_accepted_license: '1'
intvolume: ' 39'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3386569.3392405
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- '15577368'
issn:
- '07300301'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: A model for soap film dynamics with evolving thickness
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 39
year: '2020'
...
---
_id: '7802'
abstract:
- lang: eng
text: "The Massively Parallel Computation (MPC) model is an emerging model which
distills core aspects of distributed and parallel computation. It has been developed
as a tool to solve (typically graph) problems in systems where the input is distributed
over many machines with limited space.\r\n\t\r\nRecent work has focused on the
regime in which machines have sublinear (in $n$, the number of nodes in the input
graph) space, with randomized algorithms presented for fundamental graph problems
of Maximal Matching and Maximal Independent Set. However, there have been no prior
corresponding deterministic algorithms.\r\n\t\r\n\tA major challenge underlying
the sublinear space setting is that the local space of each machine might be too
small to store all the edges incident to a single node. This poses a considerable
obstacle compared to the classical models in which each node is assumed to know
and have easy access to its incident edges. To overcome this barrier we introduce
a new graph sparsification technique that deterministically computes a low-degree
subgraph with additional desired properties. The degree of the nodes in this subgraph
is small in the sense that the edges of each node can be now stored on a single
machine. This low-degree subgraph also has the property that solving the problem
on this subgraph provides \\emph{significant} global progress, i.e., progress
towards solving the problem for the original input graph.\r\n\t\r\nUsing this
framework to derandomize the well-known randomized algorithm of Luby [SICOMP'86],
we obtain $O(\\log \\Delta+\\log\\log n)$-round deterministic MPC algorithms for
solving the fundamental problems of Maximal Matching and Maximal Independent Set
with $O(n^{\\epsilon})$ space on each machine for any constant $\\epsilon > 0$.
Based on the recent work of Ghaffari et al. [FOCS'18], this additive $O(\\log\\log
n)$ factor is conditionally essential. These algorithms can also be shown to run
in $O(\\log \\Delta)$ rounds in the closely related model of CONGESTED CLIQUE,
improving upon the state-of-the-art bound of $O(\\log^2 \\Delta)$ rounds by Censor-Hillel
et al. [DISC'17]."
article_processing_charge: No
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
orcid: 0000-0002-5646-9524
- first_name: Peter
full_name: Davies, Peter
id: 11396234-BB50-11E9-B24C-90FCE5697425
last_name: Davies
orcid: 0000-0002-5646-9524
- first_name: Merav
full_name: Parter, Merav
last_name: Parter
citation:
ama: 'Czumaj A, Davies P, Parter M. Graph sparsification for derandomizing massively
parallel computation with low space. In: Proceedings of the 32nd ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA 2020). Association for
Computing Machinery; 2020:175-185. doi:10.1145/3350755.3400282'
apa: 'Czumaj, A., Davies, P., & Parter, M. (2020). Graph sparsification for
derandomizing massively parallel computation with low space. In Proceedings
of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA
2020) (pp. 175–185). Virtual Event, United States: Association for Computing
Machinery. https://doi.org/10.1145/3350755.3400282'
chicago: Czumaj, Artur, Peter Davies, and Merav Parter. “Graph Sparsification for
Derandomizing Massively Parallel Computation with Low Space.” In Proceedings
of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA
2020), 175–85. Association for Computing Machinery, 2020. https://doi.org/10.1145/3350755.3400282.
ieee: A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing
massively parallel computation with low space,” in Proceedings of the 32nd
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020),
Virtual Event, United States, 2020, no. 7, pp. 175–185.
ista: 'Czumaj A, Davies P, Parter M. 2020. Graph sparsification for derandomizing
massively parallel computation with low space. Proceedings of the 32nd ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA 2020). SPAA: Symposium on
Parallelism in Algorithms and Architectures, 175–185.'
mla: Czumaj, Artur, et al. “Graph Sparsification for Derandomizing Massively Parallel
Computation with Low Space.” Proceedings of the 32nd ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA 2020), no. 7, Association for Computing
Machinery, 2020, pp. 175–85, doi:10.1145/3350755.3400282.
short: A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 32nd ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA 2020), Association for Computing
Machinery, 2020, pp. 175–185.
conference:
end_date: 2020-07-17
location: Virtual Event, United States
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2020-07-15
date_created: 2020-05-06T08:53:34Z
date_published: 2020-07-01T00:00:00Z
date_updated: 2024-02-28T12:53:09Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3350755.3400282
ec_funded: 1
external_id:
arxiv:
- '1912.05390'
isi:
- '000744436200015'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1912.05390
month: '07'
oa: 1
oa_version: Preprint
page: 175-185
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA 2020)
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '9541'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Graph sparsification for derandomizing massively parallel computation with
low space
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2020'
...
---
_id: '7636'
abstract:
- lang: eng
text: "Balanced search trees typically use key comparisons to guide their operations,
and achieve logarithmic running time. By relying on numerical properties of the
keys, interpolation search achieves lower search complexity and better performance.
Although interpolation-based data structures were investigated in the past, their
non-blocking concurrent variants have received very little attention so far.\r\nIn
this paper, we propose the first non-blocking implementation of the classic interpolation
search tree (IST) data structure. For arbitrary key distributions, the data structure
ensures worst-case O(log n + p) amortized time for search, insertion and deletion
traversals. When the input key distributions are smooth, lookups run in expected
O(log log n + p) time, and insertion and deletion run in expected amortized O(log
log n + p) time, where p is a bound on the number of threads. To improve the scalability
of concurrent insertion and deletion, we propose a novel parallel rebuilding technique,
which should be of independent interest.\r\nWe evaluate whether the theoretical
improvements translate to practice by implementing the concurrent interpolation
search tree, and benchmarking it on uniform and nonuniform key distributions,
for dataset sizes in the millions to billions of keys. Relative to the state-of-the-art
concurrent data structures, the concurrent interpolation search tree achieves
performance improvements of up to 15% under high update rates, and of up to 50%
under moderate update rates. Further, ISTs exhibit up to 2X less cache-misses,
and consume 1.2 -- 2.6X less memory compared to the next best alternative on typical
dataset sizes. We find that the results are surprisingly robust to distributional
skew, which suggests that our data structure can be a promising alternative to
classic concurrent search structures."
acknowledgement: "This project has received funding from the European Research Council
(ERC) under the European Union Horizon 2020 research and innovation program, grant
agreement No 805223, ERC Starting Grant ScaleML. We acknowledge the support of the
Natural Sciences and\r\nEngineering Research Council of Canada (NSERC). "
article_processing_charge: No
author:
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Aleksandar
full_name: Prokopec, Aleksandar
last_name: Prokopec
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Brown TA, Prokopec A, Alistarh D-A. Non-blocking interpolation search trees
with doubly-logarithmic running time. In: Proceedings of the ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming. Association for Computing
Machinery; 2020:276-291. doi:10.1145/3332466.3374542'
apa: 'Brown, T. A., Prokopec, A., & Alistarh, D.-A. (2020). Non-blocking interpolation
search trees with doubly-logarithmic running time. In Proceedings of the ACM
SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp.
276–291). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3332466.3374542'
chicago: Brown, Trevor A, Aleksandar Prokopec, and Dan-Adrian Alistarh. “Non-Blocking
Interpolation Search Trees with Doubly-Logarithmic Running Time.” In Proceedings
of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
276–91. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374542.
ieee: T. A. Brown, A. Prokopec, and D.-A. Alistarh, “Non-blocking interpolation
search trees with doubly-logarithmic running time,” in Proceedings of the ACM
SIGPLAN Symposium on Principles and Practice of Parallel Programming, San
Diego, CA, United States, 2020, pp. 276–291.
ista: 'Brown TA, Prokopec A, Alistarh D-A. 2020. Non-blocking interpolation search
trees with doubly-logarithmic running time. Proceedings of the ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming. PPOPP: Principles and Practice
of Parallel Programming, 276–291.'
mla: Brown, Trevor A., et al. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic
Running Time.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice
of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–91,
doi:10.1145/3332466.3374542.
short: T.A. Brown, A. Prokopec, D.-A. Alistarh, in:, Proceedings of the ACM SIGPLAN
Symposium on Principles and Practice of Parallel Programming, Association for
Computing Machinery, 2020, pp. 276–291.
conference:
end_date: 2020-02-26
location: San Diego, CA, United States
name: 'PPOPP: Principles and Practice of Parallel Programming'
start_date: 2020-02-22
date_created: 2020-04-05T22:00:49Z
date_published: 2020-02-19T00:00:00Z
date_updated: 2024-02-28T12:55:14Z
day: '19'
department:
- _id: DaAl
doi: 10.1145/3332466.3374542
ec_funded: 1
external_id:
isi:
- '000564476500020'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3332466.3374542
month: '02'
oa: 1
oa_version: Published Version
page: 276-291
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming
publication_identifier:
isbn:
- '9781450368186'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Non-blocking interpolation search trees with doubly-logarithmic running time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8191'
abstract:
- lang: eng
text: "There has been a significant amount of research on hardware and software
support for efficient concurrent data structures; yet, the question of how to
build correct, simple, and scalable data structures has not yet been definitively
settled. In this paper, we revisit this question from a minimalist perspective,
and ask: what is the smallest amount of synchronization required for correct and
efficient concurrent search data structures, and how could this minimal synchronization
support be provided in hardware?\r\n\r\nTo address these questions, we introduce
memory tagging, a simple hardware mechanism which enables the programmer to \"tag\"
a dynamic set of memory locations, at cache-line granularity, and later validate
whether the memory has been concurrently modified, with the possibility of updating
one of the underlying locations atomically if validation succeeds. We provide
several examples showing that this mechanism can enable fast and arguably simple
concurrent data structure designs, such as lists, binary search trees, balanced
search trees, range queries, and Software Transactional Memory (STM) implementations.
We provide an implementation of memory tags in the Graphite multi-core simulator,
showing that the mechanism can be implemented entirely at the level of L1 cache,
and that it can enable non-trivial speedups versus existing implementations of
the above data structures."
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: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Nandini
full_name: Singhal, Nandini
last_name: Singhal
citation:
ama: 'Alistarh D-A, Brown TA, Singhal N. Memory tagging: Minimalist synchronization
for scalable concurrent data structures. In: Annual ACM Symposium on Parallelism
in Algorithms and Architectures. Association for Computing Machinery; 2020:37-49.
doi:10.1145/3350755.3400213'
apa: 'Alistarh, D.-A., Brown, T. A., & Singhal, N. (2020). Memory tagging: Minimalist
synchronization for scalable concurrent data structures. In Annual ACM Symposium
on Parallelism in Algorithms and Architectures (pp. 37–49). Virtual Event,
United States: Association for Computing Machinery. https://doi.org/10.1145/3350755.3400213'
chicago: 'Alistarh, Dan-Adrian, Trevor A Brown, and Nandini Singhal. “Memory Tagging:
Minimalist Synchronization for Scalable Concurrent Data Structures.” In Annual
ACM Symposium on Parallelism in Algorithms and Architectures, 37–49. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3350755.3400213.'
ieee: 'D.-A. Alistarh, T. A. Brown, and N. Singhal, “Memory tagging: Minimalist
synchronization for scalable concurrent data structures,” in Annual ACM Symposium
on Parallelism in Algorithms and Architectures, Virtual Event, United States,
2020, no. 7, pp. 37–49.'
ista: 'Alistarh D-A, Brown TA, Singhal N. 2020. Memory tagging: Minimalist synchronization
for scalable concurrent data structures. Annual ACM Symposium on Parallelism in
Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and
Architectures, 37–49.'
mla: 'Alistarh, Dan-Adrian, et al. “Memory Tagging: Minimalist Synchronization for
Scalable Concurrent Data Structures.” Annual ACM Symposium on Parallelism in
Algorithms and Architectures, no. 7, Association for Computing Machinery,
2020, pp. 37–49, doi:10.1145/3350755.3400213.'
short: D.-A. Alistarh, T.A. Brown, N. Singhal, in:, Annual ACM Symposium on Parallelism
in Algorithms and Architectures, Association for Computing Machinery, 2020, pp.
37–49.
conference:
end_date: 2020-07-17
location: Virtual Event, United States
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2020-07-15
date_created: 2020-08-02T22:00:58Z
date_published: 2020-07-06T00:00:00Z
date_updated: 2024-02-28T12:56:32Z
day: '06'
department:
- _id: DaAl
doi: 10.1145/3350755.3400213
external_id:
isi:
- '000744436200004'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa_version: None
page: 37-49
publication: Annual ACM Symposium on Parallelism in Algorithms and Architectures
publication_identifier:
isbn:
- '9781450369350'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Memory tagging: Minimalist synchronization for scalable concurrent data structures'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '7635'
abstract:
- lang: eng
text: Concurrent programming can be notoriously complex and error-prone. Programming
bugs can arise from a variety of sources, such as operation re-reordering, or
incomplete understanding of the memory model. A variety of formal and model checking
methods have been developed to address this fundamental difficulty. While technically
interesting, existing academic methods are still hard to apply to the large codebases
typical of industrial deployments, which limits their practical impact.
article_processing_charge: No
author:
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
- first_name: Mariia
full_name: Sokolova, Mariia
id: 26217AE4-77FF-11EA-8101-AD24D49E41F4
last_name: Sokolova
- first_name: Alexander
full_name: Fedorov, Alexander
last_name: Fedorov
- 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: Dmitry
full_name: Tsitelov, Dmitry
last_name: Tsitelov
citation:
ama: 'Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. Testing concurrency
on the JVM with Lincheck. In: Proceedings of the ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming, PPOPP. Association for Computing Machinery;
2020:423-424. doi:10.1145/3332466.3374503'
apa: 'Koval, N., Sokolova, M., Fedorov, A., Alistarh, D.-A., & Tsitelov, D.
(2020). Testing concurrency on the JVM with Lincheck. In Proceedings of the
ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP
(pp. 423–424). San Diego, CA, United States: Association for Computing Machinery.
https://doi.org/10.1145/3332466.3374503'
chicago: Koval, Nikita, Mariia Sokolova, Alexander Fedorov, Dan-Adrian Alistarh,
and Dmitry Tsitelov. “Testing Concurrency on the JVM with Lincheck.” In Proceedings
of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
PPOPP, 423–24. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374503.
ieee: N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, and D. Tsitelov, “Testing
concurrency on the JVM with Lincheck,” in Proceedings of the ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming, PPOPP, San Diego, CA,
United States, 2020, pp. 423–424.
ista: 'Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. 2020. Testing concurrency
on the JVM with Lincheck. Proceedings of the ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming, PPOPP. PPOPP: Principles and Practice of
Parallel Programming, 423–424.'
mla: Koval, Nikita, et al. “Testing Concurrency on the JVM with Lincheck.” Proceedings
of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
PPOPP, Association for Computing Machinery, 2020, pp. 423–24, doi:10.1145/3332466.3374503.
short: N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, D. Tsitelov, in:, Proceedings
of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
PPOPP, Association for Computing Machinery, 2020, pp. 423–424.
conference:
end_date: 2020-02-26
location: San Diego, CA, United States
name: 'PPOPP: Principles and Practice of Parallel Programming'
start_date: 2020-02-22
date_created: 2020-04-05T22:00:48Z
date_published: 2020-02-19T00:00:00Z
date_updated: 2024-02-28T12:53:46Z
day: '19'
department:
- _id: DaAl
doi: 10.1145/3332466.3374503
language:
- iso: eng
month: '02'
oa_version: None
page: 423-424
publication: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPOPP
publication_identifier:
isbn:
- '9781450368186'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Testing concurrency on the JVM with Lincheck
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8383'
abstract:
- lang: eng
text: We introduce extension-based proofs, a class of impossibility proofs that
includes valency arguments. They are modelled as an interaction between a prover
and a protocol. Using proofs based on combinatorial topology, it has been shown
that it is impossible to deterministically solve k-set agreement among n > k ≥
2 processes in a wait-free manner. However, it was unknown whether proofs based
on simpler techniques were possible. We explain why this impossibility result
cannot be obtained by an extension-based proof and, hence, extension-based proofs
are limited in power.
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: Faith
full_name: Ellen, Faith
last_name: Ellen
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
- first_name: Leqi
full_name: Zhu, Leqi
last_name: Zhu
citation:
ama: 'Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Brief Announcement:
Why Extension-Based Proofs Fail. In: Proceedings of the 39th Symposium on Principles
of Distributed Computing. Association for Computing Machinery; 2020:54-56.
doi:10.1145/3382734.3405743'
apa: 'Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., & Zhu, L. (2020).
Brief Announcement: Why Extension-Based Proofs Fail. In Proceedings of the
39th Symposium on Principles of Distributed Computing (pp. 54–56). Virtual,
Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405743'
chicago: 'Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and
Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In Proceedings
of the 39th Symposium on Principles of Distributed Computing, 54–56. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405743.'
ieee: 'D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement:
Why Extension-Based Proofs Fail,” in Proceedings of the 39th Symposium on Principles
of Distributed Computing, Virtual, Italy, 2020, pp. 54–56.'
ista: 'Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2020. Brief Announcement:
Why Extension-Based Proofs Fail. Proceedings of the 39th Symposium on Principles
of Distributed Computing. PODC: Principles of Distributed Computing, 54–56.'
mla: 'Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs
Fail.” Proceedings of the 39th Symposium on Principles of Distributed Computing,
Association for Computing Machinery, 2020, pp. 54–56, doi:10.1145/3382734.3405743.'
short: D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings
of the 39th Symposium on Principles of Distributed Computing, Association for
Computing Machinery, 2020, pp. 54–56.
conference:
end_date: 2020-08-07
location: Virtual, Italy
name: 'PODC: Principles of Distributed Computing'
start_date: 2020-08-03
date_created: 2020-09-13T22:01:18Z
date_published: 2020-07-31T00:00:00Z
date_updated: 2024-02-28T12:54:19Z
day: '31'
department:
- _id: DaAl
doi: 10.1145/3382734.3405743
language:
- iso: eng
month: '07'
oa_version: None
page: 54-56
publication: Proceedings of the 39th Symposium on Principles of Distributed Computing
publication_identifier:
isbn:
- '9781450375825'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Brief Announcement: Why Extension-Based Proofs Fail'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8385'
abstract:
- lang: eng
text: 'We present a method for animating yarn-level cloth effects using a thin-shell
solver. We accomplish this through numerical homogenization: we first use a large
number of yarn-level simulations to build a model of the potential energy density
of the cloth, and then use this energy density function to compute forces in a
thin shell simulator. We model several yarn-based materials, including both woven
and knitted fabrics. Our model faithfully reproduces expected effects like the
stiffness of woven fabrics, and the highly deformable nature and anisotropy of
knitted fabrics. Our approach does not require any real-world experiments nor
measurements; because the method is based entirely on simulations, it can generate
entirely new material models quickly, without the need for testing apparatuses
or human intervention. We provide data-driven models of several woven and knitted
fabrics, which can be used for efficient simulation with an off-the-shelf cloth
solver.'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "We wish to thank the anonymous reviewers and the members of the
Visual Computing Group at IST Austria for their valuable feedback. We also thank
the creators of the Berkeley Garment Library [de Joya et al. 2012] for providing
garment meshes, [Krishnamurthy and Levoy 1996] and [Turk and Levoy 1994] for the
armadillo and bunny meshes, the creators of libWetCloth [Fei et al. 2018] for their
implementation of discrete elastic rod forces, and Tomáš Skřivan for\r\ninspiring
discussions and help with Mathematica code generation. This research was supported
by the Scientific Service Units (SSU) of IST Austria through resources provided
by Scientific Computing. This project has received funding from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
under grant agreement No. 638176. Rahul Narain is supported by a Pankaj Gupta Young
Faculty Fellowship and a gift from Adobe Inc."
article_number: '48'
article_processing_charge: No
article_type: original
author:
- first_name: Georg
full_name: Sperl, Georg
id: 4DD40360-F248-11E8-B48F-1D18A9856A87
last_name: Sperl
- first_name: Rahul
full_name: Narain, Rahul
last_name: Narain
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Sperl G, Narain R, Wojtan C. Homogenized yarn-level cloth. ACM Transactions
on Graphics. 2020;39(4). doi:10.1145/3386569.3392412
apa: Sperl, G., Narain, R., & Wojtan, C. (2020). Homogenized yarn-level cloth.
ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3386569.3392412
chicago: Sperl, Georg, Rahul Narain, and Chris Wojtan. “Homogenized Yarn-Level Cloth.”
ACM Transactions on Graphics. Association for Computing Machinery, 2020.
https://doi.org/10.1145/3386569.3392412.
ieee: G. Sperl, R. Narain, and C. Wojtan, “Homogenized yarn-level cloth,” ACM
Transactions on Graphics, vol. 39, no. 4. Association for Computing Machinery,
2020.
ista: Sperl G, Narain R, Wojtan C. 2020. Homogenized yarn-level cloth. ACM Transactions
on Graphics. 39(4), 48.
mla: Sperl, Georg, et al. “Homogenized Yarn-Level Cloth.” ACM Transactions on
Graphics, vol. 39, no. 4, 48, Association for Computing Machinery, 2020, doi:10.1145/3386569.3392412.
short: G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 39 (2020).
date_created: 2020-09-13T22:01:18Z
date_published: 2020-07-08T00:00:00Z
date_updated: 2024-02-28T12:57:47Z
day: '08'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3386569.3392412
ec_funded: 1
external_id:
isi:
- '000583700300021'
file:
- access_level: open_access
checksum: cf4c1d361c3196c4bd424520a5588205
content_type: application/pdf
creator: dernst
date_created: 2020-11-23T09:01:22Z
date_updated: 2020-11-23T09:01:22Z
file_id: '8794'
file_name: 2020_hylc_submitted.pdf
file_size: 38922662
relation: main_file
success: 1
file_date_updated: 2020-11-23T09:01:22Z
has_accepted_license: '1'
intvolume: ' 39'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3386569.3392412
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- '15577368'
issn:
- '07300301'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '12358'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Homogenized yarn-level cloth
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 39
year: '2020'
...
---
_id: '7956'
abstract:
- lang: eng
text: When short-range attractions are combined with long-range repulsions in colloidal
particle systems, complex microphases can emerge. Here, we study a system of isotropic
particles, which can form lamellar structures or a disordered fluid phase when
temperature is varied. We show that, at equilibrium, the lamellar structure crystallizes,
while out of equilibrium, the system forms a variety of structures at different
shear rates and temperatures above melting. The shear-induced ordering is analyzed
by means of principal component analysis and artificial neural networks, which
are applied to data of reduced dimensionality. Our results reveal the possibility
of inducing ordering by shear, potentially providing a feasible route to the fabrication
of ordered lamellar structures from isotropic particles.
article_number: '204905'
article_processing_charge: No
article_type: original
author:
- first_name: J.
full_name: Pȩkalski, J.
last_name: Pȩkalski
- first_name: Wojciech
full_name: Rzadkowski, Wojciech
id: 48C55298-F248-11E8-B48F-1D18A9856A87
last_name: Rzadkowski
orcid: 0000-0002-1106-4419
- first_name: A. Z.
full_name: Panagiotopoulos, A. Z.
last_name: Panagiotopoulos
citation:
ama: 'Pȩkalski J, Rzadkowski W, Panagiotopoulos AZ. Shear-induced ordering in systems
with competing interactions: A machine learning study. The Journal of chemical
physics. 2020;152(20). doi:10.1063/5.0005194'
apa: 'Pȩkalski, J., Rzadkowski, W., & Panagiotopoulos, A. Z. (2020). Shear-induced
ordering in systems with competing interactions: A machine learning study. The
Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/5.0005194'
chicago: 'Pȩkalski, J., Wojciech Rzadkowski, and A. Z. Panagiotopoulos. “Shear-Induced
Ordering in Systems with Competing Interactions: A Machine Learning Study.” The
Journal of Chemical Physics. AIP Publishing, 2020. https://doi.org/10.1063/5.0005194.'
ieee: 'J. Pȩkalski, W. Rzadkowski, and A. Z. Panagiotopoulos, “Shear-induced ordering
in systems with competing interactions: A machine learning study,” The Journal
of chemical physics, vol. 152, no. 20. AIP Publishing, 2020.'
ista: 'Pȩkalski J, Rzadkowski W, Panagiotopoulos AZ. 2020. Shear-induced ordering
in systems with competing interactions: A machine learning study. The Journal
of chemical physics. 152(20), 204905.'
mla: 'Pȩkalski, J., et al. “Shear-Induced Ordering in Systems with Competing Interactions:
A Machine Learning Study.” The Journal of Chemical Physics, vol. 152, no.
20, 204905, AIP Publishing, 2020, doi:10.1063/5.0005194.'
short: J. Pȩkalski, W. Rzadkowski, A.Z. Panagiotopoulos, The Journal of Chemical
Physics 152 (2020).
date_created: 2020-06-14T22:00:49Z
date_published: 2020-05-29T00:00:00Z
date_updated: 2024-02-28T13:00:28Z
day: '29'
department:
- _id: MiLe
doi: 10.1063/5.0005194
ec_funded: 1
external_id:
arxiv:
- '2002.07294'
isi:
- '000537900300001'
intvolume: ' 152'
isi: 1
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1063/5.0005194
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: The Journal of chemical physics
publication_identifier:
eissn:
- '10897690'
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
related_material:
record:
- id: '10759'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Shear-induced ordering in systems with competing interactions: A machine learning
study'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 152
year: '2020'
...