[{"file_date_updated":"2020-07-14T12:47:20Z","extern":"1","license":"https://creativecommons.org/licenses/by/4.0/","pmid":1,"year":"2014","publisher":"Elsevier","publication_status":"published","author":[{"last_name":"Linneweber","first_name":"Gerit A.","full_name":"Linneweber, Gerit A."},{"full_name":"Jacobson, Jake","first_name":"Jake","last_name":"Jacobson"},{"last_name":"Busch","first_name":"Karl Emanuel","full_name":"Busch, Karl Emanuel"},{"first_name":"Bruno","last_name":"Hudry","full_name":"Hudry, Bruno"},{"last_name":"Christov","first_name":"Christo P.","full_name":"Christov, Christo P."},{"last_name":"Dormann","first_name":"Dirk","full_name":"Dormann, Dirk"},{"full_name":"Yuan, Michaela","first_name":"Michaela","last_name":"Yuan"},{"first_name":"Tomoki","last_name":"Otani","full_name":"Otani, Tomoki"},{"full_name":"Knust, Elisabeth","last_name":"Knust","first_name":"Elisabeth"},{"last_name":"de Bono","first_name":"Mario","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario"},{"full_name":"Miguel-Aliaga, Irene","first_name":"Irene","last_name":"Miguel-Aliaga"}],"volume":156,"date_created":"2019-03-19T14:35:30Z","date_updated":"2021-01-12T08:06:13Z","publication_identifier":{"issn":["0092-8674"]},"month":"01","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"pmid":["24439370"]},"quality_controlled":"1","doi":"10.1016/j.cell.2013.12.008","language":[{"iso":"eng"}],"type":"journal_article","issue":"1-2","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6122","intvolume":" 156","title":"Neuronal control of metabolism through nutrient-dependent modulation of tracheal branching","ddc":["570"],"status":"public","oa_version":"Published Version","file":[{"file_name":"2014_Elsevier_Linneweber.pdf","access_level":"open_access","creator":"kschuh","file_size":5020084,"content_type":"application/pdf","file_id":"6123","relation":"main_file","date_created":"2019-03-19T14:40:38Z","date_updated":"2020-07-14T12:47:20Z","checksum":"ad6ef68f37fb711d9abcd97fc06ad316"}],"has_accepted_license":"1","day":"16","citation":{"ama":"Linneweber GA, Jacobson J, Busch KE, et al. Neuronal control of metabolism through nutrient-dependent modulation of tracheal branching. Cell. 2014;156(1-2):69-83. doi:10.1016/j.cell.2013.12.008","apa":"Linneweber, G. A., Jacobson, J., Busch, K. E., Hudry, B., Christov, C. P., Dormann, D., … Miguel-Aliaga, I. (2014). Neuronal control of metabolism through nutrient-dependent modulation of tracheal branching. Cell. Elsevier. https://doi.org/10.1016/j.cell.2013.12.008","ieee":"G. A. Linneweber et al., “Neuronal control of metabolism through nutrient-dependent modulation of tracheal branching,” Cell, vol. 156, no. 1–2. Elsevier, pp. 69–83, 2014.","ista":"Linneweber GA, Jacobson J, Busch KE, Hudry B, Christov CP, Dormann D, Yuan M, Otani T, Knust E, de Bono M, Miguel-Aliaga I. 2014. Neuronal control of metabolism through nutrient-dependent modulation of tracheal branching. Cell. 156(1–2), 69–83.","short":"G.A. Linneweber, J. Jacobson, K.E. Busch, B. Hudry, C.P. Christov, D. Dormann, M. Yuan, T. Otani, E. Knust, M. de Bono, I. Miguel-Aliaga, Cell 156 (2014) 69–83.","mla":"Linneweber, Gerit A., et al. “Neuronal Control of Metabolism through Nutrient-Dependent Modulation of Tracheal Branching.” Cell, vol. 156, no. 1–2, Elsevier, 2014, pp. 69–83, doi:10.1016/j.cell.2013.12.008.","chicago":"Linneweber, Gerit A., Jake Jacobson, Karl Emanuel Busch, Bruno Hudry, Christo P. Christov, Dirk Dormann, Michaela Yuan, et al. “Neuronal Control of Metabolism through Nutrient-Dependent Modulation of Tracheal Branching.” Cell. Elsevier, 2014. https://doi.org/10.1016/j.cell.2013.12.008."},"publication":"Cell","page":"69-83","date_published":"2014-01-16T00:00:00Z"},{"external_id":{"arxiv":["1210.4236"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1210.4236"}],"citation":{"ama":"Bretèche R de la, Browning TD. Contre-exemples au principe de Hasse pour certains tores coflasques. Journal de Théorie des Nombres de Bordeaux. 2014;26(1):25-44. doi:10.5802/jtnb.857","ista":"Bretèche R de la, Browning TD. 2014. Contre-exemples au principe de Hasse pour certains tores coflasques. Journal de Théorie des Nombres de Bordeaux. 26(1), 25–44.","apa":"Bretèche, R. de la, & Browning, T. D. (2014). Contre-exemples au principe de Hasse pour certains tores coflasques. Journal de Théorie Des Nombres de Bordeaux. Cellule MathDoc/CEDRAM. https://doi.org/10.5802/jtnb.857","ieee":"R. de la Bretèche and T. D. Browning, “Contre-exemples au principe de Hasse pour certains tores coflasques,” Journal de Théorie des Nombres de Bordeaux, vol. 26, no. 1. Cellule MathDoc/CEDRAM, pp. 25–44, 2014.","mla":"Bretèche, Régis de la, and Timothy D. Browning. “Contre-Exemples Au Principe de Hasse Pour Certains Tores Coflasques.” Journal de Théorie Des Nombres de Bordeaux, vol. 26, no. 1, Cellule MathDoc/CEDRAM, 2014, pp. 25–44, doi:10.5802/jtnb.857.","short":"R. de la Bretèche, T.D. Browning, Journal de Théorie Des Nombres de Bordeaux 26 (2014) 25–44.","chicago":"Bretèche, Régis de la, and Timothy D Browning. “Contre-Exemples Au Principe de Hasse Pour Certains Tores Coflasques.” Journal de Théorie Des Nombres de Bordeaux. Cellule MathDoc/CEDRAM, 2014. https://doi.org/10.5802/jtnb.857."},"oa":1,"publication":"Journal de Théorie des Nombres de Bordeaux","page":"25-44","quality_controlled":"1","date_published":"2014-01-01T00:00:00Z","doi":"10.5802/jtnb.857","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1246-7405","2118-8572"]},"_id":"6319","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2014","intvolume":" 26","publisher":"Cellule MathDoc/CEDRAM","status":"public","title":"Contre-exemples au principe de Hasse pour certains tores coflasques","publication_status":"published","author":[{"first_name":"Régis de la","last_name":"Bretèche","full_name":"Bretèche, Régis de la"},{"full_name":"Browning, Timothy D","last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87"}],"volume":26,"oa_version":"Preprint","date_updated":"2021-01-12T08:07:03Z","date_created":"2019-04-16T13:40:13Z","type":"journal_article","issue":"1","abstract":[{"lang":"fre","text":"Nous étudions le comportement asymptotique du nombre de variétés dans une certaine classe ne satisfaisant pas le principe de Hasse. Cette étude repose sur des résultats récemmentobtenus par Colliot-Thélène."}],"extern":"1"},{"extern":"1","abstract":[{"lang":"eng","text":"We describe coding techniques that achieve the capacity of a discrete memoryless asymmetric channel. To do so, we discuss how recent advances in coding for symmetric channels yield more efficient solutions also for the asymmetric case. In more detail, we consider three basic approaches. The first one is Gallager's scheme that concatenates a linear code with a non-linear mapper, in order to bias the input distribution. We explicitly show that both polar codes and spatially coupled codes can be employed in this scenario. Further, we derive a scaling law between the gap to capacity, the cardinality of channel input and output alphabets, and the required size of the mapper. The second one is an integrated approach in which the coding scheme is used both for source coding, in order to create codewords with the capacity-achieving distribution, and for channel coding, in order to provide error protection. Such a technique has been recently introduced by Honda and Yamamoto in the context of polar codes, and we show how to apply it also to the design of sparse graph codes. The third approach is based on an idea due to Böcherer and Mathar and separates completely the two tasks of source coding and channel coding by “chaining” together several codewords. We prove that we can combine any suitable source code with any suitable channel code in order to provide optimal schemes for asymmetric channels. In particular, polar codes and spatially coupled codes fulfill the required conditions."}],"type":"conference","date_updated":"2023-02-23T12:49:36Z","date_created":"2019-07-31T07:24:23Z","oa_version":"Preprint","author":[{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco"},{"first_name":"Rudiger","last_name":"Urbanke","full_name":"Urbanke, Rudiger"},{"full_name":"Hassani, Hamed","first_name":"Hamed","last_name":"Hassani"}],"related_material":{"record":[{"id":"6678","status":"public","relation":"later_version"}]},"publication_status":"published","status":"public","title":"How to achieve the capacity of asymmetric channels","publisher":"IEEE","_id":"6740","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2014","day":"01","month":"10","publication_identifier":{"eisbn":["978-1-4799-8009-3"]},"language":[{"iso":"eng"}],"conference":{"name":"Allerton Conference on Communication, Control, and Computing","start_date":"2014-09-30","location":"Monticello, IL, United States","end_date":"2014-10-03"},"date_published":"2014-10-01T00:00:00Z","doi":"10.1109/allerton.2014.7028535","quality_controlled":"1","page":"789-796","publication":"52nd Annual Allerton Conference on Communication, Control, and Computing","citation":{"short":"M. Mondelli, R. Urbanke, H. Hassani, in:, 52nd Annual Allerton Conference on Communication, Control, and Computing, IEEE, 2014, pp. 789–796.","mla":"Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.” 52nd Annual Allerton Conference on Communication, Control, and Computing, IEEE, 2014, pp. 789–96, doi:10.1109/allerton.2014.7028535.","chicago":"Mondelli, Marco, Rudiger Urbanke, and Hamed Hassani. “How to Achieve the Capacity of Asymmetric Channels.” In 52nd Annual Allerton Conference on Communication, Control, and Computing, 789–96. IEEE, 2014. https://doi.org/10.1109/allerton.2014.7028535.","ama":"Mondelli M, Urbanke R, Hassani H. How to achieve the capacity of asymmetric channels. In: 52nd Annual Allerton Conference on Communication, Control, and Computing. IEEE; 2014:789-796. doi:10.1109/allerton.2014.7028535","ieee":"M. Mondelli, R. Urbanke, and H. Hassani, “How to achieve the capacity of asymmetric channels,” in 52nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, United States, 2014, pp. 789–796.","apa":"Mondelli, M., Urbanke, R., & Hassani, H. (2014). How to achieve the capacity of asymmetric channels. In 52nd Annual Allerton Conference on Communication, Control, and Computing (pp. 789–796). Monticello, IL, United States: IEEE. https://doi.org/10.1109/allerton.2014.7028535","ista":"Mondelli M, Urbanke R, Hassani H. 2014. How to achieve the capacity of asymmetric channels. 52nd Annual Allerton Conference on Communication, Control, and Computing. Allerton Conference on Communication, Control, and Computing, 789–796."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1406.7373"}],"oa":1,"external_id":{"arxiv":["1406.7373"]}},{"publisher":"IEEE","intvolume":" 62","publication_status":"published","title":"From polar to Reed-Muller codes: A technique to improve the finite-length performance","status":"public","_id":"6739","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2014","volume":62,"oa_version":"Preprint","date_created":"2019-07-31T07:20:21Z","date_updated":"2021-01-12T08:08:46Z","author":[{"full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"},{"last_name":"Hassani","first_name":"Hamed","full_name":"Hassani, Hamed"},{"first_name":"Rudiger","last_name":"Urbanke","full_name":"Urbanke, Rudiger"}],"type":"journal_article","extern":"1","issue":"9","abstract":[{"text":"We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM codes have a smaller error probability than polar codes under MAP decoding. This motivates us to introduce a family of codes that “interpolates” between RM and polar codes, call this family C inter = {C α : α ∈ [0, 1j}, where C α|α=1 is the original polar code, and C α|α=0 is an RM code. Based on numerical observations, we remark that the error probability under MAP decoding is an increasing function of α. MAP decoding has in general exponential complexity, but empirically the performance of polar codes at finite block lengths is boosted by moving along the family Cinter even under low-complexity decoding schemes such as, for instance, belief propagation or successive cancellation list decoder. We demonstrate the performance gain via numerical simulations for transmission over the erasure channel as well as the Gaussian channel.","lang":"eng"}],"page":"3084-3091","quality_controlled":"1","external_id":{"arxiv":["1401.3127"]},"oa":1,"citation":{"chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance.” IEEE Transactions on Communications. IEEE, 2014. https://doi.org/10.1109/tcomm.2014.2345069.","short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Communications 62 (2014) 3084–3091.","mla":"Mondelli, Marco, et al. “From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance.” IEEE Transactions on Communications, vol. 62, no. 9, IEEE, 2014, pp. 3084–91, doi:10.1109/tcomm.2014.2345069.","apa":"Mondelli, M., Hassani, H., & Urbanke, R. (2014). From polar to Reed-Muller codes: A technique to improve the finite-length performance. IEEE Transactions on Communications. IEEE. https://doi.org/10.1109/tcomm.2014.2345069","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “From polar to Reed-Muller codes: A technique to improve the finite-length performance,” IEEE Transactions on Communications, vol. 62, no. 9. IEEE, pp. 3084–3091, 2014.","ista":"Mondelli M, Hassani H, Urbanke R. 2014. From polar to Reed-Muller codes: A technique to improve the finite-length performance. IEEE Transactions on Communications. 62(9), 3084–3091.","ama":"Mondelli M, Hassani H, Urbanke R. From polar to Reed-Muller codes: A technique to improve the finite-length performance. IEEE Transactions on Communications. 2014;62(9):3084-3091. doi:10.1109/tcomm.2014.2345069"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1401.3127"}],"publication":"IEEE Transactions on Communications","language":[{"iso":"eng"}],"date_published":"2014-09-01T00:00:00Z","doi":"10.1109/tcomm.2014.2345069","publication_identifier":{"issn":["0090-6778"]},"month":"09","day":"01"},{"date_updated":"2021-01-12T08:08:48Z","date_created":"2019-07-31T09:05:07Z","oa_version":"None","volume":13,"author":[{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco"},{"last_name":"Zhou","first_name":"Qi","full_name":"Zhou, Qi"},{"first_name":"Vincenzo","last_name":"Lottici","full_name":"Lottici, Vincenzo"},{"last_name":"Ma","first_name":"Xiaoli","full_name":"Ma, Xiaoli"}],"status":"public","publication_status":"published","title":"Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications","publisher":"IEEE","intvolume":" 13","_id":"6744","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2014","extern":"1","abstract":[{"lang":"eng","text":"With the aim of extending the coverage and improving the performance of impulse radio ultra-wideband (UWB) systems, this paper focuses on developing a novel single differential encoded decode and forward (DF) non-cooperative relaying scheme (NCR). To favor simple receiver structures, differential noncoherent detection is employed which enables effective energy capture without any channel estimation. Putting emphasis on the general case of multi-hop relaying, we illustrate an original algorithm for the joint power allocation and path selection (JPAPS), minimizing an approximate expression of the overall bit error rate (BER). In particular, after deriving a closed-form power allocation strategy, the optimal path selection is reduced to a shortest path problem on a connected graph, which can be solved without any topology information with complexity O(N 3 ), N being the number of available relays of the network. An approximate scheme is also presented, which reduces the complexity to O(N 2 ) while showing a negligible performance loss, and for benchmarking purposes, an exhaustive-search based multi-hop DF cooperative strategy is derived. Simulation results for various network setups corroborate the effectiveness of the proposed low-complexity JPAPS algorithm, which favorably compares to existing AF and DF relaying methods."}],"issue":"3","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1109/twc.2014.020914.130669","date_published":"2014-03-20T00:00:00Z","quality_controlled":"1","page":"1397-1409","publication":"IEEE Transactions on Wireless Communications","citation":{"chicago":"Mondelli, Marco, Qi Zhou, Vincenzo Lottici, and Xiaoli Ma. “Joint Power Allocation and Path Selection for Multi-Hop Noncoherent Decode and Forward UWB Communications.” IEEE Transactions on Wireless Communications. IEEE, 2014. https://doi.org/10.1109/twc.2014.020914.130669.","short":"M. Mondelli, Q. Zhou, V. Lottici, X. Ma, IEEE Transactions on Wireless Communications 13 (2014) 1397–1409.","mla":"Mondelli, Marco, et al. “Joint Power Allocation and Path Selection for Multi-Hop Noncoherent Decode and Forward UWB Communications.” IEEE Transactions on Wireless Communications, vol. 13, no. 3, IEEE, 2014, pp. 1397–409, doi:10.1109/twc.2014.020914.130669.","ieee":"M. Mondelli, Q. Zhou, V. Lottici, and X. Ma, “Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications,” IEEE Transactions on Wireless Communications, vol. 13, no. 3. IEEE, pp. 1397–1409, 2014.","apa":"Mondelli, M., Zhou, Q., Lottici, V., & Ma, X. (2014). Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications. IEEE Transactions on Wireless Communications. IEEE. https://doi.org/10.1109/twc.2014.020914.130669","ista":"Mondelli M, Zhou Q, Lottici V, Ma X. 2014. Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications. IEEE Transactions on Wireless Communications. 13(3), 1397–1409.","ama":"Mondelli M, Zhou Q, Lottici V, Ma X. Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications. IEEE Transactions on Wireless Communications. 2014;13(3):1397-1409. doi:10.1109/twc.2014.020914.130669"},"day":"20","month":"03"},{"date_published":"2014-01-30T00:00:00Z","page":"78-97","publication":"VMCAI 2014: Verification, Model Checking, and Abstract Interpretation","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_5.","mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:10.1007/978-3-642-54013-4_5.","short":"K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.","ista":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.","apa":"Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_5","ama":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular games. In: VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:78-97. doi:10.1007/978-3-642-54013-4_5"},"day":"30","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","status":"public","title":"Doomsday equilibria for omega-regular games","intvolume":" 8318","_id":"10885","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games.\r\nIn this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile such that all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players objective, then the objective of every player is violated.\r\nWe present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games.We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games."}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"conference":{"name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","start_date":"2014-01-19","location":"San Diego, CA, United States","end_date":"2014-01-21"},"doi":"10.1007/978-3-642-54013-4_5","quality_controlled":"1","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"external_id":{"arxiv":["1311.3238"]},"month":"01","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783642540127"],"eisbn":["9783642540134"],"issn":["0302-9743"]},"date_updated":"2023-02-23T12:52:24Z","date_created":"2022-03-18T13:03:15Z","volume":8318,"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"last_name":"Filiot","first_name":"Emmanuel","full_name":"Filiot, Emmanuel"},{"full_name":"Raskin, Jean-François","first_name":"Jean-François","last_name":"Raskin"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"681"}]},"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"acknowledgement":" Supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No\r\nS11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","year":"2014","ec_funded":1},{"type":"book","place":"Cham","alternative_title":["SpringerBriefs in Applied Sciences and Technology"],"abstract":[{"lang":"eng","text":"This monograph presents a short course in computational geometry and topology. In the first part the book covers Voronoi diagrams and Delaunay triangulations, then it presents the theory of alpha complexes which play a crucial role in biology. The central part of the book is the homology theory and their computation, including the theory of persistence which is indispensable for applications, e.g. shape reconstruction. The target audience comprises researchers and practitioners in mathematics, biology, neuroscience and computer science, but the book may also be beneficial to graduate students of these fields."}],"year":"2014","_id":"6853","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"status":"public","publication_status":"published","title":"A Short Course in Computational Geometry and Topology","edition":"1","related_material":{"link":[{"description":"available as eBook via catalog IST BookList","relation":"other","url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=356106"},{"description":"available via catalog IST BookList","relation":"other","url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=373842"}]},"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"}],"oa_version":"None","date_created":"2019-09-06T09:22:33Z","date_updated":"2022-03-04T07:47:54Z","scopus_import":"1","series_title":"SpringerBriefs in Applied Sciences and Technology","publication_identifier":{"eisbn":["9-783-3190-5957-0"],"issn":["2191-530X"],"eissn":["2191-5318"],"isbn":["9-783-3190-5956-3"]},"article_processing_charge":"No","month":"01","day":"01","citation":{"short":"H. Edelsbrunner, A Short Course in Computational Geometry and Topology, 1st ed., Springer Nature, Cham, 2014.","mla":"Edelsbrunner, Herbert. A Short Course in Computational Geometry and Topology. 1st ed., Springer Nature, 2014, doi:10.1007/978-3-319-05957-0.","chicago":"Edelsbrunner, Herbert. A Short Course in Computational Geometry and Topology. 1st ed. SpringerBriefs in Applied Sciences and Technology. Cham: Springer Nature, 2014. https://doi.org/10.1007/978-3-319-05957-0.","ama":"Edelsbrunner H. A Short Course in Computational Geometry and Topology. 1st ed. Cham: Springer Nature; 2014. doi:10.1007/978-3-319-05957-0","ieee":"H. Edelsbrunner, A Short Course in Computational Geometry and Topology, 1st ed. Cham: Springer Nature, 2014.","apa":"Edelsbrunner, H. (2014). A Short Course in Computational Geometry and Topology (1st ed.). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-05957-0","ista":"Edelsbrunner H. 2014. A Short Course in Computational Geometry and Topology 1st ed., Cham: Springer Nature, IX, 110p."},"page":"IX, 110","quality_controlled":"1","doi":"10.1007/978-3-319-05957-0","date_published":"2014-01-01T00:00:00Z","language":[{"iso":"eng"}]},{"date_published":"2014-06-30T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ama":"Huszár K, Rolinek M. Playful Math - An Introduction to Mathematical Games. IST Austria","apa":"Huszár, K., & Rolinek, M. (n.d.). Playful Math - An introduction to mathematical games. IST Austria.","ieee":"K. Huszár and M. Rolinek, Playful Math - An introduction to mathematical games. IST Austria.","ista":"Huszár K, Rolinek M. Playful Math - An introduction to mathematical games, IST Austria, 5p.","short":"K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games, IST Austria, n.d.","mla":"Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction to Mathematical Games. IST Austria.","chicago":"Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction to Mathematical Games. IST Austria, n.d."},"oa":1,"page":"5","day":"30","month":"06","has_accepted_license":"1","article_processing_charge":"No","author":[{"full_name":"Huszár, Kristóf","id":"33C26278-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5445-5057","first_name":"Kristóf","last_name":"Huszár"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rolinek"}],"date_updated":"2020-07-14T23:11:45Z","date_created":"2019-11-18T15:57:05Z","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2014_Playful_Math_Huszar.pdf","content_type":"application/pdf","file_size":511233,"creator":"dernst","relation":"main_file","file_id":"7039","checksum":"2b94e5e1f4c3fe8ab89b12806276fb09","date_created":"2019-11-18T15:57:51Z","date_updated":"2020-07-14T12:47:48Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7038","year":"2014","ddc":["510"],"title":"Playful Math - An introduction to mathematical games","status":"public","publication_status":"draft","department":[{"_id":"VlKo"},{"_id":"UlWa"}],"publisher":"IST Austria","file_date_updated":"2020-07-14T12:47:48Z","type":"working_paper"},{"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.1038/ncomms5203","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2041-1723"]},"month":"06","year":"2014","publisher":"Springer Science and Business Media LLC","publication_status":"published","author":[{"id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","first_name":"Kimberly A","last_name":"Modic","full_name":"Modic, Kimberly A"},{"first_name":"Tess E.","last_name":"Smidt","full_name":"Smidt, Tess E."},{"first_name":"Itamar","last_name":"Kimchi","full_name":"Kimchi, Itamar"},{"full_name":"Breznay, Nicholas P.","first_name":"Nicholas P.","last_name":"Breznay"},{"full_name":"Biffin, Alun","last_name":"Biffin","first_name":"Alun"},{"last_name":"Choi","first_name":"Sungkyun","full_name":"Choi, Sungkyun"},{"full_name":"Johnson, Roger D.","first_name":"Roger D.","last_name":"Johnson"},{"full_name":"Coldea, Radu","last_name":"Coldea","first_name":"Radu"},{"full_name":"Watkins-Curry, Pilanda","last_name":"Watkins-Curry","first_name":"Pilanda"},{"full_name":"McCandless, Gregory T.","first_name":"Gregory T.","last_name":"McCandless"},{"full_name":"Chan, Julia Y.","last_name":"Chan","first_name":"Julia Y."},{"full_name":"Gandara, Felipe","last_name":"Gandara","first_name":"Felipe"},{"full_name":"Islam, Z.","first_name":"Z.","last_name":"Islam"},{"full_name":"Vishwanath, Ashvin","first_name":"Ashvin","last_name":"Vishwanath"},{"full_name":"Shekhter, Arkady","last_name":"Shekhter","first_name":"Arkady"},{"last_name":"McDonald","first_name":"Ross D.","full_name":"McDonald, Ross D."},{"full_name":"Analytis, James G.","last_name":"Analytis","first_name":"James G."}],"volume":5,"date_created":"2019-11-19T13:22:39Z","date_updated":"2021-01-12T08:11:42Z","article_number":"4203","file_date_updated":"2020-07-14T12:47:48Z","extern":"1","citation":{"ista":"Modic KA, Smidt TE, Kimchi I, Breznay NP, Biffin A, Choi S, Johnson RD, Coldea R, Watkins-Curry P, McCandless GT, Chan JY, Gandara F, Islam Z, Vishwanath A, Shekhter A, McDonald RD, Analytis JG. 2014. Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate. Nature Communications. 5, 4203.","apa":"Modic, K. A., Smidt, T. E., Kimchi, I., Breznay, N. P., Biffin, A., Choi, S., … Analytis, J. G. (2014). Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate. Nature Communications. Springer Science and Business Media LLC. https://doi.org/10.1038/ncomms5203","ieee":"K. A. Modic et al., “Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate,” Nature Communications, vol. 5. Springer Science and Business Media LLC, 2014.","ama":"Modic KA, Smidt TE, Kimchi I, et al. Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate. Nature Communications. 2014;5. doi:10.1038/ncomms5203","chicago":"Modic, Kimberly A, Tess E. Smidt, Itamar Kimchi, Nicholas P. Breznay, Alun Biffin, Sungkyun Choi, Roger D. Johnson, et al. “Realization of a Three-Dimensional Spin–Anisotropic Harmonic Honeycomb Iridate.” Nature Communications. Springer Science and Business Media LLC, 2014. https://doi.org/10.1038/ncomms5203.","mla":"Modic, Kimberly A., et al. “Realization of a Three-Dimensional Spin–Anisotropic Harmonic Honeycomb Iridate.” Nature Communications, vol. 5, 4203, Springer Science and Business Media LLC, 2014, doi:10.1038/ncomms5203.","short":"K.A. Modic, T.E. Smidt, I. Kimchi, N.P. Breznay, A. Biffin, S. Choi, R.D. Johnson, R. Coldea, P. Watkins-Curry, G.T. McCandless, J.Y. Chan, F. Gandara, Z. Islam, A. Vishwanath, A. Shekhter, R.D. McDonald, J.G. Analytis, Nature Communications 5 (2014)."},"publication":"Nature Communications","article_type":"original","date_published":"2014-06-27T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","day":"27","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7071","intvolume":" 5","title":"Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate","ddc":["530"],"status":"public","file":[{"creator":"dernst","content_type":"application/pdf","file_size":4832820,"file_name":"2014_NatureComm_Modic.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:48Z","date_created":"2019-11-26T12:44:23Z","checksum":"d290f0bfa93c5169cc6c8086874c5a78","file_id":"7113","relation":"main_file"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Spin and orbital quantum numbers play a key role in the physics of Mott insulators, but in most systems they are connected only indirectly—via the Pauli exclusion principle and the Coulomb interaction. Iridium-based oxides (iridates) introduce strong spin–orbit coupling directly, such that these numbers become entwined together and the Mott physics attains a strong orbital character. In the layered honeycomb iridates this is thought to generate highly spin–anisotropic magnetic interactions, coupling the spin to a given spatial direction of exchange and leading to strongly frustrated magnetism. Here we report a new iridate structure that has the same local connectivity as the layered honeycomb and exhibits striking evidence for highly spin–anisotropic exchange. The basic structural units of this material suggest that a new family of three-dimensional structures could exist, the ‘harmonic honeycomb’ iridates, of which the present compound is the first example.","lang":"eng"}]},{"month":"05","day":"19","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"article_processing_charge":"No","publication":"Physical Review Letters","citation":{"chicago":"Lancaster, T., P. A. Goddard, S. J. Blundell, F. R. Foronda, S. Ghannadzadeh, J. S. Möller, P. J. Baker, et al. “Controlling Magnetic Order and Quantum Disorder in Molecule-Based Magnets.” Physical Review Letters. APS, 2014. https://doi.org/10.1103/physrevlett.112.207201.","mla":"Lancaster, T., et al. “Controlling Magnetic Order and Quantum Disorder in Molecule-Based Magnets.” Physical Review Letters, vol. 112, no. 20, 207201, APS, 2014, doi:10.1103/physrevlett.112.207201.","short":"T. Lancaster, P.A. Goddard, S.J. Blundell, F.R. Foronda, S. Ghannadzadeh, J.S. Möller, P.J. Baker, F.L. Pratt, C. Baines, L. Huang, J. Wosnitza, R.D. McDonald, K.A. Modic, J. Singleton, C.V. Topping, T.A.W. Beale, F. Xiao, J.A. Schlueter, A.M. Barton, R.D. Cabrera, K.E. Carreiro, H.E. Tran, J.L. Manson, Physical Review Letters 112 (2014).","ista":"Lancaster T, Goddard PA, Blundell SJ, Foronda FR, Ghannadzadeh S, Möller JS, Baker PJ, Pratt FL, Baines C, Huang L, Wosnitza J, McDonald RD, Modic KA, Singleton J, Topping CV, Beale TAW, Xiao F, Schlueter JA, Barton AM, Cabrera RD, Carreiro KE, Tran HE, Manson JL. 2014. Controlling magnetic order and quantum disorder in molecule-based magnets. Physical Review Letters. 112(20), 207201.","apa":"Lancaster, T., Goddard, P. A., Blundell, S. J., Foronda, F. R., Ghannadzadeh, S., Möller, J. S., … Manson, J. L. (2014). Controlling magnetic order and quantum disorder in molecule-based magnets. Physical Review Letters. APS. https://doi.org/10.1103/physrevlett.112.207201","ieee":"T. Lancaster et al., “Controlling magnetic order and quantum disorder in molecule-based magnets,” Physical Review Letters, vol. 112, no. 20. APS, 2014.","ama":"Lancaster T, Goddard PA, Blundell SJ, et al. Controlling magnetic order and quantum disorder in molecule-based magnets. Physical Review Letters. 2014;112(20). doi:10.1103/physrevlett.112.207201"},"article_type":"original","quality_controlled":"1","date_published":"2014-05-19T00:00:00Z","doi":"10.1103/physrevlett.112.207201","language":[{"iso":"eng"}],"article_number":"207201","type":"journal_article","abstract":[{"lang":"eng","text":"We investigate the structural and magnetic properties of two molecule-based magnets synthesized from the same starting components. Their different structural motifs promote contrasting exchange pathways and consequently lead to markedly different magnetic ground states. Through examination of their structural and magnetic properties we show that [Cu(pyz)(H2O)(gly)2](ClO4)2 may be considered a quasi-one-dimensional quantum Heisenberg antiferromagnet whereas the related compound [Cu(pyz)(gly)](ClO4), which is formed from dimers of antiferromagnetically interacting Cu2+ spins, remains disordered down to at least 0.03 K in zero field but shows a field-temperature phase diagram reminiscent of that seen in materials showing a Bose-Einstein condensation of magnons."}],"issue":"20","extern":"1","_id":"7072","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2014","title":"Controlling magnetic order and quantum disorder in molecule-based magnets","status":"public","publication_status":"published","publisher":"APS","intvolume":" 112","author":[{"first_name":"T.","last_name":"Lancaster","full_name":"Lancaster, T."},{"full_name":"Goddard, P. A.","last_name":"Goddard","first_name":"P. A."},{"full_name":"Blundell, S. J.","last_name":"Blundell","first_name":"S. J."},{"full_name":"Foronda, F. R.","first_name":"F. R.","last_name":"Foronda"},{"full_name":"Ghannadzadeh, S.","first_name":"S.","last_name":"Ghannadzadeh"},{"full_name":"Möller, J. S.","first_name":"J. S.","last_name":"Möller"},{"full_name":"Baker, P. J.","last_name":"Baker","first_name":"P. J."},{"first_name":"F. L.","last_name":"Pratt","full_name":"Pratt, F. L."},{"full_name":"Baines, C.","first_name":"C.","last_name":"Baines"},{"first_name":"L.","last_name":"Huang","full_name":"Huang, L."},{"full_name":"Wosnitza, J.","last_name":"Wosnitza","first_name":"J."},{"last_name":"McDonald","first_name":"R. D.","full_name":"McDonald, R. D."},{"full_name":"Modic, Kimberly A","last_name":"Modic","first_name":"Kimberly A","orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425"},{"full_name":"Singleton, J.","last_name":"Singleton","first_name":"J."},{"last_name":"Topping","first_name":"C. V.","full_name":"Topping, C. V."},{"full_name":"Beale, T. A. W.","first_name":"T. A. W.","last_name":"Beale"},{"full_name":"Xiao, F.","last_name":"Xiao","first_name":"F."},{"last_name":"Schlueter","first_name":"J. A.","full_name":"Schlueter, J. A."},{"full_name":"Barton, A. M.","last_name":"Barton","first_name":"A. M."},{"last_name":"Cabrera","first_name":"R. D.","full_name":"Cabrera, R. D."},{"last_name":"Carreiro","first_name":"K. E.","full_name":"Carreiro, K. E."},{"full_name":"Tran, H. E.","first_name":"H. E.","last_name":"Tran"},{"full_name":"Manson, J. L.","first_name":"J. L.","last_name":"Manson"}],"date_updated":"2021-01-12T08:11:42Z","date_created":"2019-11-19T13:23:13Z","oa_version":"None","volume":112}]