---
_id: '67'
abstract:
- lang: eng
text: 'Gene regulatory networks evolve through rewiring of individual components—that
is, through changes in regulatory connections. However, the mechanistic basis
of regulatory rewiring is poorly understood. Using a canonical gene regulatory
system, we quantify the properties of transcription factors that determine the
evolutionary potential for rewiring of regulatory connections: robustness, tunability
and evolvability. In vivo repression measurements of two repressors at mutated
operator sites reveal their contrasting evolutionary potential: while robustness
and evolvability were positively correlated, both were in trade-off with tunability.
Epistatic interactions between adjacent operators alleviated this trade-off. A
thermodynamic model explains how the differences in robustness, tunability and
evolvability arise from biophysical characteristics of repressor–DNA binding.
The model also uncovers that the energy matrix, which describes how mutations
affect repressor–DNA binding, encodes crucial information about the evolutionary
potential of a repressor. The biophysical determinants of evolutionary potential
for regulatory rewiring constitute a mechanistic framework for understanding network
evolution.'
article_processing_charge: No
article_type: original
author:
- first_name: Claudia
full_name: Igler, Claudia
id: 46613666-F248-11E8-B48F-1D18A9856A87
last_name: Igler
- first_name: Mato
full_name: Lagator, Mato
id: 345D25EC-F248-11E8-B48F-1D18A9856A87
last_name: Lagator
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. Evolutionary potential
of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution.
2018;2(10):1633-1643. doi:10.1038/s41559-018-0651-y
apa: Igler, C., Lagator, M., Tkačik, G., Bollback, J. P., & Guet, C. C. (2018).
Evolutionary potential of transcription factors for gene regulatory rewiring.
Nature Ecology and Evolution. Nature Publishing Group. https://doi.org/10.1038/s41559-018-0651-y
chicago: Igler, Claudia, Mato Lagator, Gašper Tkačik, Jonathan P Bollback, and Calin
C Guet. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.”
Nature Ecology and Evolution. Nature Publishing Group, 2018. https://doi.org/10.1038/s41559-018-0651-y.
ieee: C. Igler, M. Lagator, G. Tkačik, J. P. Bollback, and C. C. Guet, “Evolutionary
potential of transcription factors for gene regulatory rewiring,” Nature Ecology
and Evolution, vol. 2, no. 10. Nature Publishing Group, pp. 1633–1643, 2018.
ista: Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. 2018. Evolutionary potential
of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution.
2(10), 1633–1643.
mla: Igler, Claudia, et al. “Evolutionary Potential of Transcription Factors for
Gene Regulatory Rewiring.” Nature Ecology and Evolution, vol. 2, no. 10,
Nature Publishing Group, 2018, pp. 1633–43, doi:10.1038/s41559-018-0651-y.
short: C. Igler, M. Lagator, G. Tkačik, J.P. Bollback, C.C. Guet, Nature Ecology
and Evolution 2 (2018) 1633–1643.
date_created: 2018-12-11T11:44:27Z
date_published: 2018-09-10T00:00:00Z
date_updated: 2024-03-25T23:30:27Z
day: '10'
ddc:
- '570'
department:
- _id: CaGu
- _id: GaTk
- _id: JoBo
doi: 10.1038/s41559-018-0651-y
ec_funded: 1
external_id:
isi:
- '000447947600021'
file:
- access_level: open_access
checksum: 383a2e2c944a856e2e821ec8e7bf71b6
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T11:28:52Z
date_updated: 2020-07-14T12:47:37Z
file_id: '7830'
file_name: 2018_NatureEcology_Igler.pdf
file_size: 1135973
relation: main_file
file_date_updated: 2020-07-14T12:47:37Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
issue: '10'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 1633 - 1643
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 2578D616-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '648440'
name: Selective Barriers to Horizontal Gene Transfer
- _id: 251EE76E-B435-11E9-9278-68D0E5697425
grant_number: '24573'
name: Design principles underlying genetic switch architecture (DOC Fellowship)
publication: Nature Ecology and Evolution
publication_status: published
publisher: Nature Publishing Group
publist_id: '7987'
quality_controlled: '1'
related_material:
record:
- id: '5585'
relation: popular_science
status: public
- id: '6371'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Evolutionary potential of transcription factors for gene regulatory rewiring
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2
year: '2018'
...
---
_id: '6728'
abstract:
- lang: eng
text: Polar codes are a channel coding scheme for the next generation of wireless
communications standard (5G). The belief propagation (BP) decoder allows for parallel
decoding of polar codes, making it suitable for high throughput applications.
However, the error-correction performance of polar codes under BP decoding is
far from the requirements of 5G. It has been shown that the error-correction performance
of BP can be improved if the decoding is performed on multiple permuted factor
graphs of polar codes. However, a different BP decoding scheduling is required
for each factor graph permutation which results in the design of a different decoder
for each permutation. Moreover, the selection of the different factor graph permutations
is at random, which prevents the decoder to achieve a desirable error correction
performance with a small number of permutations. In this paper, we first show
that the permutations on the factor graph can be mapped into suitable permutations
on the codeword positions. As a result, we can make use of a single decoder for
all the permutations. In addition, we introduce a method to construct a set of
predetermined permutations which can provide the correct codeword if the decoding
fails on the original permutation. We show that for the 5G polar code of length
1024, the error-correction performance of the proposed decoder is more than 0.25
dB better than that of the BP decoder with the same number of random permutations
at the frame error rate of 10 -4 .
arxiv: 1
author:
- first_name: Nghia
full_name: Doan, Nghia
last_name: Doan
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Warren J.
full_name: Gross, Warren J.
last_name: Gross
citation:
ama: 'Doan N, Hashemi SA, Mondelli M, Gross WJ. On the decoding of polar codes on
permuted factor graphs. In: 2018 IEEE Global Communications Conference .
IEEE; 2018. doi:10.1109/glocom.2018.8647308'
apa: 'Doan, N., Hashemi, S. A., Mondelli, M., & Gross, W. J. (2018). On the
decoding of polar codes on permuted factor graphs. In 2018 IEEE Global Communications
Conference . Abu Dhabi, United Arab Emirates: IEEE. https://doi.org/10.1109/glocom.2018.8647308'
chicago: Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “On
the Decoding of Polar Codes on Permuted Factor Graphs.” In 2018 IEEE Global
Communications Conference . IEEE, 2018. https://doi.org/10.1109/glocom.2018.8647308.
ieee: N. Doan, S. A. Hashemi, M. Mondelli, and W. J. Gross, “On the decoding of
polar codes on permuted factor graphs,” in 2018 IEEE Global Communications
Conference , Abu Dhabi, United Arab Emirates, 2018.
ista: 'Doan N, Hashemi SA, Mondelli M, Gross WJ. 2018. On the decoding of polar
codes on permuted factor graphs. 2018 IEEE Global Communications Conference .
GLOBECOM: Global Communications Conference.'
mla: Doan, Nghia, et al. “On the Decoding of Polar Codes on Permuted Factor Graphs.”
2018 IEEE Global Communications Conference , IEEE, 2018, doi:10.1109/glocom.2018.8647308.
short: N. Doan, S.A. Hashemi, M. Mondelli, W.J. Gross, in:, 2018 IEEE Global Communications
Conference , IEEE, 2018.
conference:
end_date: 2018-12-13
location: Abu Dhabi, United Arab Emirates
name: 'GLOBECOM: Global Communications Conference'
start_date: 2018-12-09
date_created: 2019-07-30T06:43:15Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2021-01-12T08:08:42Z
day: '01'
doi: 10.1109/glocom.2018.8647308
extern: '1'
external_id:
arxiv:
- '1806.11195'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.11195
month: '12'
oa: 1
oa_version: Preprint
publication: '2018 IEEE Global Communications Conference '
publication_identifier:
isbn:
- '9781538647271'
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: On the decoding of polar codes on permuted factor graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6774'
abstract:
- lang: eng
text: "A central problem of algebraic topology is to understand the homotopy groups
\ \U0001D70B\U0001D451(\U0001D44B) of a topological space X. For the computational
version of the problem, it is well known that there is no algorithm to decide
whether the fundamental group \U0001D70B1(\U0001D44B) of a given finite simplicial
complex X is trivial. On the other hand, there are several algorithms that, given
a finite simplicial complex X that is simply connected (i.e., with \U0001D70B1(\U0001D44B)
\ trivial), compute the higher homotopy group \U0001D70B\U0001D451(\U0001D44B)
\ for any given \U0001D451≥2 . However, these algorithms come with a caveat:
They compute the isomorphism type of \U0001D70B\U0001D451(\U0001D44B) , \U0001D451≥2
\ as an abstract finitely generated abelian group given by generators and relations,
but they work with very implicit representations of the elements of \U0001D70B\U0001D451(\U0001D44B)
. Converting elements of this abstract group into explicit geometric maps from
the d-dimensional sphere \U0001D446\U0001D451 to X has been one of the main
unsolved problems in the emerging field of computational homotopy theory. Here
we present an algorithm that, given a simply connected space X, computes \U0001D70B\U0001D451(\U0001D44B)
\ and represents its elements as simplicial maps from a suitable triangulation
of the d-sphere \U0001D446\U0001D451 to X. For fixed d, the algorithm runs
in time exponential in size(\U0001D44B) , the number of simplices of X. Moreover,
we prove that this is optimal: For every fixed \U0001D451≥2 , we construct a
family of simply connected spaces X such that for any simplicial map representing
a generator of \U0001D70B\U0001D451(\U0001D44B) , the size of the triangulation
of \U0001D446\U0001D451 on which the map is defined, is exponential in size(\U0001D44B)
."
article_type: original
author:
- first_name: Marek
full_name: Filakovský, Marek
id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
last_name: Filakovský
- first_name: Peter
full_name: Franek, Peter
id: 473294AE-F248-11E8-B48F-1D18A9856A87
last_name: Franek
orcid: 0000-0001-8878-8397
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Stephan Y
full_name: Zhechev, Stephan Y
id: 3AA52972-F248-11E8-B48F-1D18A9856A87
last_name: Zhechev
citation:
ama: Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives
of homotopy group elements. Journal of Applied and Computational Topology.
2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5
apa: Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing
simplicial representatives of homotopy group elements. Journal of Applied and
Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5
chicago: Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing
Simplicial Representatives of Homotopy Group Elements.” Journal of Applied
and Computational Topology. Springer, 2018. https://doi.org/10.1007/s41468-018-0021-5.
ieee: M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial
representatives of homotopy group elements,” Journal of Applied and Computational
Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.
ista: Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives
of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4),
177–231.
mla: Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy
Group Elements.” Journal of Applied and Computational Topology, vol. 2,
no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.
short: M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and
Computational Topology 2 (2018) 177–231.
date_created: 2019-08-08T06:47:40Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-09-07T13:10:36Z
day: '01'
ddc:
- '514'
department:
- _id: UlWa
doi: 10.1007/s41468-018-0021-5
file:
- access_level: open_access
checksum: cf9e7fcd2a113dd4828774fc75cdb7e8
content_type: application/pdf
creator: dernst
date_created: 2019-08-08T06:55:21Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6775'
file_name: 2018_JourAppliedComputTopology_Filakovsky.pdf
file_size: 1056278
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 2'
issue: 3-4
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 177-231
project:
- _id: 25F8B9BC-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M01980
name: Robust invariants of Nonlinear Systems
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
publication: Journal of Applied and Computational Topology
publication_identifier:
eissn:
- 2367-1734
issn:
- 2367-1726
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '6681'
relation: dissertation_contains
status: public
status: public
title: Computing simplicial representatives of homotopy group elements
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: 2
year: '2018'
...
---
_id: '68'
abstract:
- lang: eng
text: The most common assumption made in statistical learning theory is the assumption
of the independent and identically distributed (i.i.d.) data. While being very
convenient mathematically, it is often very clearly violated in practice. This
disparity between the machine learning theory and applications underlies a growing
demand in the development of algorithms that learn from dependent data and theory
that can provide generalization guarantees similar to the independent situations.
This thesis is dedicated to two variants of dependencies that can arise in practice.
One is a dependence on the level of samples in a single learning task. Another
dependency type arises in the multi-task setting when the tasks are dependent
on each other even though the data for them can be i.i.d. In both cases we model
the data (samples or tasks) as stochastic processes and introduce new algorithms
for both settings that take into account and exploit the resulting dependencies.
We prove the theoretical guarantees on the performance of the introduced algorithms
under different evaluation criteria and, in addition, we compliment the theoretical
study by the empirical one, where we evaluate some of the algorithms on two real
world datasets to highlight their practical applicability.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Alexander
full_name: Zimin, Alexander
id: 37099E9C-F248-11E8-B48F-1D18A9856A87
last_name: Zimin
citation:
ama: Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048
apa: Zimin, A. (2018). Learning from dependent data. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048
chicago: Zimin, Alexander. “Learning from Dependent Data.” Institute of Science
and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048.
ieee: A. Zimin, “Learning from dependent data,” Institute of Science and Technology
Austria, 2018.
ista: Zimin A. 2018. Learning from dependent data. Institute of Science and Technology
Austria.
mla: Zimin, Alexander. Learning from Dependent Data. Institute of Science
and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048.
short: A. Zimin, Learning from Dependent Data, Institute of Science and Technology
Austria, 2018.
date_created: 2018-12-11T11:44:27Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-07T12:29:07Z
day: '01'
ddc:
- '004'
- '519'
degree_awarded: PhD
department:
- _id: ChLa
doi: 10.15479/AT:ISTA:TH1048
ec_funded: 1
file:
- access_level: open_access
checksum: e849dd40a915e4d6c5572b51b517f098
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:32:47Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6253'
file_name: 2018_Thesis_Zimin.pdf
file_size: 1036137
relation: main_file
- access_level: closed
checksum: da092153cec55c97461bd53c45c5d139
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:32:47Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6254'
file_name: 2018_Thesis_Zimin_Source.zip
file_size: 637490
relation: source_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '92'
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7986'
pubrep_id: '1048'
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
title: Learning from dependent data
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '69'
abstract:
- lang: eng
text: 'A qubit, a unit of quantum information, is essentially any quantum mechanical
two-level system which can be coherently controlled. Still, to be used for computation,
it has to fulfill criteria. Qubits, regardless of the system in which they are
realized, suffer from decoherence. This leads to loss of the information stored
in the qubit. The upper bound of the time scale on which decoherence happens is
set by the spin relaxation time. In this thesis I studied a two-level system consisting
of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire.
Such Ge hut wires have emerged as a promising material system for the realization
of spin qubits, due to the combination of two significant properties: long spin
coherence time as expected for group IV semiconductors due to the low hyperfine
interaction and a strong valence band spin-orbit coupling. Here, I present how
to fabricate quantum dot devices suitable for electrical transport measurements.
Coupled quantum dot devices allowed the realization of a charge sensor, which
is electrostatically and tunnel coupled to a quantum dot. By integrating the charge
sensor into a radio-frequency reflectometry setup, I performed for the first time
single-shot readout measurements of hole spins and extracted the hole spin relaxation
times in Ge hut wires.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lada
full_name: Vukušić, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukušić
orcid: 0000-0003-2424-8636
citation:
ama: Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires.
2018. doi:10.15479/AT:ISTA:TH_1047
apa: Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in
Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047
chicago: Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge
Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047.
ieee: L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,”
Institute of Science and Technology Austria, 2018.
ista: Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut
wires. Institute of Science and Technology Austria.
mla: Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut
Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.
short: L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires,
Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:44:28Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-26T15:50:22Z
day: '01'
ddc:
- '530'
- '600'
degree_awarded: PhD
department:
- _id: GeKa
- _id: GradSch
doi: 10.15479/AT:ISTA:TH_1047
file:
- access_level: open_access
checksum: c570b656e30749cd65b1c7e13a9ce0a8
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:00:40Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6247'
file_name: 2018_Thesis_Vukusic.pdf
file_size: 28452385
relation: main_file
- access_level: closed
checksum: 7856771d9cd401fe0b311191076db6e1
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:00:40Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6248'
file_name: 2018_Thesis_Vukusic_source.zip
file_size: 53058704
relation: source_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '103'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7985'
pubrep_id: '1047'
related_material:
record:
- id: '23'
relation: part_of_dissertation
status: public
- id: '840'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Charge sensing and spin relaxation times of holes in Ge hut wires
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '690'
abstract:
- lang: eng
text: We consider spectral properties and the edge universality of sparse random
matrices, the class of random matrices that includes the adjacency matrices of
the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density
up to the spectral edges. Under a suitable condition on the sparsity, we also
prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations
if a deterministic shift of the spectral edge due to the sparsity is included.
For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom
fluctuations of the second largest eigenvalue when p is much larger than N−2/3
with a deterministic shift of order (Np)−1.
article_number: 543-616
arxiv: 1
author:
- first_name: Jii
full_name: Lee, Jii
last_name: Lee
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices.
Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8
apa: Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse
random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8
chicago: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse
Random Matrices.” Probability Theory and Related Fields. Springer, 2018.
https://doi.org/10.1007/s00440-017-0787-8.
ieee: J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random
matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer,
2018.
ista: Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random
matrices. Probability Theory and Related Fields. 171(1–2), 543–616.
mla: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random
Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616,
Springer, 2018, doi:10.1007/s00440-017-0787-8.
short: J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).
date_created: 2018-12-11T11:47:56Z
date_published: 2018-06-14T00:00:00Z
date_updated: 2021-01-12T08:09:33Z
day: '14'
department:
- _id: LaEr
doi: 10.1007/s00440-017-0787-8
ec_funded: 1
external_id:
arxiv:
- '1605.08767'
intvolume: ' 171'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.08767
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Probability Theory and Related Fields
publication_status: published
publisher: Springer
publist_id: '7017'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local law and Tracy–Widom limit for sparse random matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 171
year: '2018'
...
---
_id: '691'
abstract:
- lang: eng
text: "Background: Transport protein particle (TRAPP) is a multisubunit complex
that regulates membrane trafficking through the Golgi apparatus. The clinical
phenotype associated with mutations in various TRAPP subunits has allowed elucidation
of their functions in specific tissues. The role of some subunits in human disease,
however, has not been fully established, and their functions remain uncertain.\r\n\r\nObjective:
We aimed to expand the range of neurodevelopmental disorders associated with mutations
in TRAPP subunits by exome sequencing of consanguineous families.\r\n\r\nMethods:
Linkage and homozygosity mapping and candidate gene analysis were used to identify
homozygous mutations in families. Patient fibroblasts were used to study splicing
defect and zebrafish to model the disease.\r\n\r\nResults: We identified six individuals
from three unrelated families with a founder homozygous splice mutation in TRAPPC6B,
encoding a core subunit of the complex TRAPP I. Patients manifested a neurodevelopmental
disorder characterised by microcephaly, epilepsy and autistic features, and showed
splicing defect. Zebrafish trappc6b morphants replicated the human phenotype,
displaying decreased head size and neuronal hyperexcitability, leading to a lower
seizure threshold.\r\n\r\nConclusion: This study provides clinical and functional
evidence of the role of TRAPPC6B in brain development and function."
article_processing_charge: No
article_type: original
author:
- first_name: Isaac
full_name: Marin Valencia, Isaac
last_name: Marin Valencia
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Anide
full_name: Johansen, Anide
last_name: Johansen
- first_name: Başak
full_name: Rosti, Başak
last_name: Rosti
- first_name: Mahmoud
full_name: Issa, Mahmoud
last_name: Issa
- first_name: Damir
full_name: Musaev, Damir
last_name: Musaev
- first_name: Gifty
full_name: Bhat, Gifty
last_name: Bhat
- first_name: Eric
full_name: Scott, Eric
last_name: Scott
- first_name: Jennifer
full_name: Silhavy, Jennifer
last_name: Silhavy
- first_name: Valentina
full_name: Stanley, Valentina
last_name: Stanley
- first_name: Rasim
full_name: Rosti, Rasim
last_name: Rosti
- first_name: Jeremy
full_name: Gleeson, Jeremy
last_name: Gleeson
- first_name: Farhad
full_name: Imam, Farhad
last_name: Imam
- first_name: Maha
full_name: Zaki, Maha
last_name: Zaki
- first_name: Joseph
full_name: Gleeson, Joseph
last_name: Gleeson
citation:
ama: Marin Valencia I, Novarino G, Johansen A, et al. A homozygous founder mutation
in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly
epilepsy and autistic features. Journal of Medical Genetics. 2018;55(1):48-54.
doi:10.1136/jmedgenet-2017-104627
apa: Marin Valencia, I., Novarino, G., Johansen, A., Rosti, B., Issa, M., Musaev,
D., … Gleeson, J. (2018). A homozygous founder mutation in TRAPPC6B associates
with a neurodevelopmental disorder characterised by microcephaly epilepsy and
autistic features. Journal of Medical Genetics. BMJ Publishing Group. https://doi.org/10.1136/jmedgenet-2017-104627
chicago: Marin Valencia, Isaac, Gaia Novarino, Anide Johansen, Başak Rosti, Mahmoud
Issa, Damir Musaev, Gifty Bhat, et al. “A Homozygous Founder Mutation in TRAPPC6B
Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy
and Autistic Features.” Journal of Medical Genetics. BMJ Publishing Group,
2018. https://doi.org/10.1136/jmedgenet-2017-104627.
ieee: I. Marin Valencia et al., “A homozygous founder mutation in TRAPPC6B
associates with a neurodevelopmental disorder characterised by microcephaly epilepsy
and autistic features,” Journal of Medical Genetics, vol. 55, no. 1. BMJ
Publishing Group, pp. 48–54, 2018.
ista: Marin Valencia I, Novarino G, Johansen A, Rosti B, Issa M, Musaev D, Bhat
G, Scott E, Silhavy J, Stanley V, Rosti R, Gleeson J, Imam F, Zaki M, Gleeson
J. 2018. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental
disorder characterised by microcephaly epilepsy and autistic features. Journal
of Medical Genetics. 55(1), 48–54.
mla: Marin Valencia, Isaac, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates
with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and
Autistic Features.” Journal of Medical Genetics, vol. 55, no. 1, BMJ Publishing
Group, 2018, pp. 48–54, doi:10.1136/jmedgenet-2017-104627.
short: I. Marin Valencia, G. Novarino, A. Johansen, B. Rosti, M. Issa, D. Musaev,
G. Bhat, E. Scott, J. Silhavy, V. Stanley, R. Rosti, J. Gleeson, F. Imam, M. Zaki,
J. Gleeson, Journal of Medical Genetics 55 (2018) 48–54.
date_created: 2018-12-11T11:47:57Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2023-10-16T09:55:43Z
day: '01'
department:
- _id: GaNo
doi: 10.1136/jmedgenet-2017-104627
external_id:
isi:
- '000418199800007'
pmid:
- '28626029'
intvolume: ' 55'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6056005/
month: '01'
oa: 1
oa_version: Submitted Version
page: 48 - 54
pmid: 1
project:
- _id: 254BA948-B435-11E9-9278-68D0E5697425
grant_number: '401299'
name: Probing development and reversibility of autism spectrum disorders
publication: Journal of Medical Genetics
publication_identifier:
issn:
- 0022-2593
publication_status: published
publisher: BMJ Publishing Group
publist_id: '7016'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental
disorder characterised by microcephaly epilepsy and autistic features
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2018'
...
---
_id: '692'
abstract:
- lang: eng
text: We consider families of confocal conics and two pencils of Apollonian circles
having the same foci. We will show that these families of curves generate trivial
3-webs and find the exact formulas describing them.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
citation:
ama: Akopyan A. 3-Webs generated by confocal conics and circles. Geometriae Dedicata.
2018;194(1):55-64. doi:10.1007/s10711-017-0265-6
apa: Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. Geometriae
Dedicata. Springer. https://doi.org/10.1007/s10711-017-0265-6
chicago: Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae
Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0265-6.
ieee: A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae
Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018.
ista: Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae
Dedicata. 194(1), 55–64.
mla: Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae
Dedicata, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:10.1007/s10711-017-0265-6.
short: A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.
date_created: 2018-12-11T11:47:57Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-08T11:40:29Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s10711-017-0265-6
ec_funded: 1
external_id:
isi:
- '000431418800004'
file:
- access_level: open_access
checksum: 1febcfc1266486053a069e3425ea3713
content_type: application/pdf
creator: kschuh
date_created: 2020-01-03T11:35:08Z
date_updated: 2020-07-14T12:47:44Z
file_id: '7222'
file_name: 2018_Springer_Akopyan.pdf
file_size: 1140860
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 194'
isi: 1
issue: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 55 - 64
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Geometriae Dedicata
publication_status: published
publisher: Springer
publist_id: '7014'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 3-Webs generated by confocal conics and circles
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 194
year: '2018'
...
---
_id: '6941'
abstract:
- lang: eng
text: "Bitcoin has become the most successful cryptocurrency ever deployed, and
its most distinctive feature is that it is decentralized. Its underlying protocol
(Nakamoto consensus) achieves this by using proof of work, which has the drawback
that it causes the consumption of vast amounts of energy to maintain the ledger.
Moreover, Bitcoin mining dynamics have become less distributed over time.\r\n\r\nTowards
addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs
of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather
than computation. We argue that SpaceMint’s design solves or alleviates several
of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also
rewards smaller miners fairly according to their contribution to the network,
thus incentivizing more distributed participation.\r\n\r\nThis paper adapts proof
of space to enable its use in cryptocurrency, studies the attacks that can arise
against a Bitcoin-like blockchain that uses proof of space, and proposes a new
blockchain format and transaction types to address these attacks. Our prototype
shows that initializing 1 TB for mining takes about a day (a one-off setup cost),
and miners spend on average just a fraction of a second per block mined. Finally,
we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the
canonical game-theoretic notion for games that take place over time) and show
that this stylized game satisfies a strong equilibrium notion, thereby arguing
for SpaceMint ’s stability and consensus."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sunoo
full_name: Park, Sunoo
last_name: Park
- first_name: Albert
full_name: Kwon, Albert
last_name: Kwon
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A
cryptocurrency based on proofs of space. In: 22nd International Conference
on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499.
doi:10.1007/978-3-662-58387-6_26'
apa: 'Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., & Pietrzak,
K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd
International Conference on Financial Cryptography and Data Security (Vol.
10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. https://doi.org/10.1007/978-3-662-58387-6_26'
chicago: 'Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen,
and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.”
In 22nd International Conference on Financial Cryptography and Data Security,
10957:480–99. Springer Nature, 2018. https://doi.org/10.1007/978-3-662-58387-6_26.'
ieee: 'S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak,
“SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International
Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao,
2018, vol. 10957, pp. 480–499.'
ista: 'Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint:
A cryptocurrency based on proofs of space. 22nd International Conference on Financial
Cryptography and Data Security. FC: Financial Cryptography and Data Security,
LNCS, vol. 10957, 480–499.'
mla: 'Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.”
22nd International Conference on Financial Cryptography and Data Security,
vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.'
short: S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:,
22nd International Conference on Financial Cryptography and Data Security, Springer
Nature, 2018, pp. 480–499.
conference:
end_date: 2018-03-02
location: Nieuwpoort, Curacao
name: 'FC: Financial Cryptography and Data Security'
start_date: 2018-02-26
date_created: 2019-10-14T06:35:38Z
date_published: 2018-12-07T00:00:00Z
date_updated: 2023-09-19T15:02:13Z
day: '07'
department:
- _id: KrPi
doi: 10.1007/978-3-662-58387-6_26
ec_funded: 1
external_id:
isi:
- '000540656400026'
intvolume: ' 10957'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2015/528
month: '12'
oa: 1
oa_version: Submitted Version
page: 480-499
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 22nd International Conference on Financial Cryptography and Data Security
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783662583869'
- '9783662583876'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SpaceMint: A cryptocurrency based on proofs of space'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10957
year: '2018'
...
---
_id: '7'
abstract:
- lang: eng
text: Animal social networks are shaped by multiple selection pressures, including
the need to ensure efficient communication and functioning while simultaneously
limiting disease transmission. Social animals could potentially further reduce
epidemic risk by altering their social networks in the presence of pathogens,
yet there is currently no evidence for such pathogen-triggered responses. We tested
this hypothesis experimentally in the ant Lasius niger using a combination of
automated tracking, controlled pathogen exposure, transmission quantification,
and temporally explicit simulations. Pathogen exposure induced behavioral changes
in both exposed ants and their nestmates, which helped contain the disease by
reinforcing key transmission-inhibitory properties of the colony's contact network.
This suggests that social network plasticity in response to pathogens is an effective
strategy for mitigating the effects of disease in social groups.
acknowledgement: This project was funded by two European Research Council Advanced
Grants (Social Life, 249375, and resiliANT, 741491) and two Swiss National Science
Foundation grants (CR32I3_141063 and 310030_156732) to L.K. and a European Research
Council Starting Grant (SocialVaccines, 243071) to S.C.
article_processing_charge: No
article_type: original
author:
- first_name: Nathalie
full_name: Stroeymeyt, Nathalie
last_name: Stroeymeyt
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Alessandro
full_name: Crespi, Alessandro
last_name: Crespi
- first_name: Danielle
full_name: Mersch, Danielle
last_name: Mersch
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Laurent
full_name: Keller, Laurent
last_name: Keller
citation:
ama: Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network
plasticity decreases disease transmission in a eusocial insect. Science.
2018;362(6417):941-945. doi:10.1126/science.aat4793
apa: Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller,
L. (2018). Social network plasticity decreases disease transmission in a eusocial
insect. Science. AAAS. https://doi.org/10.1126/science.aat4793
chicago: Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch,
Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease
Transmission in a Eusocial Insect.” Science. AAAS, 2018. https://doi.org/10.1126/science.aat4793.
ieee: N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller,
“Social network plasticity decreases disease transmission in a eusocial insect,”
Science, vol. 362, no. 6417. AAAS, pp. 941–945, 2018.
ista: Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social
network plasticity decreases disease transmission in a eusocial insect. Science.
362(6417), 941–945.
mla: Stroeymeyt, Nathalie, et al. “Social Network Plasticity Decreases Disease Transmission
in a Eusocial Insect.” Science, vol. 362, no. 6417, AAAS, 2018, pp. 941–45,
doi:10.1126/science.aat4793.
short: N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, Science
362 (2018) 941–945.
date_created: 2018-12-11T11:44:07Z
date_published: 2018-11-23T00:00:00Z
date_updated: 2023-10-17T11:50:05Z
day: '23'
department:
- _id: SyCr
doi: 10.1126/science.aat4793
ec_funded: 1
external_id:
isi:
- '000451124500041'
intvolume: ' 362'
isi: 1
issue: '6417'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://serval.unil.ch/resource/serval:BIB_E9228C205467.P001/REF.pdf
month: '11'
oa: 1
oa_version: Published Version
page: 941 - 945
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: Science
publication_identifier:
issn:
- 1095-9203
publication_status: published
publisher: AAAS
publist_id: '8049'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/for-ants-unity-is-strength-and-health/
record:
- id: '13055'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Social network plasticity decreases disease transmission in a eusocial insect
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 362
year: '2018'
...
---
_id: '70'
abstract:
- lang: eng
text: We consider the totally asymmetric simple exclusion process in a critical
scaling parametrized by a≥0, which creates a shock in the particle density of
order aT−1/3, T the observation time. When starting from step initial data, we
provide bounds on the limiting law which in particular imply that in the double
limit lima→∞limT→∞ one recovers the product limit law and the degeneration of
the correlation length observed at shocks of order 1. This result is shown to
apply to a general last-passage percolation model. We also obtain bounds on the
two-point functions of several airy processes.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Peter
full_name: Nejjar, Peter
id: 4BF426E2-F248-11E8-B48F-1D18A9856A87
last_name: Nejjar
citation:
ama: Nejjar P. Transition to shocks in TASEP and decoupling of last passage times.
Latin American Journal of Probability and Mathematical Statistics. 2018;15(2):1311-1334.
doi:10.30757/ALEA.v15-49
apa: Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage
times. Latin American Journal of Probability and Mathematical Statistics.
Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v15-49
chicago: Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage
Times.” Latin American Journal of Probability and Mathematical Statistics.
Instituto Nacional de Matematica Pura e Aplicada, 2018. https://doi.org/10.30757/ALEA.v15-49.
ieee: P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,”
Latin American Journal of Probability and Mathematical Statistics, vol.
15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018.
ista: Nejjar P. 2018. Transition to shocks in TASEP and decoupling of last passage
times. Latin American Journal of Probability and Mathematical Statistics. 15(2),
1311–1334.
mla: Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage
Times.” Latin American Journal of Probability and Mathematical Statistics,
vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34,
doi:10.30757/ALEA.v15-49.
short: P. Nejjar, Latin American Journal of Probability and Mathematical Statistics
15 (2018) 1311–1334.
date_created: 2018-12-11T11:44:28Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2023-10-10T13:11:29Z
day: '01'
ddc:
- '510'
department:
- _id: LaEr
- _id: JaMa
doi: 10.30757/ALEA.v15-49
ec_funded: 1
external_id:
arxiv:
- '1705.08836'
isi:
- '000460475800022'
file:
- access_level: open_access
checksum: 2ded46aa284a836a8cbb34133a64f1cb
content_type: application/pdf
creator: kschuh
date_created: 2019-02-14T09:44:10Z
date_updated: 2020-07-14T12:47:46Z
file_id: '5981'
file_name: 2018_ALEA_Nejjar.pdf
file_size: 394851
relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 1311-1334
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication: Latin American Journal of Probability and Mathematical Statistics
publication_identifier:
issn:
- 1980-0436
publication_status: published
publisher: Instituto Nacional de Matematica Pura e Aplicada
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transition to shocks in TASEP and decoupling of last passage times
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2018'
...
---
_id: '703'
abstract:
- lang: eng
text: We consider the NP-hard problem of MAP-inference for undirected discrete graphical
models. We propose a polynomial time and practically efficient algorithm for finding
a part of its optimal solution. Specifically, our algorithm marks some labels
of the considered graphical model either as (i) optimal, meaning that they belong
to all optimal solutions of the inference problem; (ii) non-optimal if they provably
do not belong to any solution. With access to an exact solver of a linear programming
relaxation to the MAP-inference problem, our algorithm marks the maximal possible
(in a specified sense) number of labels. We also present a version of the algorithm,
which has access to a suboptimal dual solver only and still can ensure the (non-)optimality
for the marked labels, although the overall number of the marked labels may decrease.
We propose an efficient implementation, which runs in time comparable to a single
run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art
results on computational benchmarks from machine learning and computer vision.
arxiv: 1
author:
- first_name: Alexander
full_name: Shekhovtsov, Alexander
last_name: Shekhovtsov
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884
apa: Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency
via iterative relaxed inference with graphical models. IEEE Transactions on
Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884
chicago: Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum
Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions
on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884.
ieee: A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative
relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis
and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.
ista: Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 40(7), 1668–1682.
mla: Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference
with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
short: A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern
Analysis and Machine Intelligence 40 (2018) 1668–1682.
date_created: 2018-12-11T11:48:01Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2021-01-12T08:11:32Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/TPAMI.2017.2730884
external_id:
arxiv:
- '1508.07902'
intvolume: ' 40'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.07902
month: '07'
oa: 1
oa_version: Preprint
page: 1668-1682
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
issn:
- '01628828'
publication_status: published
publisher: IEEE
publist_id: '6992'
quality_controlled: '1'
scopus_import: 1
status: public
title: Maximum persistency via iterative relaxed inference with graphical models
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2018'
...
---
_id: '705'
abstract:
- lang: eng
text: Although dopamine receptors D1 and D2 play key roles in hippocampal function,
their synaptic localization within the hippocampus has not been fully elucidated.
In order to understand precise functions of pre- or postsynaptic dopamine receptors
(DRs), the development of protocols to differentiate pre- and postsynaptic DRs
is essential. So far, most studies on determination and quantification of DRs
did not discriminate between subsynaptic localization. Therefore, the aim of the
study was to generate a robust workflow for the localization of DRs. This work
provides the basis for future work on hippocampal DRs, in light that DRs may have
different functions at pre- or postsynaptic sites. Synaptosomes from rat hippocampi
isolated by a sucrose gradient protocol were prepared for super-resolution direct
stochastic optical reconstruction microscopy (dSTORM) using Bassoon as a presynaptic
zone and Homer1 as postsynaptic density marker. Direct labeling of primary validated
antibodies against dopamine receptors D1 (D1R) and D2 (D2R) with Alexa Fluor 594
enabled unequivocal assignment of D1R and D2R to both, pre- and postsynaptic sites.
D1R immunoreactivity clusters were observed within the presynaptic active zone
as well as at perisynaptic sites at the edge of the presynaptic active zone. The
results may be useful for the interpretation of previous studies and the design
of future work on DRs in the hippocampus. Moreover, the reduction of the complexity
of brain tissue by the use of synaptosomal preparations and dSTORM technology
may represent a useful tool for synaptic localization of brain proteins.
article_processing_charge: No
author:
- first_name: Andras
full_name: Miklosi, Andras
last_name: Miklosi
- first_name: Giorgia
full_name: Del Favero, Giorgia
last_name: Del Favero
- first_name: Tanja
full_name: Bulat, Tanja
last_name: Bulat
- first_name: Harald
full_name: Höger, Harald
last_name: Höger
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Doris
full_name: Marko, Doris
last_name: Marko
- first_name: Gert
full_name: Lubec, Gert
last_name: Lubec
citation:
ama: Miklosi A, Del Favero G, Bulat T, et al. Super resolution microscopical localization
of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology.
2018;55(6):4857 – 4869. doi:10.1007/s12035-017-0688-y
apa: Miklosi, A., Del Favero, G., Bulat, T., Höger, H., Shigemoto, R., Marko, D.,
& Lubec, G. (2018). Super resolution microscopical localization of dopamine
receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology.
Springer. https://doi.org/10.1007/s12035-017-0688-y
chicago: Miklosi, Andras, Giorgia Del Favero, Tanja Bulat, Harald Höger, Ryuichi
Shigemoto, Doris Marko, and Gert Lubec. “Super Resolution Microscopical Localization
of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology.
Springer, 2018. https://doi.org/10.1007/s12035-017-0688-y.
ieee: A. Miklosi et al., “Super resolution microscopical localization of
dopamine receptors 1 and 2 in rat hippocampal synaptosomes,” Molecular Neurobiology,
vol. 55, no. 6. Springer, pp. 4857 – 4869, 2018.
ista: Miklosi A, Del Favero G, Bulat T, Höger H, Shigemoto R, Marko D, Lubec G.
2018. Super resolution microscopical localization of dopamine receptors 1 and
2 in rat hippocampal synaptosomes. Molecular Neurobiology. 55(6), 4857 – 4869.
mla: Miklosi, Andras, et al. “Super Resolution Microscopical Localization of Dopamine
Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology,
vol. 55, no. 6, Springer, 2018, pp. 4857 – 4869, doi:10.1007/s12035-017-0688-y.
short: A. Miklosi, G. Del Favero, T. Bulat, H. Höger, R. Shigemoto, D. Marko, G.
Lubec, Molecular Neurobiology 55 (2018) 4857 – 4869.
date_created: 2018-12-11T11:48:02Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-19T09:58:11Z
day: '01'
department:
- _id: RySh
doi: 10.1007/s12035-017-0688-y
external_id:
isi:
- '000431991500025'
intvolume: ' 55'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 4857 – 4869
publication: Molecular Neurobiology
publication_status: published
publisher: Springer
publist_id: '6991'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Super resolution microscopical localization of dopamine receptors 1 and 2 in
rat hippocampal synaptosomes
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 55
year: '2018'
...
---
_id: '7058'
abstract:
- lang: eng
text: We examine recent magnetic torque measurements in two compounds, γ−Li2IrO3
and RuCl3, which have been discussed as possible realizations of the Kitaev model.
The analysis of the reported discontinuity in torque, as an external magnetic
field is rotated across the c axis in both crystals, suggests that they have a
translationally invariant chiral spin order of the form ⟨Si⋅(Sj×Sk)⟩≠0 in the
ground state and persisting over a very wide range of magnetic field and temperature.
An extraordinary |B|B2 dependence of the torque for small fields, beside the usual
B2 part, is predicted by the chiral spin order. Data for small fields are available
for γ−Li2IrO3 and are found to be consistent with the prediction upon further
analysis. Other experiments such as inelastic scattering and thermal Hall effect
and several questions raised by the discovery of chiral spin order, including
its topological consequences, are discussed.
article_number: '205110 '
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: B. J.
full_name: Ramshaw, B. J.
last_name: Ramshaw
- first_name: A.
full_name: Shekhter, A.
last_name: Shekhter
- first_name: C. M.
full_name: Varma, C. M.
last_name: Varma
citation:
ama: Modic KA, Ramshaw BJ, Shekhter A, Varma CM. Chiral spin order in some purported
Kitaev spin-liquid compounds. Physical Review B. 2018;98(20). doi:10.1103/physrevb.98.205110
apa: Modic, K. A., Ramshaw, B. J., Shekhter, A., & Varma, C. M. (2018). Chiral
spin order in some purported Kitaev spin-liquid compounds. Physical Review
B. APS. https://doi.org/10.1103/physrevb.98.205110
chicago: Modic, Kimberly A, B. J. Ramshaw, A. Shekhter, and C. M. Varma. “Chiral
Spin Order in Some Purported Kitaev Spin-Liquid Compounds.” Physical Review
B. APS, 2018. https://doi.org/10.1103/physrevb.98.205110.
ieee: K. A. Modic, B. J. Ramshaw, A. Shekhter, and C. M. Varma, “Chiral spin order
in some purported Kitaev spin-liquid compounds,” Physical Review B, vol.
98, no. 20. APS, 2018.
ista: Modic KA, Ramshaw BJ, Shekhter A, Varma CM. 2018. Chiral spin order in some
purported Kitaev spin-liquid compounds. Physical Review B. 98(20), 205110.
mla: Modic, Kimberly A., et al. “Chiral Spin Order in Some Purported Kitaev Spin-Liquid
Compounds.” Physical Review B, vol. 98, no. 20, 205110, APS, 2018, doi:10.1103/physrevb.98.205110.
short: K.A. Modic, B.J. Ramshaw, A. Shekhter, C.M. Varma, Physical Review B 98 (2018).
date_created: 2019-11-19T13:01:31Z
date_published: 2018-11-05T00:00:00Z
date_updated: 2021-01-12T08:11:36Z
day: '05'
doi: 10.1103/physrevb.98.205110
extern: '1'
external_id:
arxiv:
- '1807.06637'
intvolume: ' 98'
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1807.06637
month: '11'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: APS
quality_controlled: '1'
status: public
title: Chiral spin order in some purported Kitaev spin-liquid compounds
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 98
year: '2018'
...
---
_id: '7059'
abstract:
- lang: eng
text: Unusual behavior in quantum materials commonly arises from their effective
low-dimensional physics, reflecting the underlying anisotropy in the spin and
charge degrees of freedom. Here we introduce the magnetotropic coefficient k = ∂2F/∂θ2,
the second derivative of the free energy F with respect to the magnetic field
orientation θ in the crystal. We show that the magnetotropic coefficient can be
quantitatively determined from a shift in the resonant frequency of a commercially
available atomic force microscopy cantilever under magnetic field. This detection
method enables part per 100 million sensitivity and the ability to measure magnetic
anisotropy in nanogram-scale samples, as demonstrated on the Weyl semimetal NbP.
Measurement of the magnetotropic coefficient in the spin-liquid candidate RuCl3
highlights its sensitivity to anisotropic phase transitions and allows a quantitative
comparison to other thermodynamic coefficients via the Ehrenfest relations.
article_processing_charge: No
article_type: original
author:
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Maja D.
full_name: Bachmann, Maja D.
last_name: Bachmann
- first_name: B. J.
full_name: Ramshaw, B. J.
last_name: Ramshaw
- first_name: F.
full_name: Arnold, F.
last_name: Arnold
- first_name: K. R.
full_name: Shirer, K. R.
last_name: Shirer
- first_name: Amelia
full_name: Estry, Amelia
last_name: Estry
- first_name: J. B.
full_name: Betts, J. B.
last_name: Betts
- first_name: Nirmal J.
full_name: Ghimire, Nirmal J.
last_name: Ghimire
- first_name: E. D.
full_name: Bauer, E. D.
last_name: Bauer
- first_name: Marcus
full_name: Schmidt, Marcus
last_name: Schmidt
- first_name: Michael
full_name: Baenitz, Michael
last_name: Baenitz
- first_name: E.
full_name: Svanidze, E.
last_name: Svanidze
- first_name: Ross D.
full_name: McDonald, Ross D.
last_name: McDonald
- first_name: Arkady
full_name: Shekhter, Arkady
last_name: Shekhter
- first_name: Philip J. W.
full_name: Moll, Philip J. W.
last_name: Moll
citation:
ama: Modic KA, Bachmann MD, Ramshaw BJ, et al. Resonant torsion magnetometry in
anisotropic quantum materials. Nature Communications. 2018;9(1):3975. doi:10.1038/s41467-018-06412-w
apa: Modic, K. A., Bachmann, M. D., Ramshaw, B. J., Arnold, F., Shirer, K. R., Estry,
A., … Moll, P. J. W. (2018). Resonant torsion magnetometry in anisotropic quantum
materials. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-06412-w
chicago: Modic, Kimberly A, Maja D. Bachmann, B. J. Ramshaw, F. Arnold, K. R. Shirer,
Amelia Estry, J. B. Betts, et al. “Resonant Torsion Magnetometry in Anisotropic
Quantum Materials.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-06412-w.
ieee: K. A. Modic et al., “Resonant torsion magnetometry in anisotropic quantum
materials,” Nature Communications, vol. 9, no. 1. Springer Nature, p. 3975,
2018.
ista: Modic KA, Bachmann MD, Ramshaw BJ, Arnold F, Shirer KR, Estry A, Betts JB,
Ghimire NJ, Bauer ED, Schmidt M, Baenitz M, Svanidze E, McDonald RD, Shekhter
A, Moll PJW. 2018. Resonant torsion magnetometry in anisotropic quantum materials.
Nature Communications. 9(1), 3975.
mla: Modic, Kimberly A., et al. “Resonant Torsion Magnetometry in Anisotropic Quantum
Materials.” Nature Communications, vol. 9, no. 1, Springer Nature, 2018,
p. 3975, doi:10.1038/s41467-018-06412-w.
short: K.A. Modic, M.D. Bachmann, B.J. Ramshaw, F. Arnold, K.R. Shirer, A. Estry,
J.B. Betts, N.J. Ghimire, E.D. Bauer, M. Schmidt, M. Baenitz, E. Svanidze, R.D.
McDonald, A. Shekhter, P.J.W. Moll, Nature Communications 9 (2018) 3975.
date_created: 2019-11-19T13:02:20Z
date_published: 2018-09-28T00:00:00Z
date_updated: 2021-01-12T08:11:37Z
day: '28'
ddc:
- '530'
doi: 10.1038/s41467-018-06412-w
extern: '1'
file:
- access_level: open_access
checksum: 46a313c816e66899d4dad2cf3583e5b0
content_type: application/pdf
creator: dernst
date_created: 2019-11-20T12:48:58Z
date_updated: 2020-07-14T12:47:48Z
file_id: '7088'
file_name: 2018_NatureComm_Modic.pdf
file_size: 1257681
relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '3975'
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Resonant torsion magnetometry in anisotropic quantum materials
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: 9
year: '2018'
...
---
_id: '7060'
abstract:
- lang: eng
text: The anomalous metallic state in the high-temperature superconducting cuprates
is masked by superconductivity near a quantum critical point. Applying high magnetic
fields to suppress superconductivity has enabled detailed studies of the normal
state, yet the direct effect of strong magnetic fields on the metallic state is
poorly understood. We report the high-field magnetoresistance of thin-film La2–xSrxCuO4
cuprate in the vicinity of the critical doping, 0.161 ≤ p ≤ 0.190. We find that
the metallic state exposed by suppressing superconductivity is characterized by
magnetoresistance that is linear in magnetic fields up to 80 tesla. The magnitude
of the linear-in-field resistivity mirrors the magnitude and doping evolution
of the well-known linear-in-temperature resistivity that has been associated with
quantum criticality in high-temperature superconductors.
article_processing_charge: No
article_type: original
author:
- first_name: P.
full_name: Giraldo-Gallo, P.
last_name: Giraldo-Gallo
- first_name: J. A.
full_name: Galvis, J. A.
last_name: Galvis
- first_name: Z.
full_name: Stegen, Z.
last_name: Stegen
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: F. F.
full_name: Balakirev, F. F.
last_name: Balakirev
- first_name: J. B.
full_name: Betts, J. B.
last_name: Betts
- first_name: X.
full_name: Lian, X.
last_name: Lian
- first_name: C.
full_name: Moir, C.
last_name: Moir
- first_name: S. C.
full_name: Riggs, S. C.
last_name: Riggs
- first_name: J.
full_name: Wu, J.
last_name: Wu
- first_name: A. T.
full_name: Bollinger, A. T.
last_name: Bollinger
- first_name: X.
full_name: He, X.
last_name: He
- first_name: I.
full_name: Božović, I.
last_name: Božović
- first_name: B. J.
full_name: Ramshaw, B. J.
last_name: Ramshaw
- first_name: R. D.
full_name: McDonald, R. D.
last_name: McDonald
- first_name: G. S.
full_name: Boebinger, G. S.
last_name: Boebinger
- first_name: A.
full_name: Shekhter, A.
last_name: Shekhter
citation:
ama: Giraldo-Gallo P, Galvis JA, Stegen Z, et al. Scale-invariant magnetoresistance
in a cuprate superconductor. Science. 2018;361(6401):479-481. doi:10.1126/science.aan3178
apa: Giraldo-Gallo, P., Galvis, J. A., Stegen, Z., Modic, K. A., Balakirev, F. F.,
Betts, J. B., … Shekhter, A. (2018). Scale-invariant magnetoresistance in a cuprate
superconductor. Science. AAAS. https://doi.org/10.1126/science.aan3178
chicago: Giraldo-Gallo, P., J. A. Galvis, Z. Stegen, Kimberly A Modic, F. F. Balakirev,
J. B. Betts, X. Lian, et al. “Scale-Invariant Magnetoresistance in a Cuprate Superconductor.”
Science. AAAS, 2018. https://doi.org/10.1126/science.aan3178.
ieee: P. Giraldo-Gallo et al., “Scale-invariant magnetoresistance in a cuprate
superconductor,” Science, vol. 361, no. 6401. AAAS, pp. 479–481, 2018.
ista: Giraldo-Gallo P, Galvis JA, Stegen Z, Modic KA, Balakirev FF, Betts JB, Lian
X, Moir C, Riggs SC, Wu J, Bollinger AT, He X, Božović I, Ramshaw BJ, McDonald
RD, Boebinger GS, Shekhter A. 2018. Scale-invariant magnetoresistance in a cuprate
superconductor. Science. 361(6401), 479–481.
mla: Giraldo-Gallo, P., et al. “Scale-Invariant Magnetoresistance in a Cuprate Superconductor.”
Science, vol. 361, no. 6401, AAAS, 2018, pp. 479–81, doi:10.1126/science.aan3178.
short: P. Giraldo-Gallo, J.A. Galvis, Z. Stegen, K.A. Modic, F.F. Balakirev, J.B.
Betts, X. Lian, C. Moir, S.C. Riggs, J. Wu, A.T. Bollinger, X. He, I. Božović,
B.J. Ramshaw, R.D. McDonald, G.S. Boebinger, A. Shekhter, Science 361 (2018) 479–481.
date_created: 2019-11-19T13:03:16Z
date_published: 2018-08-03T00:00:00Z
date_updated: 2021-01-12T08:11:37Z
day: '03'
doi: 10.1126/science.aan3178
extern: '1'
intvolume: ' 361'
issue: '6401'
language:
- iso: eng
month: '08'
oa_version: None
page: 479-481
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: AAAS
quality_controlled: '1'
status: public
title: Scale-invariant magnetoresistance in a cuprate superconductor
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 361
year: '2018'
...
---
_id: '7062'
abstract:
- lang: eng
text: 'Weyl fermions are a recently discovered ingredient for correlated states
of electronic matter. A key difficulty has been that real materials also contain
non-Weyl quasiparticles, and disentangling the experimental signatures has proven
challenging. Here we use magnetic fields up to 95 T to drive the Weyl semimetal
TaAs far into its quantum limit, where only the purely chiral 0th Landau levels
of the Weyl fermions are occupied. We find the electrical resistivity to be nearly
independent of magnetic field up to 50 T: unusual for conventional metals but
consistent with the chiral anomaly for Weyl fermions. Above 50 T we observe a
two-order-of-magnitude increase in resistivity, indicating that a gap opens in
the chiral Landau levels. Above 80 T we observe strong ultrasonic attenuation
below 2 K, suggesting a mesoscopically textured state of matter. These results
point the way to inducing new correlated states of matter in the quantum limit
of Weyl semimetals.'
article_number: '2217'
article_processing_charge: No
article_type: original
author:
- first_name: B. J.
full_name: Ramshaw, B. J.
last_name: Ramshaw
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Arkady
full_name: Shekhter, Arkady
last_name: Shekhter
- first_name: Yi
full_name: Zhang, Yi
last_name: Zhang
- first_name: Eun-Ah
full_name: Kim, Eun-Ah
last_name: Kim
- first_name: Philip J. W.
full_name: Moll, Philip J. W.
last_name: Moll
- first_name: Maja D.
full_name: Bachmann, Maja D.
last_name: Bachmann
- first_name: M. K.
full_name: Chan, M. K.
last_name: Chan
- first_name: J. B.
full_name: Betts, J. B.
last_name: Betts
- first_name: F.
full_name: Balakirev, F.
last_name: Balakirev
- first_name: A.
full_name: Migliori, A.
last_name: Migliori
- first_name: N. J.
full_name: Ghimire, N. J.
last_name: Ghimire
- first_name: E. D.
full_name: Bauer, E. D.
last_name: Bauer
- first_name: F.
full_name: Ronning, F.
last_name: Ronning
- first_name: R. D.
full_name: McDonald, R. D.
last_name: McDonald
citation:
ama: Ramshaw BJ, Modic KA, Shekhter A, et al. Quantum limit transport and destruction
of the Weyl nodes in TaAs. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-04542-9
apa: Ramshaw, B. J., Modic, K. A., Shekhter, A., Zhang, Y., Kim, E.-A., Moll, P.
J. W., … McDonald, R. D. (2018). Quantum limit transport and destruction of the
Weyl nodes in TaAs. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04542-9
chicago: Ramshaw, B. J., Kimberly A Modic, Arkady Shekhter, Yi Zhang, Eun-Ah Kim,
Philip J. W. Moll, Maja D. Bachmann, et al. “Quantum Limit Transport and Destruction
of the Weyl Nodes in TaAs.” Nature Communications. Springer Nature, 2018.
https://doi.org/10.1038/s41467-018-04542-9.
ieee: B. J. Ramshaw et al., “Quantum limit transport and destruction of the
Weyl nodes in TaAs,” Nature Communications, vol. 9, no. 1. Springer Nature,
2018.
ista: Ramshaw BJ, Modic KA, Shekhter A, Zhang Y, Kim E-A, Moll PJW, Bachmann MD,
Chan MK, Betts JB, Balakirev F, Migliori A, Ghimire NJ, Bauer ED, Ronning F, McDonald
RD. 2018. Quantum limit transport and destruction of the Weyl nodes in TaAs. Nature
Communications. 9(1), 2217.
mla: Ramshaw, B. J., et al. “Quantum Limit Transport and Destruction of the Weyl
Nodes in TaAs.” Nature Communications, vol. 9, no. 1, 2217, Springer Nature,
2018, doi:10.1038/s41467-018-04542-9.
short: B.J. Ramshaw, K.A. Modic, A. Shekhter, Y. Zhang, E.-A. Kim, P.J.W. Moll,
M.D. Bachmann, M.K. Chan, J.B. Betts, F. Balakirev, A. Migliori, N.J. Ghimire,
E.D. Bauer, F. Ronning, R.D. McDonald, Nature Communications 9 (2018).
date_created: 2019-11-19T13:10:33Z
date_published: 2018-06-07T00:00:00Z
date_updated: 2021-01-12T08:11:38Z
day: '07'
ddc:
- '530'
doi: 10.1038/s41467-018-04542-9
extern: '1'
file:
- access_level: open_access
checksum: 9c53f9a1f06a4d83d5fe879d2478b7d7
content_type: application/pdf
creator: dernst
date_created: 2019-11-20T13:55:44Z
date_updated: 2020-07-14T12:47:48Z
file_id: '7089'
file_name: 2018_NatureComm_Ramshaw.pdf
file_size: 1794797
relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Quantum limit transport and destruction of the Weyl nodes in TaAs
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: 9
year: '2018'
...
---
_id: '7063'
abstract:
- lang: eng
text: The high-pressure synthesis and incommensurately modulated structure are reported
for the new compound Sr2Pt8−xAs, with x = 0.715 (5). The structure consists of
Sr2Pt3As layers alternating with Pt-only corrugated grids. Ab initio calculations
predict a metallic character with a dominant role of the Pt d electrons. The electrical
resistivity (ρ) and Seebeck coefficient confirm the metallic character, but surprisingly,
ρ showed a near-flat temperature dependence. This observation fits the description
of the Mooij correlation for electrical resistivity in disordered metals, originally
developed for statistically distributed point defects. The discussed material
has a long-range crystallographic order, but the high concentration of Pt vacancies,
incommensurately ordered, strongly influences the electronic conduction properties.
This result extends the range of validity of the Mooij correlation to long-range
ordered incommensurately modulated vacancies. Motivated by the layered structure,
the resistivity anisotropy was measured in a focused-ion-beam micro-fabricated
well oriented single crystal. A low resistivity anisotropy indicates that the
layers are electrically coupled and conduction channels along different directions
are intermixed.
article_processing_charge: No
article_type: original
author:
- first_name: Edoardo
full_name: Martino, Edoardo
last_name: Martino
- first_name: Alla
full_name: Arakcheeva, Alla
last_name: Arakcheeva
- first_name: Gabriel
full_name: Autès, Gabriel
last_name: Autès
- first_name: Andrea
full_name: Pisoni, Andrea
last_name: Pisoni
- first_name: Maja D.
full_name: Bachmann, Maja D.
last_name: Bachmann
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Toni
full_name: Helm, Toni
last_name: Helm
- first_name: Oleg V.
full_name: Yazyev, Oleg V.
last_name: Yazyev
- first_name: Philip J. W.
full_name: Moll, Philip J. W.
last_name: Moll
- first_name: László
full_name: Forró, László
last_name: Forró
- first_name: Sergiy
full_name: Katrych, Sergiy
last_name: Katrych
citation:
ama: 'Martino E, Arakcheeva A, Autès G, et al. Sr2Pt8−xAs: A layered incommensurately
modulated metal with saturated resistivity. IUCrJ. 2018;5(4):470-477. doi:10.1107/s2052252518007303'
apa: 'Martino, E., Arakcheeva, A., Autès, G., Pisoni, A., Bachmann, M. D., Modic,
K. A., … Katrych, S. (2018). Sr2Pt8−xAs: A layered incommensurately modulated
metal with saturated resistivity. IUCrJ. International Union of Crystallography
(IUCr). https://doi.org/10.1107/s2052252518007303'
chicago: 'Martino, Edoardo, Alla Arakcheeva, Gabriel Autès, Andrea Pisoni, Maja
D. Bachmann, Kimberly A Modic, Toni Helm, et al. “Sr2Pt8−xAs: A Layered Incommensurately
Modulated Metal with Saturated Resistivity.” IUCrJ. International Union
of Crystallography (IUCr), 2018. https://doi.org/10.1107/s2052252518007303.'
ieee: 'E. Martino et al., “Sr2Pt8−xAs: A layered incommensurately modulated
metal with saturated resistivity,” IUCrJ, vol. 5, no. 4. International
Union of Crystallography (IUCr), pp. 470–477, 2018.'
ista: 'Martino E, Arakcheeva A, Autès G, Pisoni A, Bachmann MD, Modic KA, Helm T,
Yazyev OV, Moll PJW, Forró L, Katrych S. 2018. Sr2Pt8−xAs: A layered incommensurately
modulated metal with saturated resistivity. IUCrJ. 5(4), 470–477.'
mla: 'Martino, Edoardo, et al. “Sr2Pt8−xAs: A Layered Incommensurately Modulated
Metal with Saturated Resistivity.” IUCrJ, vol. 5, no. 4, International
Union of Crystallography (IUCr), 2018, pp. 470–77, doi:10.1107/s2052252518007303.'
short: E. Martino, A. Arakcheeva, G. Autès, A. Pisoni, M.D. Bachmann, K.A. Modic,
T. Helm, O.V. Yazyev, P.J.W. Moll, L. Forró, S. Katrych, IUCrJ 5 (2018) 470–477.
date_created: 2019-11-19T13:11:15Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2021-01-12T08:11:38Z
day: '01'
ddc:
- '530'
doi: 10.1107/s2052252518007303
extern: '1'
file:
- access_level: open_access
checksum: 5c6180c7d19da599dd50a067eb2efd50
content_type: application/pdf
creator: dernst
date_created: 2019-11-20T14:00:27Z
date_updated: 2020-07-14T12:47:48Z
file_id: '7090'
file_name: 2018_IUCrJ_Martino.pdf
file_size: 1563353
relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 470-477
publication: IUCrJ
publication_identifier:
eissn:
- 2052-2525
publication_status: published
publisher: International Union of Crystallography (IUCr)
quality_controlled: '1'
status: public
title: 'Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity'
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: 5
year: '2018'
...
---
_id: '7116'
abstract:
- lang: eng
text: 'Training deep learning models has received tremendous research interest recently.
In particular, there has been intensive research on reducing the communication
cost of training when using multiple computational devices, through reducing the
precision of the underlying data representation. Naturally, such methods induce
system trade-offs—lowering communication precision could de-crease communication
overheads and improve scalability; but, on the other hand, it can also reduce
the accuracy of training. In this paper, we study this trade-off space, and ask:Can
low-precision communication consistently improve the end-to-end performance of
training modern neural networks, with no accuracy loss?From the performance point
of view, the answer to this question may appear deceptively easy: compressing
communication through low precision should help when the ratio between communication
and computation is high. However, this answer is less straightforward when we
try to generalize this principle across various neural network architectures (e.g.,
AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g.,
EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL),
and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is
not clear how a realistic realization of all these factors maps to the speed up
provided by low-precision communication. In this paper, we conduct an empirical
study to answer this question and report the insights.'
article_processing_charge: No
author:
- first_name: Demjan
full_name: Grubic, Demjan
last_name: Grubic
- first_name: Leo
full_name: Tam, Leo
last_name: Tam
- 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: Ce
full_name: Zhang, Ce
last_name: Zhang
citation:
ama: 'Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for
deep learning with low-precision communications: An empirical study. In: Proceedings
of the 21st International Conference on Extending Database Technology. OpenProceedings;
2018:145-156. doi:10.5441/002/EDBT.2018.14'
apa: 'Grubic, D., Tam, L., Alistarh, D.-A., & Zhang, C. (2018). Synchronous
multi-GPU training for deep learning with low-precision communications: An empirical
study. In Proceedings of the 21st International Conference on Extending Database
Technology (pp. 145–156). Vienna, Austria: OpenProceedings. https://doi.org/10.5441/002/EDBT.2018.14'
chicago: 'Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous
Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical
Study.” In Proceedings of the 21st International Conference on Extending Database
Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14.'
ieee: 'D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “Synchronous multi-GPU training
for deep learning with low-precision communications: An empirical study,” in Proceedings
of the 21st International Conference on Extending Database Technology, Vienna,
Austria, 2018, pp. 145–156.'
ista: 'Grubic D, Tam L, Alistarh D-A, Zhang C. 2018. Synchronous multi-GPU training
for deep learning with low-precision communications: An empirical study. Proceedings
of the 21st International Conference on Extending Database Technology. EDBT: Conference
on Extending Database Technology, 145–156.'
mla: 'Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with
Low-Precision Communications: An Empirical Study.” Proceedings of the 21st
International Conference on Extending Database Technology, OpenProceedings,
2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14.'
short: D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st
International Conference on Extending Database Technology, OpenProceedings, 2018,
pp. 145–156.
conference:
end_date: 2018-03-29
location: Vienna, Austria
name: 'EDBT: Conference on Extending Database Technology'
start_date: 2018-03-26
date_created: 2019-11-26T14:19:11Z
date_published: 2018-03-26T00:00:00Z
date_updated: 2023-02-23T12:59:17Z
day: '26'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.5441/002/EDBT.2018.14
file:
- access_level: open_access
checksum: ec979b56abc71016d6e6adfdadbb4afe
content_type: application/pdf
creator: dernst
date_created: 2019-11-26T14:23:04Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7118'
file_name: 2018_OpenProceedings_Grubic.pdf
file_size: 1603204
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '03'
oa: 1
oa_version: Published Version
page: 145-156
publication: Proceedings of the 21st International Conference on Extending Database
Technology
publication_identifier:
isbn:
- '9783893180783'
issn:
- 2367-2005
publication_status: published
publisher: OpenProceedings
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Synchronous multi-GPU training for deep learning with low-precision communications:
An empirical study'
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '7123'
abstract:
- lang: eng
text: "Population protocols are a popular model of distributed computing, in which
n agents with limited local state interact randomly, and cooperate to collectively
compute global predicates. Inspired by recent developments in DNA programming,
an extensive series of papers, across different communities, has examined the
computability and complexity characteristics of this model. Majority, or consensus,
is a central task in this model, in which agents need to collectively reach a
decision as to which one of two states A or B had a higher initial count. Two
metrics are important: the time that a protocol requires to stabilize to an output
decision, and the state space size that each agent requires to do so. It is known
that majority requires Ω(log log n) states per agent to allow for fast (poly-logarithmic
time) stabilization, and that O(log2 n) states are sufficient. Thus, there is
an exponential gap between the space upper and lower bounds for this problem.
This paper addresses this question.\r\n\r\nOn the negative side, we provide a
new lower bound of Ω(log n) states for any protocol which stabilizes in O(n1–c)
expected time, for any constant c > 0. This result is conditional on monotonicity
and output assumptions, satisfied by all known protocols. Technically, it represents
a departure from previous lower bounds, in that it does not rely on the existence
of dense configurations. Instead, we introduce a new generalized surgery technique
to prove the existence of incorrect executions for any algorithm which would contradict
the lower bound. Subsequently, our lower bound also applies to general initial
configurations, including ones with a leader. On the positive side, we give a
new algorithm for majority which uses O(log n) states, and stabilizes in O(log2
n) expected time. Central to the algorithm is a new leaderless phase clock technique,
which allows agents to synchronize in phases of Θ(n log n) consecutive interactions
using O(log n) states per agent, exploiting a new connection between population
protocols and power-of-two-choices load balancing mechanisms. We also employ our
phase clock to build a leader election algorithm with a state space of size O(log
n), which stabilizes in O(log2 n) expected time."
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: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
citation:
ama: 'Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population
protocols. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete
Algorithms. ACM; 2018:2221-2239. doi:10.1137/1.9781611975031.144'
apa: 'Alistarh, D.-A., Aspnes, J., & Gelashvili, R. (2018). Space-optimal majority
in population protocols. In Proceedings of the 29th Annual ACM-SIAM Symposium
on Discrete Algorithms (pp. 2221–2239). New Orleans, LA, United States: ACM.
https://doi.org/10.1137/1.9781611975031.144'
chicago: Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal
Majority in Population Protocols.” In Proceedings of the 29th Annual ACM-SIAM
Symposium on Discrete Algorithms, 2221–39. ACM, 2018. https://doi.org/10.1137/1.9781611975031.144.
ieee: D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population
protocols,” in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete
Algorithms, New Orleans, LA, United States, 2018, pp. 2221–2239.
ista: 'Alistarh D-A, Aspnes J, Gelashvili R. 2018. Space-optimal majority in population
protocols. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms.
SODA: Symposium on Discrete Algorithms, 2221–2239.'
mla: Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.”
Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms,
ACM, 2018, pp. 2221–39, doi:10.1137/1.9781611975031.144.
short: D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual
ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.
conference:
end_date: 2018-01-10
location: New Orleans, LA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2018-01-07
date_created: 2019-11-26T15:10:55Z
date_published: 2018-01-30T00:00:00Z
date_updated: 2023-09-19T15:03:16Z
day: '30'
department:
- _id: DaAl
doi: 10.1137/1.9781611975031.144
external_id:
arxiv:
- '1704.04947'
isi:
- '000483921200145'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1704.04947
month: '01'
oa: 1
oa_version: Preprint
page: 2221-2239
publication: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- '9781611975031'
publication_status: published
publisher: ACM
quality_controlled: '1'
status: public
title: Space-optimal majority in population protocols
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...