[{"doi":"10.1007/978-3-319-73915-1_14","department":[{"_id":"UlWa"}],"title":"Thrackles: An improved upper bound","day":"21","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","abstract":[{"text":"A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an odd number of times. It is also shown that the maximum number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound is best possible for infinitely many values of n.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1708.08037","open_access":"1"}],"scopus_import":"1","quality_controlled":"1","type":"conference","volume":10692,"citation":{"short":"R. Fulek, J. Pach, in:, Springer, 2018, pp. 160–166.","ista":"Fulek R, Pach J. 2018. Thrackles: An improved upper bound. GD: Graph Drawing and Network Visualization, LNCS, vol. 10692, 160–166.","mla":"Fulek, Radoslav, and János Pach. <i>Thrackles: An Improved Upper Bound</i>. Vol. 10692, Springer, 2018, pp. 160–66, doi:<a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">10.1007/978-3-319-73915-1_14</a>.","ieee":"R. Fulek and J. Pach, “Thrackles: An improved upper bound,” presented at the GD: Graph Drawing and Network Visualization, Boston, MA, United States, 2018, vol. 10692, pp. 160–166.","ama":"Fulek R, Pach J. Thrackles: An improved upper bound. In: Vol 10692. Springer; 2018:160-166. doi:<a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">10.1007/978-3-319-73915-1_14</a>","chicago":"Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound,” 10692:160–66. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">https://doi.org/10.1007/978-3-319-73915-1_14</a>.","apa":"Fulek, R., &#38; Pach, J. (2018). Thrackles: An improved upper bound (Vol. 10692, pp. 160–166). Presented at the GD: Graph Drawing and Network Visualization, Boston, MA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">https://doi.org/10.1007/978-3-319-73915-1_14</a>"},"article_processing_charge":"No","date_published":"2018-01-21T00:00:00Z","_id":"433","date_updated":"2026-04-16T09:48:11Z","date_created":"2018-12-11T11:46:27Z","publist_id":"7390","oa":1,"author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav","last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774"},{"full_name":"Pach, János","first_name":"János","last_name":"Pach"}],"month":"01","publisher":"Springer","oa_version":"Submitted Version","conference":{"name":"GD: Graph Drawing and Network Visualization","location":"Boston, MA, United States","start_date":"201-09-25","end_date":"2017-09-27"},"year":"2018","status":"public","language":[{"iso":"eng"}],"external_id":{"arxiv":["1708.08037"]},"intvolume":"     10692","arxiv":1,"alternative_title":["LNCS"],"page":"160 - 166","related_material":{"record":[{"status":"public","id":"5857","relation":"later_version"}]}},{"day":"01","publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Communication-efficient randomized consensus","ddc":["000"],"publication":"Distributed Computing","department":[{"_id":"DaAl"}],"file":[{"creator":"dernst","checksum":"69b46e537acdcac745237ddb853fcbb5","date_updated":"2020-07-14T12:46:38Z","date_created":"2019-01-22T07:25:51Z","file_name":"2017_DistribComp_Alistarh.pdf","content_type":"application/pdf","access_level":"open_access","file_size":595707,"file_id":"5867","relation":"main_file"}],"license":"https://creativecommons.org/licenses/by/4.0/","doi":"10.1007/s00446-017-0315-1","file_date_updated":"2020-07-14T12:46:38Z","scopus_import":"1","quality_controlled":"1","type":"journal_article","volume":31,"corr_author":"1","has_accepted_license":"1","abstract":[{"text":"We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model.","lang":"eng"}],"isi":1,"year":"2018","author":[{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"first_name":"James","last_name":"Aspnes","full_name":"Aspnes, James"},{"last_name":"King","first_name":"Valerie","full_name":"King, Valerie"},{"full_name":"Saia, Jared","last_name":"Saia","first_name":"Jared"}],"oa_version":"Published Version","publisher":"Springer","month":"11","publist_id":"7281","date_created":"2018-12-11T11:47:01Z","date_updated":"2026-04-16T09:53:54Z","oa":1,"citation":{"chicago":"Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” <i>Distributed Computing</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00446-017-0315-1\">https://doi.org/10.1007/s00446-017-0315-1</a>.","apa":"Alistarh, D.-A., Aspnes, J., King, V., &#38; Saia, J. (2018). Communication-efficient randomized consensus. <i>Distributed Computing</i>. Springer. <a href=\"https://doi.org/10.1007/s00446-017-0315-1\">https://doi.org/10.1007/s00446-017-0315-1</a>","mla":"Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.” <i>Distributed Computing</i>, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:<a href=\"https://doi.org/10.1007/s00446-017-0315-1\">10.1007/s00446-017-0315-1</a>.","ieee":"D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” <i>Distributed Computing</i>, vol. 31, no. 6. Springer, pp. 489–501, 2018.","ama":"Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. <i>Distributed Computing</i>. 2018;31(6):489-501. doi:<a href=\"https://doi.org/10.1007/s00446-017-0315-1\">10.1007/s00446-017-0315-1</a>","ista":"Alistarh D-A, Aspnes J, King V, Saia J. 2018. Communication-efficient randomized consensus. Distributed Computing. 31(6), 489–501.","short":"D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501."},"article_processing_charge":"Yes (via OA deal)","date_published":"2018-11-01T00:00:00Z","_id":"536","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"page":"489-501","intvolume":"        31","issue":"6","external_id":{"isi":["000443832300005"]},"publication_identifier":{"issn":["0178-2770"]},"status":"public","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"Concurrent accesses to shared data structures must be synchronized to avoid data races. Coarse-grained synchronization, which locks the entire data structure, is easy to implement but does not scale. Fine-grained synchronization can scale well, but can be hard to reason about. Hand-over-hand locking, in which operations are pipelined as they traverse the data structure, combines fine-grained synchronization with ease of use. However, the traditional implementation suffers from inherent overheads. This paper introduces snapshot-based synchronization (SBS), a novel hand-over-hand locking mechanism. SBS decouples the synchronization state from the data, significantly improving cache utilization. Further, it relies on guarantees provided by pipelining to minimize synchronization that requires cross-thread communication. Snapshot-based synchronization thus scales much better than traditional hand-over-hand locking, while maintaining the same ease of use."}],"has_accepted_license":"1","volume":11014,"quality_controlled":"1","type":"conference","scopus_import":"1","file_date_updated":"2020-07-14T12:48:14Z","doi":"10.1007/978-3-319-96983-1_33","file":[{"file_id":"5954","relation":"main_file","file_size":665372,"date_updated":"2020-07-14T12:48:14Z","date_created":"2019-02-12T07:40:40Z","checksum":"13a3f250be8878405e791b53c19722ad","content_type":"application/pdf","file_name":"2018_Brown.pdf","access_level":"open_access","creator":"dernst"}],"department":[{"_id":"DaAl"}],"ddc":["000"],"title":"Snapshot based synchronization: A fast replacement for Hand-over-Hand locking","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","acknowledgement":"Trevor Brown was supported in part by the ISF (grants 2005/17 & 1749/14) and by a NSERC post-doctoral fellowship.","day":"01","language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["0302-9743"]},"external_id":{"isi":["000851042300031"]},"intvolume":"     11014","page":"465 - 479","project":[{"name":"NSERC Postdoctoral fellowship","_id":"26450934-B435-11E9-9278-68D0E5697425"}],"alternative_title":["LNCS"],"_id":"85","date_published":"2018-08-01T00:00:00Z","article_processing_charge":"No","citation":{"ista":"Gilad E, Brown TA, Oskin M, Etsion Y. 2018. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. Euro-Par: European Conference on Parallel Processing, LNCS, vol. 11014, 465–479.","short":"E. Gilad, T.A. Brown, M. Oskin, Y. Etsion, in:, Springer, 2018, pp. 465–479.","chicago":"Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>.","apa":"Gilad, E., Brown, T. A., Oskin, M., &#38; Etsion, Y. (2018). Snapshot based synchronization: A fast replacement for Hand-over-Hand locking (Vol. 11014, pp. 465–479). Presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>","ieee":"E. Gilad, T. A. Brown, M. Oskin, and Y. Etsion, “Snapshot based synchronization: A fast replacement for Hand-over-Hand locking,” presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy, 2018, vol. 11014, pp. 465–479.","mla":"Gilad, Eran, et al. <i>Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking</i>. Vol. 11014, Springer, 2018, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>.","ama":"Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>"},"oa":1,"date_created":"2018-12-11T11:44:33Z","publist_id":"7969","date_updated":"2026-04-16T09:53:41Z","publisher":"Springer","oa_version":"Preprint","month":"08","author":[{"full_name":"Gilad, Eran","last_name":"Gilad","first_name":"Eran"},{"full_name":"Brown, Trevor A","last_name":"Brown","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A"},{"full_name":"Oskin, Mark","first_name":"Mark","last_name":"Oskin"},{"full_name":"Etsion, Yoav","first_name":"Yoav","last_name":"Etsion"}],"year":"2018","isi":1,"conference":{"location":"Turin, Italy","name":"Euro-Par: European Conference on Parallel Processing","start_date":"2018-08-27","end_date":"2018-08-31"}},{"article_type":"original","isi":1,"year":"2018","month":"11","oa_version":"Published Version","publisher":"FASEB","author":[{"last_name":"Liutkeviciute","first_name":"Zita","full_name":"Liutkeviciute, Zita"},{"last_name":"Gil Mansilla","first_name":"Esther","full_name":"Gil Mansilla, Esther"},{"first_name":"Thomas","last_name":"Eder","full_name":"Eder, Thomas"},{"id":"351ED2AA-F248-11E8-B48F-1D18A9856A87","first_name":"Barbara E","last_name":"Casillas Perez","full_name":"Casillas Perez, Barbara E"},{"last_name":"Giulia Di Giglio","first_name":"Maria","full_name":"Giulia Di Giglio, Maria"},{"last_name":"Muratspahić","first_name":"Edin","full_name":"Muratspahić, Edin"},{"last_name":"Grebien","first_name":"Florian","full_name":"Grebien, Florian"},{"full_name":"Rattei, Thomas","last_name":"Rattei","first_name":"Thomas"},{"full_name":"Muttenthaler, Markus","first_name":"Markus","last_name":"Muttenthaler"},{"first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia"},{"full_name":"Gruber, Christian","last_name":"Gruber","first_name":"Christian"}],"oa":1,"date_updated":"2026-04-16T09:53:18Z","publist_id":"7721","date_created":"2018-12-11T11:45:08Z","_id":"194","date_published":"2018-11-29T00:00:00Z","citation":{"ama":"Liutkeviciute Z, Gil Mansilla E, Eder T, et al. Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity. <i>The FASEB Journal</i>. 2018;32(12):6808-6821. doi:<a href=\"https://doi.org/10.1096/fj.201800443\">10.1096/fj.201800443</a>","ieee":"Z. Liutkeviciute <i>et al.</i>, “Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity,” <i>The FASEB Journal</i>, vol. 32, no. 12. FASEB, pp. 6808–6821, 2018.","mla":"Liutkeviciute, Zita, et al. “Oxytocin-like Signaling in Ants Influences Metabolic Gene Expression and Locomotor Activity.” <i>The FASEB Journal</i>, vol. 32, no. 12, FASEB, 2018, pp. 6808–21, doi:<a href=\"https://doi.org/10.1096/fj.201800443\">10.1096/fj.201800443</a>.","apa":"Liutkeviciute, Z., Gil Mansilla, E., Eder, T., Casillas Perez, B. E., Giulia Di Giglio, M., Muratspahić, E., … Gruber, C. (2018). Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity. <i>The FASEB Journal</i>. FASEB. <a href=\"https://doi.org/10.1096/fj.201800443\">https://doi.org/10.1096/fj.201800443</a>","chicago":"Liutkeviciute, Zita, Esther Gil Mansilla, Thomas Eder, Barbara E Casillas Perez, Maria Giulia Di Giglio, Edin Muratspahić, Florian Grebien, et al. “Oxytocin-like Signaling in Ants Influences Metabolic Gene Expression and Locomotor Activity.” <i>The FASEB Journal</i>. FASEB, 2018. <a href=\"https://doi.org/10.1096/fj.201800443\">https://doi.org/10.1096/fj.201800443</a>.","short":"Z. Liutkeviciute, E. Gil Mansilla, T. Eder, B.E. Casillas Perez, M. Giulia Di Giglio, E. Muratspahić, F. Grebien, T. Rattei, M. Muttenthaler, S. Cremer, C. Gruber, The FASEB Journal 32 (2018) 6808–6821.","ista":"Liutkeviciute Z, Gil Mansilla E, Eder T, Casillas Perez BE, Giulia Di Giglio M, Muratspahić E, Grebien F, Rattei T, Muttenthaler M, Cremer S, Gruber C. 2018. Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity. The FASEB Journal. 32(12), 6808–6821."},"article_processing_charge":"No","page":"6808-6821","project":[{"_id":"25E3D34E-B435-11E9-9278-68D0E5697425","name":"Individual function and social role of oxytocin-like neuropeptides in ants"}],"intvolume":"        32","external_id":{"pmid":["29939785"],"isi":["000449359700035"]},"issue":"12","language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["0892-6638"]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","day":"29","title":"Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity","publication":"The FASEB Journal","department":[{"_id":"SyCr"}],"pmid":1,"doi":"10.1096/fj.201800443","volume":32,"type":"journal_article","quality_controlled":"1","scopus_import":"1","main_file_link":[{"url":" https://doi.org/10.1096/fj.201800443","open_access":"1"}],"abstract":[{"lang":"eng","text":"Ants are emerging model systems to study cellular signaling because distinct castes possess different physiologic phenotypes within the same colony. Here we studied the functionality of inotocin signaling, an insect ortholog of mammalian oxytocin (OT), which was recently discovered in ants. In Lasius ants, we determined that specialization within the colony, seasonal factors, and physiologic conditions down-regulated the expression of the OT-like signaling system. Given this natural variation, we interrogated its function using RNAi knockdowns. Next-generation RNA sequencing of OT-like precursor knock-down ants highlighted its role in the regulation of genes involved in metabolism. Knock-down ants exhibited higher walking activity and increased self-grooming in the brood chamber. We propose that OT-like signaling in ants is important for regulating metabolic processes and locomotion."}]},{"article_type":"original","year":"2018","isi":1,"oa_version":"Submitted Version","publisher":"Society for Industrial and Applied Mathematics ","month":"03","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","first_name":"Mabel","last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel"}],"date_updated":"2026-04-16T09:53:02Z","date_created":"2018-12-11T11:45:46Z","publist_id":"7553","oa":1,"date_published":"2018-03-29T00:00:00Z","_id":"312","citation":{"chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics , 2018. <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>.","apa":"Edelsbrunner, H., &#38; Iglesias Ham, M. (2018). On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>","mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>, vol. 32, no. 1, Society for Industrial and Applied Mathematics , 2018, pp. 750–82, doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>.","ieee":"H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice for soft sphere packing,” <i>SIAM J Discrete Math</i>, vol. 32, no. 1. Society for Industrial and Applied Mathematics , pp. 750–782, 2018.","ama":"Edelsbrunner H, Iglesias Ham M. On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. 2018;32(1):750-782. doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>","ista":"Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.","short":"H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782."},"article_processing_charge":"No","project":[{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"page":"750 - 782","intvolume":"        32","issue":"1","external_id":{"isi":["000428958900038"]},"publication_identifier":{"issn":["0895-4801"]},"status":"public","language":[{"iso":"eng"}],"publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","acknowledgement":"This work was partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics,” through grant I02979-N35 of the Austrian Science Fund (FWF).","day":"29","publication":"SIAM J Discrete Math","title":"On the optimality of the FCC lattice for soft sphere packing","department":[{"_id":"HeEd"}],"doi":"10.1137/16M1097201","volume":32,"scopus_import":"1","type":"journal_article","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf"}],"abstract":[{"text":"Motivated by biological questions, we study configurations of equal spheres that neither pack nor cover. Placing their centers on a lattice, we define the soft density of the configuration by penalizing multiple overlaps. Considering the 1-parameter family of diagonally distorted 3-dimensional integer lattices, we show that the soft density is maximized at the FCC lattice.","lang":"eng"}]},{"month":"07","oa_version":"Published Version","publisher":"Springer","author":[{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","last_name":"Giacobbe","orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"isi":1,"year":"2018","conference":{"name":"CAV: Computer Aided Verification","location":"Oxford, United Kingdom","end_date":"2018-07-17","start_date":"2018-07-14"},"_id":"140","date_published":"2018-07-18T00:00:00Z","citation":{"ista":"Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer Aided Verification, LNCS, vol. 10981, 468–486.","short":"G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.","chicago":"Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,” 10981:468–86. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">https://doi.org/10.1007/978-3-319-96145-3_25</a>.","apa":"Frehse, G., Giacobbe, M., &#38; Henzinger, T. A. (2018). Space-time interpolants (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">https://doi.org/10.1007/978-3-319-96145-3_25</a>","ieee":"G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 468–486.","mla":"Frehse, Goran, et al. <i>Space-Time Interpolants</i>. Vol. 10981, Springer, 2018, pp. 468–86, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">10.1007/978-3-319-96145-3_25</a>.","ama":"Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981. Springer; 2018:468-486. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">10.1007/978-3-319-96145-3_25</a>"},"article_processing_charge":"No","oa":1,"date_updated":"2026-04-16T09:55:04Z","date_created":"2018-12-11T11:44:50Z","publist_id":"7783","intvolume":"     10981","page":"468 - 486","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6894"}]},"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["0302-9743"]},"external_id":{"isi":["000491481600025"]},"title":"Space-time interpolants","ddc":["005"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","day":"18","file_date_updated":"2020-07-14T12:44:50Z","doi":"10.1007/978-3-319-96145-3_25","pubrep_id":"1010","file":[{"creator":"system","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:44:50Z","file_name":"IST-2018-1010-v1+1_space-time_interpolants.pdf","date_created":"2018-12-12T10:17:53Z","checksum":"6dca832f575d6b3f0ea9dff56f579142","file_size":563710,"relation":"main_file","file_id":"5310"}],"department":[{"_id":"ToHe"}],"volume":10981,"quality_controlled":"1","type":"conference","scopus_import":"1","abstract":[{"text":"Reachability analysis is difficult for hybrid automata with affine differential equations, because the reach set needs to be approximated. Promising abstraction techniques usually employ interval methods or template polyhedra. Interval methods account for dense time and guarantee soundness, and there are interval-based tools that overapproximate affine flowpipes. But interval methods impose bounded and rigid shapes, which make refinement expensive and fixpoint detection difficult. Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded, but sound template refinement for unbounded reachability analysis has been implemented only for systems with piecewise constant dynamics. We capitalize on the advantages of both techniques, combining interval arithmetic and template polyhedra, using the former to abstract time and the latter to abstract space. During a CEGAR loop, whenever a spurious error trajectory is found, we compute additional space constraints and split time intervals, and use these space-time interpolants to eliminate the counterexample. Space-time interpolation offers a lazy, flexible framework for increasing precision while guaranteeing soundness, both for error avoidance and fixpoint detection. To the best of out knowledge, this is the first abstraction refinement scheme for the reachability analysis over unbounded and dense time of affine hybrid systems, which is both sound and automatic. We demonstrate the effectiveness of our algorithm with several benchmark examples, which cannot be handled by other tools.","lang":"eng"}],"has_accepted_license":"1"},{"department":[{"_id":"ToHe"}],"doi":"10.1007/978-3-030-04612-5_2","day":"21","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"Infinite-duration poorman-bidding games","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. Such games are central in formal verification since they model the interaction between a non-terminating system and its environment. We study bidding games in which the players bid for the right to move the token. Two bidding rules have been defined. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the “bank” rather than the other player. While poorman reachability games have been studied before, we present, for the first time, results on infinite-duration poorman games. A central quantity in these games is the ratio between the two players’ initial budgets. The questions we study concern a necessary and sufficient ratio with which a player can achieve a goal. For reachability objectives, such threshold ratios are known to exist for both bidding rules. We show that the properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case. Our most interesting results concern quantitative poorman games, namely poorman mean-payoff games, where we construct optimal strategies depending on the initial ratio, by showing a connection with random-turn based games. The connection in itself is interesting, because it does not hold for reachability poorman games. We also solve the complexity problems that arise in poorman bidding games.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1804.04372","open_access":"1"}],"scopus_import":"1","quality_controlled":"1","type":"conference","volume":11316,"date_updated":"2026-04-16T09:54:39Z","date_created":"2018-12-30T22:59:14Z","oa":1,"citation":{"apa":"Avni, G., Henzinger, T. A., &#38; Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">https://doi.org/10.1007/978-3-030-04612-5_2</a>","chicago":"Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">https://doi.org/10.1007/978-3-030-04612-5_2</a>.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games. In: Vol 11316. Springer; 2018:21-36. doi:<a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">10.1007/978-3-030-04612-5_2</a>","mla":"Avni, Guy, et al. <i>Infinite-Duration Poorman-Bidding Games</i>. Vol. 11316, Springer, 2018, pp. 21–36, doi:<a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">10.1007/978-3-030-04612-5_2</a>.","ieee":"G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.","ista":"Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding games. 14th International Conference on Web and Internet Economics, WINE, LNCS, vol. 11316, 21–36.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36."},"article_processing_charge":"No","date_published":"2018-11-21T00:00:00Z","_id":"5788","conference":{"end_date":"2018-12-17","start_date":"2018-12-15","location":"Oxford, UK","name":"14th International Conference on Web and Internet Economics, WINE"},"year":"2018","isi":1,"author":[{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Preprint","publisher":"Springer","month":"11","external_id":{"isi":["000865933000002"],"arxiv":["1804.04372"]},"status":"public","publication_identifier":{"issn":["0302-9743"],"isbn":["9783030046118"]},"language":[{"iso":"eng"}],"alternative_title":["LNCS"],"project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF"}],"page":"21-36","intvolume":"     11316","arxiv":1},{"alternative_title":["LNCS"],"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"page":"181-201","intvolume":"     11275","arxiv":1,"external_id":{"arxiv":["1806.06683"],"isi":["000916310900011"]},"status":"public","publication_identifier":{"isbn":["9783030027674"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"conference":{"name":"16th Asian Symposium on Programming Languages and Systems, APLAS","location":"Wellington, New Zealand","end_date":"2018-12-06","start_date":"2018-12-02"},"isi":1,"year":"2018","author":[{"full_name":"Huang, Mingzhang","last_name":"Huang","first_name":"Mingzhang"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"}],"month":"12","publisher":"Springer","oa_version":"Preprint","date_created":"2018-12-16T22:59:20Z","date_updated":"2026-04-16T09:54:21Z","oa":1,"article_processing_charge":"No","citation":{"short":"M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.","ista":"Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275, 181–201.","ieee":"M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201.","mla":"Huang, Mingzhang, et al. <i>New Approaches for Almost-Sure Termination of Probabilistic Programs</i>. Edited by Sukyoung Ryu, vol. 11275, Springer, 2018, pp. 181–201, doi:<a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">10.1007/978-3-030-02768-1_11</a>.","ama":"Huang M, Fu H, Chatterjee K. New approaches for almost-sure termination of probabilistic programs. In: Ryu S, ed. Vol 11275. Springer; 2018:181-201. doi:<a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">10.1007/978-3-030-02768-1_11</a>","chicago":"Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu, 11275:181–201. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">https://doi.org/10.1007/978-3-030-02768-1_11</a>.","apa":"Huang, M., Fu, H., &#38; Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. <a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">https://doi.org/10.1007/978-3-030-02768-1_11</a>"},"date_published":"2018-12-01T00:00:00Z","_id":"5679","scopus_import":"1","type":"conference","quality_controlled":"1","volume":11275,"editor":[{"full_name":"Ryu, Sukyoung","last_name":"Ryu","first_name":"Sukyoung"}],"abstract":[{"text":"We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover, using this approach we can obtain explicit optimal bounds on tail probabilities of non-termination within a given number of steps. Second, we present a new approach based on Central Limit Theorem for the almost-sure termination problem, and show that this approach can establish almost-sure termination of programs which none of the existing approaches can handle. Finally, we discuss algorithmic approaches for the two above methods that lead to automated analysis techniques for almost-sure termination of probabilistic programs.","lang":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1806.06683","open_access":"1"}],"day":"01","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"New approaches for almost-sure termination of probabilistic programs","department":[{"_id":"KrCh"}],"doi":"10.1007/978-3-030-02768-1_11"},{"doi":"10.1084/jem.20181934","file_date_updated":"2020-07-14T12:47:09Z","department":[{"_id":"MiSi"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","file":[{"file_size":1216437,"relation":"main_file","file_id":"5931","creator":"dernst","access_level":"open_access","content_type":"application/pdf","date_created":"2019-02-06T08:49:52Z","file_name":"2018_JournalExperMed_Reversat.pdf","checksum":"687beea1d64c213f4cb9e3c29ec11a14","date_updated":"2020-07-14T12:47:09Z"}],"title":"IgM's exit route","ddc":["570"],"publication":"Journal of Experimental Medicine","day":"20","tmp":{"image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","abstract":[{"text":"The release of IgM is the first line of an antibody response and precedes the generation of high affinity IgG in germinal centers. Once secreted by freshly activated plasmablasts, IgM is released into the efferent lymph of reactive lymph nodes as early as 3 d after immunization. As pentameric IgM has an enormous size of 1,000 kD, its diffusibility is low, and one might wonder how it can pass through the densely lymphocyte-packed environment of a lymph node parenchyma in order to reach its exit. In this issue of JEM, Thierry et al. show that, in order to reach the blood stream, IgM molecules take a specific micro-anatomical route via lymph node conduits.","lang":"eng"}],"has_accepted_license":"1","quality_controlled":"1","type":"journal_article","scopus_import":"1","volume":215,"article_processing_charge":"No","citation":{"ieee":"A. Reversat and M. K. Sixt, “IgM’s exit route,” <i>Journal of Experimental Medicine</i>, vol. 215, no. 12. Rockefeller University Press, pp. 2959–2961, 2018.","mla":"Reversat, Anne, and Michael K. Sixt. “IgM’s Exit Route.” <i>Journal of Experimental Medicine</i>, vol. 215, no. 12, Rockefeller University Press, 2018, pp. 2959–61, doi:<a href=\"https://doi.org/10.1084/jem.20181934\">10.1084/jem.20181934</a>.","ama":"Reversat A, Sixt MK. IgM’s exit route. <i>Journal of Experimental Medicine</i>. 2018;215(12):2959-2961. doi:<a href=\"https://doi.org/10.1084/jem.20181934\">10.1084/jem.20181934</a>","chicago":"Reversat, Anne, and Michael K Sixt. “IgM’s Exit Route.” <i>Journal of Experimental Medicine</i>. Rockefeller University Press, 2018. <a href=\"https://doi.org/10.1084/jem.20181934\">https://doi.org/10.1084/jem.20181934</a>.","apa":"Reversat, A., &#38; Sixt, M. K. (2018). IgM’s exit route. <i>Journal of Experimental Medicine</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1084/jem.20181934\">https://doi.org/10.1084/jem.20181934</a>","short":"A. Reversat, M.K. Sixt, Journal of Experimental Medicine 215 (2018) 2959–2961.","ista":"Reversat A, Sixt MK. 2018. IgM’s exit route. Journal of Experimental Medicine. 215(12), 2959–2961."},"_id":"5672","date_published":"2018-11-20T00:00:00Z","oa":1,"date_updated":"2026-04-16T09:54:07Z","date_created":"2018-12-16T22:59:18Z","author":[{"full_name":"Reversat, Anne","orcid":"0000-0003-0666-8928","last_name":"Reversat","id":"35B76592-F248-11E8-B48F-1D18A9856A87","first_name":"Anne"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt"}],"month":"11","publisher":"Rockefeller University Press","oa_version":"Published Version","year":"2018","isi":1,"language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["0022-1007"]},"external_id":{"isi":["000451920600002"]},"issue":"12","intvolume":"       215","page":"2959-2961"},{"page":"1668-1682","arxiv":1,"intvolume":"        40","issue":"7","external_id":{"isi":["000434294800010"],"arxiv":["1508.07902"]},"status":"public","publication_identifier":{"issn":["0162-8828"]},"language":[{"iso":"eng"}],"isi":1,"year":"2018","oa_version":"Preprint","month":"07","publisher":"IEEE","author":[{"full_name":"Shekhovtsov, Alexander","last_name":"Shekhovtsov","first_name":"Alexander"},{"last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","full_name":"Swoboda, Paul"},{"full_name":"Savchynskyy, Bogdan","first_name":"Bogdan","last_name":"Savchynskyy"}],"date_updated":"2026-04-16T09:54:52Z","date_created":"2018-12-11T11:48:01Z","publist_id":"6992","oa":1,"date_published":"2018-07-01T00:00:00Z","_id":"703","article_processing_charge":"No","citation":{"ama":"Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2018;40(7):1668-1682. doi:<a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">10.1109/TPAMI.2017.2730884</a>","ieee":"A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.","mla":"Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:<a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">10.1109/TPAMI.2017.2730884</a>.","apa":"Shekhovtsov, A., Swoboda, P., &#38; Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">https://doi.org/10.1109/TPAMI.2017.2730884</a>","chicago":"Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">https://doi.org/10.1109/TPAMI.2017.2730884</a>.","short":"A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.","ista":"Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682."},"volume":40,"scopus_import":"1","quality_controlled":"1","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.07902"}],"corr_author":"1","abstract":[{"lang":"eng","text":"We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision."}],"publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"01","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","title":"Maximum persistency via iterative relaxed inference with graphical models","department":[{"_id":"VlKo"}],"doi":"10.1109/TPAMI.2017.2730884"},{"abstract":[{"text":"Bitcoin has become the most successful cryptocurrency ever deployed, and its most distinctive feature is that it is decentralized. Its underlying protocol (Nakamoto consensus) achieves this by using proof of work, which has the drawback that it causes the consumption of vast amounts of energy to maintain the ledger. Moreover, Bitcoin mining dynamics have become less distributed over time.\r\n\r\nTowards addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather than computation. We argue that SpaceMint’s design solves or alleviates several of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also rewards smaller miners fairly according to their contribution to the network, thus incentivizing more distributed participation.\r\n\r\nThis paper adapts proof of space to enable its use in cryptocurrency, studies the attacks that can arise against a Bitcoin-like blockchain that uses proof of space, and proposes a new blockchain format and transaction types to address these attacks. Our prototype shows that initializing 1 TB for mining takes about a day (a one-off setup cost), and miners spend on average just a fraction of a second per block mined. Finally, we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the canonical game-theoretic notion for games that take place over time) and show that this stylized game satisfies a strong equilibrium notion, thereby arguing for SpaceMint ’s stability and consensus.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/528"}],"quality_controlled":"1","type":"conference","scopus_import":"1","volume":10957,"doi":"10.1007/978-3-662-58387-6_26","department":[{"_id":"KrPi"}],"ec_funded":1,"title":"SpaceMint: A cryptocurrency based on proofs of space","publication":"22nd International Conference on Financial Cryptography and Data Security","day":"07","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["0302-9743"],"isbn":["9783662583869"],"eisbn":["9783662583876"],"eissn":["1611-3349"]},"external_id":{"isi":["000540656400026"]},"intvolume":"     10957","alternative_title":["LNCS"],"page":"480-499","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"citation":{"chicago":"Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” In <i>22nd International Conference on Financial Cryptography and Data Security</i>, 10957:480–99. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">https://doi.org/10.1007/978-3-662-58387-6_26</a>.","apa":"Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., &#38; Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In <i>22nd International Conference on Financial Cryptography and Data Security</i> (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">https://doi.org/10.1007/978-3-662-58387-6_26</a>","ieee":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in <i>22nd International Conference on Financial Cryptography and Data Security</i>, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.","mla":"Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” <i>22nd International Conference on Financial Cryptography and Data Security</i>, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:<a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">10.1007/978-3-662-58387-6_26</a>.","ama":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: <i>22nd International Conference on Financial Cryptography and Data Security</i>. Vol 10957. Springer Nature; 2018:480-499. doi:<a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">10.1007/978-3-662-58387-6_26</a>","ista":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957, 480–499.","short":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499."},"article_processing_charge":"No","_id":"6941","date_published":"2018-12-07T00:00:00Z","oa":1,"date_updated":"2026-04-16T10:30:49Z","date_created":"2019-10-14T06:35:38Z","author":[{"full_name":"Park, Sunoo","first_name":"Sunoo","last_name":"Park"},{"last_name":"Kwon","first_name":"Albert","full_name":"Kwon, Albert"},{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg"},{"last_name":"Gazi","first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter"},{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}],"publisher":"Springer Nature","oa_version":"Submitted Version","month":"12","year":"2018","isi":1,"conference":{"start_date":"2018-02-26","end_date":"2018-03-02","location":"Nieuwpoort, Curacao","name":"FC: Financial Cryptography and Data Security"}},{"abstract":[{"lang":"eng","text":"This chapter finds an agreement of equivariant indices of semi-classical homomorphisms between pairwise mirror branes in the GL2 Higgs moduli space on a Riemann surface. On one side of the agreement, components of the Lagrangian brane of U(1,1) Higgs bundles, whose mirror was proposed by Hitchin to be certain even exterior powers of the hyperholomorphic Dirac bundle on the SL2 Higgs moduli space, are present. The agreement arises from a mysterious functional equation. This gives strong computational evidence for Hitchin’s proposal."}],"status":"public","publication_identifier":{"eisbn":["9780191840500"],"isbn":["9780198802013"]},"language":[{"iso":"eng"}],"scopus_import":"1","type":"book_chapter","quality_controlled":"1","page":"189-218","article_processing_charge":"No","doi":"10.1093/oso/9780198802013.003.0009","citation":{"ista":"Hausel T, Mellit A, Pei D. 2018.Mirror symmetry with branes by equivariant verlinde formulas. In: Geometry and Physics: Volume I. , 189–218.","short":"T. Hausel, A. Mellit, D. Pei, in:, Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218.","apa":"Hausel, T., Mellit, A., &#38; Pei, D. (2018). Mirror symmetry with branes by equivariant verlinde formulas. In <i>Geometry and Physics: Volume I</i> (pp. 189–218). Oxford University Press. <a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">https://doi.org/10.1093/oso/9780198802013.003.0009</a>","chicago":"Hausel, Tamás, Anton Mellit, and Du Pei. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” In <i>Geometry and Physics: Volume I</i>, 189–218. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">https://doi.org/10.1093/oso/9780198802013.003.0009</a>.","ama":"Hausel T, Mellit A, Pei D. Mirror symmetry with branes by equivariant verlinde formulas. In: <i>Geometry and Physics: Volume I</i>. Oxford University Press; 2018:189-218. doi:<a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">10.1093/oso/9780198802013.003.0009</a>","ieee":"T. Hausel, A. Mellit, and D. Pei, “Mirror symmetry with branes by equivariant verlinde formulas,” in <i>Geometry and Physics: Volume I</i>, Oxford University Press, 2018, pp. 189–218.","mla":"Hausel, Tamás, et al. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” <i>Geometry and Physics: Volume I</i>, Oxford University Press, 2018, pp. 189–218, doi:<a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">10.1093/oso/9780198802013.003.0009</a>."},"date_published":"2018-01-01T00:00:00Z","_id":"6525","date_created":"2019-06-06T12:42:01Z","department":[{"_id":"TaHa"}],"date_updated":"2026-04-16T10:30:22Z","author":[{"orcid":"0000-0002-9582-2634","full_name":"Hausel, Tamás","first_name":"Tamás","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel"},{"first_name":"Anton","id":"388D3134-F248-11E8-B48F-1D18A9856A87","last_name":"Mellit","full_name":"Mellit, Anton"},{"full_name":"Pei, Du","first_name":"Du","last_name":"Pei"}],"publication":"Geometry and Physics: Volume I","title":"Mirror symmetry with branes by equivariant verlinde formulas","publisher":"Oxford University Press","month":"01","oa_version":"None","day":"01","year":"2018","publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"project":[{"call_identifier":"FWF","name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"page":"2918-2931","related_material":{"record":[{"status":"public","id":"5569","relation":"popular_science"}]},"intvolume":"        46","issue":"6","external_id":{"isi":["000429009500021"]},"status":"public","language":[{"iso":"eng"}],"isi":1,"year":"2018","month":"04","oa_version":"Published Version","publisher":"Oxford University Press","author":[{"full_name":"Nikolic, Nela","orcid":"0000-0001-9068-6090","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87","first_name":"Nela","last_name":"Nikolic"},{"orcid":"0000-0001-5396-4346","full_name":"Bergmiller, Tobias","last_name":"Bergmiller","first_name":"Tobias","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vandervelde, Alexandra","first_name":"Alexandra","last_name":"Vandervelde"},{"last_name":"Albanese","first_name":"Tanino","full_name":"Albanese, Tanino"},{"full_name":"Gelens, Lendert","last_name":"Gelens","first_name":"Lendert"},{"first_name":"Isabella","last_name":"Moll","full_name":"Moll, Isabella"}],"date_created":"2018-12-11T11:46:29Z","date_updated":"2025-04-15T06:28:24Z","oa":1,"date_published":"2018-04-06T00:00:00Z","_id":"438","article_processing_charge":"Yes (in subscription journal)","citation":{"apa":"Nikolic, N., Bergmiller, T., Vandervelde, A., Albanese, T., Gelens, L., &#38; Moll, I. (2018). Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations. <i>Nucleic Acids Research</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nar/gky079\">https://doi.org/10.1093/nar/gky079</a>","chicago":"Nikolic, Nela, Tobias Bergmiller, Alexandra Vandervelde, Tanino Albanese, Lendert Gelens, and Isabella Moll. “Autoregulation of MazEF Expression Underlies Growth Heterogeneity in Bacterial Populations.” <i>Nucleic Acids Research</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/nar/gky079\">https://doi.org/10.1093/nar/gky079</a>.","ama":"Nikolic N, Bergmiller T, Vandervelde A, Albanese T, Gelens L, Moll I. Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations. <i>Nucleic Acids Research</i>. 2018;46(6):2918-2931. doi:<a href=\"https://doi.org/10.1093/nar/gky079\">10.1093/nar/gky079</a>","mla":"Nikolic, Nela, et al. “Autoregulation of MazEF Expression Underlies Growth Heterogeneity in Bacterial Populations.” <i>Nucleic Acids Research</i>, vol. 46, no. 6, Oxford University Press, 2018, pp. 2918–31, doi:<a href=\"https://doi.org/10.1093/nar/gky079\">10.1093/nar/gky079</a>.","ieee":"N. Nikolic, T. Bergmiller, A. Vandervelde, T. Albanese, L. Gelens, and I. Moll, “Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations,” <i>Nucleic Acids Research</i>, vol. 46, no. 6. Oxford University Press, pp. 2918–2931, 2018.","ista":"Nikolic N, Bergmiller T, Vandervelde A, Albanese T, Gelens L, Moll I. 2018. Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations. Nucleic Acids Research. 46(6), 2918–2931.","short":"N. Nikolic, T. Bergmiller, A. Vandervelde, T. Albanese, L. Gelens, I. Moll, Nucleic Acids Research 46 (2018) 2918–2931."},"volume":46,"scopus_import":"1","quality_controlled":"1","type":"journal_article","corr_author":"1","has_accepted_license":"1","abstract":[{"lang":"eng","text":"The MazF toxin sequence-specifically cleaves single-stranded RNA upon various stressful conditions, and it is activated as a part of the mazEF toxin–antitoxin module in Escherichia coli. Although autoregulation of mazEF expression through the MazE antitoxin-dependent transcriptional repression has been biochemically characterized, less is known about post-transcriptional autoregulation, as well as how both of these autoregulatory features affect growth of single cells during conditions that promote MazF production. Here, we demonstrate post-transcriptional autoregulation of mazF expression dynamics by MazF cleaving its own transcript. Single-cell analyses of bacterial populations during ectopic MazF production indicated that two-level autoregulation of mazEF expression influences cell-to-cell growth rate heterogeneity. The increase in growth rate heterogeneity is governed by the MazE antitoxin, and tuned by the MazF-dependent mazF mRNA cleavage. Also, both autoregulatory features grant rapid exit from the stress caused by mazF overexpression. Time-lapse microscopy revealed that MazF-mediated cleavage of mazF mRNA leads to increased temporal variability in length of individual cells during ectopic mazF overexpression, as explained by a stochastic model indicating that mazEF mRNA cleavage underlies temporal fluctuations in MazF levels during stress."}],"publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"06","title":"Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations","ddc":["576"],"publication":"Nucleic Acids Research","file":[{"file_size":5027978,"file_id":"5151","relation":"main_file","creator":"system","file_name":"IST-2018-971-v1+1_2018_Nikoloc_Autoregulation_of.pdf","content_type":"application/pdf","checksum":"3ff4f545c27e11a4cd20ccb30778793e","date_created":"2018-12-12T10:15:30Z","date_updated":"2020-07-14T12:46:27Z","access_level":"open_access"}],"department":[{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:46:27Z","pubrep_id":"971","doi":"10.1093/nar/gky079"},{"oa":1,"department":[{"_id":"CaGu"}],"date_created":"2018-12-12T12:31:35Z","publist_id":"7385","date_updated":"2026-04-16T12:20:36Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:47:04Z","checksum":"61ebb92213cfffeba3ddbaff984b81af","content_type":"application/zip","date_created":"2018-12-12T13:04:39Z","file_name":"IST-2018-74-v1+2_15-11-05.zip","creator":"system","relation":"main_file","file_id":"5637","file_size":3558703796},{"creator":"system","date_created":"2018-12-12T13:04:55Z","content_type":"application/zip","file_name":"IST-2018-74-v1+3_15-07-31.zip","checksum":"bf26649af310ef6892d68576515cde6d","date_updated":"2020-07-14T12:47:04Z","access_level":"open_access","file_size":1830422606,"file_id":"5638","relation":"main_file"},{"relation":"main_file","file_id":"5639","file_size":2140849248,"access_level":"open_access","date_created":"2018-12-12T13:05:11Z","date_updated":"2020-07-14T12:47:04Z","checksum":"8e46eedce06f22acb2be1a9b9d3f56bd","content_type":"application/zip","file_name":"IST-2018-74-v1+4_Images_for_analysis.zip","creator":"system"}],"citation":{"ista":"Bergmiller T, Nikolic N. 2018. Time-lapse microscopy data, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:74\">10.15479/AT:ISTA:74</a>.","short":"T. Bergmiller, N. Nikolic, (2018).","apa":"Bergmiller, T., &#38; Nikolic, N. (2018). Time-lapse microscopy data. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:74\">https://doi.org/10.15479/AT:ISTA:74</a>","chicago":"Bergmiller, Tobias, and Nela Nikolic. “Time-Lapse Microscopy Data.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:74\">https://doi.org/10.15479/AT:ISTA:74</a>.","ama":"Bergmiller T, Nikolic N. Time-lapse microscopy data. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:74\">10.15479/AT:ISTA:74</a>","mla":"Bergmiller, Tobias, and Nela Nikolic. <i>Time-Lapse Microscopy Data</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:74\">10.15479/AT:ISTA:74</a>.","ieee":"T. Bergmiller and N. Nikolic, “Time-lapse microscopy data.” Institute of Science and Technology Austria, 2018."},"article_processing_charge":"No","doi":"10.15479/AT:ISTA:74","file_date_updated":"2020-07-14T12:47:04Z","_id":"5569","date_published":"2018-02-07T00:00:00Z","day":"07","year":"2018","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-5396-4346","full_name":"Bergmiller, Tobias","last_name":"Bergmiller","first_name":"Tobias","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nikolic, Nela","orcid":"0000-0001-9068-6090","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87","first_name":"Nela","last_name":"Nikolic"}],"title":"Time-lapse microscopy data","ddc":["579"],"month":"02","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","abstract":[{"text":"Nela Nikolic, Tobias Bergmiller, Alexandra Vandervelde, Tanino G. Albanese, Lendert Gelens, and Isabella Moll (2018)\r\n“Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations” Nucleic Acids Research, doi: 10.15479/AT:ISTA:74;\r\nmicroscopy experiments by Tobias Bergmiller; image and data analysis by Nela Nikolic.","lang":"eng"}],"datarep_id":"74","has_accepted_license":"1","keyword":["microscopy","microfluidics"],"status":"public","type":"research_data","related_material":{"record":[{"status":"public","relation":"research_paper","id":"438"}]}},{"date_published":"2018-12-01T00:00:00Z","_id":"6774","citation":{"short":"M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.","ista":"Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231.","mla":"Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” <i>Journal of Applied and Computational Topology</i>, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:<a href=\"https://doi.org/10.1007/s41468-018-0021-5\">10.1007/s41468-018-0021-5</a>.","ieee":"M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” <i>Journal of Applied and Computational Topology</i>, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.","ama":"Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. <i>Journal of Applied and Computational Topology</i>. 2018;2(3-4):177-231. doi:<a href=\"https://doi.org/10.1007/s41468-018-0021-5\">10.1007/s41468-018-0021-5</a>","chicago":"Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing Simplicial Representatives of Homotopy Group Elements.” <i>Journal of Applied and Computational Topology</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s41468-018-0021-5\">https://doi.org/10.1007/s41468-018-0021-5</a>.","apa":"Filakovský, M., Franek, P., Wagner, U., &#38; Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. <i>Journal of Applied and Computational Topology</i>. Springer. <a href=\"https://doi.org/10.1007/s41468-018-0021-5\">https://doi.org/10.1007/s41468-018-0021-5</a>"},"date_created":"2019-08-08T06:47:40Z","date_updated":"2026-04-08T13:56:01Z","oa":1,"publisher":"Springer","oa_version":"Published Version","month":"12","author":[{"full_name":"Filakovský, Marek","last_name":"Filakovský","first_name":"Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8878-8397","full_name":"Franek, Peter","first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","last_name":"Franek"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","last_name":"Wagner"},{"last_name":"Zhechev","first_name":"Stephan Y","id":"3AA52972-F248-11E8-B48F-1D18A9856A87","full_name":"Zhechev, Stephan Y"}],"article_type":"original","year":"2018","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"status":"public","language":[{"iso":"eng"}],"issue":"3-4","intvolume":"         2","project":[{"call_identifier":"FWF","grant_number":"M01980","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","name":"Robust Invariants of Nonlinear Systems"},{"name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","call_identifier":"FWF"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6681"}]},"page":"177-231","file_date_updated":"2020-07-14T12:47:40Z","doi":"10.1007/s41468-018-0021-5","file":[{"file_size":1056278,"file_id":"6775","relation":"main_file","creator":"dernst","date_updated":"2020-07-14T12:47:40Z","checksum":"cf9e7fcd2a113dd4828774fc75cdb7e8","content_type":"application/pdf","file_name":"2018_JourAppliedComputTopology_Filakovsky.pdf","date_created":"2019-08-08T06:55:21Z","access_level":"open_access"}],"department":[{"_id":"UlWa"}],"title":"Computing simplicial representatives of homotopy group elements","ddc":["514"],"publication":"Journal of Applied and Computational Topology","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"01","corr_author":"1","has_accepted_license":"1","abstract":[{"lang":"eng","text":"A central problem of algebraic topology is to understand the homotopy groups  𝜋𝑑(𝑋)  of a topological space X. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental group  𝜋1(𝑋)  of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with   𝜋1(𝑋)  trivial), compute the higher homotopy group   𝜋𝑑(𝑋)  for any given   𝑑≥2 . However, these algorithms come with a caveat: They compute the isomorphism type of   𝜋𝑑(𝑋) ,   𝑑≥2  as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of   𝜋𝑑(𝑋) . Converting elements of this abstract group into explicit geometric maps from the d-dimensional sphere   𝑆𝑑  to X has been one of the main unsolved problems in the emerging field of computational homotopy theory. Here we present an algorithm that, given a simply connected space X, computes   𝜋𝑑(𝑋)  and represents its elements as simplicial maps from a suitable triangulation of the d-sphere   𝑆𝑑  to X. For fixed d, the algorithm runs in time exponential in   size(𝑋) , the number of simplices of X. Moreover, we prove that this is optimal: For every fixed   𝑑≥2 , we construct a family of simply connected spaces X such that for any simplicial map representing a generator of   𝜋𝑑(𝑋) , the size of the triangulation of   𝑆𝑑  on which the map is defined, is exponential in size(𝑋) ."}],"volume":2,"scopus_import":"1","quality_controlled":"1","type":"journal_article"},{"file_date_updated":"2020-07-14T12:46:37Z","pubrep_id":"1043","doi":"10.15479/AT:ISTA:th_1043","file":[{"file_size":851164,"relation":"main_file","file_id":"6256","creator":"dernst","access_level":"open_access","content_type":"application/pdf","date_created":"2019-04-09T07:45:38Z","file_name":"2018_Thesis_Moser.pdf","date_updated":"2020-07-14T12:46:37Z","checksum":"fbd8c747d148b468a21213b7cf175225"},{"creator":"dernst","date_updated":"2020-07-14T12:46:37Z","content_type":"application/zip","file_name":"2018_Thesis_Moser_Source.zip","date_created":"2019-04-09T07:45:38Z","checksum":"c28e16ecfc1126d3ce324ec96493c01e","access_level":"closed","file_size":1531516,"file_id":"6257","relation":"source_file"}],"OA_place":"publisher","department":[{"_id":"RoSe"}],"ddc":["515","530","519"],"title":"Point interactions in systems of fermions","publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"04","corr_author":"1","has_accepted_license":"1","abstract":[{"lang":"eng","text":"In this thesis we will discuss systems of point interacting fermions, their stability and other spectral properties. Whereas for bosons a point interacting system is always unstable this ques- tion is more subtle for a gas of two species of fermions. In particular the answer depends on the mass ratio between these two species. Most of this work will be focused on the N + M model which consists of two species of fermions with N, M particles respectively which interact via point interactions. We will introduce this model using a formal limit and discuss the N + 1 system in more detail. In particular, we will show that for mass ratios above a critical one, which does not depend on the particle number, the N + 1 system is stable. In the context of this model we will prove rigorous versions of Tan relations which relate various quantities of the point-interacting model. By restricting the N + 1 system to a box we define a finite density model with point in- teractions. In the context of this system we will discuss the energy change when introducing a point-interacting impurity into a system of non-interacting fermions. We will see that this change in energy is bounded independently of the particle number and in particular the bound only depends on the density and the scattering length. As another special case of the N + M model we will show stability of the 2 + 2 model for mass ratios in an interval around one. Further we will investigate a different model of point interactions which was discussed before in the literature and which is, contrary to the N + M model, not given by a limiting procedure but is based on a Dirichlet form. We will show that this system behaves trivially in the thermodynamic limit, i.e. the free energy per particle is the same as the one of the non-interacting system."}],"degree_awarded":"PhD","type":"dissertation","date_published":"2018-09-04T00:00:00Z","_id":"52","citation":{"short":"T. Moser, Point Interactions in Systems of Fermions, Institute of Science and Technology Austria, 2018.","ista":"Moser T. 2018. Point interactions in systems of fermions. Institute of Science and Technology Austria.","ieee":"T. Moser, “Point interactions in systems of fermions,” Institute of Science and Technology Austria, 2018.","mla":"Moser, Thomas. <i>Point Interactions in Systems of Fermions</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1043\">10.15479/AT:ISTA:th_1043</a>.","ama":"Moser T. Point interactions in systems of fermions. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1043\">10.15479/AT:ISTA:th_1043</a>","chicago":"Moser, Thomas. “Point Interactions in Systems of Fermions.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1043\">https://doi.org/10.15479/AT:ISTA:th_1043</a>.","apa":"Moser, T. (2018). <i>Point interactions in systems of fermions</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1043\">https://doi.org/10.15479/AT:ISTA:th_1043</a>"},"article_processing_charge":"No","supervisor":[{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"date_updated":"2026-04-16T12:20:40Z","date_created":"2018-12-11T11:44:22Z","publist_id":"8002","oa":1,"month":"09","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","author":[{"last_name":"Moser","first_name":"Thomas","id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","full_name":"Moser, Thomas"}],"year":"2018","publication_identifier":{"issn":["2663-337X"]},"status":"public","language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"}],"related_material":{"record":[{"status":"public","id":"5856","relation":"part_of_dissertation"},{"status":"public","id":"741","relation":"part_of_dissertation"},{"id":"1198","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"154","relation":"part_of_dissertation"}]},"page":"115","alternative_title":["ISTA Thesis"]},{"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1385-0172"],"eissn":["1572-9656"]},"status":"public","external_id":{"isi":["000439639700001"]},"issue":"3","article_number":"19","intvolume":"        21","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"52"}]},"project":[{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"},{"call_identifier":"FWF","name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"_id":"154","date_published":"2018-09-01T00:00:00Z","citation":{"mla":"Moser, Thomas, and Robert Seiringer. “Stability of the 2+2 Fermionic System with Point Interactions.” <i>Mathematical Physics Analysis and Geometry</i>, vol. 21, no. 3, 19, Springer, 2018, doi:<a href=\"https://doi.org/10.1007/s11040-018-9275-3\">10.1007/s11040-018-9275-3</a>.","ieee":"T. Moser and R. Seiringer, “Stability of the 2+2 fermionic system with point interactions,” <i>Mathematical Physics Analysis and Geometry</i>, vol. 21, no. 3. Springer, 2018.","ama":"Moser T, Seiringer R. Stability of the 2+2 fermionic system with point interactions. <i>Mathematical Physics Analysis and Geometry</i>. 2018;21(3). doi:<a href=\"https://doi.org/10.1007/s11040-018-9275-3\">10.1007/s11040-018-9275-3</a>","chicago":"Moser, Thomas, and Robert Seiringer. “Stability of the 2+2 Fermionic System with Point Interactions.” <i>Mathematical Physics Analysis and Geometry</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s11040-018-9275-3\">https://doi.org/10.1007/s11040-018-9275-3</a>.","apa":"Moser, T., &#38; Seiringer, R. (2018). Stability of the 2+2 fermionic system with point interactions. <i>Mathematical Physics Analysis and Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s11040-018-9275-3\">https://doi.org/10.1007/s11040-018-9275-3</a>","short":"T. Moser, R. Seiringer, Mathematical Physics Analysis and Geometry 21 (2018).","ista":"Moser T, Seiringer R. 2018. Stability of the 2+2 fermionic system with point interactions. Mathematical Physics Analysis and Geometry. 21(3), 19."},"article_processing_charge":"No","oa":1,"publist_id":"7767","date_updated":"2026-04-08T14:12:30Z","date_created":"2018-12-11T11:44:55Z","publisher":"Springer","month":"09","oa_version":"Published Version","author":[{"full_name":"Moser, Thomas","id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Moser"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"article_type":"original","isi":1,"year":"2018","abstract":[{"lang":"eng","text":"We give a lower bound on the ground state energy of a system of two fermions of one species interacting with two fermions of another species via point interactions. We show that there is a critical mass ratio m2 ≈ 0.58 such that the system is stable, i.e., the energy is bounded from below, for m∈[m2,m2−1]. So far it was not known whether this 2 + 2 system exhibits a stable region at all or whether the formation of four-body bound states causes an unbounded spectrum for all mass ratios, similar to the Thomas effect. Our result gives further evidence for the stability of the more general N + M system."}],"has_accepted_license":"1","volume":21,"quality_controlled":"1","type":"journal_article","scopus_import":"1","file_date_updated":"2020-07-14T12:45:01Z","doi":"10.1007/s11040-018-9275-3","ec_funded":1,"file":[{"file_size":496973,"file_id":"5729","relation":"main_file","creator":"dernst","file_name":"2018_MathPhysics_Moser.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:01Z","date_created":"2018-12-17T16:49:02Z","checksum":"411c4db5700d7297c9cd8ebc5dd29091","access_level":"open_access"}],"department":[{"_id":"RoSe"}],"title":"Stability of the 2+2 fermionic system with point interactions","publication":"Mathematical Physics Analysis and Geometry","ddc":["530"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","acknowledgement":"Open access funding provided by Austrian Science Fund (FWF).","day":"01"},{"oa_version":"Submitted Version","publisher":"National Academy of Sciences","month":"06","author":[{"last_name":"Abbas","id":"47E8FC1C-F248-11E8-B48F-1D18A9856A87","first_name":"Mohamad","full_name":"Abbas, Mohamad"},{"full_name":"Hernández, García J","last_name":"Hernández","first_name":"García J"},{"full_name":"Pollmann, Stephan","last_name":"Pollmann","first_name":"Stephan"},{"last_name":"Samodelov","first_name":"Sophia L","full_name":"Samodelov, Sophia L"},{"full_name":"Kolb, Martina","first_name":"Martina","last_name":"Kolb"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí"},{"last_name":"Hammes","first_name":"Ulrich Z","full_name":"Hammes, Ulrich Z"},{"full_name":"Zurbriggen, Matias D","last_name":"Zurbriggen","first_name":"Matias D"},{"full_name":"Blázquez, Miguel","first_name":"Miguel","last_name":"Blázquez"},{"last_name":"Alabadí","first_name":"David","full_name":"Alabadí, David"}],"article_type":"original","year":"2018","isi":1,"date_published":"2018-06-26T00:00:00Z","_id":"203","article_processing_charge":"No","citation":{"short":"M. Abbas, G.J. Hernández, S. Pollmann, S.L. Samodelov, M. Kolb, J. Friml, U.Z. Hammes, M.D. Zurbriggen, M. Blázquez, D. Alabadí, PNAS 115 (2018) 6864–6869.","ista":"Abbas M, Hernández GJ, Pollmann S, Samodelov SL, Kolb M, Friml J, Hammes UZ, Zurbriggen MD, Blázquez M, Alabadí D. 2018. Auxin methylation is required for differential growth in Arabidopsis. PNAS. 115(26), 6864–6869.","ama":"Abbas M, Hernández GJ, Pollmann S, et al. Auxin methylation is required for differential growth in Arabidopsis. <i>PNAS</i>. 2018;115(26):6864-6869. doi:<a href=\"https://doi.org/10.1073/pnas.1806565115\">10.1073/pnas.1806565115</a>","mla":"Abbas, Mohamad, et al. “Auxin Methylation Is Required for Differential Growth in Arabidopsis.” <i>PNAS</i>, vol. 115, no. 26, National Academy of Sciences, 2018, pp. 6864–69, doi:<a href=\"https://doi.org/10.1073/pnas.1806565115\">10.1073/pnas.1806565115</a>.","ieee":"M. Abbas <i>et al.</i>, “Auxin methylation is required for differential growth in Arabidopsis,” <i>PNAS</i>, vol. 115, no. 26. National Academy of Sciences, pp. 6864–6869, 2018.","apa":"Abbas, M., Hernández, G. J., Pollmann, S., Samodelov, S. L., Kolb, M., Friml, J., … Alabadí, D. (2018). Auxin methylation is required for differential growth in Arabidopsis. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1806565115\">https://doi.org/10.1073/pnas.1806565115</a>","chicago":"Abbas, Mohamad, García J Hernández, Stephan Pollmann, Sophia L Samodelov, Martina Kolb, Jiří Friml, Ulrich Z Hammes, Matias D Zurbriggen, Miguel Blázquez, and David Alabadí. “Auxin Methylation Is Required for Differential Growth in Arabidopsis.” <i>PNAS</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1806565115\">https://doi.org/10.1073/pnas.1806565115</a>."},"publist_id":"7710","date_updated":"2026-04-28T08:29:26Z","date_created":"2018-12-11T11:45:11Z","oa":1,"intvolume":"       115","project":[{"call_identifier":"FP7","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants"}],"page":"6864-6869","status":"public","language":[{"iso":"eng"}],"issue":"26","external_id":{"isi":["000436245000096"]},"publication":"PNAS","title":"Auxin methylation is required for differential growth in Arabidopsis","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"26","OA_type":"green","doi":"10.1073/pnas.1806565115","ec_funded":1,"OA_place":"repository","department":[{"_id":"JiFr"}],"volume":115,"scopus_import":"1","quality_controlled":"1","type":"journal_article","main_file_link":[{"open_access":"1","url":"http://eprints.nottingham.ac.uk/52388/"}],"abstract":[{"lang":"eng","text":"Asymmetric auxin distribution is instrumental for the differential growth that causes organ bending on tropic stimuli and curvatures during plant development. Local differences in auxin concentrations are achieved mainly by polarized cellular distribution of PIN auxin transporters, but whether other mechanisms involving auxin homeostasis are also relevant for the formation of auxin gradients is not clear. Here we show that auxin methylation is required for asymmetric auxin distribution across the hypocotyl, particularly during its response to gravity. We found that loss-of-function mutants in Arabidopsis IAA CARBOXYL METHYLTRANSFERASE1 (IAMT1) prematurely unfold the apical hook, and that their hypocotyls are impaired in gravitropic reorientation. This defect is linked to an auxin-dependent increase in PIN gene expression, leading to an increased polar auxin transport and lack of asymmetric distribution of PIN3 in the iamt1 mutant. Gravitropic reorientation in the iamt1 mutant could be restored with either endodermis-specific expression of IAMT1 or partial inhibition of polar auxin transport, which also results in normal PIN gene expression levels. We propose that IAA methylation is necessary in gravity-sensing cells to restrict polar auxin transport within the range of auxin levels that allow for differential responses."}]},{"ddc":["516","000"],"title":"On the circle covering theorem by A.W. Goodman and R.E. Goodman","publication":"Discrete & Computational Geometry","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","day":"01","file_date_updated":"2019-01-18T09:27:36Z","doi":"10.1007/s00454-017-9883-x","ec_funded":1,"file":[{"file_size":482518,"file_id":"5844","relation":"main_file","success":1,"creator":"dernst","file_name":"2018_DiscreteComp_Akopyan.pdf","date_created":"2019-01-18T09:27:36Z","date_updated":"2019-01-18T09:27:36Z","content_type":"application/pdf","access_level":"open_access"}],"department":[{"_id":"HeEd"}],"volume":59,"quality_controlled":"1","type":"journal_article","scopus_import":"1","abstract":[{"text":"In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets.","lang":"eng"}],"has_accepted_license":"1","corr_author":"1","publisher":"Springer","month":"06","oa_version":"Published Version","author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy"},{"last_name":"Balitskiy","first_name":"Alexey","full_name":"Balitskiy, Alexey"},{"first_name":"Mikhail","last_name":"Grigorev","full_name":"Grigorev, Mikhail"}],"article_type":"original","year":"2018","isi":1,"_id":"1064","date_published":"2018-06-01T00:00:00Z","article_processing_charge":"Yes (via OA deal)","citation":{"ista":"Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete &#38; Computational Geometry. 59(4), 1001–1009.","short":"A. Akopyan, A. Balitskiy, M. Grigorev, Discrete &#38; Computational Geometry 59 (2018) 1001–1009.","apa":"Akopyan, A., Balitskiy, A., &#38; Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>","chicago":"Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>.","ama":"Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. 2018;59(4):1001-1009. doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>","ieee":"A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem by A.W. Goodman and R.E. Goodman,” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4. Springer, pp. 1001–1009, 2018.","mla":"Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4, Springer, 2018, pp. 1001–09, doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>."},"oa":1,"publist_id":"6324","date_updated":"2026-05-20T10:19:33Z","date_created":"2018-12-11T11:49:57Z","intvolume":"        59","page":"1001-1009","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"status":"public","external_id":{"isi":["000432205500011"]},"issue":"4"},{"status":"public","language":[{"iso":"eng"}],"issue":"1","external_id":{"isi":["000419356300024"]},"intvolume":"       208","project":[{"_id":"250BDE62-B435-11E9-9278-68D0E5697425","grant_number":"715257","name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution","call_identifier":"H2020"}],"related_material":{"record":[{"id":"5571","relation":"popular_science","status":"public"},{"status":"public","id":"5572","relation":"popular_science"},{"status":"public","relation":"dissertation_contains","id":"17119"}]},"page":"365 - 375","date_published":"2018-01-01T00:00:00Z","_id":"542","citation":{"ama":"Kelemen RK, Vicoso B. Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. <i>Genetics</i>. 2018;208(1):365-375. doi:<a href=\"https://doi.org/10.1534/genetics.117.300513\">10.1534/genetics.117.300513</a>","mla":"Kelemen, Réka K., and Beatriz Vicoso. “Complex History and Differentiation Patterns of the T-Haplotype, a Mouse Meiotic Driver.” <i>Genetics</i>, vol. 208, no. 1, Genetics Society of America, 2018, pp. 365–75, doi:<a href=\"https://doi.org/10.1534/genetics.117.300513\">10.1534/genetics.117.300513</a>.","ieee":"R. K. Kelemen and B. Vicoso, “Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver,” <i>Genetics</i>, vol. 208, no. 1. Genetics Society of America, pp. 365–375, 2018.","apa":"Kelemen, R. K., &#38; Vicoso, B. (2018). Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.117.300513\">https://doi.org/10.1534/genetics.117.300513</a>","chicago":"Kelemen, Réka K, and Beatriz Vicoso. “Complex History and Differentiation Patterns of the T-Haplotype, a Mouse Meiotic Driver.” <i>Genetics</i>. Genetics Society of America, 2018. <a href=\"https://doi.org/10.1534/genetics.117.300513\">https://doi.org/10.1534/genetics.117.300513</a>.","short":"R.K. Kelemen, B. Vicoso, Genetics 208 (2018) 365–375.","ista":"Kelemen RK, Vicoso B. 2018. Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. Genetics. 208(1), 365–375."},"article_processing_charge":"No","date_created":"2018-12-11T11:47:04Z","date_updated":"2026-05-31T22:30:09Z","publist_id":"7274","oa":1,"publisher":"Genetics Society of America","month":"01","oa_version":"Published Version","author":[{"full_name":"Kelemen, Réka K","orcid":"0000-0002-8489-9281","last_name":"Kelemen","id":"48D3F8DE-F248-11E8-B48F-1D18A9856A87","first_name":"Réka K"},{"full_name":"Vicoso, Beatriz","orcid":"0000-0002-4579-8306","last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz"}],"article_type":"original","year":"2018","isi":1,"corr_author":"1","has_accepted_license":"1","abstract":[{"lang":"eng","text":"The t-haplotype, a mouse meiotic driver found on chromosome 17, has been a model for autosomal segregation distortion for close to a century, but several questions remain regarding its biology and evolutionary history. A recently published set of population genomics resources for wild mice includes several individuals heterozygous for the t-haplotype, which we use to characterize this selfish element at the genomic and transcriptomic level. Our results show that large sections of the t-haplotype have been replaced by standard homologous sequences, possibly due to occasional events of recombination, and that this complicates the inference of its history. As expected for a long genomic segment of very low recombination, the t-haplotype carries an excess of fixed nonsynonymous mutations compared to the standard chromosome. This excess is stronger for regions that have not undergone recent recombination, suggesting that occasional gene flow between the t and the standard chromosome may provide a mechanism to regenerate coding sequences that have accumulated deleterious mutations. Finally, we find that t-complex genes with altered expression largely overlap with deleted or amplified regions, and that carrying a t-haplotype alters the testis expression of genes outside of the t-complex, providing new leads into the pathways involved in the biology of this segregation distorter."}],"volume":208,"scopus_import":"1","type":"journal_article","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:50Z","pubrep_id":"1058","doi":"10.1534/genetics.117.300513","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:46:50Z","content_type":"application/pdf","date_created":"2018-12-12T10:15:14Z","file_name":"IST-2018-1058-v1+1_365.full__1_.pdf","checksum":"2123845e7031a0cf043905be160f9e69","creator":"system","relation":"main_file","file_id":"5132","file_size":1311661}],"ec_funded":1,"department":[{"_id":"BeVi"}],"publication":"Genetics","title":"Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver","ddc":["576"],"publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01"}]