[{"conference":{"start_date":"2018-06-17 ","location":"Vail, CO, USA","end_date":"2018-06-22","name":"ISIT: International Symposium on Information Theory"},"abstract":[{"lang":"eng","text":"Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite direction. Namely, every extractor with sufficiently good parameters yields a universal family on a noticeable fraction of its inputs. Our proof technique is based on tools from extremal graph theory applied to the \\'collision graph\\' induced by the extractor, and may be of independent interest. We discuss possible applications to the theory of randomness extractors and non-malleable codes."}],"year":"2018","status":"public","title":"Inverted leftover hash lemma","publication_status":"published","_id":"108","quality_controlled":"1","alternative_title":["ISIT Proceedings"],"day":"16","citation":{"ista":"Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018.","short":"M. Obremski, M. Skórski, in:, IEEE, 2018.","mla":"Obremski, Marciej, and Maciej Skórski. <i>Inverted Leftover Hash Lemma</i>. Vol. 2018, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>.","chicago":"Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,” Vol. 2018. IEEE, 2018. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>.","apa":"Obremski, M., &#38; Skórski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>","ama":"Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>","ieee":"M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018, vol. 2018."},"external_id":{"isi":["000448139300368"]},"date_published":"2018-08-16T00:00:00Z","doi":"10.1109/ISIT.2018.8437654","month":"08","publist_id":"7946","isi":1,"type":"conference","main_file_link":[{"url":"https://eprint.iacr.org/2017/507","open_access":"1"}],"date_updated":"2023-09-13T08:23:18Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:44:40Z","oa_version":"Submitted Version","publisher":"IEEE","volume":2018,"scopus_import":"1","oa":1,"article_processing_charge":"No","author":[{"first_name":"Marciej","last_name":"Obremski","full_name":"Obremski, Marciej"},{"full_name":"Skorski, Maciej","last_name":"Skorski","first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD"}],"department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"intvolume":"      2018","fulldoi":"https://doi.org/10.1109/ISIT.2018.8437654"},{"status":"public","title":"Near-optimal self-stabilising counting and firing squads","corr_author":"1","abstract":[{"lang":"eng","text":"Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C&gt;1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f&lt;n/3, asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions."}],"year":"2018","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"access_level":"open_access","date_created":"2018-12-17T14:21:22Z","content_type":"application/pdf","creator":"dernst","file_size":799337,"date_updated":"2020-07-14T12:48:01Z","file_id":"5711","file_name":"2018_DistributedComputing_Lenzen.pdf","relation":"main_file","checksum":"872db70bba9b401500abe3c6ae2f1a61"}],"has_accepted_license":"1","publication_status":"published","citation":{"mla":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” <i>Distributed Computing</i>, Springer, 2018, doi:<a href=\"https://doi.org/10.1007/s00446-018-0342-6\">10.1007/s00446-018-0342-6</a>.","chicago":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” <i>Distributed Computing</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00446-018-0342-6\">https://doi.org/10.1007/s00446-018-0342-6</a>.","ista":"Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing squads. Distributed Computing.","short":"C. Lenzen, J. Rybicki, Distributed Computing (2018).","ama":"Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. <i>Distributed Computing</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s00446-018-0342-6\">10.1007/s00446-018-0342-6</a>","ieee":"C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” <i>Distributed Computing</i>. Springer, 2018.","apa":"Lenzen, C., &#38; Rybicki, J. (2018). Near-optimal self-stabilising counting and firing squads. <i>Distributed Computing</i>. Springer. <a href=\"https://doi.org/10.1007/s00446-018-0342-6\">https://doi.org/10.1007/s00446-018-0342-6</a>"},"day":"12","quality_controlled":"1","publication":"Distributed Computing","_id":"76","external_id":{"isi":["000475627800005"]},"date_published":"2018-09-12T00:00:00Z","doi":"10.1007/s00446-018-0342-6","isi":1,"month":"09","publist_id":"7978","type":"journal_article","date_updated":"2025-04-15T06:53:15Z","date_created":"2018-12-11T11:44:30Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Springer","oa_version":"Published Version","ddc":["000"],"file_date_updated":"2020-07-14T12:48:01Z","department":[{"_id":"DaAl"}],"author":[{"first_name":"Christoph","full_name":"Lenzen, Christoph","last_name":"Lenzen"},{"last_name":"Rybicki","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel"}],"article_processing_charge":"Yes (via OA deal)","scopus_import":"1","oa":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/s00446-018-0342-6","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}]},{"status":"public","title":"A germanium hole spin qubit","abstract":[{"lang":"eng","text":"Holes confined in quantum dots have gained considerable interest in the past few years due to their potential as spin qubits. Here we demonstrate two-axis control of a spin 3/2 qubit in natural Ge. The qubit is formed in a hut wire double quantum dot device. The Pauli spin blockade principle allowed us to demonstrate electric dipole spin resonance by applying a radio frequency electric field to one of the electrodes defining the double quantum dot. Coherent hole spin oscillations with Rabi frequencies reaching 140 MHz are demonstrated and dephasing times of 130 ns are measured. The reported results emphasize the potential of Ge as a platform for fast and electrically tunable hole spin qubit devices."}],"year":"2018","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_size":1063469,"date_updated":"2020-07-14T12:48:02Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","date_created":"2018-12-17T10:28:30Z","relation":"main_file","checksum":"e7148c10a64497e279c4de570b6cc544","file_name":"2018_NatureComm_Watzinger.pdf","file_id":"5687"}],"publication_status":"published","has_accepted_license":"1","day":"25","citation":{"apa":"Watzinger, H., Kukucka, J., Vukušić, L., Gao, F., Wang, T., Schäffler, F., … Katsaros, G. (2018). A germanium hole spin qubit. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41467-018-06418-4\">https://doi.org/10.1038/s41467-018-06418-4</a>","ieee":"H. Watzinger <i>et al.</i>, “A germanium hole spin qubit,” <i>Nature Communications</i>, vol. 9, no. 3902. Nature Publishing Group, 2018.","ama":"Watzinger H, Kukucka J, Vukušić L, et al. A germanium hole spin qubit. <i>Nature Communications</i>. 2018;9(3902). doi:<a href=\"https://doi.org/10.1038/s41467-018-06418-4\">10.1038/s41467-018-06418-4</a>","ista":"Watzinger H, Kukucka J, Vukušić L, Gao F, Wang T, Schäffler F, Zhang J, Katsaros G. 2018. A germanium hole spin qubit. Nature Communications. 9(3902).","short":"H. Watzinger, J. Kukucka, L. Vukušić, F. Gao, T. Wang, F. Schäffler, J. Zhang, G. Katsaros, Nature Communications 9 (2018).","chicago":"Watzinger, Hannes, Josip Kukucka, Lada Vukušić, Fei Gao, Ting Wang, Friedrich Schäffler, Jian Zhang, and Georgios Katsaros. “A Germanium Hole Spin Qubit.” <i>Nature Communications</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41467-018-06418-4\">https://doi.org/10.1038/s41467-018-06418-4</a>.","mla":"Watzinger, Hannes, et al. “A Germanium Hole Spin Qubit.” <i>Nature Communications</i>, vol. 9, no. 3902, Nature Publishing Group, 2018, doi:<a href=\"https://doi.org/10.1038/s41467-018-06418-4\">10.1038/s41467-018-06418-4</a>."},"quality_controlled":"1","publication":"Nature Communications","_id":"77","external_id":{"isi":["000445560800010"]},"date_published":"2018-09-25T00:00:00Z","doi":"10.1038/s41467-018-06418-4","isi":1,"month":"09","ec_funded":1,"type":"journal_article","date_updated":"2026-04-08T07:27:13Z","related_material":{"record":[{"id":"7977","relation":"popular_science"},{"status":"public","relation":"dissertation_contains","id":"7996"}]},"date_created":"2018-12-11T11:44:30Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Nature Publishing Group","oa_version":"Published Version","article_type":"original","volume":9,"file_date_updated":"2020-07-14T12:48:02Z","ddc":["530"],"department":[{"_id":"GeKa"}],"author":[{"first_name":"Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","full_name":"Watzinger, Hannes","last_name":"Watzinger"},{"first_name":"Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","full_name":"Kukucka, Josip","last_name":"Kukucka"},{"last_name":"Vukusic","full_name":"Vukusic, Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada","orcid":"0000-0003-2424-8636"},{"first_name":"Fei","last_name":"Gao","full_name":"Gao, Fei"},{"first_name":"Ting","full_name":"Wang, Ting","last_name":"Wang"},{"first_name":"Friedrich","full_name":"Schäffler, Friedrich","last_name":"Schäffler"},{"first_name":"Jian","last_name":"Zhang","full_name":"Zhang, Jian"},{"last_name":"Katsaros","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios"}],"article_processing_charge":"Yes","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"oa":1,"scopus_import":"1","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1038/s41467-018-06418-4","project":[{"name":"Towards Spin qubits and Majorana fermions in Germanium self assembled hut-wires","_id":"25517E86-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"335497"},{"name":"Loch Spin-Qubits und Majorana-Fermionen in Germanium","call_identifier":"FWF","_id":"2552F888-B435-11E9-9278-68D0E5697425","grant_number":"Y00715"}],"issue":"3902 ","intvolume":"         9"},{"has_accepted_license":"1","publication_status":"published","file":[{"file_size":374851,"date_updated":"2020-07-14T12:48:03Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","date_created":"2020-05-14T11:34:34Z","relation":"main_file","checksum":"436b7574934324cfa7d1d3986fddc65b","file_name":"2018_LNCS_Bakhirkin.pdf","file_id":"7831"}],"_id":"78","quality_controlled":"1","day":"26","citation":{"ieee":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, and E. Asarin, “Online timed pattern matching using automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China, 2018, vol. 11022, pp. 215–232.","ama":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. Online timed pattern matching using automata. In: Vol 11022. Springer; 2018:215-232. doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">10.1007/978-3-030-00151-3_13</a>","apa":"Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., &#38; Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">https://doi.org/10.1007/978-3-030-00151-3_13</a>","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene Asarin. “Online Timed Pattern Matching Using Automata,” 11022:215–32. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">https://doi.org/10.1007/978-3-030-00151-3_13</a>.","mla":"Bakhirkin, Alexey, et al. <i>Online Timed Pattern Matching Using Automata</i>. Vol. 11022, Springer, 2018, pp. 215–32, doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">10.1007/978-3-030-00151-3_13</a>.","ista":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. 2018. Online timed pattern matching using automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 215–232.","short":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer, 2018, pp. 215–232."},"alternative_title":["LNCS"],"conference":{"start_date":"2018-09-04","location":"Bejing, China","end_date":"2018-09-06","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"abstract":[{"text":"We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated.","lang":"eng"}],"year":"2018","title":"Online timed pattern matching using automata","status":"public","publist_id":"7976","month":"08","isi":1,"type":"conference","page":"215 - 232","external_id":{"isi":["000884993200013"]},"publication_identifier":{"isbn":["978-3-030-00150-6"]},"date_published":"2018-08-26T00:00:00Z","doi":"10.1007/978-3-030-00151-3_13","oa_version":"Submitted Version","publisher":"Springer","ddc":["000"],"file_date_updated":"2020-07-14T12:48:03Z","volume":11022,"date_updated":"2025-04-15T06:26:03Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:44:31Z","language":[{"iso":"eng"}],"intvolume":"     11022","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"fulldoi":"https://doi.org/10.1007/978-3-030-00151-3_13","scopus_import":"1","oa":1,"department":[{"_id":"ToHe"}],"article_processing_charge":"No","author":[{"last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey","first_name":"Alexey"},{"orcid":"0000-0001-5199-3143","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","last_name":"Ferrere"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","first_name":"Dejan"},{"first_name":"Oded","full_name":"Maler, Oded","last_name":"Maler"},{"full_name":"Asarin, Eugene","last_name":"Asarin","first_name":"Eugene"}]},{"abstract":[{"lang":"eng","text":"Deep neural networks (DNNs) continue to make significant advances, solving tasks from image classification to translation or reinforcement learning. One aspect of the field receiving considerable attention is efficiently executing deep models in resource-constrained environments, such as mobile or embedded devices. This paper focuses on this problem, and proposes two new compression methods, which jointly leverage weight quantization and distillation of larger teacher networks into smaller student networks. The first method we propose is called quantized distillation and leverages distillation during the training process, by incorporating distillation loss, expressed with respect to the teacher, into the training of a student network whose weights are quantized to a limited set of levels. The second method,  differentiable quantization, optimizes the location of quantization points through stochastic gradient descent, to better fit the behavior of the teacher model.  We validate both methods through experiments on convolutional and recurrent architectures. We show that quantized shallow students can reach similar accuracy levels to full-precision teacher models, while providing order of magnitude compression, and inference speedup that is linear in the depth reduction. In sum, our results enable DNNs for resource-constrained environments to leverage architecture and accuracy advances developed on more powerful devices."}],"year":"2018","status":"public","title":"Model compression via distillation and quantization","acknowledgement":"We would like to thank Ce Zhang (ETH Zurich), Hantian Zhang (ETH Zurich) and Martin Jaggi ´\r\n(EPFL) for their support with experiments and valuable feedback.\r\n","conference":{"location":"Vancouver, Canada","start_date":"2018-04-30","end_date":"2018-05-03","name":"ICLR: International Conference on Learning Representations"},"_id":"7812","publication":"6th International Conference on Learning Representations","quality_controlled":"1","day":"01","citation":{"apa":"Polino, A., Pascanu, R., &#38; Alistarh, D.-A. (2018). Model compression via distillation and quantization. In <i>6th International Conference on Learning Representations</i>. Vancouver, Canada.","ieee":"A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation and quantization,” in <i>6th International Conference on Learning Representations</i>, Vancouver, Canada, 2018.","ama":"Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and quantization. In: <i>6th International Conference on Learning Representations</i>. ; 2018.","short":"A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018.","ista":"Polino A, Pascanu R, Alistarh D-A. 2018. Model compression via distillation and quantization. 6th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","chicago":"Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression via Distillation and Quantization.” In <i>6th International Conference on Learning Representations</i>, 2018.","mla":"Polino, Antonio, et al. “Model Compression via Distillation and Quantization.” <i>6th International Conference on Learning Representations</i>, 2018."},"has_accepted_license":"1","publication_status":"published","file":[{"file_id":"7894","file_name":"2018_ICLR_Polino.pdf","checksum":"a4336c167978e81891970e4e4517a8c3","relation":"main_file","date_created":"2020-05-26T13:02:00Z","access_level":"open_access","content_type":"application/pdf","creator":"dernst","date_updated":"2020-07-14T12:48:03Z","file_size":308339}],"date_published":"2018-05-01T00:00:00Z","arxiv":1,"external_id":{"arxiv":["1802.05668"]},"type":"conference","month":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-05-10T22:00:51Z","date_updated":"2025-06-30T10:04:44Z","ddc":["000"],"file_date_updated":"2020-07-14T12:48:03Z","oa_version":"Published Version","scopus_import":"1","oa":1,"author":[{"first_name":"Antonio","full_name":"Polino, Antonio","last_name":"Polino"},{"last_name":"Pascanu","full_name":"Pascanu, Razvan","first_name":"Razvan"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"}],"article_processing_charge":"No","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}]},{"page":"53-70","type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.05126"}],"publist_id":"7975","month":"08","isi":1,"arxiv":1,"doi":"10.1007/978-3-319-99154-2_4","date_published":"2018-08-15T00:00:00Z","external_id":{"isi":["000548912200004"],"arxiv":["1806.05126"]},"quality_controlled":"1","citation":{"apa":"Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., &#38; Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">https://doi.org/10.1007/978-3-319-99154-2_4</a>","ieee":"S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.","ama":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. Parameter-independent strategies for pMDPs via POMDPs. In: Vol 11024. Springer; 2018:53-70. doi:<a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">10.1007/978-3-319-99154-2_4</a>","short":"S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70.","ista":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024, 53–70.","mla":"Arming, Sebastian, et al. <i>Parameter-Independent Strategies for PMDPs via POMDPs</i>. Vol. 11024, Springer, 2018, pp. 53–70, doi:<a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">10.1007/978-3-319-99154-2_4</a>.","chicago":"Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">https://doi.org/10.1007/978-3-319-99154-2_4</a>."},"day":"15","alternative_title":["LNCS"],"_id":"79","publication_status":"published","title":"Parameter-independent strategies for pMDPs via POMDPs","status":"public","abstract":[{"text":"Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to account for stochastic uncertainties of the environment such as noise or input disturbances. We study pMDPs with reachability objectives where the parameter values are unknown and impossible to measure directly during execution, but there is a probability distribution known over the parameter values. We study for the first time computing parameter-independent strategies that are expectation optimal, i.e., optimize the expected reachability probability under the probability distribution over the parameters. We present an encoding of our problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating (repeated) learner model; a series of benchmarks of varying configurations of a robot moving on a grid; and a consensus protocol.","lang":"eng"}],"year":"2018","conference":{"end_date":"2018-09-07","name":"QEST: Quantitative Evaluation of Systems","start_date":"2018-09-04","location":"Beijing, China"},"fulldoi":"https://doi.org/10.1007/978-3-319-99154-2_4","intvolume":"     11024","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"last_name":"Arming","full_name":"Arming, Sebastian","first_name":"Sebastian"},{"full_name":"Bartocci, Ezio","last_name":"Bartocci","first_name":"Ezio"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Katoen, Joost P","last_name":"Katoen","first_name":"Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ana","last_name":"Sokolova","full_name":"Sokolova, Ana"}],"oa":1,"scopus_import":"1","volume":11024,"publisher":"Springer","oa_version":"Preprint","date_created":"2018-12-11T11:44:31Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-13T09:38:28Z"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:48:36Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"819"}]},"date_updated":"2026-04-08T14:19:10Z","volume":63,"oa_version":"None","publisher":"Annual Reviews","scopus_import":"1","department":[{"_id":"SyCr"}],"author":[{"orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","last_name":"Cremer","full_name":"Cremer, Sylvia"},{"full_name":"Pull, Christopher","last_name":"Pull","orcid":"0000-0003-1122-3982","first_name":"Christopher","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fürst, Matthias","last_name":"Fürst","orcid":"0000-0002-3712-925X","first_name":"Matthias","id":"393B1196-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","intvolume":"        63","fulldoi":"https://doi.org/10.1146/annurev-ento-020117-043110","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Social insect colonies have evolved many collectively performed adaptations that reduce the impact of infectious disease and that are expected to maximize their fitness. This colony-level protection is termed social immunity, and it enhances the health and survival of the colony. In this review, we address how social immunity emerges from its mechanistic components to produce colony-level disease avoidance, resistance, and tolerance. To understand the evolutionary causes and consequences of social immunity, we highlight the need for studies that evaluate the effects of social immunity on colony fitness. We discuss the role that host life history and ecology have on predicted eco-evolutionary dynamics, which differ among the social insect lineages. Throughout the review, we highlight current gaps in our knowledge and promising avenues for future research, which we hope will bring us closer to an integrated understanding of socio-eco-evo-immunology."}],"year":"2018","corr_author":"1","status":"public","title":"Social immunity: Emergence and evolution of colony-level disease protection","_id":"806","quality_controlled":"1","publication":"Annual Review of Entomology","day":"07","citation":{"ama":"Cremer S, Pull C, Fürst M. Social immunity: Emergence and evolution of colony-level disease protection. <i>Annual Review of Entomology</i>. 2018;63:105-123. doi:<a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">10.1146/annurev-ento-020117-043110</a>","ieee":"S. Cremer, C. Pull, and M. Fürst, “Social immunity: Emergence and evolution of colony-level disease protection,” <i>Annual Review of Entomology</i>, vol. 63. Annual Reviews, pp. 105–123, 2018.","apa":"Cremer, S., Pull, C., &#38; Fürst, M. (2018). Social immunity: Emergence and evolution of colony-level disease protection. <i>Annual Review of Entomology</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">https://doi.org/10.1146/annurev-ento-020117-043110</a>","chicago":"Cremer, Sylvia, Christopher Pull, and Matthias Fürst. “Social Immunity: Emergence and Evolution of Colony-Level Disease Protection.” <i>Annual Review of Entomology</i>. Annual Reviews, 2018. <a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">https://doi.org/10.1146/annurev-ento-020117-043110</a>.","mla":"Cremer, Sylvia, et al. “Social Immunity: Emergence and Evolution of Colony-Level Disease Protection.” <i>Annual Review of Entomology</i>, vol. 63, Annual Reviews, 2018, pp. 105–23, doi:<a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">10.1146/annurev-ento-020117-043110</a>.","ista":"Cremer S, Pull C, Fürst M. 2018. Social immunity: Emergence and evolution of colony-level disease protection. Annual Review of Entomology. 63, 105–123.","short":"S. Cremer, C. Pull, M. Fürst, Annual Review of Entomology 63 (2018) 105–123."},"publication_status":"published","doi":"10.1146/annurev-ento-020117-043110","date_published":"2018-01-07T00:00:00Z","external_id":{"isi":["000424633700008"]},"publication_identifier":{"issn":["1545-4487"]},"type":"journal_article","page":"105 - 123","month":"01","publist_id":"6844","isi":1},{"oa":1,"scopus_import":"1","article_processing_charge":"No","department":[{"_id":"ToHe"}],"author":[{"last_name":"Elgyütt","full_name":"Elgyütt, Adrian","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian"},{"orcid":"0000-0001-5199-3143","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","last_name":"Ferrere"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"intvolume":"     11022","fulldoi":"https://doi.org/10.1007/978-3-030-00151-3_4","project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"date_updated":"2025-04-15T06:26:03Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:44:31Z","oa_version":"Submitted Version","publisher":"Springer","ddc":["000"],"file_date_updated":"2020-10-09T06:24:21Z","volume":11022,"external_id":{"isi":["000884993200004"]},"doi":"10.1007/978-3-030-00151-3_4","date_published":"2018-08-26T00:00:00Z","publist_id":"7973","month":"08","isi":1,"type":"conference","page":"53 - 70","conference":{"end_date":"2018-09-06","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","location":"Beijing, China","start_date":"2018-09-04"},"year":"2018","abstract":[{"text":"We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring algorithm for the one-variable case using a partition of the time domain based on the notion of region equivalence, whose complexity is linear in the length of the signal, thereby generalizing a known result regarding the monitoring of metric temporal logic (MTL). The region and zone representations of time constraints are known from timed automata verification and can also be used in the discrete-time case. Our prototype implementation appears to outperform previous discrete-time implementations of TPTL monitoring,","lang":"eng"}],"title":"Monitoring temporal logic with clock variables","status":"public","publication_status":"published","has_accepted_license":"1","file":[{"checksum":"e5d81c9b50a6bd9d8a2c16953aad7e23","relation":"main_file","file_id":"8638","success":1,"file_name":"2018_LNCS_Elgyuett.pdf","date_updated":"2020-10-09T06:24:21Z","file_size":537219,"date_created":"2020-10-09T06:24:21Z","access_level":"open_access","creator":"dernst","content_type":"application/pdf"}],"_id":"81","quality_controlled":"1","alternative_title":["LNCS"],"day":"26","citation":{"ista":"Elgyütt A, Ferrere T, Henzinger TA. 2018. Monitoring temporal logic with clock variables. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 53–70.","short":"A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70.","mla":"Elgyütt, Adrian, et al. <i>Monitoring Temporal Logic with Clock Variables</i>. Vol. 11022, Springer, 2018, pp. 53–70, doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">10.1007/978-3-030-00151-3_4</a>.","chicago":"Elgyütt, Adrian, Thomas Ferrere, and Thomas A Henzinger. “Monitoring Temporal Logic with Clock Variables,” 11022:53–70. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">https://doi.org/10.1007/978-3-030-00151-3_4</a>.","apa":"Elgyütt, A., Ferrere, T., &#38; Henzinger, T. A. (2018). Monitoring temporal logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">https://doi.org/10.1007/978-3-030-00151-3_4</a>","ama":"Elgyütt A, Ferrere T, Henzinger TA. Monitoring temporal logic with clock variables. In: Vol 11022. Springer; 2018:53-70. doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">10.1007/978-3-030-00151-3_4</a>","ieee":"A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China, 2018, vol. 11022, pp. 53–70."}},{"oa_version":"Published Version","publisher":"Public Library of Science","ddc":["570"],"file_date_updated":"2020-07-14T12:48:10Z","volume":16,"related_material":{"record":[{"status":"public","relation":"research_data","id":"9810"}]},"date_updated":"2023-09-13T08:45:41Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:44:32Z","language":[{"iso":"eng"}],"intvolume":"        16","issue":"8","fulldoi":"https://doi.org/10.1371/journal.pbio.2005971","article_number":"2005971","oa":1,"scopus_import":"1","department":[{"_id":"CaGu"}],"article_processing_charge":"Yes","author":[{"full_name":"Chaudhry, Waqas","last_name":"Chaudhry","first_name":"Waqas"},{"full_name":"Pleska, Maros","last_name":"Pleska","first_name":"Maros","id":"4569785E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7460-7479"},{"first_name":"Nilang","full_name":"Shah, Nilang","last_name":"Shah"},{"last_name":"Weiss","full_name":"Weiss, Howard","first_name":"Howard"},{"full_name":"Mccall, Ingrid","last_name":"Mccall","first_name":"Ingrid"},{"last_name":"Meyer","full_name":"Meyer, Justin","first_name":"Justin"},{"full_name":"Gupta, Animesh","last_name":"Gupta","first_name":"Animesh"},{"last_name":"Guet","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","orcid":"0000-0001-6220-2052"},{"first_name":"Bruce","full_name":"Levin, Bruce","last_name":"Levin"}],"publication_status":"published","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2020-07-14T12:48:10Z","file_size":4007095,"date_created":"2018-12-17T12:55:31Z","access_level":"open_access","content_type":"application/pdf","creator":"dernst","checksum":"527076f78265cd4ea192cd1569851587","relation":"main_file","file_id":"5706","file_name":"2018_Plos_Chaudhry.pdf"}],"_id":"82","day":"16","citation":{"ieee":"W. Chaudhry <i>et al.</i>, “Leaky resistance and the conditions for the existence of lytic bacteriophage,” <i>PLoS Biology</i>, vol. 16, no. 8. Public Library of Science, 2018.","ama":"Chaudhry W, Pleska M, Shah N, et al. Leaky resistance and the conditions for the existence of lytic bacteriophage. <i>PLoS Biology</i>. 2018;16(8). doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971\">10.1371/journal.pbio.2005971</a>","apa":"Chaudhry, W., Pleska, M., Shah, N., Weiss, H., Mccall, I., Meyer, J., … Levin, B. (2018). Leaky resistance and the conditions for the existence of lytic bacteriophage. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2005971\">https://doi.org/10.1371/journal.pbio.2005971</a>","chicago":"Chaudhry, Waqas, Maros Pleska, Nilang Shah, Howard Weiss, Ingrid Mccall, Justin Meyer, Animesh Gupta, Calin C Guet, and Bruce Levin. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” <i>PLoS Biology</i>. Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pbio.2005971\">https://doi.org/10.1371/journal.pbio.2005971</a>.","mla":"Chaudhry, Waqas, et al. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” <i>PLoS Biology</i>, vol. 16, no. 8, 2005971, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971\">10.1371/journal.pbio.2005971</a>.","ista":"Chaudhry W, Pleska M, Shah N, Weiss H, Mccall I, Meyer J, Gupta A, Guet CC, Levin B. 2018. Leaky resistance and the conditions for the existence of lytic bacteriophage. PLoS Biology. 16(8), 2005971.","short":"W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta, C.C. Guet, B. Levin, PLoS Biology 16 (2018)."},"quality_controlled":"1","publication":"PLoS Biology","year":"2018","abstract":[{"text":"In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage, bacterial cells resistant to the phage commonly emerge and become the dominant population of bacteria. Following the ascent of resistant mutants, the densities of bacteria in these simple communities become limited by resources rather than the phage. Despite the evolution of resistant hosts, upon which the phage cannot replicate, the lytic phage population is most commonly maintained in an apparently stable state with the resistant bacteria. Several mechanisms have been put forward to account for this result. Here we report the results of population dynamic/evolution experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli in serial transfer cultures. We show that, following the ascent of λVIR-resistant bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal media and in all cases in nutrient-rich broth. Using mathematical models and experiments, we show that the dominant mechanism responsible for maintenance of λVIRin these resource-limited populations dominated by resistant E. coli is a high rate of either phenotypic or genetic transition from resistance to susceptibility—a hitherto undemonstrated mechanism we term &quot;leaky resistance.&quot; We discuss the implications of leaky resistance to our understanding of the conditions for the maintenance of phage in populations of bacteria—their “existence conditions.”.","lang":"eng"}],"title":"Leaky resistance and the conditions for the existence of lytic bacteriophage","status":"public","isi":1,"publist_id":"7972","month":"08","type":"journal_article","external_id":{"isi":["000443383300024"]},"date_published":"2018-08-16T00:00:00Z","doi":"10.1371/journal.pbio.2005971"},{"external_id":{"isi":["000851042300031"]},"publication_identifier":{"issn":["0302-9743"]},"doi":"10.1007/978-3-319-96983-1_33","date_published":"2018-08-01T00:00:00Z","month":"08","publist_id":"7969","isi":1,"type":"conference","page":"465 - 479","acknowledgement":"Trevor Brown was supported in part by the ISF (grants 2005/17 & 1749/14) and by a NSERC post-doctoral fellowship.","conference":{"start_date":"2018-08-27","location":"Turin, Italy","name":"Euro-Par: European Conference on Parallel Processing","end_date":"2018-08-31"},"year":"2018","abstract":[{"lang":"eng","text":"Concurrent accesses to shared data structures must be synchronized to avoid data races. Coarse-grained synchronization, which locks the entire data structure, is easy to implement but does not scale. Fine-grained synchronization can scale well, but can be hard to reason about. Hand-over-hand locking, in which operations are pipelined as they traverse the data structure, combines fine-grained synchronization with ease of use. However, the traditional implementation suffers from inherent overheads. This paper introduces snapshot-based synchronization (SBS), a novel hand-over-hand locking mechanism. SBS decouples the synchronization state from the data, significantly improving cache utilization. Further, it relies on guarantees provided by pipelining to minimize synchronization that requires cross-thread communication. Snapshot-based synchronization thus scales much better than traditional hand-over-hand locking, while maintaining the same ease of use."}],"title":"Snapshot based synchronization: A fast replacement for Hand-over-Hand locking","status":"public","publication_status":"published","has_accepted_license":"1","file":[{"file_id":"5954","file_name":"2018_Brown.pdf","checksum":"13a3f250be8878405e791b53c19722ad","relation":"main_file","date_created":"2019-02-12T07:40:40Z","access_level":"open_access","content_type":"application/pdf","creator":"dernst","date_updated":"2020-07-14T12:48:14Z","file_size":665372}],"_id":"85","quality_controlled":"1","citation":{"short":"E. Gilad, T.A. Brown, M. Oskin, Y. Etsion, in:, Springer, 2018, pp. 465–479.","ista":"Gilad E, Brown TA, Oskin M, Etsion Y. 2018. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. Euro-Par: European Conference on Parallel Processing, LNCS, vol. 11014, 465–479.","mla":"Gilad, Eran, et al. <i>Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking</i>. Vol. 11014, Springer, 2018, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>.","chicago":"Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>.","apa":"Gilad, E., Brown, T. A., Oskin, M., &#38; Etsion, Y. (2018). Snapshot based synchronization: A fast replacement for Hand-over-Hand locking (Vol. 11014, pp. 465–479). Presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>","ieee":"E. Gilad, T. A. Brown, M. Oskin, and Y. Etsion, “Snapshot based synchronization: A fast replacement for Hand-over-Hand locking,” presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy, 2018, vol. 11014, pp. 465–479.","ama":"Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>"},"day":"01","alternative_title":["LNCS"],"scopus_import":"1","oa":1,"department":[{"_id":"DaAl"}],"author":[{"full_name":"Gilad, Eran","last_name":"Gilad","first_name":"Eran"},{"last_name":"Brown","full_name":"Brown, Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A"},{"first_name":"Mark","full_name":"Oskin, Mark","last_name":"Oskin"},{"full_name":"Etsion, Yoav","last_name":"Etsion","first_name":"Yoav"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"intvolume":"     11014","fulldoi":"https://doi.org/10.1007/978-3-319-96983-1_33","project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"date_updated":"2026-04-16T09:53:41Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2018-12-11T11:44:33Z","oa_version":"Preprint","publisher":"Springer","ddc":["000"],"file_date_updated":"2020-07-14T12:48:14Z","volume":11014},{"date_published":"2018-07-20T00:00:00Z","doi":"10.1007/978-3-319-95246-8_9","editor":[{"last_name":"Lohstroh","full_name":"Lohstroh, Marten","first_name":"Marten"},{"first_name":"Patricia","full_name":"Derler, Patricia","last_name":"Derler"},{"full_name":"Sirjani, Marjan","last_name":"Sirjani","first_name":"Marjan"}],"publist_id":"7968","month":"07","type":"book_chapter","ec_funded":1,"page":"143 - 161","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.","abstract":[{"text":"Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms.","lang":"eng"}],"year":"2018","title":"Computing average response time","status":"public","has_accepted_license":"1","publication_status":"published","file":[{"file_name":"2018_PrinciplesModeling_Chatterjee.pdf","file_id":"7053","checksum":"9995c6ce6957333baf616fc4f20be597","relation":"main_file","content_type":"application/pdf","creator":"dernst","date_created":"2019-11-19T08:22:18Z","access_level":"open_access","date_updated":"2020-07-14T12:48:14Z","file_size":516307}],"_id":"86","alternative_title":["LNCS"],"citation":{"ama":"Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh M, Derler P, Sirjani M, eds. <i>Principles of Modeling</i>. Vol 10760. Springer; 2018:143-161. doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in <i>Principles of Modeling</i>, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, &#38; M. Sirjani (Eds.), <i>Principles of Modeling</i> (Vol. 10760, pp. 143–161). Springer. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>","mla":"Chatterjee, Krishnendu, et al. “Computing Average Response Time.” <i>Principles of Modeling</i>, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In <i>Principles of Modeling</i>, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.","ista":"Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 143–161."},"day":"20","quality_controlled":"1","publication":"Principles of Modeling","oa":1,"scopus_import":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Otop","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"language":[{"iso":"eng"}],"intvolume":"     10760","fulldoi":"https://doi.org/10.1007/978-3-319-95246-8_9","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"date_updated":"2025-04-15T06:26:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:44:33Z","oa_version":"Submitted Version","publisher":"Springer","file_date_updated":"2020-07-14T12:48:14Z","ddc":["000"],"volume":10760},{"intvolume":"         8","fulldoi":"https://doi.org/10.1038/s41598-018-19947-1","language":[{"iso":"eng"}],"oa":1,"scopus_import":"1","article_processing_charge":"No","author":[{"last_name":"Gregor","full_name":"Gregor, Carola","first_name":"Carola"},{"first_name":"Sven C.","full_name":"Sidenstein, Sven C.","last_name":"Sidenstein"},{"full_name":"Andresen, Martin","last_name":"Andresen","first_name":"Martin"},{"full_name":"Sahl, Steffen J.","last_name":"Sahl","first_name":"Steffen J."},{"orcid":"0000-0001-8559-3973","first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","full_name":"Danzl, Johann G","last_name":"Danzl"},{"last_name":"Hell","full_name":"Hell, Stefan W.","first_name":"Stefan W."}],"department":[{"_id":"JoDa"}],"article_number":"2724","ddc":["570"],"file_date_updated":"2020-10-06T16:35:16Z","volume":8,"oa_version":"Published Version","article_type":"original","pmid":1,"publisher":"Springer Nature","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2020-10-06T16:33:37Z","date_updated":"2024-10-21T06:02:43Z","type":"journal_article","isi":1,"month":"02","date_published":"2018-02-09T00:00:00Z","doi":"10.1038/s41598-018-19947-1","keyword":["Multidisciplinary"],"external_id":{"isi":["000424630400037"],"pmid":["29426833"]},"publication_identifier":{"issn":["2045-2322"]},"_id":"8618","citation":{"mla":"Gregor, Carola, et al. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” <i>Scientific Reports</i>, vol. 8, 2724, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1038/s41598-018-19947-1\">10.1038/s41598-018-19947-1</a>.","chicago":"Gregor, Carola, Sven C. Sidenstein, Martin Andresen, Steffen J. Sahl, Johann G Danzl, and Stefan W. Hell. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” <i>Scientific Reports</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s41598-018-19947-1\">https://doi.org/10.1038/s41598-018-19947-1</a>.","short":"C. Gregor, S.C. Sidenstein, M. Andresen, S.J. Sahl, J.G. Danzl, S.W. Hell, Scientific Reports 8 (2018).","ista":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. 2018. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. 8, 2724.","ama":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. <i>Scientific Reports</i>. 2018;8. doi:<a href=\"https://doi.org/10.1038/s41598-018-19947-1\">10.1038/s41598-018-19947-1</a>","ieee":"C. Gregor, S. C. Sidenstein, M. Andresen, S. J. Sahl, J. G. Danzl, and S. W. Hell, “Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA,” <i>Scientific Reports</i>, vol. 8. Springer Nature, 2018.","apa":"Gregor, C., Sidenstein, S. C., Andresen, M., Sahl, S. J., Danzl, J. G., &#38; Hell, S. W. (2018). Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-018-19947-1\">https://doi.org/10.1038/s41598-018-19947-1</a>"},"day":"09","quality_controlled":"1","publication":"Scientific Reports","has_accepted_license":"1","publication_status":"published","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_name":"2018_ScientificReports_Gregor.pdf","file_id":"8619","success":1,"checksum":"e642080fcbde9584c63544f587c74f03","relation":"main_file","creator":"dernst","content_type":"application/pdf","date_created":"2020-10-06T16:35:16Z","access_level":"open_access","date_updated":"2020-10-06T16:35:16Z","file_size":2818077}],"year":"2018","abstract":[{"text":"The reversibly switchable fluorescent proteins (RSFPs) commonly used for RESOLFT nanoscopy have been developed from fluorescent proteins of the GFP superfamily. These proteins are bright, but exhibit several drawbacks such as relatively large size, oxygen-dependence, sensitivity to low pH, and limited switching speed. Therefore, RSFPs from other origins with improved properties need to be explored. Here, we report the development of two RSFPs based on the LOV domain of the photoreceptor protein YtvA from Bacillus subtilis. LOV domains obtain their fluorescence by association with the abundant cellular cofactor flavin mononucleotide (FMN). Under illumination with blue and ultraviolet light, they undergo a photocycle, making these proteins inherently photoswitchable. Our first improved variant, rsLOV1, can be used for RESOLFT imaging, whereas rsLOV2 proved useful for STED nanoscopy of living cells with a resolution of down to 50 nm. In addition to their smaller size compared to GFP-related proteins (17 kDa instead of 27 kDa) and their usability at low pH, rsLOV1 and rsLOV2 exhibit faster switching kinetics, switching on and off 3 times faster than rsEGFP2, the fastest-switching RSFP reported to date. Therefore, LOV-domain-based RSFPs have potential for applications where the switching speed of GFP-based proteins is limiting.","lang":"eng"}],"status":"public","title":"Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA"},{"month":"10","publist_id":"7967","isi":1,"page":"3215 - 3238","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02870"}],"external_id":{"arxiv":["1705.02870"],"isi":["000442893500018"]},"arxiv":1,"date_published":"2018-10-01T00:00:00Z","doi":"10.1214/18-AAP1389","publication_status":"published","publication":"Annals of Applied Probability","quality_controlled":"1","day":"01","citation":{"mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” <i>Annals of Applied Probability</i>, vol. 28, no. 5, Institute of Mathematical Statistics, 2018, pp. 3215–38, doi:<a href=\"https://doi.org/10.1214/18-AAP1389\">10.1214/18-AAP1389</a>.","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2018. <a href=\"https://doi.org/10.1214/18-AAP1389\">https://doi.org/10.1214/18-AAP1389</a>.","ista":"Edelsbrunner H, Nikitenko A. 2018. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 28(5), 3215–3238.","short":"H. Edelsbrunner, A. Nikitenko, Annals of Applied Probability 28 (2018) 3215–3238.","ieee":"H. Edelsbrunner and A. Nikitenko, “Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics,” <i>Annals of Applied Probability</i>, vol. 28, no. 5. Institute of Mathematical Statistics, pp. 3215–3238, 2018.","ama":"Edelsbrunner H, Nikitenko A. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. <i>Annals of Applied Probability</i>. 2018;28(5):3215-3238. doi:<a href=\"https://doi.org/10.1214/18-AAP1389\">10.1214/18-AAP1389</a>","apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2018). Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/18-AAP1389\">https://doi.org/10.1214/18-AAP1389</a>"},"_id":"87","status":"public","title":"Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics","abstract":[{"lang":"eng","text":"Using the geodesic distance on the n-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function and determine the expected number of intervals whose radii are less than or equal to a given threshold. We find that the expectations are essentially the same as for the Poisson–Delaunay mosaic in n-dimensional Euclidean space. Assuming the points are not contained in a hemisphere, the Delaunay mosaic is isomorphic to the boundary complex of the convex hull in Rn+1, so we also get the expected number of faces of a random inscribed polytope. As proved in Antonelli et al. [Adv. in Appl. Probab. 9–12 (1977–1980)], an orthant section of the n-sphere is isometric to the standard n-simplex equipped with the Fisher information metric. It follows that the latter space has similar stochastic properties as the n-dimensional Euclidean space. Our results are therefore relevant in information geometry and in population genetics."}],"year":"2018","language":[{"iso":"eng"}],"project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"fulldoi":"https://doi.org/10.1214/18-AAP1389","issue":"5","intvolume":"        28","article_processing_charge":"No","department":[{"_id":"HeEd"}],"author":[{"orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"full_name":"Nikitenko, Anton","last_name":"Nikitenko","orcid":"0000-0002-0659-3201","first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","oa":1,"publisher":"Institute of Mathematical Statistics","article_type":"original","oa_version":"Preprint","volume":28,"date_updated":"2026-04-08T14:19:30Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6287"}]},"date_created":"2018-12-11T11:44:33Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"abstract":[{"text":"Coordinated cell polarization in developing tissues is a recurrent theme in multicellular organisms. In plants, a directional distribution of the plant hormone auxin is at the core of many developmental programs. A feedback regulation of auxin on the polarized localization of PIN auxin transporters in individual cells has been proposed as a self-organizing mechanism for coordinated tissue polarization, but the molecular mechanisms linking auxin signalling to PIN-dependent auxin transport remain unknown. We performed a microarray-based approach to find regulators of the auxin-induced PIN relocation in the Arabidopsis thaliana root. We identified a subset of a family of phosphatidylinositol transfer proteins (PITP), the PATELLINs (PATL). Here, we show that PATLs are expressed in partially overlapping cells types in different tissues going through mitosis or initiating differentiation programs. PATLs are plasma membrane-associated proteins accumulated in Arabidopsis embryos, primary roots, lateral root primordia, and developing stomata. Higher order patl mutants display reduced PIN1 repolarization in response to auxin, shorter root apical meristem, and drastic defects in embryo and seedling development. This suggests PATLs redundantly play a crucial role in polarity and patterning in Arabidopsis.","lang":"eng"}],"year":"2018","corr_author":"1","title":"PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana","status":"public","_id":"913","quality_controlled":"1","publication":"Journal of Cell Science","citation":{"apa":"Tejos, R., Rodríguez Furlán, C., Adamowski, M., Sauer, M., Norambuena, L., &#38; Friml, J. (2018). PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.204198\">https://doi.org/10.1242/jcs.204198</a>","ieee":"R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, and J. Friml, “PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana,” <i>Journal of Cell Science</i>, vol. 131, no. 2. Company of Biologists, 2018.","ama":"Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. <i>Journal of Cell Science</i>. 2018;131(2). doi:<a href=\"https://doi.org/10.1242/jcs.204198\">10.1242/jcs.204198</a>","ista":"Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. 2018. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. Journal of Cell Science. 131(2), jcs. 204198.","short":"R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, J. Friml, Journal of Cell Science 131 (2018).","chicago":"Tejos, Ricardo, Cecilia Rodríguez Furlán, Maciek Adamowski, Michael Sauer, Lorena Norambuena, and Jiří Friml. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” <i>Journal of Cell Science</i>. Company of Biologists, 2018. <a href=\"https://doi.org/10.1242/jcs.204198\">https://doi.org/10.1242/jcs.204198</a>.","mla":"Tejos, Ricardo, et al. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” <i>Journal of Cell Science</i>, vol. 131, no. 2, jcs. 204198, Company of Biologists, 2018, doi:<a href=\"https://doi.org/10.1242/jcs.204198\">10.1242/jcs.204198</a>."},"day":"29","has_accepted_license":"1","publication_status":"published","file":[{"date_updated":"2020-07-14T12:48:15Z","file_size":14925985,"creator":"dernst","content_type":"application/pdf","date_created":"2019-04-12T08:46:32Z","access_level":"open_access","checksum":"bf156c20a4f117b4b932370d54cbac8c","relation":"main_file","file_name":"2017_adamowski_PATELLINS_are.pdf","file_id":"6299"}],"doi":"10.1242/jcs.204198","date_published":"2018-01-29T00:00:00Z","external_id":{"isi":["000424842400019"]},"publication_identifier":{"issn":["0021-9533"]},"type":"journal_article","ec_funded":1,"month":"01","publist_id":"6530","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:49:10Z","date_updated":"2025-07-10T12:01:38Z","ddc":["581"],"file_date_updated":"2020-07-14T12:48:15Z","volume":131,"oa_version":"Published Version","publisher":"Company of Biologists","oa":1,"scopus_import":"1","author":[{"first_name":"Ricardo","full_name":"Tejos, Ricardo","last_name":"Tejos"},{"first_name":"Cecilia","full_name":"Rodríguez Furlán, Cecilia","last_name":"Rodríguez Furlán"},{"last_name":"Adamowski","full_name":"Adamowski, Maciek","orcid":"0000-0001-6463-5257","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","first_name":"Maciek"},{"last_name":"Sauer","full_name":"Sauer, Michael","first_name":"Michael"},{"last_name":"Norambuena","full_name":"Norambuena, Lorena","first_name":"Lorena"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jirí"}],"department":[{"_id":"JiFr"}],"article_processing_charge":"No","article_number":"jcs.204198","issue":"2","intvolume":"       131","pubrep_id":"988","project":[{"grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"}],"fulldoi":"https://doi.org/10.1242/jcs.204198","language":[{"iso":"eng"}]},{"title":"Diffraction-unlimited optical imaging for synaptic physiology","status":"public","year":"2018","publication_status":"published","day":"30","alternative_title":["Molecular and cellular neuroscience"],"citation":{"ieee":"J. G. Danzl, “Diffraction-unlimited optical imaging for synaptic physiology,” <i>Opera Medica et Physiologica</i>, vol. 4, no. S1. Lobachevsky State University of Nizhny Novgorod, p. 11, 2018.","ama":"Danzl JG. Diffraction-unlimited optical imaging for synaptic physiology. <i>Opera Medica et Physiologica</i>. 2018;4(S1):11. doi:<a href=\"https://doi.org/10.20388/omp2018.00s1.001\">10.20388/omp2018.00s1.001</a>","apa":"Danzl, J. G. (2018). Diffraction-unlimited optical imaging for synaptic physiology. <i>Opera Medica et Physiologica</i>. Lobachevsky State University of Nizhny Novgorod. <a href=\"https://doi.org/10.20388/omp2018.00s1.001\">https://doi.org/10.20388/omp2018.00s1.001</a>","chicago":"Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.” <i>Opera Medica et Physiologica</i>. Lobachevsky State University of Nizhny Novgorod, 2018. <a href=\"https://doi.org/10.20388/omp2018.00s1.001\">https://doi.org/10.20388/omp2018.00s1.001</a>.","mla":"Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.” <i>Opera Medica et Physiologica</i>, vol. 4, no. S1, Lobachevsky State University of Nizhny Novgorod, 2018, p. 11, doi:<a href=\"https://doi.org/10.20388/omp2018.00s1.001\">10.20388/omp2018.00s1.001</a>.","ista":"Danzl JG. 2018. Diffraction-unlimited optical imaging for synaptic physiology. Opera Medica et Physiologica. 4(S1), 11.","short":"J.G. Danzl, Opera Medica et Physiologica 4 (2018) 11."},"quality_controlled":"1","publication":"Opera Medica et Physiologica","_id":"9229","publication_identifier":{"issn":["2500-2287"],"eissn":["2500-2295"]},"doi":"10.20388/omp2018.00s1.001","date_published":"2018-06-30T00:00:00Z","month":"06","page":"11","main_file_link":[{"open_access":"1","url":"http://operamedphys.org/content/molecular-and-cellular-neuroscience"}],"type":"journal_article","date_updated":"2026-06-18T19:43:22Z","date_created":"2021-03-07T23:01:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Lobachevsky State University of Nizhny Novgorod","oa_version":"Published Version","article_type":"letter_note","volume":4,"ddc":["570"],"author":[{"full_name":"Danzl, Johann G","last_name":"Danzl","orcid":"0000-0001-8559-3973","first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","department":[{"_id":"JoDa"}],"scopus_import":"1","oa":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.20388/omp2018.00s1.001","intvolume":"         4","issue":"S1"},{"has_accepted_license":"1","publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"file":[{"access_level":"open_access","date_created":"2021-06-07T06:16:38Z","creator":"asandaue","content_type":"application/pdf","file_size":3045260,"date_updated":"2021-06-07T06:16:38Z","success":1,"file_id":"9472","file_name":"2018_PNAS_Frost.pdf","relation":"main_file","checksum":"810260dc0e3cc3033e15c19ad0dc123e"}],"_id":"9471","day":"15","citation":{"mla":"Frost, Jennifer M., et al. “FACT Complex Is Required for DNA Demethylation at Heterochromatin during Reproduction in Arabidopsis.” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 20, National Academy of Sciences, 2018, pp. E4720–29, doi:<a href=\"https://doi.org/10.1073/pnas.1713333115\">10.1073/pnas.1713333115</a>.","chicago":"Frost, Jennifer M., M. Yvonne Kim, Guen Tae Park, Ping-Hung Hsieh, Miyuki Nakamura, Samuel J. H. Lin, Hyunjin Yoo, et al. “FACT Complex Is Required for DNA Demethylation at Heterochromatin during Reproduction in Arabidopsis.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1713333115\">https://doi.org/10.1073/pnas.1713333115</a>.","short":"J.M. Frost, M.Y. Kim, G.T. Park, P.-H. Hsieh, M. Nakamura, S.J.H. Lin, H. Yoo, J. Choi, Y. Ikeda, T. Kinoshita, Y. Choi, D. Zilberman, R.L. Fischer, Proceedings of the National Academy of Sciences 115 (2018) E4720–E4729.","ista":"Frost JM, Kim MY, Park GT, Hsieh P-H, Nakamura M, Lin SJH, Yoo H, Choi J, Ikeda Y, Kinoshita T, Choi Y, Zilberman D, Fischer RL. 2018. FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. Proceedings of the National Academy of Sciences. 115(20), E4720–E4729.","ama":"Frost JM, Kim MY, Park GT, et al. FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. <i>Proceedings of the National Academy of Sciences</i>. 2018;115(20):E4720-E4729. doi:<a href=\"https://doi.org/10.1073/pnas.1713333115\">10.1073/pnas.1713333115</a>","ieee":"J. M. Frost <i>et al.</i>, “FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis,” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 20. National Academy of Sciences, pp. E4720–E4729, 2018.","apa":"Frost, J. M., Kim, M. Y., Park, G. T., Hsieh, P.-H., Nakamura, M., Lin, S. J. H., … Fischer, R. L. (2018). FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1713333115\">https://doi.org/10.1073/pnas.1713333115</a>"},"publication":"Proceedings of the National Academy of Sciences","quality_controlled":"1","year":"2018","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":[{"text":"The DEMETER (DME) DNA glycosylase catalyzes genome-wide DNA demethylation and is required for endosperm genomic imprinting and embryo viability. Targets of DME-mediated DNA demethylation reside in small, euchromatic, AT-rich transposons and at the boundaries of large transposons, but how DME interacts with these diverse chromatin states is unknown. The STRUCTURE SPECIFIC RECOGNITION PROTEIN 1 (SSRP1) subunit of the chromatin remodeler FACT (facilitates chromatin transactions), was previously shown to be involved in the DME-dependent regulation of genomic imprinting in Arabidopsis endosperm. Therefore, to investigate the interaction between DME and chromatin, we focused on the activity of the two FACT subunits, SSRP1 and SUPPRESSOR of TY16 (SPT16), during reproduction in Arabidopsis. We found that FACT colocalizes with nuclear DME in vivo, and that DME has two classes of target sites, the first being euchromatic and accessible to DME, but the second, representing over half of DME targets, requiring the action of FACT for DME-mediated DNA demethylation genome-wide. Our results show that the FACT-dependent DME targets are GC-rich heterochromatin domains with high nucleosome occupancy enriched with H3K9me2 and H3K27me1. Further, we demonstrate that heterochromatin-associated linker histone H1 specifically mediates the requirement for FACT at a subset of DME-target loci. Overall, our results demonstrate that FACT is required for DME targeting by facilitating its access to heterochromatin.","lang":"eng"}],"title":"FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis","status":"public","month":"05","type":"journal_article","page":"E4720-E4729","external_id":{"pmid":["29712855"]},"keyword":["Multidisciplinary"],"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"doi":"10.1073/pnas.1713333115","date_published":"2018-05-15T00:00:00Z","oa_version":"Published Version","article_type":"original","pmid":1,"publisher":"National Academy of Sciences","file_date_updated":"2021-06-07T06:16:38Z","ddc":["580"],"volume":115,"related_material":{"link":[{"url":"https://doi.org/10.1101/187674 ","relation":"earlier_version"}]},"extern":"1","date_updated":"2021-12-14T07:53:40Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2021-06-07T06:11:28Z","language":[{"iso":"eng"}],"issue":"20","intvolume":"       115","fulldoi":"https://doi.org/10.1073/pnas.1713333115","scopus_import":"1","oa":1,"article_processing_charge":"No","author":[{"full_name":"Frost, Jennifer M.","last_name":"Frost","first_name":"Jennifer M."},{"first_name":"M. Yvonne","last_name":"Kim","full_name":"Kim, M. Yvonne"},{"first_name":"Guen Tae","last_name":"Park","full_name":"Park, Guen Tae"},{"full_name":"Hsieh, Ping-Hung","last_name":"Hsieh","first_name":"Ping-Hung"},{"first_name":"Miyuki","last_name":"Nakamura","full_name":"Nakamura, Miyuki"},{"first_name":"Samuel J. H.","last_name":"Lin","full_name":"Lin, Samuel J. H."},{"last_name":"Yoo","full_name":"Yoo, Hyunjin","first_name":"Hyunjin"},{"first_name":"Jaemyung","last_name":"Choi","full_name":"Choi, Jaemyung"},{"first_name":"Yoko","full_name":"Ikeda, Yoko","last_name":"Ikeda"},{"last_name":"Kinoshita","full_name":"Kinoshita, Tetsu","first_name":"Tetsu"},{"full_name":"Choi, Yeonhee","last_name":"Choi","first_name":"Yeonhee"},{"orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel","last_name":"Zilberman","full_name":"Zilberman, Daniel"},{"full_name":"Fischer, Robert L.","last_name":"Fischer","first_name":"Robert L."}],"department":[{"_id":"DaZi"}]},{"article_processing_charge":"No","department":[{"_id":"SiHi"}],"author":[{"first_name":"Juan","full_name":"Higareda Almaraz, Juan","last_name":"Higareda Almaraz"},{"first_name":"Michael","full_name":"Karbiener, Michael","last_name":"Karbiener"},{"first_name":"Maude","last_name":"Giroud","full_name":"Giroud, Maude"},{"full_name":"Pauler, Florian","last_name":"Pauler","first_name":"Florian","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7462-0048"},{"first_name":"Teresa","last_name":"Gerhalter","full_name":"Gerhalter, Teresa"},{"first_name":"Stephan","full_name":"Herzig, Stephan","last_name":"Herzig"},{"first_name":"Marcel","full_name":"Scheideler, Marcel","last_name":"Scheideler"}],"date_published":"2018-11-03T00:00:00Z","oa":1,"doi":"10.6084/m9.figshare.7295339.v1","fulldoi":"https://doi.org/10.6084/m9.figshare.7295339.v1","type":"research_data_reference","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7295339.v1"}],"month":"11","date_created":"2021-08-06T12:26:53Z","title":"Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","status":"public","abstract":[{"text":"Table S1. Genes with highest betweenness. Table S2. Local and Master regulators up-regulated. Table S3. Local and Master regulators down-regulated (XLSX 23 kb).","lang":"eng"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2018","date_updated":"2023-09-13T09:10:47Z","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"20"}]},"citation":{"short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018).","ista":"Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S, Scheideler M. 2018. Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>.","chicago":"Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler, Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Additional File 1: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” Springer Nature, 2018. <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">https://doi.org/10.6084/m9.figshare.7295339.v1</a>.","mla":"Higareda Almaraz, Juan, et al. <i>Additional File 1: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes</i>. Springer Nature, 2018, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>.","apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., &#38; Scheideler, M. (2018). Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">https://doi.org/10.6084/m9.figshare.7295339.v1</a>","ieee":"J. Higareda Almaraz <i>et al.</i>, “Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes.” Springer Nature, 2018.","ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. 2018. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>"},"day":"03","_id":"9807","publisher":"Springer Nature","oa_version":"Published Version"},{"oa":1,"doi":"10.6084/m9.figshare.7295369.v1","date_published":"2018-11-03T00:00:00Z","author":[{"first_name":"Juan","full_name":"Higareda Almaraz, Juan","last_name":"Higareda Almaraz"},{"full_name":"Karbiener, Michael","last_name":"Karbiener","first_name":"Michael"},{"last_name":"Giroud","full_name":"Giroud, Maude","first_name":"Maude"},{"orcid":"0000-0002-7462-0048","first_name":"Florian","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","full_name":"Pauler, Florian","last_name":"Pauler"},{"last_name":"Gerhalter","full_name":"Gerhalter, Teresa","first_name":"Teresa"},{"full_name":"Herzig, Stephan","last_name":"Herzig","first_name":"Stephan"},{"first_name":"Marcel","full_name":"Scheideler, Marcel","last_name":"Scheideler"}],"article_processing_charge":"No","department":[{"_id":"SiHi"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7295369.v1"}],"type":"research_data_reference","fulldoi":"https://doi.org/10.6084/m9.figshare.7295369.v1","month":"11","abstract":[{"text":"Table S4. Counts per Gene per Million Reads Mapped. (XLSX 2751 kb).","lang":"eng"}],"year":"2018","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","title":"Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","status":"public","date_created":"2021-08-06T12:31:57Z","related_material":{"record":[{"relation":"used_in_publication","id":"20","status":"public"}]},"date_updated":"2023-09-13T09:10:47Z","_id":"9808","citation":{"chicago":"Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler, Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Additional File 3: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” Springer Nature, 2018. <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">https://doi.org/10.6084/m9.figshare.7295369.v1</a>.","mla":"Higareda Almaraz, Juan, et al. <i>Additional File 3: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes</i>. Springer Nature, 2018, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018).","ista":"Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S, Scheideler M. 2018. Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>.","ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. 2018. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>","ieee":"J. Higareda Almaraz <i>et al.</i>, “Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes.” Springer Nature, 2018.","apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., &#38; Scheideler, M. (2018). Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">https://doi.org/10.6084/m9.figshare.7295369.v1</a>"},"day":"03","oa_version":"Published Version","publisher":"Springer Nature"},{"oa_version":"Published Version","publisher":"Public Library of Science","_id":"9810","day":"16","citation":{"apa":"Chaudhry, W., Pleska, M., Shah, N., Weiss, H., Mccall, I., Meyer, J., … Levin, B. (2018). Numerical data used in figures. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">https://doi.org/10.1371/journal.pbio.2005971.s008</a>","ama":"Chaudhry W, Pleska M, Shah N, et al. Numerical data used in figures. 2018. doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">10.1371/journal.pbio.2005971.s008</a>","ieee":"W. Chaudhry <i>et al.</i>, “Numerical data used in figures.” Public Library of Science, 2018.","short":"W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta, C.C. Guet, B. Levin, (2018).","ista":"Chaudhry W, Pleska M, Shah N, Weiss H, Mccall I, Meyer J, Gupta A, Guet CC, Levin B. 2018. Numerical data used in figures, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">10.1371/journal.pbio.2005971.s008</a>.","chicago":"Chaudhry, Waqas, Maros Pleska, Nilang Shah, Howard Weiss, Ingrid Mccall, Justin Meyer, Animesh Gupta, Calin C Guet, and Bruce Levin. “Numerical Data Used in Figures.” Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">https://doi.org/10.1371/journal.pbio.2005971.s008</a>.","mla":"Chaudhry, Waqas, et al. <i>Numerical Data Used in Figures</i>. Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">10.1371/journal.pbio.2005971.s008</a>."},"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"82"}]},"date_updated":"2023-09-13T08:45:41Z","year":"2018","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_created":"2021-08-06T12:43:44Z","status":"public","title":"Numerical data used in figures","month":"08","type":"research_data_reference","fulldoi":"https://doi.org/10.1371/journal.pbio.2005971.s008","date_published":"2018-08-16T00:00:00Z","doi":"10.1371/journal.pbio.2005971.s008","author":[{"first_name":"Waqas","last_name":"Chaudhry","full_name":"Chaudhry, Waqas"},{"orcid":"0000-0001-7460-7479","first_name":"Maros","id":"4569785E-F248-11E8-B48F-1D18A9856A87","full_name":"Pleska, Maros","last_name":"Pleska"},{"last_name":"Shah","full_name":"Shah, Nilang","first_name":"Nilang"},{"first_name":"Howard","full_name":"Weiss, Howard","last_name":"Weiss"},{"last_name":"Mccall","full_name":"Mccall, Ingrid","first_name":"Ingrid"},{"first_name":"Justin","full_name":"Meyer, Justin","last_name":"Meyer"},{"first_name":"Animesh","last_name":"Gupta","full_name":"Gupta, Animesh"},{"last_name":"Guet","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","orcid":"0000-0001-6220-2052"},{"first_name":"Bruce","last_name":"Levin","full_name":"Levin, Bruce"}],"department":[{"_id":"CaGu"}],"article_processing_charge":"No"},{"fulldoi":"https://doi.org/10.6084/m9.figshare.6401390.v1","type":"research_data_reference","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.6401390.v1","open_access":"1"}],"month":"05","department":[{"_id":"FyKo"}],"article_processing_charge":"No","author":[{"full_name":"Zapata, Luis","last_name":"Zapata","first_name":"Luis"},{"full_name":"Pich, Oriol","last_name":"Pich","first_name":"Oriol"},{"full_name":"Serrano, Luis","last_name":"Serrano","first_name":"Luis"},{"id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","first_name":"Fyodor","orcid":"0000-0001-8243-4694","last_name":"Kondrashov","full_name":"Kondrashov, Fyodor"},{"first_name":"Stephan","last_name":"Ossowski","full_name":"Ossowski, Stephan"},{"last_name":"Schaefer","full_name":"Schaefer, Martin","first_name":"Martin"}],"date_published":"2018-05-31T00:00:00Z","doi":"10.6084/m9.figshare.6401390.v1","oa":1,"citation":{"short":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, M. Schaefer, (2018).","ista":"Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. 2018. Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.6401390.v1\">10.6084/m9.figshare.6401390.v1</a>.","mla":"Zapata, Luis, et al. <i>Additional File 1: Of Negative Selection in Tumor Genome Evolution Acts on Essential Cellular Functions and the Immunopeptidome</i>. Springer Nature, 2018, doi:<a href=\"https://doi.org/10.6084/m9.figshare.6401390.v1\">10.6084/m9.figshare.6401390.v1</a>.","chicago":"Zapata, Luis, Oriol Pich, Luis Serrano, Fyodor Kondrashov, Stephan Ossowski, and Martin Schaefer. “Additional File 1: Of Negative Selection in Tumor Genome Evolution Acts on Essential Cellular Functions and the Immunopeptidome.” Springer Nature, 2018. <a href=\"https://doi.org/10.6084/m9.figshare.6401390.v1\">https://doi.org/10.6084/m9.figshare.6401390.v1</a>.","apa":"Zapata, L., Pich, O., Serrano, L., Kondrashov, F., Ossowski, S., &#38; Schaefer, M. (2018). Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.6401390.v1\">https://doi.org/10.6084/m9.figshare.6401390.v1</a>","ieee":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, and M. Schaefer, “Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome.” Springer Nature, 2018.","ama":"Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome. 2018. doi:<a href=\"https://doi.org/10.6084/m9.figshare.6401390.v1\">10.6084/m9.figshare.6401390.v1</a>"},"day":"31","_id":"9811","publisher":"Springer Nature","oa_version":"Preprint","date_created":"2021-08-06T12:53:49Z","status":"public","title":"Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2018","abstract":[{"text":"This document contains additional supporting evidence presented as supplemental tables. (XLSX 50Â kb)","lang":"eng"}],"date_updated":"2025-04-15T08:30:30Z","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"279"}]}}]