[{"date_updated":"2023-02-23T12:26:25Z","issue":"3","oa":1,"month":"09","intvolume":"        13","date_published":"2017-09-13T00:00:00Z","year":"2017","license":"https://creativecommons.org/licenses/by-nd/4.0/","date_created":"2018-12-11T11:46:37Z","tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"ddc":["004"],"status":"public","day":"13","volume":13,"related_material":{"record":[{"id":"1610","relation":"earlier_version","status":"public"},{"id":"5438","relation":"earlier_version","status":"public"}]},"oa_version":"Published Version","ec_funded":1,"doi":"10.23638/LMCS-13(3:23)2017","publication":"Logical Methods in Computer Science","file":[{"date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:14:37Z","file_name":"IST-2015-321-v1+1_main.pdf","access_level":"open_access","relation":"main_file","checksum":"08041379ba408d40664f449eb5907a8f","file_size":279071,"creator":"system","file_id":"5090","content_type":"application/pdf"},{"date_created":"2018-12-12T10:14:38Z","date_updated":"2020-07-14T12:46:33Z","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","relation":"main_file","checksum":"08041379ba408d40664f449eb5907a8f","access_level":"open_access","content_type":"application/pdf","file_id":"5091","creator":"system","file_size":279071}],"title":"Edit distance for pushdown automata","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}],"has_accepted_license":"1","publisher":"International Federation of Computational Logic","language":[{"iso":"eng"}],"pubrep_id":"955","publist_id":"7356","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"465","quality_controlled":"1","citation":{"ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation of Computational Logic, 2017.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2017). Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>."},"publication_identifier":{"issn":["18605974"]},"type":"journal_article","file_date_updated":"2020-07-14T12:46:33Z","abstract":[{"text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. ","lang":"eng"}],"scopus_import":1,"project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"},{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"}],"publication_status":"published"},{"status":"public","day":"03","date_created":"2018-12-11T11:46:38Z","tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"ddc":["004"],"volume":13,"oa_version":"Published Version","ec_funded":1,"related_material":{"record":[{"id":"1657","status":"public","relation":"earlier_version"},{"id":"5429","relation":"earlier_version","status":"public"},{"relation":"earlier_version","status":"public","id":"5435"}]},"publication":"Logical Methods in Computer Science","doi":"10.23638/LMCS-13(2:15)2017","oa":1,"issue":"2","date_updated":"2023-02-23T12:26:16Z","article_number":"15","date_published":"2017-07-03T00:00:00Z","intvolume":"        13","month":"07","year":"2017","quality_controlled":"1","_id":"466","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. ","lang":"eng"}],"scopus_import":1,"file_date_updated":"2020-07-14T12:46:33Z","type":"journal_article","publication_identifier":{"issn":["18605974"]},"citation":{"apa":"Chatterjee, K., Křetínská, Z., &#38; Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>","mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>.","ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2. International Federation of Computational Logic, 2017.","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. 2017;13(2). doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>","chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>."},"publication_status":"published","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"701309","call_identifier":"H2020","_id":"2590DB08-B435-11E9-9278-68D0E5697425","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)"}],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Křetínská, Zuzana","first_name":"Zuzana","last_name":"Křetínská"},{"full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"file":[{"file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf","date_created":"2018-12-12T10:18:32Z","date_updated":"2020-07-14T12:46:33Z","content_type":"application/pdf","file_id":"5354","file_size":511832,"creator":"system","checksum":"bfa405385ec6229ad5ead89ab5751639","relation":"main_file","access_level":"open_access"}],"publisher":"International Federation of Computational Logic","has_accepted_license":"1","pubrep_id":"957","language":[{"iso":"eng"}],"publist_id":"7355","department":[{"_id":"KrCh"}]},{"date_created":"2018-12-11T11:46:38Z","status":"public","day":"01","volume":18,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1656"},{"relation":"earlier_version","status":"public","id":"5415"},{"id":"5436","status":"public","relation":"earlier_version"}]},"ec_funded":1,"oa_version":"Preprint","publication":"ACM Transactions on Computational Logic (TOCL)","main_file_link":[{"url":"https://arxiv.org/abs/1606.03598","open_access":"1"}],"doi":"10.1145/3152769","date_updated":"2023-02-23T12:26:19Z","oa":1,"issue":"4","date_published":"2017-12-01T00:00:00Z","intvolume":"        18","month":"12","article_number":"31","year":"2017","external_id":{"arxiv":["1606.03598"]},"_id":"467","quality_controlled":"1","publication_identifier":{"issn":["15293785"]},"citation":{"mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 4, 31, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2017). Nested weighted automata. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2017;18(4). doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 4. ACM, 2017."},"scopus_import":1,"arxiv":1,"abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"type":"journal_article","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"},{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publication_status":"published","title":"Nested weighted automata","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ACM","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"7354"},{"date_updated":"2023-02-23T12:20:26Z","issue":"4","oa":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"month":"07","intvolume":"        36","date_published":"2017-07-01T00:00:00Z","article_number":"103","year":"2017","ddc":["006"],"date_created":"2018-12-11T11:46:39Z","status":"public","day":"01","volume":36,"ec_funded":1,"oa_version":"Published Version","doi":"10.1145/3072959.3073678","publication":"ACM Transactions on Graphics","file":[{"checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","access_level":"open_access","relation":"main_file","creator":"wojtan","file_size":13131683,"file_id":"7359","content_type":"application/pdf","date_updated":"2020-07-14T12:46:34Z","date_created":"2020-01-24T09:32:35Z","file_name":"wavepackets_final.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Water wave packets","author":[{"first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","last_name":"Jeschke","full_name":"Jeschke, Stefan"},{"orcid":"0000-0001-6646-5546","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","full_name":"Wojtan, Christopher J"}],"has_accepted_license":"1","publisher":"ACM","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"Yes (in subscription journal)","publist_id":"7350","department":[{"_id":"ChWo"}],"_id":"470","quality_controlled":"1","citation":{"mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” <i>ACM Transactions on Graphics</i>, vol. 36, no. 4, 103, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3072959.3073678\">10.1145/3072959.3073678</a>.","apa":"Jeschke, S., &#38; Wojtan, C. (2017). Water wave packets. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3072959.3073678\">https://doi.org/10.1145/3072959.3073678</a>","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” <i>ACM Transactions on Graphics</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3072959.3073678\">https://doi.org/10.1145/3072959.3073678</a>.","ama":"Jeschke S, Wojtan C. Water wave packets. <i>ACM Transactions on Graphics</i>. 2017;36(4). doi:<a href=\"https://doi.org/10.1145/3072959.3073678\">10.1145/3072959.3073678</a>","ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” <i>ACM Transactions on Graphics</i>, vol. 36, no. 4. ACM, 2017.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103."},"publication_identifier":{"issn":["07300301"]},"file_date_updated":"2020-07-14T12:46:34Z","type":"journal_article","scopus_import":1,"abstract":[{"lang":"eng","text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios."}],"project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"638176"}],"publication_status":"published"},{"year":"2017","date_published":"2017-05-01T00:00:00Z","month":"05","intvolume":"        18","article_number":"12","date_updated":"2023-02-21T16:48:11Z","oa":1,"issue":"2","publication":"ACM Transactions on Computational Logic (TOCL)","doi":"10.1145/3060139","main_file_link":[{"url":"https://arxiv.org/abs/1504.05739","open_access":"1"}],"related_material":{"record":[{"id":"1234","status":"public","relation":"earlier_version"}]},"ec_funded":1,"oa_version":"Submitted Version","volume":18,"date_created":"2018-12-11T11:46:39Z","day":"01","status":"public","publist_id":"7349","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"publisher":"ACM","author":[{"full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"},{"full_name":"Petrov, Tatjana","first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","orcid":"0000-0002-9041-0905"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Faster statistical model checking for unbounded temporal properties","project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"}],"publication_status":"published","citation":{"chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3060139\">https://doi.org/10.1145/3060139</a>.","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 2. ACM, 2017.","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 18(2), 12.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2017;18(2). doi:<a href=\"https://doi.org/10.1145/3060139\">10.1145/3060139</a>","mla":"Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 2, 12, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3060139\">10.1145/3060139</a>.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/3060139\">https://doi.org/10.1145/3060139</a>"},"publication_identifier":{"issn":["15293785"]},"scopus_import":1,"abstract":[{"text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds. ","lang":"eng"}],"type":"journal_article","_id":"471","quality_controlled":"1"},{"file":[{"file_id":"4758","content_type":"application/pdf","file_size":769296,"creator":"system","relation":"main_file","access_level":"open_access","checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e","file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","date_created":"2018-12-12T10:09:34Z","date_updated":"2020-07-14T12:46:35Z"}],"title":"Planar matchings for weighted straight skeletons","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Therese","last_name":"Biedl","full_name":"Biedl, Therese"},{"orcid":"0000-0002-8871-5814","last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","full_name":"Huber, Stefan"},{"full_name":"Palfrader, Peter","first_name":"Peter","last_name":"Palfrader"}],"has_accepted_license":"1","publisher":"World Scientific Publishing","language":[{"iso":"eng"}],"pubrep_id":"949","department":[{"_id":"HeEd"}],"publist_id":"7338","_id":"481","quality_controlled":"1","citation":{"apa":"Biedl, T., Huber, S., &#38; Palfrader, P. (2017). Planar matchings for weighted straight skeletons. <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218195916600050\">https://doi.org/10.1142/S0218195916600050</a>","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” <i>International Journal of Computational Geometry and Applications</i>, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:<a href=\"https://doi.org/10.1142/S0218195916600050\">10.1142/S0218195916600050</a>.","short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229.","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” <i>International Journal of Computational Geometry and Applications</i>, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","ista":"Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 26(3–4), 211–229.","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. <i>International Journal of Computational Geometry and Applications</i>. 2017;26(3-4):211-229. doi:<a href=\"https://doi.org/10.1142/S0218195916600050\">10.1142/S0218195916600050</a>","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing, 2017. <a href=\"https://doi.org/10.1142/S0218195916600050\">https://doi.org/10.1142/S0218195916600050</a>."},"file_date_updated":"2020-07-14T12:46:35Z","type":"journal_article","abstract":[{"lang":"eng","text":"We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings."}],"scopus_import":1,"publication_status":"published","date_updated":"2023-02-21T16:06:22Z","issue":"3-4","oa":1,"intvolume":"        26","month":"04","date_published":"2017-04-13T00:00:00Z","acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.","year":"2017","page":"211 - 229","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["004","514","516"],"date_created":"2018-12-11T11:46:43Z","status":"public","day":"13","volume":26,"related_material":{"record":[{"id":"10892","relation":"earlier_version","status":"public"}]},"oa_version":"Published Version","doi":"10.1142/S0218195916600050","publication":"International Journal of Computational Geometry and Applications"},{"date_updated":"2021-01-12T08:00:57Z","oa":1,"issue":"3","date_published":"2017-08-25T00:00:00Z","intvolume":"        21","month":"08","year":"2017","page":"739 - 800","date_created":"2018-12-11T11:46:43Z","day":"25","status":"public","volume":21,"ec_funded":1,"oa_version":"Submitted Version","publication":"Advances in Theoretical and Mathematical Physics","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02312"}],"doi":"10.4310/ATMP.2017.v21.n3.a5","author":[{"last_name":"Bourgade","first_name":"Paul","full_name":"Bourgade, Paul"},{"orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"full_name":"Yau, Horng","last_name":"Yau","first_name":"Horng"},{"last_name":"Yin","first_name":"Jun","full_name":"Yin, Jun"}],"title":"Universality for a class of random band matrices","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"International Press","language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"publist_id":"7337","_id":"483","quality_controlled":"1","publication_identifier":{"issn":["10950761"]},"citation":{"apa":"Bourgade, P., Erdös, L., Yau, H., &#38; Yin, J. (2017). Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. International Press. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>","mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>.","ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):739-800. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3. International Press, pp. 739–800, 2017.","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>."},"abstract":[{"lang":"eng","text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices."}],"scopus_import":1,"type":"journal_article","project":[{"call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"}],"publication_status":"published"},{"page":"683 - 738","year":"2017","date_published":"2017-01-01T00:00:00Z","intvolume":"        21","month":"01","date_updated":"2021-01-12T08:00:58Z","oa":1,"issue":"3","publication":"Advances in Theoretical and Mathematical Physics","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.04631"}],"doi":"10.4310/ATMP.2017.v21.n3.a4","ec_funded":1,"oa_version":"Submitted Version","volume":21,"date_created":"2018-12-11T11:46:43Z","day":"01","status":"public","department":[{"_id":"RoSe"}],"publist_id":"7336","language":[{"iso":"eng"}],"publisher":"International Press","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87","first_name":"Phan","full_name":"Nam, Phan"},{"last_name":"Napiórkowski","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin M","full_name":"Napiórkowski, Marcin M"}],"project":[{"call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","publication_identifier":{"issn":["10950761"]},"citation":{"ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3. International Press, pp. 683–738, 2017.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738.","ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):683-738. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>","chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>.","apa":"Nam, P., &#38; Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. <i>Advances in Theoretical and Mathematical Physics</i>. International Press. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>","mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>."},"scopus_import":1,"abstract":[{"lang":"eng","text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β &lt; 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory."}],"type":"journal_article","_id":"484","quality_controlled":"1"},{"date_created":"2018-12-11T11:46:44Z","_id":"485","quality_controlled":"1","day":"01","status":"public","citation":{"ieee":"A. R. Rueda Sanchez <i>et al.</i>, “Single sideband microwave to optical photon conversion-an-electro-optic-realization,” in <i>Optics InfoBase Conference Papers</i>, Waikoloa, HI, United States, 2017, vol. F54.","short":"A.R. Rueda Sanchez, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov, C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, Optics InfoBase Conference Papers, Optica  Publishing Group, 2017.","ista":"Rueda Sanchez AR, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D, Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2017. Single sideband microwave to optical photon conversion-an-electro-optic-realization. Optics InfoBase Conference Papers. NLO: Nonlinear Optics vol. F54, NM3A.1.","ama":"Rueda Sanchez AR, Sedlmeir F, Collodo M, et al. Single sideband microwave to optical photon conversion-an-electro-optic-realization. In: <i>Optics InfoBase Conference Papers</i>. Vol F54. Optica  Publishing Group; 2017. doi:<a href=\"https://doi.org/10.1364/NLO.2017.NM3A.1\">10.1364/NLO.2017.NM3A.1</a>","chicago":"Rueda Sanchez, Alfredo R, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Single Sideband Microwave to Optical Photon Conversion-an-Electro-Optic-Realization.” In <i>Optics InfoBase Conference Papers</i>, Vol. F54. Optica  Publishing Group, 2017. <a href=\"https://doi.org/10.1364/NLO.2017.NM3A.1\">https://doi.org/10.1364/NLO.2017.NM3A.1</a>.","apa":"Rueda Sanchez, A. R., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., … Schwefel, H. (2017). Single sideband microwave to optical photon conversion-an-electro-optic-realization. In <i>Optics InfoBase Conference Papers</i> (Vol. F54). Waikoloa, HI, United States: Optica  Publishing Group. <a href=\"https://doi.org/10.1364/NLO.2017.NM3A.1\">https://doi.org/10.1364/NLO.2017.NM3A.1</a>","mla":"Rueda Sanchez, Alfredo R., et al. “Single Sideband Microwave to Optical Photon Conversion-an-Electro-Optic-Realization.” <i>Optics InfoBase Conference Papers</i>, vol. F54, NM3A.1, Optica  Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1364/NLO.2017.NM3A.1\">10.1364/NLO.2017.NM3A.1</a>."},"publication_identifier":{"isbn":["978-155752820-9"]},"volume":"F54","type":"conference","scopus_import":"1","abstract":[{"text":"We present results on nonlinear electro-optical conversion of microwave radiation into the optical telecommunication band with more than 0.1% photon number conversion efficiency with MHz bandwidth, in a crystalline whispering gallery mode resonator","lang":"eng"}],"oa_version":"None","doi":"10.1364/NLO.2017.NM3A.1","publication_status":"published","publication":"Optics InfoBase Conference Papers","date_updated":"2023-10-17T12:15:38Z","author":[{"full_name":"Rueda Sanchez, Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","first_name":"Alfredo R","orcid":"0000-0001-6249-5860","last_name":"Rueda Sanchez"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"full_name":"Collodo, Michele","first_name":"Michele","last_name":"Collodo"},{"full_name":"Vogl, Ulrich","first_name":"Ulrich","last_name":"Vogl"},{"first_name":"Birgit","last_name":"Stiller","full_name":"Stiller, Birgit"},{"full_name":"Schunk, Gerhard","last_name":"Schunk","first_name":"Gerhard"},{"first_name":"Dmitry","last_name":"Strekalov","full_name":"Strekalov, Dmitry"},{"first_name":"Christoph","last_name":"Marquardt","full_name":"Marquardt, Christoph"},{"full_name":"Fink, Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Painter, Oskar","first_name":"Oskar","last_name":"Painter"},{"full_name":"Leuchs, Gerd","first_name":"Gerd","last_name":"Leuchs"},{"full_name":"Schwefel, Harald","last_name":"Schwefel","first_name":"Harald"}],"title":"Single sideband microwave to optical photon conversion-an-electro-optic-realization","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","date_published":"2017-07-01T00:00:00Z","publisher":"Optica  Publishing Group","article_number":"NM3A.1","language":[{"iso":"eng"}],"year":"2017","article_processing_charge":"No","department":[{"_id":"JoFi"}],"publist_id":"7335","conference":{"location":"Waikoloa, HI, United States","start_date":"2017-07-17","end_date":"2017-07-21","name":"NLO: Nonlinear Optics"}},{"_id":"486","quality_controlled":"1","publication_identifier":{"issn":["07300301"]},"citation":{"ista":"Elek O, Sumin D, Zhang R, Weyrich T, Myszkowski K, Bickel B, Wilkie A, Krivanek J. 2017. Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. 36(6), 241.","short":"O. Elek, D. Sumin, R. Zhang, T. Weyrich, K. Myszkowski, B. Bickel, A. Wilkie, J. Krivanek, ACM Transactions on Graphics 36 (2017).","ieee":"O. Elek <i>et al.</i>, “Scattering-aware texture reproduction for 3D printing,” <i>ACM Transactions on Graphics</i>, vol. 36, no. 6. ACM, 2017.","ama":"Elek O, Sumin D, Zhang R, et al. Scattering-aware texture reproduction for 3D printing. <i>ACM Transactions on Graphics</i>. 2017;36(6). doi:<a href=\"https://doi.org/10.1145/3130800.3130890\">10.1145/3130800.3130890</a>","chicago":"Elek, Oskar, Denis Sumin, Ran Zhang, Tim Weyrich, Karol Myszkowski, Bernd Bickel, Alexander Wilkie, and Jaroslav Krivanek. “Scattering-Aware Texture Reproduction for 3D Printing.” <i>ACM Transactions on Graphics</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3130800.3130890\">https://doi.org/10.1145/3130800.3130890</a>.","apa":"Elek, O., Sumin, D., Zhang, R., Weyrich, T., Myszkowski, K., Bickel, B., … Krivanek, J. (2017). Scattering-aware texture reproduction for 3D printing. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3130800.3130890\">https://doi.org/10.1145/3130800.3130890</a>","mla":"Elek, Oskar, et al. “Scattering-Aware Texture Reproduction for 3D Printing.” <i>ACM Transactions on Graphics</i>, vol. 36, no. 6, 241, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3130800.3130890\">10.1145/3130800.3130890</a>."},"scopus_import":1,"abstract":[{"text":"Color texture reproduction in 3D printing commonly ignores volumetric light transport (cross-talk) between surface points on a 3D print. Such light diffusion leads to significant blur of details and color bleeding, and is particularly severe for highly translucent resin-based print materials. Given their widely varying scattering properties, this cross-talk between surface points strongly depends on the internal structure of the volume surrounding each surface point. Existing scattering-aware methods use simplified models for light diffusion, and often accept the visual blur as an immutable property of the print medium. In contrast, our work counteracts heterogeneous scattering to obtain the impression of a crisp albedo texture on top of the 3D print, by optimizing for a fully volumetric material distribution that preserves the target appearance. Our method employs an efficient numerical optimizer on top of a general Monte-Carlo simulation of heterogeneous scattering, supported by a practical calibration procedure to obtain scattering parameters from a given set of printer materials. Despite the inherent translucency of the medium, we reproduce detailed surface textures on 3D prints. We evaluate our system using a commercial, five-tone 3D print process and compare against the printer’s native color texturing mode, demonstrating that our method preserves high-frequency features well without having to compromise on color gamut.","lang":"eng"}],"type":"journal_article","file_date_updated":"2020-07-14T12:46:35Z","project":[{"grant_number":"642841","call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425","name":"Distributed 3D Object Design"},{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","call_identifier":"H2020"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"}],"publication_status":"published","title":"Scattering-aware texture reproduction for 3D printing","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Elek, Oskar","first_name":"Oskar","last_name":"Elek"},{"full_name":"Sumin, Denis","first_name":"Denis","last_name":"Sumin"},{"first_name":"Ran","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","last_name":"Zhang","orcid":"0000-0002-3808-281X","full_name":"Zhang, Ran"},{"full_name":"Weyrich, Tim","last_name":"Weyrich","first_name":"Tim"},{"full_name":"Myszkowski, Karol","first_name":"Karol","last_name":"Myszkowski"},{"full_name":"Bickel, Bernd","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","last_name":"Bickel"},{"last_name":"Wilkie","first_name":"Alexander","full_name":"Wilkie, Alexander"},{"full_name":"Krivanek, Jaroslav","first_name":"Jaroslav","last_name":"Krivanek"}],"file":[{"date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:10:46Z","file_name":"IST-2018-1052-v1+1_ElekSumin2017SGA.pdf","access_level":"open_access","checksum":"48386fa6956c3645fc89594dc898b147","relation":"main_file","content_type":"application/pdf","file_id":"4836","file_size":107349827,"creator":"system"},{"date_updated":"2020-07-14T12:46:35Z","date_created":"2019-12-16T14:48:57Z","file_name":"ElekSumin2017SGA_reduced_file_size.pdf","access_level":"open_access","checksum":"21c89c28fb8d70f6602f752bf997aa0f","relation":"main_file","content_type":"application/pdf","file_id":"7189","file_size":4683145,"creator":"bbickel"}],"has_accepted_license":"1","publisher":"ACM","language":[{"iso":"eng"}],"article_type":"original","pubrep_id":"1052","article_processing_charge":"No","publist_id":"7334","department":[{"_id":"BeBi"}],"date_created":"2018-12-11T11:46:44Z","ddc":["003","000","005"],"status":"public","day":"20","volume":36,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8386"}]},"ec_funded":1,"oa_version":"Submitted Version","publication":"ACM Transactions on Graphics","doi":"10.1145/3130800.3130890","date_updated":"2023-09-07T13:11:15Z","oa":1,"issue":"6","date_published":"2017-11-20T00:00:00Z","month":"11","intvolume":"        36","article_number":"241","year":"2017"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Towards unlicensed cellular networks in TV white spaces","author":[{"last_name":"Baig","first_name":"Ghufran","full_name":"Baig, Ghufran"},{"first_name":"Bozidar","last_name":"Radunovic","full_name":"Radunovic, Bozidar"},{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Balkwill","first_name":"Matthew","full_name":"Balkwill, Matthew"},{"full_name":"Karagiannis, Thomas","first_name":"Thomas","last_name":"Karagiannis"},{"last_name":"Qiu","first_name":"Lili","full_name":"Qiu, Lili"}],"date_updated":"2023-02-23T12:21:11Z","publisher":"ACM","date_published":"2017-11-28T00:00:00Z","month":"11","year":"2017","language":[{"iso":"eng"}],"publist_id":"7333","department":[{"_id":"DaAl"}],"conference":{"name":"CoNEXT: Conference on emerging Networking EXperiments and Technologies","start_date":"2017-12-12","end_date":"2017-12-15","location":"Incheon, South Korea"},"page":"2 - 14","day":"28","quality_controlled":"1","status":"public","_id":"487","date_created":"2018-12-11T11:46:45Z","scopus_import":1,"abstract":[{"lang":"eng","text":"In this paper we study network architecture for unlicensed cellular networking for outdoor coverage in TV white spaces. The main technology proposed for TV white spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af is originally designed for improved indoor propagation. We show that long links, typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed terminal, and significantly reduce its efficiency. Instead, we propose CellFi, an alternative architecture based on LTE. LTE is designed for long-range coverage and throughput efficiency, but it is also designed to operate in tightly controlled and centrally managed networks. CellFi overcomes these problems by designing an LTE-compatible spectrum database component, mandatory for TV white space networking, and introducing an interference management component for distributed coordination. CellFi interference management is compatible with existing LTE mechanisms, requires no explicit communication between base stations, and is more efficient than CSMA for long links. We evaluate our design through extensive real world evaluation on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af, it increases coverage by 40% and reduces median flow completion times by 2.3x."}],"type":"conference","citation":{"mla":"Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.” <i>Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies</i>, ACM, 2017, pp. 2–14, doi:<a href=\"https://doi.org/10.1145/3143361.3143367\">10.1145/3143361.3143367</a>.","apa":"Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., &#38; Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In <i>Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies</i> (pp. 2–14). Incheon, South Korea: ACM. <a href=\"https://doi.org/10.1145/3143361.3143367\">https://doi.org/10.1145/3143361.3143367</a>","chicago":"Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill, Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV White Spaces.” In <i>Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies</i>, 2–14. ACM, 2017. <a href=\"https://doi.org/10.1145/3143361.3143367\">https://doi.org/10.1145/3143361.3143367</a>.","ama":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards unlicensed cellular networks in TV white spaces. In: <i>Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies</i>. ACM; 2017:2-14. doi:<a href=\"https://doi.org/10.1145/3143361.3143367\">10.1145/3143361.3143367</a>","short":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu, in:, Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14.","ista":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. 2017. Towards unlicensed cellular networks in TV white spaces. Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies. CoNEXT: Conference on emerging Networking EXperiments and Technologies, 2–14.","ieee":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L. Qiu, “Towards unlicensed cellular networks in TV white spaces,” in <i>Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies</i>, Incheon, South Korea, 2017, pp. 2–14."},"publication_identifier":{"isbn":["978-145035422-6"]},"oa_version":"None","publication":"Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies","publication_status":"published","doi":"10.1145/3143361.3143367"},{"publication_status":"published","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"file_date_updated":"2020-07-14T12:46:36Z","type":"journal_article","abstract":[{"text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively. ","lang":"eng"}],"scopus_import":1,"citation":{"chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” <i>Scientific Reports</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/s41598-017-00107-w\">https://doi.org/10.1038/s41598-017-00107-w</a>.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected population structures: Comets beat stars. <i>Scientific Reports</i>. 2017;7(1). doi:<a href=\"https://doi.org/10.1038/s41598-017-00107-w\">10.1038/s41598-017-00107-w</a>","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” <i>Scientific Reports</i>, vol. 7, no. 1. Nature Publishing Group, 2017.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.","mla":"Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” <i>Scientific Reports</i>, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/s41598-017-00107-w\">10.1038/s41598-017-00107-w</a>.","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41598-017-00107-w\">https://doi.org/10.1038/s41598-017-00107-w</a>"},"publication_identifier":{"issn":["20452322"]},"quality_controlled":"1","_id":"512","department":[{"_id":"KrCh"}],"publist_id":"7307","article_processing_charge":"No","pubrep_id":"938","language":[{"iso":"eng"}],"publisher":"Nature Publishing Group","has_accepted_license":"1","file":[{"date_created":"2018-12-12T10:18:35Z","date_updated":"2020-07-14T12:46:36Z","file_name":"IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf","checksum":"7d05cbdd914e194a019c0f91fb64e9a8","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5357","creator":"system","file_size":1536783}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Amplification on undirected population structures: Comets beat stars","author":[{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"doi":"10.1038/s41598-017-00107-w","publication":"Scientific Reports","oa_version":"Published Version","ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5449"}]},"volume":7,"day":"06","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["004"],"date_created":"2018-12-11T11:46:53Z","year":"2017","article_number":"82","month":"03","intvolume":"         7","date_published":"2017-03-06T00:00:00Z","issue":"1","oa":1,"date_updated":"2023-02-23T12:26:57Z"},{"publication":"Physical Review Fluids","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.02619"}],"publication_status":"published","doi":"10.1103/PhysRevFluids.2.043904","oa_version":"Preprint","scopus_import":1,"abstract":[{"lang":"eng","text":"We present an experimental setup that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We obtain experimental results in the transitional regime for this flow. Using flow visualization, we characterize the subcritical transition to turbulence in Couette-Poiseuille flow and show the existence of turbulent spots generated by a permanent perturbation. Due to the zero mean advection velocity of the base profile, these turbulent structures are nearly stationary. We distinguish two regions of the turbulent spot: the active turbulent core, which is characterized by waviness of the streaks similar to traveling waves, and the surrounding region, which includes in addition the weak undisturbed streaks and oblique waves at the laminar-turbulent interface. We also study the dependence of the size of these two regions on Reynolds number. Finally, we show that the traveling waves move in the downstream (Poiseuille) direction."}],"type":"journal_article","volume":2,"citation":{"apa":"Klotz, L., Lemoult, G. M., Frontczak, I., Tuckerman, L., &#38; Wesfreid, J. (2017). Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. <i>Physical Review Fluids</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevFluids.2.043904\">https://doi.org/10.1103/PhysRevFluids.2.043904</a>","mla":"Klotz, Lukasz, et al. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” <i>Physical Review Fluids</i>, vol. 2, no. 4, 043904, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevFluids.2.043904\">10.1103/PhysRevFluids.2.043904</a>.","ista":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. 2017. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2(4), 043904.","ieee":"L. Klotz, G. M. Lemoult, I. Frontczak, L. Tuckerman, and J. Wesfreid, “Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence,” <i>Physical Review Fluids</i>, vol. 2, no. 4. American Physical Society, 2017.","short":"L. Klotz, G.M. Lemoult, I. Frontczak, L. Tuckerman, J. Wesfreid, Physical Review Fluids 2 (2017).","ama":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. <i>Physical Review Fluids</i>. 2017;2(4). doi:<a href=\"https://doi.org/10.1103/PhysRevFluids.2.043904\">10.1103/PhysRevFluids.2.043904</a>","chicago":"Klotz, Lukasz, Grégoire M Lemoult, Idalia Frontczak, Laurette Tuckerman, and José Wesfreid. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” <i>Physical Review Fluids</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevFluids.2.043904\">https://doi.org/10.1103/PhysRevFluids.2.043904</a>."},"quality_controlled":"1","status":"public","day":"01","date_created":"2018-12-11T11:46:54Z","_id":"513","department":[{"_id":"BjHo"}],"publist_id":"7306","year":"2017","language":[{"iso":"eng"}],"publisher":"American Physical Society","article_number":"043904","date_published":"2017-04-01T00:00:00Z","intvolume":"         2","month":"04","title":"Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence","author":[{"first_name":"Lukasz","id":"2C9AF1C2-F248-11E8-B48F-1D18A9856A87","last_name":"Klotz","orcid":"0000-0003-1740-7635","full_name":"Klotz, Lukasz"},{"first_name":"Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87","last_name":"Lemoult","full_name":"Lemoult, Grégoire M"},{"first_name":"Idalia","last_name":"Frontczak","full_name":"Frontczak, Idalia"},{"last_name":"Tuckerman","first_name":"Laurette","full_name":"Tuckerman, Laurette"},{"first_name":"José","last_name":"Wesfreid","full_name":"Wesfreid, José"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"issue":"4","date_updated":"2021-01-12T08:01:16Z"},{"intvolume":"         8","month":"07","date_published":"2017-07-01T00:00:00Z","article_number":"16032","date_updated":"2021-01-12T08:01:16Z","oa":1,"year":"2017","volume":8,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T11:46:54Z","ddc":["571"],"day":"01","status":"public","doi":"10.1038/ncomms16032","publication":"Nature Communications","oa_version":"Published Version","has_accepted_license":"1","publisher":"Nature Publishing Group","file":[{"date_updated":"2020-07-14T12:46:36Z","date_created":"2018-12-12T10:14:31Z","file_name":"IST-2018-937-v1+1_2017_Stella_Activity_dependent.pdf","relation":"main_file","checksum":"76d8a2b72a58e56adb410ec37dfa7eee","access_level":"open_access","file_size":2948357,"creator":"system","content_type":"application/pdf","file_id":"5083"}],"author":[{"first_name":"Jean","last_name":"Simonnet","full_name":"Simonnet, Jean"},{"full_name":"Nassar, Mérie","last_name":"Nassar","first_name":"Mérie"},{"id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","first_name":"Federico","last_name":"Stella","orcid":"0000-0001-9439-3148","full_name":"Stella, Federico"},{"full_name":"Cohen, Ivan","last_name":"Cohen","first_name":"Ivan"},{"full_name":"Mathon, Bertrand","first_name":"Bertrand","last_name":"Mathon"},{"orcid":"0000-0001-7237-5109","last_name":"Boccara","id":"3FC06552-F248-11E8-B48F-1D18A9856A87","first_name":"Charlotte","full_name":"Boccara, Charlotte"},{"first_name":"Richard","last_name":"Miles","full_name":"Miles, Richard"},{"full_name":"Fricker, Desdemona","first_name":"Desdemona","last_name":"Fricker"}],"title":"Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7305","department":[{"_id":"JoCs"}],"language":[{"iso":"eng"}],"pubrep_id":"937","publication_identifier":{"issn":["20411723"]},"citation":{"ama":"Simonnet J, Nassar M, Stella F, et al. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. <i>Nature Communications</i>. 2017;8. doi:<a href=\"https://doi.org/10.1038/ncomms16032\">10.1038/ncomms16032</a>","short":"J. Simonnet, M. Nassar, F. Stella, I. Cohen, B. Mathon, C.N. Boccara, R. Miles, D. Fricker, Nature Communications 8 (2017).","ieee":"J. Simonnet <i>et al.</i>, “Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum,” <i>Nature Communications</i>, vol. 8. Nature Publishing Group, 2017.","ista":"Simonnet J, Nassar M, Stella F, Cohen I, Mathon B, Boccara CN, Miles R, Fricker D. 2017. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 8, 16032.","chicago":"Simonnet, Jean, Mérie Nassar, Federico Stella, Ivan Cohen, Bertrand Mathon, Charlotte N. Boccara, Richard Miles, and Desdemona Fricker. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” <i>Nature Communications</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/ncomms16032\">https://doi.org/10.1038/ncomms16032</a>.","apa":"Simonnet, J., Nassar, M., Stella, F., Cohen, I., Mathon, B., Boccara, C. N., … Fricker, D. (2017). Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms16032\">https://doi.org/10.1038/ncomms16032</a>","mla":"Simonnet, Jean, et al. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” <i>Nature Communications</i>, vol. 8, 16032, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/ncomms16032\">10.1038/ncomms16032</a>."},"file_date_updated":"2020-07-14T12:46:36Z","type":"journal_article","scopus_import":1,"abstract":[{"lang":"eng","text":"Orientation in space is represented in specialized brain circuits. Persistent head direction signals are transmitted from anterior thalamus to the presubiculum, but the identity of the presubicular target neurons, their connectivity and function in local microcircuits are unknown. Here, we examine how thalamic afferents recruit presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic interactions between these cells. Pyramidal neuron activation of Martinotti cells in superficial layers is strongly facilitating such that high-frequency head directional stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback plays a dual role: precisely timed spikes may not inhibit the firing of in-tune head direction cells, while exerting lateral inhibition. Autonomous attractor dynamics emerge from a modelled network implementing wiring motifs and timing sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop. This inhibitory microcircuit is therefore tuned to refine and maintain head direction information in the presubiculum."}],"_id":"514","quality_controlled":"1","publication_status":"published"},{"file":[{"file_name":"29893_2_merged_1501257589_red.pdf","date_created":"2019-11-07T12:51:07Z","date_updated":"2020-07-14T12:46:36Z","file_id":"6993","content_type":"application/pdf","creator":"lsazanov","file_size":4118385,"checksum":"9bc7e8c41b43636dd7566289e511f096","access_level":"open_access","relation":"main_file"}],"title":"Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Letts, James A","orcid":"0000-0002-9864-3586","last_name":"Letts","first_name":"James A","id":"322DA418-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sazanov","orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","full_name":"Sazanov, Leonid A"}],"has_accepted_license":"1","publisher":"Nature Publishing Group","language":[{"iso":"eng"}],"article_type":"original","department":[{"_id":"LeSa"}],"publist_id":"7304","_id":"515","quality_controlled":"1","citation":{"mla":"Letts, James A., and Leonid A. Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” <i>Nature Structural and Molecular Biology</i>, vol. 24, no. 10, Nature Publishing Group, 2017, pp. 800–08, doi:<a href=\"https://doi.org/10.1038/nsmb.3460\">10.1038/nsmb.3460</a>.","apa":"Letts, J. A., &#38; Sazanov, L. A. (2017). Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. <i>Nature Structural and Molecular Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nsmb.3460\">https://doi.org/10.1038/nsmb.3460</a>","chicago":"Letts, James A, and Leonid A Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” <i>Nature Structural and Molecular Biology</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/nsmb.3460\">https://doi.org/10.1038/nsmb.3460</a>.","ama":"Letts JA, Sazanov LA. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. <i>Nature Structural and Molecular Biology</i>. 2017;24(10):800-808. doi:<a href=\"https://doi.org/10.1038/nsmb.3460\">10.1038/nsmb.3460</a>","ieee":"J. A. Letts and L. A. Sazanov, “Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain,” <i>Nature Structural and Molecular Biology</i>, vol. 24, no. 10. Nature Publishing Group, pp. 800–808, 2017.","ista":"Letts JA, Sazanov LA. 2017. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 24(10), 800–808.","short":"J.A. Letts, L.A. Sazanov, Nature Structural and Molecular Biology 24 (2017) 800–808."},"publication_identifier":{"issn":["15459993"]},"file_date_updated":"2020-07-14T12:46:36Z","type":"journal_article","abstract":[{"text":"The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the inner mitochondrial membrane is composed of five large protein complexes, named CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome), as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the assembly and function of the SCs. Here we review and compare these recent studies and discuss how they have advanced our understanding of mitochondrial electron transport.","lang":"eng"}],"scopus_import":1,"project":[{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","_id":"2590DB08-B435-11E9-9278-68D0E5697425","grant_number":"701309","call_identifier":"H2020"}],"publication_status":"published","date_updated":"2021-01-12T08:01:17Z","issue":"10","oa":1,"intvolume":"        24","month":"10","date_published":"2017-10-05T00:00:00Z","year":"2017","page":"800 - 808","date_created":"2018-12-11T11:46:54Z","ddc":["572"],"status":"public","day":"05","volume":24,"ec_funded":1,"oa_version":"Submitted Version","doi":"10.1038/nsmb.3460","publication":"Nature Structural and Molecular Biology"},{"volume":6,"pmid":1,"day":"17","status":"public","date_created":"2018-12-11T11:46:56Z","publication":"ACS Synthetic Biology","doi":"10.1021/acssynbio.6b00235","oa_version":"None","date_published":"2017-03-17T00:00:00Z","month":"03","intvolume":"         6","issue":"3","date_updated":"2021-01-12T08:01:21Z","external_id":{"pmid":["27936615"]},"page":"395 - 401","year":"2017","abstract":[{"text":"Cyanobacteria are mostly engineered to be sustainable cell-factories by genetic manipulations alone. Here, by modulating the concentration of allosteric effectors, we focus on increasing product formation without further burdening the cells with increased expression of enzymes. Resorting to a novel 96-well microplate cultivation system for cyanobacteria, and using lactate-producing strains of Synechocystis PCC6803 expressing different l-lactate dehydrogenases (LDH), we titrated the effect of 2,5-anhydro-mannitol supplementation. The latter acts in cells as a nonmetabolizable analogue of fructose 1,6-bisphosphate, a known allosteric regulator of one of the tested LDHs. In this strain (SAA023), we achieved over 2-fold increase of lactate productivity. Furthermore, we observed that as carbon is increasingly deviated during growth toward product formation, there is an increased fixation rate in the population of spontaneous mutants harboring an impaired production pathway. This is a challenge in the development of green cell factories, which may be countered by the incorporation in biotechnological processes of strategies such as the one pioneered here.","lang":"eng"}],"scopus_import":1,"type":"journal_article","publication_identifier":{"issn":["21615063"]},"citation":{"chicago":"Du, Wei, Andreas Angermayr, Joeri Jongbloets, Douwe Molenaar, Herwig Bachmann, Klaas Hellingwerf, and Filipe Branco Dos Santos. “Nonhierarchical Flux Regulation Exposes the Fitness Burden Associated with Lactate Production in Synechocystis Sp. PCC6803.” <i>ACS Synthetic Biology</i>. American Chemical Society, 2017. <a href=\"https://doi.org/10.1021/acssynbio.6b00235\">https://doi.org/10.1021/acssynbio.6b00235</a>.","ama":"Du W, Angermayr A, Jongbloets J, et al. Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. <i>ACS Synthetic Biology</i>. 2017;6(3):395-401. doi:<a href=\"https://doi.org/10.1021/acssynbio.6b00235\">10.1021/acssynbio.6b00235</a>","short":"W. Du, A. Angermayr, J. Jongbloets, D. Molenaar, H. Bachmann, K. Hellingwerf, F. Branco Dos Santos, ACS Synthetic Biology 6 (2017) 395–401.","ieee":"W. Du <i>et al.</i>, “Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803,” <i>ACS Synthetic Biology</i>, vol. 6, no. 3. American Chemical Society, pp. 395–401, 2017.","ista":"Du W, Angermayr A, Jongbloets J, Molenaar D, Bachmann H, Hellingwerf K, Branco Dos Santos F. 2017. Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic Biology. 6(3), 395–401.","mla":"Du, Wei, et al. “Nonhierarchical Flux Regulation Exposes the Fitness Burden Associated with Lactate Production in Synechocystis Sp. PCC6803.” <i>ACS Synthetic Biology</i>, vol. 6, no. 3, American Chemical Society, 2017, pp. 395–401, doi:<a href=\"https://doi.org/10.1021/acssynbio.6b00235\">10.1021/acssynbio.6b00235</a>.","apa":"Du, W., Angermayr, A., Jongbloets, J., Molenaar, D., Bachmann, H., Hellingwerf, K., &#38; Branco Dos Santos, F. (2017). Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. <i>ACS Synthetic Biology</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acssynbio.6b00235\">https://doi.org/10.1021/acssynbio.6b00235</a>"},"quality_controlled":"1","_id":"520","publication_status":"published","publisher":"American Chemical Society","title":"Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Du, Wei","last_name":"Du","first_name":"Wei"},{"orcid":"0000-0001-8619-2223","last_name":"Angermayr","id":"4677C796-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Angermayr, Andreas"},{"first_name":"Joeri","last_name":"Jongbloets","full_name":"Jongbloets, Joeri"},{"first_name":"Douwe","last_name":"Molenaar","full_name":"Molenaar, Douwe"},{"first_name":"Herwig","last_name":"Bachmann","full_name":"Bachmann, Herwig"},{"last_name":"Hellingwerf","first_name":"Klaas","full_name":"Hellingwerf, Klaas"},{"last_name":"Branco Dos Santos","first_name":"Filipe","full_name":"Branco Dos Santos, Filipe"}],"publist_id":"7298","department":[{"_id":"ToBo"}],"article_type":"letter_note","language":[{"iso":"eng"}]},{"date_updated":"2021-01-12T08:01:21Z","title":"Higson compactification and dimension raising","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Austin","first_name":"Kyle","full_name":"Austin, Kyle"},{"full_name":"Virk, Ziga","last_name":"Virk","id":"2E36B656-F248-11E8-B48F-1D18A9856A87","first_name":"Ziga"}],"month":"01","intvolume":"       215","date_published":"2017-01-01T00:00:00Z","publisher":"Elsevier","language":[{"iso":"eng"}],"year":"2017","page":"45 - 57","publist_id":"7299","department":[{"_id":"HeEd"}],"date_created":"2018-12-11T11:46:56Z","_id":"521","quality_controlled":"1","day":"01","status":"public","citation":{"apa":"Austin, K., &#38; Virk, Z. (2017). Higson compactification and dimension raising. <i>Topology and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">https://doi.org/10.1016/j.topol.2016.10.005</a>","mla":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” <i>Topology and Its Applications</i>, vol. 215, Elsevier, 2017, pp. 45–57, doi:<a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">10.1016/j.topol.2016.10.005</a>.","ieee":"K. Austin and Z. Virk, “Higson compactification and dimension raising,” <i>Topology and its Applications</i>, vol. 215. Elsevier, pp. 45–57, 2017.","short":"K. Austin, Z. Virk, Topology and Its Applications 215 (2017) 45–57.","ista":"Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology and its Applications. 215, 45–57.","ama":"Austin K, Virk Z. Higson compactification and dimension raising. <i>Topology and its Applications</i>. 2017;215:45-57. doi:<a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">10.1016/j.topol.2016.10.005</a>","chicago":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” <i>Topology and Its Applications</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">https://doi.org/10.1016/j.topol.2016.10.005</a>."},"publication_identifier":{"issn":["01668641"]},"volume":215,"type":"journal_article","abstract":[{"lang":"eng","text":"Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension."}],"oa_version":"Submitted Version","doi":"10.1016/j.topol.2016.10.005","main_file_link":[{"url":"https://arxiv.org/abs/1608.03954v1","open_access":"1"}],"publication_status":"published","publication":"Topology and its Applications"},{"publication":"Discrete & Computational Geometry","doi":"10.1007/s00454-017-9900-0","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.07907"}],"oa_version":"Preprint","related_material":{"record":[{"id":"1379","status":"public","relation":"earlier_version"}]},"volume":58,"day":"09","status":"public","date_created":"2018-12-11T11:47:01Z","page":"871 - 888","external_id":{"arxiv":["1602.07907"]},"year":"2017","date_published":"2017-06-09T00:00:00Z","intvolume":"        58","month":"06","oa":1,"issue":"4","date_updated":"2023-02-21T17:01:34Z","publication_status":"published","scopus_import":1,"abstract":[{"lang":"eng","text":"We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case."}],"arxiv":1,"type":"journal_article","publication_identifier":{"issn":["01795376"]},"citation":{"mla":"Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.” <i>Discrete &#38; Computational Geometry</i>, vol. 58, no. 4, Springer, 2017, pp. 871–88, doi:<a href=\"https://doi.org/10.1007/s00454-017-9900-0\">10.1007/s00454-017-9900-0</a>.","apa":"Burton, B., de Mesmay, A. N., &#38; Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-017-9900-0\">https://doi.org/10.1007/s00454-017-9900-0</a>","chicago":"Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00454-017-9900-0\">https://doi.org/10.1007/s00454-017-9900-0</a>.","ieee":"B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” <i>Discrete &#38; Computational Geometry</i>, vol. 58, no. 4. Springer, pp. 871–888, 2017.","ista":"Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete &#38; Computational Geometry. 58(4), 871–888.","short":"B. Burton, A.N. de Mesmay, U. Wagner, Discrete &#38; Computational Geometry 58 (2017) 871–888.","ama":"Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds. <i>Discrete &#38; Computational Geometry</i>. 2017;58(4):871-888. doi:<a href=\"https://doi.org/10.1007/s00454-017-9900-0\">10.1007/s00454-017-9900-0</a>"},"quality_controlled":"1","_id":"534","publist_id":"7283","department":[{"_id":"UlWa"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"Springer","title":"Finding non-orientable surfaces in 3-Manifolds","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Burton","first_name":"Benjamin","full_name":"Burton, Benjamin"},{"id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","first_name":"Arnaud N","last_name":"De Mesmay","full_name":"De Mesmay, Arnaud N"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}]},{"publication_status":"published","project":[{"grant_number":"303564","call_identifier":"FP7","_id":"25548C20-B435-11E9-9278-68D0E5697425","name":"Microbial Ion Channels for Synthetic Neurobiology"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","name":"Molecular Drug Targets","grant_number":"W1232-B24","call_identifier":"FWF"}],"type":"journal_article","file_date_updated":"2020-07-14T12:46:39Z","abstract":[{"text":"Optogenetik und Photopharmakologie ermöglichen präzise räumliche und zeitliche Kontrolle von Proteinwechselwirkung und -funktion in Zellen und Tieren. Optogenetische Methoden, die auf grünes Licht ansprechen und zum Trennen von Proteinkomplexen geeignet sind, sind nichtweitläufig verfügbar, würden jedoch mehrfarbige Experimente zur Beantwortung von biologischen Fragestellungen ermöglichen. Hier demonstrieren wir die Verwendung von Cobalamin(Vitamin B12)-bindenden Domänen von bakteriellen CarH-Transkriptionsfaktoren zur Grünlicht-induzierten Dissoziation von Rezeptoren. Fusioniert mit dem Fibroblasten-W achstumsfaktor-Rezeptor 1 führten diese im Dunkeln in kultivierten Zellen zu Signalaktivität durch Oligomerisierung, welche durch Beleuchten umgehend aufgehoben wurde. In Zebrafischembryonen, die einen derartigen Rezeptor exprimieren, ermöglichte grünes Licht die Kontrolle über abnormale Signalaktivität während der Embryonalentwicklung. ","lang":"ger"}],"citation":{"apa":"Kainrath, S., Stadler, M., Gschaider-Reichhart, E., Distel, M., &#38; Janovjak, H. L. (2017). Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. <i>Angewandte Chemie</i>. Wiley. <a href=\"https://doi.org/10.1002/ange.201611998\">https://doi.org/10.1002/ange.201611998</a>","mla":"Kainrath, Stephanie, et al. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” <i>Angewandte Chemie</i>, vol. 129, no. 16, Wiley, 2017, pp. 4679–82, doi:<a href=\"https://doi.org/10.1002/ange.201611998\">10.1002/ange.201611998</a>.","ieee":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, and H. L. Janovjak, “Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen,” <i>Angewandte Chemie</i>, vol. 129, no. 16. Wiley, pp. 4679–4682, 2017.","ista":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. 2017. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 129(16), 4679–4682.","short":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, H.L. Janovjak, Angewandte Chemie 129 (2017) 4679–4682.","ama":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. <i>Angewandte Chemie</i>. 2017;129(16):4679-4682. doi:<a href=\"https://doi.org/10.1002/ange.201611998\">10.1002/ange.201611998</a>","chicago":"Kainrath, Stephanie, Manuela Stadler, Eva Gschaider-Reichhart, Martin Distel, and Harald L Janovjak. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” <i>Angewandte Chemie</i>. Wiley, 2017. <a href=\"https://doi.org/10.1002/ange.201611998\">https://doi.org/10.1002/ange.201611998</a>."},"quality_controlled":"1","_id":"538","publist_id":"7279","department":[{"_id":"CaGu"},{"_id":"HaJa"}],"pubrep_id":"932","language":[{"iso":"eng"}],"publisher":"Wiley","has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T10:13:24Z","file_name":"IST-2018-932-v1+1_Kainrath_et_al-2017-Angewandte_Chemie.pdf","access_level":"open_access","relation":"main_file","checksum":"d66fee867e7cdbfa3fe276c2fb0778bb","creator":"system","file_size":1668557,"content_type":"application/pdf","file_id":"5007"}],"title":"Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen","author":[{"last_name":"Kainrath","first_name":"Stephanie","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","full_name":"Kainrath, Stephanie"},{"full_name":"Stadler, Manuela","last_name":"Stadler","first_name":"Manuela"},{"first_name":"Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","last_name":"Gschaider-Reichhart","orcid":"0000-0002-7218-7738","full_name":"Gschaider-Reichhart, Eva"},{"last_name":"Distel","first_name":"Martin","full_name":"Distel, Martin"},{"full_name":"Janovjak, Harald L","first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","orcid":"0000-0002-8023-9315"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1002/ange.201611998","publication":"Angewandte Chemie","oa_version":"Published Version","ec_funded":1,"volume":129,"status":"public","day":"20","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["571"],"date_created":"2018-12-11T11:47:02Z","page":"4679 - 4682","year":"2017","month":"05","intvolume":"       129","date_published":"2017-05-20T00:00:00Z","issue":"16","oa":1,"date_updated":"2021-01-12T08:01:33Z"},{"day":"01","status":"public","date_created":"2018-12-11T11:47:03Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["576","616"],"volume":13,"oa_version":"Published Version","doi":"10.1371/journal.ppat.1006758","publication":"PLoS Pathogens","issue":"12","oa":1,"date_updated":"2021-01-12T08:01:48Z","article_number":"e1006758","month":"12","intvolume":"        13","date_published":"2017-12-01T00:00:00Z","year":"2017","quality_controlled":"1","_id":"540","type":"journal_article","file_date_updated":"2020-07-14T12:46:44Z","abstract":[{"text":"RNA-dependent RNA polymerases (RdRps) play a key role in the life cycle of RNA viruses and impact their immunobiology. The arenavirus lymphocytic choriomeningitis virus (LCMV) strain Clone 13 provides a benchmark model for studying chronic infection. A major genetic determinant for its ability to persist maps to a single amino acid exchange in the viral L protein, which exhibits RdRp activity, yet its functional consequences remain elusive. To unravel the L protein interactions with the host proteome, we engineered infectious L protein-tagged LCMV virions by reverse genetics. A subsequent mass-spectrometric analysis of L protein pulldowns from infected human cells revealed a comprehensive network of interacting host proteins. The obtained LCMV L protein interactome was bioinformatically integrated with known host protein interactors of RdRps from other RNA viruses, emphasizing interconnected modules of human proteins. Functional characterization of selected interactors highlighted proviral (DDX3X) as well as antiviral (NKRF, TRIM21) host factors. To corroborate these findings, we infected Trim21-/-mice with LCMV and found impaired virus control in chronic infection. These results provide insights into the complex interactions of the arenavirus LCMV and other viral RdRps with the host proteome and contribute to a better molecular understanding of how chronic viruses interact with their host.","lang":"eng"}],"scopus_import":1,"citation":{"apa":"Khamina, K., Lercher, A., Caldera, M., Schliehe, C., Vilagos, B., Sahin, M., … Bergthaler, A. (2017). Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. <i>PLoS Pathogens</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.ppat.1006758\">https://doi.org/10.1371/journal.ppat.1006758</a>","mla":"Khamina, Kseniya, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” <i>PLoS Pathogens</i>, vol. 13, no. 12, e1006758, Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.ppat.1006758\">10.1371/journal.ppat.1006758</a>.","short":"K. Khamina, A. Lercher, M. Caldera, C. Schliehe, B. Vilagos, M. Sahin, L. Kosack, A. Bhattacharya, P. Májek, A. Stukalov, R. Sacco, L. James, D. Pinschewer, K. Bennett, J. Menche, A. Bergthaler, PLoS Pathogens 13 (2017).","ista":"Khamina K, Lercher A, Caldera M, Schliehe C, Vilagos B, Sahin M, Kosack L, Bhattacharya A, Májek P, Stukalov A, Sacco R, James L, Pinschewer D, Bennett K, Menche J, Bergthaler A. 2017. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 13(12), e1006758.","ieee":"K. Khamina <i>et al.</i>, “Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein,” <i>PLoS Pathogens</i>, vol. 13, no. 12. Public Library of Science, 2017.","ama":"Khamina K, Lercher A, Caldera M, et al. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. <i>PLoS Pathogens</i>. 2017;13(12). doi:<a href=\"https://doi.org/10.1371/journal.ppat.1006758\">10.1371/journal.ppat.1006758</a>","chicago":"Khamina, Kseniya, Alexander Lercher, Michael Caldera, Christopher Schliehe, Bojan Vilagos, Mehmet Sahin, Lindsay Kosack, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” <i>PLoS Pathogens</i>. Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.ppat.1006758\">https://doi.org/10.1371/journal.ppat.1006758</a>."},"publication_identifier":{"issn":["15537366"]},"publication_status":"published","file":[{"file_id":"4944","content_type":"application/pdf","creator":"system","file_size":4106772,"relation":"main_file","checksum":"1aa20f19a1e90664fadce6e7d5284fdc","access_level":"open_access","file_name":"IST-2018-931-v1+1_journal.ppat.1006758.pdf","date_updated":"2020-07-14T12:46:44Z","date_created":"2018-12-12T10:12:26Z"}],"title":"Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein","author":[{"first_name":"Kseniya","last_name":"Khamina","full_name":"Khamina, Kseniya"},{"full_name":"Lercher, Alexander","last_name":"Lercher","first_name":"Alexander"},{"last_name":"Caldera","first_name":"Michael","full_name":"Caldera, Michael"},{"first_name":"Christopher","last_name":"Schliehe","full_name":"Schliehe, Christopher"},{"full_name":"Vilagos, Bojan","first_name":"Bojan","last_name":"Vilagos"},{"last_name":"Sahin","first_name":"Mehmet","full_name":"Sahin, Mehmet"},{"full_name":"Kosack, Lindsay","last_name":"Kosack","first_name":"Lindsay"},{"first_name":"Anannya","last_name":"Bhattacharya","full_name":"Bhattacharya, Anannya"},{"first_name":"Peter","last_name":"Májek","full_name":"Májek, Peter"},{"full_name":"Stukalov, Alexey","first_name":"Alexey","last_name":"Stukalov"},{"first_name":"Roberto","id":"42C9F57E-F248-11E8-B48F-1D18A9856A87","last_name":"Sacco","full_name":"Sacco, Roberto"},{"full_name":"James, Leo","first_name":"Leo","last_name":"James"},{"full_name":"Pinschewer, Daniel","first_name":"Daniel","last_name":"Pinschewer"},{"first_name":"Keiryn","last_name":"Bennett","full_name":"Bennett, Keiryn"},{"first_name":"Jörg","last_name":"Menche","full_name":"Menche, Jörg"},{"full_name":"Bergthaler, Andreas","last_name":"Bergthaler","first_name":"Andreas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Public Library of Science","has_accepted_license":"1","pubrep_id":"931","language":[{"iso":"eng"}],"publist_id":"7276","department":[{"_id":"GaNo"}]}]