--- _id: '297' abstract: - lang: eng text: Graph games played by two players over finite-state graphs are central in many problems in computer science. In particular, graph games with ω -regular winning conditions, specified as parity objectives, which can express properties such as safety, liveness, fairness, are the basic framework for verification and synthesis of reactive systems. The decisions for a player at various states of the graph game are represented as strategies. While the algorithmic problem for solving graph games with parity objectives has been widely studied, the most prominent data-structure for strategy representation in graph games has been binary decision diagrams (BDDs). However, due to the bit-level representation, BDDs do not retain the inherent flavor of the decisions of strategies, and are notoriously hard to minimize to obtain succinct representation. In this work we propose decision trees for strategy representation in graph games. Decision trees retain the flavor of decisions of strategies and allow entropy-based minimization to obtain succinct trees. However, decision trees work in settings (e.g., probabilistic models) where errors are allowed, and overfitting of data is typically avoided. In contrast, for strategies in graph games no error is allowed, and the decision tree must represent the entire strategy. We develop new techniques to extend decision trees to overcome the above obstacles, while retaining the entropy-based techniques to obtain succinct trees. We have implemented our techniques to extend the existing decision tree solvers. We present experimental results for problems in reactive synthesis to show that decision trees provide a much more efficient data-structure for strategy representation as compared to BDDs. alternative_title: - LNCS article_processing_charge: No author: - first_name: Tomáš full_name: Brázdil, Tomáš last_name: Brázdil - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: 'Brázdil T, Chatterjee K, Kretinsky J, Toman V. Strategy representation by decision trees in reactive synthesis. In: Vol 10805. Springer; 2018:385-407. doi:10.1007/978-3-319-89960-2_21' apa: 'Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21' chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21. ieee: 'T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.' ista: 'Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.' mla: Brázdil, Tomáš, et al. Strategy Representation by Decision Trees in Reactive Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21. short: T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp. 385–407. conference: end_date: 2018-04-20 location: Thessaloniki, Greece name: 'TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems' start_date: 2018-04-14 date_created: 2018-12-11T11:45:41Z date_published: 2018-04-12T00:00:00Z date_updated: 2023-09-19T09:57:08Z day: '12' ddc: - '000' department: - _id: KrCh - _id: ToHe doi: 10.1007/978-3-319-89960-2_21 ec_funded: 1 external_id: isi: - '000546326300021' file: - access_level: open_access checksum: b13874ffb114932ad9cc2586b7469db4 content_type: application/pdf creator: dernst date_created: 2018-12-17T16:29:08Z date_updated: 2020-07-14T12:45:57Z file_id: '5723' file_name: 2018_LNCS_Brazdil.pdf file_size: 1829940 relation: main_file file_date_updated: 2020-07-14T12:45:57Z has_accepted_license: '1' intvolume: ' 10805' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 385 - 407 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_status: published publisher: Springer publist_id: '7584' quality_controlled: '1' scopus_import: '1' status: public title: Strategy representation by decision trees in reactive synthesis 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) type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 10805 year: '2018' ... --- _id: '141' abstract: - lang: eng text: 'Given a model and a specification, the fundamental model-checking problem asks for algorithmic verification of whether the model satisfies the specification. We consider graphs and Markov decision processes (MDPs), which are fundamental models for reactive systems. One of the very basic specifications that arise in verification of reactive systems is the strong fairness (aka Streett) objective. Given different types of requests and corresponding grants, the objective requires that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All ω -regular objectives can be expressed as Streett objectives and hence they are canonical in verification. To handle the state-space explosion, symbolic algorithms are required that operate on a succinct implicit representation of the system rather than explicitly accessing the system. While explicit algorithms for graphs and MDPs with Streett objectives have been widely studied, there has been no improvement of the basic symbolic algorithms. The worst-case numbers of symbolic steps required for the basic symbolic algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work we present the first sub-quadratic symbolic algorithm for graphs with Streett objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic insights we present an implementation of the new symbolic approach and show that it improves the existing approach on several academic benchmark examples.' acknowledgement: 'Acknowledgements. K. C. and M. H. are partially supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant (279307: Graph Games). V. T. is partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement No. 665385.' alternative_title: - LNCS article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Veronika full_name: Loitzenbauer, Veronika last_name: Loitzenbauer - first_name: Simin full_name: Oraee, Simin last_name: Oraee - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. In: Vol 10982. Springer; 2018:178-197. doi:10.1007/978-3-319-96142-2_13' apa: 'Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13' chicago: Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13. ieee: 'K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.' ista: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.' mla: Chatterjee, Krishnendu, et al. Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp. 178–97, doi:10.1007/978-3-319-96142-2_13. short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197. conference: end_date: 2018-07-17 location: Oxford, United Kingdom name: 'CAV: Computer Aided Verification' start_date: 2018-07-14 date_created: 2018-12-11T11:44:51Z date_published: 2018-07-18T00:00:00Z date_updated: 2023-09-19T09:59:55Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-319-96142-2_13 ec_funded: 1 external_id: isi: - '000491469700013' file: - access_level: open_access checksum: 1a6ffa4febe8bb8ac28be3adb3eafebc content_type: application/pdf creator: dernst date_created: 2018-12-18T08:52:38Z date_updated: 2020-07-14T12:44:53Z file_id: '5737' file_name: 2018_LNCS_Chatterjee.pdf file_size: 675606 relation: main_file file_date_updated: 2020-07-14T12:44:53Z has_accepted_license: '1' intvolume: ' 10982' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 178-197 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_status: published publisher: Springer publist_id: '7782' quality_controlled: '1' related_material: record: - id: '10199' relation: dissertation_contains status: public scopus_import: '1' status: public title: Symbolic algorithms for graphs and Markov decision processes with fairness objectives 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) type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 10982 year: '2018' ... --- _id: '298' abstract: - lang: eng text: "Memory-hard functions (MHF) are functions whose evaluation cost is dominated by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated hardware (like FPGAs or ASICs) is not much cheaper than on off-the-shelf hardware (like x86 CPUs). MHFs have interesting cryptographic applications, most notably to password hashing and securing blockchains.\r\n\r\nAlwen and Serbinenko [STOC’15] define the cumulative memory complexity (cmc) of a function as the sum (over all time-steps) of the amount of memory required to compute the function. They advocate that a good MHF must have high cmc. Unlike previous notions, cmc takes into account that dedicated hardware might exploit amortization and parallelism. Still, cmc has been critizised as insufficient, as it fails to capture possible time-memory trade-offs; as memory cost doesn’t scale linearly, functions with the same cmc could still have very different actual hardware cost.\r\n\r\nIn this work we address this problem, and introduce the notion of sustained-memory complexity, which requires that any algorithm evaluating the function must use a large amount of memory for many steps. We construct functions (in the parallel random oracle model) whose sustained-memory complexity is almost optimal: our function can be evaluated using n steps and O(n/log(n)) memory, in each step making one query to the (fixed-input length) random oracle, while any algorithm that can make arbitrary many parallel queries to the random oracle, still needs Ω(n/log(n)) memory for Ω(n) steps.\r\n\r\nAs has been done for various notions (including cmc) before, we reduce the task of constructing an MHFs with high sustained-memory complexity to proving pebbling lower bounds on DAGs. Our main technical contribution is the construction is a family of DAGs on n nodes with constant indegree with high “sustained-space complexity”, meaning that any parallel black-pebbling strategy requires Ω(n/log(n)) pebbles for at least Ω(n) steps.\r\n\r\nAlong the way we construct a family of maximally “depth-robust” DAGs with maximum indegree O(logn) , improving upon the construction of Mahmoody et al. [ITCS’13] which had maximum indegree O(log2n⋅" alternative_title: - LNCS article_processing_charge: No author: - first_name: Joel F full_name: Alwen, Joel F id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87 last_name: Alwen - first_name: Jeremiah full_name: Blocki, Jeremiah last_name: Blocki - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Alwen JF, Blocki J, Pietrzak KZ. Sustained space complexity. In: Vol 10821. Springer; 2018:99-130. doi:10.1007/978-3-319-78375-8_4' apa: 'Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2018). Sustained space complexity (Vol. 10821, pp. 99–130). Presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78375-8_4' chicago: Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Sustained Space Complexity,” 10821:99–130. Springer, 2018. https://doi.org/10.1007/978-3-319-78375-8_4. ieee: 'J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Sustained space complexity,” presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 99–130.' ista: 'Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt 2018: Advances in Cryptology, LNCS, vol. 10821, 99–130.' mla: Alwen, Joel F., et al. Sustained Space Complexity. Vol. 10821, Springer, 2018, pp. 99–130, doi:10.1007/978-3-319-78375-8_4. short: J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130. conference: end_date: 2018-05-03 location: Tel Aviv, Israel name: 'Eurocrypt 2018: Advances in Cryptology' start_date: 2018-04-29 date_created: 2018-12-11T11:45:41Z date_published: 2018-03-31T00:00:00Z date_updated: 2023-09-19T09:59:30Z day: '31' department: - _id: KrPi doi: 10.1007/978-3-319-78375-8_4 ec_funded: 1 external_id: arxiv: - '1705.05313' isi: - '000517098700004' intvolume: ' 10821' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1705.05313 month: '03' oa: 1 oa_version: Preprint page: 99 - 130 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication_status: published publisher: Springer publist_id: '7583' quality_controlled: '1' scopus_import: '1' status: public title: Sustained space complexity type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 10821 year: '2018' ... --- _id: '36' abstract: - lang: eng text: Wheat (Triticum ssp.) is one of the most important human food sources. However, this crop is very sensitive to temperature changes. Specifically, processes during wheat leaf, flower, and seed development and photosynthesis, which all contribute to the yield of this crop, are affected by high temperature. While this has to some extent been investigated on physiological, developmental, and molecular levels, very little is known about early signalling events associated with an increase in temperature. Phosphorylation-mediated signalling mechanisms, which are quick and dynamic, are associated with plant growth and development, also under abiotic stress conditions. Therefore, we probed the impact of a short-term and mild increase in temperature on the wheat leaf and spikelet phosphoproteome. In total, 3822 (containing 5178 phosphosites) and 5581 phosphopeptides (containing 7023 phosphosites) were identified in leaf and spikelet samples, respectively. Following statistical analysis, the resulting data set provides the scientific community with a first large-scale plant phosphoproteome under the control of higher ambient temperature. This community resource on the high temperature-mediated wheat phosphoproteome will be valuable for future studies. Our analyses also revealed a core set of common proteins between leaf and spikelet, suggesting some level of conserved regulatory mechanisms. Furthermore, we observed temperature-regulated interconversion of phosphoforms, which probably impacts protein activity. acknowledgement: TZ is supported by a grant from the Chinese Scholarship Council. article_processing_charge: No author: - first_name: Lam full_name: Vu, Lam last_name: Vu - first_name: Tingting full_name: Zhu, Tingting last_name: Zhu - first_name: Inge full_name: Verstraeten, Inge id: 362BF7FE-F248-11E8-B48F-1D18A9856A87 last_name: Verstraeten orcid: 0000-0001-7241-2328 - first_name: Brigitte full_name: Van De Cotte, Brigitte last_name: Van De Cotte - first_name: Kris full_name: Gevaert, Kris last_name: Gevaert - first_name: Ive full_name: De Smet, Ive last_name: De Smet citation: ama: Vu L, Zhu T, Verstraeten I, Van De Cotte B, Gevaert K, De Smet I. Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms. Journal of Experimental Botany. 2018;69(19):4609-4624. doi:10.1093/jxb/ery204 apa: Vu, L., Zhu, T., Verstraeten, I., Van De Cotte, B., Gevaert, K., & De Smet, I. (2018). Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/ery204 chicago: Vu, Lam, Tingting Zhu, Inge Verstraeten, Brigitte Van De Cotte, Kris Gevaert, and Ive De Smet. “Temperature-Induced Changes in the Wheat Phosphoproteome Reveal Temperature-Regulated Interconversion of Phosphoforms.” Journal of Experimental Botany. Oxford University Press, 2018. https://doi.org/10.1093/jxb/ery204. ieee: L. Vu, T. Zhu, I. Verstraeten, B. Van De Cotte, K. Gevaert, and I. De Smet, “Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms,” Journal of Experimental Botany, vol. 69, no. 19. Oxford University Press, pp. 4609–4624, 2018. ista: Vu L, Zhu T, Verstraeten I, Van De Cotte B, Gevaert K, De Smet I. 2018. Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms. Journal of Experimental Botany. 69(19), 4609–4624. mla: Vu, Lam, et al. “Temperature-Induced Changes in the Wheat Phosphoproteome Reveal Temperature-Regulated Interconversion of Phosphoforms.” Journal of Experimental Botany, vol. 69, no. 19, Oxford University Press, 2018, pp. 4609–24, doi:10.1093/jxb/ery204. short: L. Vu, T. Zhu, I. Verstraeten, B. Van De Cotte, K. Gevaert, I. De Smet, Journal of Experimental Botany 69 (2018) 4609–4624. date_created: 2018-12-11T11:44:17Z date_published: 2018-08-31T00:00:00Z date_updated: 2023-09-19T10:00:46Z day: '31' ddc: - '581' department: - _id: JiFr doi: 10.1093/jxb/ery204 external_id: isi: - '000443568700010' file: - access_level: open_access checksum: 34cb0a1611588b75bd6f4913fb4e30f1 content_type: application/pdf creator: dernst date_created: 2018-12-18T09:47:51Z date_updated: 2020-07-14T12:46:13Z file_id: '5741' file_name: 2018_JournalExperimBotany_Vu.pdf file_size: 3359316 relation: main_file file_date_updated: 2020-07-14T12:46:13Z has_accepted_license: '1' intvolume: ' 69' isi: 1 issue: '19' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 4609 - 4624 publication: Journal of Experimental Botany publication_status: published publisher: Oxford University Press publist_id: '8019' quality_controlled: '1' scopus_import: '1' status: public title: Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms 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) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 69 year: '2018' ... --- _id: '326' abstract: - lang: eng text: Three-dimensional (3D) super-resolution microscopy technique structured illumination microscopy (SIM) imaging of dendritic spines along the dendrite has not been previously performed in fixed tissues, mainly due to deterioration of the stripe pattern of the excitation laser induced by light scattering and optical aberrations. To address this issue and solve these optical problems, we applied a novel clearing reagent, LUCID, to fixed brains. In SIM imaging, the penetration depth and the spatial resolution were improved in LUCID-treated slices, and 160-nm spatial resolution was obtained in a large portion of the imaging volume on a single apical dendrite. Furthermore, in a morphological analysis of spine heads of layer V pyramidal neurons (L5PNs) in the medial prefrontal cortex (mPFC) of chronic dexamethasone (Dex)-treated mice, SIM imaging revealed an altered distribution of spine forms that could not be detected by high-NA confocal imaging. Thus, super-resolution SIM imaging represents a promising high-throughput method for revealing spine morphologies in single dendrites. acknowledged_ssus: - _id: EM-Fac article_processing_charge: No author: - first_name: Kazuaki full_name: Sawada, Kazuaki last_name: Sawada - first_name: Ryosuke full_name: Kawakami, Ryosuke last_name: Kawakami - first_name: Ryuichi full_name: Shigemoto, Ryuichi id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 - first_name: Tomomi full_name: Nemoto, Tomomi last_name: Nemoto citation: ama: Sawada K, Kawakami R, Shigemoto R, Nemoto T. Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices. European Journal of Neuroscience. 2018;47(9):1033-1042. doi:10.1111/ejn.13901 apa: Sawada, K., Kawakami, R., Shigemoto, R., & Nemoto, T. (2018). Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices. European Journal of Neuroscience. Wiley. https://doi.org/10.1111/ejn.13901 chicago: Sawada, Kazuaki, Ryosuke Kawakami, Ryuichi Shigemoto, and Tomomi Nemoto. “Super Resolution Structural Analysis of Dendritic Spines Using Three-Dimensional Structured Illumination Microscopy in Cleared Mouse Brain Slices.” European Journal of Neuroscience. Wiley, 2018. https://doi.org/10.1111/ejn.13901. ieee: K. Sawada, R. Kawakami, R. Shigemoto, and T. Nemoto, “Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices,” European Journal of Neuroscience, vol. 47, no. 9. Wiley, pp. 1033–1042, 2018. ista: Sawada K, Kawakami R, Shigemoto R, Nemoto T. 2018. Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices. European Journal of Neuroscience. 47(9), 1033–1042. mla: Sawada, Kazuaki, et al. “Super Resolution Structural Analysis of Dendritic Spines Using Three-Dimensional Structured Illumination Microscopy in Cleared Mouse Brain Slices.” European Journal of Neuroscience, vol. 47, no. 9, Wiley, 2018, pp. 1033–42, doi:10.1111/ejn.13901. short: K. Sawada, R. Kawakami, R. Shigemoto, T. Nemoto, European Journal of Neuroscience 47 (2018) 1033–1042. date_created: 2018-12-11T11:45:50Z date_published: 2018-03-07T00:00:00Z date_updated: 2023-09-19T09:58:40Z day: '07' ddc: - '570' department: - _id: RySh doi: 10.1111/ejn.13901 external_id: isi: - '000431496400001' file: - access_level: open_access checksum: 98e901d8229e44aa8f3b51d248dedd09 content_type: application/pdf creator: dernst date_created: 2018-12-17T16:16:50Z date_updated: 2020-07-14T12:46:06Z file_id: '5721' file_name: 2018_EJN_Sawada.pdf file_size: 4850261 relation: main_file file_date_updated: 2020-07-14T12:46:06Z has_accepted_license: '1' intvolume: ' 47' isi: 1 issue: '9' language: - iso: eng license: https://creativecommons.org/licenses/by-nc/4.0/ month: '03' oa: 1 oa_version: Published Version page: 1033 - 1042 publication: European Journal of Neuroscience publication_status: published publisher: Wiley publist_id: '7539' quality_controlled: '1' scopus_import: '1' status: public title: Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 47 year: '2018' ...