[{"month":"01","publication_identifier":{"issn":["0070-2153"],"isbn":["9780128127988"]},"external_id":{"isi":["000611830600012"]},"isi":1,"quality_controlled":"1","doi":"10.1016/bs.ctdb.2019.07.001","language":[{"iso":"eng"}],"year":"2020","publication_status":"published","department":[{"_id":"CaHe"}],"publisher":"Elsevier","editor":[{"first_name":"Lilianna ","last_name":"Solnica-Krezel","full_name":"Solnica-Krezel, Lilianna "}],"author":[{"full_name":"Bruce, Ashley E.E.","last_name":"Bruce","first_name":"Ashley E.E."},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J"}],"date_created":"2020-01-30T09:24:06Z","date_updated":"2024-02-22T13:23:09Z","volume":136,"scopus_import":"1","series_title":"Current Topics in Developmental Biology","day":"01","article_processing_charge":"No","publication":"Gastrulation: From Embryonic Pattern to Form","citation":{"apa":"Bruce, A. E. E., & Heisenberg, C.-P. J. (2020). Mechanisms of zebrafish epiboly: A current view. In L. Solnica-Krezel (Ed.), Gastrulation: From Embryonic Pattern to Form (Vol. 136, pp. 319–341). Elsevier. https://doi.org/10.1016/bs.ctdb.2019.07.001","ieee":"A. E. E. Bruce and C.-P. J. Heisenberg, “Mechanisms of zebrafish epiboly: A current view,” in Gastrulation: From Embryonic Pattern to Form, vol. 136, L. Solnica-Krezel, Ed. Elsevier, 2020, pp. 319–341.","ista":"Bruce AEE, Heisenberg C-PJ. 2020.Mechanisms of zebrafish epiboly: A current view. In: Gastrulation: From Embryonic Pattern to Form. vol. 136, 319–341.","ama":"Bruce AEE, Heisenberg C-PJ. Mechanisms of zebrafish epiboly: A current view. In: Solnica-Krezel L, ed. Gastrulation: From Embryonic Pattern to Form. Vol 136. Current Topics in Developmental Biology. Elsevier; 2020:319-341. doi:10.1016/bs.ctdb.2019.07.001","chicago":"Bruce, Ashley E.E., and Carl-Philipp J Heisenberg. “Mechanisms of Zebrafish Epiboly: A Current View.” In Gastrulation: From Embryonic Pattern to Form, edited by Lilianna Solnica-Krezel, 136:319–41. Current Topics in Developmental Biology. Elsevier, 2020. https://doi.org/10.1016/bs.ctdb.2019.07.001.","short":"A.E.E. Bruce, C.-P.J. Heisenberg, in:, L. Solnica-Krezel (Ed.), Gastrulation: From Embryonic Pattern to Form, Elsevier, 2020, pp. 319–341.","mla":"Bruce, Ashley E. E., and Carl-Philipp J. Heisenberg. “Mechanisms of Zebrafish Epiboly: A Current View.” Gastrulation: From Embryonic Pattern to Form, edited by Lilianna Solnica-Krezel, vol. 136, Elsevier, 2020, pp. 319–41, doi:10.1016/bs.ctdb.2019.07.001."},"page":"319-341","date_published":"2020-01-01T00:00:00Z","type":"book_chapter","abstract":[{"text":"Epiboly is a conserved gastrulation movement describing the thinning and spreading of a sheet or multi-layer of cells. The zebrafish embryo has emerged as a vital model system to address the cellular and molecular mechanisms that drive epiboly. In the zebrafish embryo, the blastoderm, consisting of a simple squamous epithelium (the enveloping layer) and an underlying mass of deep cells, as well as a yolk nuclear syncytium (the yolk syncytial layer) undergo epiboly to internalize the yolk cell during gastrulation. The major events during zebrafish epiboly are: expansion of the enveloping layer and the internal yolk syncytial layer, reduction and removal of the yolk membrane ahead of the advancing blastoderm margin and deep cell rearrangements between the enveloping layer and yolk syncytial layer to thin the blastoderm. Here, work addressing the cellular and molecular mechanisms as well as the sources of the mechanical forces that underlie these events is reviewed. The contribution of recent findings to the current model of epiboly as well as open questions and future prospects are also discussed.","lang":"eng"}],"_id":"7410","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Mechanisms of zebrafish epiboly: A current view","status":"public","intvolume":" 136","oa_version":"None"},{"type":"journal_article","abstract":[{"text":"We study the problem of automatically detecting if a given multi-class classifier operates outside of its specifications (out-of-specs), i.e. on input data from a different distribution than what it was trained for. This is an important problem to solve on the road towards creating reliable computer vision systems for real-world applications, because the quality of a classifier’s predictions cannot be guaranteed if it operates out-of-specs. Previously proposed methods for out-of-specs detection make decisions on the level of single inputs. This, however, is insufficient to achieve low false positive rate and high false negative rates at the same time. In this work, we describe a new procedure named KS(conf), based on statistical reasoning. Its main component is a classical Kolmogorov–Smirnov test that is applied to the set of predicted confidence values for batches of samples. Working with batches instead of single samples allows increasing the true positive rate without negatively affecting the false positive rate, thereby overcoming a crucial limitation of single sample tests. We show by extensive experiments using a variety of convolutional network architectures and datasets that KS(conf) reliably detects out-of-specs situations even under conditions where other tests fail. It furthermore has a number of properties that make it an excellent candidate for practical deployment: it is easy to implement, adds almost no overhead to the system, works with any classifier that outputs confidence scores, and requires no a priori knowledge about how the data distribution could change.","lang":"eng"}],"issue":"4","title":"KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications","ddc":["004"],"status":"public","intvolume":" 128","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6944","oa_version":"Published Version","file":[{"date_created":"2019-11-26T10:30:02Z","date_updated":"2020-07-14T12:47:45Z","checksum":"155e63edf664dcacb3bdc1c2223e606f","relation":"main_file","file_id":"7110","content_type":"application/pdf","file_size":1715072,"creator":"dernst","file_name":"2019_IJCV_Sun.pdf","access_level":"open_access"}],"scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","article_type":"original","page":"970-995","publication":"International Journal of Computer Vision","citation":{"ista":"Sun R, Lampert C. 2020. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 128(4), 970–995.","apa":"Sun, R., & Lampert, C. (2020). KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01232-x","ieee":"R. Sun and C. Lampert, “KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications,” International Journal of Computer Vision, vol. 128, no. 4. Springer Nature, pp. 970–995, 2020.","ama":"Sun R, Lampert C. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 2020;128(4):970-995. doi:10.1007/s11263-019-01232-x","chicago":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01232-x.","mla":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision, vol. 128, no. 4, Springer Nature, 2020, pp. 970–95, doi:10.1007/s11263-019-01232-x.","short":"R. Sun, C. Lampert, International Journal of Computer Vision 128 (2020) 970–995."},"date_published":"2020-04-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:45Z","ec_funded":1,"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"ChLa"}],"year":"2020","date_created":"2019-10-14T09:14:28Z","date_updated":"2024-02-22T14:57:30Z","volume":128,"author":[{"full_name":"Sun, Rémy","first_name":"Rémy","last_name":"Sun"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"6482"}],"link":[{"relation":"erratum","url":"https://doi.org/10.1007/s11263-019-01262-5"}]},"month":"04","publication_identifier":{"issn":["0920-5691"],"eissn":["1573-1405"]},"quality_controlled":"1","isi":1,"project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000494406800001"]},"language":[{"iso":"eng"}],"doi":"10.1007/s11263-019-01232-x"},{"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2020-01-01T00:00:00Z","publication":"Proceedings of the ACM on Programming Languages","citation":{"mla":"Wang, Peixin, et al. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” Proceedings of the ACM on Programming Languages, vol. 4, no. POPL, 25, ACM, 2020, doi:10.1145/3371093.","short":"P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM on Programming Languages, ACM, 2020.","chicago":"Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” In Proceedings of the ACM on Programming Languages, Vol. 4. ACM, 2020. https://doi.org/10.1145/3371093.","ama":"Wang P, Fu H, Chatterjee K, Deng Y, Xu M. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In: Proceedings of the ACM on Programming Languages. Vol 4. ACM; 2020. doi:10.1145/3371093","ista":"Wang P, Fu H, Chatterjee K, Deng Y, Xu M. 2020. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. Proceedings of the ACM on Programming Languages. vol. 4, 25.","apa":"Wang, P., Fu, H., Chatterjee, K., Deng, Y., & Xu, M. (2020). Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM. https://doi.org/10.1145/3371093","ieee":"P. Wang, H. Fu, K. Chatterjee, Y. Deng, and M. Xu, “Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time,” in Proceedings of the ACM on Programming Languages, 2020, vol. 4, no. POPL."},"abstract":[{"text":"The notion of program sensitivity (aka Lipschitz continuity) specifies that changes in the program input result in proportional changes to the program output. For probabilistic programs the notion is naturally extended to expected sensitivity. A previous approach develops a relational program logic framework for proving expected sensitivity of probabilistic while loops, where the number of iterations is fixed and bounded. In this work, we consider probabilistic while loops where the number of iterations is not fixed, but randomized and depends on the initial input values. We present a sound approach for proving expected sensitivity of such programs. Our sound approach is martingale-based and can be automated through existing martingale-synthesis algorithms. Furthermore, our approach is compositional for sequential composition of while loops under a mild side condition. We demonstrate the effectiveness of our approach on several classical examples from Gambler's Ruin, stochastic hybrid systems and stochastic gradient descent. We also present experimental results showing that our automated approach can handle various probabilistic programs in the literature.","lang":"eng"}],"issue":"POPL","type":"conference","file":[{"file_name":"2019_ACM_POPL_Wang.pdf","access_level":"open_access","content_type":"application/pdf","file_size":564151,"creator":"cziletti","relation":"main_file","file_id":"8328","date_created":"2020-09-01T11:12:58Z","date_updated":"2020-09-01T11:12:58Z","checksum":"c6193d109ff4ecb17e7a6513d8eb34c0","success":1}],"oa_version":"Published Version","status":"public","ddc":["004"],"title":"Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time","intvolume":" 4","_id":"8324","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"01","publication_identifier":{"eissn":["2475-1421"]},"language":[{"iso":"eng"}],"doi":"10.1145/3371093","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1902.04744"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"file_date_updated":"2020-09-01T11:12:58Z","article_number":"25","date_updated":"2024-02-22T15:16:45Z","date_created":"2020-08-30T22:01:12Z","volume":4,"author":[{"last_name":"Wang","first_name":"Peixin","full_name":"Wang, Peixin"},{"full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Deng, Yuxin","first_name":"Yuxin","last_name":"Deng"},{"full_name":"Xu, Ming","last_name":"Xu","first_name":"Ming"}],"related_material":{"link":[{"relation":"software","url":"https://doi.org/10.5281/zenodo.3533633"}]},"publication_status":"published","publisher":"ACM","department":[{"_id":"KrCh"}],"acknowledgement":"We thank anonymous reviewers for helpful comments, especially for pointing to us a scenario of piecewise-linear approximation (Remark5). The research was partially supported by the National Natural Science Foundation of China (NSFC) under Grant No. 61802254, 61672229, 61832015,61772336,11871221 and Austrian Science Fund (FWF) NFN under Grant No. S11407-N23 (RiSE/SHiNE). We thank Prof. Yuxi Fu, director of the BASICS Lab at Shanghai Jiao Tong University, for his support.","year":"2020"},{"date_published":"2020-01-01T00:00:00Z","page":"27-36","article_type":"original","citation":{"chicago":"Salazar, Juan Esteban, Daniel Severin, Tomas A Vega Zuniga, Pedro Fernández-Aburto, Alfonso Deichler, Michel Sallaberry A., and Jorge Mpodozis. “Anatomical Specializations Related to Foraging in the Visual System of a Nocturnal Insectivorous Bird, the Band-Winged Nightjar (Aves: Caprimulgiformes).” Brain, Behavior and Evolution. Karger Publishers, 2020. https://doi.org/10.1159/000504162.","short":"J.E. Salazar, D. Severin, T.A. Vega Zuniga, P. Fernández-Aburto, A. Deichler, M. Sallaberry A., J. Mpodozis, Brain, Behavior and Evolution 94 (2020) 27–36.","mla":"Salazar, Juan Esteban, et al. “Anatomical Specializations Related to Foraging in the Visual System of a Nocturnal Insectivorous Bird, the Band-Winged Nightjar (Aves: Caprimulgiformes).” Brain, Behavior and Evolution, vol. 94, no. 1–4, Karger Publishers, 2020, pp. 27–36, doi:10.1159/000504162.","apa":"Salazar, J. E., Severin, D., Vega Zuniga, T. A., Fernández-Aburto, P., Deichler, A., Sallaberry A., M., & Mpodozis, J. (2020). Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. Karger Publishers. https://doi.org/10.1159/000504162","ieee":"J. E. Salazar et al., “Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes),” Brain, Behavior and Evolution, vol. 94, no. 1–4. Karger Publishers, pp. 27–36, 2020.","ista":"Salazar JE, Severin D, Vega Zuniga TA, Fernández-Aburto P, Deichler A, Sallaberry A. M, Mpodozis J. 2020. Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. 94(1–4), 27–36.","ama":"Salazar JE, Severin D, Vega Zuniga TA, et al. Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. 2020;94(1-4):27-36. doi:10.1159/000504162"},"publication":"Brain, Behavior and Evolution","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"None","intvolume":" 94","status":"public","title":"Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes)","_id":"7160","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","issue":"1-4","abstract":[{"text":"Nocturnal animals that rely on their visual system for foraging, mating, and navigation usually exhibit specific traits associated with living in scotopic conditions. Most nocturnal birds have several visual specializations, such as enlarged eyes and an increased orbital convergence. However, the actual role of binocular vision in nocturnal foraging is still debated. Nightjars (Aves: Caprimulgidae) are predators that actively pursue and capture flying insects in crepuscular and nocturnal environments, mainly using a conspicuous “sit-and-wait” tactic on which pursuit begins with an insect flying over the bird that sits on the ground. In this study, we describe the visual system of the band-winged nightjar (Systellura longirostris), with emphasis on anatomical features previously described as relevant for nocturnal birds. Orbit convergence, determined by 3D scanning of the skull, was 73.28°. The visual field, determined by ophthalmoscopic reflex, exhibits an area of maximum binocular overlap of 42°, and it is dorsally oriented. The eyes showed a nocturnal-like normalized corneal aperture/axial length index. Retinal ganglion cells (RGCs) were relatively scant, and distributed in an unusual oblique-band pattern, with higher concentrations in the ventrotemporal quadrant. Together, these results indicate that the band-winged nightjar exhibits a retinal specialization associated with the binocular area of their dorsal visual field, a relevant area for pursuit triggering and prey attacks. The RGC distribution observed is unusual among birds, but similar to that of some visually dependent insectivorous bats, suggesting that those features might be convergent in relation to feeding strategies.","lang":"eng"}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1159/000504162","quality_controlled":"1","isi":1,"external_id":{"isi":["000522856600004"],"pmid":["31751995"]},"publication_identifier":{"eissn":["1421-9743"],"issn":["0006-8977"]},"month":"01","volume":94,"date_created":"2019-12-09T09:04:13Z","date_updated":"2024-02-22T15:18:34Z","author":[{"full_name":"Salazar, Juan Esteban","first_name":"Juan Esteban","last_name":"Salazar"},{"full_name":"Severin, Daniel","last_name":"Severin","first_name":"Daniel"},{"full_name":"Vega Zuniga, Tomas A","last_name":"Vega Zuniga","first_name":"Tomas A","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Fernández-Aburto","first_name":"Pedro","full_name":"Fernández-Aburto, Pedro"},{"full_name":"Deichler, Alfonso","first_name":"Alfonso","last_name":"Deichler"},{"full_name":"Sallaberry A., Michel","first_name":"Michel","last_name":"Sallaberry A."},{"full_name":"Mpodozis, Jorge","first_name":"Jorge","last_name":"Mpodozis"}],"department":[{"_id":"MaJö"}],"publisher":"Karger Publishers","publication_status":"published","pmid":1,"year":"2020"},{"page":"963-1001","article_type":"original","citation":{"short":"J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020) 963–1001.","mla":"Alt, Johannes, et al. “Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of Probability, vol. 48, no. 2, Institute of Mathematical Statistics, 2020, pp. 963–1001, doi:10.1214/19-AOP1379.","chicago":"Alt, Johannes, László Erdös, Torben H Krüger, and Dominik J Schröder. “Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/19-AOP1379.","ama":"Alt J, Erdös L, Krüger TH, Schröder DJ. Correlated random matrices: Band rigidity and edge universality. Annals of Probability. 2020;48(2):963-1001. doi:10.1214/19-AOP1379","apa":"Alt, J., Erdös, L., Krüger, T. H., & Schröder, D. J. (2020). Correlated random matrices: Band rigidity and edge universality. Annals of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/19-AOP1379","ieee":"J. Alt, L. Erdös, T. H. Krüger, and D. J. Schröder, “Correlated random matrices: Band rigidity and edge universality,” Annals of Probability, vol. 48, no. 2. Institute of Mathematical Statistics, pp. 963–1001, 2020.","ista":"Alt J, Erdös L, Krüger TH, Schröder DJ. 2020. Correlated random matrices: Band rigidity and edge universality. Annals of Probability. 48(2), 963–1001."},"publication":"Annals of Probability","date_published":"2020-03-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","intvolume":" 48","title":"Correlated random matrices: Band rigidity and edge universality","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6184","oa_version":"Preprint","type":"journal_article","issue":"2","abstract":[{"text":"We prove edge universality for a general class of correlated real symmetric or complex Hermitian Wigner matrices with arbitrary expectation. Our theorem also applies to internal edges of the self-consistent density of states. In particular, we establish a strong form of band rigidity which excludes mismatches between location and label of eigenvalues close to internal edges in these general models.","lang":"eng"}],"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"isi":1,"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1804.07744","open_access":"1"}],"external_id":{"arxiv":["1804.07744"],"isi":["000528269100013"]},"language":[{"iso":"eng"}],"doi":"10.1214/19-AOP1379","publication_identifier":{"issn":["0091-1798"]},"month":"03","publisher":"Institute of Mathematical Statistics","department":[{"_id":"LaEr"}],"publication_status":"published","year":"2020","volume":48,"date_updated":"2024-02-22T14:34:33Z","date_created":"2019-03-28T09:20:08Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"149"},{"id":"6179","status":"public","relation":"dissertation_contains"}]},"author":[{"id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","last_name":"Alt","full_name":"Alt, Johannes"},{"full_name":"Erdös, László","first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"},{"orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","last_name":"Krüger","first_name":"Torben H","full_name":"Krüger, Torben H"},{"full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2904-1856","first_name":"Dominik J","last_name":"Schröder"}],"ec_funded":1},{"_id":"15037","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 13","ddc":["580"],"status":"public","title":"TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants","oa_version":"Published Version","file":[{"date_created":"2024-02-28T12:39:56Z","date_updated":"2024-02-28T12:39:56Z","success":1,"checksum":"c538a5008f7827f62d17d40a3bfabe65","file_id":"15038","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":3089212,"file_name":"2020_MolecularPlant_MoulinierAnzola.pdf","access_level":"open_access"}],"type":"journal_article","issue":"5","abstract":[{"text":"Protein abundance and localization at the plasma membrane (PM) shapes plant development and mediates adaptation to changing environmental conditions. It is regulated by ubiquitination, a post-translational modification crucial for the proper sorting of endocytosed PM proteins to the vacuole for subsequent degradation. To understand the significance and the variety of roles played by this reversible modification, the function of ubiquitin receptors, which translate the ubiquitin signature into a cellular response, needs to be elucidated. In this study, we show that TOL (TOM1-like) proteins function in plants as multivalent ubiquitin receptors, governing ubiquitinated cargo delivery to the vacuole via the conserved Endosomal Sorting Complex Required for Transport (ESCRT) pathway. TOL2 and TOL6 interact with components of the ESCRT machinery and bind to K63-linked ubiquitin via two tandemly arranged conserved ubiquitin-binding domains. Mutation of these domains results not only in a loss of ubiquitin binding but also altered localization, abolishing TOL6 ubiquitin receptor activity. Function and localization of TOL6 is itself regulated by ubiquitination, whereby TOL6 ubiquitination potentially modulates degradation of PM-localized cargoes, assisting in the fine-tuning of the delicate interplay between protein recycling and downregulation. Taken together, our findings demonstrate the function and regulation of a ubiquitin receptor that mediates vacuolar degradation of PM proteins in higher plants.","lang":"eng"}],"citation":{"chicago":"Moulinier-Anzola, Jeanette, Maximilian Schwihla, Lucinda De-Araújo, Christina Artner, Lisa Jörg, Nataliia Konstantinova, Christian Luschnig, and Barbara Korbei. “TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway in Higher Plants.” Molecular Plant. Elsevier, 2020. https://doi.org/10.1016/j.molp.2020.02.012.","short":"J. Moulinier-Anzola, M. Schwihla, L. De-Araújo, C. Artner, L. Jörg, N. Konstantinova, C. Luschnig, B. Korbei, Molecular Plant 13 (2020) 717–731.","mla":"Moulinier-Anzola, Jeanette, et al. “TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway in Higher Plants.” Molecular Plant, vol. 13, no. 5, Elsevier, 2020, pp. 717–31, doi:10.1016/j.molp.2020.02.012.","ieee":"J. Moulinier-Anzola et al., “TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants,” Molecular Plant, vol. 13, no. 5. Elsevier, pp. 717–731, 2020.","apa":"Moulinier-Anzola, J., Schwihla, M., De-Araújo, L., Artner, C., Jörg, L., Konstantinova, N., … Korbei, B. (2020). TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. Elsevier. https://doi.org/10.1016/j.molp.2020.02.012","ista":"Moulinier-Anzola J, Schwihla M, De-Araújo L, Artner C, Jörg L, Konstantinova N, Luschnig C, Korbei B. 2020. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. 13(5), 717–731.","ama":"Moulinier-Anzola J, Schwihla M, De-Araújo L, et al. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. 2020;13(5):717-731. doi:10.1016/j.molp.2020.02.012"},"publication":"Molecular Plant","page":"717-731","article_type":"original","date_published":"2020-05-04T00:00:00Z","keyword":["Plant Science","Molecular Biology"],"has_accepted_license":"1","article_processing_charge":"No","day":"04","pmid":1,"year":"2020","department":[{"_id":"EvBe"}],"publisher":"Elsevier","publication_status":"published","author":[{"full_name":"Moulinier-Anzola, Jeanette","first_name":"Jeanette","last_name":"Moulinier-Anzola"},{"last_name":"Schwihla","first_name":"Maximilian","full_name":"Schwihla, Maximilian"},{"full_name":"De-Araújo, Lucinda","last_name":"De-Araújo","first_name":"Lucinda"},{"last_name":"Artner","first_name":"Christina","id":"45DF286A-F248-11E8-B48F-1D18A9856A87","full_name":"Artner, Christina"},{"first_name":"Lisa","last_name":"Jörg","full_name":"Jörg, Lisa"},{"full_name":"Konstantinova, Nataliia","last_name":"Konstantinova","first_name":"Nataliia"},{"full_name":"Luschnig, Christian","last_name":"Luschnig","first_name":"Christian"},{"full_name":"Korbei, Barbara","first_name":"Barbara","last_name":"Korbei"}],"volume":13,"date_updated":"2024-02-28T12:41:52Z","date_created":"2024-02-28T08:55:56Z","file_date_updated":"2024-02-28T12:39:56Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["32087370"]},"oa":1,"quality_controlled":"1","doi":"10.1016/j.molp.2020.02.012","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1674-2052"]},"month":"05"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15036","intvolume":" 432","title":"Molecular recognition at septin interfaces: The switches hold the key","status":"public","oa_version":"Published Version","type":"journal_article","issue":"21","abstract":[{"text":"The assembly of a septin filament requires that homologous monomers must distinguish between one another in establishing appropriate interfaces with their neighbors. To understand this phenomenon at the molecular level, we present the first four crystal structures of heterodimeric septin complexes. We describe in detail the two distinct types of G-interface present within the octameric particles, which must polymerize to form filaments. These are formed between SEPT2 and SEPT6 and between SEPT7 and SEPT3, and their description permits an understanding of the structural basis for the selectivity necessary for correct filament assembly. By replacing SEPT6 by SEPT8 or SEPT11, it is possible to rationalize Kinoshita's postulate, which predicts the exchangeability of septins from within a subgroup. Switches I and II, which in classical small GTPases provide a mechanism for nucleotide-dependent conformational change, have been repurposed in septins to play a fundamental role in molecular recognition. Specifically, it is switch I which holds the key to discriminating between the two different G-interfaces. Moreover, residues which are characteristic for a given subgroup play subtle, but pivotal, roles in guaranteeing that the correct interfaces are formed.","lang":"eng"}],"citation":{"ama":"Rosa HVD, Leonardo DA, Brognara G, et al. Molecular recognition at septin interfaces: The switches hold the key. Journal of Molecular Biology. 2020;432(21):5784-5801. doi:10.1016/j.jmb.2020.09.001","apa":"Rosa, H. V. D., Leonardo, D. A., Brognara, G., Brandão-Neto, J., D’Muniz Pereira, H., Araújo, A. P. U., & Garratt, R. C. (2020). Molecular recognition at septin interfaces: The switches hold the key. Journal of Molecular Biology. Elsevier. https://doi.org/10.1016/j.jmb.2020.09.001","ieee":"H. V. D. Rosa et al., “Molecular recognition at septin interfaces: The switches hold the key,” Journal of Molecular Biology, vol. 432, no. 21. Elsevier, pp. 5784–5801, 2020.","ista":"Rosa HVD, Leonardo DA, Brognara G, Brandão-Neto J, D’Muniz Pereira H, Araújo APU, Garratt RC. 2020. Molecular recognition at septin interfaces: The switches hold the key. Journal of Molecular Biology. 432(21), 5784–5801.","short":"H.V.D. Rosa, D.A. Leonardo, G. Brognara, J. Brandão-Neto, H. D’Muniz Pereira, A.P.U. Araújo, R.C. Garratt, Journal of Molecular Biology 432 (2020) 5784–5801.","mla":"Rosa, Higor Vinícius Dias, et al. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” Journal of Molecular Biology, vol. 432, no. 21, Elsevier, 2020, pp. 5784–801, doi:10.1016/j.jmb.2020.09.001.","chicago":"Rosa, Higor Vinícius Dias, Diego Antonio Leonardo, Gabriel Brognara, José Brandão-Neto, Humberto D’Muniz Pereira, Ana Paula Ulian Araújo, and Richard Charles Garratt. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” Journal of Molecular Biology. Elsevier, 2020. https://doi.org/10.1016/j.jmb.2020.09.001."},"publication":"Journal of Molecular Biology","page":"5784-5801","article_type":"original","date_published":"2020-10-02T00:00:00Z","keyword":["Molecular Biology","Structural Biology"],"article_processing_charge":"No","day":"02","pmid":1,"year":"2020","department":[{"_id":"MaLo"}],"publisher":"Elsevier","publication_status":"published","author":[{"last_name":"Rosa","first_name":"Higor Vinícius Dias","full_name":"Rosa, Higor Vinícius Dias"},{"first_name":"Diego Antonio","last_name":"Leonardo","full_name":"Leonardo, Diego Antonio"},{"id":"D96FFDA0-A884-11E9-9968-DC26E6697425","first_name":"Gabriel","last_name":"Brognara","full_name":"Brognara, Gabriel"},{"last_name":"Brandão-Neto","first_name":"José","full_name":"Brandão-Neto, José"},{"full_name":"D'Muniz Pereira, Humberto","first_name":"Humberto","last_name":"D'Muniz Pereira"},{"first_name":"Ana Paula Ulian","last_name":"Araújo","full_name":"Araújo, Ana Paula Ulian"},{"last_name":"Garratt","first_name":"Richard Charles","full_name":"Garratt, Richard Charles"}],"volume":432,"date_updated":"2024-02-28T12:37:54Z","date_created":"2024-02-28T08:50:34Z","external_id":{"pmid":["32910969"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.jmb.2020.09.001"}],"oa":1,"quality_controlled":"1","doi":"10.1016/j.jmb.2020.09.001","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0022-2836"]},"month":"10"},{"issue":"4","abstract":[{"text":"Previous research on animations of soap bubbles, films, and foams largely focuses on the motion and geometric shape of the bubble surface. These works neglect the evolution of the bubble’s thickness, which is normally responsible for visual phenomena like surface vortices, Newton’s interference patterns, capillary waves, and deformation-dependent rupturing of films in a foam. In this paper, we model these natural phenomena by introducing the film thickness as a reduced degree of freedom in the Navier-Stokes equations and deriving their equations of motion. We discretize the equations on a nonmanifold triangle mesh surface and couple it to an existing bubble solver. In doing so, we also introduce an incompressible fluid solver for 2.5D films and a novel advection algorithm for convecting fields across non-manifold surface junctions. Our simulations enhance state-of-the-art bubble solvers with additional effects caused by convection, rippling, draining, and evaporation of the thin film.","lang":"eng"}],"type":"journal_article","oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"8795","date_updated":"2020-11-23T09:03:19Z","date_created":"2020-11-23T09:03:19Z","checksum":"813831ca91319d794d9748c276b24578","success":1,"file_name":"2020_soapfilm_submitted.pdf","access_level":"open_access","file_size":14935529,"content_type":"application/pdf","creator":"dernst"}],"_id":"8384","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 39","status":"public","title":"A model for soap film dynamics with evolving thickness","ddc":["000"],"has_accepted_license":"1","article_processing_charge":"No","day":"08","scopus_import":"1","date_published":"2020-07-08T00:00:00Z","citation":{"ama":"Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. A model for soap film dynamics with evolving thickness. ACM Transactions on Graphics. 2020;39(4). doi:10.1145/3386569.3392405","ieee":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, and C. Wojtan, “A model for soap film dynamics with evolving thickness,” ACM Transactions on Graphics, vol. 39, no. 4. Association for Computing Machinery, 2020.","apa":"Ishida, S., Synak, P., Narita, F., Hachisuka, T., & Wojtan, C. (2020). A model for soap film dynamics with evolving thickness. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3386569.3392405","ista":"Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. 2020. A model for soap film dynamics with evolving thickness. ACM Transactions on Graphics. 39(4), 31.","short":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, C. Wojtan, ACM Transactions on Graphics 39 (2020).","mla":"Ishida, Sadashige, et al. “A Model for Soap Film Dynamics with Evolving Thickness.” ACM Transactions on Graphics, vol. 39, no. 4, 31, Association for Computing Machinery, 2020, doi:10.1145/3386569.3392405.","chicago":"Ishida, Sadashige, Peter Synak, Fumiya Narita, Toshiya Hachisuka, and Chris Wojtan. “A Model for Soap Film Dynamics with Evolving Thickness.” ACM Transactions on Graphics. Association for Computing Machinery, 2020. https://doi.org/10.1145/3386569.3392405."},"publication":"ACM Transactions on Graphics","article_type":"original","ec_funded":1,"file_date_updated":"2020-11-23T09:03:19Z","article_number":"31","author":[{"full_name":"Ishida, Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","last_name":"Ishida","first_name":"Sadashige"},{"full_name":"Synak, Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87","last_name":"Synak","first_name":"Peter"},{"last_name":"Narita","first_name":"Fumiya","full_name":"Narita, Fumiya"},{"first_name":"Toshiya","last_name":"Hachisuka","full_name":"Hachisuka, Toshiya"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","first_name":"Christopher J"}],"volume":39,"date_updated":"2024-02-28T12:57:31Z","date_created":"2020-09-13T22:01:18Z","acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback, especially Camille Schreck for her help in rendering. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. We would like to thank the authors of [Belcour and Barla 2017] for providing their implementation, the authors of [Atkins and Elliott 2010] and [Seychelles et al. 2008] for allowing us to use their results, and Rok Grah for helpful discussions. Finally, we thank Ryoichi Ando for many discussions from the beginning of the project that resulted in important contents of the paper including our formulation, numerical scheme, and initial implementation. This project has received funding from the\r\nEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176.","year":"2020","publisher":"Association for Computing Machinery","department":[{"_id":"ChWo"}],"publication_status":"published","publication_identifier":{"issn":["07300301"],"eissn":["15577368"]},"month":"07","doi":"10.1145/3386569.3392405","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3386569.3392405"}],"oa":1,"external_id":{"isi":["000583700300004"]},"project":[{"grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales"}],"quality_controlled":"1","isi":1},{"year":"2020","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj","orcid":"0000-0002-5646-9524"},{"id":"11396234-BB50-11E9-B24C-90FCE5697425","orcid":"0000-0002-5646-9524","first_name":"Peter","last_name":"Davies","full_name":"Davies, Peter"},{"full_name":"Parter, Merav","first_name":"Merav","last_name":"Parter"}],"related_material":{"record":[{"id":"9541","status":"public","relation":"later_version"}]},"date_updated":"2024-02-28T12:53:09Z","date_created":"2020-05-06T08:53:34Z","ec_funded":1,"oa":1,"external_id":{"isi":["000744436200015"],"arxiv":["1912.05390"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.05390"}],"isi":1,"quality_controlled":"1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","start_date":"2020-07-15","location":"Virtual Event, United States","end_date":"2020-07-17"},"doi":"10.1145/3350755.3400282","language":[{"iso":"eng"}],"month":"07","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"7802","status":"public","title":"Graph sparsification for derandomizing massively parallel computation with low space","oa_version":"Preprint","type":"conference","abstract":[{"lang":"eng","text":"The Massively Parallel Computation (MPC) model is an emerging model which distills core aspects of distributed and parallel computation. It has been developed as a tool to solve (typically graph) problems in systems where the input is distributed over many machines with limited space.\r\n\t\r\nRecent work has focused on the regime in which machines have sublinear (in $n$, the number of nodes in the input graph) space, with randomized algorithms presented for fundamental graph problems of Maximal Matching and Maximal Independent Set. However, there have been no prior corresponding deterministic algorithms.\r\n\t\r\n\tA major challenge underlying the sublinear space setting is that the local space of each machine might be too small to store all the edges incident to a single node. This poses a considerable obstacle compared to the classical models in which each node is assumed to know and have easy access to its incident edges. To overcome this barrier we introduce a new graph sparsification technique that deterministically computes a low-degree subgraph with additional desired properties. The degree of the nodes in this subgraph is small in the sense that the edges of each node can be now stored on a single machine. This low-degree subgraph also has the property that solving the problem on this subgraph provides \\emph{significant} global progress, i.e., progress towards solving the problem for the original input graph.\r\n\t\r\nUsing this framework to derandomize the well-known randomized algorithm of Luby [SICOMP'86], we obtain $O(\\log \\Delta+\\log\\log n)$-round deterministic MPC algorithms for solving the fundamental problems of Maximal Matching and Maximal Independent Set with $O(n^{\\epsilon})$ space on each machine for any constant $\\epsilon > 0$. Based on the recent work of Ghaffari et al. [FOCS'18], this additive $O(\\log\\log n)$ factor is conditionally essential. These algorithms can also be shown to run in $O(\\log \\Delta)$ rounds in the closely related model of CONGESTED CLIQUE, improving upon the state-of-the-art bound of $O(\\log^2 \\Delta)$ rounds by Censor-Hillel et al. [DISC'17]."}],"issue":"7","publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020)","citation":{"mla":"Czumaj, Artur, et al. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), no. 7, Association for Computing Machinery, 2020, pp. 175–85, doi:10.1145/3350755.3400282.","short":"A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), Association for Computing Machinery, 2020, pp. 175–185.","chicago":"Czumaj, Artur, Peter Davies, and Merav Parter. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), 175–85. Association for Computing Machinery, 2020. https://doi.org/10.1145/3350755.3400282.","ama":"Czumaj A, Davies P, Parter M. Graph sparsification for derandomizing massively parallel computation with low space. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020). Association for Computing Machinery; 2020:175-185. doi:10.1145/3350755.3400282","ista":"Czumaj A, Davies P, Parter M. 2020. Graph sparsification for derandomizing massively parallel computation with low space. Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020). SPAA: Symposium on Parallelism in Algorithms and Architectures, 175–185.","ieee":"A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing massively parallel computation with low space,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), Virtual Event, United States, 2020, no. 7, pp. 175–185.","apa":"Czumaj, A., Davies, P., & Parter, M. (2020). Graph sparsification for derandomizing massively parallel computation with low space. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020) (pp. 175–185). Virtual Event, United States: Association for Computing Machinery. https://doi.org/10.1145/3350755.3400282"},"page":"175-185","date_published":"2020-07-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No"},{"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union Horizon 2020 research and innovation program, grant agreement No 805223, ERC Starting Grant ScaleML. We acknowledge the support of the Natural Sciences and\r\nEngineering Research Council of Canada (NSERC). ","year":"2020","date_updated":"2024-02-28T12:55:14Z","date_created":"2020-04-05T22:00:49Z","author":[{"last_name":"Brown","first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A"},{"first_name":"Aleksandar","last_name":"Prokopec","full_name":"Prokopec, Aleksandar"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"}],"ec_funded":1,"quality_controlled":"1","isi":1,"project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://doi.org/10.1145/3332466.3374542","open_access":"1"}],"external_id":{"isi":["000564476500020"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"PPOPP: Principles and Practice of Parallel Programming","end_date":"2020-02-26","start_date":"2020-02-22","location":"San Diego, CA, United States"},"doi":"10.1145/3332466.3374542","month":"02","publication_identifier":{"isbn":["9781450368186"]},"status":"public","title":"Non-blocking interpolation search trees with doubly-logarithmic running time","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7636","oa_version":"Published Version","type":"conference","abstract":[{"text":"Balanced search trees typically use key comparisons to guide their operations, and achieve logarithmic running time. By relying on numerical properties of the keys, interpolation search achieves lower search complexity and better performance. Although interpolation-based data structures were investigated in the past, their non-blocking concurrent variants have received very little attention so far.\r\nIn this paper, we propose the first non-blocking implementation of the classic interpolation search tree (IST) data structure. For arbitrary key distributions, the data structure ensures worst-case O(log n + p) amortized time for search, insertion and deletion traversals. When the input key distributions are smooth, lookups run in expected O(log log n + p) time, and insertion and deletion run in expected amortized O(log log n + p) time, where p is a bound on the number of threads. To improve the scalability of concurrent insertion and deletion, we propose a novel parallel rebuilding technique, which should be of independent interest.\r\nWe evaluate whether the theoretical improvements translate to practice by implementing the concurrent interpolation search tree, and benchmarking it on uniform and nonuniform key distributions, for dataset sizes in the millions to billions of keys. Relative to the state-of-the-art concurrent data structures, the concurrent interpolation search tree achieves performance improvements of up to 15% under high update rates, and of up to 50% under moderate update rates. Further, ISTs exhibit up to 2X less cache-misses, and consume 1.2 -- 2.6X less memory compared to the next best alternative on typical dataset sizes. We find that the results are surprisingly robust to distributional skew, which suggests that our data structure can be a promising alternative to classic concurrent search structures.","lang":"eng"}],"page":"276-291","publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","citation":{"chicago":"Brown, Trevor A, Aleksandar Prokopec, and Dan-Adrian Alistarh. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 276–91. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374542.","short":"T.A. Brown, A. Prokopec, D.-A. Alistarh, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–291.","mla":"Brown, Trevor A., et al. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–91, doi:10.1145/3332466.3374542.","ieee":"T. A. Brown, A. Prokopec, and D.-A. Alistarh, “Non-blocking interpolation search trees with doubly-logarithmic running time,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, United States, 2020, pp. 276–291.","apa":"Brown, T. A., Prokopec, A., & Alistarh, D.-A. (2020). Non-blocking interpolation search trees with doubly-logarithmic running time. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 276–291). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3332466.3374542","ista":"Brown TA, Prokopec A, Alistarh D-A. 2020. Non-blocking interpolation search trees with doubly-logarithmic running time. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPOPP: Principles and Practice of Parallel Programming, 276–291.","ama":"Brown TA, Prokopec A, Alistarh D-A. Non-blocking interpolation search trees with doubly-logarithmic running time. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2020:276-291. doi:10.1145/3332466.3374542"},"date_published":"2020-02-19T00:00:00Z","scopus_import":"1","day":"19","article_processing_charge":"No"}]