---
_id: '6621'
abstract:
- lang: eng
text: We read with great interest the recent work in PNAS by Bergero et al. (1)
describing differences in male and female recombination patterns on the guppy
(Poecilia reticulata) sex chromosome. We fully agree that recombination in males
is largely confined to the ends of the sex chromosome. Bergero et al. interpret
these results to suggest that our previous findings of population-level variation
in the degree of sex chromosome differentiation in this species (2) are incorrect.
However, we suggest that their results are entirely consistent with our previous
report, and that their interpretation presents a false controversy.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Alison E.
full_name: Wright, Alison E.
last_name: Wright
- first_name: Iulia
full_name: Darolti, Iulia
last_name: Darolti
- first_name: Natasha I.
full_name: Bloch, Natasha I.
last_name: Bloch
- first_name: Vicencio
full_name: Oostra, Vicencio
last_name: Oostra
- first_name: Benjamin A.
full_name: Sandkam, Benjamin A.
last_name: Sandkam
- first_name: Séverine D.
full_name: Buechel, Séverine D.
last_name: Buechel
- first_name: Niclas
full_name: Kolm, Niclas
last_name: Kolm
- first_name: Felix
full_name: Breden, Felix
last_name: Breden
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
- first_name: Judith E.
full_name: Mank, Judith E.
last_name: Mank
citation:
ama: Wright AE, Darolti I, Bloch NI, et al. On the power to detect rare recombination
events. Proceedings of the National Academy of Sciences of the United States
of America. 2019;116(26):12607-12608. doi:10.1073/pnas.1905555116
apa: Wright, A. E., Darolti, I., Bloch, N. I., Oostra, V., Sandkam, B. A., Buechel,
S. D., … Mank, J. E. (2019). On the power to detect rare recombination events.
Proceedings of the National Academy of Sciences of the United States of America.
Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1905555116
chicago: Wright, Alison E., Iulia Darolti, Natasha I. Bloch, Vicencio Oostra, Benjamin
A. Sandkam, Séverine D. Buechel, Niclas Kolm, Felix Breden, Beatriz Vicoso, and
Judith E. Mank. “On the Power to Detect Rare Recombination Events.” Proceedings
of the National Academy of Sciences of the United States of America. Proceedings
of the National Academy of Sciences, 2019. https://doi.org/10.1073/pnas.1905555116.
ieee: A. E. Wright et al., “On the power to detect rare recombination events,”
Proceedings of the National Academy of Sciences of the United States of America,
vol. 116, no. 26. Proceedings of the National Academy of Sciences, pp. 12607–12608,
2019.
ista: Wright AE, Darolti I, Bloch NI, Oostra V, Sandkam BA, Buechel SD, Kolm N,
Breden F, Vicoso B, Mank JE. 2019. On the power to detect rare recombination events.
Proceedings of the National Academy of Sciences of the United States of America.
116(26), 12607–12608.
mla: Wright, Alison E., et al. “On the Power to Detect Rare Recombination Events.”
Proceedings of the National Academy of Sciences of the United States of America,
vol. 116, no. 26, Proceedings of the National Academy of Sciences, 2019, pp. 12607–08,
doi:10.1073/pnas.1905555116.
short: A.E. Wright, I. Darolti, N.I. Bloch, V. Oostra, B.A. Sandkam, S.D. Buechel,
N. Kolm, F. Breden, B. Vicoso, J.E. Mank, Proceedings of the National Academy
of Sciences of the United States of America 116 (2019) 12607–12608.
date_created: 2019-07-07T21:59:25Z
date_published: 2019-06-25T00:00:00Z
date_updated: 2023-10-17T12:44:15Z
day: '25'
department:
- _id: BeVi
doi: 10.1073/pnas.1905555116
external_id:
isi:
- '000472719100010'
pmid:
- '31213531'
intvolume: ' 116'
isi: 1
issue: '26'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1073/pnas.1905555116
month: '06'
oa: 1
oa_version: Published Version
page: 12607-12608
pmid: 1
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the power to detect rare recombination events
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 116
year: '2019'
...
---
_id: '6856'
abstract:
- lang: eng
text: 'Plant mating systems play a key role in structuring genetic variation both
within and between species. In hybrid zones, the outcomes and dynamics of hybridization
are usually interpreted as the balance between gene flow and selection against
hybrids. Yet, mating systems can introduce selective forces that alter these expectations;
with diverse outcomes for the level and direction of gene flow depending on variation
in outcrossing and whether the mating systems of the species pair are the same
or divergent. We present a survey of hybridization in 133 species pairs from 41
plant families and examine how patterns of hybridization vary with mating system.
We examine if hybrid zone mode, level of gene flow, asymmetries in gene flow and
the frequency of reproductive isolating barriers vary in relation to mating system/s
of the species pair. We combine these results with a simulation model and examples
from the literature to address two general themes: (i) the two‐way interaction
between introgression and the evolution of reproductive systems, and (ii) how
mating system can facilitate or restrict interspecific gene flow. We conclude
that examining mating system with hybridization provides unique opportunities
to understand divergence and the processes underlying reproductive isolation.'
article_processing_charge: No
article_type: original
author:
- first_name: Melinda
full_name: Pickup, Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Yaniv
full_name: Brandvain, Yaniv
last_name: Brandvain
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Sarah
full_name: Yakimowski, Sarah
last_name: Yakimowski
- first_name: Tanmay
full_name: Dixit, Tanmay
last_name: Dixit
- first_name: Christian
full_name: Lexer, Christian
last_name: Lexer
- first_name: Eva
full_name: Cereghetti, Eva
id: 71AA91B4-05ED-11EA-8BEB-F5833E63BD63
last_name: Cereghetti
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
citation:
ama: 'Pickup M, Barton NH, Brandvain Y, et al. Mating system variation in hybrid
zones: Facilitation, barriers and asymmetries to gene flow. New Phytologist.
2019;224(3):1035-1047. doi:10.1111/nph.16180'
apa: 'Pickup, M., Barton, N. H., Brandvain, Y., Fraisse, C., Yakimowski, S., Dixit,
T., … Field, D. (2019). Mating system variation in hybrid zones: Facilitation,
barriers and asymmetries to gene flow. New Phytologist. Wiley. https://doi.org/10.1111/nph.16180'
chicago: 'Pickup, Melinda, Nicholas H Barton, Yaniv Brandvain, Christelle Fraisse,
Sarah Yakimowski, Tanmay Dixit, Christian Lexer, Eva Cereghetti, and David Field.
“Mating System Variation in Hybrid Zones: Facilitation, Barriers and Asymmetries
to Gene Flow.” New Phytologist. Wiley, 2019. https://doi.org/10.1111/nph.16180.'
ieee: 'M. Pickup et al., “Mating system variation in hybrid zones: Facilitation,
barriers and asymmetries to gene flow,” New Phytologist, vol. 224, no.
3. Wiley, pp. 1035–1047, 2019.'
ista: 'Pickup M, Barton NH, Brandvain Y, Fraisse C, Yakimowski S, Dixit T, Lexer
C, Cereghetti E, Field D. 2019. Mating system variation in hybrid zones: Facilitation,
barriers and asymmetries to gene flow. New Phytologist. 224(3), 1035–1047.'
mla: 'Pickup, Melinda, et al. “Mating System Variation in Hybrid Zones: Facilitation,
Barriers and Asymmetries to Gene Flow.” New Phytologist, vol. 224, no.
3, Wiley, 2019, pp. 1035–47, doi:10.1111/nph.16180.'
short: M. Pickup, N.H. Barton, Y. Brandvain, C. Fraisse, S. Yakimowski, T. Dixit,
C. Lexer, E. Cereghetti, D. Field, New Phytologist 224 (2019) 1035–1047.
date_created: 2019-09-07T14:35:40Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-10-18T08:47:08Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1111/nph.16180
ec_funded: 1
external_id:
pmid:
- '31505037'
file:
- access_level: open_access
checksum: 21e4c95599bbcaf7c483b89954658672
content_type: application/pdf
creator: dernst
date_created: 2019-11-13T08:15:05Z
date_updated: 2020-07-14T12:47:42Z
file_id: '7011'
file_name: 2019_NewPhytologist_Pickup.pdf
file_size: 1511958
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 224'
issue: '3'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1035-1047
pmid: 1
project:
- _id: 25B36484-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '329960'
name: Mating system and the evolutionary dynamics of hybrid zones
- _id: 2662AADE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02463
name: Sex chromosomes and species barriers
publication: New Phytologist
publication_identifier:
eissn:
- 1469-8137
issn:
- 0028-646X
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Mating system variation in hybrid zones: Facilitation, barriers and asymmetries
to gene flow'
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: 224
year: '2019'
...
---
_id: '6647'
abstract:
- lang: eng
text: The Tverberg theorem is one of the cornerstones of discrete geometry. It states
that, given a set X of at least (d+1)(r-1)+1 points in R^d, one can find a partition
X=X_1 cup ... cup X_r of X, such that the convex hulls of the X_i, i=1,...,r,
all share a common point. In this paper, we prove a strengthening of this theorem
that guarantees a partition which, in addition to the above, has the property
that the boundaries of full-dimensional convex hulls have pairwise nonempty intersections.
Possible generalizations and algorithmic aspects are also discussed. As a concrete
application, we show that any n points in the plane in general position span floor[n/3]
vertex-disjoint triangles that are pairwise crossing, meaning that their boundaries
have pairwise nonempty intersections; this number is clearly best possible. A
previous result of Alvarez-Rebollar et al. guarantees floor[n/6] pairwise crossing
triangles. Our result generalizes to a result about simplices in R^d,d >=2.
alternative_title:
- LIPIcs
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Bernd
full_name: Gärtner, Bernd
last_name: Gärtner
- first_name: Andrey
full_name: Kupavskii, Andrey
last_name: Kupavskii
- first_name: Pavel
full_name: Valtr, Pavel
last_name: Valtr
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. The crossing Tverberg
theorem. In: 35th International Symposium on Computational Geometry. Vol
129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:38:1-38:13. doi:10.4230/LIPICS.SOCG.2019.38'
apa: 'Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., & Wagner, U. (2019).
The crossing Tverberg theorem. In 35th International Symposium on Computational
Geometry (Vol. 129, p. 38:1-38:13). Portland, OR, United States: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.38'
chicago: Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli
Wagner. “The Crossing Tverberg Theorem.” In 35th International Symposium on
Computational Geometry, 129:38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.38.
ieee: R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing
Tverberg theorem,” in 35th International Symposium on Computational Geometry,
Portland, OR, United States, 2019, vol. 129, p. 38:1-38:13.
ista: 'Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2019. The crossing Tverberg
theorem. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium
on Computational Geometry, LIPIcs, vol. 129, 38:1-38:13.'
mla: Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.” 35th International
Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019, p. 38:1-38:13, doi:10.4230/LIPICS.SOCG.2019.38.
short: R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, in:, 35th International
Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019, p. 38:1-38:13.
conference:
end_date: 2019-06-21
location: Portland, OR, United States
name: 'SoCG 2019: Symposium on Computational Geometry'
start_date: 2019-06-18
date_created: 2019-07-17T10:35:04Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-12-13T12:03:35Z
day: '01'
ddc:
- '000'
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPICS.SOCG.2019.38
external_id:
arxiv:
- '1812.04911'
file:
- access_level: open_access
checksum: d6d017f8b41291b94d102294fa96ae9c
content_type: application/pdf
creator: dernst
date_created: 2019-07-24T06:54:52Z
date_updated: 2020-07-14T12:47:35Z
file_id: '6667'
file_name: 2019_LIPICS_Fulek.pdf
file_size: 559837
relation: main_file
file_date_updated: 2020-07-14T12:47:35Z
has_accepted_license: '1'
intvolume: ' 129'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 38:1-38:13
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication: 35th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771047'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '13974'
relation: later_version
status: public
scopus_import: 1
status: public
title: The crossing Tverberg theorem
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 129
year: '2019'
...
---
_id: '6676'
abstract:
- lang: eng
text: "It is impossible to deterministically solve wait-free consensus in an asynchronous
system. The classic proof uses a valency argument, which constructs an infinite
execution by repeatedly extending a finite execution. We introduce extension-based
proofs, a class of impossibility proofs that are modelled as an interaction between
a prover and a protocol and that include valency arguments.\r\n\r\nUsing 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 show
that 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. Why extension-based
proofs fail. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory
of Computing. ACM Press; 2019:986-996. doi:10.1145/3313276.3316407'
apa: 'Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., & Zhu, L. (2019).
Why extension-based proofs fail. In Proceedings of the 51st Annual ACM SIGACT
Symposium on Theory of Computing (pp. 986–996). Phoenix, AZ, United States:
ACM Press. https://doi.org/10.1145/3313276.3316407'
chicago: Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi
Zhu. “Why Extension-Based Proofs Fail.” In Proceedings of the 51st Annual ACM
SIGACT Symposium on Theory of Computing, 986–96. ACM Press, 2019. https://doi.org/10.1145/3313276.3316407.
ieee: D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Why extension-based
proofs fail,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory
of Computing, Phoenix, AZ, United States, 2019, pp. 986–996.
ista: 'Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2019. Why extension-based
proofs fail. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of
Computing. STOC: Symposium on Theory of Computing, 986–996.'
mla: Alistarh, Dan-Adrian, et al. “Why Extension-Based Proofs Fail.” Proceedings
of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press,
2019, pp. 986–96, doi:10.1145/3313276.3316407.
short: D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings
of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press, 2019,
pp. 986–996.
conference:
end_date: 2019-06-26
location: Phoenix, AZ, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2019-06-23
date_created: 2019-07-24T09:13:05Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-12-13T12:28:28Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3313276.3316407
external_id:
arxiv:
- '1811.01421'
isi:
- '000523199100089'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1811.01421
month: '06'
oa: 1
oa_version: Preprint
page: 986-996
publication: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
publication_identifier:
isbn:
- '9781450367059'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
related_material:
record:
- id: '14364'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Why extension-based proofs fail
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '7950'
abstract:
- lang: eng
text: "The input to the token swapping problem is a graph with vertices v1, v2,
. . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex. The
goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number
of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token
swapping on a tree, also known as “sorting with a transposition tree,” is not
known to be in P nor NP-complete. We present some partial results:\r\n1. An
optimum swap sequence may need to perform a swap on a leaf vertex that has the
correct token (a “happy leaf”), disproving a conjecture of Vaughan.\r\n2. Any
algorithm that fixes happy leaves—as all known approximation algorithms for the
problem do—has approximation factor at least 4/3. Furthermore, the two best-known
2-approximation algorithms have approximation factor exactly 2.\r\n3. A generalized
problem—weighted coloured token swapping—is NP-complete on trees, but solvable
in polynomial time on paths and stars. In this version, tokens and vertices
\ have colours, and colours have weights. The goal is to get every
token to a vertex of the same colour, and the cost of a swap is the sum of the
weights of the two tokens involved."
article_number: '1903.06981'
article_processing_charge: No
author:
- first_name: Ahmad
full_name: Biniaz, Ahmad
last_name: Biniaz
- first_name: Kshitij
full_name: Jain, Kshitij
last_name: Jain
- first_name: Anna
full_name: Lubiw, Anna
last_name: Lubiw
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Tillmann
full_name: Miltzow, Tillmann
last_name: Miltzow
- first_name: Debajyoti
full_name: Mondal, Debajyoti
last_name: Mondal
- first_name: Anurag Murty
full_name: Naredla, Anurag Murty
last_name: Naredla
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Alexi
full_name: Turcotte, Alexi
last_name: Turcotte
citation:
ama: Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. arXiv.
apa: Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte,
A. (n.d.). Token swapping on trees. arXiv.
chicago: Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow,
Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token
Swapping on Trees.” ArXiv, n.d.
ieee: A. Biniaz et al., “Token swapping on trees,” arXiv. .
ista: Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec
J, Turcotte A. Token swapping on trees. arXiv, 1903.06981.
mla: Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981.
short: A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla,
J. Tkadlec, A. Turcotte, ArXiv (n.d.).
date_created: 2020-06-08T12:25:25Z
date_published: 2019-03-16T00:00:00Z
date_updated: 2024-01-04T12:42:08Z
day: '16'
department:
- _id: HeEd
- _id: UlWa
- _id: KrCh
external_id:
arxiv:
- '1903.06981'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.06981
month: '03'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '7944'
relation: dissertation_contains
status: public
- id: '12833'
relation: later_version
status: public
status: public
title: Token swapping on trees
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...