[{"oa":1,"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"},"citation":{"ama":"Vicoso B. Data from Hyulmans et al 2021, “Transitions to asexuality and evolution of gene expression in Artemia brine shrimp.” 2021. doi:10.15479/AT:ISTA:9949","ista":"Vicoso B. 2021. Data from Hyulmans et al 2021, ‘Transitions to asexuality and evolution of gene expression in Artemia brine shrimp’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:9949.","ieee":"B. Vicoso, “Data from Hyulmans et al 2021, ‘Transitions to asexuality and evolution of gene expression in Artemia brine shrimp.’” Institute of Science and Technology Austria, 2021.","apa":"Vicoso, B. (2021). Data from Hyulmans et al 2021, “Transitions to asexuality and evolution of gene expression in Artemia brine shrimp.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9949","mla":"Vicoso, Beatriz. Data from Hyulmans et Al 2021, “Transitions to Asexuality and Evolution of Gene Expression in Artemia Brine Shrimp.” Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9949.","short":"B. Vicoso, (2021).","chicago":"Vicoso, Beatriz. “Data from Hyulmans et Al 2021, ‘Transitions to Asexuality and Evolution of Gene Expression in Artemia Brine Shrimp.’” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9949."},"date_published":"2021-08-24T00:00:00Z","doi":"10.15479/AT:ISTA:9949","article_processing_charge":"No","has_accepted_license":"1","day":"24","month":"08","publisher":"Institute of Science and Technology Austria","department":[{"_id":"BeVi"}],"status":"public","title":"Data from Hyulmans et al 2021, \"Transitions to asexuality and evolution of gene expression in Artemia brine shrimp\"","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9949","year":"2021","oa_version":"None","file":[{"date_created":"2021-08-21T13:43:59Z","date_updated":"2021-08-21T13:43:59Z","success":1,"checksum":"90461837eed66beac6fa302993cf0ca9","file_id":"9950","relation":"main_file","creator":"bvicoso","content_type":"application/zip","file_size":139188306,"file_name":"Data.zip","access_level":"open_access"}],"date_created":"2021-08-21T13:44:22Z","date_updated":"2024-02-21T12:40:30Z","related_material":{"record":[{"id":"10166","status":"public","relation":"used_in_publication"}]},"author":[{"full_name":"Vicoso, Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","first_name":"Beatriz","last_name":"Vicoso"}],"type":"research_data","file_date_updated":"2021-08-21T13:43:59Z"},{"file":[{"access_level":"open_access","file_name":"2021_PlosComBio_Kavcic.pdf","creator":"dernst","file_size":3690053,"content_type":"application/pdf","file_id":"9092","relation":"main_file","success":1,"checksum":"e29f2b42651bef8e034781de8781ffac","date_created":"2021-02-04T12:30:48Z","date_updated":"2021-02-04T12:30:48Z"}],"oa_version":"Published Version","ddc":["570"],"status":"public","title":"Minimal biophysical model of combined antibiotic action","intvolume":" 17","_id":"8997","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"Phenomenological relations such as Ohm’s or Fourier’s law have a venerable history in physics but are still scarce in biology. This situation restrains predictive theory. Here, we build on bacterial “growth laws,” which capture physiological feedback between translation and cell growth, to construct a minimal biophysical model for the combined action of ribosome-targeting antibiotics. Our model predicts drug interactions like antagonism or synergy solely from responses to individual drugs. We provide analytical results for limiting cases, which agree well with numerical results. We systematically refine the model by including direct physical interactions of different antibiotics on the ribosome. In a limiting case, our model provides a mechanistic underpinning for recent predictions of higher-order interactions that were derived using entropy maximization. We further refine the model to include the effects of antibiotics that mimic starvation and the presence of resistance genes. We describe the impact of a starvation-mimicking antibiotic on drug interactions analytically and verify it experimentally. Our extended model suggests a change in the type of drug interaction that depends on the strength of resistance, which challenges established rescaling paradigms. We experimentally show that the presence of unregulated resistance genes can lead to altered drug interaction, which agrees with the prediction of the model. While minimal, the model is readily adaptable and opens the door to predicting interactions of second and higher-order in a broad range of biological systems."}],"type":"journal_article","date_published":"2021-01-07T00:00:00Z","article_type":"original","publication":"PLOS Computational Biology","citation":{"short":"B. Kavcic, G. Tkačik, M.T. Bollenbach, PLOS Computational Biology 17 (2021).","mla":"Kavcic, Bor, et al. “Minimal Biophysical Model of Combined Antibiotic Action.” PLOS Computational Biology, vol. 17, e1008529, Public Library of Science, 2021, doi:10.1371/journal.pcbi.1008529.","chicago":"Kavcic, Bor, Gašper Tkačik, and Mark Tobias Bollenbach. “Minimal Biophysical Model of Combined Antibiotic Action.” PLOS Computational Biology. Public Library of Science, 2021. https://doi.org/10.1371/journal.pcbi.1008529.","ama":"Kavcic B, Tkačik G, Bollenbach MT. Minimal biophysical model of combined antibiotic action. PLOS Computational Biology. 2021;17. doi:10.1371/journal.pcbi.1008529","apa":"Kavcic, B., Tkačik, G., & Bollenbach, M. T. (2021). Minimal biophysical model of combined antibiotic action. PLOS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1008529","ieee":"B. Kavcic, G. Tkačik, and M. T. Bollenbach, “Minimal biophysical model of combined antibiotic action,” PLOS Computational Biology, vol. 17. Public Library of Science, 2021.","ista":"Kavcic B, Tkačik G, Bollenbach MT. 2021. Minimal biophysical model of combined antibiotic action. PLOS Computational Biology. 17, e1008529."},"day":"07","article_processing_charge":"Yes","has_accepted_license":"1","keyword":["Modelling and Simulation","Genetics","Molecular Biology","Antibiotics","Drug interactions"],"date_created":"2021-01-08T07:16:18Z","date_updated":"2024-02-21T12:41:41Z","volume":17,"author":[{"first_name":"Bor","last_name":"Kavcic","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6041-254X","full_name":"Kavcic, Bor"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","first_name":"Gašper","last_name":"Tkačik","full_name":"Tkačik, Gašper"},{"orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","first_name":"Tobias","full_name":"Bollenbach, Tobias"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"7673"},{"relation":"research_data","status":"public","id":"8930"}]},"publication_status":"published","publisher":"Public Library of Science","department":[{"_id":"GaTk"}],"acknowledgement":"This work was supported in part by Tum stipend of Knafelj foundation (to B.K.), Austrian Science Fund (FWF) standalone grants P 27201-B22 (to T.B.) and P 28844(to G.T.), HFSP program Grant RGP0042/2013 (to T.B.), German Research Foundation (DFG) individual grant BO 3502/2-1 (to T.B.), and German Research Foundation (DFG) Collaborative Research Centre (SFB) 1310 (to T.B.). ","year":"2021","file_date_updated":"2021-02-04T12:30:48Z","article_number":"e1008529","language":[{"iso":"eng"}],"doi":"10.1371/journal.pcbi.1008529","quality_controlled":"1","isi":1,"project":[{"name":"Revealing the mechanisms underlying drug interactions","call_identifier":"FWF","grant_number":"P27201-B22","_id":"25E9AF9E-B435-11E9-9278-68D0E5697425"},{"name":"Biophysics of information processing in gene regulation","call_identifier":"FWF","_id":"254E9036-B435-11E9-9278-68D0E5697425","grant_number":"P28844-B27"}],"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":["000608045000010"]},"month":"01","publication_identifier":{"issn":["1553-7358"]}},{"abstract":[{"text":"Gene expression levels are influenced by multiple coexisting molecular mechanisms. Some of these interactions such as those of transcription factors and promoters have been studied extensively. However, predicting phenotypes of gene regulatory networks (GRNs) remains a major challenge. Here, we use a well-defined synthetic GRN to study in Escherichia coli how network phenotypes depend on local genetic context, i.e. the genetic neighborhood of a transcription factor and its relative position. We show that one GRN with fixed topology can display not only quantitatively but also qualitatively different phenotypes, depending solely on the local genetic context of its components. Transcriptional read-through is the main molecular mechanism that places one transcriptional unit (TU) within two separate regulons without the need for complex regulatory sequences. We propose that relative order of individual TUs, with its potential for combinatorial complexity, plays an important role in shaping phenotypes of GRNs.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"file_id":"9284","relation":"main_file","success":1,"checksum":"3c2f44058c2dd45a5a1027f09d263f8e","date_created":"2021-03-23T10:12:58Z","date_updated":"2021-03-23T10:12:58Z","access_level":"open_access","file_name":"elife-65993-v2.pdf","creator":"bkavcic","file_size":1390469,"content_type":"application/pdf"}],"intvolume":" 10","title":"Local genetic context shapes the function of a gene regulatory network","status":"public","ddc":["570"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9283","has_accepted_license":"1","article_processing_charge":"Yes","day":"08","keyword":["Genetics and Molecular Biology"],"date_published":"2021-03-08T00:00:00Z","article_type":"original","citation":{"chicago":"Nagy-Staron, Anna A, Kathrin Tomasek, Caroline Caruso Carter, Elisabeth Sonnleitner, Bor Kavcic, Tiago Paixão, and Calin C Guet. “Local Genetic Context Shapes the Function of a Gene Regulatory Network.” ELife. eLife Sciences Publications, 2021. https://doi.org/10.7554/elife.65993.","mla":"Nagy-Staron, Anna A., et al. “Local Genetic Context Shapes the Function of a Gene Regulatory Network.” ELife, vol. 10, e65993, eLife Sciences Publications, 2021, doi:10.7554/elife.65993.","short":"A.A. Nagy-Staron, K. Tomasek, C. Caruso Carter, E. Sonnleitner, B. Kavcic, T. Paixão, C.C. Guet, ELife 10 (2021).","ista":"Nagy-Staron AA, Tomasek K, Caruso Carter C, Sonnleitner E, Kavcic B, Paixão T, Guet CC. 2021. Local genetic context shapes the function of a gene regulatory network. eLife. 10, e65993.","ieee":"A. A. Nagy-Staron et al., “Local genetic context shapes the function of a gene regulatory network,” eLife, vol. 10. eLife Sciences Publications, 2021.","apa":"Nagy-Staron, A. A., Tomasek, K., Caruso Carter, C., Sonnleitner, E., Kavcic, B., Paixão, T., & Guet, C. C. (2021). Local genetic context shapes the function of a gene regulatory network. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.65993","ama":"Nagy-Staron AA, Tomasek K, Caruso Carter C, et al. Local genetic context shapes the function of a gene regulatory network. eLife. 2021;10. doi:10.7554/elife.65993"},"publication":"eLife","ec_funded":1,"file_date_updated":"2021-03-23T10:12:58Z","article_number":"e65993","volume":10,"date_created":"2021-03-23T10:11:46Z","date_updated":"2024-02-21T12:41:57Z","related_material":{"record":[{"id":"8951","relation":"research_data","status":"public"}]},"author":[{"id":"3ABC5BA6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1391-8377","first_name":"Anna A","last_name":"Nagy-Staron","full_name":"Nagy-Staron, Anna A"},{"full_name":"Tomasek, Kathrin","orcid":"0000-0003-3768-877X","id":"3AEC8556-F248-11E8-B48F-1D18A9856A87","last_name":"Tomasek","first_name":"Kathrin"},{"last_name":"Caruso Carter","first_name":"Caroline","full_name":"Caruso Carter, Caroline"},{"full_name":"Sonnleitner, Elisabeth","last_name":"Sonnleitner","first_name":"Elisabeth"},{"first_name":"Bor","last_name":"Kavcic","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6041-254X","full_name":"Kavcic, Bor"},{"full_name":"Paixão, Tiago","last_name":"Paixão","first_name":"Tiago"},{"full_name":"Guet, Calin C","last_name":"Guet","first_name":"Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"GaTk"},{"_id":"CaGu"}],"publisher":"eLife Sciences Publications","publication_status":"published","year":"2021","acknowledgement":"We thank J Bollback, L Hurst, M Lagator, C Nizak, O Rivoire, M Savageau, G Tkacik, and B Vicozo\r\nfor helpful discussions; A Dolinar and A Greshnova for technical assistance; T Bollenbach for supplying the strain JW0336; C Rusnac, and members of the Guet lab for comments. The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement n˚\r\n628377 (ANS) and an Austrian Science Fund (FWF) grant n˚ I 3901-B32 (CCG).","publication_identifier":{"issn":["2050-084X"]},"month":"03","language":[{"iso":"eng"}],"doi":"10.7554/elife.65993","project":[{"call_identifier":"FP7","name":"The Systems Biology of Transcriptional Read-Through in Bacteria: from Synthetic Networks to Genomic Studies","grant_number":"628377","_id":"2517526A-B435-11E9-9278-68D0E5697425"},{"name":"CyberCircuits: Cybergenetic circuits to test composability of gene networks","call_identifier":"FWF","grant_number":"I03901","_id":"268BFA92-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","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":["000631050900001"]}},{"issue":"6","abstract":[{"text":"We introduce a novel technique to automatically decompose an input object’s volume into a set of parts that can be represented by two opposite height fields. Such decomposition enables the manufacturing of individual parts using two-piece reusable rigid molds. Our decomposition strategy relies on a new energy formulation that utilizes a pre-computed signal on the mesh volume representing the accessibility for a predefined set of extraction directions. Thanks to this novel formulation, our method allows for efficient optimization of a fabrication-aware partitioning of volumes in a completely\r\nautomatic way. We demonstrate the efficacy of our approach by generating valid volume partitionings for a wide range of complex objects and physically reproducing several of them.","lang":"eng"}],"type":"journal_article","oa_version":"Submitted Version","file":[{"content_type":"application/pdf","file_size":107708317,"creator":"bbickel","file_name":"rigidmolds-authorversion.pdf","access_level":"open_access","date_created":"2021-10-27T07:08:07Z","date_updated":"2021-10-27T07:08:07Z","checksum":"384ece7a9ad1026787ba9560b04336d5","relation":"main_file","file_id":"10185"}],"_id":"10184","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 40","status":"public","ddc":["000"],"title":"Volume decomposition for two-piece rigid casting","article_processing_charge":"No","has_accepted_license":"1","day":"01","date_published":"2021-12-01T00:00:00Z","citation":{"chicago":"Alderighi, Thomas, Luigi Malomo, Bernd Bickel, Paolo Cignoni, and Nico Pietroni. “Volume Decomposition for Two-Piece Rigid Casting.” ACM Transactions on Graphics. Association for Computing Machinery, 2021. https://doi.org/10.1145/3478513.3480555.","mla":"Alderighi, Thomas, et al. “Volume Decomposition for Two-Piece Rigid Casting.” ACM Transactions on Graphics, vol. 40, no. 6, 272, Association for Computing Machinery, 2021, doi:10.1145/3478513.3480555.","short":"T. Alderighi, L. Malomo, B. Bickel, P. Cignoni, N. Pietroni, ACM Transactions on Graphics 40 (2021).","ista":"Alderighi T, Malomo L, Bickel B, Cignoni P, Pietroni N. 2021. Volume decomposition for two-piece rigid casting. ACM Transactions on Graphics. 40(6), 272.","apa":"Alderighi, T., Malomo, L., Bickel, B., Cignoni, P., & Pietroni, N. (2021). Volume decomposition for two-piece rigid casting. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3478513.3480555","ieee":"T. Alderighi, L. Malomo, B. Bickel, P. Cignoni, and N. Pietroni, “Volume decomposition for two-piece rigid casting,” ACM Transactions on Graphics, vol. 40, no. 6. Association for Computing Machinery, 2021.","ama":"Alderighi T, Malomo L, Bickel B, Cignoni P, Pietroni N. Volume decomposition for two-piece rigid casting. ACM Transactions on Graphics. 2021;40(6). doi:10.1145/3478513.3480555"},"publication":"ACM Transactions on Graphics","article_type":"original","ec_funded":1,"file_date_updated":"2021-10-27T07:08:07Z","article_number":"272","author":[{"last_name":"Alderighi","first_name":"Thomas","full_name":"Alderighi, Thomas"},{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"},{"first_name":"Paolo","last_name":"Cignoni","full_name":"Cignoni, Paolo"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"}],"volume":40,"date_created":"2021-10-27T07:08:19Z","date_updated":"2024-02-28T12:52:48Z","year":"2021","acknowledgement":"The authors thank Marco Callieri for all his precious help with the resin casts. The models used in the paper are courtesy of the Stanford 3D Scanning Repository, the AIM@SHAPE Shape Repository, and Thingi10K Repository. The research was partially funded by the European Research Council (ERC) MATERIALIZABLE: Intelligent fabrication-oriented computational design and modeling (grant no. 715767).","department":[{"_id":"BeBi"}],"publisher":"Association for Computing Machinery","publication_status":"published","publication_identifier":{"eissn":["1557-7368 "],"issn":["0730-0301"]},"month":"12","doi":"10.1145/3478513.3480555","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://vcg.isti.cnr.it/Publications/2021/AMBCP21"}],"external_id":{"isi":["000729846700077"]},"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"isi":1,"quality_controlled":"1"},{"intvolume":" 17","title":"Graph sparsification for derandomizing massively parallel computation with low space","ddc":["000"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9541","file":[{"relation":"main_file","file_id":"9542","date_created":"2021-06-10T19:33:56Z","date_updated":"2021-06-10T19:33:56Z","checksum":"a21c627683890c309a68f6389302c408","success":1,"file_name":"MISMM-arxiv.pdf","access_level":"open_access","file_size":587404,"content_type":"application/pdf","creator":"pdavies"}],"oa_version":"Submitted Version","type":"journal_article","issue":"2","abstract":[{"text":"The Massively Parallel Computation (MPC) model is an emerging model that distills core aspects of distributed and parallel computation, developed as a tool to solve combinatorial (typically graph) problems in systems of many machines with limited space. Recent 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 the fundamental problems of Maximal Matching and Maximal Independent Set. However, there have been no prior corresponding deterministic algorithms. A major challenge underlying the sublinear space setting is that the local space of each machine might be too small to store all edges incident to a single node. This poses a considerable obstacle compared to 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 the additional property that solving the problem on this subgraph provides significant progress towards solving the problem for the original input graph. Using this framework to derandomize the well-known algorithm of Luby [SICOMP’86], we obtain O(log Δ + log log n)-round deterministic MPC algorithms for solving the problems of Maximal Matching and Maximal Independent Set with O(nɛ) space on each machine for any constant ɛ > 0. These algorithms also run in O(log Δ) rounds in the closely related model of CONGESTED CLIQUE, improving upon the state-of-the-art bound of O(log 2Δ) rounds by Censor-Hillel et al. [DISC’17].","lang":"eng"}],"article_type":"original","citation":{"ama":"Czumaj A, Davies P, Parter M. Graph sparsification for derandomizing massively parallel computation with low space. ACM Transactions on Algorithms. 2021;17(2). doi:10.1145/3451992","ista":"Czumaj A, Davies P, Parter M. 2021. Graph sparsification for derandomizing massively parallel computation with low space. ACM Transactions on Algorithms. 17(2), 16.","ieee":"A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing massively parallel computation with low space,” ACM Transactions on Algorithms, vol. 17, no. 2. Association for Computing Machinery, 2021.","apa":"Czumaj, A., Davies, P., & Parter, M. (2021). Graph sparsification for derandomizing massively parallel computation with low space. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3451992","mla":"Czumaj, Artur, et al. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” ACM Transactions on Algorithms, vol. 17, no. 2, 16, Association for Computing Machinery, 2021, doi:10.1145/3451992.","short":"A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).","chicago":"Czumaj, Artur, Peter Davies, and Merav Parter. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” ACM Transactions on Algorithms. Association for Computing Machinery, 2021. https://doi.org/10.1145/3451992."},"publication":"ACM Transactions on Algorithms","date_published":"2021-06-01T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","day":"01","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","publication_status":"published","acknowledgement":"Institute of Science and Technology Austria (IST Austria). Email: peter.davies@ist.ac.at. Work partially\r\ndone at the Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP),University of Warwick. Research partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 754411, the Centre for Discrete Mathematics and its Applications, a Weizmann-UK Making Connections Grant, and EPSRC award EP/N011163/1.","year":"2021","volume":17,"date_updated":"2024-02-28T12:53:09Z","date_created":"2021-06-10T19:31:05Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"7802"}]},"author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"first_name":"Peter","last_name":"Davies","id":"11396234-BB50-11E9-B24C-90FCE5697425","orcid":"0000-0002-5646-9524","full_name":"Davies, Peter"},{"full_name":"Parter, Merav","last_name":"Parter","first_name":"Merav"}],"article_number":"16","ec_funded":1,"file_date_updated":"2021-06-10T19:33:56Z","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"quality_controlled":"1","isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.05390"}],"external_id":{"arxiv":["1912.05390"],"isi":["000661311300006"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/3451992","publication_identifier":{"issn":["1549-6325"],"eissn":["1549-6333"]},"month":"06"},{"ec_funded":1,"article_number":"160602","date_created":"2021-10-13T09:21:33Z","date_updated":"2024-02-29T12:34:10Z","volume":127,"author":[{"full_name":"Suzuki, Fumika","orcid":"0000-0003-4982-5970","id":"650C99FC-1079-11EA-A3C0-73AE3DDC885E","last_name":"Suzuki","first_name":"Fumika"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"},{"full_name":"Zurek, Wojciech H.","last_name":"Zurek","first_name":"Wojciech H."},{"full_name":"Krems, Roman V.","first_name":"Roman V.","last_name":"Krems"}],"publication_status":"published","publisher":"American Physical Society ","department":[{"_id":"MiLe"}],"year":"2021","acknowledgement":"We acknowledge helpful discussions with W. G. Unruh and A. Rodriguez. F. S. is supported by European Union’s\r\nHorizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant No. 754411. M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). W. H. Z. is\r\nsupported by Department of Energy under the Los\r\nAlamos National Laboratory LDRD Program as well as by the U.S. Department of Energy, Office of Science, Basic\r\nEnergy Sciences, Materials Sciences and Engineering Division, Condensed Matter Theory Program. R. V. K. is supported by NSERC of Canada.\r\n","month":"10","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"language":[{"iso":"eng"}],"doi":"10.1103/physrevlett.127.160602","quality_controlled":"1","isi":1,"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425"}],"oa":1,"external_id":{"isi":["000707495700001"],"arxiv":["2011.06279"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2011.06279"}],"abstract":[{"lang":"eng","text":"We investigate the effect of coupling between translational and internal degrees of freedom of composite quantum particles on their localization in a random potential. We show that entanglement between the two degrees of freedom weakens localization due to the upper bound imposed on the inverse participation ratio by purity of a quantum state. We perform numerical calculations for a two-particle system bound by a harmonic force in a 1D disordered lattice and a rigid rotor in a 2D disordered lattice. We illustrate that the coupling has a dramatic effect on localization properties, even with a small number of internal states participating in quantum dynamics."}],"issue":"16","type":"journal_article","oa_version":"Preprint","status":"public","title":"Anderson localization of composite particles","intvolume":" 127","_id":"10134","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"12","article_processing_charge":"No","keyword":["General Physics and Astronomy"],"scopus_import":"1","date_published":"2021-10-12T00:00:00Z","article_type":"original","publication":"Physical Review Letters","citation":{"ieee":"F. Suzuki, M. Lemeshko, W. H. Zurek, and R. V. Krems, “Anderson localization of composite particles,” Physical Review Letters, vol. 127, no. 16. American Physical Society , 2021.","apa":"Suzuki, F., Lemeshko, M., Zurek, W. H., & Krems, R. V. (2021). Anderson localization of composite particles. Physical Review Letters. American Physical Society . https://doi.org/10.1103/physrevlett.127.160602","ista":"Suzuki F, Lemeshko M, Zurek WH, Krems RV. 2021. Anderson localization of composite particles. Physical Review Letters. 127(16), 160602.","ama":"Suzuki F, Lemeshko M, Zurek WH, Krems RV. Anderson localization of composite particles. Physical Review Letters. 2021;127(16). doi:10.1103/physrevlett.127.160602","chicago":"Suzuki, Fumika, Mikhail Lemeshko, Wojciech H. Zurek, and Roman V. Krems. “Anderson Localization of Composite Particles.” Physical Review Letters. American Physical Society , 2021. https://doi.org/10.1103/physrevlett.127.160602.","short":"F. Suzuki, M. Lemeshko, W.H. Zurek, R.V. Krems, Physical Review Letters 127 (2021).","mla":"Suzuki, Fumika, et al. “Anderson Localization of Composite Particles.” Physical Review Letters, vol. 127, no. 16, 160602, American Physical Society , 2021, doi:10.1103/physrevlett.127.160602."}},{"date_created":"2021-07-18T22:01:22Z","date_updated":"2024-03-05T07:13:12Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"15074"}]},"author":[{"full_name":"Brandt, Sebastian","first_name":"Sebastian","last_name":"Brandt"},{"first_name":"Barbara","last_name":"Keller","full_name":"Keller, Barbara"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","first_name":"Joel","last_name":"Rybicki","full_name":"Rybicki, Joel"},{"full_name":"Suomela, Jukka","first_name":"Jukka","last_name":"Suomela"},{"full_name":"Uitto, Jara","last_name":"Uitto","first_name":"Jara"}],"department":[{"_id":"DaAl"}],"publication_status":"published","acknowledgement":"We thank Orr Fischer, Juho Hirvonen, and Tuomo Lempiäinen for valuable discussions. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 840605.","year":"2021","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1145/3409964.3461785","conference":{"end_date":"2021-07-08","location":" Virtual Event, United States","start_date":"2021-07-06","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures "},"project":[{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","grant_number":"840605","call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["2005.07761"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.07761"}],"publication_identifier":{"isbn":["9781450380706"]},"month":"07","oa_version":"Preprint","status":"public","title":"Efficient load-balancing through distributed token dropping","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"9678","abstract":[{"text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for stable orientations and more generally for locally optimal semi-matchings. The prior work by Czygrinow et al. (DISC 2012) finds a stable orientation in O(Δ^5) rounds in graphs of maximum degree Δ, while we improve it to O(Δ^4) and also prove a lower bound of Ω(Δ). For the more general problem of locally optimal semi-matchings, the prior upper bound is O(S^5) and our new algorithm runs in O(C · S^4) rounds, which is an improvement for C = o(S); here C and S are the maximum degrees of customers and servers, respectively.","lang":"eng"}],"type":"conference","date_published":"2021-07-06T00:00:00Z","page":"129-139","citation":{"ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing through distributed token dropping. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. ; 2021:129-139. doi:10.1145/3409964.3461785","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2021. Efficient load-balancing through distributed token dropping. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures , 129–139.","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing through distributed token dropping,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2021, pp. 129–139.","apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., & Uitto, J. (2021). Efficient load-balancing through distributed token dropping. In Annual ACM Symposium on Parallelism in Algorithms and Architectures (pp. 129–139). Virtual Event, United States. https://doi.org/10.1145/3409964.3461785","mla":"Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token Dropping.” Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–39, doi:10.1145/3409964.3461785.","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–139.","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Efficient Load-Balancing through Distributed Token Dropping.” In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 129–39, 2021. https://doi.org/10.1145/3409964.3461785."},"publication":"Annual ACM Symposium on Parallelism in Algorithms and Architectures","article_processing_charge":"No","day":"06","scopus_import":"1"},{"language":[{"iso":"eng"}],"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming ","location":"Virtual, Online; Germany","start_date":"2020-07-08","end_date":"2020-07-11"},"doi":"10.1007/s00453-021-00905-9","isi":1,"quality_controlled":"1","project":[{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"oa":1,"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":{"arxiv":["2003.09297"],"isi":["000734004600001"]},"month":"12","publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"date_updated":"2024-03-05T07:35:53Z","date_created":"2020-08-24T06:24:04Z","author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","last_name":"Nadiradze","first_name":"Giorgi","full_name":"Nadiradze, Giorgi"},{"last_name":"Sabour","first_name":"Amirmojtaba","id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","full_name":"Sabour, Amirmojtaba"}],"related_material":{"link":[{"relation":"earlier_version","url":"https://doi.org/10.4230/LIPIcs.ICALP.2020.7"}],"record":[{"status":"public","relation":"earlier_version","id":"15077"}]},"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Springer Nature","acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier versions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments. Open access funding provided by Institute of Science and Technology (IST Austria). Funding was provided by European Research Council (Grant No. PR1042ERC01).","year":"2021","file_date_updated":"2021-12-27T10:36:40Z","ec_funded":1,"date_published":"2021-12-24T00:00:00Z","article_type":"original","publication":"Algorithmica","citation":{"ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. Algorithmica. 2021. doi:10.1007/s00453-021-00905-9","ieee":"D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” Algorithmica. Springer Nature, 2021.","apa":"Alistarh, D.-A., Nadiradze, G., & Sabour, A. (2021). Dynamic averaging load balancing on cycles. Algorithmica. Virtual, Online; Germany: Springer Nature. https://doi.org/10.1007/s00453-021-00905-9","ista":"Alistarh D-A, Nadiradze G, Sabour A. 2021. Dynamic averaging load balancing on cycles. Algorithmica.","short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica (2021).","mla":"Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” Algorithmica, Springer Nature, 2021, doi:10.1007/s00453-021-00905-9.","chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” Algorithmica. Springer Nature, 2021. https://doi.org/10.1007/s00453-021-00905-9."},"day":"24","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","scopus_import":"1","file":[{"access_level":"open_access","file_name":"2021_Algorithmica_Alistarh.pdf","creator":"cchlebak","file_size":525950,"content_type":"application/pdf","file_id":"10577","relation":"main_file","success":1,"checksum":"21169b25b0c8e17b21e12af22bff9870","date_updated":"2021-12-27T10:36:40Z","date_created":"2021-12-27T10:36:40Z"}],"oa_version":"Published Version","title":"Dynamic averaging load balancing on cycles","status":"public","ddc":["000"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"8286","abstract":[{"lang":"eng","text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor. "}],"type":"journal_article"},{"day":"20","has_accepted_license":"1","article_processing_charge":"No","citation":{"chicago":"Feliciangeli, Dario. “The Polaron at Strong Coupling.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9733.","short":"D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021.","mla":"Feliciangeli, Dario. The Polaron at Strong Coupling. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9733.","apa":"Feliciangeli, D. (2021). The polaron at strong coupling. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9733","ieee":"D. Feliciangeli, “The polaron at strong coupling,” Institute of Science and Technology Austria, 2021.","ista":"Feliciangeli D. 2021. The polaron at strong coupling. Institute of Science and Technology Austria.","ama":"Feliciangeli D. The polaron at strong coupling. 2021. doi:10.15479/at:ista:9733"},"page":"180","date_published":"2021-08-20T00:00:00Z","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"This thesis is the result of the research carried out by the author during his PhD at IST Austria between 2017 and 2021. It mainly focuses on the Fröhlich polaron model, specifically to its regime of strong coupling. This model, which is rigorously introduced and discussed in the introduction, has been of great interest in condensed matter physics and field theory for more than eighty years. It is used to describe an electron interacting with the atoms of a solid material (the strength of this interaction is modeled by the presence of a coupling constant α in the Hamiltonian of the system). The particular regime examined here, which is mathematically described by considering the limit α →∞, displays many interesting features related to the emergence of classical behavior, which allows for a simplified effective description of the system under analysis. The properties, the range of validity and a quantitative analysis of the precision of such classical approximations are the main object of the present work. We specify our investigation to the study of the ground state energy of the system, its dynamics and its effective mass. For each of these problems, we provide in the introduction an overview of the previously known results and a detailed account of the original contributions by the author.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9733","status":"public","title":"The polaron at strong coupling","ddc":["515","519","539"],"file":[{"creator":"dfelicia","content_type":"application/pdf","file_size":1958710,"access_level":"open_access","file_name":"Thesis_FeliciangeliA.pdf","checksum":"e88bb8ca43948abe060eb2d2fa719881","date_created":"2021-08-19T14:03:48Z","date_updated":"2021-09-06T09:28:56Z","file_id":"9944","relation":"main_file"},{"checksum":"72810843abee83705853505b3f8348aa","date_created":"2021-08-19T14:06:35Z","date_updated":"2022-03-10T12:13:57Z","file_id":"9945","relation":"source_file","creator":"dfelicia","file_size":3771669,"content_type":"application/octet-stream","access_level":"closed","file_name":"thesis.7z"}],"oa_version":"Published Version","month":"08","publication_identifier":{"issn":["2663-337X"]},"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"project":[{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"},{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"},{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"doi":"10.15479/at:ista:9733","supervisor":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert"},{"full_name":"Maas, Jan","first_name":"Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"file_date_updated":"2022-03-10T12:13:57Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by-nd/4.0/","year":"2021","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"RoSe"},{"_id":"JaMa"}],"author":[{"full_name":"Feliciangeli, Dario","first_name":"Dario","last_name":"Feliciangeli","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530"}],"related_material":{"record":[{"id":"9787","status":"public","relation":"part_of_dissertation"},{"id":"9792","status":"public","relation":"part_of_dissertation"},{"id":"9225","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"9781"},{"id":"9791","relation":"part_of_dissertation","status":"public"}]},"date_updated":"2024-03-06T12:30:44Z","date_created":"2021-07-27T15:48:30Z"},{"scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","publication":"Journal of Machine Learning Research","citation":{"apa":"Ramezani-Kebrya, A., Faghri, F., Markov, I., Aksenov, V., Alistarh, D.-A., & Roy, D. M. (2021). NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. Journal of Machine Learning Research.","ieee":"A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, and D. M. Roy, “NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization,” Journal of Machine Learning Research, vol. 22, no. 114. Journal of Machine Learning Research, p. 1−43, 2021.","ista":"Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. 2021. NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. 22(114), 1−43.","ama":"Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. 2021;22(114):1−43.","chicago":"Ramezani-Kebrya, Ali, Fartash Faghri, Ilya Markov, Vitalii Aksenov, Dan-Adrian Alistarh, and Daniel M. Roy. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” Journal of Machine Learning Research. Journal of Machine Learning Research, 2021.","short":"A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, D.M. Roy, Journal of Machine Learning Research 22 (2021) 1−43.","mla":"Ramezani-Kebrya, Ali, et al. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” Journal of Machine Learning Research, vol. 22, no. 114, Journal of Machine Learning Research, 2021, p. 1−43."},"article_type":"original","page":"1−43","date_published":"2021-04-01T00:00:00Z","type":"journal_article","abstract":[{"text":"As the size and complexity of models and datasets grow, so does the need for communication-efficient variants of stochastic gradient descent that can be deployed to perform parallel model training. One popular communication-compression method for data-parallel SGD is QSGD (Alistarh et al., 2017), which quantizes and encodes gradients to reduce communication costs. The baseline variant of QSGD provides strong theoretical guarantees, however, for practical purposes, the authors proposed a heuristic variant which we call QSGDinf, which demonstrated impressive empirical gains for distributed training of large neural networks. In this paper, we build on this work to propose a new gradient quantization scheme, and show that it has both stronger theoretical guarantees than QSGD, and matches and exceeds the empirical performance of the QSGDinf heuristic and of other compression methods.","lang":"eng"}],"issue":"114","_id":"9571","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization","status":"public","ddc":["000"],"intvolume":" 22","file":[{"file_size":11237154,"content_type":"application/pdf","creator":"asandaue","access_level":"open_access","file_name":"2021_JournalOfMachineLearningResearch_Ramezani-Kebrya.pdf","checksum":"6428aa8bcb67768b6949c99b55d5281d","success":1,"date_updated":"2021-06-23T07:09:41Z","date_created":"2021-06-23T07:09:41Z","relation":"main_file","file_id":"9595"}],"oa_version":"Published Version","month":"04","publication_identifier":{"eissn":["15337928"],"issn":["15324435"]},"external_id":{"arxiv":["1908.06077"]},"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"},"main_file_link":[{"url":"https://www.jmlr.org/papers/v22/20-255.html","open_access":"1"}],"oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"file_date_updated":"2021-06-23T07:09:41Z","year":"2021","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Journal of Machine Learning Research","author":[{"last_name":"Ramezani-Kebrya","first_name":"Ali","full_name":"Ramezani-Kebrya, Ali"},{"full_name":"Faghri, Fartash","first_name":"Fartash","last_name":"Faghri"},{"first_name":"Ilya","last_name":"Markov","full_name":"Markov, Ilya"},{"full_name":"Aksenov, Vitalii","id":"2980135A-F248-11E8-B48F-1D18A9856A87","last_name":"Aksenov","first_name":"Vitalii"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Roy, Daniel M.","last_name":"Roy","first_name":"Daniel M."}],"date_created":"2021-06-20T22:01:33Z","date_updated":"2024-03-06T12:22:07Z","volume":22},{"ec_funded":1,"date_updated":"2024-03-06T12:12:48Z","date_created":"2020-09-21T11:59:47Z","volume":109,"author":[{"last_name":"Takeo","first_name":"Yukari H.","full_name":"Takeo, Yukari H."},{"full_name":"Shuster, S. Andrew","last_name":"Shuster","first_name":"S. Andrew"},{"full_name":"Jiang, Linnie","first_name":"Linnie","last_name":"Jiang"},{"full_name":"Hu, Miley","first_name":"Miley","last_name":"Hu"},{"full_name":"Luginbuhl, David J.","last_name":"Luginbuhl","first_name":"David J."},{"full_name":"Rülicke, Thomas","first_name":"Thomas","last_name":"Rülicke"},{"id":"475990FE-F248-11E8-B48F-1D18A9856A87","last_name":"Contreras","first_name":"Ximena","full_name":"Contreras, Ximena"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","first_name":"Simon","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon"},{"last_name":"Wagner","first_name":"Mark J.","full_name":"Wagner, Mark J."},{"full_name":"Ganguli, Surya","last_name":"Ganguli","first_name":"Surya"},{"full_name":"Luo, Liqun","first_name":"Liqun","last_name":"Luo"}],"publication_status":"published","department":[{"_id":"SiHi"}],"publisher":"Elsevier","year":"2021","acknowledgement":"We thank M. Mishina for GluD2fl frozen embryos, T.C. Südhof and J.I. Morgan for Cbln1fl mice, L. Anderson for help in generating the MADM alleles, W. Joo for a previously unpublished construct, M. Yuzaki, K. Shen, J. Ding, and members of the Luo lab, including J.M. Kebschull, H. Li, J. Li, T. Li, C.M. McLaughlin, D. Pederick, J. Ren, D.C. Wang and C. Xu for discussions and critiques of the manuscript, and M. Yuzaki for supporting Y.H.T. during the final phase of this project. Y.H.T. was supported by a JSPS fellowship; S.A.S. was supported by a Stanford Graduate Fellowship and an NSF Predoctoral Fellowship; L.J. is supported by a Stanford Graduate Fellowship and an NSF Predoctoral Fellowship; M.J.W. is supported by a Burroughs Wellcome Fund CASI Award. This work was supported by an NIH grant (R01-NS050538) to L.L.; the European Research Council (ERC) under the European Union's Horizon 2020 research and innovations programme (No. 725780 LinPro) to S.H.; and Simons and James S. McDonnell Foundations and an NSF CAREER award to S.G.; L.L. is an HHMI investigator.","month":"02","publication_identifier":{"eissn":["1097-4199"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.neuron.2020.11.028","quality_controlled":"1","project":[{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","call_identifier":"H2020","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://doi.org/10.1101/2020.06.14.151258","open_access":"1"}],"oa":1,"abstract":[{"lang":"eng","text":"The synaptotrophic hypothesis posits that synapse formation stabilizes dendritic branches, yet this hypothesis has not been causally tested in vivo in the mammalian brain. Presynaptic ligand cerebellin-1 (Cbln1) and postsynaptic receptor GluD2 mediate synaptogenesis between granule cells and Purkinje cells in the molecular layer of the cerebellar cortex. Here we show that sparse but not global knockout of GluD2 causes under-elaboration of Purkinje cell dendrites in the deep molecular layer and overelaboration in the superficial molecular layer. Developmental, overexpression, structure-function, and genetic epistasis analyses indicate that dendrite morphogenesis defects result from competitive synaptogenesis in a Cbln1/GluD2-dependent manner. A generative model of dendritic growth based on competitive synaptogenesis largely recapitulates GluD2 sparse and global knockout phenotypes. Our results support the synaptotrophic hypothesis at initial stages of dendrite development, suggest a second mode in which cumulative synapse formation inhibits further dendrite growth, and highlight the importance of competition in dendrite morphogenesis."}],"issue":"4","type":"journal_article","oa_version":"Preprint","title":"GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells","status":"public","intvolume":" 109","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8544","day":"17","article_processing_charge":"No","scopus_import":"1","date_published":"2021-02-17T00:00:00Z","article_type":"original","page":"P629-644.E8","publication":"Neuron","citation":{"chicago":"Takeo, Yukari H., S. Andrew Shuster, Linnie Jiang, Miley Hu, David J. Luginbuhl, Thomas Rülicke, Ximena Contreras, et al. “GluD2- and Cbln1-Mediated Competitive Synaptogenesis Shapes the Dendritic Arbors of Cerebellar Purkinje Cells.” Neuron. Elsevier, 2021. https://doi.org/10.1016/j.neuron.2020.11.028.","mla":"Takeo, Yukari H., et al. “GluD2- and Cbln1-Mediated Competitive Synaptogenesis Shapes the Dendritic Arbors of Cerebellar Purkinje Cells.” Neuron, vol. 109, no. 4, Elsevier, 2021, p. P629–644.E8, doi:10.1016/j.neuron.2020.11.028.","short":"Y.H. Takeo, S.A. Shuster, L. Jiang, M. Hu, D.J. Luginbuhl, T. Rülicke, X. Contreras, S. Hippenmeyer, M.J. Wagner, S. Ganguli, L. Luo, Neuron 109 (2021) P629–644.E8.","ista":"Takeo YH, Shuster SA, Jiang L, Hu M, Luginbuhl DJ, Rülicke T, Contreras X, Hippenmeyer S, Wagner MJ, Ganguli S, Luo L. 2021. GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells. Neuron. 109(4), P629–644.E8.","apa":"Takeo, Y. H., Shuster, S. A., Jiang, L., Hu, M., Luginbuhl, D. J., Rülicke, T., … Luo, L. (2021). GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2020.11.028","ieee":"Y. H. Takeo et al., “GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells,” Neuron, vol. 109, no. 4. Elsevier, p. P629–644.E8, 2021.","ama":"Takeo YH, Shuster SA, Jiang L, et al. GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells. Neuron. 2021;109(4):P629-644.E8. doi:10.1016/j.neuron.2020.11.028"}},{"abstract":[{"lang":"eng","text":"We provide a definition of the effective mass for the classical polaron described by the Landau-Pekar equations. It is based on a novel variational principle, minimizing the energy functional over states with given (initial) velocity. The resulting formula for the polaron's effective mass agrees with the prediction by Landau and Pekar."}],"ec_funded":1,"article_number":"2107.03720 ","type":"preprint","date_created":"2021-08-06T08:49:45Z","date_updated":"2024-03-06T12:30:45Z","oa_version":"Preprint","author":[{"id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530","first_name":"Dario","last_name":"Feliciangeli","full_name":"Feliciangeli, Dario"},{"full_name":"Rademacher, Simone Anna Elvira","last_name":"Rademacher","first_name":"Simone Anna Elvira","orcid":"0000-0001-5059-4466","id":"856966FE-A408-11E9-977E-802DE6697425"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert"}],"related_material":{"record":[{"id":"10755","status":"public","relation":"later_version"},{"id":"9733","status":"public","relation":"dissertation_contains"}]},"publication_status":"submitted","ddc":["510"],"status":"public","title":"The effective mass problem for the Landau-Pekar equations","department":[{"_id":"RoSe"}],"acknowledgement":"We thank Herbert Spohn for helpful comments. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No. 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged..","_id":"9791","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","day":"08","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2021-07-08T00:00:00Z","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"publication":"arXiv","main_file_link":[{"url":"https://arxiv.org/abs/2107.03720","open_access":"1"}],"citation":{"chicago":"Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “The Effective Mass Problem for the Landau-Pekar Equations.” ArXiv, n.d.","short":"D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, ArXiv (n.d.).","mla":"Feliciangeli, Dario, et al. “The Effective Mass Problem for the Landau-Pekar Equations.” ArXiv, 2107.03720.","apa":"Feliciangeli, D., Rademacher, S. A. E., & Seiringer, R. (n.d.). The effective mass problem for the Landau-Pekar equations. arXiv.","ieee":"D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “The effective mass problem for the Landau-Pekar equations,” arXiv. .","ista":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. arXiv, 2107.03720.","ama":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. arXiv."},"external_id":{"arxiv":["2107.03720"]},"oa":1},{"publication_status":"published","department":[{"_id":"GaTk"}],"publisher":"Cell Press","year":"2021","acknowledgement":"The authors thank Dario Ringach for providing the V1 receptive fields and Olivier Marre for providing the retinal receptive fields. W.M. was funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 754411. M.H. was funded in part by Human Frontiers Science grant no. HFSP RGP0032/2018.","date_created":"2020-02-28T11:00:12Z","date_updated":"2024-03-06T14:22:51Z","volume":109,"author":[{"full_name":"Mlynarski, Wiktor F","last_name":"Mlynarski","first_name":"Wiktor F","id":"358A453A-F248-11E8-B48F-1D18A9856A87"},{"id":"4171253A-F248-11E8-B48F-1D18A9856A87","last_name":"Hledik","first_name":"Michal","full_name":"Hledik, Michal"},{"orcid":"0000-0002-1287-3779","id":"3E999752-F248-11E8-B48F-1D18A9856A87","last_name":"Sokolowski","first_name":"Thomas R","full_name":"Sokolowski, Thomas R"},{"last_name":"Tkačik","first_name":"Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"15020"}],"link":[{"url":"https://ist.ac.at/en/news/can-evolution-be-predicted/","relation":"press_release","description":"News on IST Homepage"}]},"ec_funded":1,"isi":1,"quality_controlled":"1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"oa":1,"external_id":{"isi":["000637809600006"]},"main_file_link":[{"url":"https://doi.org/10.1101/848374","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.neuron.2021.01.020","month":"04","status":"public","title":"Statistical analysis and optimality of neural systems","intvolume":" 109","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"7553","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"Normative theories and statistical inference provide complementary approaches for the study of biological systems. A normative theory postulates that organisms have adapted to efficiently solve essential tasks, and proceeds to mathematically work out testable consequences of such optimality; parameters that maximize the hypothesized organismal function can be derived ab initio, without reference to experimental data. In contrast, statistical inference focuses on efficient utilization of data to learn model parameters, without reference to any a priori notion of biological function, utility, or fitness. Traditionally, these two approaches were developed independently and applied separately. Here we unify them in a coherent Bayesian framework that embeds a normative theory into a family of maximum-entropy “optimization priors.” This family defines a smooth interpolation between a data-rich inference regime (characteristic of “bottom-up” statistical models), and a data-limited ab inito prediction regime (characteristic of “top-down” normative theory). We demonstrate the applicability of our framework using data from the visual cortex, and argue that the flexibility it affords is essential to address a number of fundamental challenges relating to inference and prediction in complex, high-dimensional biological problems."}],"issue":"7","page":"1227-1241.e5","publication":"Neuron","citation":{"ieee":"W. F. Mlynarski, M. Hledik, T. R. Sokolowski, and G. Tkačik, “Statistical analysis and optimality of neural systems,” Neuron, vol. 109, no. 7. Cell Press, p. 1227–1241.e5, 2021.","apa":"Mlynarski, W. F., Hledik, M., Sokolowski, T. R., & Tkačik, G. (2021). Statistical analysis and optimality of neural systems. Neuron. Cell Press. https://doi.org/10.1016/j.neuron.2021.01.020","ista":"Mlynarski WF, Hledik M, Sokolowski TR, Tkačik G. 2021. Statistical analysis and optimality of neural systems. Neuron. 109(7), 1227–1241.e5.","ama":"Mlynarski WF, Hledik M, Sokolowski TR, Tkačik G. Statistical analysis and optimality of neural systems. Neuron. 2021;109(7):1227-1241.e5. doi:10.1016/j.neuron.2021.01.020","chicago":"Mlynarski, Wiktor F, Michal Hledik, Thomas R Sokolowski, and Gašper Tkačik. “Statistical Analysis and Optimality of Neural Systems.” Neuron. Cell Press, 2021. https://doi.org/10.1016/j.neuron.2021.01.020.","short":"W.F. Mlynarski, M. Hledik, T.R. Sokolowski, G. Tkačik, Neuron 109 (2021) 1227–1241.e5.","mla":"Mlynarski, Wiktor F., et al. “Statistical Analysis and Optimality of Neural Systems.” Neuron, vol. 109, no. 7, Cell Press, 2021, p. 1227–1241.e5, doi:10.1016/j.neuron.2021.01.020."},"date_published":"2021-04-07T00:00:00Z","scopus_import":"1","day":"07","article_processing_charge":"No"},{"language":[{"iso":"eng"}],"conference":{"end_date":"2021-04-15","location":"Virtual, San Diego, CA, United States","start_date":"2021-04-13","name":"AISTATS: Artificial Intelligence and Statistics"},"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v130/mondelli21a.html"}],"external_id":{"arxiv":["2010.03460"]},"oa":1,"publication_identifier":{"issn":["2640-3498"]},"month":"04","volume":130,"date_created":"2022-01-03T11:34:22Z","date_updated":"2024-03-07T10:36:53Z","related_material":{"record":[{"id":"12480","relation":"later_version","status":"public"}]},"author":[{"first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"first_name":"Ramji","last_name":"Venkataramanan","full_name":"Venkataramanan, Ramji"}],"editor":[{"last_name":"Banerjee","first_name":"Arindam","full_name":"Banerjee, Arindam"},{"first_name":"Kenji","last_name":"Fukumizu","full_name":"Fukumizu, Kenji"}],"department":[{"_id":"MaMo"}],"publisher":"ML Research Press","publication_status":"published","acknowledgement":"The authors would like to thank Andrea Montanari for helpful discussions. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R. Venkataramanan was partially supported by the Alan Turing Institute under the EPSRC grant EP/N510129/1.","year":"2021","date_published":"2021-04-01T00:00:00Z","page":"397-405","citation":{"ama":"Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization for generalized linear models. In: Banerjee A, Fukumizu K, eds. Proceedings of The 24th International Conference on Artificial Intelligence and Statistics. Vol 130. ML Research Press; 2021:397-405.","apa":"Mondelli, M., & Venkataramanan, R. (2021). Approximate message passing with spectral initialization for generalized linear models. In A. Banerjee & K. Fukumizu (Eds.), Proceedings of The 24th International Conference on Artificial Intelligence and Statistics (Vol. 130, pp. 397–405). Virtual, San Diego, CA, United States: ML Research Press.","ieee":"M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral initialization for generalized linear models,” in Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, Virtual, San Diego, CA, United States, 2021, vol. 130, pp. 397–405.","ista":"Mondelli M, Venkataramanan R. 2021. Approximate message passing with spectral initialization for generalized linear models. Proceedings of The 24th International Conference on Artificial Intelligence and Statistics. AISTATS: Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol. 130, 397–405.","short":"M. Mondelli, R. Venkataramanan, in:, A. Banerjee, K. Fukumizu (Eds.), Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2021, pp. 397–405.","mla":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, edited by Arindam Banerjee and Kenji Fukumizu, vol. 130, ML Research Press, 2021, pp. 397–405.","chicago":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” In Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, edited by Arindam Banerjee and Kenji Fukumizu, 130:397–405. ML Research Press, 2021."},"publication":"Proceedings of The 24th International Conference on Artificial Intelligence and Statistics","article_processing_charge":"Yes (via OA deal)","day":"01","scopus_import":"1","oa_version":"Preprint","intvolume":" 130","status":"public","title":"Approximate message passing with spectral initialization for generalized linear models","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"10598","abstract":[{"lang":"eng","text":" We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach. "}],"alternative_title":["Proceedings of Machine Learning Research"],"type":"conference"},{"abstract":[{"text":"This paper aims to obtain a strong convergence result for a Douglas–Rachford splitting method with inertial extrapolation step for finding a zero of the sum of two set-valued maximal monotone operators without any further assumption of uniform monotonicity on any of the involved maximal monotone operators. Furthermore, our proposed method is easy to implement and the inertial factor in our proposed method is a natural choice. Our method of proof is of independent interest. Finally, some numerical implementations are given to confirm the theoretical analysis.","lang":"eng"}],"type":"journal_article","file":[{"access_level":"open_access","file_name":"2020_OptimizationEngineering_Shehu.pdf","file_size":2137860,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"8197","success":1,"date_updated":"2020-08-03T15:24:39Z","date_created":"2020-08-03T15:24:39Z"}],"oa_version":"Published Version","_id":"8196","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"New strong convergence method for the sum of two maximal monotone operators","ddc":["510"],"status":"public","intvolume":" 22","day":"25","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","date_published":"2021-02-25T00:00:00Z","publication":"Optimization and Engineering","citation":{"ama":"Shehu Y, Dong Q-L, Liu L-L, Yao J-C. New strong convergence method for the sum of two maximal monotone operators. Optimization and Engineering. 2021;22:2627-2653. doi:10.1007/s11081-020-09544-5","ieee":"Y. Shehu, Q.-L. Dong, L.-L. Liu, and J.-C. Yao, “New strong convergence method for the sum of two maximal monotone operators,” Optimization and Engineering, vol. 22. Springer Nature, pp. 2627–2653, 2021.","apa":"Shehu, Y., Dong, Q.-L., Liu, L.-L., & Yao, J.-C. (2021). New strong convergence method for the sum of two maximal monotone operators. Optimization and Engineering. Springer Nature. https://doi.org/10.1007/s11081-020-09544-5","ista":"Shehu Y, Dong Q-L, Liu L-L, Yao J-C. 2021. New strong convergence method for the sum of two maximal monotone operators. Optimization and Engineering. 22, 2627–2653.","short":"Y. Shehu, Q.-L. Dong, L.-L. Liu, J.-C. Yao, Optimization and Engineering 22 (2021) 2627–2653.","mla":"Shehu, Yekini, et al. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.” Optimization and Engineering, vol. 22, Springer Nature, 2021, pp. 2627–53, doi:10.1007/s11081-020-09544-5.","chicago":"Shehu, Yekini, Qiao-Li Dong, Lu-Lu Liu, and Jen-Chih Yao. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.” Optimization and Engineering. Springer Nature, 2021. https://doi.org/10.1007/s11081-020-09544-5."},"article_type":"original","page":"2627-2653","file_date_updated":"2020-08-03T15:24:39Z","ec_funded":1,"author":[{"full_name":"Shehu, Yekini","first_name":"Yekini","last_name":"Shehu","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9224-7139"},{"first_name":"Qiao-Li","last_name":"Dong","full_name":"Dong, Qiao-Li"},{"first_name":"Lu-Lu","last_name":"Liu","full_name":"Liu, Lu-Lu"},{"last_name":"Yao","first_name":"Jen-Chih","full_name":"Yao, Jen-Chih"}],"date_created":"2020-08-03T14:29:57Z","date_updated":"2024-03-07T14:39:29Z","volume":22,"year":"2021","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The project of Yekini Shehu has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7—2007–2013) (Grant Agreement No. 616160). The authors are grateful to the anonymous referees and the handling Editor for their comments and suggestions which have improved the earlier version of the manuscript greatly.","publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"Springer Nature","month":"02","publication_identifier":{"eissn":["1573-2924"],"issn":["1389-4420"]},"doi":"10.1007/s11081-020-09544-5","language":[{"iso":"eng"}],"oa":1,"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":{"isi":["000559345400001"]},"isi":1,"quality_controlled":"1","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}]},{"ec_funded":1,"acknowledgement":"G.S., M.W.,F.A.Z acknowledge financial support from The Netherlands Organization for Scientific Research (NWO). F.Z., D.L., G.K. acknowledge funding from the European Union’s Horizon 2020 research and innovation programme under Grand Agreement Nr. 862046. G.K. acknowledges funding from FP7 ERC Starting Grant 335497, FWF Y 715-N30, FWF P-30207. S.D. acknowledges support from the European Union’s Horizon 2020 program under Grant\r\nAgreement No. 81050 and from the Agence Nationale de la Recherche through the TOPONANO and CMOSQSPIN projects. J.Z. acknowledges support from the National Key R&D Program of China (Grant No. 2016YFA0301701) and Strategic Priority Research Program of CAS (Grant No. XDB30000000). D.L. and C.K. acknowledge the Swiss National Science Foundation and NCCR QSIT.","year":"2021","publisher":"Springer Nature","department":[{"_id":"GeKa"}],"publication_status":"published","author":[{"last_name":"Scappucci","first_name":"Giordano","full_name":"Scappucci, Giordano"},{"full_name":"Kloeffel, Christoph","first_name":"Christoph","last_name":"Kloeffel"},{"last_name":"Zwanenburg","first_name":"Floris A.","full_name":"Zwanenburg, Floris A."},{"full_name":"Loss, Daniel","first_name":"Daniel","last_name":"Loss"},{"first_name":"Maksym","last_name":"Myronov","full_name":"Myronov, Maksym"},{"full_name":"Zhang, Jian-Jun","first_name":"Jian-Jun","last_name":"Zhang"},{"full_name":"Franceschi, Silvano De","last_name":"Franceschi","first_name":"Silvano De"},{"first_name":"Georgios","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios"},{"last_name":"Veldhorst","first_name":"Menno","full_name":"Veldhorst, Menno"}],"volume":6,"date_created":"2020-12-02T10:52:51Z","date_updated":"2024-03-07T14:48:57Z","publication_identifier":{"eissn":["2058-8437"]},"month":"10","main_file_link":[{"url":"https://arxiv.org/abs/2004.08133","open_access":"1"}],"oa":1,"external_id":{"isi":["000600826100003"],"arxiv":["2004.08133"]},"project":[{"call_identifier":"FP7","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","_id":"25517E86-B435-11E9-9278-68D0E5697425","grant_number":"335497"},{"name":"Loch Spin-Qubits und Majorana-Fermionen in Germanium","call_identifier":"FWF","grant_number":"Y00715","_id":"2552F888-B435-11E9-9278-68D0E5697425"},{"_id":"2641CE5E-B435-11E9-9278-68D0E5697425","grant_number":"P30207","name":"Hole spin orbit qubits in Ge quantum wells","call_identifier":"FWF"}],"quality_controlled":"1","isi":1,"doi":"10.1038/s41578-020-00262-z","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"In the worldwide endeavor for disruptive quantum technologies, germanium is emerging as a versatile material to realize devices capable of encoding, processing, or transmitting quantum information. These devices leverage special properties of the germanium valence-band states, commonly known as holes, such as their inherently strong spin-orbit coupling and the ability to host superconducting pairing correlations. In this Review, we initially introduce the physics of holes in low-dimensional germanium structures with key insights from a theoretical perspective. We then examine the material science progress underpinning germanium-based planar heterostructures and nanowires. We review the most significant experimental results demonstrating key building blocks for quantum technology, such as an electrically driven universal quantum gate set with spin qubits in quantum dots and superconductor-semiconductor devices for hybrid quantum systems. We conclude by identifying the most promising prospects\r\ntoward scalable quantum information processing. "}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"8911","intvolume":" 6","title":"The germanium quantum information route","status":"public","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"01","citation":{"ista":"Scappucci G, Kloeffel C, Zwanenburg FA, Loss D, Myronov M, Zhang J-J, Franceschi SD, Katsaros G, Veldhorst M. 2021. The germanium quantum information route. Nature Reviews Materials. 6, 926–943.","apa":"Scappucci, G., Kloeffel, C., Zwanenburg, F. A., Loss, D., Myronov, M., Zhang, J.-J., … Veldhorst, M. (2021). The germanium quantum information route. Nature Reviews Materials. Springer Nature. https://doi.org/10.1038/s41578-020-00262-z","ieee":"G. Scappucci et al., “The germanium quantum information route,” Nature Reviews Materials, vol. 6. Springer Nature, pp. 926–943, 2021.","ama":"Scappucci G, Kloeffel C, Zwanenburg FA, et al. The germanium quantum information route. Nature Reviews Materials. 2021;6:926–943. doi:10.1038/s41578-020-00262-z","chicago":"Scappucci, Giordano, Christoph Kloeffel, Floris A. Zwanenburg, Daniel Loss, Maksym Myronov, Jian-Jun Zhang, Silvano De Franceschi, Georgios Katsaros, and Menno Veldhorst. “The Germanium Quantum Information Route.” Nature Reviews Materials. Springer Nature, 2021. https://doi.org/10.1038/s41578-020-00262-z.","mla":"Scappucci, Giordano, et al. “The Germanium Quantum Information Route.” Nature Reviews Materials, vol. 6, Springer Nature, 2021, pp. 926–943, doi:10.1038/s41578-020-00262-z.","short":"G. Scappucci, C. Kloeffel, F.A. Zwanenburg, D. Loss, M. Myronov, J.-J. Zhang, S.D. Franceschi, G. Katsaros, M. Veldhorst, Nature Reviews Materials 6 (2021) 926–943."},"publication":"Nature Reviews Materials","page":"926–943 ","article_type":"original","date_published":"2021-10-01T00:00:00Z"},{"page":"938-976","article_type":"original","citation":{"short":"A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational Geometry 66 (2021) 938–976.","mla":"Akopyan, Arseniy, et al. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” Discrete and Computational Geometry, vol. 66, Springer Nature, 2021, pp. 938–76, doi:10.1007/s00454-020-00240-w.","chicago":"Akopyan, Arseniy, Alexander I. Bobenko, Wolfgang K. Schief, and Jan Techter. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00240-w.","ama":"Akopyan A, Bobenko AI, Schief WK, Techter J. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. 2021;66:938-976. doi:10.1007/s00454-020-00240-w","ieee":"A. Akopyan, A. I. Bobenko, W. K. Schief, and J. Techter, “On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs,” Discrete and Computational Geometry, vol. 66. Springer Nature, pp. 938–976, 2021.","apa":"Akopyan, A., Bobenko, A. I., Schief, W. K., & Techter, J. (2021). On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00240-w","ista":"Akopyan A, Bobenko AI, Schief WK, Techter J. 2021. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. 66, 938–976."},"publication":"Discrete and Computational Geometry","date_published":"2021-10-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","intvolume":" 66","status":"public","title":"On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs","_id":"8338","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"Canonical parametrisations of classical confocal coordinate systems are introduced and exploited to construct non-planar analogues of incircular (IC) nets on individual quadrics and systems of confocal quadrics. Intimate connections with classical deformations of quadrics that are isometric along asymptotic lines and circular cross-sections of quadrics are revealed. The existence of octahedral webs of surfaces of Blaschke type generated by asymptotic and characteristic lines that are diagonally related to lines of curvature is proved theoretically and established constructively. Appropriate samplings (grids) of these webs lead to three-dimensional extensions of non-planar IC nets. Three-dimensional octahedral grids composed of planes and spatially extending (checkerboard) IC-nets are shown to arise in connection with systems of confocal quadrics in Minkowski space. In this context, the Laguerre geometric notion of conical octahedral grids of planes is introduced. The latter generalise the octahedral grids derived from systems of confocal quadrics in Minkowski space. An explicit construction of conical octahedral grids is presented. The results are accompanied by various illustrations which are based on the explicit formulae provided by the theory.","lang":"eng"}],"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020"}],"quality_controlled":"1","isi":1,"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.00856"}],"external_id":{"isi":["000564488500002"],"arxiv":["1908.00856"]},"language":[{"iso":"eng"}],"doi":"10.1007/s00454-020-00240-w","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"month":"10","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","publication_status":"published","year":"2021","acknowledgement":"This research was supported by the DFG Collaborative Research Center TRR 109 “Discretization in Geometry and Dynamics”. W.K.S. was also supported by the Australian Research Council (DP1401000851). A.V.A. was also supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818 Alpha).","volume":66,"date_created":"2020-09-06T22:01:13Z","date_updated":"2024-03-07T14:51:11Z","author":[{"full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan"},{"first_name":"Alexander I.","last_name":"Bobenko","full_name":"Bobenko, Alexander I."},{"full_name":"Schief, Wolfgang K.","first_name":"Wolfgang K.","last_name":"Schief"},{"first_name":"Jan","last_name":"Techter","full_name":"Techter, Jan"}],"ec_funded":1},{"publication_identifier":{"issn":["0178-2770"],"eissn":["1432-0452"]},"month":"12","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"quality_controlled":"1","isi":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00446-020-00380-5"}],"external_id":{"arxiv":["1903.05956"],"isi":["000556444600001"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s00446-020-00380-5","publisher":"Springer Nature","department":[{"_id":"DaAl"}],"publication_status":"published","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). We thank Mohsen Ghaffari, Michael Elkin and Merav Parter for fruitful discussions. This project has received funding from the European Union’s Horizon 2020 Research And Innovation Program under Grant Agreement No. 755839.","year":"2021","volume":34,"date_updated":"2024-03-07T14:43:39Z","date_created":"2020-06-07T22:00:54Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"6933"}]},"author":[{"full_name":"Censor-Hillel, Keren","first_name":"Keren","last_name":"Censor-Hillel"},{"last_name":"Dory","first_name":"Michal","full_name":"Dory, Michal"},{"full_name":"Korhonen, Janne","first_name":"Janne","last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"},{"last_name":"Leitersdorf","first_name":"Dean","full_name":"Leitersdorf, Dean"}],"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","day":"01","page":"463-487","article_type":"original","citation":{"mla":"Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” Distributed Computing, vol. 34, Springer Nature, 2021, pp. 463–87, doi:10.1007/s00446-020-00380-5.","short":"K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.","chicago":"Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf. “Fast Approximate Shortest Paths in the Congested Clique.” Distributed Computing. Springer Nature, 2021. https://doi.org/10.1007/s00446-020-00380-5.","ama":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. Distributed Computing. 2021;34:463-487. doi:10.1007/s00446-020-00380-5","ista":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2021. Fast approximate shortest paths in the congested clique. Distributed Computing. 34, 463–487.","ieee":"K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” Distributed Computing, vol. 34. Springer Nature, pp. 463–487, 2021.","apa":"Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2021). Fast approximate shortest paths in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-020-00380-5"},"publication":"Distributed Computing","date_published":"2021-12-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"We design fast deterministic algorithms for distance computation in the Congested Clique model. Our key contributions include:\r\n A (2+ϵ)-approximation for all-pairs shortest paths in O(log2n/ϵ) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model.\r\n A (1+ϵ)-approximation for multi-source shortest paths from O(n−−√) sources in O(log2n/ϵ) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size.\r\n\r\nOur main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in O~(n1/6) rounds. "}],"intvolume":" 34","status":"public","title":"Fast approximate shortest paths in the congested clique","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"7939","oa_version":"Published Version"},{"oa_version":"Published Version","_id":"8248","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 66","ddc":["510"],"title":"Local conditions for triangulating submanifolds of Euclidean space","status":"public","abstract":[{"lang":"eng","text":"We consider the following setting: suppose that we are given a manifold M in Rd with positive reach. Moreover assume that we have an embedded simplical complex A without boundary, whose vertex set lies on the manifold, is sufficiently dense and such that all simplices in A have sufficient quality. We prove that if, locally, interiors of the projection of the simplices onto the tangent space do not intersect, then A is a triangulation of the manifold, that is, they are homeomorphic."}],"type":"journal_article","date_published":"2021-09-01T00:00:00Z","citation":{"chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, and Mathijs Wintraecken. “Local Conditions for Triangulating Submanifolds of Euclidean Space.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00233-9.","short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete and Computational Geometry 66 (2021) 666–686.","mla":"Boissonnat, Jean-Daniel, et al. “Local Conditions for Triangulating Submanifolds of Euclidean Space.” Discrete and Computational Geometry, vol. 66, Springer Nature, 2021, pp. 666–86, doi:10.1007/s00454-020-00233-9.","apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., Lieutier, A., & Wintraecken, M. (2021). Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00233-9","ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, and M. Wintraecken, “Local conditions for triangulating submanifolds of Euclidean space,” Discrete and Computational Geometry, vol. 66. Springer Nature, pp. 666–686, 2021.","ista":"Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. 2021. Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. 66, 666–686.","ama":"Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. 2021;66:666-686. doi:10.1007/s00454-020-00233-9"},"publication":"Discrete and Computational Geometry","page":"666-686","article_type":"original","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","scopus_import":"1","author":[{"last_name":"Boissonnat","first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel"},{"full_name":"Dyer, Ramsay","first_name":"Ramsay","last_name":"Dyer"},{"full_name":"Ghosh, Arijit","first_name":"Arijit","last_name":"Ghosh"},{"full_name":"Lieutier, Andre","first_name":"Andre","last_name":"Lieutier"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken"}],"volume":66,"date_created":"2020-08-11T07:11:51Z","date_updated":"2024-03-07T14:54:59Z","acknowledgement":"Open access funding provided by the Institute of Science and Technology (IST Austria). Arijit Ghosh is supported by the Ramanujan Fellowship (No. SB/S2/RJN-064/2015), India.\r\nThis work has been funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). The third author is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015), India. The fifth author also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","year":"2021","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","publication_status":"published","ec_funded":1,"doi":"10.1007/s00454-020-00233-9","language":[{"iso":"eng"}],"oa":1,"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"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00454-020-00233-9"}],"external_id":{"isi":["000558119300001"]},"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"month":"09"},{"publication_identifier":{"issn":["17597684"],"eissn":["17597692"]},"month":"04","doi":"10.1002/wdev.383","language":[{"iso":"eng"}],"external_id":{"isi":["000531419400001"],"pmid":["32391980"]},"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,"project":[{"_id":"B6FC0238-B512-11E9-945C-1524E6697425","grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord","call_identifier":"H2020"},{"name":"The role of morphogens in the regulation of neural tube growth","_id":"267AF0E4-B435-11E9-9278-68D0E5697425"},{"name":"Morphogen control of growth and pattern in the spinal cord","grant_number":"F07802","_id":"059DF620-7A3F-11EA-A408-12923DDC885E"}],"isi":1,"quality_controlled":"1","ec_funded":1,"file_date_updated":"2020-11-24T13:11:39Z","article_number":"e383","related_material":{"record":[{"id":"14323","relation":"dissertation_contains","status":"public"}]},"author":[{"last_name":"Kuzmicz-Kowalska","first_name":"Katarzyna","id":"4CED352A-F248-11E8-B48F-1D18A9856A87","full_name":"Kuzmicz-Kowalska, Katarzyna"},{"first_name":"Anna","last_name":"Kicheva","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4509-4998","full_name":"Kicheva, Anna"}],"date_updated":"2024-03-07T15:03:00Z","date_created":"2020-05-24T22:01:00Z","pmid":1,"year":"2021","acknowledgement":"Austrian Academy of Sciences, Grant/Award Number: DOC fellowship for Katarzyna Kuzmicz-Kowalska; Austrian Science Fund, Grant/Award Number: F78 (Stem Cell Modulation); H2020 European Research Council, Grant/Award Number: 680037","publisher":"Wiley","department":[{"_id":"AnKi"}],"publication_status":"published","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"15","scopus_import":"1","date_published":"2021-04-15T00:00:00Z","citation":{"chicago":"Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and Scale in Vertebrate Spinal Cord Development.” Wiley Interdisciplinary Reviews: Developmental Biology. Wiley, 2021. https://doi.org/10.1002/wdev.383.","mla":"Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and Scale in Vertebrate Spinal Cord Development.” Wiley Interdisciplinary Reviews: Developmental Biology, e383, Wiley, 2021, doi:10.1002/wdev.383.","short":"K. Kuzmicz-Kowalska, A. Kicheva, Wiley Interdisciplinary Reviews: Developmental Biology (2021).","ista":"Kuzmicz-Kowalska K, Kicheva A. 2021. Regulation of size and scale in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology., e383.","ieee":"K. Kuzmicz-Kowalska and A. Kicheva, “Regulation of size and scale in vertebrate spinal cord development,” Wiley Interdisciplinary Reviews: Developmental Biology. Wiley, 2021.","apa":"Kuzmicz-Kowalska, K., & Kicheva, A. (2021). Regulation of size and scale in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology. Wiley. https://doi.org/10.1002/wdev.383","ama":"Kuzmicz-Kowalska K, Kicheva A. Regulation of size and scale in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology. 2021. doi:10.1002/wdev.383"},"publication":"Wiley Interdisciplinary Reviews: Developmental Biology","article_type":"original","abstract":[{"text":"All vertebrates have a spinal cord with dimensions and shape specific to their species. Yet how species‐specific organ size and shape are achieved is a fundamental unresolved question in biology. The formation and sculpting of organs begins during embryonic development. As it develops, the spinal cord extends in anterior–posterior direction in synchrony with the overall growth of the body. The dorsoventral (DV) and apicobasal lengths of the spinal cord neuroepithelium also change, while at the same time a characteristic pattern of neural progenitor subtypes along the DV axis is established and elaborated. At the basis of these changes in tissue size and shape are biophysical determinants, such as the change in cell number, cell size and shape, and anisotropic tissue growth. These processes are controlled by global tissue‐scale regulators, such as morphogen signaling gradients as well as mechanical forces. Current challenges in the field are to uncover how these tissue‐scale regulatory mechanisms are translated to the cellular and molecular level, and how regulation of distinct cellular processes gives rise to an overall defined size. Addressing these questions will help not only to achieve a better understanding of how size is controlled, but also of how tissue size is coordinated with the specification of pattern.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"success":1,"checksum":"f0a7745d48afa09ea7025e876a0145a8","date_updated":"2020-11-24T13:11:39Z","date_created":"2020-11-24T13:11:39Z","file_id":"8800","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":2527276,"access_level":"open_access","file_name":"2020_WIREs_DevBio_KuzmiczKowalska.pdf"}],"_id":"7883","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["570"],"title":"Regulation of size and scale in vertebrate spinal cord development"}]