--- _id: '1117' abstract: - lang: eng text: 'GABAergic synapses in brain circuits generate inhibitory output signals with submillisecond latency and temporal precision. Whether the molecular identity of the release sensor contributes to these signaling properties remains unclear. Here, we examined the Ca^2+ sensor of exocytosis at GABAergic basket cell (BC) to Purkinje cell (PC) synapses in cerebellum. Immunolabeling suggested that BC terminals selectively expressed synaptotagmin 2 (Syt2), whereas synaptotagmin 1 (Syt1) was enriched in excitatory terminals. Genetic elimination of Syt2 reduced action potential-evoked release to ∼10%, identifying Syt2 as the major Ca^2+ sensor at BC-PC synapses. Differential adenovirus-mediated rescue revealed that Syt2 triggered release with shorter latency and higher temporal precision and mediated faster vesicle pool replenishment than Syt1. Furthermore, deletion of Syt2 severely reduced and delayed disynaptic inhibition following parallel fiber stimulation. Thus, the selective use of Syt2 as release sensor at BC-PC synapses ensures fast and efficient feedforward inhibition in cerebellar microcircuits. #bioimagingfacility-author' acknowledged_ssus: - _id: Bio - _id: PreCl article_processing_charge: No author: - first_name: Chong full_name: Chen, Chong id: 3DFD581A-F248-11E8-B48F-1D18A9856A87 last_name: Chen - first_name: Itaru full_name: Arai, Itaru id: 32A73F6C-F248-11E8-B48F-1D18A9856A87 last_name: Arai - first_name: Rachel full_name: Satterield, Rachel last_name: Satterield - first_name: Samuel full_name: Young, Samuel last_name: Young - first_name: Peter M full_name: Jonas, Peter M id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 citation: ama: Chen C, Arai itaru, Satterield R, Young S, Jonas PM. Synaptotagmin 2 is the fast Ca2+ sensor at a central inhibitory synapse. Cell Reports. 2017;18(3):723-736. doi:10.1016/j.celrep.2016.12.067 apa: Chen, C., Arai, itaru, Satterield, R., Young, S., & Jonas, P. M. (2017). Synaptotagmin 2 is the fast Ca2+ sensor at a central inhibitory synapse. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2016.12.067 chicago: Chen, Chong, itaru Arai, Rachel Satterield, Samuel Young, and Peter M Jonas. “Synaptotagmin 2 Is the Fast Ca2+ Sensor at a Central Inhibitory Synapse.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2016.12.067. ieee: C. Chen, itaru Arai, R. Satterield, S. Young, and P. M. Jonas, “Synaptotagmin 2 is the fast Ca2+ sensor at a central inhibitory synapse,” Cell Reports, vol. 18, no. 3. Cell Press, pp. 723–736, 2017. ista: Chen C, Arai itaru, Satterield R, Young S, Jonas PM. 2017. Synaptotagmin 2 is the fast Ca2+ sensor at a central inhibitory synapse. Cell Reports. 18(3), 723–736. mla: Chen, Chong, et al. “Synaptotagmin 2 Is the Fast Ca2+ Sensor at a Central Inhibitory Synapse.” Cell Reports, vol. 18, no. 3, Cell Press, 2017, pp. 723–36, doi:10.1016/j.celrep.2016.12.067. short: C. Chen, itaru Arai, R. Satterield, S. Young, P.M. Jonas, Cell Reports 18 (2017) 723–736. date_created: 2018-12-11T11:50:14Z date_published: 2017-01-17T00:00:00Z date_updated: 2026-04-08T14:09:28Z day: '17' ddc: - '571' department: - _id: PeJo doi: 10.1016/j.celrep.2016.12.067 ec_funded: 1 external_id: isi: - '000396470600013' file: - access_level: open_access content_type: application/pdf creator: system date_created: 2018-12-12T10:16:09Z date_updated: 2018-12-12T10:16:09Z file_id: '5195' file_name: IST-2017-751-v1+1_1-s2.0-S2211124716317740-main.pdf file_size: 4427591 relation: main_file file_date_updated: 2018-12-12T10:16:09Z has_accepted_license: '1' intvolume: ' 18' isi: 1 issue: '3' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '01' oa: 1 oa_version: Published Version page: 723 - 736 project: - _id: 25C26B1E-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P24909-B24 name: Mechanisms of transmitter release at GABAergic synapses - _id: 25C0F108-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '268548' name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons publication: Cell Reports publication_identifier: issn: - 2211-1247 publication_status: published publisher: Cell Press publist_id: '6245' pubrep_id: '751' quality_controlled: '1' related_material: record: - id: '324' relation: dissertation_contains status: public scopus_import: '1' status: public title: Synaptotagmin 2 is the fast Ca2+ sensor at a central inhibitory synapse 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: 18 year: '2017' ... --- _id: '749' abstract: - lang: eng text: 'Synaptotagmin 7 (Syt7) is thought to be a Ca2+ sensor that mediates asynchronous transmitter release and facilitation at synapses. However, Syt7 is strongly expressed in fast-spiking, parvalbumin-expressing GABAergic interneurons, and the output synapses of these neurons produce only minimal asynchronous release and show depression rather than facilitation. To resolve this apparent contradiction, we examined the effects of genetic elimination of Syt7 on synaptic transmission at the GABAergic basket cell (BC)-Purkinje cell (PC) synapse in cerebellum. Our results indicate that at the BC-PC synapse, Syt7 contributes to asynchronous release, pool replenishment, and facilitation. In combination, these three effects ensure efficient transmitter release during high-frequency activity and guarantee frequency independence of inhibition. Our results identify a distinct function of Syt7: ensuring the efficiency of high-frequency inhibitory synaptic transmission' acknowledged_ssus: - _id: PreCl article_processing_charge: No author: - first_name: Chong full_name: Chen, Chong id: 3DFD581A-F248-11E8-B48F-1D18A9856A87 last_name: Chen - first_name: Rachel full_name: Satterfield, Rachel last_name: Satterfield - first_name: Samuel full_name: Young, Samuel last_name: Young - first_name: Peter M full_name: Jonas, Peter M id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 citation: ama: Chen C, Satterfield R, Young S, Jonas PM. Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses. Cell Reports. 2017;21(8):2082-2089. doi:10.1016/j.celrep.2017.10.122 apa: Chen, C., Satterfield, R., Young, S., & Jonas, P. M. (2017). Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2017.10.122 chicago: Chen, Chong, Rachel Satterfield, Samuel Young, and Peter M Jonas. “Triple Function of Synaptotagmin 7 Ensures Efficiency of High-Frequency Transmission at Central GABAergic Synapses.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2017.10.122. ieee: C. Chen, R. Satterfield, S. Young, and P. M. Jonas, “Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses,” Cell Reports, vol. 21, no. 8. Cell Press, pp. 2082–2089, 2017. ista: Chen C, Satterfield R, Young S, Jonas PM. 2017. Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses. Cell Reports. 21(8), 2082–2089. mla: Chen, Chong, et al. “Triple Function of Synaptotagmin 7 Ensures Efficiency of High-Frequency Transmission at Central GABAergic Synapses.” Cell Reports, vol. 21, no. 8, Cell Press, 2017, pp. 2082–89, doi:10.1016/j.celrep.2017.10.122. short: C. Chen, R. Satterfield, S. Young, P.M. Jonas, Cell Reports 21 (2017) 2082–2089. corr_author: '1' date_created: 2018-12-11T11:48:18Z date_published: 2017-11-21T00:00:00Z date_updated: 2026-04-08T14:09:28Z day: '21' ddc: - '570' - '571' department: - _id: PeJo doi: 10.1016/j.celrep.2017.10.122 ec_funded: 1 external_id: isi: - '000416216700007' file: - access_level: open_access checksum: a6afa3764909bf6edafa07982d8e1cee content_type: application/pdf creator: system date_created: 2018-12-12T10:09:14Z date_updated: 2020-07-14T12:47:59Z file_id: '4737' file_name: IST-2017-874-v1+1_PIIS2211124717316029.pdf file_size: 2759195 relation: main_file file_date_updated: 2020-07-14T12:47:59Z has_accepted_license: '1' intvolume: ' 21' isi: 1 issue: '8' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 2082 - 2089 project: - _id: 25C26B1E-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P24909-B24 name: Mechanisms of transmitter release at GABAergic synapses - _id: 25B7EB9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '692692' name: Biophysics and circuit function of a giant cortical glutamatergic synapse publication: Cell Reports publication_identifier: issn: - 2211-1247 publication_status: published publisher: Cell Press publist_id: '6907' pubrep_id: '874' quality_controlled: '1' related_material: record: - id: '324' relation: dissertation_contains status: public scopus_import: '1' status: public title: Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses 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: 21 year: '2017' ... --- _id: '1074' abstract: - lang: eng text: Recently it has become feasible to detect long blocks of nearly identical sequence shared between pairs of genomes. These IBD blocks are direct traces of recent coalescence events and, as such, contain ample signal to infer recent demography. Here, we examine sharing of such blocks in two-dimensional populations with local migration. Using a diffusion approximation to trace genetic ancestry, we derive analytical formulae for patterns of isolation by distance of IBD blocks, which can also incorporate recent population density changes. We introduce an inference scheme that uses a composite likelihood approach to fit these formulae. We then extensively evaluate our theory and inference method on a range of scenarios using simulated data. We first validate the diffusion approximation by showing that the theoretical results closely match the simulated block sharing patterns. We then demonstrate that our inference scheme can accurately and robustly infer dispersal rate and effective density, as well as bounds on recent dynamics of population density. To demonstrate an application, we use our estimation scheme to explore the fit of a diffusion model to Eastern European samples in the POPRES data set. We show that ancestry diffusing with a rate of σ ≈ 50–100 km/√gen during the last centuries, combined with accelerating population growth, can explain the observed exponential decay of block sharing with increasing pairwise sample distance. article_processing_charge: No author: - first_name: Harald full_name: Ringbauer, Harald id: 417FCFF4-F248-11E8-B48F-1D18A9856A87 last_name: Ringbauer orcid: 0000-0002-4884-9682 - first_name: Graham full_name: Coop, Graham last_name: Coop - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: ama: Ringbauer H, Coop G, Barton NH. Inferring recent demography from isolation by distance of long shared sequence blocks. Genetics. 2017;205(3):1335-1351. doi:10.1534/genetics.116.196220 apa: Ringbauer, H., Coop, G., & Barton, N. H. (2017). Inferring recent demography from isolation by distance of long shared sequence blocks. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.116.196220 chicago: Ringbauer, Harald, Graham Coop, and Nicholas H Barton. “Inferring Recent Demography from Isolation by Distance of Long Shared Sequence Blocks.” Genetics. Genetics Society of America, 2017. https://doi.org/10.1534/genetics.116.196220. ieee: H. Ringbauer, G. Coop, and N. H. Barton, “Inferring recent demography from isolation by distance of long shared sequence blocks,” Genetics, vol. 205, no. 3. Genetics Society of America, pp. 1335–1351, 2017. ista: Ringbauer H, Coop G, Barton NH. 2017. Inferring recent demography from isolation by distance of long shared sequence blocks. Genetics. 205(3), 1335–1351. mla: Ringbauer, Harald, et al. “Inferring Recent Demography from Isolation by Distance of Long Shared Sequence Blocks.” Genetics, vol. 205, no. 3, Genetics Society of America, 2017, pp. 1335–51, doi:10.1534/genetics.116.196220. short: H. Ringbauer, G. Coop, N.H. Barton, Genetics 205 (2017) 1335–1351. date_created: 2018-12-11T11:50:00Z date_published: 2017-03-01T00:00:00Z date_updated: 2026-04-08T14:06:35Z day: '01' department: - _id: NiBa doi: 10.1534/genetics.116.196220 ec_funded: 1 external_id: isi: - '000395807200023' intvolume: ' 205' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://www.biorxiv.org/content/early/2016/09/23/076810 month: '03' oa: 1 oa_version: Preprint page: 1335 - 1351 project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Genetics publication_identifier: issn: - 0016-6731 publication_status: published publisher: Genetics Society of America publist_id: '6307' quality_controlled: '1' related_material: record: - id: '200' relation: dissertation_contains status: public scopus_import: '1' status: public title: Inferring recent demography from isolation by distance of long shared sequence blocks type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 205 year: '2017' ... --- _id: '559' abstract: - lang: eng text: 'Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather sophisticated graph pebbling lower bounds. Much simpler and in several aspects more efficient schemes based on inverting random functions have been suggested, but they don’t give meaningful security guarantees due to existing time-memory trade-offs. In particular, Hellman showed that any permutation over a domain of size N can be inverted in time T by an algorithm that is given S bits of auxiliary information whenever (Formula presented). For functions Hellman gives a weaker attack with S2· T≈ N2 (e.g., S= T≈ N2/3). To prove lower bounds, one considers an adversary who has access to an oracle f: [ N] → [N] and can make T oracle queries. The best known lower bound is S· T∈ Ω(N) and holds for random functions and permutations. We construct functions that provably require more time and/or space to invert. Specifically, for any constant k we construct a function [N] → [N] that cannot be inverted unless Sk· T∈ Ω(Nk) (in particular, S= T≈ (Formula presented). Our construction does not contradict Hellman’s time-memory trade-off, because it cannot be efficiently evaluated in forward direction. However, its entire function table can be computed in time quasilinear in N, which is sufficient for the PoS application. Our simplest construction is built from a random function oracle g: [N] × [N] → [ N] and a random permutation oracle f: [N] → N] and is defined as h(x) = g(x, x′) where f(x) = π(f(x′)) with π being any involution without a fixed point, e.g. flipping all the bits. For this function we prove that any adversary who gets S bits of auxiliary information, makes at most T oracle queries, and inverts h on an ϵ fraction of outputs must satisfy S2· T∈ Ω(ϵ2N2).' alternative_title: - LNCS author: - first_name: Hamza M full_name: Abusalah, Hamza M id: 40297222-F248-11E8-B48F-1D18A9856A87 last_name: Abusalah - first_name: Joel F full_name: Alwen, Joel F id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87 last_name: Alwen - first_name: Bram full_name: Cohen, Bram last_name: Cohen - first_name: Danylo full_name: Khilko, Danylo last_name: Khilko - 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: Leonid full_name: Reyzin, Leonid last_name: Reyzin citation: ama: 'Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer; 2017:357-379. doi:10.1007/978-3-319-70697-9_13' apa: 'Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., & Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China: Springer. https://doi.org/10.1007/978-3-319-70697-9_13' chicago: Abusalah, Hamza M, Joel F Alwen, Bram Cohen, Danylo Khilko, Krzysztof Z Pietrzak, and Leonid Reyzin. “Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space,” 10625:357–79. Springer, 2017. https://doi.org/10.1007/978-3-319-70697-9_13. ieee: 'H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.' ista: 'Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625, 357–379.' mla: Abusalah, Hamza M., et al. Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space. Vol. 10625, Springer, 2017, pp. 357–79, doi:10.1007/978-3-319-70697-9_13. short: H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379. conference: end_date: 2017-12-07 location: Hong Kong, China name: 'ASIACRYPT: Theory and Applications of Cryptology and Information Security' start_date: 2017-12-03 corr_author: '1' date_created: 2018-12-11T11:47:10Z date_published: 2017-11-18T00:00:00Z date_updated: 2026-04-08T14:10:21Z day: '18' department: - _id: KrPi doi: 10.1007/978-3-319-70697-9_13 ec_funded: 1 intvolume: ' 10625' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2017/893.pdf month: '11' oa: 1 oa_version: Submitted Version page: 357 - 379 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication_identifier: isbn: - 978-331970696-2 publication_status: published publisher: Springer publist_id: '7257' quality_controlled: '1' related_material: record: - id: '83' relation: dissertation_contains status: public scopus_import: 1 status: public title: Beyond Hellman’s time-memory trade-offs with applications to proofs of space type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10625 year: '2017' ... --- _id: '840' abstract: - lang: eng text: Heavy holes confined in quantum dots are predicted to be promising candidates for the realization of spin qubits with long coherence times. Here we focus on such heavy-hole states confined in germanium hut wires. By tuning the growth density of the latter we can realize a T-like structure between two neighboring wires. Such a structure allows the realization of a charge sensor, which is electrostatically and tunnel coupled to a quantum dot, with charge-transfer signals as high as 0.3 e. By integrating the T-like structure into a radiofrequency reflectometry setup, single-shot measurements allowing the extraction of hole tunneling times are performed. The extracted tunneling times of less than 10 μs are attributed to the small effective mass of Ge heavy-hole states and pave the way toward projective spin readout measurements. acknowledged_ssus: - _id: M-Shop article_processing_charge: No author: - first_name: Lada full_name: Vukusic, Lada id: 31E9F056-F248-11E8-B48F-1D18A9856A87 last_name: Vukusic orcid: 0000-0003-2424-8636 - first_name: Josip full_name: Kukucka, Josip id: 3F5D8856-F248-11E8-B48F-1D18A9856A87 last_name: Kukucka - first_name: Hannes full_name: Watzinger, Hannes id: 35DF8E50-F248-11E8-B48F-1D18A9856A87 last_name: Watzinger - first_name: Georgios full_name: Katsaros, Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros orcid: 0000-0001-8342-202X citation: ama: Vukušić L, Kukucka J, Watzinger H, Katsaros G. Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry. Nano Letters. 2017;17(9):5706-5710. doi:10.1021/acs.nanolett.7b02627 apa: Vukušić, L., Kukucka, J., Watzinger, H., & Katsaros, G. (2017). Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.7b02627 chicago: Vukušić, Lada, Josip Kukucka, Hannes Watzinger, and Georgios Katsaros. “Fast Hole Tunneling Times in Germanium Hut Wires Probed by Single-Shot Reflectometry.” Nano Letters. American Chemical Society, 2017. https://doi.org/10.1021/acs.nanolett.7b02627. ieee: L. Vukušić, J. Kukucka, H. Watzinger, and G. Katsaros, “Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry,” Nano Letters, vol. 17, no. 9. American Chemical Society, pp. 5706–5710, 2017. ista: Vukušić L, Kukucka J, Watzinger H, Katsaros G. 2017. Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry. Nano Letters. 17(9), 5706–5710. mla: Vukušić, Lada, et al. “Fast Hole Tunneling Times in Germanium Hut Wires Probed by Single-Shot Reflectometry.” Nano Letters, vol. 17, no. 9, American Chemical Society, 2017, pp. 5706–10, doi:10.1021/acs.nanolett.7b02627. short: L. Vukušić, J. Kukucka, H. Watzinger, G. Katsaros, Nano Letters 17 (2017) 5706–5710. corr_author: '1' date_created: 2018-12-11T11:48:47Z date_published: 2017-08-10T00:00:00Z date_updated: 2026-04-08T14:09:47Z day: '10' ddc: - '539' department: - _id: GeKa doi: 10.1021/acs.nanolett.7b02627 ec_funded: 1 external_id: isi: - '000411043500078' file: - access_level: open_access checksum: 761371a0129b2aa442424b9561450ece content_type: application/pdf creator: system date_created: 2018-12-12T10:12:33Z date_updated: 2020-07-14T12:48:13Z file_id: '4951' file_name: IST-2017-865-v1+1_acs.nanolett.7b02627.pdf file_size: 2449546 relation: main_file file_date_updated: 2020-07-14T12:48:13Z has_accepted_license: '1' intvolume: ' 17' isi: 1 issue: '9' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 5706 - 5710 project: - _id: 25517E86-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '335497' name: Towards Spin qubits and Majorana fermions in Germanium self assembled hut-wires publication: Nano Letters publication_identifier: issn: - 1530-6984 publication_status: published publisher: American Chemical Society publist_id: '6808' pubrep_id: '865' quality_controlled: '1' related_material: record: - id: '7977' relation: popular_science - id: '7996' relation: dissertation_contains status: public - id: '69' relation: dissertation_contains status: public scopus_import: '1' status: public title: Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry 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: 17 year: '2017' ... --- _id: '1010' abstract: - lang: eng text: 'We prove a local law in the bulk of the spectrum for random Gram matrices XX∗, a generalization of sample covariance matrices, where X is a large matrix with independent, centered entries with arbitrary variances. The limiting eigenvalue density that generalizes the Marchenko-Pastur law is determined by solving a system of nonlinear equations. Our entrywise and averaged local laws are on the optimal scale with the optimal error bounds. They hold both in the square case (hard edge) and in the properly rectangular case (soft edge). In the latter case we also establish a macroscopic gap away from zero in the spectrum of XX∗. ' article_number: '25' article_processing_charge: No arxiv: 1 author: - first_name: Johannes full_name: Alt, Johannes id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87 last_name: Alt - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Torben H full_name: Krüger, Torben H id: 3020C786-F248-11E8-B48F-1D18A9856A87 last_name: Krüger orcid: 0000-0002-4821-3297 citation: ama: Alt J, Erdös L, Krüger TH. Local law for random Gram matrices. Electronic Journal of Probability. 2017;22. doi:10.1214/17-EJP42 apa: Alt, J., Erdös, L., & Krüger, T. H. (2017). Local law for random Gram matrices. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/17-EJP42 chicago: Alt, Johannes, László Erdös, and Torben H Krüger. “Local Law for Random Gram Matrices.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/17-EJP42. ieee: J. Alt, L. Erdös, and T. H. Krüger, “Local law for random Gram matrices,” Electronic Journal of Probability, vol. 22. Institute of Mathematical Statistics, 2017. ista: Alt J, Erdös L, Krüger TH. 2017. Local law for random Gram matrices. Electronic Journal of Probability. 22, 25. mla: Alt, Johannes, et al. “Local Law for Random Gram Matrices.” Electronic Journal of Probability, vol. 22, 25, Institute of Mathematical Statistics, 2017, doi:10.1214/17-EJP42. short: J. Alt, L. Erdös, T.H. Krüger, Electronic Journal of Probability 22 (2017). date_created: 2018-12-11T11:49:40Z date_published: 2017-03-08T00:00:00Z date_updated: 2026-04-08T14:11:36Z day: '08' ddc: - '510' - '539' department: - _id: LaEr doi: 10.1214/17-EJP42 ec_funded: 1 external_id: arxiv: - '1606.07353' isi: - '000396611900025' file: - access_level: open_access content_type: application/pdf creator: system date_created: 2018-12-12T10:13:39Z date_updated: 2018-12-12T10:13:39Z file_id: '5024' file_name: IST-2017-807-v1+1_euclid.ejp.1488942016.pdf file_size: 639384 relation: main_file file_date_updated: 2018-12-12T10:13:39Z has_accepted_license: '1' intvolume: ' 22' isi: 1 language: - iso: eng month: '03' oa: 1 oa_version: Published Version project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Electronic Journal of Probability publication_identifier: issn: - 1083-6489 publication_status: published publisher: Institute of Mathematical Statistics publist_id: '6386' pubrep_id: '807' quality_controlled: '1' related_material: record: - id: '149' relation: dissertation_contains status: public scopus_import: '1' status: public title: Local law for random Gram matrices 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: 22 year: '2017' ... --- _id: '550' abstract: - lang: eng text: For large random matrices X with independent, centered entries but not necessarily identical variances, the eigenvalue density of XX* is well-approximated by a deterministic measure on ℝ. We show that the density of this measure has only square and cubic-root singularities away from zero. We also extend the bulk local law in [5] to the vicinity of these singularities. article_number: '63' article_processing_charge: No author: - first_name: Johannes full_name: Alt, Johannes id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87 last_name: Alt citation: ama: Alt J. Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. 2017;22. doi:10.1214/17-ECP97 apa: Alt, J. (2017). Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/17-ECP97 chicago: Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/17-ECP97. ieee: J. Alt, “Singularities of the density of states of random Gram matrices,” Electronic Communications in Probability, vol. 22. Institute of Mathematical Statistics, 2017. ista: Alt J. 2017. Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. 22, 63. mla: Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” Electronic Communications in Probability, vol. 22, 63, Institute of Mathematical Statistics, 2017, doi:10.1214/17-ECP97. short: J. Alt, Electronic Communications in Probability 22 (2017). corr_author: '1' date_created: 2018-12-11T11:47:07Z date_published: 2017-11-21T00:00:00Z date_updated: 2026-04-08T14:11:36Z day: '21' ddc: - '539' department: - _id: LaEr doi: 10.1214/17-ECP97 ec_funded: 1 external_id: isi: - '000416389200001' file: - access_level: open_access checksum: 0ec05303a0de190de145654237984c79 content_type: application/pdf creator: system date_created: 2018-12-12T10:08:04Z date_updated: 2020-07-14T12:47:00Z file_id: '4663' file_name: IST-2018-926-v1+1_euclid.ecp.1511233247.pdf file_size: 470876 relation: main_file file_date_updated: 2020-07-14T12:47:00Z has_accepted_license: '1' intvolume: ' 22' isi: 1 language: - iso: eng month: '11' oa: 1 oa_version: Published Version project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Electronic Communications in Probability publication_identifier: issn: - 1083-589X publication_status: published publisher: Institute of Mathematical Statistics publist_id: '7265' pubrep_id: '926' quality_controlled: '1' related_material: record: - id: '149' relation: dissertation_contains status: public scopus_import: '1' status: public title: Singularities of the density of states of random Gram matrices 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 22 year: '2017' ... --- _id: '741' abstract: - lang: eng text: We prove that a system of N fermions interacting with an additional particle via point interactions is stable if the ratio of the mass of the additional particle to the one of the fermions is larger than some critical m*. The value of m* is independent of N and turns out to be less than 1. This fact has important implications for the stability of the unitary Fermi gas. We also characterize the domain of the Hamiltonian of this model, and establish the validity of the Tan relations for all wave functions in the domain. article_processing_charge: No author: - first_name: Thomas full_name: Moser, Thomas id: 2B5FC9A4-F248-11E8-B48F-1D18A9856A87 last_name: Moser - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Moser T, Seiringer R. Stability of a fermionic N+1 particle system with point interactions. Communications in Mathematical Physics. 2017;356(1):329-355. doi:10.1007/s00220-017-2980-0 apa: Moser, T., & Seiringer, R. (2017). Stability of a fermionic N+1 particle system with point interactions. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-017-2980-0 chicago: Moser, Thomas, and Robert Seiringer. “Stability of a Fermionic N+1 Particle System with Point Interactions.” Communications in Mathematical Physics. Springer, 2017. https://doi.org/10.1007/s00220-017-2980-0. ieee: T. Moser and R. Seiringer, “Stability of a fermionic N+1 particle system with point interactions,” Communications in Mathematical Physics, vol. 356, no. 1. Springer, pp. 329–355, 2017. ista: Moser T, Seiringer R. 2017. Stability of a fermionic N+1 particle system with point interactions. Communications in Mathematical Physics. 356(1), 329–355. mla: Moser, Thomas, and Robert Seiringer. “Stability of a Fermionic N+1 Particle System with Point Interactions.” Communications in Mathematical Physics, vol. 356, no. 1, Springer, 2017, pp. 329–55, doi:10.1007/s00220-017-2980-0. short: T. Moser, R. Seiringer, Communications in Mathematical Physics 356 (2017) 329–355. corr_author: '1' date_created: 2018-12-11T11:48:15Z date_published: 2017-11-01T00:00:00Z date_updated: 2026-04-08T14:12:30Z day: '01' ddc: - '539' department: - _id: RoSe doi: 10.1007/s00220-017-2980-0 ec_funded: 1 external_id: isi: - '000409821300010' file: - access_level: open_access checksum: 0fd9435400f91e9b3c5346319a2d24e3 content_type: application/pdf creator: system date_created: 2018-12-12T10:10:50Z date_updated: 2020-07-14T12:47:57Z file_id: '4841' file_name: IST-2017-880-v1+1_s00220-017-2980-0.pdf file_size: 952639 relation: main_file file_date_updated: 2020-07-14T12:47:57Z has_accepted_license: '1' intvolume: ' 356' isi: 1 issue: '1' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 329 - 355 project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems - _id: 25C878CE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P27533_N27 name: Structure of the Excitation Spectrum for Many-Body Quantum Systems publication: Communications in Mathematical Physics publication_identifier: issn: - 0010-3616 publication_status: published publisher: Springer publist_id: '6926' pubrep_id: '880' quality_controlled: '1' related_material: record: - id: '52' relation: dissertation_contains status: public scopus_import: '1' status: public title: Stability of a fermionic N+1 particle system with point interactions 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: 356 year: '2017' ... --- OA_place: publisher _id: '820' abstract: - lang: eng text: "The lac operon is a classic model system for bacterial gene regulation, and has been studied extensively in E. coli, a classic model organism. However, not much is known about E. coli’s ecology and life outside the laboratory, in particular in soil and water environments. The natural diversity of the lac operon outside the laboratory, its role in the ecology of E. coli and the selection pressures it is exposed to, are similarly unknown.\r\nIn Chapter Two of this thesis, I explore the genetic diversity, phylogenetic history and signatures of selection of the lac operon across 20 natural isolates of E. coli and divergent clades of Escherichia. I found that complete lac operons were present in all isolates examined, which in all but one case were functional. The lac operon phylogeny conformed to the whole-genome phylogeny of the divergent Escherichia clades, which excludes horizontal gene transfer as an explanation for the presence of functional lac operons in these clades. All lac operon genes showed a signature of purifying selection; this signature was strongest for the lacY gene. Lac operon genes of human and environmental isolates showed similar signatures of selection, except the lacZ gene, which showed a stronger signature of selection in environmental isolates.\r\nIn Chapter Three, I try to identify the natural genetic variation relevant for phenotype and fitness in the lac operon, comparing growth rate on lactose and LacZ activity of the lac operons of these wild isolates in a common genetic background. Sequence variation in the lac promoter region, upstream of the -10 and -35 RNA polymerase binding motif, predicted variation in LacZ activity at full induction, using a thermodynamic model of polymerase binding (Tugrul, 2016). However, neither variation in LacZ activity, nor RNA polymerase binding predicted by the model correlated with variation in growth rate. Lac operons of human and environmental isolates did not differ systematically in either growth rate on lactose or LacZ protein activity, suggesting that these lac operons have been exposed to similar selection pressures. We thus have no evidence that the phenotypic variation we measured is relevant for fitness.\r\nTo start assessing the effect of genomic background on the growth phenotype conferred by the lac operon, I compared growth on minimal medium with lactose between lac operon constructs and the corresponding original isolates, I found that maximal growth rate was determined by genomic background, with almost all backgrounds conferring higher growth rates than lab strain K12 MG1655. However, I found no evidence that the lactose concentration at which growth was half maximal depended on genomic background." acknowledgement: "ERC H2020 programme (grant agreement no. 648440)\r\nThanks to Jon Bollback for giving me the chance to do this work, for sharing the ideas that lay at the basis of this work, for his honesty and openness, showing himself to me as a person and not just as a boss. Thanks to Nick Barton for his guidance at the last stage, reading and commenting extensively on several versions of this manuscript, and for his encouragement; thanks to both Jon and Nick for their kindness and patience. Thanks to Erik van Nimwegen and Calin Guet for their time and willingness to be in my thesis committee, and to Erik van Nimwegen especially for agreeing to enter my thesis committee at the last moment, and for his very sharp, helpful and relevant comments during and after the defense. Thanks to my collaborators and discussion partners: Anne Kupczok, for her guidance, ideas and discussions during the construction of the manuscript of Chapter Two, and her comments on the manuscript; Georg Rieckh for making me aware of the issue of parameter identifiability, suggesting how to solve it, and for his unfortunate idea to start the plasmid enterprise in the first place; Murat Tugrul for sharing his model, for his enthusiasm, and his comments on Chapter Three; Srdjan Sarikas for his collaboration on the Monod model fitting, fast forwarding the analysis to turbo speed and making beautiful figures, and making the discussion fun on top of it all; Vanessa Barone for her last minute comments, especially on Chapter Three, providing a sharp and very helpful experimentalist perspective at the last moment; Maros Pleska and Marjon de Vos for their comments on the manuscript of Chapter Two; Gasper Tkacik for his crucial input on the relation between growth rate and lactose concentration; Bor Kavcic for his input on growth rate modeling and error propagation. Thanks to the Bollback, Bollenbach, Barton, Guet and Tkacik group members for both pro- viding an inspiring and supportive scientific environment to work in, as well as a lot of warmth and colour to everyday life. And thanks to the friends I found here, to the people who were there for me and to the people who changed my life, making it stranger and more beautiful than I could have imagined, Maros, Vanessa, Tade, Suzi, Andrej, Peter, Tiago, Kristof, Karin, Irene, Misha, Mato, Guillaume and Zanin. " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Fabienne full_name: Jesse, Fabienne id: 4C8C26A4-F248-11E8-B48F-1D18A9856A87 last_name: Jesse citation: ama: Jesse F. The lac operon in the wild. 2017. doi:10.15479/AT:ISTA:th_857 apa: Jesse, F. (2017). The lac operon in the wild. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_857 chicago: Jesse, Fabienne. “The Lac Operon in the Wild.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_857. ieee: F. Jesse, “The lac operon in the wild,” Institute of Science and Technology Austria, 2017. ista: Jesse F. 2017. The lac operon in the wild. Institute of Science and Technology Austria. mla: Jesse, Fabienne. The Lac Operon in the Wild. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_857. short: F. Jesse, The Lac Operon in the Wild, Institute of Science and Technology Austria, 2017. corr_author: '1' date_created: 2018-12-11T11:48:41Z date_published: 2017-08-25T00:00:00Z date_updated: 2026-04-08T14:18:16Z day: '25' ddc: - '576' - '577' - '579' degree_awarded: PhD department: - _id: JoBo doi: 10.15479/AT:ISTA:th_857 ec_funded: 1 file: - access_level: open_access checksum: c62257a7bff0c5f39e1abffc6bfcca5c content_type: application/pdf creator: system date_created: 2018-12-12T10:17:00Z date_updated: 2020-07-14T12:48:10Z file_id: '5252' file_name: IST-2017-857-v1+1_thesis_fabienne.pdf file_size: 3417773 relation: main_file - access_level: closed checksum: fc87d7d72fce52824a3ae7dcad0413a8 content_type: application/x-tex creator: dernst date_created: 2019-04-05T08:51:59Z date_updated: 2020-07-14T12:48:10Z file_id: '6212' file_name: 2017_thesis_Jesse_source.tex file_size: 215899 relation: source_file file_date_updated: 2020-07-14T12:48:10Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '87' project: - _id: 2578D616-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '648440' name: Selective Barriers to Horizontal Gene Transfer publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '6829' pubrep_id: '857' status: public supervisor: - first_name: Jonathan P full_name: Bollback, Jonathan P id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87 last_name: Bollback orcid: 0000-0002-4624-4612 title: The lac operon in the wild 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: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2017' ... --- OA_place: publisher _id: '1127' abstract: - lang: eng text: "Plant hormone auxin and its transport between cells belong to the most important\r\nmechanisms controlling plant development. Auxin itself could change localization of PINs and\r\nthereby control direction of its own flow. We performed an expression profiling experiment\r\nin Arabidopsis roots to identify potential regulators of PIN polarity which are transcriptionally\r\nregulated by auxin signalling. We identified several novel regulators and performed a detailed\r\ncharacterization of the transcription factor WRKY23 (At2g47260) and its role in auxin\r\nfeedback on PIN polarity. Gain-of-function and dominant-negative mutants revealed that\r\nWRKY23 plays a crucial role in mediating the auxin effect on PIN polarity. In concordance,\r\ntypical polar auxin transport processes such as gravitropism and leaf vascular pattern\r\nformation were disturbed by interfering with WRKY23 function.\r\nIn order to identify direct targets of WRKY23, we performed consequential expression\r\nprofiling experiments using a WRKY23 inducible gain-of-function line and dominant-negative\r\nWRKY23 line that is defunct in PIN re-arrangement. Among several genes mostly related to\r\nthe groups of cell wall and defense process regulators, we identified LYSINE-HISTIDINE\r\nTRANSPORTER 1 (LHT1; At5g40780), a small amino acid permease gene from the amino\r\nacid/auxin permease family (AAAP), we present its detailed characterisation in auxin feedback\r\non PIN repolarization, identified its transcriptional regulation, we propose a potential\r\nmechanism of its action. Moreover, we identified also a member of receptor-like protein\r\nkinase LRR-RLK (LEUCINE-RICH REPEAT TRANSMEMBRANE PROTEIN KINASE PROTEIN 1;\r\nLRRK1; At1g05700), which also affects auxin-dependent PIN re-arrangement. We described\r\nits transcriptional behaviour, subcellular localization. Based on global expression data, we\r\ntried to identify ligand responsible for mechanism of signalling and suggest signalling partner\r\nand interactors. Additionally, we described role of novel phytohormone group, strigolactone,\r\nin auxin-dependent PIN re-arrangement, that could be a fundament for future studies in this\r\nfield.\r\nOur results provide first insights into an auxin transcriptional network targeting PIN\r\nlocalization and thus regulating plant development. We highlighted WRKY23 transcriptional\r\nnetwork and characterised its mediatory role in plant development. We identified direct\r\neffectors of this network, LHT1 and LRRK1, and describe their roles in PIN re-arrangement and\r\nPIN-dependent auxin transport processes." acknowledgement: I would like to first acknowledge my supervisor Jiří Friml for support, kind advice and patience. It was a pleasure to be a part of your lab, Jiří. I will remember the atmosphere present in auxin lab at VIB in Ghent and at IST in Klosterneuburg forever. I would like to thank all past and present lab members for the friendship and friendly and scientific environment in the groups. It was so nice to cooperate with you, guys. There was always someone who helped me with experiments, troubleshoot issues coming from our work etc. At this place, I would like to thank especially to Gergo Molnár. I’m happy (and lucky) that I have met him; he naturally became my tutor and guide through my PhD. From no one else during my entire professional career, I’ve learned that much. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Tomas full_name: Prat, Tomas id: 3DA3BFEE-F248-11E8-B48F-1D18A9856A87 last_name: Prat citation: ama: Prat T. Identification of novel regulators of PIN polarity and development of novel auxin sensor. 2017. apa: Prat, T. (2017). Identification of novel regulators of PIN polarity and development of novel auxin sensor. Institute of Science and Technology Austria. chicago: Prat, Tomas. “Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor.” Institute of Science and Technology Austria, 2017. ieee: T. Prat, “Identification of novel regulators of PIN polarity and development of novel auxin sensor,” Institute of Science and Technology Austria, 2017. ista: Prat T. 2017. Identification of novel regulators of PIN polarity and development of novel auxin sensor. Institute of Science and Technology Austria. mla: Prat, Tomas. Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor. Institute of Science and Technology Austria, 2017. short: T. Prat, Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor, Institute of Science and Technology Austria, 2017. corr_author: '1' date_created: 2018-12-11T11:50:17Z date_published: 2017-01-12T00:00:00Z date_updated: 2026-04-08T14:17:39Z day: '12' ddc: - '580' degree_awarded: PhD department: - _id: JiFr file: - access_level: closed checksum: d192c7c6c5ea32c8432437286dc4909e content_type: application/pdf creator: dernst date_created: 2019-04-05T08:45:14Z date_updated: 2019-04-05T08:45:14Z file_id: '6209' file_name: IST_Austria_Thesis_Tomáš_Prát.pdf file_size: 10285946 relation: main_file - access_level: open_access checksum: bab18b52cf98145926042d8ed99fdb3b content_type: application/pdf creator: dernst date_created: 2021-02-22T11:52:56Z date_updated: 2021-02-22T11:52:56Z file_id: '9185' file_name: 2017_Thesis_Prat.pdf file_size: 9802991 relation: main_file success: 1 file_date_updated: 2021-02-22T11:52:56Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: '131' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '6233' related_material: record: - id: '449' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 title: Identification of novel regulators of PIN polarity and development of novel auxin sensor type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2017' ... --- OA_place: publisher _id: '992' abstract: - lang: eng text: "An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of\r\nvariables, a finite domain of labels, and a set of constraints, each constraint acting on\r\na subset of the variables. The goal is to find an assignment of labels to its variables\r\nthat satisfies all constraints (or decide whether one exists). If we allow more general\r\n“soft” constraints, which come with (possibly infinite) costs of particular assignments,\r\nwe obtain instances from a richer class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal is to find an assignment with minimum total cost.\r\nIn this thesis, we focus (assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage, that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe complexity classification modulo (missing pieces of) complexity classification for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’ perfect\r\nmatching algorithm. This generalization contributes to complexity classfications in two\r\nways. First, it gives a new (largest known) polynomial-time solvable class of Boolean\r\nCSPs in which every variable may appear in at most two constraints and second, it\r\nsettles full classification of Boolean CSPs with planar drawing (again parametrized by a\r\nconstraint language)." acknowledgement: FP7/2007-2013/ERC grant agreement no 616160 alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Michal full_name: Rolinek, Michal id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87 last_name: Rolinek citation: ama: Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815 apa: Rolinek, M. (2017). Complexity of constraint satisfaction. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_815 chicago: Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815. ieee: M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science and Technology Austria, 2017. ista: Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria. mla: Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815. short: M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017. corr_author: '1' date_created: 2018-12-11T11:49:35Z date_published: 2017-05-01T00:00:00Z date_updated: 2026-04-08T14:17:06Z day: '01' ddc: - '004' degree_awarded: PhD department: - _id: VlKo doi: 10.15479/AT:ISTA:th_815 ec_funded: 1 file: - access_level: open_access checksum: 81761fb939acb7585c36629f765b4373 content_type: application/pdf creator: system date_created: 2018-12-12T10:07:55Z date_updated: 2020-07-14T12:48:18Z file_id: '4654' file_name: IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf file_size: 786145 relation: main_file - access_level: closed checksum: 2b2d7e1d6c1c79a9795a7aa0f860baf3 content_type: application/zip creator: dernst date_created: 2019-04-05T08:43:24Z date_updated: 2020-07-14T12:48:18Z file_id: '6208' file_name: 2017_Thesis_Rolinek_source.zip file_size: 5936337 relation: source_file file_date_updated: 2020-07-14T12:48:18Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '97' project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '6407' pubrep_id: '815' status: public supervisor: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov title: Complexity of constraint satisfaction type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2017' ... --- OA_place: publisher _id: '6291' abstract: - lang: eng text: Bacteria and their pathogens – phages – are the most abundant living entities on Earth. Throughout their coevolution, bacteria have evolved multiple immune systems to overcome the ubiquitous threat from the phages. Although the molecu- lar details of these immune systems’ functions are relatively well understood, their epidemiological consequences for the phage-bacterial communities have been largely neglected. In this thesis we employed both experimental and theoretical methods to explore whether herd and social immunity may arise in bacterial popu- lations. Using our experimental system consisting of Escherichia coli strains with a CRISPR based immunity to the T7 phage we show that herd immunity arises in phage-bacterial communities and that it is accentuated when the populations are spatially structured. By fitting a mathematical model, we inferred expressions for the herd immunity threshold and the velocity of spread of a phage epidemic in partially resistant bacterial populations, which both depend on the bacterial growth rate, phage burst size and phage latent period. We also investigated the poten- tial for social immunity in Streptococcus thermophilus and its phage 2972 using a bioinformatic analysis of potentially coding short open reading frames with a signalling signature, encoded within the CRISPR associated genes. Subsequently, we tested one identified potentially signalling peptide and found that its addition to a phage-challenged culture increases probability of survival of bacteria two fold, although the results were only marginally significant. Together, these results demonstrate that the ubiquitous arms races between bacteria and phages have further consequences at the level of the population. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Pavel full_name: Payne, Pavel id: 35F78294-F248-11E8-B48F-1D18A9856A87 last_name: Payne orcid: 0000-0002-2711-9453 citation: ama: Payne P. Bacterial herd and social immunity to phages. 2017. apa: Payne, P. (2017). Bacterial herd and social immunity to phages. Institute of Science and Technology Austria. chicago: Payne, Pavel. “Bacterial Herd and Social Immunity to Phages.” Institute of Science and Technology Austria, 2017. ieee: P. Payne, “Bacterial herd and social immunity to phages,” Institute of Science and Technology Austria, 2017. ista: Payne P. 2017. Bacterial herd and social immunity to phages. Institute of Science and Technology Austria. mla: Payne, Pavel. Bacterial Herd and Social Immunity to Phages. Institute of Science and Technology Austria, 2017. short: P. Payne, Bacterial Herd and Social Immunity to Phages, Institute of Science and Technology Austria, 2017. corr_author: '1' date_created: 2019-04-09T15:16:45Z date_published: 2017-02-01T00:00:00Z date_updated: 2026-04-08T14:16:28Z day: '01' ddc: - '570' degree_awarded: PhD department: - _id: NiBa - _id: JoBo file: - access_level: closed checksum: a0fc5c26a89c0ea759947ffba87d0d8f content_type: application/pdf creator: dernst date_created: 2019-04-09T15:15:32Z date_updated: 2020-07-14T12:47:27Z file_id: '6292' file_name: thesis_pavel_payne_final_w_signature_page.pdf file_size: 3025175 relation: main_file - access_level: open_access checksum: af531e921a7f64a9e0af4cd8783b2226 content_type: application/pdf creator: dernst date_created: 2021-02-22T13:45:59Z date_updated: 2021-02-22T13:45:59Z file_id: '9187' file_name: 2017_Payne_Thesis.pdf file_size: 3111536 relation: main_file success: 1 file_date_updated: 2021-02-22T13:45:59Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '83' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Jonathan P full_name: Bollback, Jonathan P id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87 last_name: Bollback orcid: 0000-0002-4624-4612 - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 title: Bacterial herd and social immunity to phages type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2017' ... --- OA_place: publisher _id: '837' abstract: - lang: eng text: 'The hippocampus is a key brain region for memory and notably for spatial memory, and is needed for both spatial working and reference memories. Hippocampal place cells selectively discharge in specific locations of the environment to form mnemonic represen tations of space. Several behavioral protocols have been designed to test spatial memory which requires the experimental subject to utilize working memory and reference memory. However, less is known about how these memory traces are presented in the hippo campus, especially considering tasks that require both spatial working and long -term reference memory demand. The aim of my thesis was to elucidate how spatial working memory, reference memory, and the combination of both are represented in the hippocampus. In this thesis, using a radial eight -arm maze, I examined how the combined demand on these memories influenced place cell assemblies while reference memories were partially updated by changing some of the reward- arms. This was contrasted with task varian ts requiring working or reference memories only. Reference memory update led to gradual place field shifts towards the rewards on the switched arms. Cells developed enhanced firing in passes between newly -rewarded arms as compared to those containing an unchanged reward. The working memory task did not show such gradual changes. Place assemblies on occasions replayed trajectories of the maze; at decision points the next arm choice was preferentially replayed in tasks needing reference memory while in the pure working memory task the previously visited arm was replayed. Hence trajectory replay only reflected the decision of the animal in tasks needing reference memory update. At the reward locations, in all three tasks outbound trajectories of the current arm were preferentially replayed, showing the animals’ next path to the center. At reward locations trajectories were replayed preferentially in reverse temporal order. Moreover, in the center reverse replay was seen in the working memory task but in the other tasks forward replay was seen. Hence, the direction of reactivation was determined by the goal locations so that part of the trajectory which was closer to the goal was reactivated later in an HSE while places further away from the goal were reactivated earlier. Altogether my work demonstrated that reference memory update triggers several levels of reorganization of the hippocampal cognitive map which are not seen in simpler working memory demand s. Moreover, hippocampus is likely to be involved in spatial decisions through reactivating planned trajectories when reference memory recall is required for such a decision. ' acknowledgement: 'I am very grateful for the opportunity I have had as a graduate student to explore and incredibly interesting branch of neuroscience, and for the people who made it possible. Firstly, I would like to offer my thanks to my supervisor Professor Jozsef Csicsvari for his great support, guidance and patience offered over the years. The door to his office was always open whenever I had questions. I have learned a lot from him about carefully designing experiments, asking interesting questions and how to integrate results into a broader picture. I also express my gratitude to the remarkable post- doc , Dr. Joseph O’Neill. He is a gre at scientific role model who is always willing to teach , and advice and talk through problems with his full attention. Many thanks to my wonderful “office mates” over the years and their support and encouragement, Alice Avernhe, Philipp Schönenberger, Desiree Dickerson, Karel Blahna, Charlotte Boccara, Igor Gridchyn, Peter Baracskay, Krisztián Kovács, Dámaris Rangel, Karola Käfer and Federico Stella. They were the ones in the lab for the many useful discussions about science and for making the laboratory such a nice and friendly place to work in. A special thank goes to Michael LoBianco and Jago Wallenschus for wonderful technical support. I would also like to thank Professor Peter Jonas and Professor David M Bannerman for being my qualifying exam and thesi s committee members despite their busy schedule. I am also very thankful to IST Austria for their support all throughout my PhD. ' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Haibing full_name: Xu, Haibing id: 310349D0-F248-11E8-B48F-1D18A9856A87 last_name: Xu citation: ama: Xu H. Reactivation of the hippocampal cognitive map in goal-directed spatial tasks. 2017. doi:10.15479/AT:ISTA:th_858 apa: Xu, H. (2017). Reactivation of the hippocampal cognitive map in goal-directed spatial tasks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_858 chicago: Xu, Haibing. “Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial Tasks.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_858. ieee: H. Xu, “Reactivation of the hippocampal cognitive map in goal-directed spatial tasks,” Institute of Science and Technology Austria, 2017. ista: Xu H. 2017. Reactivation of the hippocampal cognitive map in goal-directed spatial tasks. Institute of Science and Technology Austria. mla: Xu, Haibing. Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial Tasks. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_858. short: H. Xu, Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial Tasks, Institute of Science and Technology Austria, 2017. corr_author: '1' date_created: 2018-12-11T11:48:46Z date_published: 2017-08-23T00:00:00Z date_updated: 2026-04-08T14:18:55Z day: '23' ddc: - '571' degree_awarded: PhD department: - _id: JoCs doi: 10.15479/AT:ISTA:th_858 file: - access_level: closed checksum: f11925fbbce31e495124b6bc4f10573c content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: dernst date_created: 2019-04-05T08:59:51Z date_updated: 2020-07-14T12:48:12Z file_id: '6213' file_name: 2017_Xu_Haibing_Thesis_Source.docx file_size: 3589490 relation: source_file - access_level: open_access checksum: ffb10749a537d615fab1ef0937ccb157 content_type: application/pdf creator: dernst date_created: 2019-04-05T08:59:51Z date_updated: 2020-07-14T12:48:12Z file_id: '6214' file_name: 2017_Xu_Thesis_IST.pdf file_size: 11668613 relation: main_file file_date_updated: 2020-07-14T12:48:12Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '93' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '6811' pubrep_id: '858' related_material: record: - id: '5828' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jozsef L full_name: Csicsvari, Jozsef L id: 3FA14672-F248-11E8-B48F-1D18A9856A87 last_name: Csicsvari orcid: 0000-0002-5193-4036 title: Reactivation of the hippocampal cognitive map in goal-directed spatial tasks 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: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2017' ... --- OA_place: publisher _id: '838' abstract: - lang: eng text: 'In this thesis we discuss the exact security of message authentications codes HMAC , NMAC , and PMAC . NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). PMAC is a block-cipher based mode of operation, which also happens to be the most famous fully parallel MAC. NMAC was introduced by Bellare, Canetti and Krawczyk Crypto’96, who proved it to be a secure pseudorandom function (PRF), and thus also a MAC, under two assumptions. Unfortunately, for many instantiations of HMAC one of them has been found to be wrong. To restore the provable guarantees for NMAC , Bellare [Crypto’06] showed its security without this assumption. PMAC was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a pseudorandom permutation over n -bit strings, PMAC constitutes a provably secure variable input-length PRF. For adversaries making q queries, each of length at most ` (in n -bit blocks), and of total length σ ≤ q` , the original paper proves an upper bound on the distinguishing advantage of O ( σ 2 / 2 n ), while the currently best bound is O ( qσ/ 2 n ). In this work we show that this bound is tight by giving an attack with advantage Ω( q 2 `/ 2 n ). In the PMAC construction one initially XORs a mask to every message block, where the mask for the i th block is computed as τ i := γ i · L , where L is a (secret) random value, and γ i is the i -th codeword of the Gray code. Our attack applies more generally to any sequence of γ i ’s which contains a large coset of a subgroup of GF (2 n ). As for NMAC , our first contribution is a simpler and uniform proof: If f is an ε -secure PRF (against q queries) and a δ - non-adaptively secure PRF (against q queries), then NMAC f is an ( ε + `qδ )-secure PRF against q queries of length at most ` blocks each. We also show that this ε + `qδ bound is basically tight by constructing an f for which an attack with advantage `qδ exists. Moreover, we analyze the PRF-security of a modification of NMAC called NI by An and Bellare that avoids the constant rekeying on multi-block messages in NMAC and allows for an information-theoretic analysis. We carry out such an analysis, obtaining a tight `q 2 / 2 c bound for this step, improving over the trivial bound of ` 2 q 2 / 2 c . Finally, we investigate, if the security of PMAC can be further improved by using τ i ’s that are k -wise independent, for k > 1 (the original has k = 1). We observe that the security of PMAC will not increase in general if k = 2, and then prove that the security increases to O ( q 2 / 2 n ), if the k = 4. Due to simple extension attacks, this is the best bound one can hope for, using any distribution on the masks. Whether k = 3 is already sufficient to get this level of security is left as an open problem. Keywords: Message authentication codes, Pseudorandom functions, HMAC, PMAC. ' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Michal full_name: Rybar, Michal id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87 last_name: Rybar citation: ama: Rybar M. (The exact security of) Message authentication codes. 2017. doi:10.15479/AT:ISTA:th_828 apa: Rybar, M. (2017). (The exact security of) Message authentication codes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_828 chicago: Rybar, Michal. “(The Exact Security of) Message Authentication Codes.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_828. ieee: M. Rybar, “(The exact security of) Message authentication codes,” Institute of Science and Technology Austria, 2017. ista: Rybar M. 2017. (The exact security of) Message authentication codes. Institute of Science and Technology Austria. mla: Rybar, Michal. (The Exact Security of) Message Authentication Codes. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_828. short: M. Rybar, (The Exact Security of) Message Authentication Codes, Institute of Science and Technology Austria, 2017. corr_author: '1' date_created: 2018-12-11T11:48:46Z date_published: 2017-06-26T00:00:00Z date_updated: 2026-04-08T14:18:39Z day: '26' ddc: - '000' degree_awarded: PhD department: - _id: KrPi doi: 10.15479/AT:ISTA:th_828 file: - access_level: open_access checksum: ff8639ec4bded6186f44c7bd3ee26804 content_type: application/pdf creator: system date_created: 2018-12-12T10:10:13Z date_updated: 2020-07-14T12:48:12Z file_id: '4799' file_name: IST-2017-828-v1+3_2017_Rybar_thesis.pdf file_size: 847400 relation: main_file - access_level: closed checksum: 3462101745ce8ad199c2d0f75dae4a7e content_type: application/zip creator: dernst date_created: 2019-04-05T08:24:11Z date_updated: 2020-07-14T12:48:12Z file_id: '6202' file_name: 2017_Thesis_Rybar_source.zip file_size: 26054879 relation: source_file file_date_updated: 2020-07-14T12:48:12Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '86' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '6810' pubrep_id: '828' related_material: record: - id: '2082' relation: part_of_dissertation status: public - id: '6196' relation: part_of_dissertation status: public status: public title: (The exact security of) Message authentication codes type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2017' ... --- _id: '6196' abstract: - lang: eng text: PMAC is a simple and parallel block-cipher mode of operation, which was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a (pseudo)random permutation over n-bit strings, PMAC constitutes a provably secure variable input-length (pseudo)random function. For adversaries making q queries, each of length at most l (in n-bit blocks), and of total length σ ≤ ql, the original paper proves an upper bound on the distinguishing advantage of Ο(σ2/2n), while the currently best bound is Ο (qσ/2n).In this work we show that this bound is tight by giving an attack with advantage Ω (q2l/2n). In the PMAC construction one initially XORs a mask to every message block, where the mask for the ith block is computed as τi := γi·L, where L is a (secret) random value, and γi is the i-th codeword of the Gray code. Our attack applies more generally to any sequence of γi’s which contains a large coset of a subgroup of GF(2n). We then investigate if the security of PMAC can be further improved by using τi’s that are k-wise independent, for k > 1 (the original distribution is only 1-wise independent). We observe that the security of PMAC will not increase in general, even if the masks are chosen from a 2-wise independent distribution, and then prove that the security increases to O(q<2/2n), if the τi are 4-wise independent. Due to simple extension attacks, this is the best bound one can hope for, using any distribution on the masks. Whether 3-wise independence is already sufficient to get this level of security is left as an open problem. author: - first_name: Peter full_name: Gazi, Peter id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87 last_name: Gazi - 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: Michal full_name: Rybar, Michal id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87 last_name: Rybar citation: ama: Gazi P, Pietrzak KZ, Rybar M. The exact security of PMAC. IACR Transactions on Symmetric Cryptology. 2017;2016(2):145-161. doi:10.13154/TOSC.V2016.I2.145-161 apa: Gazi, P., Pietrzak, K. Z., & Rybar, M. (2017). The exact security of PMAC. IACR Transactions on Symmetric Cryptology. Ruhr University Bochum. https://doi.org/10.13154/TOSC.V2016.I2.145-161 chicago: Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact Security of PMAC.” IACR Transactions on Symmetric Cryptology. Ruhr University Bochum, 2017. https://doi.org/10.13154/TOSC.V2016.I2.145-161. ieee: P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact security of PMAC,” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2. Ruhr University Bochum, pp. 145–161, 2017. ista: Gazi P, Pietrzak KZ, Rybar M. 2017. The exact security of PMAC. IACR Transactions on Symmetric Cryptology. 2016(2), 145–161. mla: Gazi, Peter, et al. “The Exact Security of PMAC.” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2, Ruhr University Bochum, 2017, pp. 145–61, doi:10.13154/TOSC.V2016.I2.145-161. short: P. Gazi, K.Z. Pietrzak, M. Rybar, IACR Transactions on Symmetric Cryptology 2016 (2017) 145–161. date_created: 2019-04-04T13:48:23Z date_published: 2017-02-03T00:00:00Z date_updated: 2026-04-08T14:18:39Z day: '03' ddc: - '000' department: - _id: KrPi doi: 10.13154/TOSC.V2016.I2.145-161 ec_funded: 1 file: - access_level: open_access checksum: f23161d685dd957ae8d7274132999684 content_type: application/pdf creator: dernst date_created: 2019-04-04T13:53:58Z date_updated: 2020-07-14T12:47:24Z file_id: '6197' file_name: 2017_IACR_Gazi.pdf file_size: 597335 relation: main_file file_date_updated: 2020-07-14T12:47:24Z has_accepted_license: '1' intvolume: ' 2016' issue: '2' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 145-161 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: IACR Transactions on Symmetric Cryptology publication_identifier: eissn: - 2519-173X publication_status: published publisher: Ruhr University Bochum quality_controlled: '1' related_material: record: - id: '838' relation: dissertation_contains status: public status: public title: The exact security of PMAC 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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 2016 year: '2017' ... --- _id: '732' abstract: - lang: eng text: 'Background: Social insects form densely crowded societies in environments with high pathogen loads, but have evolved collective defences that mitigate the impact of disease. However, colony-founding queens lack this protection and suffer high rates of mortality. The impact of pathogens may be exacerbated in species where queens found colonies together, as healthy individuals may contract pathogens from infectious co-founders. Therefore, we tested whether ant queens avoid founding colonies with pathogen-exposed conspecifics and how they might limit disease transmission from infectious individuals. Results: Using Lasius Niger queens and a naturally infecting fungal pathogen Metarhizium brunneum, we observed that queens were equally likely to found colonies with another pathogen-exposed or sham-treated queen. However, when one queen died, the surviving individual performed biting, burial and removal of the corpse. These undertaking behaviours were performed prophylactically, i.e. targeted equally towards non-infected and infected corpses, as well as carried out before infected corpses became infectious. Biting and burial reduced the risk of the queens contracting and dying from disease from an infectious corpse of a dead co-foundress. Conclusions: We show that co-founding ant queens express undertaking behaviours that, in mature colonies, are performed exclusively by workers. Such infection avoidance behaviours act before the queens can contract the disease and will therefore improve the overall chance of colony founding success in ant queens.' article_number: '219' article_processing_charge: Yes article_type: original author: - first_name: Christopher full_name: Pull, Christopher id: 3C7F4840-F248-11E8-B48F-1D18A9856A87 last_name: Pull orcid: 0000-0003-1122-3982 - first_name: Sylvia full_name: Cremer, Sylvia id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 citation: ama: Pull C, Cremer S. Co-founding ant queens prevent disease by performing prophylactic undertaking behaviour. BMC Evolutionary Biology. 2017;17(1). doi:10.1186/s12862-017-1062-4 apa: Pull, C., & Cremer, S. (2017). Co-founding ant queens prevent disease by performing prophylactic undertaking behaviour. BMC Evolutionary Biology. BioMed Central. https://doi.org/10.1186/s12862-017-1062-4 chicago: Pull, Christopher, and Sylvia Cremer. “Co-Founding Ant Queens Prevent Disease by Performing Prophylactic Undertaking Behaviour.” BMC Evolutionary Biology. BioMed Central, 2017. https://doi.org/10.1186/s12862-017-1062-4. ieee: C. Pull and S. Cremer, “Co-founding ant queens prevent disease by performing prophylactic undertaking behaviour,” BMC Evolutionary Biology, vol. 17, no. 1. BioMed Central, 2017. ista: Pull C, Cremer S. 2017. Co-founding ant queens prevent disease by performing prophylactic undertaking behaviour. BMC Evolutionary Biology. 17(1), 219. mla: Pull, Christopher, and Sylvia Cremer. “Co-Founding Ant Queens Prevent Disease by Performing Prophylactic Undertaking Behaviour.” BMC Evolutionary Biology, vol. 17, no. 1, 219, BioMed Central, 2017, doi:10.1186/s12862-017-1062-4. short: C. Pull, S. Cremer, BMC Evolutionary Biology 17 (2017). corr_author: '1' date_created: 2018-12-11T11:48:12Z date_published: 2017-10-13T00:00:00Z date_updated: 2026-04-08T14:19:10Z day: '13' ddc: - '576' - '592' department: - _id: SyCr doi: 10.1186/s12862-017-1062-4 ec_funded: 1 external_id: isi: - '000412816800001' file: - access_level: open_access checksum: 3e24a2cfd48f49f7b3643d08d30fb480 content_type: application/pdf creator: system date_created: 2018-12-12T10:17:18Z date_updated: 2020-07-14T12:47:55Z file_id: '5271' file_name: IST-2017-882-v1+1_12862_2017_Article_1062.pdf file_size: 949857 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 17' isi: 1 issue: '1' language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 25DC711C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '243071' name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects' publication: BMC Evolutionary Biology publication_identifier: issn: - 1471-2148 publication_status: published publisher: BioMed Central publist_id: '6937' pubrep_id: '882' quality_controlled: '1' related_material: record: - id: '819' relation: dissertation_contains status: public scopus_import: '1' status: public title: Co-founding ant queens prevent disease by performing prophylactic undertaking behaviour 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: 17 year: '2017' ... --- OA_place: publisher _id: '6287' abstract: - lang: eng text: The main objects considered in the present work are simplicial and CW-complexes with vertices forming a random point cloud. In particular, we consider a Poisson point process in R^n and study Delaunay and Voronoi complexes of the first and higher orders and weighted Delaunay complexes obtained as sections of Delaunay complexes, as well as the Čech complex. Further, we examine theDelaunay complex of a Poisson point process on the sphere S^n, as well as of a uniform point cloud, which is equivalent to the convex hull, providing a connection to the theory of random polytopes. Each of the complexes in question can be endowed with a radius function, which maps its cells to the radii of appropriately chosen circumspheres, called the radius of the cell. Applying and developing discrete Morse theory for these functions, joining it together with probabilistic and sometimes analytic machinery, and developing several integral geometric tools, we aim at getting the distributions of circumradii of typical cells. For all considered complexes, we are able to generalize and obtain up to constants the distribution of radii of typical intervals of all types. In low dimensions the constants can be computed explicitly, thus providing the explicit expressions for the expected numbers of cells. In particular, it allows to find the expected density of simplices of every dimension for a Poisson point process in R^4, whereas the result for R^3 was known already in 1970's. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Anton full_name: Nikitenko, Anton id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87 last_name: Nikitenko orcid: 0000-0002-0659-3201 citation: ama: Nikitenko A. Discrete Morse theory for random complexes . 2017. doi:10.15479/AT:ISTA:th_873 apa: Nikitenko, A. (2017). Discrete Morse theory for random complexes . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_873 chicago: Nikitenko, Anton. “Discrete Morse Theory for Random Complexes .” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_873. ieee: A. Nikitenko, “Discrete Morse theory for random complexes ,” Institute of Science and Technology Austria, 2017. ista: Nikitenko A. 2017. Discrete Morse theory for random complexes . Institute of Science and Technology Austria. mla: Nikitenko, Anton. Discrete Morse Theory for Random Complexes . Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_873. short: A. Nikitenko, Discrete Morse Theory for Random Complexes , Institute of Science and Technology Austria, 2017. corr_author: '1' date_created: 2019-04-09T15:04:32Z date_published: 2017-10-27T00:00:00Z date_updated: 2026-04-08T14:19:31Z day: '27' ddc: - '514' - '516' - '519' degree_awarded: PhD department: - _id: HeEd doi: 10.15479/AT:ISTA:th_873 file: - access_level: open_access checksum: ece7e598a2f060b263c2febf7f3fe7f9 content_type: application/pdf creator: dernst date_created: 2019-04-09T14:54:51Z date_updated: 2020-07-14T12:47:26Z file_id: '6289' file_name: 2017_Thesis_Nikitenko.pdf file_size: 2324870 relation: main_file - access_level: closed checksum: 99b7ad76e317efd447af60f91e29b49b content_type: application/zip creator: dernst date_created: 2019-04-09T14:54:51Z date_updated: 2020-07-14T12:47:26Z file_id: '6290' file_name: 2017_Thesis_Nikitenko_source.zip file_size: 2863219 relation: source_file file_date_updated: 2020-07-14T12:47:26Z has_accepted_license: '1' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '86' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria pubrep_id: '873' related_material: record: - id: '87' relation: part_of_dissertation status: public - id: '5678' relation: part_of_dissertation status: public - id: '718' relation: part_of_dissertation status: public 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: 'Discrete Morse theory for random complexes ' 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: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2017' ... --- _id: '718' abstract: - lang: eng text: Mapping every simplex in the Delaunay mosaic of a discrete point set to the radius of the smallest empty circumsphere gives a generalized discrete Morse function. Choosing the points from a Poisson point process in ℝ n , we study the expected number of simplices in the Delaunay mosaic as well as the expected number of critical simplices and nonsingular intervals in the corresponding generalized discrete gradient. Observing connections with other probabilistic models, we obtain precise expressions for the expected numbers in low dimensions. In particular, we obtain the expected numbers of simplices in the Poisson–Delaunay mosaic in dimensions n ≤ 4. article_processing_charge: No arxiv: 1 author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Anton full_name: Nikitenko, Anton id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87 last_name: Nikitenko orcid: 0000-0002-0659-3201 - first_name: Matthias full_name: Reitzner, Matthias last_name: Reitzner citation: ama: Edelsbrunner H, Nikitenko A, Reitzner M. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. 2017;49(3):745-767. doi:10.1017/apr.2017.20 apa: Edelsbrunner, H., Nikitenko, A., & Reitzner, M. (2017). Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. Cambridge University Press. https://doi.org/10.1017/apr.2017.20 chicago: Edelsbrunner, Herbert, Anton Nikitenko, and Matthias Reitzner. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances in Applied Probability. Cambridge University Press, 2017. https://doi.org/10.1017/apr.2017.20. ieee: H. Edelsbrunner, A. Nikitenko, and M. Reitzner, “Expected sizes of poisson Delaunay mosaics and their discrete Morse functions,” Advances in Applied Probability, vol. 49, no. 3. Cambridge University Press, pp. 745–767, 2017. ista: Edelsbrunner H, Nikitenko A, Reitzner M. 2017. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. 49(3), 745–767. mla: Edelsbrunner, Herbert, et al. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances in Applied Probability, vol. 49, no. 3, Cambridge University Press, 2017, pp. 745–67, doi:10.1017/apr.2017.20. short: H. Edelsbrunner, A. Nikitenko, M. Reitzner, Advances in Applied Probability 49 (2017) 745–767. date_created: 2018-12-11T11:48:07Z date_published: 2017-09-01T00:00:00Z date_updated: 2026-04-08T14:19:30Z day: '01' department: - _id: HeEd doi: 10.1017/apr.2017.20 ec_funded: 1 external_id: arxiv: - '1607.05915' isi: - '000416417500004' intvolume: ' 49' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1607.05915 month: '09' oa: 1 oa_version: Preprint page: 745 - 767 project: - _id: 255D761E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '318493' name: Topological Complex Systems - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: Advances in Applied Probability publication_identifier: issn: - 0001-8678 publication_status: published publisher: Cambridge University Press publist_id: '6962' quality_controlled: '1' related_material: record: - id: '6287' relation: dissertation_contains status: public scopus_import: '1' status: public title: Expected sizes of poisson Delaunay mosaics and their discrete Morse functions type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 49 year: '2017' ... --- OA_place: publisher _id: '839' abstract: - lang: eng text: 'This thesis describes a brittle fracture simulation method for visual effects applications. Building upon a symmetric Galerkin boundary element method, we first compute stress intensity factors following the theory of linear elastic fracture mechanics. We then use these stress intensities to simulate the motion of a propagating crack front at a significantly higher resolution than the overall deformation of the breaking object. Allowing for spatial variations of the material''s toughness during crack propagation produces visually realistic, highly-detailed fracture surfaces. Furthermore, we introduce approximations for stress intensities and crack opening displacements, resulting in both practical speed-up and theoretically superior runtime complexity compared to previous methods. While we choose a quasi-static approach to fracture mechanics, ignoring dynamic deformations, we also couple our fracture simulation framework to a standard rigid-body dynamics solver, enabling visual effects artists to simulate both large scale motion, as well as fracturing due to collision forces in a combined system. As fractures inside of an object grow, their geometry must be represented both in the coarse boundary element mesh, as well as at the desired fine output resolution. Using a boundary element method, we avoid complicated volumetric meshing operations. Instead we describe a simple set of surface meshing operations that allow us to progressively add cracks to the mesh of an object and still re-use all previously computed entries of the linear boundary element system matrix. On the high resolution level, we opt for an implicit surface representation. We then describe how to capture fracture surfaces during crack propagation, as well as separate the individual fragments resulting from the fracture process, based on this implicit representation. We show results obtained with our method, either solving the full boundary element system in every time step, or alternatively using our fast approximations. These results demonstrate that both of these methods perform well in basic test cases and produce realistic fracture surfaces. Furthermore we show that our fast approximations substantially out-perform the standard approach in more demanding scenarios. Finally, these two methods naturally combine, using the full solution while the problem size is manageably small and switching to the fast approximations later on. The resulting hybrid method gives the user a direct way to choose between speed and accuracy of the simulation. ' acknowledgement: "ERC H2020 programme (grant agreement no. 638176)\r\nFirst of all, let me thank my committee members, especially my supervisor, Chris\r\nWojtan, for supporting me throughout my PhD. Obviously, none of this work would\r\nhave been possible without you.\r\nFurthermore, Thank You to all the people who have contributed to this work in various\r\nways, in particular Martin Schanz and his group for providing and supporting the\r\nHyENA boundary element library, as well as Eder Miguel and Morten Bojsen-Hansen\r\nfor (repeatedly) proof reading and providing valuable suggestions during the writing\r\nof this thesis.\r\nI would also like to thank Bernd Bickel, and all the members – past and present – of his\r\nand Chris’ research groups at IST Austria for always providing honest and insightful\r\nfeedback throughout many joint group meetings, as well as Christopher Batty, Eitan\r\nGrinspun, and Fang Da for many insights into boundary element methods during our\r\ncollaboration.\r\nAs only virtual objects have been harmed in the process of creating this work, I would\r\nlike to acknowledge the Stanford scanning repository for providing the “Bunny” and\r\n“Armadillo” models, the AIM@SHAPE repository for “Pierre’s hand, watertight”, and\r\nS. Gainsbourg for the “Column” via Archive3D.net. Sorry for breaking these models\r\nin many different ways.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: David full_name: Hahn, David id: 357A6A66-F248-11E8-B48F-1D18A9856A87 last_name: Hahn citation: ama: Hahn D. Brittle fracture simulation with boundary elements for computer graphics. 2017. doi:10.15479/AT:ISTA:th_855 apa: Hahn, D. (2017). Brittle fracture simulation with boundary elements for computer graphics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_855 chicago: Hahn, David. “Brittle Fracture Simulation with Boundary Elements for Computer Graphics.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_855. ieee: D. Hahn, “Brittle fracture simulation with boundary elements for computer graphics,” Institute of Science and Technology Austria, 2017. ista: Hahn D. 2017. Brittle fracture simulation with boundary elements for computer graphics. Institute of Science and Technology Austria. mla: Hahn, David. Brittle Fracture Simulation with Boundary Elements for Computer Graphics. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_855. short: D. Hahn, Brittle Fracture Simulation with Boundary Elements for Computer Graphics, Institute of Science and Technology Austria, 2017. corr_author: '1' date_created: 2018-12-11T11:48:47Z date_published: 2017-08-14T00:00:00Z date_updated: 2026-04-08T14:20:16Z day: '14' ddc: - '004' - '005' - '006' - '531' - '621' degree_awarded: PhD department: - _id: ChWo doi: 10.15479/AT:ISTA:th_855 ec_funded: 1 file: - access_level: open_access checksum: 6c1ae8c90bfaba5e089417fefbc4a272 content_type: application/pdf creator: system date_created: 2018-12-12T10:14:46Z date_updated: 2020-07-14T12:48:13Z file_id: '5100' file_name: IST-2017-855-v1+1_thesis_online_pdfA.pdf file_size: 14596191 relation: main_file - access_level: closed checksum: 421672f68d563b029869c5cf1713f919 content_type: application/zip creator: dernst date_created: 2019-04-05T08:40:30Z date_updated: 2020-07-14T12:48:13Z file_id: '6207' file_name: 2017_thesis_Hahn_source.zip file_size: 15060566 relation: source_file file_date_updated: 2020-07-14T12:48:13Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-sa/4.0/ month: '08' oa: 1 oa_version: Published Version page: '124' project: - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '6809' pubrep_id: '855' related_material: record: - id: '5568' relation: popular_science status: public - id: '1362' relation: part_of_dissertation status: public - id: '1633' relation: part_of_dissertation status: public status: public supervisor: - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 title: Brittle fracture simulation with boundary elements for computer graphics tmp: image: /images/cc_by_sa.png legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0) short: CC BY-SA (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2017' ... --- OA_place: publisher _id: '202' abstract: - lang: eng text: 'Restriction-modification (RM) represents the simplest and possibly the most widespread mechanism of self/non-self discrimination in nature. In order to provide bacteria with immunity against bacteriophages and other parasitic genetic elements, RM systems rely on a balance between two enzymes: the restriction enzyme, which cleaves non-self DNA at specific restriction sites, and the modification enzyme, which tags the host’s DNA as self and thus protects it from cleavage. In this thesis, I use population and single-cell level experiments in combination with mathematical modeling to study different aspects of the interplay between RM systems, bacteria and bacteriophages. First, I analyze how mutations in phage restriction sites affect the probability of phage escape – an inherently stochastic process, during which phages accidently get modified instead of restricted. Next, I use single-cell experiments to show that RM systems can, with a low probability, attack the genome of their bacterial host and that this primitive form of autoimmunity leads to a tradeoff between the evolutionary cost and benefit of RM systems. Finally, I investigate the nature of interactions between bacteria, RM systems and temperate bacteriophages to find that, as a consequence of phage escape and its impact on population dynamics, RM systems can promote acquisition of symbiotic bacteriophages, rather than limit it. The results presented here uncover new fundamental biological properties of RM systems and highlight their importance in the ecology and evolution of bacteria, bacteriophages and their interactions.' acknowledgement: "During my PhD studies, I received help from many people, all of which unfortunately cannot be listed here. I thank them deeply and hope that I never made them regret their kindness.\r\nI would like to express my deepest gratitude to Călin Guet, who went far beyond his responsibilities as an advisor and was to me also a great mentor and a friend. Călin never questioned my potential or lacked compassion and I cannot thank him enough for cultivating in me an independent scientist. I was amazed by his ability to recognize the most fascinating scientific problems in objects of study that others would find mundane. I hope I adopted at least a fraction of this ability.\r\nI will be forever grateful to Bruce Levin for all his support and especially for giving me the best possible example of how one can practice excellent science with humor and style. Working with Bruce was a true privilege.\r\nI thank Jonathan Bollback and Gašper Tkačik for serving in my PhD committee and the Austrian Academy of Science for funding my PhD research via the DOC fellowship.\r\nI thank all our lab members: Tobias Bergmiller for his guidance, especially in the first years of my research, and for being a good friend throughout; Remy Chait for staying in the lab at unreasonable hours and for the good laughs at bad jokes we shared; Anna Staron for supportively listening to my whines whenever I had to run a gel; Magdalena Steinrück for her pioneering work in the lab; Kathrin Tomasek for keeping the entropic forces in check and for her FACS virtuosity; Isabella Tomanek for always being nice to me, no matter how much bench space I took from her.\r\nI thank all my collaborators: Reiko Okura and Yuichi Wakamoto for performing and analyzing the microfluidic experiments; Long Qian and Edo Kussell for their bioinformatics analysis; Dominik Refardt for the λ kan phage; Moritz for his help with the mathematical modeling. I thank Fabienne Jesse for her tireless editorial work on all our manuscripts.\r\nFinally, I would like to thank my family and especially my wife Edita, who sacrificed a lot so that I can pursue my goals and dreams.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Maros full_name: Pleska, Maros id: 4569785E-F248-11E8-B48F-1D18A9856A87 last_name: Pleska orcid: 0000-0001-7460-7479 citation: ama: Pleska M. Biology of restriction-modification systems at the single-cell and population level. 2017. doi:10.15479/AT:ISTA:th_916 apa: Pleska, M. (2017). Biology of restriction-modification systems at the single-cell and population level. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_916 chicago: Pleska, Maros. “Biology of Restriction-Modification Systems at the Single-Cell and Population Level.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_916. ieee: M. Pleska, “Biology of restriction-modification systems at the single-cell and population level,” Institute of Science and Technology Austria, 2017. ista: Pleska M. 2017. Biology of restriction-modification systems at the single-cell and population level. Institute of Science and Technology Austria. mla: Pleska, Maros. Biology of Restriction-Modification Systems at the Single-Cell and Population Level. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_916. short: M. Pleska, Biology of Restriction-Modification Systems at the Single-Cell and Population Level, Institute of Science and Technology Austria, 2017. corr_author: '1' date_created: 2018-12-11T11:45:10Z date_published: 2017-10-01T00:00:00Z date_updated: 2026-04-08T14:19:44Z day: '01' ddc: - '576' - '579' degree_awarded: PhD department: - _id: CaGu doi: 10.15479/AT:ISTA:th_916 file: - access_level: open_access checksum: 33cfb59674e91f82e3738396d3fb3776 content_type: application/pdf creator: system date_created: 2018-12-12T10:08:48Z date_updated: 2020-07-14T12:45:24Z file_id: '4710' file_name: IST-2018-916-v1+3_2017_Pleska_Maros_Thesis.pdf file_size: 18569590 relation: main_file - access_level: closed checksum: dcc239968decb233e7f98cf1083d8c26 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: dernst date_created: 2019-04-05T08:33:14Z date_updated: 2020-07-14T12:45:24Z file_id: '6204' file_name: 2017_Pleska_Maros_Thesis.docx file_size: 2801649 relation: source_file file_date_updated: 2020-07-14T12:45:24Z has_accepted_license: '1' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '126' project: - _id: 251D65D8-B435-11E9-9278-68D0E5697425 grant_number: '24210' name: Effects of Stochasticity on the Function of Restriction-Modi cation Systems at the Single-Cell Level publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '7711' pubrep_id: '916' related_material: record: - id: '457' relation: part_of_dissertation status: public - id: '561' relation: part_of_dissertation status: public - id: '1243' relation: part_of_dissertation status: public status: public supervisor: - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 title: Biology of restriction-modification systems at the single-cell and population level 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: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2017' ...