[{"type":"journal_article","abstract":[{"lang":"eng","text":"Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we mean that given an individual simplex we can recover the entire triangulation of Euclidean space by inductively reflecting in the faces of the simplex. In this paper we establish that the quality of the simplices in all Coxeter triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate the Delaunay property for these triangulations. Moreover, we consider an extension of the Delaunay property, namely protection, which is a measure of non-degeneracy of a Delaunay triangulation. In particular, one family of Coxeter triangulations achieves the protection O(1/d2). We conjecture that both bounds are optimal for triangulations in Euclidean space."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7567","title":"Coxeter triangulations have good quality","ddc":["510"],"status":"public","intvolume":" 14","file":[{"file_size":872275,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2020_MathCompScie_Choudhary.pdf","checksum":"1d145f3ab50ccee735983cb89236e609","success":1,"date_updated":"2020-11-20T10:18:02Z","date_created":"2020-11-20T10:18:02Z","relation":"main_file","file_id":"8783"}],"oa_version":"Published Version","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","publication":"Mathematics in Computer Science","citation":{"ieee":"A. Choudhary, S. Kachanovich, and M. Wintraecken, “Coxeter triangulations have good quality,” Mathematics in Computer Science, vol. 14. Springer Nature, pp. 141–176, 2020.","apa":"Choudhary, A., Kachanovich, S., & Wintraecken, M. (2020). Coxeter triangulations have good quality. Mathematics in Computer Science. Springer Nature. https://doi.org/10.1007/s11786-020-00461-5","ista":"Choudhary A, Kachanovich S, Wintraecken M. 2020. Coxeter triangulations have good quality. Mathematics in Computer Science. 14, 141–176.","ama":"Choudhary A, Kachanovich S, Wintraecken M. Coxeter triangulations have good quality. Mathematics in Computer Science. 2020;14:141-176. doi:10.1007/s11786-020-00461-5","chicago":"Choudhary, Aruni, Siargey Kachanovich, and Mathijs Wintraecken. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science. Springer Nature, 2020. https://doi.org/10.1007/s11786-020-00461-5.","short":"A. Choudhary, S. Kachanovich, M. Wintraecken, Mathematics in Computer Science 14 (2020) 141–176.","mla":"Choudhary, Aruni, et al. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science, vol. 14, Springer Nature, 2020, pp. 141–76, doi:10.1007/s11786-020-00461-5."},"article_type":"original","page":"141-176","date_published":"2020-03-01T00:00:00Z","file_date_updated":"2020-11-20T10:18:02Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","year":"2020","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"author":[{"first_name":"Aruni","last_name":"Choudhary","full_name":"Choudhary, Aruni"},{"last_name":"Kachanovich","first_name":"Siargey","full_name":"Kachanovich, Siargey"},{"full_name":"Wintraecken, Mathijs","first_name":"Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220"}],"date_updated":"2021-01-12T08:14:13Z","date_created":"2020-03-05T13:30:18Z","volume":14,"month":"03","publication_identifier":{"issn":["1661-8270"],"eissn":["1661-8289"]},"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/s11786-020-00461-5","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevResearch.2.013353","quality_controlled":"1","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"03","date_created":"2020-03-20T15:21:10Z","date_updated":"2021-01-12T08:14:23Z","volume":2,"author":[{"first_name":"Dorota","last_name":"Gotfryd","full_name":"Gotfryd, Dorota"},{"full_name":"Paerschke, Ekaterina","id":"8275014E-6063-11E9-9B7F-6338E6697425","orcid":"0000-0003-0853-8182","first_name":"Ekaterina","last_name":"Paerschke"},{"first_name":"Jiri","last_name":"Chaloupka","full_name":"Chaloupka, Jiri"},{"full_name":"Oles, Andrzej M.","first_name":"Andrzej M.","last_name":"Oles"},{"full_name":"Wohlfeld, Krzysztof","first_name":"Krzysztof","last_name":"Wohlfeld"}],"publication_status":"published","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","year":"2020","file_date_updated":"2020-07-14T12:48:00Z","ec_funded":1,"article_number":"013353","date_published":"2020-03-20T00:00:00Z","article_type":"original","publication":"Physical Review Research","citation":{"ista":"Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. 2020. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. 2(1), 013353.","apa":"Gotfryd, D., Paerschke, E., Chaloupka, J., Oles, A. M., & Wohlfeld, K. (2020). How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.2.013353","ieee":"D. Gotfryd, E. Paerschke, J. Chaloupka, A. M. Oles, and K. Wohlfeld, “How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator,” Physical Review Research, vol. 2, no. 1. American Physical Society, 2020.","ama":"Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. 2020;2(1). doi:10.1103/PhysRevResearch.2.013353","chicago":"Gotfryd, Dorota, Ekaterina Paerschke, Jiri Chaloupka, Andrzej M. Oles, and Krzysztof Wohlfeld. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/PhysRevResearch.2.013353.","mla":"Gotfryd, Dorota, et al. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” Physical Review Research, vol. 2, no. 1, 013353, American Physical Society, 2020, doi:10.1103/PhysRevResearch.2.013353.","short":"D. Gotfryd, E. Paerschke, J. Chaloupka, A.M. Oles, K. Wohlfeld, Physical Review Research 2 (2020)."},"day":"20","article_processing_charge":"No","has_accepted_license":"1","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2020_PhysRevResearch_Gotfryd.pdf","file_size":1436735,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"7610","checksum":"1be551fd5f5583635076017d7391ffdc","date_updated":"2020-07-14T12:48:00Z","date_created":"2020-03-23T10:18:38Z"}],"ddc":["530"],"title":"How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator","status":"public","intvolume":" 2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7594","abstract":[{"lang":"eng","text":"The concept of the entanglement between spin and orbital degrees of freedom plays a crucial role in our understanding of various phases and exotic ground states in a broad class of materials, including orbitally ordered materials and spin liquids. We investigate how the spin-orbital entanglement in a Mott insulator depends on the value of the spin-orbit coupling of the relativistic origin. To this end, we numerically diagonalize a one-dimensional spin-orbital model with Kugel-Khomskii exchange interactions between spins and orbitals on different sites supplemented by the on-site spin-orbit coupling. In the regime of small spin-orbit coupling with regard to the spin-orbital exchange, the ground state to a large extent resembles the one obtained in the limit of vanishing spin-orbit coupling. On the other hand, for large spin-orbit coupling the ground state can, depending on the model parameters, either still show negligible spin-orbital entanglement or evolve to a highly spin-orbitally-entangled phase with completely distinct properties that are described by an effective XXZ model. The presented results suggest that (i) the spin-orbital entanglement may be induced by large on-site spin-orbit coupling, as found in the 5d transition metal oxides, such as the iridates; (ii) for Mott insulators with weak spin-orbit coupling of Ising type, such as, e.g., the alkali hyperoxides, the effects of the spin-orbit coupling on the ground state can, in the first order of perturbation theory, be neglected."}],"issue":"1","type":"journal_article"},{"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","citation":{"chicago":"Alistarh, Dan-Adrian, Alexander Fedorov, and Nikita Koval. “In Search of the Fastest Concurrent Union-Find Algorithm.” In 23rd International Conference on Principles of Distributed Systems, 153:15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15.","mla":"Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.” 23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi:10.4230/LIPIcs.OPODIS.2019.15.","short":"D.-A. Alistarh, A. Fedorov, N. Koval, in:, 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16.","ista":"Alistarh D-A, Fedorov A, Koval N. 2020. In search of the fastest concurrent union-find algorithm. 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 15:1-15:16.","ieee":"D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent union-find algorithm,” in 23rd International Conference on Principles of Distributed Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15:1-15:16.","apa":"Alistarh, D.-A., Fedorov, A., & Koval, N. (2020). In search of the fastest concurrent union-find algorithm. In 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15","ama":"Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find algorithm. In: 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:15:1-15:16. doi:10.4230/LIPIcs.OPODIS.2019.15"},"publication":"23rd International Conference on Principles of Distributed Systems","page":"15:1-15:16","date_published":"2020-02-01T00:00:00Z","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","text":"Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has been well-studied from both theoretical and practical perspectives in the sequential case. Recently, there has been mounting interest in analyzing this problem in the concurrent scenario, and several asymptotically-efficient algorithms have been proposed. Yet, to date, there is very little known about the practical performance of concurrent Union-Find. This work addresses this gap. We evaluate and analyze the performance of several concurrent Union-Find algorithms and optimization strategies across a wide range of platforms (Intel, AMD, and ARM) and workloads (social, random, and road networks, as well as integrations into more complex algorithms). We first observe that, due to the limited computational cost, the number of induced cache misses is the critical determining factor for the performance of existing algorithms. We introduce new techniques to reduce this cost by storing node priorities implicitly and by using plain reads and writes in a way that does not affect the correctness of the algorithms. Finally, we show that Union-Find implementations are an interesting application for Transactional Memory (TM): one of the fastest algorithm variants we discovered is a sequential one that uses coarse-grained locking with the lock elision optimization to reduce synchronization cost and increase scalability. "}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7605","intvolume":" 153","ddc":["000"],"title":"In search of the fastest concurrent union-find algorithm","status":"public","oa_version":"Published Version","file":[{"checksum":"d66f07ecb609d9f02433e39f80a447e9","date_created":"2020-03-23T09:22:48Z","date_updated":"2020-07-14T12:48:01Z","file_id":"7609","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":13074131,"access_level":"open_access","file_name":"2019_LIPIcs_Alistarh.pdf"}],"publication_identifier":{"isbn":["9783959771337"],"issn":["18688969"]},"month":"02","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1911.06347"]},"oa":1,"quality_controlled":"1","doi":"10.4230/LIPIcs.OPODIS.2019.15","conference":{"end_date":"2019-12-19","start_date":"2019-12-17","location":"Neuchatal, Switzerland","name":"OPODIS: International Conference on Principles of Distributed Systems"},"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:48:01Z","license":"https://creativecommons.org/licenses/by/3.0/","year":"2020","department":[{"_id":"DaAl"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Alexander","last_name":"Fedorov","full_name":"Fedorov, Alexander"},{"id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","first_name":"Nikita","last_name":"Koval","full_name":"Koval, Nikita"}],"volume":153,"date_updated":"2023-02-23T13:12:12Z","date_created":"2020-03-22T23:00:46Z"},{"article_processing_charge":"No","day":"19","month":"02","date_published":"2020-02-19T00:00:00Z","doi":"10.1101/791137","language":[{"iso":"eng"}],"oa":1,"citation":{"ama":"Wei Z, Tan S, Liu T, et al. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. 2020. doi:10.1101/791137","ista":"Wei Z, Tan S, Liu T, Wu Y, Lei J-G, Chen Z, Friml J, Xue H-W, Liao K. 2020. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv, 10.1101/791137.","ieee":"Z. Wei et al., “Plasmodesmata-like intercellular connections by plant remorin in animal cells,” bioRxiv. Cold Spring Harbor Laboratory, 2020.","apa":"Wei, Z., Tan, S., Liu, T., Wu, Y., Lei, J.-G., Chen, Z., … Liao, K. (2020). Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/791137","mla":"Wei, Zhuang, et al. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv, Cold Spring Harbor Laboratory, 2020, doi:10.1101/791137.","short":"Z. Wei, S. Tan, T. Liu, Y. Wu, J.-G. Lei, Z. Chen, J. Friml, H.-W. Xue, K. Liao, BioRxiv (2020).","chicago":"Wei, Zhuang, Shutang Tan, Tao Liu, Yuan Wu, Ji-Gang Lei, ZhengJun Chen, Jiří Friml, Hong-Wei Xue, and Kan Liao. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv. Cold Spring Harbor Laboratory, 2020. https://doi.org/10.1101/791137."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/791137"}],"publication":"bioRxiv","page":"22","abstract":[{"lang":"eng","text":"Plasmodesmata (PD) are crucial structures for intercellular communication in multicellular plants with remorins being their crucial plant-specific structural and functional constituents. The PD biogenesis is an intriguing but poorly understood process. By expressing an Arabidopsis remorin protein in mammalian cells, we have reconstituted a PD-like filamentous structure, termed remorin filament (RF), connecting neighboring cells physically and physiologically. Notably, RFs are capable of transporting macromolecules intercellularly, in a way similar to plant PD. With further super-resolution microscopic analysis and biochemical characterization, we found that RFs are also composed of actin filaments, forming the core skeleton structure, aligned with the remorin protein. This unique heterologous filamentous structure might explain the molecular mechanism for remorin function as well as PD construction. Furthermore, remorin protein exhibits a specific distribution manner in the plasma membrane in mammalian cells, representing a lipid nanodomain, depending on its lipid modification status. Our studies not only provide crucial insights into the mechanism of PD biogenesis, but also uncovers unsuspected fundamental mechanistic and evolutionary links between intercellular communication systems of plants and animals."}],"type":"preprint","author":[{"full_name":"Wei, Zhuang","last_name":"Wei","first_name":"Zhuang"},{"full_name":"Tan, Shutang","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0471-8285","first_name":"Shutang","last_name":"Tan"},{"full_name":"Liu, Tao","first_name":"Tao","last_name":"Liu"},{"first_name":"Yuan","last_name":"Wu","full_name":"Wu, Yuan"},{"last_name":"Lei","first_name":"Ji-Gang","full_name":"Lei, Ji-Gang"},{"full_name":"Chen, ZhengJun","first_name":"ZhengJun","last_name":"Chen"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří","full_name":"Friml, Jiří"},{"full_name":"Xue, Hong-Wei","first_name":"Hong-Wei","last_name":"Xue"},{"first_name":"Kan","last_name":"Liao","full_name":"Liao, Kan"}],"oa_version":"Preprint","date_created":"2020-03-21T16:34:42Z","date_updated":"2021-01-12T08:14:26Z","year":"2020","_id":"7601","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JiFr"}],"publisher":"Cold Spring Harbor Laboratory","title":"Plasmodesmata-like intercellular connections by plant remorin in animal cells","publication_status":"published","status":"public"},{"_id":"7651","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 17","title":"A developmentally descriptive method for quantifying shape in gastropod shells","ddc":["570"],"status":"public","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"7660","checksum":"4eb102304402f5c56432516b84df86d6","date_created":"2020-04-14T12:31:16Z","date_updated":"2020-07-14T12:48:01Z","access_level":"open_access","file_name":"2020_JournRoyalSociety_Larsson.pdf","file_size":1556190,"content_type":"application/pdf","creator":"dernst"}],"type":"journal_article","issue":"163","abstract":[{"lang":"eng","text":"The growth of snail shells can be described by simple mathematical rules. Variation in a few parameters can explain much of the diversity of shell shapes seen in nature. However, empirical studies of gastropod shell shape variation typically use geometric morphometric approaches, which do not capture this growth pattern. We have developed a way to infer a set of developmentally descriptive shape parameters based on three-dimensional logarithmic helicospiral growth and using landmarks from two-dimensional shell images as input. We demonstrate the utility of this approach, and compare it to the geometric morphometric approach, using a large set of Littorina saxatilis shells in which locally adapted populations differ in shape. Our method can be modified easily to make it applicable to a wide range of shell forms, which would allow for investigations of the similarities and differences between and within many different species of gastropods."}],"citation":{"short":"J. Larsson, A.M. Westram, S. Bengmark, T. Lundh, R.K. Butlin, Journal of The Royal Society Interface 17 (2020).","mla":"Larsson, J., et al. “A Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.” Journal of The Royal Society Interface, vol. 17, no. 163, 20190721, The Royal Society, 2020, doi:10.1098/rsif.2019.0721.","chicago":"Larsson, J., Anja M Westram, S. Bengmark, T. Lundh, and R. K. Butlin. “A Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.” Journal of The Royal Society Interface. The Royal Society, 2020. https://doi.org/10.1098/rsif.2019.0721.","ama":"Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. 2020;17(163). doi:10.1098/rsif.2019.0721","apa":"Larsson, J., Westram, A. M., Bengmark, S., Lundh, T., & Butlin, R. K. (2020). A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. The Royal Society. https://doi.org/10.1098/rsif.2019.0721","ieee":"J. Larsson, A. M. Westram, S. Bengmark, T. Lundh, and R. K. Butlin, “A developmentally descriptive method for quantifying shape in gastropod shells,” Journal of The Royal Society Interface, vol. 17, no. 163. The Royal Society, 2020.","ista":"Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. 2020. A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. 17(163), 20190721."},"publication":"Journal of The Royal Society Interface","article_type":"original","date_published":"2020-02-01T00:00:00Z","scopus_import":1,"article_processing_charge":"No","has_accepted_license":"1","day":"01","year":"2020","publisher":"The Royal Society","department":[{"_id":"NiBa"}],"publication_status":"published","author":[{"last_name":"Larsson","first_name":"J.","full_name":"Larsson, J."},{"full_name":"Westram, Anja M","last_name":"Westram","first_name":"Anja M","orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87"},{"first_name":"S.","last_name":"Bengmark","full_name":"Bengmark, S."},{"full_name":"Lundh, T.","last_name":"Lundh","first_name":"T."},{"first_name":"R. K.","last_name":"Butlin","full_name":"Butlin, R. K."}],"volume":17,"date_created":"2020-04-08T15:19:17Z","date_updated":"2021-01-12T08:14:41Z","article_number":"20190721","file_date_updated":"2020-07-14T12:48:01Z","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","doi":"10.1098/rsif.2019.0721","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1742-5689"],"eissn":["1742-5662"]},"month":"02"},{"abstract":[{"text":"We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round (Δ+1)-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art O(logΔ)-round deterministic (Δ+1)-coloring bound of Parter (ICALP'18).\r\nA remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just a few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after O(1) recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in n, the number of nodes in the input graph) space.\r\nWe also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic (Δ+1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(logΔ+loglogn) rounds.","lang":"eng"}],"type":"conference","file":[{"file_size":520051,"content_type":"application/pdf","creator":"pdavies","file_name":"ColoringArxiv.pdf","access_level":"open_access","date_created":"2020-10-08T08:17:36Z","date_updated":"2020-10-08T08:17:36Z","checksum":"46fe4fc58a64eb04068115573f631d4c","success":1,"relation":"main_file","file_id":"8624"}],"oa_version":"Submitted Version","ddc":["000"],"status":"public","title":"Simple, deterministic, constant-round coloring in the congested clique","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7803","day":"01","has_accepted_license":"1","article_processing_charge":"No","date_published":"2020-07-01T00:00:00Z","page":"309-318","publication":"Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing","citation":{"apa":"Czumaj, A., Davies, P., & Parter, M. (2020). Simple, deterministic, constant-round coloring in the congested clique. In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (pp. 309–318). Salerno, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405751","ieee":"A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round coloring in the congested clique,” in Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2020, pp. 309–318.","ista":"Czumaj A, Davies P, Parter M. 2020. Simple, deterministic, constant-round coloring in the congested clique. Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 309–318.","ama":"Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring in the congested clique. In: Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:309-318. doi:10.1145/3382734.3405751","chicago":"Czumaj, Artur, Peter Davies, and Merav Parter. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, 309–18. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405751.","short":"A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–318.","mla":"Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751."},"file_date_updated":"2020-10-08T08:17:36Z","ec_funded":1,"date_created":"2020-05-06T09:02:14Z","date_updated":"2021-01-12T08:15:37Z","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj","orcid":"0000-0002-5646-9524"},{"first_name":"Peter","last_name":"Davies","id":"11396234-BB50-11E9-B24C-90FCE5697425","orcid":"0000-0002-5646-9524","full_name":"Davies, Peter"},{"full_name":"Parter, Merav","last_name":"Parter","first_name":"Merav"}],"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","year":"2020","month":"07","language":[{"iso":"eng"}],"conference":{"end_date":"2020-08-07","start_date":"2020-08-03","location":"Salerno, Italy","name":"PODC: Symposium on Principles of Distributed Computing"},"doi":"10.1145/3382734.3405751","quality_controlled":"1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"external_id":{"arxiv":["2009.06043"]},"oa":1},{"scopus_import":1,"article_processing_charge":"No","day":"01","page":"767-785","citation":{"ama":"Filakovský M, Wagner U, Zhechev SY. Embeddability of simplicial complexes is undecidable. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:767-785. doi:10.1137/1.9781611975994.47","ista":"Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 767–785.","apa":"Filakovský, M., Wagner, U., & Zhechev, S. Y. (2020). Embeddability of simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.47","ieee":"M. Filakovský, U. Wagner, and S. Y. Zhechev, “Embeddability of simplicial complexes is undecidable,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 767–785.","mla":"Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47.","short":"M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.","chicago":"Filakovský, Marek, Uli Wagner, and Stephan Y Zhechev. “Embeddability of Simplicial Complexes Is Undecidable.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2020–January:767–85. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.47."},"publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","date_published":"2020-01-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"We consider the following decision problem EMBEDk→d in computational topology (where k ≤ d are fixed positive integers): Given a finite simplicial complex K of dimension k, does there exist a (piecewise-linear) embedding of K into ℝd?\r\nThe special case EMBED1→2 is graph planarity, which is decidable in linear time, as shown by Hopcroft and Tarjan. In higher dimensions, EMBED2→3 and EMBED3→3 are known to be decidable (as well as NP-hard), and recent results of Čadek et al. in computational homotopy theory, in combination with the classical Haefliger–Weber theorem in geometric topology, imply that EMBEDk→d can be solved in polynomial time for any fixed pair (k, d) of dimensions in the so-called metastable range .\r\nHere, by contrast, we prove that EMBEDk→d is algorithmically undecidable for almost all pairs of dimensions outside the metastable range, namely for . This almost completely resolves the decidability vs. undecidability of EMBEDk→d in higher dimensions and establishes a sharp dichotomy between polynomial-time solvability and undecidability.\r\nOur result complements (and in a wide range of dimensions strengthens) earlier results of Matoušek, Tancer, and the second author, who showed that EMBEDk→d is undecidable for 4 ≤ k ϵ {d – 1, d}, and NP-hard for all remaining pairs (k, d) outside the metastable range and satisfying d ≥ 4."}],"status":"public","title":"Embeddability of simplicial complexes is undecidable","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7806","oa_version":"Published Version","publication_identifier":{"isbn":["9781611975994"]},"month":"01","project":[{"_id":"26611F5C-B435-11E9-9278-68D0E5697425","grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory","call_identifier":"FWF"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1137/1.9781611975994.47"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1137/1.9781611975994.47","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2020-01-08","start_date":"2020-01-05","location":"Salt Lake City, UT, United States"},"department":[{"_id":"UlWa"}],"publisher":"SIAM","publication_status":"published","year":"2020","volume":"2020-January","date_updated":"2021-01-12T08:15:38Z","date_created":"2020-05-10T22:00:48Z","author":[{"first_name":"Marek","last_name":"Filakovský","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","full_name":"Filakovský, Marek"},{"first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"},{"id":"3AA52972-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan Y","last_name":"Zhechev","full_name":"Zhechev, Stephan Y"}]},{"publication_identifier":{"issn":["2504-284X"]},"month":"05","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"_id":"264E56E2-B435-11E9-9278-68D0E5697425","grant_number":"M02416","name":"Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex","call_identifier":"FWF"},{"_id":"260018B0-B435-11E9-9278-68D0E5697425","grant_number":"725780","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","call_identifier":"H2020"}],"quality_controlled":"1","doi":"10.3389/feduc.2020.00048","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"article_number":"48","ec_funded":1,"file_date_updated":"2020-07-14T12:48:03Z","year":"2020","publisher":"Frontiers Media","department":[{"_id":"SiHi"}],"publication_status":"published","author":[{"first_name":"Robert J","last_name":"Beattie","id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8483-8753","full_name":"Beattie, Robert J"},{"full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","first_name":"Simon","last_name":"Hippenmeyer"},{"full_name":"Pauler, Florian","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","last_name":"Pauler","first_name":"Florian"}],"volume":5,"date_updated":"2021-01-12T08:15:42Z","date_created":"2020-05-11T08:18:48Z","has_accepted_license":"1","article_processing_charge":"No","day":"08","citation":{"mla":"Beattie, Robert J., et al. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education, vol. 5, 48, Frontiers Media, 2020, doi:10.3389/feduc.2020.00048.","short":"R.J. Beattie, S. Hippenmeyer, F. Pauler, Frontiers in Education 5 (2020).","chicago":"Beattie, Robert J, Simon Hippenmeyer, and Florian Pauler. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education. Frontiers Media, 2020. https://doi.org/10.3389/feduc.2020.00048.","ama":"Beattie RJ, Hippenmeyer S, Pauler F. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 2020;5. doi:10.3389/feduc.2020.00048","ista":"Beattie RJ, Hippenmeyer S, Pauler F. 2020. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 5, 48.","ieee":"R. J. Beattie, S. Hippenmeyer, and F. Pauler, “SCOPES: Sparking curiosity through Open-Source platforms in education and science,” Frontiers in Education, vol. 5. Frontiers Media, 2020.","apa":"Beattie, R. J., Hippenmeyer, S., & Pauler, F. (2020). SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. Frontiers Media. https://doi.org/10.3389/feduc.2020.00048"},"publication":"Frontiers in Education","article_type":"original","date_published":"2020-05-08T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Scientific research is to date largely restricted to wealthy laboratories in developed nations due to the necessity of complex and expensive equipment. This inequality limits the capacity of science to be used as a diplomatic channel. Maker movements use open-source technologies including additive manufacturing (3D printing) and laser cutting, together with low-cost computers for developing novel products. This movement is setting the groundwork for a revolution, allowing scientific equipment to be sourced at a fraction of the cost and has the potential to increase the availability of equipment for scientists around the world. Science education is increasingly recognized as another channel for science diplomacy. In this perspective, we introduce the idea that the Maker movement and open-source technologies have the potential to revolutionize science, technology, engineering and mathematics (STEM) education worldwide. We present an open-source STEM didactic tool called SCOPES (Sparking Curiosity through Open-source Platforms in Education and Science). SCOPES is self-contained, independent of local resources, and cost-effective. SCOPES can be adapted to communicate complex subjects from genetics to neurobiology, perform real-world biological experiments and explore digitized scientific samples. We envision such platforms will enhance science diplomacy by providing a means for scientists to share their findings with classrooms and for educators to incorporate didactic concepts into STEM lessons. By providing students the opportunity to design, perform, and share scientific experiments, students also experience firsthand the benefits of a multinational scientific community. We provide instructions on how to build and use SCOPES on our webpage: http://scopeseducation.org."}],"_id":"7814","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 5","status":"public","ddc":["570"],"title":"SCOPES: Sparking curiosity through Open-Source platforms in education and science","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:48:03Z","date_created":"2020-05-11T11:34:08Z","checksum":"a24ec24e38d843341ae620ec76c53688","relation":"main_file","file_id":"7818","content_type":"application/pdf","file_size":1402146,"creator":"dernst","file_name":"2020_FrontiersEduc_Beattie.pdf","access_level":"open_access"}]},{"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2020-12-01T00:00:00Z","publication":"Journal of Elliptic and Parabolic Equations","citation":{"ama":"Fellner K, Kniely M. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 2020;6:529-598. doi:10.1007/s41808-020-00068-8","ista":"Fellner K, Kniely M. 2020. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 6, 529–598.","ieee":"K. Fellner and M. Kniely, “Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model,” Journal of Elliptic and Parabolic Equations, vol. 6. Springer Nature, pp. 529–598, 2020.","apa":"Fellner, K., & Kniely, M. (2020). Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. Springer Nature. https://doi.org/10.1007/s41808-020-00068-8","mla":"Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations, vol. 6, Springer Nature, 2020, pp. 529–98, doi:10.1007/s41808-020-00068-8.","short":"K. Fellner, M. Kniely, Journal of Elliptic and Parabolic Equations 6 (2020) 529–598.","chicago":"Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations. Springer Nature, 2020. https://doi.org/10.1007/s41808-020-00068-8."},"article_type":"original","page":"529-598","abstract":[{"lang":"eng","text":"In this paper, we establish convergence to equilibrium for a drift–diffusion–recombination system modelling the charge transport within certain semiconductor devices. More precisely, we consider a two-level system for electrons and holes which is augmented by an intermediate energy level for electrons in so-called trapped states. The recombination dynamics use the mass action principle by taking into account this additional trap level. The main part of the paper is concerned with the derivation of an entropy–entropy production inequality, which entails exponential convergence to the equilibrium via the so-called entropy method. The novelty of our approach lies in the fact that the entropy method is applied uniformly in a fast-reaction parameter which governs the lifetime of electrons on the trap level. Thus, the resulting decay estimate for the densities of electrons and holes extends to the corresponding quasi-steady-state approximation."}],"type":"journal_article","file":[{"file_id":"8802","relation":"main_file","success":1,"checksum":"6bc6832caacddceee1471291e93dcf1d","date_updated":"2020-11-25T08:59:59Z","date_created":"2020-11-25T08:59:59Z","access_level":"open_access","file_name":"2020_JourEllipticParabEquat_Fellner.pdf","creator":"dernst","content_type":"application/pdf","file_size":8408694}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7866","title":"Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model","status":"public","ddc":["510"],"intvolume":" 6","month":"12","publication_identifier":{"issn":["22969020"],"eissn":["22969039"]},"doi":"10.1007/s41808-020-00068-8","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"name":"FWF Open Access Fund","call_identifier":"FWF","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"file_date_updated":"2020-11-25T08:59:59Z","author":[{"full_name":"Fellner, Klemens","first_name":"Klemens","last_name":"Fellner"},{"first_name":"Michael","last_name":"Kniely","id":"2CA2C08C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5645-4333","full_name":"Kniely, Michael"}],"date_updated":"2021-01-12T08:15:47Z","date_created":"2020-05-17T22:00:45Z","volume":6,"acknowledgement":"Open access funding provided by Austrian Science Fund (FWF). The second author has been supported by the International Research Training Group IGDK 1754 “Optimization and Numerical Analysis for Partial Differential Equations with Nonsmooth Structures”, funded by the German Research Council (DFG) and the Austrian Science Fund (FWF) under grant number [W 1244-N18].","year":"2020","publication_status":"published","department":[{"_id":"JuFi"}],"publisher":"Springer Nature"},{"day":"11","has_accepted_license":"1","article_processing_charge":"No","date_published":"2020-05-11T00:00:00Z","publication":"Physical Review Research","citation":{"ama":"Mistakidis SI, Volosniev A, Schmelcher P. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2020;2. doi:10.1103/physrevresearch.2.023154","ista":"Mistakidis SI, Volosniev A, Schmelcher P. 2020. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2, 023154.","ieee":"S. I. Mistakidis, A. Volosniev, and P. Schmelcher, “Induced correlations between impurities in a one-dimensional quenched Bose gas,” Physical Review Research, vol. 2. American Physical Society, 2020.","apa":"Mistakidis, S. I., Volosniev, A., & Schmelcher, P. (2020). Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.023154","mla":"Mistakidis, S. I., et al. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research, vol. 2, 023154, American Physical Society, 2020, doi:10.1103/physrevresearch.2.023154.","short":"S.I. Mistakidis, A. Volosniev, P. Schmelcher, Physical Review Research 2 (2020).","chicago":"Mistakidis, S. I., Artem Volosniev, and P. Schmelcher. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.023154."},"article_type":"original","abstract":[{"lang":"eng","text":"We explore the time evolution of two impurities in a trapped one-dimensional Bose gas that follows a change of the boson-impurity interaction. We study the induced impurity-impurity interactions and their effect on the quench dynamics. In particular, we report on the size of the impurity cloud, the impurity-impurity entanglement, and the impurity-impurity correlation function. The presented numerical simulations are based upon the variational multilayer multiconfiguration time-dependent Hartree method for bosons. To analyze and quantify induced impurity-impurity correlations, we employ an effective two-body Hamiltonian with a contact interaction. We show that the effective model consistent with the mean-field attraction of two heavy impurities explains qualitatively our results for weak interactions. Our findings suggest that the quench dynamics in cold-atom systems can be a tool for studying impurity-impurity correlations."}],"type":"journal_article","file":[{"file_id":"7926","relation":"main_file","date_updated":"2020-07-14T12:48:05Z","date_created":"2020-06-04T13:51:59Z","checksum":"e1c362fe094d6b246b3cd4a49722e78b","file_name":"2020_PhysRevResearch_Mistakidis.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":1741098}],"oa_version":"Published Version","_id":"7919","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Induced correlations between impurities in a one-dimensional quenched Bose gas","status":"public","ddc":["530"],"intvolume":" 2","month":"05","publication_identifier":{"issn":["2643-1564"]},"doi":"10.1103/physrevresearch.2.023154","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"file_date_updated":"2020-07-14T12:48:05Z","ec_funded":1,"article_number":"023154 ","author":[{"full_name":"Mistakidis, S. I.","first_name":"S. I.","last_name":"Mistakidis"},{"first_name":"Artem","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem"},{"full_name":"Schmelcher, P.","first_name":"P.","last_name":"Schmelcher"}],"date_updated":"2023-02-23T13:20:16Z","date_created":"2020-06-03T11:30:10Z","volume":2,"year":"2020","publication_status":"published","publisher":"American Physical Society","department":[{"_id":"MiLe"}]}]