[{"license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"file_date_updated":"2020-07-14T12:47:57Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}],"publication_status":"published","year":"2018","volume":124,"date_updated":"2021-01-12T08:13:26Z","date_created":"2020-01-30T09:16:05Z","author":[{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-095-8"]},"month":"12","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/194"}],"language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.ITCS.2019.59","conference":{"name":"ITCS: Innovations in theoretical Computer Science Conference","start_date":"2019-01-10","location":"San Diego, CA, United States","end_date":"2019-01-12"},"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"text":"Proofs of space (PoS) [Dziembowski et al., CRYPTO'15] are proof systems where a prover can convince a verifier that he \"wastes\" disk space. PoS were introduced as a more ecological and economical replacement for proofs of work which are currently used to secure blockchains like Bitcoin. In this work we investigate extensions of PoS which allow the prover to embed useful data into the dedicated space, which later can be recovered. Our first contribution is a security proof for the original PoS from CRYPTO'15 in the random oracle model (the original proof only applied to a restricted class of adversaries which can store a subset of the data an honest prover would store). When this PoS is instantiated with recent constructions of maximally depth robust graphs, our proof implies basically optimal security. As a second contribution we show three different extensions of this PoS where useful data can be embedded into the space required by the prover. Our security proof for the PoS extends (non-trivially) to these constructions. We discuss how some of these variants can be used as proofs of catalytic space (PoCS), a notion we put forward in this work, and which basically is a PoS where most of the space required by the prover can be used to backup useful data. Finally we discuss how one of the extensions is a candidate construction for a proof of replication (PoR), a proof system recently suggested in the Filecoin whitepaper. ","lang":"eng"}],"intvolume":" 124","title":"Proofs of catalytic space","ddc":["000"],"status":"public","_id":"7407","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":822884,"content_type":"application/pdf","creator":"dernst","file_name":"2018_LIPIcs_Pietrzak.pdf","access_level":"open_access","date_created":"2020-02-04T08:17:52Z","date_updated":"2020-07-14T12:47:57Z","checksum":"5cebb7f7849a3beda898f697d755dd96","relation":"main_file","file_id":"7443"}],"oa_version":"Published Version","scopus_import":1,"has_accepted_license":"1","article_processing_charge":"No","day":"31","page":"59:1-59:25","citation":{"short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.","mla":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.","chicago":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 124:59:1-59:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.","ama":"Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59","ieee":"K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), San Diego, CA, United States, 2018, vol. 124, p. 59:1-59:25.","apa":"Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.59","ista":"Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124, 59:1-59:25."},"publication":"10th Innovations in Theoretical Computer Science Conference (ITCS 2019)","date_published":"2018-12-31T00:00:00Z"},{"_id":"6001","year":"2018","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"ThreadScan: Automatic and scalable memory reclamation","status":"public","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","intvolume":" 4","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Leiserson, William","first_name":"William","last_name":"Leiserson"},{"full_name":"Matveev, Alexander","last_name":"Matveev","first_name":"Alexander"},{"full_name":"Shavit, Nir","first_name":"Nir","last_name":"Shavit"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"779"}]},"date_created":"2019-02-14T13:24:11Z","date_updated":"2023-02-23T13:17:54Z","oa_version":"None","volume":4,"article_number":"18","type":"journal_article","abstract":[{"text":"The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU are either prohibitively expensive or require significant programming expertise to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated.\r\nIn this article, we take a new approach to concurrent memory reclamation. Instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads.\r\nInitial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free.","lang":"eng"}],"issue":"4","publication":"ACM Transactions on Parallel Computing","citation":{"ama":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. 2018;4(4). doi:10.1145/3201897","apa":"Alistarh, D.-A., Leiserson, W., Matveev, A., & Shavit, N. (2018). ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. Association for Computing Machinery. https://doi.org/10.1145/3201897","ieee":"D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” ACM Transactions on Parallel Computing, vol. 4, no. 4. Association for Computing Machinery, 2018.","ista":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2018. ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. 4(4), 18.","short":"D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on Parallel Computing 4 (2018).","mla":"Alistarh, Dan-Adrian, et al. “ThreadScan: Automatic and Scalable Memory Reclamation.” ACM Transactions on Parallel Computing, vol. 4, no. 4, 18, Association for Computing Machinery, 2018, doi:10.1145/3201897.","chicago":"Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation.” ACM Transactions on Parallel Computing. Association for Computing Machinery, 2018. https://doi.org/10.1145/3201897."},"quality_controlled":"1","doi":"10.1145/3201897","date_published":"2018-09-01T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":1,"month":"09","day":"01","publication_identifier":{"issn":["2329-4949"]}},{"quality_controlled":"1","external_id":{"arxiv":["1802.05668"]},"oa":1,"citation":{"ama":"Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and quantization. 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.","apa":"Polino, A., Pascanu, R., & Alistarh, D.-A. (2018). Model compression via distillation and quantization. In 6th International Conference on Learning Representations. Vancouver, Canada.","ieee":"A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation and quantization,” in 6th International Conference on Learning Representations, Vancouver, Canada, 2018.","mla":"Polino, Antonio, et al. “Model Compression via Distillation and Quantization.” 6th International Conference on Learning Representations, 2018.","short":"A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018.","chicago":"Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression via Distillation and Quantization.” In 6th International Conference on Learning Representations, 2018."},"publication":"6th International Conference on Learning Representations","language":[{"iso":"eng"}],"date_published":"2018-05-01T00:00:00Z","conference":{"end_date":"2018-05-03","start_date":"2018-04-30","location":"Vancouver, Canada","name":"ICLR: International Conference on Learning Representations"},"scopus_import":1,"article_processing_charge":"No","has_accepted_license":"1","month":"05","day":"01","department":[{"_id":"DaAl"}],"status":"public","ddc":["000"],"publication_status":"published","title":"Model compression via distillation and quantization","_id":"7812","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2018","oa_version":"Published Version","file":[{"creator":"dernst","content_type":"application/pdf","file_size":308339,"access_level":"open_access","file_name":"2018_ICLR_Polino.pdf","checksum":"a4336c167978e81891970e4e4517a8c3","date_created":"2020-05-26T13:02:00Z","date_updated":"2020-07-14T12:48:03Z","file_id":"7894","relation":"main_file"}],"date_updated":"2023-02-23T13:18:41Z","date_created":"2020-05-10T22:00:51Z","author":[{"full_name":"Polino, Antonio","last_name":"Polino","first_name":"Antonio"},{"full_name":"Pascanu, Razvan","first_name":"Razvan","last_name":"Pascanu"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"}],"type":"conference","file_date_updated":"2020-07-14T12:48:03Z","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."}]},{"month":"12","day":"13","article_processing_charge":"No","project":[{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","call_identifier":"H2020","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425"},{"_id":"264E56E2-B435-11E9-9278-68D0E5697425","grant_number":"M02416","name":"Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex","call_identifier":"FWF"}],"publication":"bioRxiv","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/494088"}],"citation":{"mla":"Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/494088.","short":"A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou, M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall, O. Marín, BioRxiv (n.d.).","chicago":"Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/494088.","ama":"Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv. doi:10.1101/494088","ista":"Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv, 10.1101/494088.","ieee":"A. Llorca et al., “Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture,” bioRxiv. Cold Spring Harbor Laboratory.","apa":"Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou, E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/494088"},"language":[{"iso":"eng"}],"date_published":"2018-12-13T00:00:00Z","doi":"10.1101/494088","type":"preprint","abstract":[{"text":"The cerebral cortex contains multiple hierarchically organized areas with distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying the emergence of this diversity remain unclear. Here, we have quantitatively investigated the neuronal output of individual progenitor cells in the ventricular zone of the developing mouse neocortex using a combination of methods that together circumvent the biases and limitations of individual approaches. We found that individual cortical progenitor cells show a high degree of stochasticity and generate pyramidal cell lineages that adopt a wide range of laminar configurations. Mathematical modelling these lineage data suggests that a small number of progenitor cell populations, each generating pyramidal cells following different stochastic developmental programs, suffice to generate the heterogenous complement of pyramidal cell lineages that collectively build the complex cytoarchitecture of the neocortex.","lang":"eng"}],"ec_funded":1,"status":"public","publication_status":"submitted","title":"Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture","publisher":"Cold Spring Harbor Laboratory","department":[{"_id":"SiHi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8547","year":"2018","acknowledgement":"We thank I. Andrew and S.E. Bae for excellent technical assistance, F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members of the Marín and Rico laboratories for stimulating discussions and ideas. Our research on this topic is supported by grants from the European Research Council (ERC-2017-AdG 787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M. L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the European Commission under the H2020 Programme.","date_created":"2020-09-21T12:01:50Z","date_updated":"2021-01-12T08:20:00Z","oa_version":"Preprint","author":[{"first_name":"Alfredo","last_name":"Llorca","full_name":"Llorca, Alfredo"},{"full_name":"Ciceri, Gabriele","first_name":"Gabriele","last_name":"Ciceri"},{"orcid":"0000-0002-8483-8753","id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","last_name":"Beattie","first_name":"Robert J","full_name":"Beattie, Robert J"},{"full_name":"Wong, Fong K.","last_name":"Wong","first_name":"Fong K."},{"last_name":"Diana","first_name":"Giovanni","full_name":"Diana, Giovanni"},{"full_name":"Serafeimidou, Eleni","first_name":"Eleni","last_name":"Serafeimidou"},{"full_name":"Fernández-Otero, Marian","last_name":"Fernández-Otero","first_name":"Marian"},{"full_name":"Streicher, Carmen","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87","first_name":"Carmen","last_name":"Streicher"},{"first_name":"Sebastian J.","last_name":"Arnold","full_name":"Arnold, Sebastian J."},{"full_name":"Meyer, Martin","last_name":"Meyer","first_name":"Martin"},{"full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon"},{"last_name":"Maravall","first_name":"Miguel","full_name":"Maravall, Miguel"},{"last_name":"Marín","first_name":"Oscar","full_name":"Marín, Oscar"}]},{"oa_version":"Submitted Version","file":[{"file_id":"7053","relation":"main_file","date_created":"2019-11-19T08:22:18Z","date_updated":"2020-07-14T12:48:14Z","checksum":"9995c6ce6957333baf616fc4f20be597","file_name":"2018_PrinciplesModeling_Chatterjee.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":516307}],"title":"Computing average response time","ddc":["000"],"status":"public","intvolume":" 10760","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"86","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"}],"alternative_title":["LNCS"],"type":"book_chapter","date_published":"2018-07-20T00:00:00Z","page":"143 - 161","publication":"Principles of Modeling","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.","mla":"Chatterjee, Krishnendu, et al. “Computing Average Response Time.” Principles of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:10.1007/978-3-319-95246-8_9.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. 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.","ama":"Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh M, Derler P, Sirjani M, eds. Principles of Modeling. Vol 10760. Springer; 2018:143-161. doi:10.1007/978-3-319-95246-8_9"},"day":"20","has_accepted_license":"1","scopus_import":1,"date_created":"2018-12-11T11:44:33Z","date_updated":"2021-01-12T08:20:14Z","volume":10760,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"editor":[{"last_name":"Lohstroh","first_name":"Marten","full_name":"Lohstroh, Marten"},{"full_name":"Derler, Patricia","last_name":"Derler","first_name":"Patricia"},{"full_name":"Sirjani, Marjan","last_name":"Sirjani","first_name":"Marjan"}],"publisher":"Springer","year":"2018","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.","file_date_updated":"2020-07-14T12:48:14Z","publist_id":"7968","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-95246-8_9","quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"oa":1,"month":"07"}]