---
_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.
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: '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
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: '7407'
abstract:
- lang: eng
text: 'Proofs of space (PoS) [Dziembowski et al., CRYPTO''15] are proof systems
where a prover can convince a verifier that he "wastes" disk space. PoS were introduced
as a more ecological and economical replacement for proofs of work which are currently
used to secure blockchains like Bitcoin. In this work we investigate extensions
of PoS which allow the prover to embed useful data into the dedicated space, which
later can be recovered. Our first contribution is a security proof for the original
PoS from CRYPTO''15 in the random oracle model (the original proof only applied
to a restricted class of adversaries which can store a subset of the data an honest
prover would store). When this PoS is instantiated with recent constructions of
maximally depth robust graphs, our proof implies basically optimal security. As
a second contribution we show three different extensions of this PoS where useful
data can be embedded into the space required by the prover. Our security proof
for the PoS extends (non-trivially) to these constructions. We discuss how some
of these variants can be used as proofs of catalytic space (PoCS), a notion we
put forward in this work, and which basically is a PoS where most of the space
required by the prover can be used to backup useful data. Finally we discuss how
one of the extensions is a candidate construction for a proof of replication (PoR),
a proof system recently suggested in the Filecoin whitepaper. '
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- 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: 'Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59'
apa: 'Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations
in Theoretical Computer Science Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25).
San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.ITCS.2019.59'
chicago: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations
in Theoretical Computer Science Conference (ITCS 2019), 124:59:1-59:25. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.
ieee: K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019), San Diego, CA, United States, 2018,
vol. 124, p. 59:1-59:25.
ista: 'Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019). ITCS: Innovations in theoretical Computer
Science Conference, LIPIcs, vol. 124, 59:1-59:25.'
mla: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in
Theoretical Computer Science Conference (ITCS 2019), vol. 124, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.
short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference
(ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.
conference:
end_date: 2019-01-12
location: San Diego, CA, United States
name: 'ITCS: Innovations in theoretical Computer Science Conference'
start_date: 2019-01-10
date_created: 2020-01-30T09:16:05Z
date_published: 2018-12-31T00:00:00Z
date_updated: 2021-01-12T08:13:26Z
day: '31'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.4230/LIPICS.ITCS.2019.59
ec_funded: 1
file:
- access_level: open_access
checksum: 5cebb7f7849a3beda898f697d755dd96
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T08:17:52Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7443'
file_name: 2018_LIPIcs_Pietrzak.pdf
file_size: 822884
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 124'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/194
month: '12'
oa: 1
oa_version: Published Version
page: 59:1-59:25
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
publication_identifier:
isbn:
- 978-3-95977-095-8
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Proofs of catalytic space
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: 124
year: '2018'
...
---
_id: '6001'
abstract:
- lang: eng
text: "The concurrent memory reclamation problem is that of devising a way for a
deallocating thread to verify that no other concurrent threads hold references
to a memory block being deallocated. To date, in the absence of automatic garbage
collection, there is no satisfactory solution to this problem; existing tracking
methods like hazard pointers, reference counters, or epoch-based techniques like
RCU are either prohibitively expensive or require significant programming expertise
to the extent that implementing them efficiently can be worthy of a publication.
None of the existing techniques are automatic or even semi-automated.\r\nIn this
article, we take a new approach to concurrent memory reclamation. Instead of manually
tracking access to memory locations as done in techniques like hazard pointers,
or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm,
called ThreadScan, leverages operating system signaling to automatically detect
which memory locations are being accessed by concurrent threads.\r\nInitial empirical
evidence shows that ThreadScan scales surprisingly well and requires negligible
programming effort beyond the standard use of Malloc and Free."
article_number: '18'
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: William
full_name: Leiserson, William
last_name: Leiserson
- first_name: Alexander
full_name: Matveev, Alexander
last_name: Matveev
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and
scalable memory reclamation. ACM Transactions on Parallel Computing. 2018;4(4).
doi:10.1145/3201897'
apa: 'Alistarh, D.-A., Leiserson, W., Matveev, A., & Shavit, N. (2018). ThreadScan:
Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing.
Association for Computing Machinery. https://doi.org/10.1145/3201897'
chicago: 'Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit.
“ThreadScan: Automatic and Scalable Memory Reclamation.” ACM Transactions on
Parallel Computing. Association for Computing Machinery, 2018. https://doi.org/10.1145/3201897.'
ieee: 'D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “ThreadScan: Automatic
and scalable memory reclamation,” ACM Transactions on Parallel Computing,
vol. 4, no. 4. Association for Computing Machinery, 2018.'
ista: 'Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2018. ThreadScan: Automatic
and scalable memory reclamation. ACM Transactions on Parallel Computing. 4(4),
18.'
mla: 'Alistarh, Dan-Adrian, et al. “ThreadScan: Automatic and Scalable Memory Reclamation.”
ACM Transactions on Parallel Computing, vol. 4, no. 4, 18, Association
for Computing Machinery, 2018, doi:10.1145/3201897.'
short: D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on
Parallel Computing 4 (2018).
date_created: 2019-02-14T13:24:11Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-02-23T13:17:54Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3201897
intvolume: ' 4'
issue: '4'
language:
- iso: eng
month: '09'
oa_version: None
publication: ACM Transactions on Parallel Computing
publication_identifier:
issn:
- 2329-4949
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '779'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'ThreadScan: Automatic and scalable memory reclamation'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2018'
...
---
_id: '7812'
abstract:
- lang: eng
text: Deep neural networks (DNNs) continue to make significant advances, solving
tasks from image classification to translation or reinforcement learning. One
aspect of the field receiving considerable attention is efficiently executing
deep models in resource-constrained environments, such as mobile or embedded devices.
This paper focuses on this problem, and proposes two new compression methods,
which jointly leverage weight quantization and distillation of larger teacher
networks into smaller student networks. The first method we propose is called
quantized distillation and leverages distillation during the training process,
by incorporating distillation loss, expressed with respect to the teacher, into
the training of a student network whose weights are quantized to a limited set
of levels. The second method, differentiable quantization, optimizes the location
of quantization points through stochastic gradient descent, to better fit the
behavior of the teacher model. We validate both methods through experiments on
convolutional and recurrent architectures. We show that quantized shallow students
can reach similar accuracy levels to full-precision teacher models, while providing
order of magnitude compression, and inference speedup that is linear in the depth
reduction. In sum, our results enable DNNs for resource-constrained environments
to leverage architecture and accuracy advances developed on more powerful devices.
article_processing_charge: No
author:
- first_name: Antonio
full_name: Polino, Antonio
last_name: Polino
- first_name: Razvan
full_name: Pascanu, Razvan
last_name: Pascanu
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and
quantization. In: 6th International Conference on Learning Representations.
; 2018.'
apa: Polino, A., Pascanu, R., & Alistarh, D.-A. (2018). Model compression via
distillation and quantization. In 6th International Conference on Learning
Representations. Vancouver, Canada.
chicago: Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression
via Distillation and Quantization.” In 6th International Conference on Learning
Representations, 2018.
ieee: A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation
and quantization,” in 6th International Conference on Learning Representations,
Vancouver, Canada, 2018.
ista: 'Polino A, Pascanu R, Alistarh D-A. 2018. Model compression via distillation
and quantization. 6th International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Polino, Antonio, et al. “Model Compression via Distillation and Quantization.”
6th International Conference on Learning Representations, 2018.
short: A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference
on Learning Representations, 2018.
conference:
end_date: 2018-05-03
location: Vancouver, Canada
name: 'ICLR: International Conference on Learning Representations'
start_date: 2018-04-30
date_created: 2020-05-10T22:00:51Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-02-23T13:18:41Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
arxiv:
- '1802.05668'
file:
- access_level: open_access
checksum: a4336c167978e81891970e4e4517a8c3
content_type: application/pdf
creator: dernst
date_created: 2020-05-26T13:02:00Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7894'
file_name: 2018_ICLR_Polino.pdf
file_size: 308339
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: 6th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
scopus_import: 1
status: public
title: Model compression via distillation and quantization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '8547'
abstract:
- lang: eng
text: The cerebral cortex contains multiple hierarchically organized areas with
distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying
the emergence of this diversity remain unclear. Here, we have quantitatively investigated
the neuronal output of individual progenitor cells in the ventricular zone of
the developing mouse neocortex using a combination of methods that together circumvent
the biases and limitations of individual approaches. We found that individual
cortical progenitor cells show a high degree of stochasticity and generate pyramidal
cell lineages that adopt a wide range of laminar configurations. Mathematical
modelling these lineage data suggests that a small number of progenitor cell populations,
each generating pyramidal cells following different stochastic developmental programs,
suffice to generate the heterogenous complement of pyramidal cell lineages that
collectively build the complex cytoarchitecture of the neocortex.
acknowledgement: We thank I. Andrew and S.E. Bae for excellent technical assistance,
F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members
of the Marín and Rico laboratories for stimulating discussions and ideas. Our research
on this topic is supported by grants from the European Research Council (ERC-2017-AdG
787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M.
L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received
support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO
postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the
European Commission under the H2020 Programme.
article_processing_charge: No
author:
- first_name: Alfredo
full_name: Llorca, Alfredo
last_name: Llorca
- first_name: Gabriele
full_name: Ciceri, Gabriele
last_name: Ciceri
- first_name: Robert J
full_name: Beattie, Robert J
id: 2E26DF60-F248-11E8-B48F-1D18A9856A87
last_name: Beattie
orcid: 0000-0002-8483-8753
- first_name: Fong K.
full_name: Wong, Fong K.
last_name: Wong
- first_name: Giovanni
full_name: Diana, Giovanni
last_name: Diana
- first_name: Eleni
full_name: Serafeimidou, Eleni
last_name: Serafeimidou
- first_name: Marian
full_name: Fernández-Otero, Marian
last_name: Fernández-Otero
- first_name: Carmen
full_name: Streicher, Carmen
id: 36BCB99C-F248-11E8-B48F-1D18A9856A87
last_name: Streicher
- first_name: Sebastian J.
full_name: Arnold, Sebastian J.
last_name: Arnold
- first_name: Martin
full_name: Meyer, Martin
last_name: Meyer
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Miguel
full_name: Maravall, Miguel
last_name: Maravall
- first_name: Oscar
full_name: Marín, Oscar
last_name: Marín
citation:
ama: Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors
underlie the assembly of neocortical cytoarchitecture. bioRxiv. doi:10.1101/494088
apa: Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou,
E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly
of neocortical cytoarchitecture. bioRxiv. Cold Spring Harbor Laboratory.
https://doi.org/10.1101/494088
chicago: Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni
Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor
Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” BioRxiv.
Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/494088.
ieee: A. Llorca et al., “Heterogeneous progenitor cell behaviors underlie
the assembly of neocortical cytoarchitecture,” bioRxiv. Cold Spring Harbor
Laboratory.
ista: Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero
M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous
progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture.
bioRxiv, 10.1101/494088.
mla: Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the
Assembly of Neocortical Cytoarchitecture.” BioRxiv, Cold Spring Harbor
Laboratory, doi:10.1101/494088.
short: A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou,
M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall,
O. Marín, BioRxiv (n.d.).
date_created: 2020-09-21T12:01:50Z
date_published: 2018-12-13T00:00:00Z
date_updated: 2021-01-12T08:20:00Z
day: '13'
department:
- _id: SiHi
doi: 10.1101/494088
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/494088
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
- _id: 264E56E2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02416
name: Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Heterogeneous progenitor cell behaviors underlie the assembly of neocortical
cytoarchitecture
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '86'
abstract:
- lang: eng
text: Responsiveness—the requirement that every request to a system be eventually
handled—is one of the fundamental liveness properties of a reactive system. Average
response time is a quantitative measure for the responsiveness requirement used
commonly in performance evaluation. We show how average response time can be computed
on state-transition graphs, on Markov chains, and on game graphs. In all three
cases, we give polynomial-time algorithms.
acknowledgement: 'This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein
Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund
(WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland
under grant 2014/15/D/ST6/04543.'
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh
M, Derler P, Sirjani M, eds. Principles of Modeling. Vol 10760. Springer;
2018:143-161. doi:10.1007/978-3-319-95246-8_9'
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average
response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles
of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average
Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia
Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,”
in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani,
Eds. Springer, 2018, pp. 143–161.
ista: 'Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time.
In: Principles of Modeling. LNCS, vol. 10760, 143–161.'
mla: Chatterjee, Krishnendu, et al. “Computing Average Response Time.” Principles
of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018,
pp. 143–61, doi:10.1007/978-3-319-95246-8_9.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani
(Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.
date_created: 2018-12-11T11:44:33Z
date_published: 2018-07-20T00:00:00Z
date_updated: 2021-01-12T08:20:14Z
day: '20'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-95246-8_9
ec_funded: 1
editor:
- first_name: Marten
full_name: Lohstroh, Marten
last_name: Lohstroh
- first_name: Patricia
full_name: Derler, Patricia
last_name: Derler
- first_name: Marjan
full_name: Sirjani, Marjan
last_name: Sirjani
file:
- access_level: open_access
checksum: 9995c6ce6957333baf616fc4f20be597
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T08:22:18Z
date_updated: 2020-07-14T12:48:14Z
file_id: '7053'
file_name: 2018_PrinciplesModeling_Chatterjee.pdf
file_size: 516307
relation: main_file
file_date_updated: 2020-07-14T12:48:14Z
has_accepted_license: '1'
intvolume: ' 10760'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 143 - 161
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Principles of Modeling
publication_status: published
publisher: Springer
publist_id: '7968'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computing average response time
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10760
year: '2018'
...
---
_id: '9229'
alternative_title:
- Molecular and cellular neuroscience
article_processing_charge: No
article_type: letter_note
author:
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
citation:
ama: Danzl JG. Diffraction-unlimited optical imaging for synaptic physiology. Opera
Medica et Physiologica. 2018;4(S1):11. doi:10.20388/omp2018.00s1.001
apa: Danzl, J. G. (2018). Diffraction-unlimited optical imaging for synaptic physiology.
Opera Medica et Physiologica. Lobachevsky State University of Nizhny Novgorod.
https://doi.org/10.20388/omp2018.00s1.001
chicago: Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.”
Opera Medica et Physiologica. Lobachevsky State University of Nizhny Novgorod,
2018. https://doi.org/10.20388/omp2018.00s1.001.
ieee: J. G. Danzl, “Diffraction-unlimited optical imaging for synaptic physiology,”
Opera Medica et Physiologica, vol. 4, no. S1. Lobachevsky State University
of Nizhny Novgorod, p. 11, 2018.
ista: Danzl JG. 2018. Diffraction-unlimited optical imaging for synaptic physiology.
Opera Medica et Physiologica. 4(S1), 11.
mla: Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.”
Opera Medica et Physiologica, vol. 4, no. S1, Lobachevsky State University
of Nizhny Novgorod, 2018, p. 11, doi:10.20388/omp2018.00s1.001.
short: J.G. Danzl, Opera Medica et Physiologica 4 (2018) 11.
date_created: 2021-03-07T23:01:25Z
date_published: 2018-06-30T00:00:00Z
date_updated: 2021-12-03T07:31:05Z
day: '30'
department:
- _id: JoDa
doi: 10.20388/omp2018.00s1.001
intvolume: ' 4'
issue: S1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://operamedphys.org/content/molecular-and-cellular-neuroscience
month: '06'
oa: 1
oa_version: Published Version
page: '11'
publication: Opera Medica et Physiologica
publication_identifier:
eissn:
- 2500-2295
issn:
- 2500-2287
publication_status: published
publisher: Lobachevsky State University of Nizhny Novgorod
quality_controlled: '1'
scopus_import: '1'
status: public
title: Diffraction-unlimited optical imaging for synaptic physiology
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 4
year: '2018'
...
---
_id: '6005'
abstract:
- lang: eng
text: Network games are widely used as a model for selfish resource-allocation problems.
In the classicalmodel, each player selects a path connecting her source and target
vertices. The cost of traversingan edge depends on theload; namely, number of
players that traverse it. Thus, it abstracts the factthat different users may
use a resource at different times and for different durations, which playsan important
role in determining the costs of the users in reality. For example, when transmittingpackets
in a communication network, routing traffic in a road network, or processing a
task in aproduction system, actual sharing and congestion of resources crucially
depends on time.In [13], we introducedtimed network games, which add a time component
to network games.Each vertexvin the network is associated with a cost function,
mapping the load onvto theprice that a player pays for staying invfor one time
unit with this load. Each edge in thenetwork is guarded by the time intervals
in which it can be traversed, which forces the players tospend time in the vertices.
In this work we significantly extend the way time can be referred toin timed network
games. In the model we study, the network is equipped withclocks, and, as intimed
automata, edges are guarded by constraints on the values of the clocks, and their
traversalmay involve a reset of some clocks. We argue that the stronger model
captures many realisticnetworks. The addition of clocks breaks the techniques
we developed in [13] and we developnew techniques in order to show that positive
results on classic network games carry over to thestronger timed setting.
alternative_title:
- LIPIcs
article_number: '23'
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.MFCS.2018.23'
apa: 'Avni, G., Guha, S., & Kupferman, O. (2018). Timed network games with clocks
(Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science,
Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.MFCS.2018.23'
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with
Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.MFCS.2018.23.
ieee: 'G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented
at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom,
2018, vol. 117.'
ista: 'Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS:
Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.'
mla: Avni, Guy, et al. Timed Network Games with Clocks. Vol. 117, 23, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.MFCS.2018.23.
short: G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018.
conference:
end_date: 2018-08-31
location: Liverpool, United Kingdom
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2018-08-27
date_created: 2019-02-14T14:12:09Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-02-23T14:02:58Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPICS.MFCS.2018.23
file:
- access_level: open_access
checksum: 41ab2ae9b63f5eb49fa995250c0ba128
content_type: application/pdf
creator: dernst
date_created: 2019-02-14T14:22:04Z
date_updated: 2020-07-14T12:47:15Z
file_id: '6007'
file_name: 2018_LIPIcs_Avni.pdf
file_size: 542889
relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
has_accepted_license: '1'
intvolume: ' 117'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication_identifier:
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '963'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Timed network games with clocks
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: 117
year: '2018'
...
---
_id: '315'
abstract:
- lang: eng
text: 'More than 100 years after Grigg’s influential analysis of species’ borders,
the causes of limits to species’ ranges still represent a puzzle that has never
been understood with clarity. The topic has become especially important recently
as many scientists have become interested in the potential for species’ ranges
to shift in response to climate change—and yet nearly all of those studies fail
to recognise or incorporate evolutionary genetics in a way that relates to theoretical
developments. I show that range margins can be understood based on just two measurable
parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and
(ii) the strength of genetic drift, which reduces genetic diversity. Together,
these two parameters define an ‘expansion threshold’: adaptation fails when genetic
drift reduces genetic diversity below that required for adaptation to a heterogeneous
environment. When the key parameters drop below this expansion threshold locally,
a sharp range margin forms. When they drop below this threshold throughout the
species’ range, adaptation collapses everywhere, resulting in either extinction
or formation of a fragmented metapopulation. Because the effects of dispersal
differ fundamentally with dimension, the second parameter—the strength of genetic
drift—is qualitatively different compared to a linear habitat. In two-dimensional
habitats, genetic drift becomes effectively independent of selection. It decreases
with ‘neighbourhood size’—the number of individuals accessible by dispersal within
one generation. Moreover, in contrast to earlier predictions, which neglected
evolution of genetic variance and/or stochasticity in two dimensions, dispersal
into small marginal populations aids adaptation. This is because the reduction
of both genetic and demographic stochasticity has a stronger effect than the cost
of dispersal through increased maladaptation. The expansion threshold thus provides
a novel, theoretically justified, and testable prediction for formation of the
range margin and collapse of the species’ range.'
article_number: e2005372
author:
- first_name: Jitka
full_name: Polechova, Jitka
id: 3BBFB084-F248-11E8-B48F-1D18A9856A87
last_name: Polechova
orcid: 0000-0003-0951-3112
citation:
ama: Polechova J. Is the sky the limit? On the expansion threshold of a species’
range. PLoS Biology. 2018;16(6). doi:10.1371/journal.pbio.2005372
apa: Polechova, J. (2018). Is the sky the limit? On the expansion threshold of a
species’ range. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2005372
chicago: Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of
a Species’ Range.” PLoS Biology. Public Library of Science, 2018. https://doi.org/10.1371/journal.pbio.2005372.
ieee: J. Polechova, “Is the sky the limit? On the expansion threshold of a species’
range,” PLoS Biology, vol. 16, no. 6. Public Library of Science, 2018.
ista: Polechova J. 2018. Is the sky the limit? On the expansion threshold of a species’
range. PLoS Biology. 16(6), e2005372.
mla: Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of a Species’
Range.” PLoS Biology, vol. 16, no. 6, e2005372, Public Library of Science,
2018, doi:10.1371/journal.pbio.2005372.
short: J. Polechova, PLoS Biology 16 (2018).
date_created: 2018-12-11T11:45:46Z
date_published: 2018-06-15T00:00:00Z
date_updated: 2023-02-23T14:10:16Z
day: '15'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1371/journal.pbio.2005372
file:
- access_level: open_access
checksum: 908c52751bba30c55ed36789e5e4c84d
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T08:30:03Z
date_updated: 2020-07-14T12:46:01Z
file_id: '5870'
file_name: 2017_PLOS_Polechova.pdf
file_size: 6968201
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 16'
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS Biology
publication_identifier:
issn:
- '15449173'
publication_status: published
publisher: Public Library of Science
publist_id: '7550'
quality_controlled: '1'
related_material:
record:
- id: '9839'
relation: research_data
status: public
scopus_import: 1
status: public
title: Is the sky the limit? On the expansion threshold of a species’ range
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: 16
year: '2018'
...
---
_id: '186'
abstract:
- lang: eng
text: 'A drawing of a graph on a surface is independently even if every pair of
nonadjacent edges in the drawing crosses an even number of times. The ℤ2-genus
of a graph G is the minimum g such that G has an independently even drawing on
the orientable surface of genus g. An unpublished result by Robertson and Seymour
implies that for every t, every graph of sufficiently large genus contains as
a minor a projective t × t grid or one of the following so-called t-Kuratowski
graphs: K3, t, or t copies of K5 or K3,3 sharing at most 2 common vertices. We
show that the ℤ2-genus of graphs in these families is unbounded in t; in fact,
equal to their genus. Together, this implies that the genus of a graph is bounded
from above by a function of its ℤ2-genus, solving a problem posed by Schaefer
and Štefankovič, and giving an approximate version of the Hanani-Tutte theorem
on orientable surfaces.'
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Jan
full_name: Kynčl, Jan
last_name: Kynčl
citation:
ama: 'Fulek R, Kynčl J. The ℤ2-Genus of Kuratowski minors. In: Vol 99. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2018:40.1-40.14. doi:10.4230/LIPIcs.SoCG.2018.40'
apa: 'Fulek, R., & Kynčl, J. (2018). The ℤ2-Genus of Kuratowski minors (Vol.
99, p. 40.1-40.14). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.40'
chicago: Fulek, Radoslav, and Jan Kynčl. “The ℤ2-Genus of Kuratowski Minors,” 99:40.1-40.14.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.40.
ieee: 'R. Fulek and J. Kynčl, “The ℤ2-Genus of Kuratowski minors,” presented at
the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99,
p. 40.1-40.14.'
ista: 'Fulek R, Kynčl J. 2018. The ℤ2-Genus of Kuratowski minors. SoCG: Symposium
on Computational Geometry, LIPIcs, vol. 99, 40.1-40.14.'
mla: Fulek, Radoslav, and Jan Kynčl. The ℤ2-Genus of Kuratowski Minors. Vol.
99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14, doi:10.4230/LIPIcs.SoCG.2018.40.
short: R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018, p. 40.1-40.14.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:05Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-08-14T12:43:51Z
day: '11'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.40
external_id:
arxiv:
- '1803.05085'
intvolume: ' 99'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.05085
month: '06'
oa: 1
oa_version: Submitted Version
page: 40.1 - 40.14
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7734'
quality_controlled: '1'
related_material:
record:
- id: '11593'
relation: later_version
status: public
scopus_import: '1'
status: public
title: The ℤ2-Genus of Kuratowski minors
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
_id: '433'
abstract:
- lang: eng
text: 'A thrackle is a graph drawn in the plane so that every pair of its edges
meet exactly once: either at a common end vertex or in a proper crossing. We prove
that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are
defined similarly, except that every pair of edges that do not share a vertex
are allowed to cross an odd number of times. It is also shown that the maximum
number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound
is best possible for infinitely many values of n.'
alternative_title:
- LNCS
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: János
full_name: Pach, János
last_name: Pach
citation:
ama: 'Fulek R, Pach J. Thrackles: An improved upper bound. In: Vol 10692. Springer;
2018:160-166. doi:10.1007/978-3-319-73915-1_14'
apa: 'Fulek, R., & Pach, J. (2018). Thrackles: An improved upper bound (Vol.
10692, pp. 160–166). Presented at the GD 2017: Graph Drawing and Network Visualization,
Boston, MA, United States: Springer. https://doi.org/10.1007/978-3-319-73915-1_14'
chicago: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound,”
10692:160–66. Springer, 2018. https://doi.org/10.1007/978-3-319-73915-1_14.'
ieee: 'R. Fulek and J. Pach, “Thrackles: An improved upper bound,” presented at
the GD 2017: Graph Drawing and Network Visualization, Boston, MA, United States,
2018, vol. 10692, pp. 160–166.'
ista: 'Fulek R, Pach J. 2018. Thrackles: An improved upper bound. GD 2017: Graph
Drawing and Network Visualization, LNCS, vol. 10692, 160–166.'
mla: 'Fulek, Radoslav, and János Pach. Thrackles: An Improved Upper Bound.
Vol. 10692, Springer, 2018, pp. 160–66, doi:10.1007/978-3-319-73915-1_14.'
short: R. Fulek, J. Pach, in:, Springer, 2018, pp. 160–166.
conference:
end_date: 2017-09-27
location: Boston, MA, United States
name: 'GD 2017: Graph Drawing and Network Visualization'
start_date: 201-09-25
date_created: 2018-12-11T11:46:27Z
date_published: 2018-01-21T00:00:00Z
date_updated: 2023-08-24T14:39:32Z
day: '21'
department:
- _id: UlWa
doi: 10.1007/978-3-319-73915-1_14
external_id:
arxiv:
- '1708.08037'
intvolume: ' 10692'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.08037
month: '01'
oa: 1
oa_version: Submitted Version
page: 160 - 166
publication_status: published
publisher: Springer
publist_id: '7390'
quality_controlled: '1'
related_material:
record:
- id: '5857'
relation: later_version
status: public
scopus_import: 1
status: public
title: 'Thrackles: An improved upper bound'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10692
year: '2018'
...
---
_id: '9837'
abstract:
- lang: eng
text: Both classical and recent studies suggest that chromosomal inversion polymorphisms
are important in adaptation and speciation. However, biases in discovery and reporting
of inversions make it difficult to assess their prevalence and biological importance.
Here, we use an approach based on linkage disequilibrium among markers genotyped
for samples collected across a transect between contrasting habitats to detect
chromosomal rearrangements de novo. We report 17 polymorphic rearrangements in
a single locality for the coastal marine snail, Littorina saxatilis. Patterns
of diversity in the field and of recombination in controlled crosses provide strong
evidence that at least the majority of these rearrangements are inversions. Most
show clinal changes in frequency between habitats, suggestive of divergent selection,
but only one appears to be fixed for different arrangements in the two habitats.
Consistent with widespread evidence for balancing selection on inversion polymorphisms,
we argue that a combination of heterosis and divergent selection can explain the
observed patterns and should be considered in other systems spanning environmental
gradients.
article_processing_charge: No
author:
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Pragya
full_name: Chaube, Pragya
last_name: Chaube
- first_name: Hernán E.
full_name: Morales, Hernán E.
last_name: Morales
- first_name: Tomas
full_name: Larsson, Tomas
last_name: Larsson
- first_name: Alan R.
full_name: Lemmon, Alan R.
last_name: Lemmon
- first_name: Emily M.
full_name: Lemmon, Emily M.
last_name: Lemmon
- first_name: Marina
full_name: Rafajlović, Marina
last_name: Rafajlović
- first_name: Marina
full_name: Panova, Marina
last_name: Panova
- first_name: Mark
full_name: Ravinet, Mark
last_name: Ravinet
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: 'Faria R, Chaube P, Morales HE, et al. Data from: Multiple chromosomal rearrangements
in a hybrid zone between Littorina saxatilis ecotypes. 2018. doi:10.5061/dryad.72cg113'
apa: 'Faria, R., Chaube, P., Morales, H. E., Larsson, T., Lemmon, A. R., Lemmon,
E. M., … Butlin, R. K. (2018). Data from: Multiple chromosomal rearrangements
in a hybrid zone between Littorina saxatilis ecotypes. Dryad. https://doi.org/10.5061/dryad.72cg113'
chicago: 'Faria, Rui, Pragya Chaube, Hernán E. Morales, Tomas Larsson, Alan R. Lemmon,
Emily M. Lemmon, Marina Rafajlović, et al. “Data from: Multiple Chromosomal Rearrangements
in a Hybrid Zone between Littorina Saxatilis Ecotypes.” Dryad, 2018. https://doi.org/10.5061/dryad.72cg113.'
ieee: 'R. Faria et al., “Data from: Multiple chromosomal rearrangements in
a hybrid zone between Littorina saxatilis ecotypes.” Dryad, 2018.'
ista: 'Faria R, Chaube P, Morales HE, Larsson T, Lemmon AR, Lemmon EM, Rafajlović
M, Panova M, Ravinet M, Johannesson K, Westram AM, Butlin RK. 2018. Data from:
Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis
ecotypes, Dryad, 10.5061/dryad.72cg113.'
mla: 'Faria, Rui, et al. Data from: Multiple Chromosomal Rearrangements in a
Hybrid Zone between Littorina Saxatilis Ecotypes. Dryad, 2018, doi:10.5061/dryad.72cg113.'
short: R. Faria, P. Chaube, H.E. Morales, T. Larsson, A.R. Lemmon, E.M. Lemmon,
M. Rafajlović, M. Panova, M. Ravinet, K. Johannesson, A.M. Westram, R.K. Butlin,
(2018).
date_created: 2021-08-09T12:46:39Z
date_published: 2018-10-09T00:00:00Z
date_updated: 2023-08-24T14:50:26Z
day: '09'
department:
- _id: NiBa
doi: 10.5061/dryad.72cg113
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.72cg113
month: '10'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '6095'
relation: used_in_publication
status: public
status: public
title: 'Data from: Multiple chromosomal rearrangements in a hybrid zone between Littorina
saxatilis ecotypes'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2018'
...
---
_id: '5457'
abstract:
- lang: eng
text: "We consider the problem of expected cost analysis over nondeterministic probabilistic
programs, which aims at automated methods for analyzing the resource-usage of
such programs. Previous approaches for this problem could only handle nonnegative
bounded costs. However, in many scenarios, such as queuing networks or analysis
of cryptocurrency protocols, both positive and negative costs are necessary and
the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient
approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic
probabilistic programs. Our approach can handle (a) general positive and negative
costs with bounded updates in variables; and (b) nonnegative costs with general
updates to variables. We show that several natural examples which could not be
handled by previous approaches are captured in our framework.\r\n\r\nMoreover,
our approach leads to an efficient polynomial-time algorithm, while no previous
approach for cost analysis of probabilistic programs could guarantee polynomial
runtime. Finally, we show the effectiveness of our approach by presenting experimental
results on a variety of programs, motivated by real-world applications, for which
we efficiently synthesize tight resource-usage bounds."
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
- first_name: '4'
full_name: Anonymous, 4
last_name: Anonymous
- first_name: '5'
full_name: Anonymous, 5
last_name: Anonymous
- first_name: '6'
full_name: Anonymous, 6
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4, Anonymous 5, Anonymous
6. Cost Analysis of Nondeterministic Probabilistic Programs. IST Austria;
2018.
apa: Anonymous, 1, Anonymous, 2, Anonymous, 3, Anonymous, 4, Anonymous, 5, &
Anonymous, 6. (2018). Cost analysis of nondeterministic probabilistic programs.
IST Austria.
chicago: Anonymous, 1, 2 Anonymous, 3 Anonymous, 4 Anonymous, 5 Anonymous, and 6
Anonymous. Cost Analysis of Nondeterministic Probabilistic Programs. IST
Austria, 2018.
ieee: 1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, 5 Anonymous, and 6 Anonymous,
Cost analysis of nondeterministic probabilistic programs. IST Austria,
2018.
ista: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4, Anonymous 5, Anonymous
6. 2018. Cost analysis of nondeterministic probabilistic programs, IST Austria,
27p.
mla: Anonymous, 1, et al. Cost Analysis of Nondeterministic Probabilistic Programs.
IST Austria, 2018.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, 5 Anonymous, 6 Anonymous,
Cost Analysis of Nondeterministic Probabilistic Programs, IST Austria, 2018.
date_created: 2018-12-12T11:39:26Z
date_published: 2018-11-11T00:00:00Z
date_updated: 2023-08-25T08:07:48Z
day: '11'
ddc:
- '000'
file:
- access_level: open_access
checksum: ba3adafd36fe200385ccda583063b9eb
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:32Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5493'
file_name: IST-2018-1066-v1+1_techreport.pdf
file_size: 4202966
relation: main_file
- access_level: closed
checksum: 6cf3a19164bb8e5048a9c8c84dfd9fa3
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:22:12Z
date_updated: 2020-07-14T12:47:00Z
file_id: '6402'
file_name: authors-names.txt
file_size: 322
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '27'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '1066'
related_material:
record:
- id: '6175'
relation: later_version
status: public
scopus_import: 1
status: public
title: Cost analysis of nondeterministic probabilistic programs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '10864'
abstract:
- lang: eng
text: We prove that every congruence distributive variety has directed Jónsson terms,
and every congruence modular variety has directed Gumm terms. The directed terms
we construct witness every case of absorption witnessed by the original Jónsson
or Gumm terms. This result is equivalent to a pair of claims about absorption
for admissible preorders in congruence distributive and congruence modular varieties,
respectively. For finite algebras, these absorption theorems have already seen
significant applications, but until now, it was not clear if the theorems hold
for general algebras as well. Our method also yields a novel proof of a result
by P. Lipparini about the existence of a chain of terms (which we call Pixley
terms) in varieties that are at the same time congruence distributive and k-permutable
for some k.
acknowledgement: The second author was supported by National Science Center grant
DEC-2011-/01/B/ST6/01006.
article_processing_charge: No
author:
- first_name: Alexandr
full_name: Kazda, Alexandr
id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
last_name: Kazda
- first_name: Marcin
full_name: Kozik, Marcin
last_name: Kozik
- first_name: Ralph
full_name: McKenzie, Ralph
last_name: McKenzie
- first_name: Matthew
full_name: Moore, Matthew
last_name: Moore
citation:
ama: 'Kazda A, Kozik M, McKenzie R, Moore M. Absorption and directed Jónsson terms.
In: Czelakowski J, ed. Don Pigozzi on Abstract Algebraic Logic, Universal Algebra,
and Computer Science. Vol 16. OCTR. Cham: Springer Nature; 2018:203-220. doi:10.1007/978-3-319-74772-9_7'
apa: 'Kazda, A., Kozik, M., McKenzie, R., & Moore, M. (2018). Absorption and
directed Jónsson terms. In J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic
Logic, Universal Algebra, and Computer Science (Vol. 16, pp. 203–220). Cham:
Springer Nature. https://doi.org/10.1007/978-3-319-74772-9_7'
chicago: 'Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption
and Directed Jónsson Terms.” In Don Pigozzi on Abstract Algebraic Logic, Universal
Algebra, and Computer Science, edited by J Czelakowski, 16:203–20. OCTR. Cham:
Springer Nature, 2018. https://doi.org/10.1007/978-3-319-74772-9_7.'
ieee: 'A. Kazda, M. Kozik, R. McKenzie, and M. Moore, “Absorption and directed Jónsson
terms,” in Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and
Computer Science, vol. 16, J. Czelakowski, Ed. Cham: Springer Nature, 2018,
pp. 203–220.'
ista: 'Kazda A, Kozik M, McKenzie R, Moore M. 2018.Absorption and directed Jónsson
terms. In: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer
Science. vol. 16, 203–220.'
mla: Kazda, Alexandr, et al. “Absorption and Directed Jónsson Terms.” Don Pigozzi
on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited
by J Czelakowski, vol. 16, Springer Nature, 2018, pp. 203–20, doi:10.1007/978-3-319-74772-9_7.
short: A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don
Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science,
Springer Nature, Cham, 2018, pp. 203–220.
date_created: 2022-03-18T10:30:32Z
date_published: 2018-03-21T00:00:00Z
date_updated: 2023-09-05T15:37:18Z
day: '21'
department:
- _id: VlKo
doi: 10.1007/978-3-319-74772-9_7
editor:
- first_name: J
full_name: Czelakowski, J
last_name: Czelakowski
external_id:
arxiv:
- '1502.01072'
intvolume: ' 16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.01072
month: '03'
oa: 1
oa_version: Preprint
page: 203-220
place: Cham
publication: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer
Science
publication_identifier:
eisbn:
- '9783319747729'
eissn:
- 2211-2766
isbn:
- '9783319747712'
issn:
- 2211-2758
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: OCTR
status: public
title: Absorption and directed Jónsson terms
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 16
year: '2018'
...
---
_id: '184'
abstract:
- lang: eng
text: We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial
complex is shellable is NP-hard, hence NP-complete. This resolves a question raised,
e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d
≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable
is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible
pure d-dimensional complexes.
acknowledgement: 'Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR:
38087RM) of Czech-French collaboration.'
alternative_title:
- Leibniz International Proceedings in Information, LIPIcs
author:
- first_name: Xavier
full_name: Goaoc, Xavier
last_name: Goaoc
- first_name: Pavel
full_name: Paták, Pavel
last_name: Paták
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:41:1-41:16.
doi:10.4230/LIPIcs.SoCG.2018.41'
apa: 'Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2018). Shellability
is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational
Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SoCG.2018.41'
chicago: Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner.
“Shellability Is NP-Complete,” 99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.41.
ieee: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability
is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest,
Hungary, 2018, vol. 99, p. 41:1-41:16.'
ista: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete.
SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in
Information, LIPIcs, vol. 99, 41:1-41:16.'
mla: Goaoc, Xavier, et al. Shellability Is NP-Complete. Vol. 99, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:10.4230/LIPIcs.SoCG.2018.41.
short: X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:04Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-06T11:10:57Z
day: '11'
ddc:
- '516'
- '000'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.41
file:
- access_level: open_access
checksum: d12bdd60f04a57307867704b5f930afd
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:35:02Z
date_updated: 2020-07-14T12:45:18Z
file_id: '5725'
file_name: 2018_LIPIcs_Goaoc.pdf
file_size: 718414
relation: main_file
file_date_updated: 2020-07-14T12:45:18Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 41:1 - 41:16
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7736'
quality_controlled: '1'
related_material:
record:
- id: '7108'
relation: later_version
status: public
scopus_import: 1
status: public
title: Shellability is NP-complete
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: 99
year: '2018'
...
---
_id: '285'
abstract:
- lang: eng
text: In graph theory, as well as in 3-manifold topology, there exist several width-type
parameters to describe how "simple" or "thin" a given graph
or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs,
or the concept of thin position for 3-manifolds, play an important role when studying
algorithmic problems; in particular, there is a variety of problems in computational
3-manifold topology - some of them known to be computationally hard in general
- that become solvable in polynomial time as soon as the dual graph of the input
triangulation has bounded treewidth. In view of these algorithmic results, it
is natural to ask whether every 3-manifold admits a triangulation of bounded treewidth.
We show that this is not the case, i.e., that there exists an infinite family
of closed 3-manifolds not admitting triangulations of bounded pathwidth or treewidth
(the latter implies the former, but we present two separate proofs). We derive
these results from work of Agol and of Scharlemann and Thompson, by exhibiting
explicit connections between the topology of a 3-manifold M on the one hand and
width-type parameters of the dual graphs of triangulations of M on the other hand,
answering a question that had been raised repeatedly by researchers in computational
3-manifold topology. In particular, we show that if a closed, orientable, irreducible,
non-Haken 3-manifold M has a triangulation of treewidth (resp. pathwidth) k then
the Heegaard genus of M is at most 48(k+1) (resp. 4(3k+1)).
acknowledgement: Research of the second author was supported by the Einstein Foundation
(project “Einstein Visiting Fellow Santos”) and by the Simons Foundation (“Simons
Visiting Professors” program).
alternative_title:
- LIPIcs
article_number: '46'
article_processing_charge: No
author:
- first_name: Kristóf
full_name: Huszár, Kristóf
id: 33C26278-F248-11E8-B48F-1D18A9856A87
last_name: Huszár
orcid: 0000-0002-5445-5057
- first_name: Jonathan
full_name: Spreer, Jonathan
last_name: Spreer
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Huszár K, Spreer J, Wagner U. On the treewidth of triangulated 3-manifolds.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.46'
apa: 'Huszár, K., Spreer, J., & Wagner, U. (2018). On the treewidth of triangulated
3-manifolds (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.46'
chicago: Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of
Triangulated 3-Manifolds,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.46.
ieee: 'K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,”
presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary,
2018, vol. 99.'
ista: 'Huszár K, Spreer J, Wagner U. 2018. On the treewidth of triangulated 3-manifolds.
SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 46.'
mla: Huszár, Kristóf, et al. On the Treewidth of Triangulated 3-Manifolds.
Vol. 99, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.46.
short: K. Huszár, J. Spreer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:37Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-06T11:13:41Z
day: '01'
ddc:
- '516'
- '000'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.46
external_id:
arxiv:
- '1712.00434'
file:
- access_level: open_access
checksum: 530d084116778135d5bffaa317479cac
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T15:32:38Z
date_updated: 2020-07-14T12:45:51Z
file_id: '5713'
file_name: 2018_LIPIcs_Huszar.pdf
file_size: 642522
relation: main_file
file_date_updated: 2020-07-14T12:45:51Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7614'
quality_controlled: '1'
related_material:
record:
- id: '7093'
relation: later_version
status: public
scopus_import: 1
status: public
title: On the treewidth of triangulated 3-manifolds
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: 99
year: '2018'
...
---
_id: '13059'
abstract:
- lang: eng
text: "This dataset contains a GitHub repository containing all the data, analysis,
Nextflow workflows and Jupyter notebooks to replicate the manuscript titled \"Fast
and accurate large multiple sequence alignments with a root-to-leaf regressive
method\".\r\nIt also contains the Multiple Sequence Alignments (MSAs) generated
and well as the main figures and tables from the manuscript.\r\nThe repository
is also available at GitHub (https://github.com/cbcrg/dpa-analysis) release `v1.2`.\r\nFor
details on how to use the regressive alignment algorithm, see the T-Coffee software
suite (https://github.com/cbcrg/tcoffee)."
article_processing_charge: No
author:
- first_name: Edgar
full_name: Garriga, Edgar
last_name: Garriga
- first_name: Paolo
full_name: di Tommaso, Paolo
last_name: di Tommaso
- first_name: Cedrik
full_name: Magis, Cedrik
last_name: Magis
- first_name: Ionas
full_name: Erb, Ionas
last_name: Erb
- first_name: Leila
full_name: Mansouri, Leila
last_name: Mansouri
- first_name: Athanasios
full_name: Baltzis, Athanasios
last_name: Baltzis
- first_name: Hafid
full_name: Laayouni, Hafid
last_name: Laayouni
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Evan
full_name: Floden, Evan
last_name: Floden
- first_name: Cedric
full_name: Notredame, Cedric
last_name: Notredame
citation:
ama: Garriga E, di Tommaso P, Magis C, et al. Fast and accurate large multiple sequence
alignments with a root-to-leaf regressive method. 2018. doi:10.5281/ZENODO.2025846
apa: Garriga, E., di Tommaso, P., Magis, C., Erb, I., Mansouri, L., Baltzis, A.,
… Notredame, C. (2018). Fast and accurate large multiple sequence alignments with
a root-to-leaf regressive method. Zenodo. https://doi.org/10.5281/ZENODO.2025846
chicago: Garriga, Edgar, Paolo di Tommaso, Cedrik Magis, Ionas Erb, Leila Mansouri,
Athanasios Baltzis, Hafid Laayouni, Fyodor Kondrashov, Evan Floden, and Cedric
Notredame. “Fast and Accurate Large Multiple Sequence Alignments with a Root-to-Leaf
Regressive Method.” Zenodo, 2018. https://doi.org/10.5281/ZENODO.2025846.
ieee: E. Garriga et al., “Fast and accurate large multiple sequence alignments
with a root-to-leaf regressive method.” Zenodo, 2018.
ista: Garriga E, di Tommaso P, Magis C, Erb I, Mansouri L, Baltzis A, Laayouni H,
Kondrashov F, Floden E, Notredame C. 2018. Fast and accurate large multiple sequence
alignments with a root-to-leaf regressive method, Zenodo, 10.5281/ZENODO.2025846.
mla: Garriga, Edgar, et al. Fast and Accurate Large Multiple Sequence Alignments
with a Root-to-Leaf Regressive Method. Zenodo, 2018, doi:10.5281/ZENODO.2025846.
short: E. Garriga, P. di Tommaso, C. Magis, I. Erb, L. Mansouri, A. Baltzis, H.
Laayouni, F. Kondrashov, E. Floden, C. Notredame, (2018).
date_created: 2023-05-23T16:08:20Z
date_published: 2018-12-07T00:00:00Z
date_updated: 2023-09-06T14:32:51Z
day: '07'
ddc:
- '570'
department:
- _id: FyKo
doi: 10.5281/ZENODO.2025846
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.3271452
month: '12'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '7181'
relation: used_in_publication
status: public
status: public
title: Fast and accurate large multiple sequence alignments with a root-to-leaf regressive
method
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '49'
abstract:
- lang: eng
text: Nowadays, quantum computation is receiving more and more attention as an alternative
to the classical way of computing. For realizing a quantum computer, different
devices are investigated as potential quantum bits. In this thesis, the focus
is on Ge hut wires, which turned out to be promising candidates for implementing
hole spin quantum bits. The advantages of Ge as a material system are the low
hyperfine interaction for holes and the strong spin orbit coupling, as well as
the compatibility with the highly developed CMOS processes in industry. In addition,
Ge can also be isotopically purified which is expected to boost the spin coherence
times. The strong spin orbit interaction for holes in Ge on the one hand enables
the full electrical control of the quantum bit and on the other hand should allow
short spin manipulation times. Starting with a bare Si wafer, this work covers
the entire process reaching from growth over the fabrication and characterization
of hut wire devices up to the demonstration of hole spin resonance. From experiments
with single quantum dots, a large g-factor anisotropy between the in-plane and
the out-of-plane direction was found. A comparison to a theoretical model unveiled
the heavy-hole character of the lowest energy states. The second part of the thesis
addresses double quantum dot devices, which were realized by adding two gate electrodes
to a hut wire. In such devices, Pauli spin blockade was observed, which can serve
as a read-out mechanism for spin quantum bits. Applying oscillating electric fields
in spin blockade allowed the demonstration of continuous spin rotations and the
extraction of a lower bound for the spin dephasing time. Despite the strong spin
orbit coupling in Ge, the obtained value for the dephasing time is comparable
to what has been recently reported for holes in Si. All in all, the presented
results point out the high potential of Ge hut wires as a platform for long-lived,
fast and fully electrically tunable hole spin quantum bits.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Hannes
full_name: Watzinger, Hannes
id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
last_name: Watzinger
citation:
ama: Watzinger H. Ge hut wires - from growth to hole spin resonance. 2018. doi:10.15479/AT:ISTA:th_1033
apa: Watzinger, H. (2018). Ge hut wires - from growth to hole spin resonance.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1033
chicago: Watzinger, Hannes. “Ge Hut Wires - from Growth to Hole Spin Resonance.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1033.
ieee: H. Watzinger, “Ge hut wires - from growth to hole spin resonance,” Institute
of Science and Technology Austria, 2018.
ista: Watzinger H. 2018. Ge hut wires - from growth to hole spin resonance. Institute
of Science and Technology Austria.
mla: Watzinger, Hannes. Ge Hut Wires - from Growth to Hole Spin Resonance.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1033.
short: H. Watzinger, Ge Hut Wires - from Growth to Hole Spin Resonance, Institute
of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:44:21Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2023-09-07T12:27:43Z
day: '30'
ddc:
- '530'
degree_awarded: PhD
department:
- _id: GeKa
doi: 10.15479/AT:ISTA:th_1033
file:
- access_level: open_access
checksum: b653b5216251f938ddbeafd1de88667c
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:13:28Z
date_updated: 2020-07-14T12:46:35Z
file_id: '6249'
file_name: 2018_Thesis_Watzinger.pdf
file_size: 85539748
relation: main_file
- access_level: closed
checksum: 39bcf8de7ac5b1bb516b11ce2f966785
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:13:27Z
date_updated: 2020-07-14T12:46:35Z
file_id: '6250'
file_name: 2018_Thesis_Watzinger_source.zip
file_size: 21830697
relation: source_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '77'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '8005'
pubrep_id: '1033'
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: Ge hut wires - from growth to hole spin resonance
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: '201'
abstract:
- lang: eng
text: 'We describe arrangements of three-dimensional spheres from a geometrical
and topological point of view. Real data (fitting this setup) often consist of
soft spheres which show certain degree of deformation while strongly packing against
each other. In this context, we answer the following questions: If we model a
soft packing of spheres by hard spheres that are allowed to overlap, can we measure
the volume in the overlapped areas? Can we be more specific about the overlap
volume, i.e. quantify how much volume is there covered exactly twice, three times,
or k times? What would be a good optimization criteria that rule the arrangement
of soft spheres while making a good use of the available space? Fixing a particular
criterion, what would be the optimal sphere configuration? The first result of
this thesis are short formulas for the computation of volumes covered by at least
k of the balls. The formulas exploit information contained in the order-k Voronoi
diagrams and its closely related Level-k complex. The used complexes lead to a
natural generalization into poset diagrams, a theoretical formalism that contains
the order-k and degree-k diagrams as special cases. In parallel, we define different
criteria to determine what could be considered an optimal arrangement from a geometrical
point of view. Fixing a criterion, we find optimal soft packing configurations
in 2D and 3D where the ball centers lie on a lattice. As a last step, we use tools
from computational topology on real physical data, to show the potentials of higher-order
diagrams in the description of melting crystals. The results of the experiments
leaves us with an open window to apply the theories developed in this thesis in
real applications.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Mabel
full_name: Iglesias Ham, Mabel
id: 41B58C0C-F248-11E8-B48F-1D18A9856A87
last_name: Iglesias Ham
citation:
ama: Iglesias Ham M. Multiple covers with balls. 2018. doi:10.15479/AT:ISTA:th_1026
apa: Iglesias Ham, M. (2018). Multiple covers with balls. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1026
chicago: Iglesias Ham, Mabel. “Multiple Covers with Balls.” Institute of Science
and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1026.
ieee: M. Iglesias Ham, “Multiple covers with balls,” Institute of Science and Technology
Austria, 2018.
ista: Iglesias Ham M. 2018. Multiple covers with balls. Institute of Science and
Technology Austria.
mla: Iglesias Ham, Mabel. Multiple Covers with Balls. Institute of Science
and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1026.
short: M. Iglesias Ham, Multiple Covers with Balls, Institute of Science and Technology
Austria, 2018.
date_created: 2018-12-11T11:45:10Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-07T12:25:32Z
day: '11'
ddc:
- '514'
- '516'
degree_awarded: PhD
department:
- _id: HeEd
doi: 10.15479/AT:ISTA:th_1026
file:
- access_level: closed
checksum: dd699303623e96d1478a6ae07210dd05
content_type: application/zip
creator: kschuh
date_created: 2019-02-05T07:43:31Z
date_updated: 2020-07-14T12:45:24Z
file_id: '5918'
file_name: IST-2018-1025-v2+5_ist-thesis-iglesias-11June2018(1).zip
file_size: 11827713
relation: source_file
- access_level: open_access
checksum: ba163849a190d2b41d66fef0e4983294
content_type: application/pdf
creator: kschuh
date_created: 2019-02-05T07:43:45Z
date_updated: 2020-07-14T12:45:24Z
file_id: '5919'
file_name: IST-2018-1025-v2+4_ThesisIglesiasFinal11June2018.pdf
file_size: 4783846
relation: main_file
file_date_updated: 2020-07-14T12:45:24Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '171'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7712'
pubrep_id: '1026'
status: public
supervisor:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
title: Multiple covers with balls
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...