[{"file":[{"file_size":587404,"access_level":"open_access","checksum":"a21c627683890c309a68f6389302c408","creator":"pdavies","relation":"main_file","date_created":"2021-06-10T19:33:56Z","file_name":"MISMM-arxiv.pdf","file_id":"9542","success":1,"content_type":"application/pdf","date_updated":"2021-06-10T19:33:56Z"}],"isi":1,"article_type":"original","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"first_name":"Peter","orcid":"0000-0002-5646-9524","full_name":"Davies, Peter","id":"11396234-BB50-11E9-B24C-90FCE5697425","last_name":"Davies"},{"full_name":"Parter, Merav","first_name":"Merav","last_name":"Parter"}],"ec_funded":1,"has_accepted_license":"1","oa":1,"quality_controlled":"1","article_number":"16","date_created":"2021-06-10T19:31:05Z","publication":"ACM Transactions on Algorithms","article_processing_charge":"No","oa_version":"Submitted Version","_id":"9541","publisher":"Association for Computing Machinery","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"7802","status":"public","relation":"earlier_version"}]},"day":"01","department":[{"_id":"DaAl"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"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.","external_id":{"isi":["000661311300006"],"arxiv":["1912.05390"]},"publication_status":"published","scopus_import":"1","fulldoi":"https://doi.org/10.1145/3451992","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"}],"doi":"10.1145/3451992","status":"public","type":"journal_article","month":"06","arxiv":1,"title":"Graph sparsification for derandomizing massively parallel computation with low space","date_published":"2021-06-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.05390"}],"citation":{"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.","apa":"Czumaj, A., Davies, P., &#38; Parter, M. (2021). Graph sparsification for derandomizing massively parallel computation with low space. <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3451992\">https://doi.org/10.1145/3451992</a>","ama":"Czumaj A, Davies P, Parter M. Graph sparsification for derandomizing massively parallel computation with low space. <i>ACM Transactions on Algorithms</i>. 2021;17(2). doi:<a href=\"https://doi.org/10.1145/3451992\">10.1145/3451992</a>","mla":"Czumaj, Artur, et al. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” <i>ACM Transactions on Algorithms</i>, vol. 17, no. 2, 16, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3451992\">10.1145/3451992</a>.","short":"A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).","ieee":"A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing massively parallel computation with low space,” <i>ACM Transactions on Algorithms</i>, vol. 17, no. 2. Association for Computing Machinery, 2021.","chicago":"Czumaj, Artur, Peter Davies, and Merav Parter. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3451992\">https://doi.org/10.1145/3451992</a>."},"intvolume":"        17","file_date_updated":"2021-06-10T19:33:56Z","date_updated":"2025-04-15T06:54:47Z","volume":17,"publication_identifier":{"eissn":["1549-6333"],"issn":["1549-6325"]},"issue":"2","year":"2021"},{"year":"2021","day":"01","date_updated":"2026-06-18T19:53:18Z","language":[{"iso":"eng"}],"oa_version":"Published Version","_id":"9543","citation":{"ista":"Davies P, Gurunanthan V, Moshrefi N, Ashkboos S, Alistarh D-A. 2021. New bounds for distributed mean estimation and variance reduction. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","apa":"Davies, P., Gurunanthan, V., Moshrefi, N., Ashkboos, S., &#38; Alistarh, D.-A. (2021). New bounds for distributed mean estimation and variance reduction. In <i>9th International Conference on Learning Representations</i>. Virtual.","ama":"Davies P, Gurunanthan V, Moshrefi N, Ashkboos S, Alistarh D-A. New bounds for distributed mean estimation and variance reduction. In: <i>9th International Conference on Learning Representations</i>. ; 2021.","mla":"Davies, Peter, et al. “New Bounds for Distributed Mean Estimation and Variance Reduction.” <i>9th International Conference on Learning Representations</i>, 2021.","short":"P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, D.-A. Alistarh, in:, 9th International Conference on Learning Representations, 2021.","ieee":"P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, and D.-A. Alistarh, “New bounds for distributed mean estimation and variance reduction,” in <i>9th International Conference on Learning Representations</i>, Virtual, 2021.","chicago":"Davies, Peter, Vijaykrishna Gurunanthan, Niusha  Moshrefi, Saleh Ashkboos, and Dan-Adrian Alistarh. “New Bounds for Distributed Mean Estimation and Variance Reduction.” In <i>9th International Conference on Learning Representations</i>, 2021."},"article_processing_charge":"No","conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2021-05-03","end_date":"2021-05-07","location":"Virtual"},"date_published":"2021-05-01T00:00:00Z","main_file_link":[{"url":"https://openreview.net/pdf?id=t86MwoUCCNe","open_access":"1"}],"publication":"9th International Conference on Learning Representations","title":"New bounds for distributed mean estimation and variance reduction","arxiv":1,"type":"conference","month":"05","status":"public","corr_author":"1","date_created":"2021-06-10T19:46:08Z","abstract":[{"text":"We consider the problem ofdistributed mean estimation (DME), in which n machines are each given a local d-dimensional vector xv∈Rd, and must cooperate to estimate the mean of their inputs μ=1n∑nv=1xv, while minimizing total communication cost. DME is a fundamental construct in distributed machine learning, and there has been considerable work on variants of this problem, especially in the context of distributed variance reduction for stochastic gradients in parallel SGD. Previous work typically assumes an upper bound on the norm of the input vectors, and achieves an error bound in terms of this norm. However, in many real applications, the input vectors are concentrated around the correct output μ, but μ itself has large norm. In such cases, previous output error bounds perform poorly. In this paper, we show that output error bounds need not depend on input norm. We provide a method of quantization which allows distributed mean estimation to be performed with solution quality dependent only on the distance between inputs, not on input norm, and show an analogous result for distributed variance reduction. The technique is based on a new connection with lattice theory. We also provide lower bounds showing that the communication to error trade-off of our algorithms is asymptotically optimal. As the lattices achieving optimal bounds under l2-norm can be computationally impractical, we also present an extension which leverages easy-to-use cubic lattices, and is loose only up to a logarithmic factor ind. We show experimentally that our method yields practical improvements for common applications, relative to prior approaches.","lang":"eng"}],"quality_controlled":"1","publication_status":"published","oa":1,"external_id":{"arxiv":["2002.09268"]},"ec_funded":1,"author":[{"id":"11396234-BB50-11E9-B24C-90FCE5697425","last_name":"Davies","first_name":"Peter","orcid":"0000-0002-5646-9524","full_name":"Davies, Peter"},{"last_name":"Gurunanthan","first_name":"Vijaykrishna","full_name":"Gurunanthan, Vijaykrishna"},{"first_name":"Niusha ","full_name":"Moshrefi, Niusha ","id":"4db776ff-ce15-11eb-96e3-bc2b90b01c16","last_name":"Moshrefi"},{"last_name":"Ashkboos","id":"0D0A9058-257B-11EA-A937-9341C3D8BC8A","full_name":"Ashkboos, Saleh","first_name":"Saleh"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"ddc":["000"],"department":[{"_id":"DaAl"}]},{"article_type":"original","ddc":["004"],"file":[{"file_id":"10120","content_type":"application/pdf","date_updated":"2021-10-11T12:06:50Z","success":1,"relation":"main_file","file_name":"ScatteringAwareColor3DPrinting_authorVersion.pdf","date_created":"2021-10-11T12:06:50Z","checksum":"33271724215f54a75c39d2ed40f2c502","creator":"bbickel","file_size":26026501,"access_level":"open_access"}],"isi":1,"author":[{"last_name":"Rittig","full_name":"Rittig, Tobias","first_name":"Tobias"},{"last_name":"Sumin","first_name":"Denis","full_name":"Sumin, Denis"},{"first_name":"Vahid","full_name":"Babaei, Vahid","last_name":"Babaei"},{"last_name":"Didyk","full_name":"Didyk, Piotr","first_name":"Piotr"},{"first_name":"Alexey","full_name":"Voloboy, Alexey","last_name":"Voloboy"},{"first_name":"Alexander","full_name":"Wilkie, Alexander","last_name":"Wilkie"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","first_name":"Bernd"},{"last_name":"Myszkowski","first_name":"Karol","full_name":"Myszkowski, Karol"},{"last_name":"Weyrich","full_name":"Weyrich, Tim","first_name":"Tim"},{"last_name":"Křivánek","full_name":"Křivánek, Jaroslav","first_name":"Jaroslav"}],"ec_funded":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","has_accepted_license":"1","oa":1,"date_created":"2021-06-13T22:01:32Z","article_processing_charge":"No","publisher":"Wiley","_id":"9547","oa_version":"Submitted Version","publication":"Computer Graphics Forum","language":[{"iso":"eng"}],"day":"01","department":[{"_id":"BeBi"}],"project":[{"call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425","grant_number":"642841","name":"Distributed 3D Object Design"},{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"acknowledgement":"We thank Sebastian Cucerca for processing and capturing the phys-cal printouts. This work was supported by the Charles University grant SVV-260588 and Czech Science Foundation grant 19-07626S. This project has received funding from the European Union’s Horizon 2020 research and innovation programme, under the Marie Skłodowska Curie grant agreements No 642841 (DISTRO) and No765911 (RealVision), and under the European Research Council grant agreement No 715767 (MATERIALIZABLE).","external_id":{"isi":["000657959600017"]},"publication_status":"published","doi":"10.1111/cgf.142626","scopus_import":"1","fulldoi":"https://doi.org/10.1111/cgf.142626","abstract":[{"text":"With the wider availability of full-color 3D printers, color-accurate 3D-print preparation has received increased attention. A key challenge lies in the inherent translucency of commonly used print materials that blurs out details of the color texture. Previous work tries to compensate for these scattering effects through strategic assignment of colored primary materials to printer voxels. To date, the highest-quality approach uses iterative optimization that relies on computationally expensive Monte Carlo light transport simulation to predict the surface appearance from subsurface scattering within a given print material distribution; that optimization, however, takes in the order of days on a single machine. In our work, we dramatically speed up the process by replacing the light transport simulation with a data-driven approach. Leveraging a deep neural network to predict the scattering within a highly heterogeneous medium, our method performs around two orders of magnitude faster than Monte Carlo rendering while yielding optimization results of similar quality level. The network is based on an established method from atmospheric cloud rendering, adapted to our domain and extended by a physically motivated weight sharing scheme that substantially reduces the network size. We analyze its performance in an end-to-end print preparation pipeline and compare quality and runtime to alternative approaches, and demonstrate its generalization to unseen geometry and material values. This for the first time enables full heterogenous material optimization for 3D-print preparation within time frames in the order of the actual printing time.","lang":"eng"}],"status":"public","type":"journal_article","month":"05","citation":{"ama":"Rittig T, Sumin D, Babaei V, et al. Neural acceleration of scattering-aware color 3D printing. <i>Computer Graphics Forum</i>. 2021;40(2):205-219. doi:<a href=\"https://doi.org/10.1111/cgf.142626\">10.1111/cgf.142626</a>","apa":"Rittig, T., Sumin, D., Babaei, V., Didyk, P., Voloboy, A., Wilkie, A., … Křivánek, J. (2021). Neural acceleration of scattering-aware color 3D printing. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.142626\">https://doi.org/10.1111/cgf.142626</a>","ista":"Rittig T, Sumin D, Babaei V, Didyk P, Voloboy A, Wilkie A, Bickel B, Myszkowski K, Weyrich T, Křivánek J. 2021. Neural acceleration of scattering-aware color 3D printing. Computer Graphics Forum. 40(2), 205–219.","short":"T. Rittig, D. Sumin, V. Babaei, P. Didyk, A. Voloboy, A. Wilkie, B. Bickel, K. Myszkowski, T. Weyrich, J. Křivánek, Computer Graphics Forum 40 (2021) 205–219.","mla":"Rittig, Tobias, et al. “Neural Acceleration of Scattering-Aware Color 3D Printing.” <i>Computer Graphics Forum</i>, vol. 40, no. 2, Wiley, 2021, pp. 205–19, doi:<a href=\"https://doi.org/10.1111/cgf.142626\">10.1111/cgf.142626</a>.","chicago":"Rittig, Tobias, Denis Sumin, Vahid Babaei, Piotr Didyk, Alexey Voloboy, Alexander Wilkie, Bernd Bickel, Karol Myszkowski, Tim Weyrich, and Jaroslav Křivánek. “Neural Acceleration of Scattering-Aware Color 3D Printing.” <i>Computer Graphics Forum</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/cgf.142626\">https://doi.org/10.1111/cgf.142626</a>.","ieee":"T. Rittig <i>et al.</i>, “Neural acceleration of scattering-aware color 3D printing,” <i>Computer Graphics Forum</i>, vol. 40, no. 2. Wiley, pp. 205–219, 2021."},"intvolume":"        40","title":"Neural acceleration of scattering-aware color 3D printing","date_published":"2021-05-01T00:00:00Z","date_updated":"2025-03-31T15:58:16Z","file_date_updated":"2021-10-11T12:06:50Z","issue":"2","year":"2021","page":"205-219","volume":40,"publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]}},{"citation":{"mla":"Ivanov, Grigory, and Igor Tsiutsiurupa. “Functional Löwner Ellipsoids.” <i>Journal of Geometric Analysis</i>, vol. 31, Springer, 2021, pp. 11493–528, doi:<a href=\"https://doi.org/10.1007/s12220-021-00691-4\">10.1007/s12220-021-00691-4</a>.","short":"G. Ivanov, I. Tsiutsiurupa, Journal of Geometric Analysis 31 (2021) 11493–11528.","ista":"Ivanov G, Tsiutsiurupa I. 2021. Functional Löwner ellipsoids. Journal of Geometric Analysis. 31, 11493–11528.","ama":"Ivanov G, Tsiutsiurupa I. Functional Löwner ellipsoids. <i>Journal of Geometric Analysis</i>. 2021;31:11493-11528. doi:<a href=\"https://doi.org/10.1007/s12220-021-00691-4\">10.1007/s12220-021-00691-4</a>","apa":"Ivanov, G., &#38; Tsiutsiurupa, I. (2021). Functional Löwner ellipsoids. <i>Journal of Geometric Analysis</i>. Springer. <a href=\"https://doi.org/10.1007/s12220-021-00691-4\">https://doi.org/10.1007/s12220-021-00691-4</a>","ieee":"G. Ivanov and I. Tsiutsiurupa, “Functional Löwner ellipsoids,” <i>Journal of Geometric Analysis</i>, vol. 31. Springer, pp. 11493–11528, 2021.","chicago":"Ivanov, Grigory, and Igor Tsiutsiurupa. “Functional Löwner Ellipsoids.” <i>Journal of Geometric Analysis</i>. Springer, 2021. <a href=\"https://doi.org/10.1007/s12220-021-00691-4\">https://doi.org/10.1007/s12220-021-00691-4</a>."},"intvolume":"        31","title":"Functional Löwner ellipsoids","date_published":"2021-05-31T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2008.09543"}],"status":"public","arxiv":1,"type":"journal_article","month":"05","year":"2021","page":"11493-11528","volume":31,"publication_identifier":{"eissn":["1559-002X"],"issn":["1050-6926"]},"date_updated":"2023-08-08T14:04:49Z","acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-2019-1926.","department":[{"_id":"UlWa"}],"doi":"10.1007/s12220-021-00691-4","fulldoi":"https://doi.org/10.1007/s12220-021-00691-4","scopus_import":"1","abstract":[{"lang":"eng","text":"We extend the notion of the minimal volume ellipsoid containing a convex body in Rd to the setting of logarithmically concave functions. We consider a vast class of logarithmically concave functions whose superlevel sets are concentric ellipsoids. For a fixed function from this class, we consider the set of all its “affine” positions. For any log-concave function f on Rd, we consider functions belonging to this set of “affine” positions, and find the one with the minimal integral under the condition that it is pointwise greater than or equal to f. We study the properties of existence and uniqueness of the solution to this problem. For any s∈[0,+∞), we consider the construction dual to the recently defined John s-function (Ivanov and Naszódi in Functional John ellipsoids. arXiv preprint: arXiv:2006.09934, 2020). We prove that such a construction determines a unique function and call it the Löwner s-function of f. We study the Löwner s-functions as s tends to zero and to infinity. Finally, extending the notion of the outer volume ratio, we define the outer integral ratio of a log-concave function and give an asymptotically tight bound on it."}],"external_id":{"isi":["000656507500001"],"arxiv":["2008.09543"]},"publication_status":"published","article_processing_charge":"No","publisher":"Springer","_id":"9548","oa_version":"Preprint","publication":"Journal of Geometric Analysis","day":"31","language":[{"iso":"eng"}],"author":[{"last_name":"Ivanov","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","full_name":"Ivanov, Grigory","first_name":"Grigory"},{"full_name":"Tsiutsiurupa, Igor","first_name":"Igor","last_name":"Tsiutsiurupa"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_type":"original","isi":1,"date_created":"2021-06-13T22:01:32Z","quality_controlled":"1","oa":1},{"isi":1,"ddc":["570"],"article_type":"original","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Zhang, Danyang","first_name":"Danyang","last_name":"Zhang"},{"full_name":"Watson, Jake","orcid":"0000-0002-8698-3823","first_name":"Jake","last_name":"Watson","id":"63836096-4690-11EA-BD4E-32803DDC885E"},{"first_name":"Peter M.","full_name":"Matthews, Peter M.","last_name":"Matthews"},{"full_name":"Cais, Ondrej","first_name":"Ondrej","last_name":"Cais"},{"full_name":"Greger, Ingo H.","first_name":"Ingo H.","last_name":"Greger"}],"oa":1,"quality_controlled":"1","date_created":"2021-06-13T22:01:33Z","publication":"Nature","_id":"9549","publisher":"Springer Nature","oa_version":"Published Version","article_processing_charge":"No","language":[{"iso":"eng"}],"day":"02","department":[{"_id":"PeJo"}],"acknowledgement":"We thank members of the Greger laboratory, B. Herguedas, J. Krieger and J.-N. Dohrke for comments on the manuscript; J. Krieger and J.-N. Dohrke for discussion, J. Krieger for help with the normal mode analysis, B. Köhegyi for help with cryo-EM imaging, V. Chang and K. Suzuki for helping to generate the CNIH2-1D4-HA stable cell line, M. Carvalho for assistance at early stages of this project, the LMB scientific computing and the cryo-EM facility for support, P. Emsley for help with model building, T. Nakane for helpful comments with RELION 3.1 and R. Warshamanage for helping with EMDA cryo-EM-map processing. We acknowledge the Diamond Light Source for access and support of the Cryo-EM facilities at the UK national electron bio10 imaging centre (eBIC), proposal EM17434, funded by the Wellcome Trust, MRC and BBSRC. This work was supported by grants from the Medical Research Council, as part of United Kingdom Research and Innovation (also known as UK Research and Innovation) (MC_U105174197) and BBSRC (BB/N002113/1) to I.H.G.","publication_status":"published","external_id":{"pmid":["34079129"],"isi":["000657238100003"]},"abstract":[{"text":"AMPA receptors (AMPARs) mediate the majority of excitatory transmission in the brain and enable the synaptic plasticity that underlies learning1. A diverse array of AMPAR signalling complexes are established by receptor auxiliary subunits, which associate with the AMPAR in various combinations to modulate trafficking, gating and synaptic strength2. However, their mechanisms of action are poorly understood. Here we determine cryo-electron microscopy structures of the heteromeric GluA1–GluA2 receptor assembled with both TARP-γ8 and CNIH2, the predominant AMPAR complex in the forebrain, in both resting and active states. Two TARP-γ8 and two CNIH2 subunits insert at distinct sites beneath the ligand-binding domains of the receptor, with site-specific lipids shaping each interaction and affecting the gating regulation of the AMPARs. Activation of the receptor leads to asymmetry between GluA1 and GluA2 along the ion conduction path and an outward expansion of the channel triggers counter-rotations of both auxiliary subunit pairs, promoting the active-state conformation. In addition, both TARP-γ8 and CNIH2 pivot towards the pore exit upon activation, extending their reach for cytoplasmic receptor elements. CNIH2 achieves this through its uniquely extended M2 helix, which has transformed this endoplasmic reticulum-export factor into a powerful AMPAR modulator that is capable of providing hippocampal pyramidal neurons with their integrative synaptic properties. ","lang":"eng"}],"fulldoi":"https://doi.org/10.1038/s41586-021-03613-0","scopus_import":"1","doi":"10.1038/s41586-021-03613-0","month":"06","type":"journal_article","status":"public","main_file_link":[{"url":"https://doi.org/10.1038/s41586-021-03613-0","open_access":"1"}],"date_published":"2021-06-02T00:00:00Z","title":"Gating and modulation of a hetero-octameric AMPA glutamate receptor","intvolume":"       594","citation":{"short":"D. Zhang, J. Watson, P.M. Matthews, O. Cais, I.H. Greger, Nature 594 (2021) 454–458.","mla":"Zhang, Danyang, et al. “Gating and Modulation of a Hetero-Octameric AMPA Glutamate Receptor.” <i>Nature</i>, vol. 594, Springer Nature, 2021, pp. 454–58, doi:<a href=\"https://doi.org/10.1038/s41586-021-03613-0\">10.1038/s41586-021-03613-0</a>.","ama":"Zhang D, Watson J, Matthews PM, Cais O, Greger IH. Gating and modulation of a hetero-octameric AMPA glutamate receptor. <i>Nature</i>. 2021;594:454-458. doi:<a href=\"https://doi.org/10.1038/s41586-021-03613-0\">10.1038/s41586-021-03613-0</a>","ista":"Zhang D, Watson J, Matthews PM, Cais O, Greger IH. 2021. Gating and modulation of a hetero-octameric AMPA glutamate receptor. Nature. 594, 454–458.","apa":"Zhang, D., Watson, J., Matthews, P. M., Cais, O., &#38; Greger, I. H. (2021). Gating and modulation of a hetero-octameric AMPA glutamate receptor. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-021-03613-0\">https://doi.org/10.1038/s41586-021-03613-0</a>","chicago":"Zhang, Danyang, Jake Watson, Peter M. Matthews, Ondrej Cais, and Ingo H. Greger. “Gating and Modulation of a Hetero-Octameric AMPA Glutamate Receptor.” <i>Nature</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41586-021-03613-0\">https://doi.org/10.1038/s41586-021-03613-0</a>.","ieee":"D. Zhang, J. Watson, P. M. Matthews, O. Cais, and I. H. Greger, “Gating and modulation of a hetero-octameric AMPA glutamate receptor,” <i>Nature</i>, vol. 594. Springer Nature, pp. 454–458, 2021."},"date_updated":"2026-06-18T19:54:04Z","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"volume":594,"page":"454-458","year":"2021"},{"language":[{"iso":"eng"}],"day":"27","_id":"9550","oa_version":"Published Version","publisher":"Cambridge University Press","article_processing_charge":"No","publication":"Forum of Mathematics, Sigma","quality_controlled":"1","oa":1,"has_accepted_license":"1","date_created":"2021-06-13T22:01:33Z","article_number":"e44","ddc":["510"],"article_type":"original","isi":1,"file":[{"access_level":"open_access","file_size":483458,"creator":"cziletti","checksum":"47c986578de132200d41e6d391905519","file_name":"2021_ForumMath_Bao.pdf","date_created":"2021-06-15T14:40:45Z","relation":"main_file","date_updated":"2021-06-15T14:40:45Z","content_type":"application/pdf","success":1,"file_id":"9555"}],"author":[{"last_name":"Bao","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","full_name":"Bao, Zhigang","first_name":"Zhigang","orcid":"0000-0003-3036-1475"},{"full_name":"Erdös, László","first_name":"László","orcid":"0000-0001-5366-9603","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","last_name":"Schnelli","first_name":"Kevin","orcid":"0000-0003-0954-3231","full_name":"Schnelli, Kevin"}],"ec_funded":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-07T08:36:39Z","file_date_updated":"2021-06-15T14:40:45Z","year":"2021","publication_identifier":{"eissn":["2050-5094"]},"volume":9,"arxiv":1,"month":"05","type":"journal_article","status":"public","intvolume":"         9","citation":{"chicago":"Bao, Zhigang, László Erdös, and Kevin Schnelli. “Equipartition Principle for Wigner Matrices.” <i>Forum of Mathematics, Sigma</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1017/fms.2021.38\">https://doi.org/10.1017/fms.2021.38</a>.","ieee":"Z. Bao, L. Erdös, and K. Schnelli, “Equipartition principle for Wigner matrices,” <i>Forum of Mathematics, Sigma</i>, vol. 9. Cambridge University Press, 2021.","ama":"Bao Z, Erdös L, Schnelli K. Equipartition principle for Wigner matrices. <i>Forum of Mathematics, Sigma</i>. 2021;9. doi:<a href=\"https://doi.org/10.1017/fms.2021.38\">10.1017/fms.2021.38</a>","ista":"Bao Z, Erdös L, Schnelli K. 2021. Equipartition principle for Wigner matrices. Forum of Mathematics, Sigma. 9, e44.","apa":"Bao, Z., Erdös, L., &#38; Schnelli, K. (2021). Equipartition principle for Wigner matrices. <i>Forum of Mathematics, Sigma</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fms.2021.38\">https://doi.org/10.1017/fms.2021.38</a>","short":"Z. Bao, L. Erdös, K. Schnelli, Forum of Mathematics, Sigma 9 (2021).","mla":"Bao, Zhigang, et al. “Equipartition Principle for Wigner Matrices.” <i>Forum of Mathematics, Sigma</i>, vol. 9, e44, Cambridge University Press, 2021, doi:<a href=\"https://doi.org/10.1017/fms.2021.38\">10.1017/fms.2021.38</a>."},"date_published":"2021-05-27T00:00:00Z","title":"Equipartition principle for Wigner matrices","publication_status":"published","external_id":{"isi":["000654960800001"],"arxiv":["2008.07061"]},"doi":"10.1017/fms.2021.38","abstract":[{"lang":"eng","text":"We prove that the energy of any eigenvector of a sum of several independent large Wigner matrices is equally distributed among these matrices with very high precision. This shows a particularly strong microcanonical form of the equipartition principle for quantum systems whose components are modelled by Wigner matrices. "}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","fulldoi":"https://doi.org/10.1017/fms.2021.38","department":[{"_id":"LaEr"}],"project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"acknowledgement":"The first author is supported in part by Hong Kong RGC Grant GRF 16301519 and NSFC 11871425. The second author is supported in part by ERC Advanced Grant RANMAT 338804. The third author is supported in part by Swedish Research Council Grant VR-2017-05195 and the Knut and Alice Wallenberg Foundation"},{"day":"18","language":[{"iso":"eng"}],"publisher":"Royal Society of Chemistry","_id":"9569","oa_version":"Published Version","article_processing_charge":"No","publication":"RSC Advances","date_created":"2021-06-19T07:27:45Z","quality_controlled":"1","oa":1,"has_accepted_license":"1","author":[{"full_name":"Dar, M. S.","first_name":"M. S.","last_name":"Dar"},{"last_name":"Akram","first_name":"Khush Bakhat","full_name":"Akram, Khush Bakhat"},{"last_name":"Sohail","first_name":"Ayesha","full_name":"Sohail, Ayesha"},{"full_name":"Arif, Fatima","first_name":"Fatima","last_name":"Arif"},{"last_name":"Zabihi","first_name":"Fatemeh","full_name":"Zabihi, Fatemeh"},{"last_name":"Yang","full_name":"Yang, Shengyuan","first_name":"Shengyuan"},{"full_name":"Munir, Shamsa","first_name":"Shamsa","last_name":"Munir"},{"full_name":"Zhu, Meifang","first_name":"Meifang","last_name":"Zhu"},{"first_name":"M.","full_name":"Abid, M.","last_name":"Abid"},{"id":"32c21954-2022-11eb-9d5f-af9f93c24e71","last_name":"Nauman","first_name":"Muhammad","orcid":"0000-0002-2111-4846","full_name":"Nauman, Muhammad"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["540"],"article_type":"original","isi":1,"file":[{"file_size":2114557,"access_level":"open_access","checksum":"cd582d67ace7151078e46b3a896871a9","creator":"asandaue","relation":"main_file","file_name":"2021_RSCAdvances_Dar.pdf","date_created":"2021-06-23T13:09:34Z","file_id":"9596","date_updated":"2021-06-23T13:09:34Z","content_type":"application/pdf","success":1}],"page":"21702-21715","issue":"35","year":"2021","publication_identifier":{"eissn":["2046-2069"]},"volume":11,"date_updated":"2024-10-21T06:02:02Z","file_date_updated":"2021-06-23T13:09:34Z","intvolume":"        11","citation":{"short":"M.S. Dar, K.B. Akram, A. Sohail, F. Arif, F. Zabihi, S. Yang, S. Munir, M. Zhu, M. Abid, M. Nauman, RSC Advances 11 (2021) 21702–21715.","mla":"Dar, M. S., et al. “Heat Induction in Two-Dimensional Graphene–Fe3O4 Nanohybrids for Magnetic Hyperthermia Applications with Artificial Neural Network Modeling.” <i>RSC Advances</i>, vol. 11, no. 35, Royal Society of Chemistry, 2021, pp. 21702–15, doi:<a href=\"https://doi.org/10.1039/d1ra03428f\">10.1039/d1ra03428f</a>.","apa":"Dar, M. S., Akram, K. B., Sohail, A., Arif, F., Zabihi, F., Yang, S., … Nauman, M. (2021). Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia applications with artificial neural network modeling. <i>RSC Advances</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/d1ra03428f\">https://doi.org/10.1039/d1ra03428f</a>","ista":"Dar MS, Akram KB, Sohail A, Arif F, Zabihi F, Yang S, Munir S, Zhu M, Abid M, Nauman M. 2021. Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia applications with artificial neural network modeling. RSC Advances. 11(35), 21702–21715.","ama":"Dar MS, Akram KB, Sohail A, et al. Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia applications with artificial neural network modeling. <i>RSC Advances</i>. 2021;11(35):21702-21715. doi:<a href=\"https://doi.org/10.1039/d1ra03428f\">10.1039/d1ra03428f</a>","chicago":"Dar, M. S., Khush Bakhat Akram, Ayesha Sohail, Fatima Arif, Fatemeh Zabihi, Shengyuan Yang, Shamsa Munir, Meifang Zhu, M. Abid, and Muhammad Nauman. “Heat Induction in Two-Dimensional Graphene–Fe3O4 Nanohybrids for Magnetic Hyperthermia Applications with Artificial Neural Network Modeling.” <i>RSC Advances</i>. Royal Society of Chemistry, 2021. <a href=\"https://doi.org/10.1039/d1ra03428f\">https://doi.org/10.1039/d1ra03428f</a>.","ieee":"M. S. Dar <i>et al.</i>, “Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia applications with artificial neural network modeling,” <i>RSC Advances</i>, vol. 11, no. 35. Royal Society of Chemistry, pp. 21702–21715, 2021."},"date_published":"2021-06-18T00:00:00Z","title":"Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia applications with artificial neural network modeling","month":"06","type":"journal_article","status":"public","doi":"10.1039/d1ra03428f","abstract":[{"text":"We report the synthesis and characterization of graphene functionalized with iron (Fe3+) oxide (G-Fe3O4) nanohybrids for radio-frequency magnetic hyperthermia application. We adopted the wet chemical procedure, using various contents of Fe3O4 (magnetite) from 0–100% for making two-dimensional graphene–Fe3O4 nanohybrids. The homogeneous dispersal of Fe3O4 nanoparticles decorated on the graphene surface combined with their biocompatibility and high thermal conductivity make them an excellent material for magnetic hyperthermia. The morphological and magnetic properties of the nanohybrids were studied using scanning electron microscopy (SEM) and a vibrating sample magnetometer (VSM), respectively. The smart magnetic platforms were exposed to an alternating current (AC) magnetic field of 633 kHz and of strength 9.1 mT for studying their hyperthermic performance. The localized antitumor effects were investigated with artificial neural network modeling. A neural net time-series model was developed for the assessment of the best nanohybrid composition to serve the purpose with an accuracy close to 100%. Six Nonlinear Autoregressive with External Input (NARX) models were obtained, one for each of the components. The assessment of the accuracy of the predicted results has been done on the basis of Mean Squared Error (MSE). The highest Mean Squared Error value was obtained for the nanohybrid containing 45% magnetite and 55% graphene (F45G55) in the training phase i.e., 0.44703, which is where the model achieved optimal results after 71 epochs. The F45G55 nanohybrid was found to be the best for hyperthermia applications in low dosage with the highest specific absorption rate (SAR) and mean squared error values.","lang":"eng"}],"tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"scopus_import":"1","fulldoi":"https://doi.org/10.1039/d1ra03428f","publication_status":"published","external_id":{"isi":["000665644000048"]},"acknowledgement":"The research is funded by Higher Education Commission (HEC) Pakistan under start-up research grant program (SRGP) Project no. 2454.","department":[{"_id":"KiMo"}]},{"department":[{"_id":"AnHi"}],"acknowledgement":"We acknowledge insightful discussions with K. Flensberg, E. B. Hansen, T. Karzig, R. Lutchyn, D. Pikulin, E. Prada, and R. Aguado. This work was supported by Microsoft Project Q and the Danmarks Grundforskningsfond. C.M.M. acknowledges support from the Villum Fonden. A.P.H. and L.C. contributed equally to this work.","publication_status":"published","external_id":{"arxiv":["2006.01275"],"isi":["000661512500002"]},"abstract":[{"lang":"eng","text":"We present conductance-matrix measurements in long, three-terminal hybrid superconductor-semiconductor nanowires, and compare with theoretical predictions of a magnetic-field-driven, topological quantum phase transition. By examining the nonlocal conductance, we identify the closure of the excitation gap in the bulk of the semiconductor before the emergence of zero-bias peaks, ruling out spurious gap-closure signatures from localized states. We observe that after the gap closes, nonlocal signals and zero-bias peaks fluctuate strongly at both ends, inconsistent with a simple picture of clean topological superconductivity."}],"scopus_import":"1","fulldoi":"https://doi.org/10.1103/PhysRevB.103.235201","doi":"10.1103/PhysRevB.103.235201","month":"06","arxiv":1,"type":"journal_article","status":"public","date_published":"2021-06-15T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.01275"}],"title":"Closing of the induced gap in a hybrid superconductor-semiconductor nanowire","intvolume":"       103","citation":{"ama":"Puglia D, Martinez EA, Ménard GC, et al. Closing of the induced gap in a hybrid superconductor-semiconductor nanowire. <i>Physical Review B</i>. 2021;103(23). doi:<a href=\"https://doi.org/10.1103/PhysRevB.103.235201\">10.1103/PhysRevB.103.235201</a>","apa":"Puglia, D., Martinez, E. A., Ménard, G. C., Pöschl, A., Gronin, S., Gardner, G. C., … Casparis, L. (2021). Closing of the induced gap in a hybrid superconductor-semiconductor nanowire. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.103.235201\">https://doi.org/10.1103/PhysRevB.103.235201</a>","ista":"Puglia D, Martinez EA, Ménard GC, Pöschl A, Gronin S, Gardner GC, Kallaher R, Manfra MJ, Marcus CM, Higginbotham AP, Casparis L. 2021. Closing of the induced gap in a hybrid superconductor-semiconductor nanowire. Physical Review B. 103(23), 235201.","short":"D. Puglia, E.A. Martinez, G.C. Ménard, A. Pöschl, S. Gronin, G.C. Gardner, R. Kallaher, M.J. Manfra, C.M. Marcus, A.P. Higginbotham, L. Casparis, Physical Review B 103 (2021).","mla":"Puglia, Denise, et al. “Closing of the Induced Gap in a Hybrid Superconductor-Semiconductor Nanowire.” <i>Physical Review B</i>, vol. 103, no. 23, 235201, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevB.103.235201\">10.1103/PhysRevB.103.235201</a>.","chicago":"Puglia, Denise, E. A. Martinez, G. C. Ménard, A. Pöschl, S. Gronin, G. C. Gardner, R. Kallaher, et al. “Closing of the Induced Gap in a Hybrid Superconductor-Semiconductor Nanowire.” <i>Physical Review B</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevB.103.235201\">https://doi.org/10.1103/PhysRevB.103.235201</a>.","ieee":"D. Puglia <i>et al.</i>, “Closing of the induced gap in a hybrid superconductor-semiconductor nanowire,” <i>Physical Review B</i>, vol. 103, no. 23. American Physical Society, 2021."},"date_updated":"2025-07-10T12:01:53Z","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"volume":103,"issue":"23","year":"2021","isi":1,"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0003-1144-2763","first_name":"Denise","full_name":"Puglia, Denise","id":"4D495994-AE37-11E9-AC72-31CAE5697425","last_name":"Puglia"},{"last_name":"Martinez","first_name":"E. A.","full_name":"Martinez, E. A."},{"first_name":"G. C.","full_name":"Ménard, G. C.","last_name":"Ménard"},{"last_name":"Pöschl","first_name":"A.","full_name":"Pöschl, A."},{"last_name":"Gronin","first_name":"S.","full_name":"Gronin, S."},{"full_name":"Gardner, G. C.","first_name":"G. C.","last_name":"Gardner"},{"first_name":"R.","full_name":"Kallaher, R.","last_name":"Kallaher"},{"first_name":"M. J.","full_name":"Manfra, M. J.","last_name":"Manfra"},{"last_name":"Marcus","first_name":"C. M.","full_name":"Marcus, C. M."},{"last_name":"Higginbotham","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","full_name":"Higginbotham, Andrew P","first_name":"Andrew P","orcid":"0000-0003-2607-2363"},{"full_name":"Casparis, L.","first_name":"L.","last_name":"Casparis"}],"oa":1,"quality_controlled":"1","article_number":"235201","date_created":"2021-06-20T22:01:33Z","publication":"Physical Review B","_id":"9570","oa_version":"Preprint","publisher":"American Physical Society","article_processing_charge":"No","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"13080","status":"public","relation":"research_data"}]},"day":"15"},{"type":"journal_article","arxiv":1,"month":"04","status":"public","intvolume":"        22","citation":{"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.” <i>Journal of Machine Learning Research</i>. Journal of Machine Learning Research, 2021.","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,” <i>Journal of Machine Learning Research</i>, vol. 22, no. 114. Journal of Machine Learning Research, p. 1−43, 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.” <i>Journal of Machine Learning Research</i>, vol. 22, no. 114, Journal of Machine Learning Research, 2021, p. 1−43.","apa":"Ramezani-Kebrya, A., Faghri, F., Markov, I., Aksenov, V., Alistarh, D.-A., &#38; Roy, D. M. (2021). NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. <i>Journal of Machine Learning Research</i>. Journal of Machine Learning Research.","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. <i>Journal of Machine Learning Research</i>. 2021;22(114):1−43."},"main_file_link":[{"open_access":"1","url":"https://www.jmlr.org/papers/v22/20-255.html"}],"date_published":"2021-04-01T00:00:00Z","title":"NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization","date_updated":"2025-07-10T12:01:54Z","file_date_updated":"2021-06-23T07:09:41Z","page":"1−43","issue":"114","year":"2021","publication_identifier":{"issn":["1532-4435"],"eissn":["1533-7928"]},"volume":22,"department":[{"_id":"DaAl"}],"publication_status":"published","external_id":{"arxiv":["1908.06077"]},"abstract":[{"lang":"eng","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."}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","corr_author":"1","publisher":"Journal of Machine Learning Research","_id":"9571","oa_version":"Published Version","article_processing_charge":"No","publication":"Journal of Machine Learning Research","language":[{"iso":"eng"}],"day":"01","ddc":["000"],"article_type":"original","file":[{"file_name":"2021_JournalOfMachineLearningResearch_Ramezani-Kebrya.pdf","date_created":"2021-06-23T07:09:41Z","relation":"main_file","content_type":"application/pdf","date_updated":"2021-06-23T07:09:41Z","success":1,"file_id":"9595","access_level":"open_access","file_size":11237154,"creator":"asandaue","checksum":"6428aa8bcb67768b6949c99b55d5281d"}],"author":[{"full_name":"Ramezani-Kebrya, Ali","first_name":"Ali","last_name":"Ramezani-Kebrya"},{"last_name":"Faghri","full_name":"Faghri, Fartash","first_name":"Fartash"},{"last_name":"Markov","first_name":"Ilya","full_name":"Markov, Ilya"},{"first_name":"Vitalii","full_name":"Aksenov, Vitalii","id":"2980135A-F248-11E8-B48F-1D18A9856A87","last_name":"Aksenov"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Roy","first_name":"Daniel M.","full_name":"Roy, Daniel M."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","oa":1,"has_accepted_license":"1","date_created":"2021-06-20T22:01:33Z"},{"external_id":{"arxiv":["2106.11247"]},"publication_status":"published","tmp":{"short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"abstract":[{"text":"The convex grabbing game is a game where two players, Alice and Bob, alternate taking extremal points from the convex hull of a point set on the plane. Rational weights are given to the points. The goal of each player is to maximize the total weight over all points that they obtain. We restrict the setting to the case of binary weights. We show a construction of an arbitrarily large odd-sized point set that allows Bob to obtain almost 3/4 of the total weight. This construction answers a question asked by Matsumoto, Nakamigawa, and Sakuma in [Graphs and Combinatorics, 36/1 (2020)]. We also present an arbitrarily large even-sized point set where Bob can obtain the entirety of the total weight. Finally, we discuss conjectures about optimum moves in the convex grabbing game for both players in general.","lang":"eng"}],"department":[{"_id":"GradSch"},{"_id":"VlKo"}],"file_date_updated":"2021-08-12T10:57:21Z","date_updated":"2025-05-14T11:23:45Z","keyword":["convex grabbing game","graph grabbing game","combinatorial game","convex geometry"],"year":"2021","status":"public","month":"06","arxiv":1,"type":"conference","title":"Massively winning configurations in the convex grabbing game on the plane","date_published":"2021-06-29T00:00:00Z","citation":{"mla":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>, Canadian Conference on Computational Geometry, 2021.","short":"M. Dvorak, S. Nicholson, in:, Proceedings of the 33rd Canadian Conference on Computational Geometry, Canadian Conference on Computational Geometry, 2021.","ista":"Dvorak M, Nicholson S. 2021. Massively winning configurations in the convex grabbing game on the plane. Proceedings of the 33rd Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry.","apa":"Dvorak, M., &#38; Nicholson, S. (2021). Massively winning configurations in the convex grabbing game on the plane. In <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Halifax, NS, Canada; Virtual: Canadian Conference on Computational Geometry.","ama":"Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing game on the plane. In: <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Canadian Conference on Computational Geometry; 2021.","ieee":"M. Dvorak and S. Nicholson, “Massively winning configurations in the convex grabbing game on the plane,” in <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>, Halifax, NS, Canada; Virtual, 2021.","chicago":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” In <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Canadian Conference on Computational Geometry, 2021."},"has_accepted_license":"1","oa":1,"quality_controlled":"1","date_created":"2021-06-22T15:57:11Z","file":[{"file_size":381306,"access_level":"open_access","checksum":"45accb1de9b7e0e4bb2fbfe5fd3e6239","creator":"mdvorak","relation":"main_file","date_created":"2021-06-28T20:23:13Z","file_name":"Convex-Grabbing-Game_CCCG_proc_version.pdf","file_id":"9616","success":1,"date_updated":"2021-06-28T20:23:13Z","content_type":"application/pdf"},{"date_created":"2021-08-12T10:57:21Z","file_name":"Convex-Grabbing-Game_FULL-VERSION.pdf","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2021-08-12T10:57:21Z","file_id":"9902","access_level":"open_access","file_size":403645,"creator":"kschuh","checksum":"9199cf18c65658553487458cc24d0ab2"}],"ddc":["516"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Martin","orcid":"0000-0001-5293-214X","full_name":"Dvorak, Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","last_name":"Dvorak"},{"last_name":"Nicholson","full_name":"Nicholson, Sara","first_name":"Sara"}],"language":[{"iso":"eng"}],"day":"29","conference":{"location":"Halifax, NS, Canada; Virtual","start_date":"2021-08-10","end_date":"2021-08-12","name":"CCCG: Canadian Conference on Computational Geometry"},"publication":"Proceedings of the 33rd Canadian Conference on Computational Geometry","article_processing_charge":"No","publisher":"Canadian Conference on Computational Geometry","_id":"9592","oa_version":"Published Version"},{"file_date_updated":"2021-06-28T08:04:22Z","date_updated":"2026-04-02T13:55:23Z","volume":12,"publication_identifier":{"eissn":["2041-1723"]},"year":"2021","issue":"1","status":"public","type":"journal_article","month":"07","title":"Genomic imprinting in mouse blastocysts is predominantly associated with H3K27me3","date_published":"2021-07-12T00:00:00Z","citation":{"short":"L. Santini, F. Halbritter, F. Titz-Teixeira, T. Suzuki, M. Asami, X. Ma, J. Ramesmayer, A. Lackner, N. Warr, F. Pauler, S. Hippenmeyer, E. Laue, M. Farlik, C. Bock, A. Beyer, A.C.F. Perry, M. Leeb, Nature Communications 12 (2021).","mla":"Santini, Laura, et al. “Genomic Imprinting in Mouse Blastocysts Is Predominantly Associated with H3K27me3.” <i>Nature Communications</i>, vol. 12, no. 1, 3804, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-23510-4\">10.1038/s41467-021-23510-4</a>.","ama":"Santini L, Halbritter F, Titz-Teixeira F, et al. Genomic imprinting in mouse blastocysts is predominantly associated with H3K27me3. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-23510-4\">10.1038/s41467-021-23510-4</a>","ista":"Santini L, Halbritter F, Titz-Teixeira F, Suzuki T, Asami M, Ma X, Ramesmayer J, Lackner A, Warr N, Pauler F, Hippenmeyer S, Laue E, Farlik M, Bock C, Beyer A, Perry ACF, Leeb M. 2021. Genomic imprinting in mouse blastocysts is predominantly associated with H3K27me3. Nature Communications. 12(1), 3804.","apa":"Santini, L., Halbritter, F., Titz-Teixeira, F., Suzuki, T., Asami, M., Ma, X., … Leeb, M. (2021). Genomic imprinting in mouse blastocysts is predominantly associated with H3K27me3. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-23510-4\">https://doi.org/10.1038/s41467-021-23510-4</a>","chicago":"Santini, Laura, Florian Halbritter, Fabian Titz-Teixeira, Toru Suzuki, Maki Asami, Xiaoyan Ma, Julia Ramesmayer, et al. “Genomic Imprinting in Mouse Blastocysts Is Predominantly Associated with H3K27me3.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-23510-4\">https://doi.org/10.1038/s41467-021-23510-4</a>.","ieee":"L. Santini <i>et al.</i>, “Genomic imprinting in mouse blastocysts is predominantly associated with H3K27me3,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021."},"intvolume":"        12","external_id":{"isi":["000667248600005"]},"publication_status":"published","scopus_import":"1","fulldoi":"https://doi.org/10.1038/s41467-021-23510-4","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"abstract":[{"lang":"eng","text":"In mammalian genomes, differentially methylated regions (DMRs) and histone marks including trimethylation of histone 3 lysine 27 (H3K27me3) at imprinted genes are asymmetrically inherited to control parentally-biased gene expression. However, neither parent-of-origin-specific transcription nor imprints have been comprehensively mapped at the blastocyst stage of preimplantation development. Here, we address this by integrating transcriptomic and epigenomic approaches in mouse preimplantation embryos. We find that seventy-one genes exhibit previously unreported parent-of-origin-specific expression in blastocysts (nBiX: novel blastocyst-imprinted expressed). Uniparental expression of nBiX genes disappears soon after implantation. Micro-whole-genome bisulfite sequencing (µWGBS) of individual uniparental blastocysts detects 859 DMRs. We further find that 16% of nBiX genes are associated with a DMR, whereas most are associated with parentally-biased H3K27me3, suggesting a role for Polycomb-mediated imprinting in blastocysts. nBiX genes are clustered: five clusters contained at least one published imprinted gene, and five clusters exclusively contained nBiX genes. These data suggest that early development undergoes a complex program of stage-specific imprinting involving different tiers of regulation."}],"doi":"10.1038/s41467-021-23510-4","department":[{"_id":"SiHi"}],"acknowledgement":"The authors thank Robert Feil and Anton Wutz for helpful discussions and comments, Samuel Collombet and Peter Fraser for sharing embryo TAD coordinates, and Andy Riddel at the Cambridge Stem Cell Institute and Thomas Sauer at the Max Perutz Laboratories FACS facility for flow-sorting. We thank the team of the Biomedical Sequencing Facility at the CeMM and the Vienna Biocenter Core Facilities (VBCF) for support with next-generation sequencing. We are grateful to animal care teams at the University of Bath and MRC Harwell. A.C.F.P. acknowledges support from the UK Medical Research Council (MR/N000080/1 and MR/N020294/1) and Biotechnology and Biological Sciences Research Council (BB/P009506/1). L.S. is part of the FWF doctoral programme SMICH and supported by an Austrian Academy of Sciences DOC Fellowship. M.L. is funded by a Vienna Research Group for Young Investigators grant (VRG14-006) by the Vienna Science and Technology Fund (WWTF) and by the Austrian Science Fund FWF (I3786 and P31334).","language":[{"iso":"eng"}],"day":"12","publication":"Nature Communications","article_processing_charge":"No","_id":"9601","oa_version":"Published Version","publisher":"Springer Nature","has_accepted_license":"1","oa":1,"quality_controlled":"1","article_number":"3804","date_created":"2021-06-27T22:01:46Z","file":[{"success":1,"content_type":"application/pdf","date_updated":"2021-06-28T08:04:22Z","file_id":"9608","date_created":"2021-06-28T08:04:22Z","file_name":"2021_NatureCommunications_Santini.pdf","relation":"main_file","creator":"asandaue","checksum":"75dd89d09945185b2d14b2434a0bcb50","access_level":"open_access","file_size":2156554}],"isi":1,"article_type":"original","ddc":["570"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"full_name":"Santini, Laura","first_name":"Laura","last_name":"Santini"},{"first_name":"Florian","full_name":"Halbritter, Florian","last_name":"Halbritter"},{"full_name":"Titz-Teixeira, Fabian","first_name":"Fabian","last_name":"Titz-Teixeira"},{"full_name":"Suzuki, Toru","first_name":"Toru","last_name":"Suzuki"},{"first_name":"Maki","full_name":"Asami, Maki","last_name":"Asami"},{"full_name":"Ma, Xiaoyan","first_name":"Xiaoyan","last_name":"Ma"},{"last_name":"Ramesmayer","first_name":"Julia","full_name":"Ramesmayer, Julia"},{"first_name":"Andreas","full_name":"Lackner, Andreas","last_name":"Lackner"},{"last_name":"Warr","first_name":"Nick","full_name":"Warr, Nick"},{"full_name":"Pauler, Florian","first_name":"Florian","orcid":"0000-0002-7462-0048","last_name":"Pauler","id":"48EA0138-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","first_name":"Simon"},{"last_name":"Laue","first_name":"Ernest","full_name":"Laue, Ernest"},{"full_name":"Farlik, Matthias","first_name":"Matthias","last_name":"Farlik"},{"last_name":"Bock","full_name":"Bock, Christoph","first_name":"Christoph"},{"first_name":"Andreas","full_name":"Beyer, Andreas","last_name":"Beyer"},{"last_name":"Perry","first_name":"Anthony C.F.","full_name":"Perry, Anthony C.F."},{"full_name":"Leeb, Martin","first_name":"Martin","last_name":"Leeb"}]},{"quality_controlled":"1","oa":1,"has_accepted_license":"1","date_created":"2021-06-27T22:01:47Z","ddc":["510"],"article_type":"original","isi":1,"file":[{"file_id":"9612","success":1,"content_type":"application/pdf","date_updated":"2021-06-28T13:33:23Z","relation":"main_file","date_created":"2021-06-28T13:33:23Z","file_name":"2021_JournalOfCombinatorialTheory_Pach.pdf","checksum":"15fbc9064cd9d1c777ac0043b78c8f12","creator":"asandaue","file_size":418168,"access_level":"open_access"}],"author":[{"last_name":"Pach","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János","first_name":"János"},{"first_name":"István","full_name":"Tomon, István","last_name":"Tomon"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"day":"09","corr_author":"1","publisher":"Elsevier","_id":"9602","oa_version":"Published Version","article_processing_charge":"No","publication":"Journal of Combinatorial Theory. Series B","publication_status":"published","external_id":{"isi":["000702280800002"]},"doi":"10.1016/j.jctb.2021.05.004","abstract":[{"text":"An ordered graph is a graph with a linear ordering on its vertex set. We prove that for every positive integer k, there exists a constant ck > 0 such that any ordered graph G on n vertices with the property that neither G nor its complement contains an induced monotone path of size k, has either a clique or an independent set of size at least n^ck . This strengthens a result of Bousquet, Lagoutte, and Thomassé, who proved the analogous result for unordered graphs.\r\nA key idea of the above paper was to show that any unordered graph on n vertices that does not contain an induced path of size k, and whose maximum degree is at most c(k)n for some small c(k) > 0, contains two disjoint linear size subsets with no edge between them. This approach fails for ordered graphs, because the analogous statement is false for k ≥ 3, by a construction of Fox. We provide some further examples showing that this statement also fails for ordered graphs avoiding other ordered trees.","lang":"eng"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","fulldoi":"https://doi.org/10.1016/j.jctb.2021.05.004","department":[{"_id":"HeEd"}],"acknowledgement":"We would like to thank the anonymous referees for their useful comments and suggestions. János Pach is partially supported by Austrian Science Fund (FWF) grant Z 342-N31 and by ERC Advanced grant “GeoScape.” István Tomon is partially supported by Swiss National Science Foundation grant no. 200021_196965, and thanks the support of MIPT Moscow. Both authors are partially supported by The Russian Government in the framework of MegaGrant no. 075-15-2019-1926.","project":[{"name":"Mathematics, Computer Science","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342"}],"date_updated":"2025-04-15T07:16:52Z","file_date_updated":"2021-06-28T13:33:23Z","page":"21-37","year":"2021","publication_identifier":{"issn":["0095-8956"]},"volume":151,"type":"journal_article","month":"06","status":"public","intvolume":"       151","citation":{"chicago":"Pach, János, and István Tomon. “Erdős-Hajnal-Type Results for Monotone Paths.” <i>Journal of Combinatorial Theory. Series B</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jctb.2021.05.004\">https://doi.org/10.1016/j.jctb.2021.05.004</a>.","ieee":"J. Pach and I. Tomon, “Erdős-Hajnal-type results for monotone paths,” <i>Journal of Combinatorial Theory. Series B</i>, vol. 151. Elsevier, pp. 21–37, 2021.","ista":"Pach J, Tomon I. 2021. Erdős-Hajnal-type results for monotone paths. Journal of Combinatorial Theory. Series B. 151, 21–37.","apa":"Pach, J., &#38; Tomon, I. (2021). Erdős-Hajnal-type results for monotone paths. <i>Journal of Combinatorial Theory. Series B</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jctb.2021.05.004\">https://doi.org/10.1016/j.jctb.2021.05.004</a>","ama":"Pach J, Tomon I. Erdős-Hajnal-type results for monotone paths. <i>Journal of Combinatorial Theory Series B</i>. 2021;151:21-37. doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.05.004\">10.1016/j.jctb.2021.05.004</a>","short":"J. Pach, I. Tomon, Journal of Combinatorial Theory. Series B 151 (2021) 21–37.","mla":"Pach, János, and István Tomon. “Erdős-Hajnal-Type Results for Monotone Paths.” <i>Journal of Combinatorial Theory. Series B</i>, vol. 151, Elsevier, 2021, pp. 21–37, doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.05.004\">10.1016/j.jctb.2021.05.004</a>."},"date_published":"2021-06-09T00:00:00Z","title":"Erdős-Hajnal-type results for monotone paths"},{"publication_status":"published","external_id":{"isi":["000664463600016"],"pmid":["34161767"]},"abstract":[{"lang":"eng","text":"Mosaic analysis with double markers (MADM) offers one approach to visualize and concomitantly manipulate genetically defined cells in mice with single-cell resolution. MADM applications include the analysis of lineage, single-cell morphology and physiology, genomic imprinting phenotypes, and dissection of cell-autonomous gene functions in vivo in health and disease. Yet, MADM can only be applied to <25% of all mouse genes on select chromosomes to date. To overcome this limitation, we generate transgenic mice with knocked-in MADM cassettes near the centromeres of all 19 autosomes and validate their use across organs. With this resource, >96% of the entire mouse genome can now be subjected to single-cell genetic mosaic analysis. Beyond a proof of principle, we apply our MADM library to systematically trace sister chromatid segregation in distinct mitotic cell lineages. We find striking chromosome-specific biases in segregation patterns, reflecting a putative mechanism for the asymmetric segregation of genetic determinants in somatic stem cell division."}],"tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"scopus_import":"1","fulldoi":"https://doi.org/10.1016/j.celrep.2021.109274","doi":"10.1016/j.celrep.2021.109274","department":[{"_id":"SiHi"},{"_id":"LoSw"},{"_id":"PreCl"}],"acknowledgement":"We thank the Bioimaging, Life Science, and Pre-Clinical Facilities at IST Austria; M.P. Postiglione, C. Simbriger, K. Valoskova, C. Schwayer, T. Hussain, M. Pieber, and V. Wimmer for initial experiments, technical support, and/or assistance; R. Shigemoto for sharing iv (Dnah11 mutant) mice; and M. Sixt and all members of the Hippenmeyer lab for discussion. This work was supported by National Institutes of Health grants ( R01-NS050580 to L.L. and F32MH096361 to L.A.S.). L.L. is an investigator of HHMI. N.A. received support from FWF Firnberg-Programm ( T 1031 ). A.H.H. is a recipient of a DOC Fellowship (24812) of the Austrian Academy of Sciences . This work also received support from IST Austria institutional funds , FWF SFB F78 to S.H., the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme ( FP7/2007-2013 ) under REA grant agreement no 618444 to S.H., and the European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Programme (grant agreement no. 725780 LinPro ) to S.H.","project":[{"name":"Molecular mechanisms of radial neuronal migration","_id":"2625A13E-B435-11E9-9278-68D0E5697425","grant_number":"24812"},{"name":"Molecular Mechanisms of Cerebral Cortex Development","grant_number":"618444","call_identifier":"FP7","_id":"25D61E48-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"260018B0-B435-11E9-9278-68D0E5697425","grant_number":"725780","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"file_date_updated":"2021-06-28T14:06:24Z","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"}],"date_updated":"2026-04-02T14:04:28Z","publication_identifier":{"eissn":["2211-1247"]},"volume":35,"issue":"12","year":"2021","month":"06","type":"journal_article","status":"public","date_published":"2021-06-22T00:00:00Z","title":"A genome-wide library of MADM mice for single-cell genetic mosaic analysis","intvolume":"        35","citation":{"chicago":"Contreras, Ximena, Nicole Amberg, Amarbayasgalan Davaatseren, Andi H Hansen, Johanna Sonntag, Lill Andersen, Tina Bernthaler, et al. “A Genome-Wide Library of MADM Mice for Single-Cell Genetic Mosaic Analysis.” <i>Cell Reports</i>. Cell Press, 2021. <a href=\"https://doi.org/10.1016/j.celrep.2021.109274\">https://doi.org/10.1016/j.celrep.2021.109274</a>.","ieee":"X. Contreras <i>et al.</i>, “A genome-wide library of MADM mice for single-cell genetic mosaic analysis,” <i>Cell Reports</i>, vol. 35, no. 12. Cell Press, 2021.","short":"X. Contreras, N. Amberg, A. Davaatseren, A.H. Hansen, J. Sonntag, L. Andersen, T. Bernthaler, C. Streicher, A.-M. Heger, R.L. Johnson, L.A. Schwarz, L. Luo, T. Rülicke, S. Hippenmeyer, Cell Reports 35 (2021).","mla":"Contreras, Ximena, et al. “A Genome-Wide Library of MADM Mice for Single-Cell Genetic Mosaic Analysis.” <i>Cell Reports</i>, vol. 35, no. 12, 109274, Cell Press, 2021, doi:<a href=\"https://doi.org/10.1016/j.celrep.2021.109274\">10.1016/j.celrep.2021.109274</a>.","ista":"Contreras X, Amberg N, Davaatseren A, Hansen AH, Sonntag J, Andersen L, Bernthaler T, Streicher C, Heger A-M, Johnson RL, Schwarz LA, Luo L, Rülicke T, Hippenmeyer S. 2021. A genome-wide library of MADM mice for single-cell genetic mosaic analysis. Cell Reports. 35(12), 109274.","ama":"Contreras X, Amberg N, Davaatseren A, et al. A genome-wide library of MADM mice for single-cell genetic mosaic analysis. <i>Cell Reports</i>. 2021;35(12). doi:<a href=\"https://doi.org/10.1016/j.celrep.2021.109274\">10.1016/j.celrep.2021.109274</a>","apa":"Contreras, X., Amberg, N., Davaatseren, A., Hansen, A. H., Sonntag, J., Andersen, L., … Hippenmeyer, S. (2021). A genome-wide library of MADM mice for single-cell genetic mosaic analysis. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2021.109274\">https://doi.org/10.1016/j.celrep.2021.109274</a>"},"oa":1,"has_accepted_license":"1","quality_controlled":"1","article_number":"109274","date_created":"2021-06-27T22:01:48Z","isi":1,"file":[{"date_created":"2021-06-28T14:06:24Z","file_name":"2021_CellReports_Contreras.pdf","relation":"main_file","success":1,"date_updated":"2021-06-28T14:06:24Z","content_type":"application/pdf","file_id":"9613","access_level":"open_access","file_size":7653149,"creator":"asandaue","checksum":"d49520fdcbbb5c2f883bddb67cee5d77"}],"ddc":["570"],"article_type":"original","pmid":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"first_name":"Ximena","full_name":"Contreras, Ximena","id":"475990FE-F248-11E8-B48F-1D18A9856A87","last_name":"Contreras"},{"last_name":"Amberg","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","full_name":"Amberg, Nicole","first_name":"Nicole","orcid":"0000-0002-3183-8207"},{"last_name":"Davaatseren","id":"70ADC922-B424-11E9-99E3-BA18E6697425","full_name":"Davaatseren, Amarbayasgalan","first_name":"Amarbayasgalan"},{"full_name":"Hansen, Andi H","first_name":"Andi H","last_name":"Hansen","id":"38853E16-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Johanna","full_name":"Sonntag, Johanna","id":"32FE7D7C-F248-11E8-B48F-1D18A9856A87","last_name":"Sonntag"},{"first_name":"Lill","full_name":"Andersen, Lill","last_name":"Andersen"},{"full_name":"Bernthaler, Tina","first_name":"Tina","last_name":"Bernthaler"},{"first_name":"Carmen","full_name":"Streicher, Carmen","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87","last_name":"Streicher"},{"full_name":"Heger, Anna-Magdalena","first_name":"Anna-Magdalena","last_name":"Heger","id":"4B76FFD2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Randy L.","full_name":"Johnson, Randy L.","last_name":"Johnson"},{"full_name":"Schwarz, Lindsay A.","first_name":"Lindsay A.","last_name":"Schwarz"},{"last_name":"Luo","full_name":"Luo, Liqun","first_name":"Liqun"},{"last_name":"Rülicke","first_name":"Thomas","full_name":"Rülicke, Thomas"},{"full_name":"Hippenmeyer, Simon","first_name":"Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"language":[{"iso":"eng"}],"related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/boost-for-mouse-genetic-analysis/","description":"News on IST Homepage"}]},"day":"22","publication":"Cell Reports","_id":"9603","publisher":"Cell Press","oa_version":"Published Version","article_processing_charge":"No"},{"project":[{"grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"Mathematics, Computer Science"},{"grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","name":"Persistent Homology, Algorithms and Stochastic Geometry"}],"department":[{"_id":"HeEd"}],"scopus_import":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2021.16","abstract":[{"text":"Generalizing Lee’s inductive argument for counting the cells of higher order Voronoi tessellations in ℝ² to ℝ³, we get precise relations in terms of Morse theoretic quantities for piecewise constant functions on planar arrangements. Specifically, we prove that for a generic set of n ≥ 5 points in ℝ³, the number of regions in the order-k Voronoi tessellation is N_{k-1} - binom(k,2)n + n, for 1 ≤ k ≤ n-1, in which N_{k-1} is the sum of Euler characteristics of these function’s first k-1 sublevel sets. We get similar expressions for the vertices, edges, and polygons of the order-k Voronoi tessellation.","lang":"eng"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPIcs.SoCG.2021.16","publication_status":"published","title":"Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory","date_published":"2021-06-02T00:00:00Z","citation":{"ieee":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory,” in <i>Leibniz International Proceedings in Informatics</i>, Online, 2021, vol. 189.","chicago":"Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian. “Counting Cells of Order-k Voronoi Tessellations in ℝ<sup>3</sup> with Morse Theory.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.16\">https://doi.org/10.4230/LIPIcs.SoCG.2021.16</a>.","mla":"Biswas, Ranita, et al. “Counting Cells of Order-k Voronoi Tessellations in ℝ<sup>3</sup> with Morse Theory.” <i>Leibniz International Proceedings in Informatics</i>, vol. 189, 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.16\">10.4230/LIPIcs.SoCG.2021.16</a>.","short":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ista":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2021. Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 16.","apa":"Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., &#38; Saghafian, M. (2021). Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.16\">https://doi.org/10.4230/LIPIcs.SoCG.2021.16</a>","ama":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.16\">10.4230/LIPIcs.SoCG.2021.16</a>"},"intvolume":"       189","status":"public","month":"06","type":"conference","volume":189,"publication_identifier":{"isbn":["9783959771849"],"issn":["1868-8969"]},"year":"2021","file_date_updated":"2021-06-28T13:11:39Z","date_updated":"2025-07-10T12:01:56Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"author":[{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","orcid":"0000-0002-5372-7890","first_name":"Ranita","full_name":"Biswas, Ranita"},{"full_name":"Cultrera di Montesano, Sebastiano","orcid":"0000-0001-6249-0832","first_name":"Sebastiano","last_name":"Cultrera di Montesano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"last_name":"Saghafian","full_name":"Saghafian, Morteza","first_name":"Morteza"}],"file":[{"file_name":"2021_LIPIcs_Biswas.pdf","date_created":"2021-06-28T13:11:39Z","relation":"main_file","date_updated":"2021-06-28T13:11:39Z","content_type":"application/pdf","success":1,"file_id":"9611","access_level":"open_access","file_size":727817,"creator":"asandaue","checksum":"22b11a719018b22ecba2471b51f2eb40"}],"ddc":["516"],"article_number":"16","date_created":"2021-06-27T22:01:48Z","has_accepted_license":"1","oa":1,"quality_controlled":"1","conference":{"location":"Online","end_date":"2021-06-11","start_date":"2021-06-07","name":"SoCG: International Symposium on Computational Geometry"},"publication":"Leibniz International Proceedings in Informatics","alternative_title":["LIPIcs"],"article_processing_charge":"No","_id":"9604","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","day":"02","language":[{"iso":"eng"}]},{"external_id":{"arxiv":["2103.07823"]},"publication_status":"published","doi":"10.4230/LIPIcs.SoCG.2021.27","fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2021.27","scopus_import":"1","abstract":[{"lang":"eng","text":"Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. "}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"HeEd"}],"acknowledgement":"The authors want to thank the reviewers for many helpful comments and suggestions.","date_updated":"2025-07-10T12:01:57Z","file_date_updated":"2021-06-28T12:40:47Z","year":"2021","volume":189,"publication_identifier":{"isbn":["9783959771849"],"issn":["1868-8969"]},"status":"public","arxiv":1,"month":"06","type":"conference","citation":{"chicago":"Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing the Multicover Bifiltration.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">https://doi.org/10.4230/LIPIcs.SoCG.2021.27</a>.","ieee":"R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” in <i>Leibniz International Proceedings in Informatics</i>, Online, 2021, vol. 189.","ista":"Corbet R, Kerber M, Lesnick M, Osang GF. 2021. Computing the multicover bifiltration. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 27.","ama":"Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">10.4230/LIPIcs.SoCG.2021.27</a>","apa":"Corbet, R., Kerber, M., Lesnick, M., &#38; Osang, G. F. (2021). Computing the multicover bifiltration. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">https://doi.org/10.4230/LIPIcs.SoCG.2021.27</a>","short":"R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","mla":"Corbet, René, et al. “Computing the Multicover Bifiltration.” <i>Leibniz International Proceedings in Informatics</i>, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">10.4230/LIPIcs.SoCG.2021.27</a>."},"intvolume":"       189","title":"Computing the multicover bifiltration","date_published":"2021-06-02T00:00:00Z","quality_controlled":"1","has_accepted_license":"1","oa":1,"date_created":"2021-06-27T22:01:49Z","article_number":"27","ddc":["516"],"file":[{"checksum":"0de217501e7ba8b267d58deed0d51761","creator":"cziletti","file_size":"1367983","access_level":"open_access","file_id":"9610","success":1,"content_type":"application/pdf","date_updated":"2021-06-28T12:40:47Z","relation":"main_file","date_created":"2021-06-28T12:40:47Z","file_name":"2021_LIPIcs_Corbet.pdf"}],"author":[{"first_name":"René","full_name":"Corbet, René","last_name":"Corbet"},{"first_name":"Michael","full_name":"Kerber, Michael","last_name":"Kerber"},{"full_name":"Lesnick, Michael","first_name":"Michael","last_name":"Lesnick"},{"last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","first_name":"Georg F","orcid":"0000-0002-8882-5116"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"url":"https://arxiv.org/abs/2103.07823","relation":"extended_version"}],"record":[{"id":"12709","status":"public","relation":"later_version"}]},"language":[{"iso":"eng"}],"day":"02","article_processing_charge":"No","_id":"9605","oa_version":"Published Version","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","conference":{"location":"Online","start_date":"2021-06-07","end_date":"2021-06-11","name":"SoCG: International Symposium on Computational Geometry"},"alternative_title":["LIPIcs"],"publication":"Leibniz International Proceedings in Informatics"},{"title":"Propagation of first and second sound in a two-dimensional Fermi superfluid","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.06491"}],"date_published":"2021-06-01T00:00:00Z","citation":{"short":"A. Tononi, A. Cappellaro, G. Bighin, L. Salasnich, Physical Review A 103 (2021).","mla":"Tononi, A., et al. “Propagation of First and Second Sound in a Two-Dimensional Fermi Superfluid.” <i>Physical Review A</i>, vol. 103, no. 6, L061303, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevA.103.L061303\">10.1103/PhysRevA.103.L061303</a>.","apa":"Tononi, A., Cappellaro, A., Bighin, G., &#38; Salasnich, L. (2021). Propagation of first and second sound in a two-dimensional Fermi superfluid. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.103.L061303\">https://doi.org/10.1103/PhysRevA.103.L061303</a>","ama":"Tononi A, Cappellaro A, Bighin G, Salasnich L. Propagation of first and second sound in a two-dimensional Fermi superfluid. <i>Physical Review A</i>. 2021;103(6). doi:<a href=\"https://doi.org/10.1103/PhysRevA.103.L061303\">10.1103/PhysRevA.103.L061303</a>","ista":"Tononi A, Cappellaro A, Bighin G, Salasnich L. 2021. Propagation of first and second sound in a two-dimensional Fermi superfluid. Physical Review A. 103(6), L061303.","chicago":"Tononi, A., Alberto Cappellaro, Giacomo Bighin, and L. Salasnich. “Propagation of First and Second Sound in a Two-Dimensional Fermi Superfluid.” <i>Physical Review A</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevA.103.L061303\">https://doi.org/10.1103/PhysRevA.103.L061303</a>.","ieee":"A. Tononi, A. Cappellaro, G. Bighin, and L. Salasnich, “Propagation of first and second sound in a two-dimensional Fermi superfluid,” <i>Physical Review A</i>, vol. 103, no. 6. American Physical Society, 2021."},"intvolume":"       103","status":"public","arxiv":1,"type":"journal_article","month":"06","volume":103,"publication_identifier":{"issn":["2469-9926"],"eissn":["2469-9934"]},"issue":"6","year":"2021","date_updated":"2025-07-10T12:01:58Z","acknowledgement":"G.B. acknowledges support from the Austrian Science Fund (FWF), under Project No. M2641-N27. This work was\r\npartially supported by the University of Padua, BIRD project “Superfluid properties of Fermi gases in optical potentials.”\r\nThe authors thank Miki Ota, Tomoki Ozawa, Sandro Stringari, Tilman Enss, Hauke Biss, Henning Moritz, and Nicolò Defenu for fruitful discussions. The authors thank Henning Moritz and Markus Bohlen for providing their experimental\r\ndata.","department":[{"_id":"MiLe"}],"scopus_import":"1","fulldoi":"https://doi.org/10.1103/PhysRevA.103.L061303","abstract":[{"lang":"eng","text":"Sound propagation is a macroscopic manifestation of the interplay between the equilibrium thermodynamics and the dynamical transport properties of fluids. Here, for a two-dimensional system of ultracold fermions, we calculate the first and second sound velocities across the whole BCS-BEC crossover, and we analyze the system response to an external perturbation. In the low-temperature regime we reproduce the recent measurements [Phys. Rev. Lett. 124, 240403 (2020)] of the first sound velocity, which, due to the decoupling of density and entropy fluctuations, is the sole mode excited by a density probe. Conversely, a heat perturbation excites only the second sound, which, being sensitive to the superfluid depletion, vanishes in the deep BCS regime and jumps discontinuously to zero at the Berezinskii-Kosterlitz-Thouless superfluid transition. A mixing between the modes occurs only in the finite-temperature BEC regime, where our theory converges to the purely bosonic results."}],"doi":"10.1103/PhysRevA.103.L061303","external_id":{"isi":["000662296700014"],"arxiv":["2009.06491"]},"publication_status":"published","publication":"Physical Review A","article_processing_charge":"No","_id":"9606","publisher":"American Physical Society","oa_version":"Preprint","day":"01","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"A.","full_name":"Tononi, A.","last_name":"Tononi"},{"full_name":"Cappellaro, Alberto","orcid":"0000-0001-6110-2359","first_name":"Alberto","last_name":"Cappellaro","id":"9d13b3cb-30a2-11eb-80dc-f772505e8660"},{"orcid":"0000-0001-8823-9777","first_name":"Giacomo","full_name":"Bighin, Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","last_name":"Bighin"},{"full_name":"Salasnich, L.","first_name":"L.","last_name":"Salasnich"}],"isi":1,"article_type":"letter_note","article_number":"L061303","date_created":"2021-06-27T22:01:49Z","oa":1,"quality_controlled":"1"},{"publication":"Science","article_processing_charge":"No","oa_version":"Preprint","_id":"9618","publisher":"AAAS","language":[{"iso":"eng"}],"day":"26","file":[{"access_level":"open_access","file_size":3671159,"creator":"patrickd","checksum":"0b356fd10ab9bb95177d4c047d4e9c1a","file_name":"scars_subharmonic_combined_manuscript_2_11_2021 (2)-1.pdf","date_created":"2021-09-23T14:00:05Z","relation":"main_file","date_updated":"2021-09-23T14:00:05Z","content_type":"application/pdf","success":1,"file_id":"10040"}],"isi":1,"article_type":"original","ddc":["539"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","pmid":1,"ec_funded":1,"author":[{"full_name":"Bluvstein, D.","first_name":"D.","last_name":"Bluvstein"},{"first_name":"A.","full_name":"Omran, A.","last_name":"Omran"},{"last_name":"Levine","full_name":"Levine, H.","first_name":"H."},{"first_name":"A.","full_name":"Keesling, A.","last_name":"Keesling"},{"first_name":"G.","full_name":"Semeghini, G.","last_name":"Semeghini"},{"last_name":"Ebadi","first_name":"S.","full_name":"Ebadi, S."},{"first_name":"T. T.","full_name":"Wang, T. T.","last_name":"Wang"},{"full_name":"Michailidis, Alexios","first_name":"Alexios","orcid":"0000-0002-8443-1064","last_name":"Michailidis","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Maskara","first_name":"N.","full_name":"Maskara, N."},{"last_name":"Ho","full_name":"Ho, W. W.","first_name":"W. W."},{"full_name":"Choi, S.","first_name":"S.","last_name":"Choi"},{"last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","full_name":"Serbyn, Maksym","orcid":"0000-0002-2399-5827","first_name":"Maksym"},{"full_name":"Greiner, M.","first_name":"M.","last_name":"Greiner"},{"last_name":"Vuletić","full_name":"Vuletić, V.","first_name":"V."},{"last_name":"Lukin","full_name":"Lukin, M. D.","first_name":"M. D."}],"has_accepted_license":"1","oa":1,"quality_controlled":"1","date_created":"2021-06-29T12:04:05Z","status":"public","type":"journal_article","month":"03","arxiv":1,"title":"Controlling quantum many-body dynamics in driven Rydberg atom arrays","date_published":"2021-03-26T00:00:00Z","citation":{"mla":"Bluvstein, D., et al. “Controlling Quantum Many-Body Dynamics in Driven Rydberg Atom Arrays.” <i>Science</i>, vol. 371, no. 6536, AAAS, 2021, pp. 1355–59, doi:<a href=\"https://doi.org/10.1126/science.abg2530\">10.1126/science.abg2530</a>.","short":"D. Bluvstein, A. Omran, H. Levine, A. Keesling, G. Semeghini, S. Ebadi, T.T. Wang, A. Michailidis, N. Maskara, W.W. Ho, S. Choi, M. Serbyn, M. Greiner, V. Vuletić, M.D. Lukin, Science 371 (2021) 1355–1359.","ama":"Bluvstein D, Omran A, Levine H, et al. Controlling quantum many-body dynamics in driven Rydberg atom arrays. <i>Science</i>. 2021;371(6536):1355-1359. doi:<a href=\"https://doi.org/10.1126/science.abg2530\">10.1126/science.abg2530</a>","apa":"Bluvstein, D., Omran, A., Levine, H., Keesling, A., Semeghini, G., Ebadi, S., … Lukin, M. D. (2021). Controlling quantum many-body dynamics in driven Rydberg atom arrays. <i>Science</i>. AAAS. <a href=\"https://doi.org/10.1126/science.abg2530\">https://doi.org/10.1126/science.abg2530</a>","ista":"Bluvstein D, Omran A, Levine H, Keesling A, Semeghini G, Ebadi S, Wang TT, Michailidis A, Maskara N, Ho WW, Choi S, Serbyn M, Greiner M, Vuletić V, Lukin MD. 2021. Controlling quantum many-body dynamics in driven Rydberg atom arrays. Science. 371(6536), 1355–1359.","ieee":"D. Bluvstein <i>et al.</i>, “Controlling quantum many-body dynamics in driven Rydberg atom arrays,” <i>Science</i>, vol. 371, no. 6536. AAAS, pp. 1355–1359, 2021.","chicago":"Bluvstein, D., A. Omran, H. Levine, A. Keesling, G. Semeghini, S. Ebadi, T. T. Wang, et al. “Controlling Quantum Many-Body Dynamics in Driven Rydberg Atom Arrays.” <i>Science</i>. AAAS, 2021. <a href=\"https://doi.org/10.1126/science.abg2530\">https://doi.org/10.1126/science.abg2530</a>."},"intvolume":"       371","file_date_updated":"2021-09-23T14:00:05Z","date_updated":"2025-04-14T07:52:05Z","volume":371,"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"issue":"6536","year":"2021","keyword":["Multidisciplinary"],"page":"1355-1359","department":[{"_id":"MaSe"}],"project":[{"_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","grant_number":"850899","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control"}],"acknowledgement":"We thank many members of the Harvard AMO community, particularly E. Urbach, S. Dakoulas, and J. Doyle for their efforts enabling safe and productive operation of our laboratories during 2020. We thank D. Abanin, I. Cong, F. Machado, H. Pichler, N. Yao, B. Ye, and H. Zhou for stimulating discussions. Funding: We acknowledge financial support from the Center for Ultracold Atoms, the National Science Foundation, the Vannevar Bush Faculty Fellowship, the U.S. Department of Energy (LBNL QSA Center and grant no. DE-SC0021013), the Office of Naval Research, the Army Research Office MURI, the DARPA DRINQS program (grant no. D18AC00033), and the DARPA ONISQ program (grant no. W911NF2010021). The authors acknowledge support from the NSF Graduate Research Fellowship Program (grant DGE1745303) and The Fannie and John Hertz Foundation (D.B.); a National Defense Science and Engineering Graduate (NDSEG) fellowship (H.L.); a fellowship from the Max Planck/Harvard Research Center for Quantum Optics (G.S.); Gordon College (T.T.W.); the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement no. 850899) (A.A.M. and M.S.); a Department of Energy Computational Science Graduate Fellowship under award number DE-SC0021110 (N.M.); the Moore Foundation’s EPiQS Initiative grant no. GBMF4306, the NUS Development grant AY2019/2020, and the Stanford Institute of Theoretical Physics (W.W.H.); and the Miller Institute for Basic Research in Science (S.C.). Author contributions: D.B., A.O., H.L., A.K., G.S., S.E., and T.T.W. contributed to the building of the experimental setup, performed the measurements, and analyzed the data. A.A.M., N.M., W.W.H., S.C., and M.S. performed theoretical analysis. All work was supervised by M.G., V.V., and M.D.L. All authors discussed the results and contributed to the manuscript. Competing interests: M.G., V.V., and M.D.L. are co-founders and shareholders of QuEra Computing. A.O. is a shareholder of QuEra Computing. Data and materials availability: All data needed to evaluate the conclusions in the paper are present in the paper and the supplementary materials.","external_id":{"arxiv":["2012.12276"],"isi":["000636043400048"],"pmid":["33632894"]},"publication_status":"published","scopus_import":"1","fulldoi":"https://doi.org/10.1126/science.abg2530","abstract":[{"text":"The control of nonequilibrium quantum dynamics in many-body systems is challenging because interactions typically lead to thermalization and a chaotic spreading throughout Hilbert space. We investigate nonequilibrium dynamics after rapid quenches in a many-body system composed of 3 to 200 strongly interacting qubits in one and two spatial dimensions. Using a programmable quantum simulator based on Rydberg atom arrays, we show that coherent revivals associated with so-called quantum many-body scars can be stabilized by periodic driving, which generates a robust subharmonic response akin to discrete time-crystalline order. We map Hilbert space dynamics, geometry dependence, phase diagrams, and system-size dependence of this emergent phenomenon, demonstrating new ways to steer complex dynamics in many-body systems and enabling potential applications in quantum information science.","lang":"eng"}],"doi":"10.1126/science.abg2530"},{"has_accepted_license":"1","oa":1,"quality_controlled":"1","date_created":"2021-07-01T11:04:43Z","file":[{"relation":"main_file","date_created":"2021-07-01T11:21:40Z","file_name":"Population_Coupon_Collector.pdf","file_id":"9621","date_updated":"2021-07-01T11:21:40Z","content_type":"application/pdf","file_size":319728,"access_level":"open_access","checksum":"fe37fb9af3f5016c1084af9d6e7109bd","creator":"pdavies"}],"isi":1,"ddc":["000"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ec_funded":1,"author":[{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"},{"id":"11396234-BB50-11E9-B24C-90FCE5697425","last_name":"Davies","first_name":"Peter","orcid":"0000-0002-5646-9524","full_name":"Davies, Peter"}],"language":[{"iso":"eng"}],"day":"20","alternative_title":["LNCS"],"conference":{"name":"SIROCCO: International Colloquium on Structural Information and Communication Complexity","end_date":"2021-07-01","start_date":"2021-06-28","location":"Wrocław, Poland"},"publication":"Structural Information and Communication Complexity","article_processing_charge":"No","_id":"9620","oa_version":"Preprint","publisher":"Springer Nature","external_id":{"isi":["001292788400001"]},"publication_status":"published","scopus_import":"1","fulldoi":"https://doi.org/10.1007/978-3-030-79527-6_1","abstract":[{"lang":"eng","text":"In this note, we introduce a distributed twist on the classic coupon collector problem: a set of m collectors wish to each obtain a set of n coupons; for this, they can each sample coupons uniformly at random, but can also meet in pairwise interactions, during which they can exchange coupons. By doing so, they hope to reduce the number of coupons that must be sampled by each collector in order to obtain a full set. This extension is natural when considering real-world manifestations of the coupon collector phenomenon, and has been remarked upon and studied empirically (Hayes and Hannigan 2006, Ahmad et al. 2014, Delmarcelle 2019).\r\n\r\nWe provide the first theoretical analysis for such a scenario. We find that “coupon collecting with friends” can indeed significantly reduce the number of coupons each collector must sample, and raises interesting connections to the more traditional variants of the problem. While our analysis is in most cases asymptotically tight, there are several open questions raised, regarding finer-grained analysis of both “coupon collecting with friends,” and of a long-studied variant of the original problem in which a collector requires multiple full sets of coupons."}],"doi":"10.1007/978-3-030-79527-6_1","department":[{"_id":"DaAl"}],"acknowledgement":"Peter Davies is supported by the European Union’s Horizon2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411.","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"file_date_updated":"2021-07-01T11:21:40Z","date_updated":"2025-09-10T10:04:46Z","volume":12810,"publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783030795276"],"issn":["0302-9743"],"isbn":["9783030795269"]},"year":"2021","page":"3-12","status":"public","month":"06","type":"conference","title":"Collecting coupons is faster with friends","date_published":"2021-06-20T00:00:00Z","citation":{"mla":"Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” <i>Structural Information and Communication Complexity</i>, vol. 12810, Springer Nature, 2021, pp. 3–12, doi:<a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">10.1007/978-3-030-79527-6_1</a>.","short":"D.-A. Alistarh, P. Davies, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 3–12.","ista":"Alistarh D-A, Davies P. 2021. Collecting coupons is faster with friends. Structural Information and Communication Complexity. SIROCCO: International Colloquium on Structural Information and Communication Complexity, LNCS, vol. 12810, 3–12.","ama":"Alistarh D-A, Davies P. Collecting coupons is faster with friends. In: <i>Structural Information and Communication Complexity</i>. Vol 12810. Springer Nature; 2021:3-12. doi:<a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">10.1007/978-3-030-79527-6_1</a>","apa":"Alistarh, D.-A., &#38; Davies, P. (2021). Collecting coupons is faster with friends. In <i>Structural Information and Communication Complexity</i> (Vol. 12810, pp. 3–12). Wrocław, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">https://doi.org/10.1007/978-3-030-79527-6_1</a>","ieee":"D.-A. Alistarh and P. Davies, “Collecting coupons is faster with friends,” in <i>Structural Information and Communication Complexity</i>, Wrocław, Poland, 2021, vol. 12810, pp. 3–12.","chicago":"Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” In <i>Structural Information and Communication Complexity</i>, 12810:3–12. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">https://doi.org/10.1007/978-3-030-79527-6_1</a>."},"intvolume":"     12810"},{"acknowledgement":"This work was supported by National Natural Science Foundation of China (51772012), National Key Research and Development Program of China (2018YFA0702100 and 2018YFB0703600), the Beijing Natural Science Foundation (JQ18004). This work was also supported by Lise Meitner Project (M2889-N) and the National Postdoctoral Program for Innovative Talents (BX20200028). L.D.Z. appreciates the support of the High Performance Computing (HPC) resources at Beihang University, the National Science Fund for Distinguished Young Scholars (51925101), and center for High Pressure Science and Technology Advanced Research (HPSTAR) for SEM measurements.","department":[{"_id":"MaIb"}],"doi":"10.1016/j.mtphys.2021.100452","fulldoi":"https://doi.org/10.1016/j.mtphys.2021.100452","scopus_import":"1","abstract":[{"text":"SnSe, a wide-bandgap semiconductor, has attracted significant attention from the thermoelectric (TE) community due to its outstanding TE performance deriving from the ultralow thermal conductivity and advantageous electronic structures. Here, we promoted the TE performance of n-type SnSe polycrystals through bandgap engineering and vacancy compensation. We found that PbTe can significantly reduce the wide bandgap of SnSe to reduce the impurity transition energy, largely enhancing the carrier concentration. Also, PbTe-induced crystal symmetry promotion increases the carrier mobility, preserving large Seebeck coefficient. Consequently, a maximum ZT of ∼1.4 at 793 K is obtained in Br doped SnSe–13%PbTe. Furthermore, we found that extra Sn in n-type SnSe can compensate for the intrinsic Sn vacancies and form electron donor-like metallic Sn nanophases. The Sn nanophases near the grain boundary could also reduce the intergrain energy barrier which largely enhances the carrier mobility. As a result, a maximum ZT value of ∼1.7 at 793 K and an average ZT (ZTave) of ∼0.58 in 300–793 K are achieved in Br doped Sn1.08Se–13%PbTe. Our findings provide a novel strategy to promote the TE performance in wide-bandgap semiconductors.","lang":"eng"}],"external_id":{"isi":["000703159600010"]},"publication_status":"published","citation":{"ieee":"L. Su <i>et al.</i>, “Realizing high doping efficiency and thermoelectric performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation,” <i>Materials Today Physics</i>, vol. 20. Elsevier, 2021.","chicago":"Su, Lizhong, Tao Hong, Dongyang Wang, Sining Wang, Bingchao Qin, Mengmeng Zhang, Xiang Gao, Cheng Chang, and Li Dong Zhao. “Realizing High Doping Efficiency and Thermoelectric Performance in N-Type SnSe Polycrystals via Bandgap Engineering and Vacancy Compensation.” <i>Materials Today Physics</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.mtphys.2021.100452\">https://doi.org/10.1016/j.mtphys.2021.100452</a>.","ama":"Su L, Hong T, Wang D, et al. Realizing high doping efficiency and thermoelectric performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation. <i>Materials Today Physics</i>. 2021;20. doi:<a href=\"https://doi.org/10.1016/j.mtphys.2021.100452\">10.1016/j.mtphys.2021.100452</a>","apa":"Su, L., Hong, T., Wang, D., Wang, S., Qin, B., Zhang, M., … Zhao, L. D. (2021). Realizing high doping efficiency and thermoelectric performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation. <i>Materials Today Physics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.mtphys.2021.100452\">https://doi.org/10.1016/j.mtphys.2021.100452</a>","ista":"Su L, Hong T, Wang D, Wang S, Qin B, Zhang M, Gao X, Chang C, Zhao LD. 2021. Realizing high doping efficiency and thermoelectric performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation. Materials Today Physics. 20, 100452.","mla":"Su, Lizhong, et al. “Realizing High Doping Efficiency and Thermoelectric Performance in N-Type SnSe Polycrystals via Bandgap Engineering and Vacancy Compensation.” <i>Materials Today Physics</i>, vol. 20, 100452, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.mtphys.2021.100452\">10.1016/j.mtphys.2021.100452</a>.","short":"L. Su, T. Hong, D. Wang, S. Wang, B. Qin, M. Zhang, X. Gao, C. Chang, L.D. Zhao, Materials Today Physics 20 (2021)."},"intvolume":"        20","title":"Realizing high doping efficiency and thermoelectric performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation","date_published":"2021-06-03T00:00:00Z","status":"public","month":"06","type":"journal_article","year":"2021","volume":20,"publication_identifier":{"eissn":["2542-5293"]},"date_updated":"2024-10-09T21:00:40Z","author":[{"last_name":"Su","first_name":"Lizhong","full_name":"Su, Lizhong"},{"last_name":"Hong","first_name":"Tao","full_name":"Hong, Tao"},{"first_name":"Dongyang","full_name":"Wang, Dongyang","last_name":"Wang"},{"last_name":"Wang","first_name":"Sining","full_name":"Wang, Sining"},{"last_name":"Qin","first_name":"Bingchao","full_name":"Qin, Bingchao"},{"full_name":"Zhang, Mengmeng","first_name":"Mengmeng","last_name":"Zhang"},{"last_name":"Gao","full_name":"Gao, Xiang","first_name":"Xiang"},{"id":"9E331C2E-9F27-11E9-AE48-5033E6697425","last_name":"Chang","first_name":"Cheng","orcid":"0000-0002-9515-4277","full_name":"Chang, Cheng"},{"last_name":"Zhao","full_name":"Zhao, Li Dong","first_name":"Li Dong"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_type":"original","isi":1,"date_created":"2021-07-04T22:01:24Z","article_number":"100452","quality_controlled":"1","article_processing_charge":"No","_id":"9626","oa_version":"None","publisher":"Elsevier","publication":"Materials Today Physics","corr_author":"1","day":"03","language":[{"iso":"eng"}]},{"date_updated":"2026-06-18T19:54:27Z","volume":64,"publication_identifier":{"issn":["0013-0915"],"eissn":["1464-3839"]},"issue":"3","year":"2021","page":"443-447","status":"public","month":"08","arxiv":1,"type":"journal_article","title":"Self-adjoint extensions of bipartite Hamiltonians","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1017/S0013091521000080"}],"date_published":"2021-08-01T00:00:00Z","citation":{"ista":"Lenz D, Weinmann T, Wirth M. 2021. Self-adjoint extensions of bipartite Hamiltonians. Proceedings of the Edinburgh Mathematical Society. 64(3), 443–447.","ama":"Lenz D, Weinmann T, Wirth M. Self-adjoint extensions of bipartite Hamiltonians. <i>Proceedings of the Edinburgh Mathematical Society</i>. 2021;64(3):443-447. doi:<a href=\"https://doi.org/10.1017/S0013091521000080\">10.1017/S0013091521000080</a>","apa":"Lenz, D., Weinmann, T., &#38; Wirth, M. (2021). Self-adjoint extensions of bipartite Hamiltonians. <i>Proceedings of the Edinburgh Mathematical Society</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0013091521000080\">https://doi.org/10.1017/S0013091521000080</a>","short":"D. Lenz, T. Weinmann, M. Wirth, Proceedings of the Edinburgh Mathematical Society 64 (2021) 443–447.","mla":"Lenz, Daniel, et al. “Self-Adjoint Extensions of Bipartite Hamiltonians.” <i>Proceedings of the Edinburgh Mathematical Society</i>, vol. 64, no. 3, Cambridge University Press, 2021, pp. 443–47, doi:<a href=\"https://doi.org/10.1017/S0013091521000080\">10.1017/S0013091521000080</a>.","chicago":"Lenz, Daniel, Timon Weinmann, and Melchior Wirth. “Self-Adjoint Extensions of Bipartite Hamiltonians.” <i>Proceedings of the Edinburgh Mathematical Society</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1017/S0013091521000080\">https://doi.org/10.1017/S0013091521000080</a>.","ieee":"D. Lenz, T. Weinmann, and M. Wirth, “Self-adjoint extensions of bipartite Hamiltonians,” <i>Proceedings of the Edinburgh Mathematical Society</i>, vol. 64, no. 3. Cambridge University Press, pp. 443–447, 2021."},"intvolume":"        64","external_id":{"isi":["000721363700003"],"arxiv":["1912.03670"]},"publication_status":"published","fulldoi":"https://doi.org/10.1017/S0013091521000080","scopus_import":"1","abstract":[{"lang":"eng","text":"We compute the deficiency spaces of operators of the form 𝐻𝐴⊗̂ 𝐼+𝐼⊗̂ 𝐻𝐵, for symmetric 𝐻𝐴 and self-adjoint 𝐻𝐵. This enables us to construct self-adjoint extensions (if they exist) by means of von Neumann's theory. The structure of the deficiency spaces for this case was asserted already in Ibort et al. [Boundary dynamics driven entanglement, J. Phys. A: Math. Theor. 47(38) (2014) 385301], but only proven under the restriction of 𝐻𝐵 having discrete, non-degenerate spectrum."}],"doi":"10.1017/S0013091521000080","department":[{"_id":"JaMa"}],"acknowledgement":"M. W. gratefully acknowledges financial support by the German Academic Scholarship Foundation (Studienstiftung des deutschen Volkes). T.W. thanks PAO Gazprom Neft, the Euler International Mathematical Institute in Saint Petersburg and ORISA GmbH for their financial support in the form of scholarships during his Master's and Bachelor's studies respectively. The authors want to thank Mark Malamud for pointing out the reference [1] to them. This work was supported by the Ministry of Science and Higher Education of the Russian Federation, agreement No 075-15-2019-1619.","language":[{"iso":"eng"}],"day":"01","corr_author":"1","publication":"Proceedings of the Edinburgh Mathematical Society","article_processing_charge":"No","_id":"9627","publisher":"Cambridge University Press","oa_version":"Published Version","oa":1,"quality_controlled":"1","date_created":"2021-07-04T22:01:24Z","isi":1,"article_type":"original","ddc":["500"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Lenz","full_name":"Lenz, Daniel","first_name":"Daniel"},{"full_name":"Weinmann, Timon","first_name":"Timon","last_name":"Weinmann"},{"orcid":"0000-0002-0519-4241","first_name":"Melchior","full_name":"Wirth, Melchior","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","last_name":"Wirth"}]}]