--- _id: '6831' abstract: - lang: eng text: "* Understanding the mechanisms causing phenotypic differences between females and males has long fascinated evolutionary biologists. An extensive literature exists on animal sexual dimorphism but less information is known about sex differences in plants, particularly the extent of geographical variation in sexual dimorphism and its life‐cycle dynamics.\r\n* Here, we investigated patterns of genetically based sexual dimorphism in vegetative and reproductive traits of a wind‐pollinated dioecious plant, Rumex hastatulus, across three life‐cycle stages using open‐pollinated families from 30 populations spanning the geographic range and chromosomal variation (XY and XY1Y2) of the species.\r\n* The direction and degree of sexual dimorphism was highly variable among populations and life‐cycle stages. Sex‐specific differences in reproductive function explained a significant amount of temporal change in sexual dimorphism. For several traits, geographical variation in sexual dimorphism was associated with bioclimatic parameters, likely due to the differential responses of the sexes to climate. We found no systematic differences in sexual dimorphism between chromosome races.\r\n* Sex‐specific trait differences in dioecious plants largely result from a balance between sexual and natural selection on resource allocation. Our results indicate that abiotic factors associated with geographical context also play a role in modifying sexual dimorphism during the plant life‐cycle." article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Gemma full_name: Puixeu Sala, Gemma id: 33AB266C-F248-11E8-B48F-1D18A9856A87 last_name: Puixeu Sala orcid: 0000-0001-8330-1754 - first_name: Melinda full_name: Pickup, Melinda id: 2C78037E-F248-11E8-B48F-1D18A9856A87 last_name: Pickup orcid: 0000-0001-6118-0541 - first_name: David full_name: Field, David last_name: Field orcid: 0000-0002-4014-8478 - first_name: Spencer C.H. full_name: Barrett, Spencer C.H. last_name: Barrett citation: ama: 'Puixeu Sala G, Pickup M, Field D, Barrett SCH. Variation in sexual dimorphism in a wind-pollinated plant: The influence of geographical context and life-cycle dynamics. New Phytologist. 2019;224(3):1108-1120. doi:10.1111/nph.16050' apa: 'Puixeu Sala, G., Pickup, M., Field, D., & Barrett, S. C. H. (2019). Variation in sexual dimorphism in a wind-pollinated plant: The influence of geographical context and life-cycle dynamics. New Phytologist. Wiley. https://doi.org/10.1111/nph.16050' chicago: 'Puixeu Sala, Gemma, Melinda Pickup, David Field, and Spencer C.H. Barrett. “Variation in Sexual Dimorphism in a Wind-Pollinated Plant: The Influence of Geographical Context and Life-Cycle Dynamics.” New Phytologist. Wiley, 2019. https://doi.org/10.1111/nph.16050.' ieee: 'G. Puixeu Sala, M. Pickup, D. Field, and S. C. H. Barrett, “Variation in sexual dimorphism in a wind-pollinated plant: The influence of geographical context and life-cycle dynamics,” New Phytologist, vol. 224, no. 3. Wiley, pp. 1108–1120, 2019.' ista: 'Puixeu Sala G, Pickup M, Field D, Barrett SCH. 2019. Variation in sexual dimorphism in a wind-pollinated plant: The influence of geographical context and life-cycle dynamics. New Phytologist. 224(3), 1108–1120.' mla: 'Puixeu Sala, Gemma, et al. “Variation in Sexual Dimorphism in a Wind-Pollinated Plant: The Influence of Geographical Context and Life-Cycle Dynamics.” New Phytologist, vol. 224, no. 3, Wiley, 2019, pp. 1108–20, doi:10.1111/nph.16050.' short: G. Puixeu Sala, M. Pickup, D. Field, S.C.H. Barrett, New Phytologist 224 (2019) 1108–1120. corr_author: '1' date_created: 2019-08-25T22:00:51Z date_published: 2019-11-01T00:00:00Z date_updated: 2026-04-07T13:25:33Z day: '01' ddc: - '570' department: - _id: NiBa - _id: BeVi doi: 10.1111/nph.16050 ec_funded: 1 external_id: isi: - '000481376500001' file: - access_level: open_access checksum: 6370e7567d96b7b562e77d8b89653f80 content_type: application/pdf creator: apreinsp date_created: 2019-08-27T12:44:54Z date_updated: 2020-07-14T12:47:42Z file_id: '6833' file_name: 2019_NewPhytologist_Puixeu.pdf file_size: 2314016 relation: main_file file_date_updated: 2020-07-14T12:47:42Z has_accepted_license: '1' intvolume: ' 224' isi: 1 issue: '3' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 1108-1120 project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: New Phytologist publication_identifier: eissn: - 1469-8137 publication_status: published publisher: Wiley quality_controlled: '1' related_material: record: - id: '9803' relation: research_data status: public - id: '14058' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Variation in sexual dimorphism in a wind-pollinated plant: The influence of geographical context and life-cycle dynamics' 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 224 year: '2019' ... --- _id: '9803' abstract: - lang: eng text: Understanding the mechanisms causing phenotypic differences between females and males has long fascinated evolutionary biologists. An extensive literature exists on animal sexual dimorphism but less is known about sex differences in plants, particularly the extent of geographical variation in sexual dimorphism and its life-cycle dynamics. Here, we investigate patterns of genetically-based sexual dimorphism in vegetative and reproductive traits of a wind-pollinated dioecious plant, Rumex hastatulus, across three life-cycle stages using open-pollinated families from 30 populations spanning the geographic range and chromosomal variation (XY and XY1Y2) of the species. The direction and degree of sexual dimorphism was highly variable among populations and life-cycle stages. Sex-specific differences in reproductive function explained a significant amount of temporal change in sexual dimorphism. For several traits, geographical variation in sexual dimorphism was associated with bioclimatic parameters, likely due to the differential responses of the sexes to climate. We found no systematic differences in sexual dimorphism between chromosome races. Sex-specific trait differences in dioecious plants largely result from a balance between sexual and natural selection on resource allocation. Our results indicate that abiotic factors associated with geographical context also play a role in modifying sexual dimorphism during the plant life cycle. article_processing_charge: No author: - first_name: Gemma full_name: Puixeu Sala, Gemma id: 33AB266C-F248-11E8-B48F-1D18A9856A87 last_name: Puixeu Sala orcid: 0000-0001-8330-1754 - first_name: Melinda full_name: Pickup, Melinda id: 2C78037E-F248-11E8-B48F-1D18A9856A87 last_name: Pickup orcid: 0000-0001-6118-0541 - first_name: David full_name: Field, David last_name: Field - first_name: Spencer C.H. full_name: Barrett, Spencer C.H. last_name: Barrett citation: ama: 'Puixeu Sala G, Pickup M, Field D, Barrett SCH. Data from: Variation in sexual dimorphism in a wind-pollinated plant: the influence of geographical context and life-cycle dynamics. 2019. doi:10.5061/dryad.n1701c9' apa: 'Puixeu Sala, G., Pickup, M., Field, D., & Barrett, S. C. H. (2019). Data from: Variation in sexual dimorphism in a wind-pollinated plant: the influence of geographical context and life-cycle dynamics. Dryad. https://doi.org/10.5061/dryad.n1701c9' chicago: 'Puixeu Sala, Gemma, Melinda Pickup, David Field, and Spencer C.H. Barrett. “Data from: Variation in Sexual Dimorphism in a Wind-Pollinated Plant: The Influence of Geographical Context and Life-Cycle Dynamics.” Dryad, 2019. https://doi.org/10.5061/dryad.n1701c9.' ieee: 'G. Puixeu Sala, M. Pickup, D. Field, and S. C. H. Barrett, “Data from: Variation in sexual dimorphism in a wind-pollinated plant: the influence of geographical context and life-cycle dynamics.” Dryad, 2019.' ista: 'Puixeu Sala G, Pickup M, Field D, Barrett SCH. 2019. Data from: Variation in sexual dimorphism in a wind-pollinated plant: the influence of geographical context and life-cycle dynamics, Dryad, 10.5061/dryad.n1701c9.' mla: 'Puixeu Sala, Gemma, et al. Data from: Variation in Sexual Dimorphism in a Wind-Pollinated Plant: The Influence of Geographical Context and Life-Cycle Dynamics. Dryad, 2019, doi:10.5061/dryad.n1701c9.' short: G. Puixeu Sala, M. Pickup, D. Field, S.C.H. Barrett, (2019). date_created: 2021-08-06T11:48:42Z date_published: 2019-07-22T00:00:00Z date_updated: 2026-04-07T13:25:33Z day: '22' department: - _id: NiBa - _id: BeVi doi: 10.5061/dryad.n1701c9 main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.n1701c9 month: '07' oa: 1 oa_version: Published Version publisher: Dryad related_material: record: - id: '6831' relation: used_in_publication status: public - id: '14058' relation: used_in_publication status: public status: public title: 'Data from: Variation in sexual dimorphism in a wind-pollinated plant: the influence of geographical context and life-cycle dynamics' type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2019' ... --- _id: '6590' abstract: - lang: eng text: 'Modern machine learning methods often require more data for training than a single expert can provide. Therefore, it has become a standard procedure to collect data from external sources, e.g. via crowdsourcing. Unfortunately, the quality of these sources is not always guaranteed. As additional complications, the data might be stored in a distributed way, or might even have to remain private. In this work, we address the question of how to learn robustly in such scenarios. Studying the problem through the lens of statistical learning theory, we derive a procedure that allows for learning from all available sources, yet automatically suppresses irrelevant or corrupted data. We show by extensive experiments that our method provides significant improvements over alternative approaches from robust statistics and distributed optimization. ' article_processing_charge: No arxiv: 1 author: - first_name: Nikola H full_name: Konstantinov, Nikola H id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87 last_name: Konstantinov orcid: 0009-0009-5204-7621 - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Konstantinov NH, Lampert C. Robust learning from untrusted sources. In: Proceedings of the 36th International Conference on Machine Learning. Vol 97. ML Research Press; 2019:3488-3498.' apa: 'Konstantinov, N. H., & Lampert, C. (2019). Robust learning from untrusted sources. In Proceedings of the 36th International Conference on Machine Learning (Vol. 97, pp. 3488–3498). Long Beach, CA, USA: ML Research Press.' chicago: Konstantinov, Nikola H, and Christoph Lampert. “Robust Learning from Untrusted Sources.” In Proceedings of the 36th International Conference on Machine Learning, 97:3488–98. ML Research Press, 2019. ieee: N. H. Konstantinov and C. Lampert, “Robust learning from untrusted sources,” in Proceedings of the 36th International Conference on Machine Learning, Long Beach, CA, USA, 2019, vol. 97, pp. 3488–3498. ista: 'Konstantinov NH, Lampert C. 2019. Robust learning from untrusted sources. Proceedings of the 36th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 97, 3488–3498.' mla: Konstantinov, Nikola H., and Christoph Lampert. “Robust Learning from Untrusted Sources.” Proceedings of the 36th International Conference on Machine Learning, vol. 97, ML Research Press, 2019, pp. 3488–98. short: N.H. Konstantinov, C. Lampert, in:, Proceedings of the 36th International Conference on Machine Learning, ML Research Press, 2019, pp. 3488–3498. conference: end_date: 2919-06-15 location: Long Beach, CA, USA name: 'ICML: International Conference on Machine Learning' start_date: 2019-06-10 date_created: 2019-06-27T14:18:23Z date_published: 2019-06-01T00:00:00Z date_updated: 2026-04-07T14:19:48Z day: '01' department: - _id: ChLa ec_funded: 1 external_id: arxiv: - '1901.10310' intvolume: ' 97' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1901.10310 month: '06' oa: 1 oa_version: Preprint page: 3488-3498 project: - _id: 2532554C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '308036' name: Lifelong Learning of Visual Scene Understanding - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: Proceedings of the 36th International Conference on Machine Learning publication_status: published publisher: ML Research Press quality_controlled: '1' related_material: record: - id: '10799' relation: dissertation_contains status: public scopus_import: '1' status: public title: Robust learning from untrusted sources type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 97 year: '2019' ... --- OA_place: publisher OA_type: hybrid _id: '10190' abstract: - lang: eng text: 'The verification of concurrent programs remains an open challenge, as thread interaction has to be accounted for, which leads to state-space explosion. Stateless model checking battles this problem by exploring traces rather than states of the program. As there are exponentially many traces, dynamic partial-order reduction (DPOR) techniques are used to partition the trace space into equivalence classes, and explore a few representatives from each class. The standard equivalence that underlies most DPOR techniques is the happens-before equivalence, however recent works have spawned a vivid interest towards coarser equivalences. The efficiency of such approaches is a product of two parameters: (i) the size of the partitioning induced by the equivalence, and (ii) the time spent by the exploration algorithm in each class of the partitioning. In this work, we present a new equivalence, called value-happens-before and show that it has two appealing features. First, value-happens-before is always at least as coarse as the happens-before equivalence, and can be even exponentially coarser. Second, the value-happens-before partitioning is efficiently explorable when the number of threads is bounded. We present an algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning using polynomial time per class. Finally, we perform an experimental evaluation of VCDPOR on various benchmarks, and compare it against other state-of-the-art approaches. Our results show that value-happens-before typically induces a significant reduction in the size of the underlying partitioning, which leads to a considerable reduction in the running time for exploring the whole partitioning.' acknowledgement: "The authors would also like to thank anonymous referees for their valuable comments and helpful suggestions. This work is supported by the Austrian Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE), by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian Science Fund (FWF) Schrodinger grant J-4220.\r\n" article_number: '124' article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: 'Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order reduction. In: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. Vol 3. ACM; 2019. doi:10.1145/3360550' apa: 'Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic partial order reduction. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360550' chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550. ieee: K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial order reduction,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Athens, Greece, 2019, vol. 3. ista: 'Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 124.' mla: Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550. short: K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, ACM, 2019. conference: end_date: 2019-10-25 location: Athens, Greece name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications' start_date: 2019-10-23 corr_author: '1' date_created: 2021-10-27T14:57:06Z date_published: 2019-10-10T00:00:00Z date_updated: 2026-04-08T07:00:31Z day: '10' ddc: - '000' department: - _id: GradSch - _id: KrCh doi: 10.1145/3360550 external_id: arxiv: - '1909.00989' file: - access_level: open_access checksum: 2149979c46964c4d117af06ccb6c0834 content_type: application/pdf creator: cchlebak date_created: 2021-11-12T11:41:56Z date_updated: 2021-11-12T11:41:56Z file_id: '10278' file_name: 2019_ACM_Chatterjee.pdf file_size: 570829 relation: main_file success: 1 file_date_updated: 2021-11-12T11:41:56Z has_accepted_license: '1' intvolume: ' 3' keyword: - safety - risk - reliability and quality - software language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms publication: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications publication_identifier: eissn: - 2475-1421 publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '10199' relation: dissertation_contains status: public scopus_import: '1' status: public title: Value-centric dynamic partial order reduction 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: 3 year: '2019' ... --- _id: '6673' abstract: - lang: eng text: Several classic problems in graph processing and computational geometry are solved via incremental algorithms, which split computation into a series of small tasks acting on shared state, which gets updated progressively. While the sequential variant of such algorithms usually specifies a fixed (but sometimes random) order in which the tasks should be performed, a standard approach to parallelizing such algorithms is to relax this constraint to allow for out-of-order parallel execution. This is the case for parallel implementations of Dijkstra's single-source shortest-paths (SSSP) algorithm, and for parallel Delaunay mesh triangulation. While many software frameworks parallelize incremental computation in this way, it is still not well understood whether this relaxed ordering approach can still provide any complexity guarantees. In this paper, we address this problem, and analyze the efficiency guarantees provided by a range of incremental algorithms when parallelized via relaxed schedulers. We show that, for algorithms such as Delaunay mesh triangulation and sorting by insertion, schedulers with a maximum relaxation factor of k in terms of the maximum priority inversion allowed will introduce a maximum amount of wasted work of O(łog n poly(k)), where n is the number of tasks to be executed. For SSSP, we show that the additional work is O(poly(k), dmax / wmin), where dmax is the maximum distance between two nodes, and wmin is the minimum such distance. In practical settings where n >> k, this suggests that the overheads of relaxation will be outweighed by the improved scalability of the relaxed scheduler. On the negative side, we provide lower bounds showing that certain algorithms will inherently incur a non-trivial amount of wasted work due to scheduler relaxation, even for relatively benign relaxed schedulers. article_processing_charge: No arxiv: 1 author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Giorgi full_name: Nadiradze, Giorgi id: 3279A00C-F248-11E8-B48F-1D18A9856A87 last_name: Nadiradze orcid: 0000-0001-5634-0731 - first_name: Nikita full_name: Koval, Nikita id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87 last_name: Koval citation: ama: 'Alistarh D-A, Nadiradze G, Koval N. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In: 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM; 2019:145-154. doi:10.1145/3323165.3323201' apa: 'Alistarh, D.-A., Nadiradze, G., & Koval, N. (2019). Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 145–154). Phoenix, AZ, United States: ACM. https://doi.org/10.1145/3323165.3323201' chicago: Alistarh, Dan-Adrian, Giorgi Nadiradze, and Nikita Koval. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” In 31st ACM Symposium on Parallelism in Algorithms and Architectures, 145–54. ACM, 2019. https://doi.org/10.1145/3323165.3323201. ieee: D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019, pp. 145–154. ista: 'Alistarh D-A, Nadiradze G, Koval N. 2019. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. 31st ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 145–154.' mla: Alistarh, Dan-Adrian, et al. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 145–54, doi:10.1145/3323165.3323201. short: D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 145–154. conference: end_date: 2019-06-24 location: Phoenix, AZ, United States name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures' start_date: 2019-06-22 date_created: 2019-07-24T08:59:36Z date_published: 2019-06-01T00:00:00Z date_updated: 2026-04-08T07:00:45Z day: '01' department: - _id: DaAl doi: 10.1145/3323165.3323201 ec_funded: 1 external_id: arxiv: - '2003.09363' isi: - '000507618500018' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2003.09363 month: '06' oa: 1 oa_version: Preprint page: 145-154 project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: 31st ACM Symposium on Parallelism in Algorithms and Architectures publication_identifier: isbn: - '9781450361842' publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '10429' relation: dissertation_contains status: public scopus_import: '1' status: public title: Efficiency guarantees for parallel incremental algorithms under relaxed schedulers type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '7479' abstract: - lang: eng text: "Multi-exit architectures, in which a stack of processing layers is interleaved with early output layers, allow the processing of a test example to stop early and thus save computation time and/or energy. In this work, we propose a new training procedure for multi-exit architectures based on the principle of knowledge distillation. The method encourage searly exits to mimic later, more accurate exits, by matching their output probabilities.\r\nExperiments on CIFAR100 and \ ImageNet show that distillation-based training significantly improves the accuracy of early exits while maintaining state-of-the-art accuracy for late \ ones. The method is particularly beneficial when training data is limited \ and it allows a straightforward extension to semi-supervised learning,i.e. making use of unlabeled data at training time. Moreover, it takes only afew lines to implement and incurs almost no computational overhead at training time, and none at all at test time." article_processing_charge: No author: - first_name: Phuong full_name: Bui Thi Mai, Phuong id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87 last_name: Bui Thi Mai - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Phuong M, Lampert C. Distillation-based training for multi-exit architectures. In: IEEE International Conference on Computer Vision. Vol 2019-October. IEEE; 2019:1355-1364. doi:10.1109/ICCV.2019.00144' apa: 'Phuong, M., & Lampert, C. (2019). Distillation-based training for multi-exit architectures. In IEEE International Conference on Computer Vision (Vol. 2019–October, pp. 1355–1364). Seoul, Korea: IEEE. https://doi.org/10.1109/ICCV.2019.00144' chicago: Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit Architectures.” In IEEE International Conference on Computer Vision, 2019–October:1355–64. IEEE, 2019. https://doi.org/10.1109/ICCV.2019.00144. ieee: M. Phuong and C. Lampert, “Distillation-based training for multi-exit architectures,” in IEEE International Conference on Computer Vision, Seoul, Korea, 2019, vol. 2019–October, pp. 1355–1364. ista: 'Phuong M, Lampert C. 2019. Distillation-based training for multi-exit architectures. IEEE International Conference on Computer Vision. ICCV: International Conference on Computer Vision vol. 2019–October, 1355–1364.' mla: Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit Architectures.” IEEE International Conference on Computer Vision, vol. 2019–October, IEEE, 2019, pp. 1355–64, doi:10.1109/ICCV.2019.00144. short: M. Phuong, C. Lampert, in:, IEEE International Conference on Computer Vision, IEEE, 2019, pp. 1355–1364. conference: end_date: 2019-11-02 location: Seoul, Korea name: 'ICCV: International Conference on Computer Vision' start_date: 2019-10-27 date_created: 2020-02-11T09:06:57Z date_published: 2019-10-01T00:00:00Z date_updated: 2026-04-08T07:01:16Z day: '01' ddc: - '000' department: - _id: ChLa doi: 10.1109/ICCV.2019.00144 ec_funded: 1 external_id: isi: - '000531438101047' file: - access_level: open_access checksum: 7b77fb5c2d27c4c37a7612ba46a66117 content_type: application/pdf creator: bphuong date_created: 2020-02-11T09:06:39Z date_updated: 2020-07-14T12:47:59Z file_id: '7480' file_name: main.pdf file_size: 735768 relation: main_file file_date_updated: 2020-07-14T12:47:59Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 1355-1364 project: - _id: 2532554C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '308036' name: Lifelong Learning of Visual Scene Understanding publication: IEEE International Conference on Computer Vision publication_identifier: isbn: - '9781728148038' issn: - 1550-5499 publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '9418' relation: dissertation_contains status: public scopus_import: '1' status: public title: Distillation-based training for multi-exit architectures type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2019-October year: '2019' ... --- _id: '6556' abstract: - lang: eng text: 'Motivated by fixed-parameter tractable (FPT) problems in computational topology, we consider the treewidth tw(M) of a compact, connected 3-manifold M, defined to be the minimum treewidth of the face pairing graph of any triangulation T of M. In this setting the relationship between the topology of a 3-manifold and its treewidth is of particular interest. First, as a corollary of work of Jaco and Rubinstein, we prove that for any closed, orientable 3-manifold M the treewidth tw(M) is at most 4g(M)-2, where g(M) denotes Heegaard genus of M. In combination with our earlier work with Wagner, this yields that for non-Haken manifolds the Heegaard genus and the treewidth are within a constant factor. Second, we characterize all 3-manifolds of treewidth one: These are precisely the lens spaces and a single other Seifert fibered space. Furthermore, we show that all remaining orientable Seifert fibered spaces over the 2-sphere or a non-orientable surface have treewidth two. In particular, for every spherical 3-manifold we exhibit a triangulation of treewidth at most two. Our results further validate the parameter of treewidth (and other related parameters such as cutwidth or congestion) to be useful for topological computing, and also shed more light on the scope of existing FPT-algorithms in the field.' alternative_title: - LIPIcs article_processing_charge: No arxiv: 1 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 citation: ama: 'Huszár K, Spreer J. 3-manifold triangulations with small treewidth. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:44:1-44:20. doi:10.4230/LIPIcs.SoCG.2019.44' apa: 'Huszár, K., & Spreer, J. (2019). 3-manifold triangulations with small treewidth. In 35th International Symposium on Computational Geometry (Vol. 129, p. 44:1-44:20). Portland, Oregon, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2019.44' chicago: Huszár, Kristóf, and Jonathan Spreer. “3-Manifold Triangulations with Small Treewidth.” In 35th International Symposium on Computational Geometry, 129:44:1-44:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPIcs.SoCG.2019.44. ieee: K. Huszár and J. Spreer, “3-manifold triangulations with small treewidth,” in 35th International Symposium on Computational Geometry, Portland, Oregon, United States, 2019, vol. 129, p. 44:1-44:20. ista: 'Huszár K, Spreer J. 2019. 3-manifold triangulations with small treewidth. 35th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 44:1-44:20.' mla: Huszár, Kristóf, and Jonathan Spreer. “3-Manifold Triangulations with Small Treewidth.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20, doi:10.4230/LIPIcs.SoCG.2019.44. short: K. Huszár, J. Spreer, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20. conference: end_date: 2019-06-21 location: Portland, Oregon, United States name: 'SoCG: Symposium on Computational Geometry' start_date: 2019-06-18 corr_author: '1' date_created: 2019-06-11T20:09:57Z date_published: 2019-06-01T00:00:00Z date_updated: 2026-04-08T07:21:27Z day: '01' ddc: - '516' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2019.44 external_id: arxiv: - '1812.05528' file: - access_level: open_access checksum: 29d18c435368468aa85823dabb157e43 content_type: application/pdf creator: kschuh date_created: 2019-06-12T06:45:33Z date_updated: 2020-07-14T12:47:33Z file_id: '6557' file_name: 2019_LIPIcs-Huszar.pdf file_size: 905885 relation: main_file file_date_updated: 2020-07-14T12:47:33Z has_accepted_license: '1' intvolume: ' 129' keyword: - computational 3-manifold topology - fixed-parameter tractability - layered triangulations - structural graph theory - treewidth - cutwidth - Heegaard genus language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 44:1-44:20 publication: 35th International Symposium on Computational Geometry publication_identifier: isbn: - 978-3-95977-104-7 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '8032' relation: part_of_dissertation status: public scopus_import: '1' status: public title: 3-manifold triangulations with small treewidth 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: '5986' abstract: - lang: eng text: "Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the first triangulation and edge f has label l in the second triangulation, then there must be some sequence of flips that moves label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot formulated the Orbit Conjecture, which states that this necessary condition is also sufficient, i.e. that all labels can be simultaneously mapped to their destination if and only if each label individually can be mapped to its destination. We prove this conjecture. Furthermore, we give a polynomial-time algorithm (with \U0001D442(\U0001D45B8) being a crude bound on the run-time) to find a sequence of flips to reconfigure one labelled triangulation to another, if such a sequence exists, and we prove an upper bound of \U0001D442(\U0001D45B7) on the length of the flip sequence. Our proof uses the topological result that the sets of pairwise non-crossing edges on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional ball (this follows from a result of Orden and Santos; we give a different proof based on a shelling argument). The dual cell complex of this simplicial ball, called the flip complex, has the usual flip graph as its 1-skeleton. We use properties of the 2-skeleton of the flip complex to prove the Orbit Conjecture." article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - 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: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: ama: Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete & Computational Geometry. 2019;61(4):880-898. doi:10.1007/s00454-018-0035-8 apa: Lubiw, A., Masárová, Z., & Wagner, U. (2019). A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-018-0035-8 chicago: Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.” Discrete & Computational Geometry. Springer Nature, 2019. https://doi.org/10.1007/s00454-018-0035-8. ieee: A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge-labelled triangulations,” Discrete & Computational Geometry, vol. 61, no. 4. Springer Nature, pp. 880–898, 2019. ista: Lubiw A, Masárová Z, Wagner U. 2019. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete & Computational Geometry. 61(4), 880–898. mla: Lubiw, Anna, et al. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.” Discrete & Computational Geometry, vol. 61, no. 4, Springer Nature, 2019, pp. 880–98, doi:10.1007/s00454-018-0035-8. short: A. Lubiw, Z. Masárová, U. Wagner, Discrete & Computational Geometry 61 (2019) 880–898. corr_author: '1' date_created: 2019-02-14T11:54:08Z date_published: 2019-06-01T00:00:00Z date_updated: 2026-04-08T07:23:01Z day: '01' ddc: - '000' department: - _id: UlWa doi: 10.1007/s00454-018-0035-8 external_id: arxiv: - '1710.02741' isi: - '000466130000009' file: - access_level: open_access checksum: e1bff88f1d77001b53b78c485ce048d7 content_type: application/pdf creator: dernst date_created: 2019-02-14T11:57:22Z date_updated: 2020-07-14T12:47:14Z file_id: '5988' file_name: 2018_DiscreteGeometry_Lubiw.pdf file_size: 556276 relation: main_file file_date_updated: 2020-07-14T12:47:14Z has_accepted_license: '1' intvolume: ' 61' isi: 1 issue: '4' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 880-898 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Discrete & Computational Geometry publication_identifier: eissn: - 1432-0444 issn: - 0179-5376 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '683' relation: earlier_version status: public - id: '7944' relation: dissertation_contains status: public scopus_import: '1' status: public title: A proof of the orbit conjecture for flipping edge-labelled triangulations tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 61 year: '2019' ... --- _id: '7093' 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.\r\nIn 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).\r\nWe derive these results from work of Agol, of Scharlemann and Thompson, and of Scharlemann, Schultens and Saito 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 18(k+1) (resp. 4(3k+1))." article_processing_charge: No article_type: original arxiv: 1 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. Journal of Computational Geometry. 2019;10(2):70–98. doi:10.20382/JOGC.V10I2A5 apa: Huszár, K., Spreer, J., & Wagner, U. (2019). On the treewidth of triangulated 3-manifolds. Journal of Computational Geometry. Computational Geometry Laborartoy. https://doi.org/10.20382/JOGC.V10I2A5 chicago: Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of Triangulated 3-Manifolds.” Journal of Computational Geometry. Computational Geometry Laborartoy, 2019. https://doi.org/10.20382/JOGC.V10I2A5. ieee: K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,” Journal of Computational Geometry, vol. 10, no. 2. Computational Geometry Laborartoy, pp. 70–98, 2019. ista: Huszár K, Spreer J, Wagner U. 2019. On the treewidth of triangulated 3-manifolds. Journal of Computational Geometry. 10(2), 70–98. mla: Huszár, Kristóf, et al. “On the Treewidth of Triangulated 3-Manifolds.” Journal of Computational Geometry, vol. 10, no. 2, Computational Geometry Laborartoy, 2019, pp. 70–98, doi:10.20382/JOGC.V10I2A5. short: K. Huszár, J. Spreer, U. Wagner, Journal of Computational Geometry 10 (2019) 70–98. date_created: 2019-11-23T12:14:09Z date_published: 2019-11-01T00:00:00Z date_updated: 2026-04-08T07:21:27Z day: '01' ddc: - '514' department: - _id: UlWa doi: 10.20382/JOGC.V10I2A5 external_id: arxiv: - '1712.00434' file: - access_level: open_access checksum: c872d590d38d538404782bca20c4c3f5 content_type: application/pdf creator: khuszar date_created: 2019-11-23T12:35:16Z date_updated: 2020-07-14T12:47:49Z file_id: '7094' file_name: 479-1917-1-PB.pdf file_size: 857590 relation: main_file file_date_updated: 2020-07-14T12:47:49Z has_accepted_license: '1' intvolume: ' 10' issue: '2' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 70–98 publication: Journal of Computational Geometry publication_identifier: issn: - 1920-180X publication_status: published publisher: Computational Geometry Laborartoy quality_controlled: '1' related_material: record: - id: '285' relation: earlier_version status: public - id: '8032' relation: part_of_dissertation 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: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 10 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 arxiv: 1 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. doi:10.48550/arXiv.1903.06981 apa: Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (n.d.). Token swapping on trees. arXiv. https://doi.org/10.48550/arXiv.1903.06981 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. https://doi.org/10.48550/arXiv.1903.06981. 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, doi:10.48550/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: 2026-04-08T07:23:00Z day: '16' department: - _id: HeEd - _id: UlWa - _id: KrCh doi: 10.48550/arXiv.1903.06981 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: draft related_material: record: - id: '12833' relation: later_version status: public - id: '7944' relation: dissertation_contains status: public status: public title: Token swapping on trees type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6608' abstract: - lang: eng text: We use the canonical bases produced by the tri-partition algorithm in (Edelsbrunner and Ölsböck, 2018) to open and close holes in a polyhedral complex, K. In a concrete application, we consider the Delaunay mosaic of a finite set, we let K be an Alpha complex, and we use the persistence diagram of the distance function to guide the hole opening and closing operations. The dependences between the holes define a partial order on the cells in K that characterizes what can and what cannot be constructed using the operations. The relations in this partial order reveal structural information about the underlying filtration of complexes beyond what is expressed by the persistence diagram. article_processing_charge: No author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Katharina full_name: Ölsböck, Katharina id: 4D4AA390-F248-11E8-B48F-1D18A9856A87 last_name: Ölsböck orcid: 0000-0002-4672-8297 citation: ama: Edelsbrunner H, Ölsböck K. Holes and dependences in an ordered complex. Computer Aided Geometric Design. 2019;73:1-15. doi:10.1016/j.cagd.2019.06.003 apa: Edelsbrunner, H., & Ölsböck, K. (2019). Holes and dependences in an ordered complex. Computer Aided Geometric Design. Elsevier. https://doi.org/10.1016/j.cagd.2019.06.003 chicago: Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an Ordered Complex.” Computer Aided Geometric Design. Elsevier, 2019. https://doi.org/10.1016/j.cagd.2019.06.003. ieee: H. Edelsbrunner and K. Ölsböck, “Holes and dependences in an ordered complex,” Computer Aided Geometric Design, vol. 73. Elsevier, pp. 1–15, 2019. ista: Edelsbrunner H, Ölsböck K. 2019. Holes and dependences in an ordered complex. Computer Aided Geometric Design. 73, 1–15. mla: Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an Ordered Complex.” Computer Aided Geometric Design, vol. 73, Elsevier, 2019, pp. 1–15, doi:10.1016/j.cagd.2019.06.003. short: H. Edelsbrunner, K. Ölsböck, Computer Aided Geometric Design 73 (2019) 1–15. date_created: 2019-07-07T21:59:20Z date_published: 2019-08-01T00:00:00Z date_updated: 2026-04-08T07:23:21Z day: '01' ddc: - '000' department: - _id: HeEd doi: 10.1016/j.cagd.2019.06.003 ec_funded: 1 external_id: isi: - '000485207800001' file: - access_level: open_access checksum: 7c99be505dc7533257d42eb1830cef04 content_type: application/pdf creator: kschuh date_created: 2019-07-08T15:24:26Z date_updated: 2020-07-14T12:47:34Z file_id: '6624' file_name: Elsevier_2019_Edelsbrunner.pdf file_size: 2665013 relation: main_file file_date_updated: 2020-07-14T12:47:34Z has_accepted_license: '1' intvolume: ' 73' isi: 1 language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 1-15 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: Computer Aided Geometric Design publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '7460' relation: dissertation_contains status: public scopus_import: '1' status: public title: Holes and dependences in an ordered complex tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 73 year: '2019' ... --- _id: '7210' abstract: - lang: eng text: The rate of biological evolution depends on the fixation probability and on the fixation time of new mutants. Intensive research has focused on identifying population structures that augment the fixation probability of advantageous mutants. But these amplifiers of natural selection typically increase fixation time. Here we study population structures that achieve a tradeoff between fixation probability and time. First, we show that no amplifiers can have an asymptotically lower absorption time than the well-mixed population. Then we design population structures that substantially augment the fixation probability with just a minor increase in fixation time. Finally, we show that those structures enable higher effective rate of evolution than the well-mixed population provided that the rate of generating advantageous mutants is relatively low. Our work sheds light on how population structure affects the rate of evolution. Moreover, our structures could be useful for lab-based, medical, or industrial applications of evolutionary optimization. article_number: '138' article_processing_charge: No article_type: original author: - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin A. full_name: Nowak, Martin A. last_name: Nowak citation: ama: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2019;2. doi:10.1038/s42003-019-0373-y apa: Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2019). Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-019-0373-y chicago: Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology. Springer Nature, 2019. https://doi.org/10.1038/s42003-019-0373-y. ieee: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Population structure determines the tradeoff between fixation probability and fixation time,” Communications Biology, vol. 2. Springer Nature, 2019. ista: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2019. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2, 138. mla: Tkadlec, Josef, et al. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology, vol. 2, 138, Springer Nature, 2019, doi:10.1038/s42003-019-0373-y. short: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Communications Biology 2 (2019). date_created: 2019-12-23T13:36:50Z date_published: 2019-04-23T00:00:00Z date_updated: 2026-04-08T07:24:11Z day: '23' ddc: - '000' department: - _id: KrCh doi: 10.1038/s42003-019-0373-y ec_funded: 1 external_id: isi: - '000465425700006' pmid: - '31044163' file: - access_level: open_access checksum: d1a69bfe73767e4246f0a38e4e1554dd content_type: application/pdf creator: dernst date_created: 2019-12-23T13:39:30Z date_updated: 2020-07-14T12:47:53Z file_id: '7211' file_name: 2019_CommBio_Tkadlec.pdf file_size: 1670274 relation: main_file file_date_updated: 2020-07-14T12:47:53Z has_accepted_license: '1' intvolume: ' 2' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Communications Biology publication_identifier: issn: - 2399-3642 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '7196' relation: part_of_dissertation status: public scopus_import: '1' status: public title: Population structure determines the tradeoff between fixation probability and fixation time tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2 year: '2019' ... --- _id: '6677' abstract: - lang: eng text: "The Fiat-Shamir heuristic transforms a public-coin interactive proof into a non-interactive argument, by replacing the verifier with a cryptographic hash function that is applied to the protocol’s transcript. Constructing hash functions for which this transformation is sound is a central and long-standing open question in cryptography.\r\n\r\nWe show that solving the END−OF−METERED−LINE problem is no easier than breaking the soundness of the Fiat-Shamir transformation when applied to the sumcheck protocol. In particular, if the transformed protocol is sound, then any hard problem in #P gives rise to a hard distribution in the class CLS, which is contained in PPAD. Our result opens up the possibility of sampling moderately-sized games for which it is hard to find a Nash equilibrium, by reducing the inversion of appropriately chosen one-way functions to #SAT.\r\n\r\nOur main technical contribution is a stateful incrementally verifiable procedure that, given a SAT instance over n variables, counts the number of satisfying assignments. This is accomplished via an exponential sequence of small steps, each computable in time poly(n). Incremental verifiability means that each intermediate state includes a sumcheck-based proof of its correctness, and the proof can be updated and verified in time poly(n)." article_processing_charge: No author: - first_name: Arka Rai full_name: Choudhuri, Arka Rai last_name: Choudhuri - first_name: Pavel full_name: Hubáček, Pavel last_name: Hubáček - first_name: Chethan full_name: Kamath Hosdurg, Chethan id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87 last_name: Kamath Hosdurg orcid: 0009-0006-6812-7317 - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 - first_name: Alon full_name: Rosen, Alon last_name: Rosen - first_name: Guy N. full_name: Rothblum, Guy N. last_name: Rothblum citation: ama: 'Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019. ACM; 2019:1103-1114. doi:10.1145/3313276.3316400' apa: 'Choudhuri, A. R., Hubáček, P., Kamath Hosdurg, C., Pietrzak, K. Z., Rosen, A., & Rothblum, G. N. (2019). Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019 (pp. 1103–1114). Phoenix, AZ, United States: ACM. https://doi.org/10.1145/3313276.3316400' chicago: Choudhuri, Arka Rai, Pavel Hubáček, Chethan Kamath Hosdurg, Krzysztof Z Pietrzak, Alon Rosen, and Guy N. Rothblum. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, 1103–14. ACM, 2019. https://doi.org/10.1145/3313276.3316400. ieee: A. R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K. Z. Pietrzak, A. Rosen, and G. N. Rothblum, “Finding a Nash equilibrium is no easier than breaking Fiat-Shamir,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, Phoenix, AZ, United States, 2019, pp. 1103–1114. ista: 'Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. 2019. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019. STOC: Symposium on Theory of Computing, 1103–1114.' mla: Choudhuri, Arka Rai, et al. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM, 2019, pp. 1103–14, doi:10.1145/3313276.3316400. short: A.R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K.Z. Pietrzak, A. Rosen, G.N. Rothblum, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM, 2019, pp. 1103–1114. 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:20:53Z date_published: 2019-06-01T00:00:00Z date_updated: 2026-04-08T07:24:42Z day: '01' department: - _id: KrPi doi: 10.1145/3313276.3316400 ec_funded: 1 external_id: isi: - '000523199100100' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2019/549 month: '06' oa: 1 oa_version: Preprint page: 1103-1114 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 publication_identifier: isbn: - '9781450367059' publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '7896' relation: dissertation_contains status: public scopus_import: '1' status: public title: Finding a Nash equilibrium is no easier than breaking Fiat-Shamir type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- OA_place: repository OA_type: green _id: '7524' abstract: - lang: eng text: "We prove a lower bound for the free energy (per unit volume) of the two-dimensional Bose gas in the thermodynamic limit. We show that the free energy at density $\\rho$ and inverse temperature $\\beta$ differs from the one of the non-interacting system by the correction term $4 \\pi \\rho^2 |\\ln a^2 \\rho|^{-1} (2 - [1 - \\beta_{\\mathrm{c}}/\\beta]_+^2)$. Here $a$ is the scattering length of the interaction potential, $[\\cdot]_+ = \\max\\{ 0, \\cdot \\}$ and $\\beta_{\\mathrm{c}}$ is the inverse Berezinskii--Kosterlitz--Thouless critical temperature for superfluidity. The result is valid in the dilute limit\r\n$a^2\\rho \\ll 1$ and if $\\beta \\rho \\gtrsim 1$." article_number: '1910.03372' article_processing_charge: No arxiv: 1 author: - first_name: Andreas full_name: Deuchert, Andreas id: 4DA65CD0-F248-11E8-B48F-1D18A9856A87 last_name: Deuchert orcid: 0000-0003-3146-6746 - first_name: Simon full_name: Mayer, Simon id: 30C4630A-F248-11E8-B48F-1D18A9856A87 last_name: Mayer - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Deuchert A, Mayer S, Seiringer R. The free energy of the two-dimensional dilute Bose gas. I. Lower bound. arXiv. doi:10.48550/arXiv.1910.03372 apa: Deuchert, A., Mayer, S., & Seiringer, R. (n.d.). The free energy of the two-dimensional dilute Bose gas. I. Lower bound. arXiv. https://doi.org/10.48550/arXiv.1910.03372 chicago: Deuchert, Andreas, Simon Mayer, and Robert Seiringer. “The Free Energy of the Two-Dimensional Dilute Bose Gas. I. Lower Bound.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1910.03372. ieee: A. Deuchert, S. Mayer, and R. Seiringer, “The free energy of the two-dimensional dilute Bose gas. I. Lower bound,” arXiv. . ista: Deuchert A, Mayer S, Seiringer R. The free energy of the two-dimensional dilute Bose gas. I. Lower bound. arXiv, 1910.03372. mla: Deuchert, Andreas, et al. “The Free Energy of the Two-Dimensional Dilute Bose Gas. I. Lower Bound.” ArXiv, 1910.03372, doi:10.48550/arXiv.1910.03372. short: A. Deuchert, S. Mayer, R. Seiringer, ArXiv (n.d.). corr_author: '1' date_created: 2020-02-26T08:46:40Z date_published: 2019-10-08T00:00:00Z date_updated: 2026-04-08T07:25:40Z day: '08' department: - _id: RoSe doi: 10.48550/arXiv.1910.03372 ec_funded: 1 external_id: arxiv: - '1910.03372' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1910.03372 month: '10' oa: 1 oa_version: Preprint page: '61' project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication: arXiv publication_status: draft related_material: record: - id: '7790' relation: later_version status: public - id: '7514' relation: dissertation_contains status: public status: public title: The free energy of the two-dimensional dilute Bose gas. I. Lower bound type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '8182' abstract: - lang: eng text: "Suppose that $n\\neq p^k$ and $n\\neq 2p^k$ for all $k$ and all primes $p$. We prove that for any Hausdorff compactum $X$ with a free action of the symmetric group $\\mathfrak S_n$ there exists an $\\mathfrak S_n$-equivariant map $X \\to\r\n{\\mathbb R}^n$ whose image avoids the diagonal $\\{(x,x\\dots,x)\\in {\\mathbb R}^n|x\\in {\\mathbb R}\\}$.\r\n Previously, the special cases of this statement for certain $X$ were usually proved using the equivartiant obstruction theory. Such calculations are difficult and may become infeasible past the first (primary) obstruction. We\r\ntake a different approach which allows us to prove the vanishing of all obstructions simultaneously. The essential step in the proof is classifying the possible degrees of $\\mathfrak S_n$-equivariant maps from the boundary\r\n$\\partial\\Delta^{n-1}$ of $(n-1)$-simplex to itself. Existence of equivariant maps between spaces is important for many questions arising from discrete mathematics and geometry, such as Kneser's conjecture, the Square Peg conjecture, the Splitting Necklace problem, and the Topological Tverberg conjecture, etc. We demonstrate the utility of our result applying it to one such question, a specific instance of envy-free division problem." article_number: '1910.12628' article_processing_charge: No arxiv: 1 author: - first_name: Sergey full_name: Avvakumov, Sergey id: 3827DAC8-F248-11E8-B48F-1D18A9856A87 last_name: Avvakumov orcid: 0000-0002-7840-5062 - first_name: Sergey full_name: Kudrya, Sergey id: ecf01965-d252-11ea-95a5-8ada5f6c6a67 last_name: Kudrya citation: ama: Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. arXiv. doi:10.48550/arXiv.1910.12628 apa: Avvakumov, S., & Kudrya, S. (n.d.). Vanishing of all equivariant obstructions and the mapping degree. arXiv. https://doi.org/10.48550/arXiv.1910.12628 chicago: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1910.12628. ieee: S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” arXiv. . ista: Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. arXiv, 1910.12628. mla: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv, 1910.12628, doi:10.48550/arXiv.1910.12628. short: S. Avvakumov, S. Kudrya, ArXiv (n.d.). corr_author: '1' date_created: 2020-07-30T10:45:08Z date_published: 2019-10-28T00:00:00Z date_updated: 2026-04-08T07:25:54Z day: '28' department: - _id: UlWa doi: 10.48550/arXiv.1910.12628 external_id: arxiv: - '1910.12628' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1910.12628 month: '10' oa: 1 oa_version: Preprint project: - _id: 26611F5C-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31312 name: Algorithms for Embeddings and Homotopy Theory publication: arXiv publication_status: draft related_material: record: - id: '11446' relation: later_version status: public - id: '8156' relation: dissertation_contains status: public status: public title: Vanishing of all equivariant obstructions and the mapping degree type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '8184' abstract: - lang: eng text: "Denote by ∆N the N-dimensional simplex. A map f : ∆N → Rd is an almost r-embedding if fσ1∩. . .∩fσr = ∅ whenever σ1, . . . , σr are pairwise disjoint faces. A counterexample to the topological Tverberg conjecture asserts that if r is not a prime power and d ≥ 2r + 1, then there is an almost r-embedding ∆(d+1)(r−1) → Rd. This was improved by Blagojevi´c–Frick–Ziegler using a simple construction of higher-dimensional counterexamples by taking k-fold join power of lower-dimensional ones. We improve this further (for d large compared to r): If r is not a prime power and N := (d+ 1)r−r l\r\nd + 2 r + 1 m−2, then there is an almost r-embedding ∆N → Rd. For the r-fold van Kampen–Flores conjecture we also produce counterexamples which are stronger than previously known. Our proof is based on generalizations of the Mabillard–Wagner theorem on construction of almost r-embeddings from equivariant maps, and of the Ozaydin theorem on existence of equivariant maps. " acknowledgement: We would like to thank F. Frick for helpful discussions article_number: '1908.08731' article_processing_charge: No arxiv: 1 author: - first_name: Sergey full_name: Avvakumov, Sergey id: 3827DAC8-F248-11E8-B48F-1D18A9856A87 last_name: Avvakumov orcid: 0000-0002-7840-5062 - first_name: R. full_name: Karasev, R. last_name: Karasev - first_name: A. full_name: Skopenkov, A. last_name: Skopenkov citation: ama: Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv. doi:10.48550/arXiv.1908.08731 apa: Avvakumov, S., Karasev, R., & Skopenkov, A. (n.d.). Stronger counterexamples to the topological Tverberg conjecture. arXiv. https://doi.org/10.48550/arXiv.1908.08731 chicago: Avvakumov, Sergey, R. Karasev, and A. Skopenkov. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1908.08731. ieee: S. Avvakumov, R. Karasev, and A. Skopenkov, “Stronger counterexamples to the topological Tverberg conjecture,” arXiv. . ista: Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv, 1908.08731. mla: Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv, 1908.08731, doi:10.48550/arXiv.1908.08731. short: S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.). date_created: 2020-07-30T10:45:34Z date_published: 2019-08-23T00:00:00Z date_updated: 2026-04-08T07:25:54Z day: '23' department: - _id: UlWa doi: 10.48550/arXiv.1908.08731 external_id: arxiv: - '1908.08731' isi: - '000986519600004' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1908.08731 month: '08' oa: 1 oa_version: Preprint project: - _id: 26611F5C-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31312 name: Algorithms for Embeddings and Homotopy Theory publication: arXiv publication_status: draft related_material: record: - id: '8156' relation: dissertation_contains status: public status: public title: Stronger counterexamples to the topological Tverberg conjecture type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '8185' abstract: - lang: eng text: "In this paper we study envy-free division problems. The classical approach to some of such problems, used by David Gale, reduces to considering continuous maps of a simplex to itself and finding sufficient conditions when this map hits the center of the simplex. The mere continuity is not sufficient for such a conclusion, the usual assumption (for example, in the Knaster--Kuratowski--Mazurkiewicz and the Gale theorem) is a certain boundary condition.\r\n We follow Erel Segal-Halevi, Fr\\'ed\\'eric Meunier, and Shira Zerbib, and replace the boundary condition by another assumption, which has the economic meaning of possibility for a player to prefer an empty part in the segment\r\npartition problem. We solve the problem positively when $n$, the number of players that divide the segment, is a prime power, and we provide counterexamples for every $n$ which is not a prime power. We also provide counterexamples relevant to a wider class of fair or envy-free partition problems when $n$ is odd and not a prime power." article_number: '1907.11183' article_processing_charge: No arxiv: 1 author: - first_name: Sergey full_name: Avvakumov, Sergey id: 3827DAC8-F248-11E8-B48F-1D18A9856A87 last_name: Avvakumov orcid: 0000-0002-7840-5062 - first_name: Roman full_name: Karasev, Roman last_name: Karasev citation: ama: Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv. doi:10.48550/arXiv.1907.11183 apa: Avvakumov, S., & Karasev, R. (n.d.). Envy-free division using mapping degree. arXiv. https://doi.org/10.48550/arXiv.1907.11183 chicago: Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1907.11183. ieee: S. Avvakumov and R. Karasev, “Envy-free division using mapping degree,” arXiv. . ista: Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv, 1907.11183. mla: Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” ArXiv, 1907.11183, doi:10.48550/arXiv.1907.11183. short: S. Avvakumov, R. Karasev, ArXiv (n.d.). corr_author: '1' date_created: 2020-07-30T10:45:51Z date_published: 2019-07-25T00:00:00Z date_updated: 2026-04-08T07:25:54Z day: '25' department: - _id: UlWa doi: 10.48550/arXiv.1907.11183 external_id: arxiv: - '1907.11183' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1907.11183 month: '07' oa: 1 oa_version: Preprint project: - _id: 26611F5C-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31312 name: Algorithms for Embeddings and Homotopy Theory publication: arXiv publication_status: draft related_material: link: - relation: later_version url: https://doi.org/10.1112/mtk.12059 record: - id: '8156' relation: dissertation_contains status: public status: public title: Envy-free division using mapping degree type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '7197' abstract: - lang: eng text: During bacterial cell division, the tubulin-homolog FtsZ forms a ring-like structure at the center of the cell. This Z-ring not only organizes the division machinery, but treadmilling of FtsZ filaments was also found to play a key role in distributing proteins at the division site. What regulates the architecture, dynamics and stability of the Z-ring is currently unknown, but FtsZ-associated proteins are known to play an important role. Here, using an in vitro reconstitution approach, we studied how the well-conserved protein ZapA affects FtsZ treadmilling and filament organization into large-scale patterns. Using high-resolution fluorescence microscopy and quantitative image analysis, we found that ZapA cooperatively increases the spatial order of the filament network, but binds only transiently to FtsZ filaments and has no effect on filament length and treadmilling velocity. Together, our data provides a model for how FtsZ-associated proteins can increase the precision and stability of the bacterial cell division machinery in a switch-like manner. acknowledged_ssus: - _id: LifeSc - _id: Bio article_number: '5744' article_processing_charge: No article_type: original author: - first_name: Paulo R full_name: Dos Santos Caldas, Paulo R id: 38FCDB4C-F248-11E8-B48F-1D18A9856A87 last_name: Dos Santos Caldas orcid: 0000-0001-6730-4461 - first_name: Maria D full_name: Lopez Pelegrin, Maria D id: 319AA9CE-F248-11E8-B48F-1D18A9856A87 last_name: Lopez Pelegrin - first_name: Daniel J. G. full_name: Pearce, Daniel J. G. last_name: Pearce - first_name: Nazmi B full_name: Budanur, Nazmi B id: 3EA1010E-F248-11E8-B48F-1D18A9856A87 last_name: Budanur orcid: 0000-0003-0423-5010 - first_name: Jan full_name: Brugués, Jan last_name: Brugués - first_name: Martin full_name: Loose, Martin id: 462D4284-F248-11E8-B48F-1D18A9856A87 last_name: Loose orcid: 0000-0001-7309-9724 citation: ama: Dos Santos Caldas PR, Lopez Pelegrin MD, Pearce DJG, Budanur NB, Brugués J, Loose M. Cooperative ordering of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinker ZapA. Nature Communications. 2019;10. doi:10.1038/s41467-019-13702-4 apa: Dos Santos Caldas, P. R., Lopez Pelegrin, M. D., Pearce, D. J. G., Budanur, N. B., Brugués, J., & Loose, M. (2019). Cooperative ordering of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinker ZapA. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-13702-4 chicago: Dos Santos Caldas, Paulo R, Maria D Lopez Pelegrin, Daniel J. G. Pearce, Nazmi B Budanur, Jan Brugués, and Martin Loose. “Cooperative Ordering of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinker ZapA.” Nature Communications. Springer Nature, 2019. https://doi.org/10.1038/s41467-019-13702-4. ieee: P. R. Dos Santos Caldas, M. D. Lopez Pelegrin, D. J. G. Pearce, N. B. Budanur, J. Brugués, and M. Loose, “Cooperative ordering of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinker ZapA,” Nature Communications, vol. 10. Springer Nature, 2019. ista: Dos Santos Caldas PR, Lopez Pelegrin MD, Pearce DJG, Budanur NB, Brugués J, Loose M. 2019. Cooperative ordering of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinker ZapA. Nature Communications. 10, 5744. mla: Dos Santos Caldas, Paulo R., et al. “Cooperative Ordering of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinker ZapA.” Nature Communications, vol. 10, 5744, Springer Nature, 2019, doi:10.1038/s41467-019-13702-4. short: P.R. Dos Santos Caldas, M.D. Lopez Pelegrin, D.J.G. Pearce, N.B. Budanur, J. Brugués, M. Loose, Nature Communications 10 (2019). corr_author: '1' date_created: 2019-12-20T12:22:57Z date_published: 2019-12-17T00:00:00Z date_updated: 2026-04-08T07:26:30Z day: '17' ddc: - '570' department: - _id: MaLo - _id: BjHo doi: 10.1038/s41467-019-13702-4 ec_funded: 1 external_id: isi: - '000503009300001' file: - access_level: open_access checksum: a1b44b427ba341383197790d0e8789fa content_type: application/pdf creator: dernst date_created: 2019-12-23T07:34:56Z date_updated: 2020-07-14T12:47:53Z file_id: '7208' file_name: 2019_NatureComm_Caldas.pdf file_size: 8488733 relation: main_file file_date_updated: 2020-07-14T12:47:53Z has_accepted_license: '1' intvolume: ' 10' isi: 1 language: - iso: eng month: '12' oa: 1 oa_version: Published Version project: - _id: 2595697A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '679239' name: Self-Organization of the Bacterial Cell - _id: 260D98C8-B435-11E9-9278-68D0E5697425 name: Reconstitution of Bacterial Cell Division Using Purified Components publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '8358' relation: dissertation_contains status: public scopus_import: '1' status: public title: Cooperative ordering of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinker ZapA tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 10 year: '2019' ... --- _id: '5886' abstract: - lang: eng text: Problems involving quantum impurities, in which one or a few particles are interacting with a macroscopic environment, represent a pervasive paradigm, spanning across atomic, molecular, and condensed-matter physics. In this paper we introduce new variational approaches to quantum impurities and apply them to the Fröhlich polaron–a quasiparticle formed out of an electron (or other point-like impurity) in a polar medium, and to the angulon–a quasiparticle formed out of a rotating molecule in a bosonic bath. We benchmark these approaches against established theories, evaluating their accuracy as a function of the impurity-bath coupling. article_processing_charge: No author: - first_name: Xiang full_name: Li, Xiang id: 4B7E523C-F248-11E8-B48F-1D18A9856A87 last_name: Li - first_name: Giacomo full_name: Bighin, Giacomo id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87 last_name: Bighin orcid: 0000-0001-8823-9777 - first_name: Enderalp full_name: Yakaboylu, Enderalp id: 38CB71F6-F248-11E8-B48F-1D18A9856A87 last_name: Yakaboylu orcid: 0000-0001-5973-0874 - first_name: Mikhail full_name: Lemeshko, Mikhail id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 citation: ama: 'Li X, Bighin G, Yakaboylu E, Lemeshko M. Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon. Molecular Physics. 2019. doi:10.1080/00268976.2019.1567852' apa: 'Li, X., Bighin, G., Yakaboylu, E., & Lemeshko, M. (2019). Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon. Molecular Physics. Taylor and Francis. https://doi.org/10.1080/00268976.2019.1567852' chicago: 'Li, Xiang, Giacomo Bighin, Enderalp Yakaboylu, and Mikhail Lemeshko. “Variational Approaches to Quantum Impurities: From the Fröhlich Polaron to the Angulon.” Molecular Physics. Taylor and Francis, 2019. https://doi.org/10.1080/00268976.2019.1567852.' ieee: 'X. Li, G. Bighin, E. Yakaboylu, and M. Lemeshko, “Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon,” Molecular Physics. Taylor and Francis, 2019.' ista: 'Li X, Bighin G, Yakaboylu E, Lemeshko M. 2019. Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon. Molecular Physics.' mla: 'Li, Xiang, et al. “Variational Approaches to Quantum Impurities: From the Fröhlich Polaron to the Angulon.” Molecular Physics, Taylor and Francis, 2019, doi:10.1080/00268976.2019.1567852.' short: X. Li, G. Bighin, E. Yakaboylu, M. Lemeshko, Molecular Physics (2019). date_created: 2019-01-27T22:59:10Z date_published: 2019-01-18T00:00:00Z date_updated: 2026-04-08T07:26:09Z day: '18' ddc: - '530' department: - _id: MiLe doi: 10.1080/00268976.2019.1567852 ec_funded: 1 external_id: isi: - '000474641400008' file: - access_level: open_access checksum: 178964744b636a6f036372f4f090a657 content_type: application/pdf creator: dernst date_created: 2019-01-29T08:32:57Z date_updated: 2020-07-14T12:47:13Z file_id: '5896' file_name: 2019_MolecularPhysics_Li.pdf file_size: 1309966 relation: main_file file_date_updated: 2020-07-14T12:47:13Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 26031614-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P29902 name: Quantum rotations in the presence of a many-body environment - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Molecular Physics publication_identifier: issn: - 0026-8976 publication_status: published publisher: Taylor and Francis quality_controlled: '1' related_material: record: - id: '8958' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon' 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 year: '2019' ... --- OA_place: publisher _id: '6957' abstract: - lang: eng text: "In many shear flows like pipe flow, plane Couette flow, plane Poiseuille flow, etc. turbulence emerges subcritically. Here, when subjected to strong enough perturbations, the flow becomes turbulent in spite of the laminar base flow being linearly stable. The nature of this instability has puzzled the scientific community for decades. At onset, turbulence appears in localized patches and flows are spatio-temporally intermittent. In pipe flow the localized turbulent structures are referred to as puffs and in planar flows like plane Couette and channel flow, patches arise in the form of localized oblique bands. In this thesis, we study the onset of turbulence in channel flow in direct numerical simulations from a dynamical system theory perspective, as well as by performing experiments in a large aspect ratio channel.\r\n\r\nThe aim of the experimental work is to determine the critical Reynolds number where turbulence first becomes sustained. Recently, the onset of turbulence has been described in analogy to absorbing state phase transition (i.e. directed percolation). In particular, it has been shown that the critical point can be estimated from the competition between spreading and decay processes. Here, by performing experiments, we identify the mechanisms underlying turbulence proliferation in channel flow and find the critical Reynolds number, above which turbulence becomes sustained. Above the critical point, the continuous growth at the tip of the stripes outweighs the stochastic shedding of turbulent patches at the tail and the stripes expand. For growing stripes, the probability to decay decreases while the probability of stripe splitting increases. Consequently, and unlike for the puffs in pipe flow, neither of these two processes is time-independent i.e. memoryless. Coupling between stripe expansion and creation of new stripes via splitting leads to a significantly lower critical point ($Re_c=670+/-10$) than most earlier studies suggest. \r\n\r\nWhile the above approach sheds light on how turbulence first becomes sustained, it provides no insight into the origin of the stripes themselves. In the numerical part of the thesis we investigate how turbulent stripes form from invariant solutions of the Navier-Stokes equations. The origin of these turbulent stripes can be identified by applying concepts from the dynamical system theory. In doing so, we identify the exact coherent structures underlying stripes and their bifurcations and how they give rise to the turbulent attractor in phase space. We first report a family of localized nonlinear traveling wave solutions of the Navier-Stokes equations in channel flow. These solutions show structural similarities with turbulent stripes in experiments like obliqueness, quasi-streamwise streaks and vortices, etc. A parametric study of these traveling wave solution is performed, with parameters like Reynolds number, stripe tilt angle and domain size, including the stability of the solutions. These solutions emerge through saddle-node bifurcations and form a phase space skeleton for the turbulent stripes observed in the experiments. The lower branches of these TW solutions at different tilt angles undergo Hopf bifurcation and new solutions branches of relative periodic orbits emerge. These RPO solutions do not belong to the same family and therefore the routes to chaos for different angles are different. \r\n\r\nIn shear flows, turbulence at onset is transient in nature. \ Consequently,turbulence can not be tracked to lower Reynolds numbers, where the dynamics may simplify. Before this happens, turbulence becomes short-lived and laminarizes. In the last part of the thesis, we show that using numerical simulations we can continue turbulent stripes in channel flow past the 'relaminarization barrier' all the way to their origin. Here, turbulent stripe dynamics simplifies and the fluctuations are no longer stochastic and the stripe settles down to a relative periodic orbit. This relative periodic orbit originates from the aforementioned traveling wave solutions. Starting from the relative periodic orbit, a small increase in speed i.e. Reynolds number gives rise to chaos and the attractor dimension sharply increases in contrast to the classical transition scenario where the instabilities affect the flow globally and give rise to much more gradual route to turbulence." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Chaitanya S full_name: Paranjape, Chaitanya S id: 3D85B7C4-F248-11E8-B48F-1D18A9856A87 last_name: Paranjape citation: ama: Paranjape CS. Onset of turbulence in plane Poiseuille flow. 2019. doi:10.15479/AT:ISTA:6957 apa: Paranjape, C. S. (2019). Onset of turbulence in plane Poiseuille flow. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6957 chicago: Paranjape, Chaitanya S. “Onset of Turbulence in Plane Poiseuille Flow.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6957. ieee: C. S. Paranjape, “Onset of turbulence in plane Poiseuille flow,” Institute of Science and Technology Austria, 2019. ista: Paranjape CS. 2019. Onset of turbulence in plane Poiseuille flow. Institute of Science and Technology Austria. mla: Paranjape, Chaitanya S. Onset of Turbulence in Plane Poiseuille Flow. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6957. short: C.S. Paranjape, Onset of Turbulence in Plane Poiseuille Flow, Institute of Science and Technology Austria, 2019. corr_author: '1' date_created: 2019-10-22T12:08:43Z date_published: 2019-10-24T00:00:00Z date_updated: 2026-04-08T07:46:58Z day: '24' ddc: - '532' degree_awarded: PhD department: - _id: BjHo doi: 10.15479/AT:ISTA:6957 file: - access_level: closed checksum: 7ba298ba0ce7e1d11691af6b8eaf0a0a content_type: application/zip creator: cparanjape date_created: 2019-10-23T09:54:43Z date_updated: 2020-07-14T12:47:46Z file_id: '6962' file_name: Chaitanya_Paranjape_source_files_tex_figures.zip file_size: 45828099 relation: source_file - access_level: open_access checksum: 642697618314e31ac31392da7909c2d9 content_type: application/pdf creator: cparanjape date_created: 2019-10-23T10:37:09Z date_updated: 2020-07-14T12:47:46Z file_id: '6963' file_name: Chaitanya_Paranjape_Thesis.pdf file_size: 19504197 relation: main_file file_date_updated: 2020-07-14T12:47:46Z has_accepted_license: '1' keyword: - Instabilities - Turbulence - Nonlinear dynamics language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '138' publication_identifier: eissn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 title: Onset of turbulence in plane Poiseuille flow type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2019' ...