[{"status":"public","date_created":"2018-12-11T11:52:00Z","day":"01","type":"journal_article","date_updated":"2025-09-18T11:45:18Z","file_date_updated":"2020-07-14T12:44:54Z","isi":1,"publication":"Neural Plasticity","publisher":"Hindawi Publishing Corporation","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":2016,"external_id":{"isi":["000374056200001"]},"doi":"10.1155/2016/1207393","pubrep_id":"580","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"ATP released from neurons and astrocytes during neuronal activity or under pathophysiological circumstances is able to influence information flow in neuronal circuits by activation of ionotropic P2X and metabotropic P2Y receptors and subsequent modulation of cellular excitability, synaptic strength, and plasticity. In the present paper we review cellular and network effects of P2Y receptors in the brain. We show that P2Y receptors inhibit the release of neurotransmitters, modulate voltage- and ligand-gated ion channels, and differentially influence the induction of synaptic plasticity in the prefrontal cortex, hippocampus, and cerebellum. The findings discussed here may explain how P2Y1 receptor activation during brain injury, hypoxia, inflammation, schizophrenia, or Alzheimer's disease leads to an impairment of cognitive processes. Hence, it is suggested that the blockade of P2Y1 receptors may have therapeutic potential against cognitive disturbances in these states.","lang":"eng"}],"article_processing_charge":"No","scopus_import":"1","article_number":"1207393","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"      2016","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:44:54Z","creator":"system","date_created":"2018-12-12T10:09:17Z","file_size":1395180,"file_id":"4740","checksum":"8dc5c2f3d44d4775a6e7e3edb0d7a0da","file_name":"IST-2016-580-v1+1_1207393.pdf","content_type":"application/pdf","relation":"main_file"}],"_id":"1435","title":"P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction","ddc":["570"],"has_accepted_license":"1","oa":1,"department":[{"_id":"PeJo"}],"publist_id":"5762","author":[{"id":"30CC5506-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2209-5242","first_name":"José","last_name":"Guzmán","full_name":"Guzmán, José"},{"full_name":"Gerevich, Zoltan","last_name":"Gerevich","first_name":"Zoltan"}],"citation":{"ama":"Guzmán J, Gerevich Z. P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction. <i>Neural Plasticity</i>. 2016;2016. doi:<a href=\"https://doi.org/10.1155/2016/1207393\">10.1155/2016/1207393</a>","mla":"Guzmán, José, and Zoltan Gerevich. “P2Y Receptors in Synaptic Transmission and Plasticity: Therapeutic Potential in Cognitive Dysfunction.” <i>Neural Plasticity</i>, vol. 2016, 1207393, Hindawi Publishing Corporation, 2016, doi:<a href=\"https://doi.org/10.1155/2016/1207393\">10.1155/2016/1207393</a>.","ieee":"J. Guzmán and Z. Gerevich, “P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction,” <i>Neural Plasticity</i>, vol. 2016. Hindawi Publishing Corporation, 2016.","apa":"Guzmán, J., &#38; Gerevich, Z. (2016). P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction. <i>Neural Plasticity</i>. Hindawi Publishing Corporation. <a href=\"https://doi.org/10.1155/2016/1207393\">https://doi.org/10.1155/2016/1207393</a>","ista":"Guzmán J, Gerevich Z. 2016. P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction. Neural Plasticity. 2016, 1207393.","short":"J. Guzmán, Z. Gerevich, Neural Plasticity 2016 (2016).","chicago":"Guzmán, José, and Zoltan Gerevich. “P2Y Receptors in Synaptic Transmission and Plasticity: Therapeutic Potential in Cognitive Dysfunction.” <i>Neural Plasticity</i>. Hindawi Publishing Corporation, 2016. <a href=\"https://doi.org/10.1155/2016/1207393\">https://doi.org/10.1155/2016/1207393</a>."},"month":"01","publication_status":"published","oa_version":"Published Version","year":"2016","date_published":"2016-01-01T00:00:00Z"},{"department":[{"_id":"RoSe"}],"publist_id":"5763","ddc":["510","530"],"has_accepted_license":"1","oa":1,"file":[{"checksum":"c5afe1f6935bc7f2b546adbde1d31a35","file_name":"IST-2016-581-v1+1_1-s2.0-S0021782415001191-main.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:44:54Z","creator":"system","date_created":"2018-12-12T10:10:36Z","file_size":658491,"file_id":"4825"}],"_id":"1436","title":"Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction","quality_controlled":"1","intvolume":"       105","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","oa_version":"Published Version","publication_status":"published","year":"2016","date_published":"2016-01-01T00:00:00Z","citation":{"chicago":"Bach, Volker, Sébastien Breteaux, Sören P Petrat, Peter Pickl, and Tim Tzaneteas. “Kinetic Energy Estimates for the Accuracy of the Time-Dependent Hartree-Fock Approximation with Coulomb Interaction.” <i>Journal de Mathématiques Pures et Appliquées</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">https://doi.org/10.1016/j.matpur.2015.09.003</a>.","short":"V. Bach, S. Breteaux, S.P. Petrat, P. Pickl, T. Tzaneteas, Journal de Mathématiques Pures et Appliquées 105 (2016) 1–30.","ista":"Bach V, Breteaux S, Petrat SP, Pickl P, Tzaneteas T. 2016. Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction. Journal de Mathématiques Pures et Appliquées. 105(1), 1–30.","ieee":"V. Bach, S. Breteaux, S. P. Petrat, P. Pickl, and T. Tzaneteas, “Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction,” <i>Journal de Mathématiques Pures et Appliquées</i>, vol. 105, no. 1. Elsevier, pp. 1–30, 2016.","apa":"Bach, V., Breteaux, S., Petrat, S. P., Pickl, P., &#38; Tzaneteas, T. (2016). Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction. <i>Journal de Mathématiques Pures et Appliquées</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">https://doi.org/10.1016/j.matpur.2015.09.003</a>","mla":"Bach, Volker, et al. “Kinetic Energy Estimates for the Accuracy of the Time-Dependent Hartree-Fock Approximation with Coulomb Interaction.” <i>Journal de Mathématiques Pures et Appliquées</i>, vol. 105, no. 1, Elsevier, 2016, pp. 1–30, doi:<a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">10.1016/j.matpur.2015.09.003</a>.","ama":"Bach V, Breteaux S, Petrat SP, Pickl P, Tzaneteas T. Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction. <i>Journal de Mathématiques Pures et Appliquées</i>. 2016;105(1):1-30. doi:<a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">10.1016/j.matpur.2015.09.003</a>"},"issue":"1","month":"01","author":[{"last_name":"Bach","first_name":"Volker","full_name":"Bach, Volker"},{"full_name":"Breteaux, Sébastien","last_name":"Breteaux","first_name":"Sébastien"},{"last_name":"Petrat","first_name":"Sören P","full_name":"Petrat, Sören P","orcid":"0000-0002-9166-5889","id":"40AC02DC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pickl","first_name":"Peter","full_name":"Pickl, Peter"},{"last_name":"Tzaneteas","first_name":"Tim","full_name":"Tzaneteas, Tim"}],"page":"1 - 30","isi":1,"file_date_updated":"2020-07-14T12:44:54Z","publication":"Journal de Mathématiques Pures et Appliquées","publisher":"Elsevier","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"ec_funded":1,"day":"01","type":"journal_article","date_updated":"2025-09-18T12:31:28Z","status":"public","date_created":"2018-12-11T11:52:00Z","scopus_import":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"We study the time evolution of a system of N spinless fermions in R3 which interact through a pair potential, e.g., the Coulomb potential. We compare the dynamics given by the solution to Schrödinger's equation with the time-dependent Hartree-Fock approximation, and we give an estimate for the accuracy of this approximation in terms of the kinetic energy of the system. This leads, in turn, to bounds in terms of the initial total energy of the system."}],"article_processing_charge":"No","external_id":{"isi":["000366773900001"]},"doi":"10.1016/j.matpur.2015.09.003","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"pubrep_id":"581","volume":105},{"date_updated":"2025-04-15T08:12:22Z","arxiv":1,"type":"conference","day":"11","status":"public","date_created":"2018-12-11T11:52:01Z","acknowledgement":"Supported by the Natural Science Foundation of China (NSFC) under Grant No. 61532019 ","page":"327 - 342","publisher":"ACM","ec_funded":1,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"doi":"10.1145/2837614.2837639","external_id":{"arxiv":["1510.08517"]},"volume":"20-22","language":[{"iso":"eng"}],"scopus_import":1,"abstract":[{"lang":"eng","text":"In this paper, we consider termination of probabilistic programs with real-valued variables. The questions concerned are: (a) qualitative ones that ask (i) whether the program terminates with probability 1 (almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); (b) quantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) to compute a bound B such that the probability to terminate after B steps decreases exponentially (concentration problem). To solve these questions, we utilize the notion of ranking supermartingales which is a powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmic synthesis of linear ranking-supermartingales over affine probabilistic programs (APP's) with both angelic and demonic non-determinism. An important subclass of APP's is LRAPP which is defined as the class of all APP's over which a linear ranking-supermartingale exists. Our main contributions are as follows. Firstly, we show that the membership problem of LRAPP (i) can be decided in polynomial time for APP's with at most demonic non-determinism, and (ii) is NP-hard and in PSPACE for APP's with angelic non-determinism; moreover, the NP-hardness result holds already for APP's without probability and demonic non-determinism. Secondly, we show that the concentration problem over LRAPP can be solved in the same complexity as for the membership problem of LRAPP. Finally, we show that the expectation problem over LRAPP can be solved in 2EXPTIME and is PSPACE-hard even for APP's without probability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate the effectiveness of our approach to answer the qualitative and quantitative questions over APP's with at most demonic non-determinism."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","_id":"1438","alternative_title":["POPL"],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.08517"}],"publist_id":"5760","conference":{"name":"POPL: Principles of Programming Languages","start_date":"2016-01-20","end_date":"2016-01-22","location":"St. Petersburg, FL, USA"},"department":[{"_id":"KrCh"}],"oa":1,"month":"01","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs</i>. Vol. 20–22, ACM, 2016, pp. 327–42, doi:<a href=\"https://doi.org/10.1145/2837614.2837639\">10.1145/2837614.2837639</a>.","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 327–342.","apa":"Chatterjee, K., Fu, H., Novotný, P., &#38; Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837639\">https://doi.org/10.1145/2837614.2837639</a>","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In: Vol 20-22. ACM; 2016:327-342. doi:<a href=\"https://doi.org/10.1145/2837614.2837639\">10.1145/2837614.2837639</a>","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,” 20–22:327–42. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837639\">https://doi.org/10.1145/2837614.2837639</a>."},"related_material":{"record":[{"id":"5993","relation":"later_version","status":"public"}]},"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","first_name":"Petr","full_name":"Novotny, Petr"},{"first_name":"Rouzbeh","last_name":"Hasheminezhad","full_name":"Hasheminezhad, Rouzbeh"}],"date_published":"2016-01-11T00:00:00Z","year":"2016","oa_version":"Preprint","publication_status":"published"},{"acknowledgement":"Damien Zufferey was supported by DARPA (Grants FA8650-11-C-7192 and FA8650-15-C-7564) and NSF (Grant CCF-1138967). ","page":"400 - 415","publisher":"ACM","ec_funded":1,"isi":1,"date_updated":"2025-09-18T11:44:23Z","type":"conference","day":"11","status":"public","date_created":"2018-12-11T11:52:01Z","language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"No","abstract":[{"text":"Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. We introduce PSYNC, a domain specific language based on the Heard-Of model, which views asynchronous faulty systems as synchronous ones with an adversarial environment that simulates asynchrony and faults by dropping messages. We define a runtime system for PSYNC that efficiently executes on asynchronous networks. We formalize the relation between the runtime system and PSYNC in terms of observational refinement. The high-level lockstep abstraction introduced by PSYNC simplifies the design and implementation of fault-tolerant distributed algorithms and enables automated formal verification. We have implemented an embedding of PSYNC in the SCALA programming language with a runtime system for asynchronous networks. We show the applicability of PSYNC by implementing several important fault-tolerant distributed algorithms and we compare the implementation of consensus algorithms in PSYNC against implementations in other languages in terms of code size, runtime efficiency, and verification.","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"doi":"10.1145/2837614.2837650","external_id":{"isi":["000374053600033"]},"volume":"20-22","main_file_link":[{"open_access":"1","url":"https://hal.inria.fr/hal-01251199/"}],"publist_id":"5759","conference":{"end_date":"2016-01-22","start_date":"2016-01-20","name":"POPL: Principles of Programming Languages","location":"St. Petersburg, FL, USA"},"department":[{"_id":"ToHe"}],"oa":1,"title":"PSYNC: A partially synchronous language for fault-tolerant distributed algorithms","_id":"1439","alternative_title":["ACM SIGPLAN Notices"],"quality_controlled":"1","date_published":"2016-01-11T00:00:00Z","year":"2016","oa_version":"Preprint","publication_status":"published","month":"01","citation":{"short":"C. Dragoi, T.A. Henzinger, D. Zufferey, in:, ACM, 2016, pp. 400–415.","chicago":"Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “PSYNC: A Partially Synchronous Language for Fault-Tolerant Distributed Algorithms,” 20–22:400–415. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837650\">https://doi.org/10.1145/2837614.2837650</a>.","ista":"Dragoi C, Henzinger TA, Zufferey D. 2016. PSYNC: A partially synchronous language for fault-tolerant distributed algorithms. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 20–22, 400–415.","ama":"Dragoi C, Henzinger TA, Zufferey D. PSYNC: A partially synchronous language for fault-tolerant distributed algorithms. In: Vol 20-22. ACM; 2016:400-415. doi:<a href=\"https://doi.org/10.1145/2837614.2837650\">10.1145/2837614.2837650</a>","ieee":"C. Dragoi, T. A. Henzinger, and D. Zufferey, “PSYNC: A partially synchronous language for fault-tolerant distributed algorithms,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 400–415.","apa":"Dragoi, C., Henzinger, T. A., &#38; Zufferey, D. (2016). PSYNC: A partially synchronous language for fault-tolerant distributed algorithms (Vol. 20–22, pp. 400–415). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837650\">https://doi.org/10.1145/2837614.2837650</a>","mla":"Dragoi, Cezara, et al. <i>PSYNC: A Partially Synchronous Language for Fault-Tolerant Distributed Algorithms</i>. Vol. 20–22, ACM, 2016, pp. 400–15, doi:<a href=\"https://doi.org/10.1145/2837614.2837650\">10.1145/2837614.2837650</a>."},"author":[{"full_name":"Dragoi, Cezara","last_name":"Dragoi","first_name":"Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","last_name":"Zufferey","first_name":"Damien"}]},{"project":[{"grant_number":"RGY0084/2012","name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors","_id":"255BFFFA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25548C20-B435-11E9-9278-68D0E5697425","name":"Microbial Ion Channels for Synthetic Neurobiology","grant_number":"303564"},{"name":"Molecular Drug Targets","grant_number":"W1232-B24","call_identifier":"FWF","_id":"255A6082-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000373567700001"]},"doi":"10.1016/j.str.2016.01.002","volume":24,"language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-18T11:43:50Z","day":"02","type":"journal_article","date_created":"2018-12-11T11:52:02Z","status":"public","acknowledgement":"The author thanks Banerjee et al. (2016) for providing coordinates prior to public release and apologizes to colleagues whose work was not cited or discussed due to the limited space available. The author is supported by grants from EU FP7 (CIG-303564), HFSP (RGY0084_2012), and FWF (W1232).","page":"213 - 215","publication":"Structure","ec_funded":1,"publisher":"Cell Press","isi":1,"citation":{"ista":"Janovjak HL. 2016. Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. Structure. 24(2), 213–215.","short":"H.L. Janovjak, Structure 24 (2016) 213–215.","chicago":"Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure of a C-Terminal Light-Sensing Domain.” <i>Structure</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.str.2016.01.002\">https://doi.org/10.1016/j.str.2016.01.002</a>.","mla":"Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure of a C-Terminal Light-Sensing Domain.” <i>Structure</i>, vol. 24, no. 2, Cell Press, 2016, pp. 213–15, doi:<a href=\"https://doi.org/10.1016/j.str.2016.01.002\">10.1016/j.str.2016.01.002</a>.","ieee":"H. L. Janovjak, “Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain,” <i>Structure</i>, vol. 24, no. 2. Cell Press, pp. 213–215, 2016.","apa":"Janovjak, H. L. (2016). Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. <i>Structure</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.str.2016.01.002\">https://doi.org/10.1016/j.str.2016.01.002</a>","ama":"Janovjak HL. Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. <i>Structure</i>. 2016;24(2):213-215. doi:<a href=\"https://doi.org/10.1016/j.str.2016.01.002\">10.1016/j.str.2016.01.002</a>"},"issue":"2","month":"02","author":[{"orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","first_name":"Harald L","last_name":"Janovjak"}],"corr_author":"1","date_published":"2016-02-02T00:00:00Z","publication_status":"published","oa_version":"None","year":"2016","_id":"1440","title":"Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain","intvolume":"        24","quality_controlled":"1","department":[{"_id":"HaJa"}],"publist_id":"5756"},{"date_created":"2018-12-11T11:52:02Z","status":"public","day":"17","type":"journal_article","date_updated":"2025-09-18T11:43:12Z","file_date_updated":"2020-07-14T12:44:55Z","isi":1,"publication":"Angewandte Chemie - International Edition","publisher":"Wiley","ec_funded":1,"page":"6339 - 6342","acknowledgement":"A.I.-P. was supported by a Ramon Areces fellowship, and E.R. by the graduate program MolecularDrugTargets (Austrian Science Fund (FWF): W1232) and a FemTech fellowship (Austrian Research Promotion Agency: 3580812).","volume":55,"external_id":{"isi":["000377918400039"]},"doi":"10.1002/anie.201601736","project":[{"_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"303564","name":"Microbial Ion Channels for Synthetic Neurobiology"},{"name":"Molecular Drug Targets","grant_number":"W1232-B24","_id":"255A6082-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"pubrep_id":"840","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"Optogenetics and photopharmacology enable the spatio-temporal control of cell and animal behavior by light. Although red light offers deep-tissue penetration and minimal phototoxicity, very few red-light-sensitive optogenetic methods are currently available. We have now developed a red-light-induced homodimerization domain. We first showed that an optimized sensory domain of the cyanobacterial phytochrome 1 can be expressed robustly and without cytotoxicity in human cells. We then applied this domain to induce the dimerization of two receptor tyrosine kinases—the fibroblast growth factor receptor 1 and the neurotrophin receptor trkB. This new optogenetic method was then used to activate the MAPK/ERK pathway non-invasively in mammalian tissue and in multicolor cell-signaling experiments. The light-controlled dimerizer and red-light-activated receptor tyrosine kinases will prove useful to regulate a variety of cellular processes with light. Go deep with red: The sensory domain (S) of the cyanobacterial phytochrome 1 (CPH1) was repurposed to induce the homodimerization of proteins in living cells by red light. By using this domain, light-activated protein kinases were engineered that can be activated orthogonally from many fluorescent proteins and through mammalian tissue. Pr/Pfr=red-/far-red-absorbing state of CPH1."}],"article_processing_charge":"No","scopus_import":"1","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"        55","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:44:55Z","creator":"system","file_id":"5255","file_size":1268662,"date_created":"2018-12-12T10:17:03Z","file_name":"IST-2017-840-v1+1_reichhart.pdf","checksum":"26da07960e57ac4750b54179197ce57f","content_type":"application/pdf","relation":"main_file"}],"_id":"1441","title":"A phytochrome sensory domain permits receptor activation by red light","ddc":["571","576"],"has_accepted_license":"1","oa":1,"department":[{"_id":"HaJa"}],"publist_id":"5755","author":[{"first_name":"Eva","last_name":"Gschaider-Reichhart","full_name":"Gschaider-Reichhart, Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7218-7738"},{"last_name":"Inglés Prieto","first_name":"Álvaro","full_name":"Inglés Prieto, Álvaro","orcid":"0000-0002-5409-8571","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87"},{"id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87","last_name":"Tichy","first_name":"Alexandra-Madelaine","full_name":"Tichy, Alexandra-Madelaine"},{"full_name":"Mckenzie, Catherine","first_name":"Catherine","last_name":"Mckenzie","id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","first_name":"Harald L","full_name":"Janovjak, Harald L"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"418"}]},"citation":{"ama":"Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL. A phytochrome sensory domain permits receptor activation by red light. <i>Angewandte Chemie - International Edition</i>. 2016;55(21):6339-6342. doi:<a href=\"https://doi.org/10.1002/anie.201601736\">10.1002/anie.201601736</a>","mla":"Gschaider-Reichhart, Eva, et al. “A Phytochrome Sensory Domain Permits Receptor Activation by Red Light.” <i>Angewandte Chemie - International Edition</i>, vol. 55, no. 21, Wiley, 2016, pp. 6339–42, doi:<a href=\"https://doi.org/10.1002/anie.201601736\">10.1002/anie.201601736</a>.","apa":"Gschaider-Reichhart, E., Inglés Prieto, Á., Tichy, A.-M., Mckenzie, C., &#38; Janovjak, H. L. (2016). A phytochrome sensory domain permits receptor activation by red light. <i>Angewandte Chemie - International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201601736\">https://doi.org/10.1002/anie.201601736</a>","ieee":"E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, and H. L. Janovjak, “A phytochrome sensory domain permits receptor activation by red light,” <i>Angewandte Chemie - International Edition</i>, vol. 55, no. 21. Wiley, pp. 6339–6342, 2016.","ista":"Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL. 2016. A phytochrome sensory domain permits receptor activation by red light. Angewandte Chemie - International Edition. 55(21), 6339–6342.","chicago":"Gschaider-Reichhart, Eva, Álvaro Inglés Prieto, Alexandra-Madelaine Tichy, Catherine Mckenzie, and Harald L Janovjak. “A Phytochrome Sensory Domain Permits Receptor Activation by Red Light.” <i>Angewandte Chemie - International Edition</i>. Wiley, 2016. <a href=\"https://doi.org/10.1002/anie.201601736\">https://doi.org/10.1002/anie.201601736</a>.","short":"E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, H.L. Janovjak, Angewandte Chemie - International Edition 55 (2016) 6339–6342."},"issue":"21","month":"05","oa_version":"Submitted Version","publication_status":"published","year":"2016","date_published":"2016-05-17T00:00:00Z","corr_author":"1"},{"intvolume":"       107","quality_controlled":"1","_id":"1446","title":"On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data","file":[{"content_type":"application/pdf","relation":"main_file","checksum":"32d46268588b87d9b686492018e6a2b2","file_name":"IST-2016-530-v1+1_s11192-016-1842-4.pdf","creator":"system","file_size":806035,"date_created":"2018-12-12T10:10:56Z","file_id":"4848","access_level":"open_access","date_updated":"2020-07-14T12:44:55Z"}],"oa":1,"ddc":["000"],"has_accepted_license":"1","department":[{"_id":"BeBi"}],"publist_id":"5750","author":[{"first_name":"Maria","last_name":"Calatrava Moreno","full_name":"Calatrava Moreno, Maria"},{"full_name":"Auzinger, Thomas","first_name":"Thomas","last_name":"Auzinger","id":"4718F954-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1546-3265"},{"first_name":"Hannes","last_name":"Werthner","full_name":"Werthner, Hannes"}],"issue":"1","citation":{"ista":"Calatrava Moreno M, Auzinger T, Werthner H. 2016. On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. Scientometrics. 107(1), 213–232.","short":"M. Calatrava Moreno, T. Auzinger, H. Werthner, Scientometrics 107 (2016) 213–232.","chicago":"Calatrava Moreno, Maria, Thomas Auzinger, and Hannes Werthner. “On the Uncertainty of Interdisciplinarity Measurements Due to Incomplete Bibliographic Data.” <i>Scientometrics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s11192-016-1842-4\">https://doi.org/10.1007/s11192-016-1842-4</a>.","mla":"Calatrava Moreno, Maria, et al. “On the Uncertainty of Interdisciplinarity Measurements Due to Incomplete Bibliographic Data.” <i>Scientometrics</i>, vol. 107, no. 1, Springer, 2016, pp. 213–32, doi:<a href=\"https://doi.org/10.1007/s11192-016-1842-4\">10.1007/s11192-016-1842-4</a>.","apa":"Calatrava Moreno, M., Auzinger, T., &#38; Werthner, H. (2016). On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. <i>Scientometrics</i>. Springer. <a href=\"https://doi.org/10.1007/s11192-016-1842-4\">https://doi.org/10.1007/s11192-016-1842-4</a>","ieee":"M. Calatrava Moreno, T. Auzinger, and H. Werthner, “On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data,” <i>Scientometrics</i>, vol. 107, no. 1. Springer, pp. 213–232, 2016.","ama":"Calatrava Moreno M, Auzinger T, Werthner H. On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. <i>Scientometrics</i>. 2016;107(1):213-232. doi:<a href=\"https://doi.org/10.1007/s11192-016-1842-4\">10.1007/s11192-016-1842-4</a>"},"month":"04","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1007/s11192-016-1902-9"}]},"date_published":"2016-04-01T00:00:00Z","publication_status":"published","oa_version":"Published Version","year":"2016","status":"public","date_created":"2018-12-11T11:52:04Z","date_updated":"2025-09-18T11:42:34Z","day":"01","type":"journal_article","publication":"Scientometrics","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Springer","isi":1,"file_date_updated":"2020-07-14T12:44:55Z","page":"213 - 232","volume":107,"pubrep_id":"530","external_id":{"isi":["000373187000011"]},"doi":"10.1007/s11192-016-1842-4","abstract":[{"lang":"eng","text":"The accuracy of interdisciplinarity measurements is directly related to the quality of the underlying bibliographic data. Existing indicators of interdisciplinarity are not capable of reflecting the inaccuracies introduced by incorrect and incomplete records because correct and complete bibliographic data can rarely be obtained. This is the case for the Rao–Stirling index, which cannot handle references that are not categorized into disciplinary fields. We introduce a method that addresses this problem. It extends the Rao–Stirling index to acknowledge missing data by calculating its interval of uncertainty using computational optimization. The evaluation of our method indicates that the uncertainty interval is not only useful for estimating the inaccuracy of interdisciplinarity measurements, but it also delivers slightly more accurate aggregated interdisciplinarity measurements than the Rao–Stirling index."}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"scopus_import":"1"},{"_id":"1448","title":"Entropic Ricci curvature bounds for discrete interacting systems","intvolume":"        26","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1501.00562","open_access":"1"}],"department":[{"_id":"JaMa"}],"publist_id":"5748","oa":1,"citation":{"ama":"Fathi M, Maas J. Entropic Ricci curvature bounds for discrete interacting systems. <i>The Annals of Applied Probability</i>. 2016;26(3):1774-1806. doi:<a href=\"https://doi.org/10.1214/15-AAP1133\">10.1214/15-AAP1133</a>","apa":"Fathi, M., &#38; Maas, J. (2016). Entropic Ricci curvature bounds for discrete interacting systems. <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/15-AAP1133\">https://doi.org/10.1214/15-AAP1133</a>","ieee":"M. Fathi and J. Maas, “Entropic Ricci curvature bounds for discrete interacting systems,” <i>The Annals of Applied Probability</i>, vol. 26, no. 3. Institute of Mathematical Statistics, pp. 1774–1806, 2016.","mla":"Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete Interacting Systems.” <i>The Annals of Applied Probability</i>, vol. 26, no. 3, Institute of Mathematical Statistics, 2016, pp. 1774–806, doi:<a href=\"https://doi.org/10.1214/15-AAP1133\">10.1214/15-AAP1133</a>.","chicago":"Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete Interacting Systems.” <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2016. <a href=\"https://doi.org/10.1214/15-AAP1133\">https://doi.org/10.1214/15-AAP1133</a>.","short":"M. Fathi, J. Maas, The Annals of Applied Probability 26 (2016) 1774–1806.","ista":"Fathi M, Maas J. 2016. Entropic Ricci curvature bounds for discrete interacting systems. The Annals of Applied Probability. 26(3), 1774–1806."},"issue":"3","month":"06","author":[{"last_name":"Fathi","first_name":"Max","full_name":"Fathi, Max"},{"full_name":"Maas, Jan","first_name":"Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"}],"corr_author":"1","date_published":"2016-06-01T00:00:00Z","oa_version":"Preprint","publication_status":"published","year":"2016","arxiv":1,"date_updated":"2025-09-18T11:41:58Z","day":"01","type":"journal_article","status":"public","date_created":"2018-12-11T11:52:05Z","acknowledgement":"Supported by the German Research Foundation through the Collaborative Research Center 1060\r\nThe Mathematics of Emergent Effects and the Hausdorff Center for Mathematics. Part of this work has been done while M. Fathi visited J. Maas at the University of Bonn in July 2014.We would like to thank the referees for their careful reading of the manuscript. ","page":"1774 - 1806","publication":"The Annals of Applied Probability","publisher":"Institute of Mathematical Statistics","isi":1,"external_id":{"isi":["000378215800016"],"arxiv":["1501.00562"]},"doi":"10.1214/15-AAP1133","volume":26,"language":[{"iso":"eng"}],"scopus_import":"1","abstract":[{"text":"We develop a new and systematic method for proving entropic Ricci curvature lower bounds for Markov chains on discrete sets. Using different methods, such bounds have recently been obtained in several examples (e.g., 1-dimensional birth and death chains, product chains, Bernoulli–Laplace models, and random transposition models). However, a general method to obtain discrete Ricci bounds had been lacking. Our method covers all of the examples above. In addition we obtain new Ricci curvature bounds for zero-range processes on the complete graph. The method is inspired by recent work of Caputo, Dai Pra and Posta on discrete functional inequalities.","lang":"eng"}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"intvolume":"        76","quality_controlled":"1","title":"Inference algorithms for pattern-based CRFs on sequence data","_id":"1794","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1210.0508"}],"publist_id":"5316","department":[{"_id":"VlKo"}],"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir"},{"id":"2CCAC26C-F248-11E8-B48F-1D18A9856A87","last_name":"Takhanov","first_name":"Rustem","full_name":"Takhanov, Rustem"}],"month":"09","issue":"1","citation":{"ista":"Kolmogorov V, Takhanov R. 2016. Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. 76(1), 17–46.","short":"V. Kolmogorov, R. Takhanov, Algorithmica 76 (2016) 17–46.","chicago":"Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” <i>Algorithmica</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00453-015-0017-7\">https://doi.org/10.1007/s00453-015-0017-7</a>.","mla":"Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” <i>Algorithmica</i>, vol. 76, no. 1, Springer, 2016, pp. 17–46, doi:<a href=\"https://doi.org/10.1007/s00453-015-0017-7\">10.1007/s00453-015-0017-7</a>.","apa":"Kolmogorov, V., &#38; Takhanov, R. (2016). Inference algorithms for pattern-based CRFs on sequence data. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-015-0017-7\">https://doi.org/10.1007/s00453-015-0017-7</a>","ieee":"V. Kolmogorov and R. Takhanov, “Inference algorithms for pattern-based CRFs on sequence data,” <i>Algorithmica</i>, vol. 76, no. 1. Springer, pp. 17–46, 2016.","ama":"Kolmogorov V, Takhanov R. Inference algorithms for pattern-based CRFs on sequence data. <i>Algorithmica</i>. 2016;76(1):17-46. doi:<a href=\"https://doi.org/10.1007/s00453-015-0017-7\">10.1007/s00453-015-0017-7</a>"},"related_material":{"record":[{"id":"2272","relation":"earlier_version","status":"public"}]},"date_published":"2016-09-01T00:00:00Z","year":"2016","publication_status":"published","oa_version":"Preprint","corr_author":"1","status":"public","date_created":"2018-12-11T11:54:02Z","date_updated":"2025-09-29T14:28:47Z","arxiv":1,"type":"journal_article","day":"01","publisher":"Springer","ec_funded":1,"publication":"Algorithmica","isi":1,"acknowledgement":"This work has been partially supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no. 616160.","page":"17 - 46","volume":76,"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/s00453-015-0017-7","external_id":{"arxiv":["1210.0508"],"isi":["000381149500002"]},"article_processing_charge":"No","abstract":[{"lang":"eng","text":"We consider Conditional random fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) (Formula presented.) is the sum of terms over intervals [i, j] where each term is non-zero only if the substring (Formula presented.) equals a prespecified pattern w. Such CRFs can be naturally applied to many sequence tagging problems. We present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.) where L is the combined length of input patterns, (Formula presented.) is the maximum length of a pattern, and D is the input alphabet. This improves on the previous algorithms of Ye et al. (NIPS, 2009) whose complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.), where (Formula presented.) is the number of input patterns. In addition, we give an efficient algorithm for sampling, and revisit the case of MAP with non-positive weights."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"scopus_import":"1"},{"date_created":"2018-12-11T11:54:15Z","status":"public","arxiv":1,"date_updated":"2025-09-18T10:47:32Z","type":"journal_article","day":"01","publisher":"Elsevier","publication":"Journal of Multivariate Analysis","isi":1,"page":"440 - 452","volume":143,"doi":"10.1016/j.jmva.2015.10.005","external_id":{"isi":["000366885300029"],"arxiv":["1501.00600"]},"article_processing_charge":"No","abstract":[{"text":"Relational models for contingency tables are generalizations of log-linear models, allowing effects associated with arbitrary subsets of cells in the table, and not necessarily containing the overall effect, that is, a common parameter in every cell. Similarly to log-linear models, relational models can be extended to non-negative distributions, but the extension requires more complex methods. An extended relational model is defined as an algebraic variety, and it turns out to be the closure of the original model with respect to the Bregman divergence. In the extended relational model, the MLE of the cell parameters always exists and is unique, but some of its properties may be different from those of the MLE under log-linear models. The MLE can be computed using a generalized iterative scaling procedure based on Bregman projections. ","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"scopus_import":"1","intvolume":"       143","quality_controlled":"1","title":"On the closure of relational models","_id":"1833","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1501.00600","open_access":"1"}],"publist_id":"5270","department":[{"_id":"CaUh"}],"author":[{"id":"31934120-F248-11E8-B48F-1D18A9856A87","last_name":"Klimova","first_name":"Anna","full_name":"Klimova, Anna"},{"last_name":"Rudas","first_name":"Tamás","full_name":"Rudas, Tamás"}],"month":"01","citation":{"short":"A. Klimova, T. Rudas, Journal of Multivariate Analysis 143 (2016) 440–452.","chicago":"Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.” <i>Journal of Multivariate Analysis</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">https://doi.org/10.1016/j.jmva.2015.10.005</a>.","ista":"Klimova A, Rudas T. 2016. On the closure of relational models. Journal of Multivariate Analysis. 143, 440–452.","ieee":"A. Klimova and T. Rudas, “On the closure of relational models,” <i>Journal of Multivariate Analysis</i>, vol. 143. Elsevier, pp. 440–452, 2016.","apa":"Klimova, A., &#38; Rudas, T. (2016). On the closure of relational models. <i>Journal of Multivariate Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">https://doi.org/10.1016/j.jmva.2015.10.005</a>","mla":"Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.” <i>Journal of Multivariate Analysis</i>, vol. 143, Elsevier, 2016, pp. 440–52, doi:<a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">10.1016/j.jmva.2015.10.005</a>.","ama":"Klimova A, Rudas T. On the closure of relational models. <i>Journal of Multivariate Analysis</i>. 2016;143:440-452. doi:<a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">10.1016/j.jmva.2015.10.005</a>"},"date_published":"2016-01-01T00:00:00Z","year":"2016","oa_version":"Preprint","publication_status":"published","corr_author":"1"},{"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award).","page":"128 - 144","publisher":"Springer","file_date_updated":"2020-07-14T12:44:39Z","isi":1,"date_updated":"2025-09-22T09:24:50Z","day":"25","type":"conference","status":"public","date_created":"2018-12-11T11:50:49Z","language":[{"iso":"eng"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"Many biological systems can be modeled as multiaffine hybrid systems. Due to the nonlinearity of multiaffine systems, it is difficult to verify their properties of interest directly. A common strategy to tackle this problem is to construct and analyze a discrete overapproximation of the original system. However, the conservativeness of a discrete abstraction significantly determines the level of confidence we can have in the properties of the original system. In this paper, in order to reduce the conservativeness of a discrete abstraction, we propose a new method based on a sufficient and necessary decision condition for computing discrete transitions between states in the abstract system. We assume the state space partition of a multiaffine system to be based on a set of multivariate polynomials. Hence, a rectangular partition defined in terms of polynomials of the form (xi − c) is just a simple case of multivariate polynomial partition, and the new decision condition applies naturally. We analyze and demonstrate the improvement of our method over the existing methods using some examples."}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"pubrep_id":"781","external_id":{"isi":["000389928100009"]},"doi":"10.1007/978-3-319-47151-8_9","volume":9957,"department":[{"_id":"ToHe"}],"conference":{"name":"HSB: Hybrid Systems Biology","end_date":"2016-10-21","start_date":"2016-10-20","location":"Grenoble, France"},"publist_id":"6107","oa":1,"ddc":["005"],"has_accepted_license":"1","_id":"1227","title":"Discrete abstraction of multiaffine systems","file":[{"file_size":683955,"date_created":"2018-12-12T10:10:49Z","file_id":"4840","creator":"system","date_updated":"2020-07-14T12:44:39Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"994e164b558c47bacf8dc066dd27c8fc","file_name":"IST-2017-781-v1+1_main.pdf"}],"intvolume":"      9957","quality_controlled":"1","alternative_title":["LNCS"],"date_published":"2016-09-25T00:00:00Z","oa_version":"Submitted Version","publication_status":"published","year":"2016","citation":{"chicago":"Kong, Hui, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, Thomas A Henzinger, Yu Jiang, and Christian Schilling. “Discrete Abstraction of Multiaffine Systems,” 9957:128–44. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">https://doi.org/10.1007/978-3-319-47151-8_9</a>.","short":"H. Kong, E. Bartocci, S. Bogomolov, R. Grosu, T.A. Henzinger, Y. Jiang, C. Schilling, in:, Springer, 2016, pp. 128–144.","ista":"Kong H, Bartocci E, Bogomolov S, Grosu R, Henzinger TA, Jiang Y, Schilling C. 2016. Discrete abstraction of multiaffine systems. HSB: Hybrid Systems Biology, LNCS, vol. 9957, 128–144.","ama":"Kong H, Bartocci E, Bogomolov S, et al. Discrete abstraction of multiaffine systems. In: Vol 9957. Springer; 2016:128-144. doi:<a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">10.1007/978-3-319-47151-8_9</a>","apa":"Kong, H., Bartocci, E., Bogomolov, S., Grosu, R., Henzinger, T. A., Jiang, Y., &#38; Schilling, C. (2016). Discrete abstraction of multiaffine systems (Vol. 9957, pp. 128–144). Presented at the HSB: Hybrid Systems Biology, Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">https://doi.org/10.1007/978-3-319-47151-8_9</a>","ieee":"H. Kong <i>et al.</i>, “Discrete abstraction of multiaffine systems,” presented at the HSB: Hybrid Systems Biology, Grenoble, France, 2016, vol. 9957, pp. 128–144.","mla":"Kong, Hui, et al. <i>Discrete Abstraction of Multiaffine Systems</i>. Vol. 9957, Springer, 2016, pp. 128–44, doi:<a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">10.1007/978-3-319-47151-8_9</a>."},"month":"09","author":[{"orcid":"0000-0002-3066-6941","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","full_name":"Kong, Hui","first_name":"Hui","last_name":"Kong"},{"last_name":"Bartocci","first_name":"Ezio","full_name":"Bartocci, Ezio"},{"last_name":"Bogomolov","first_name":"Sergiy","full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Jiang, Yu","last_name":"Jiang","first_name":"Yu"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling"}]},{"doi":"10.1007/978-3-319-39555-5_16","external_id":{"isi":["000386324500016"]},"pubrep_id":"765","project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"volume":9696,"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","abstract":[{"text":"Witness encryption (WE) was introduced by Garg et al. [GGSW13]. A WE scheme is defined for some NP language L and lets a sender encrypt messages relative to instances x. A ciphertext for x can be decrypted using w witnessing x ∈ L, but hides the message if x ∈ L. Garg et al. construct WE from multilinear maps and give another construction [GGH+13b] using indistinguishability obfuscation (iO) for circuits. Due to the reliance on such heavy tools, WE can cur- rently hardly be implemented on powerful hardware and will unlikely be realizable on constrained devices like smart cards any time soon. We construct a WE scheme where encryption is done by simply computing a Naor-Yung ciphertext (two CPA encryptions and a NIZK proof). To achieve this, our scheme has a setup phase, which outputs public parameters containing an obfuscated circuit (only required for decryption), two encryption keys and a common reference string (used for encryption). This setup need only be run once, and the parame- ters can be used for arbitrary many encryptions. Our scheme can also be turned into a functional WE scheme, where a message is encrypted w.r.t. a statement and a function f, and decryption with a witness w yields f (m, w). Our construction is inspired by the functional encryption scheme by Garg et al. and we prove (selective) security assuming iO and statistically simulation-sound NIZK. We give a construction of the latter in bilinear groups and combining it with ElGamal encryption, our ciphertexts are of size 1.3 kB at a 128-bit security level and can be computed on a smart card.","lang":"eng"}],"type":"conference","day":"09","date_updated":"2025-09-22T09:24:17Z","status":"public","date_created":"2018-12-11T11:50:50Z","page":"285 - 303","acknowledgement":"Research  supported  by  the  European  Research  Council,  ERC  starting  grant (259668-PSPC) and ERC consolidator grant (682815 - TOCNeT).","file_date_updated":"2020-07-14T12:44:39Z","isi":1,"ec_funded":1,"publisher":"Springer","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"83"}]},"month":"06","citation":{"short":"H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 285–303.","chicago":"Abusalah, Hamza M, Georg Fuchsbauer, and Krzysztof Z Pietrzak. “Offline Witness Encryption,” 9696:285–303. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">https://doi.org/10.1007/978-3-319-39555-5_16</a>.","ista":"Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Offline witness encryption. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696, 285–303.","ama":"Abusalah HM, Fuchsbauer G, Pietrzak KZ. Offline witness encryption. In: Vol 9696. Springer; 2016:285-303. doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">10.1007/978-3-319-39555-5_16</a>","apa":"Abusalah, H. M., Fuchsbauer, G., &#38; Pietrzak, K. Z. (2016). Offline witness encryption (Vol. 9696, pp. 285–303). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">https://doi.org/10.1007/978-3-319-39555-5_16</a>","ieee":"H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Offline witness encryption,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 285–303.","mla":"Abusalah, Hamza M., et al. <i>Offline Witness Encryption</i>. Vol. 9696, Springer, 2016, pp. 285–303, doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">10.1007/978-3-319-39555-5_16</a>."},"author":[{"full_name":"Abusalah, Hamza M","first_name":"Hamza M","last_name":"Abusalah","id":"40297222-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Fuchsbauer","first_name":"Georg","full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"year":"2016","publication_status":"published","oa_version":"Submitted Version","date_published":"2016-06-09T00:00:00Z","file":[{"creator":"system","file_size":515000,"date_created":"2018-12-12T10:17:20Z","file_id":"5273","access_level":"open_access","date_updated":"2020-07-14T12:44:39Z","content_type":"application/pdf","relation":"main_file","checksum":"34fa9ce681da845a1ba945ba3dc57867","file_name":"IST-2017-765-v1+1_838.pdf"}],"title":"Offline witness encryption","_id":"1229","alternative_title":["LNCS"],"quality_controlled":"1","intvolume":"      9696","publist_id":"6105","conference":{"name":"ACNS: Applied Cryptography and Network Security","end_date":"2016-06-22","start_date":"2016-06-19","location":"Guildford, UK"},"department":[{"_id":"KrPi"}],"has_accepted_license":"1","ddc":["005","600"],"oa":1},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.02615"}],"publist_id":"6104","conference":{"end_date":"2016-01-19","start_date":"2016-01-17","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","location":"St. Petersburg, FL, USA"},"department":[{"_id":"ToHe"}],"oa":1,"title":"Abstraction-driven concolic testing","_id":"1230","intvolume":"      9583","alternative_title":["LNCS"],"quality_controlled":"1","date_published":"2016-01-01T00:00:00Z","year":"2016","oa_version":"Preprint","publication_status":"published","month":"01","citation":{"ama":"Daca P, Gupta A, Henzinger TA. Abstraction-driven concolic testing. In: Vol 9583. Springer; 2016:328-347. doi:<a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">10.1007/978-3-662-49122-5_16</a>","mla":"Daca, Przemyslaw, et al. <i>Abstraction-Driven Concolic Testing</i>. Vol. 9583, Springer, 2016, pp. 328–47, doi:<a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">10.1007/978-3-662-49122-5_16</a>.","ieee":"P. Daca, A. Gupta, and T. A. Henzinger, “Abstraction-driven concolic testing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA, 2016, vol. 9583, pp. 328–347.","apa":"Daca, P., Gupta, A., &#38; Henzinger, T. A. (2016). Abstraction-driven concolic testing (Vol. 9583, pp. 328–347). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">https://doi.org/10.1007/978-3-662-49122-5_16</a>","ista":"Daca P, Gupta A, Henzinger TA. 2016. Abstraction-driven concolic testing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 9583, 328–347.","chicago":"Daca, Przemyslaw, Ashutosh Gupta, and Thomas A Henzinger. “Abstraction-Driven Concolic Testing,” 9583:328–47. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">https://doi.org/10.1007/978-3-662-49122-5_16</a>.","short":"P. Daca, A. Gupta, T.A. Henzinger, in:, Springer, 2016, pp. 328–347."},"related_material":{"record":[{"id":"1155","status":"public","relation":"dissertation_contains"}]},"author":[{"last_name":"Daca","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ashutosh","last_name":"Gupta","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"We thank Andrey Kupriyanov for feedback on the manuscript,\r\nand Michael Tautschnig for help with preparing the experiments. This research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award).","page":"328 - 347","publisher":"Springer","ec_funded":1,"isi":1,"date_updated":"2025-09-22T09:23:47Z","arxiv":1,"type":"conference","day":"01","status":"public","date_created":"2018-12-11T11:50:50Z","language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Concolic testing is a promising method for generating test suites for large programs. However, it suffers from the path-explosion problem and often fails to find tests that cover difficult-to-reach parts of programs. In contrast, model checkers based on counterexample-guided abstraction refinement explore programs exhaustively, while failing to scale on large programs with precision. In this paper, we present a novel method that iteratively combines concolic testing and model checking to find a test suite for a given coverage criterion. If concolic testing fails to cover some test goals, then the model checker refines its program abstraction to prove more paths infeasible, which reduces the search space for concolic testing. We have implemented our method on top of the concolictesting tool Crest and the model checker CpaChecker. We evaluated our tool on a collection of programs and a category of SvComp benchmarks. In our experiments, we observed an improvement in branch coverage compared to Crest from 48% to 63% in the best case, and from 66% to 71% on average."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"doi":"10.1007/978-3-662-49122-5_16","external_id":{"arxiv":["1511.02615"],"isi":["000375148800016"]},"volume":9583},{"title":"On the complexity of scrypt and proofs of space in the parallel random oracle model","_id":"1231","alternative_title":["LNCS"],"quality_controlled":"1","intvolume":"      9666","publist_id":"6103","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","end_date":"2016-05-12","start_date":"2016-05-08","location":"Vienna, Austria"},"department":[{"_id":"KrPi"},{"_id":"VlKo"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/100"}],"oa":1,"month":"04","citation":{"ama":"Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">10.1007/978-3-662-49896-5_13</a>","mla":"Alwen, Joel F., et al. <i>On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model</i>. Vol. 9666, Springer, 2016, pp. 358–87, doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">10.1007/978-3-662-49896-5_13</a>.","ieee":"J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.","apa":"Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., &#38; Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">https://doi.org/10.1007/978-3-662-49896-5_13</a>","ista":"Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666, 358–387.","short":"J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.","chicago":"Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov, Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model,” 9666:358–87. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">https://doi.org/10.1007/978-3-662-49896-5_13</a>."},"author":[{"first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Binyi","last_name":"Chen","full_name":"Chen, Binyi"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tessaro","first_name":"Stefano","full_name":"Tessaro, Stefano"}],"year":"2016","oa_version":"Submitted Version","publication_status":"published","date_published":"2016-04-28T00:00:00Z","type":"conference","day":"28","date_updated":"2025-09-22T09:22:54Z","status":"public","date_created":"2018-12-11T11:50:51Z","page":"358 - 387","acknowledgement":"Joël Alwen, Chethan Kamath, and Krzysztof Pietrzak’s research is partially supported by an ERC starting grant (259668-PSPC). Vladimir Kolmogorov is partially supported by an ERC consolidator grant (616160-DOICV). Binyi Chen was partially supported by NSF grants CNS-1423566 and CNS-1514526, and a gift from the Gareatis Foundation. Stefano Tessaro was partially supported by NSF grants CNS-1423566, CNS-1528178, a Hellman Fellowship, and the Glen and Susanne Culler Chair.\r\n\r\nThis work was done in part while the authors were visiting the Simons Institute for the Theory of Computing, supported by the Simons Foundation and by the DIMACS/Simons Collaboration in Cryptography through NSF grant CNS-1523467.","isi":1,"publisher":"Springer","ec_funded":1,"doi":"10.1007/978-3-662-49896-5_13","external_id":{"isi":["000389727200013"]},"project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography"},{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"volume":9666,"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","abstract":[{"text":"We study the time-and memory-complexities of the problem of computing labels of (multiple) randomly selected challenge-nodes in a directed acyclic graph. The w-bit label of a node is the hash of the labels of its parents, and the hash function is modeled as a random oracle. Specific instances of this problem underlie both proofs of space [Dziembowski et al. CRYPTO’15] as well as popular memory-hard functions like scrypt. As our main tool, we introduce the new notion of a probabilistic parallel entangled pebbling game, a new type of combinatorial pebbling game on a graph, which is closely related to the labeling game on the same graph. As a first application of our framework, we prove that for scrypt, when the underlying hash function is invoked n times, the cumulative memory complexity (CMC) (a notion recently introduced by Alwen and Serbinenko (STOC’15) to capture amortized memory-hardness for parallel adversaries) is at least Ω(w · (n/ log(n))2). This bound holds for adversaries that can store many natural functions of the labels (e.g., linear combinations), but still not arbitrary functions thereof. We then introduce and study a combinatorial quantity, and show how a sufficiently small upper bound on it (which we conjecture) extends our CMC bound for scrypt to hold against arbitrary adversaries. We also show that such an upper bound solves the main open problem for proofs-of-space protocols: namely, establishing that the time complexity of computing the label of a random node in a graph on n nodes (given an initial kw-bit state) reduces tightly to the time complexity for black pebbling on the same graph (given an initial k-node pebbling).","lang":"eng"}]},{"publisher":"Nature Publishing Group","publication":"Nature","isi":1,"acknowledgement":"We thank the MRC LMB Cambridge for the use of the Titan Krios microscope. Data processing was performed using the IST high-performance computer cluster. J.A.L. holds a long-term fellowship from FEBS. K.F. is partially funded by a MRC UK PhD fellowship.","page":"644 - 648","status":"public","date_created":"2018-12-11T11:50:51Z","date_updated":"2025-09-22T09:22:23Z","type":"journal_article","day":"29","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Mitochondrial electron transport chain complexes are organized into supercomplexes responsible for carrying out cellular respiration. Here we present three architectures of mammalian (ovine) supercomplexes determined by cryo-electron microscopy. We identify two distinct arrangements of supercomplex CICIII 2 CIV (the respirasome) - a major 'tight' form and a minor 'loose' form (resolved at the resolution of 5.8 Å and 6.7 Å, respectively), which may represent different stages in supercomplex assembly or disassembly. We have also determined an architecture of supercomplex CICIII 2 at 7.8 Å resolution. All observed density can be attributed to the known 80 subunits of the individual complexes, including 132 transmembrane helices. The individual complexes form tight interactions that vary between the architectures, with complex IV subunit COX7a switching contact from complex III to complex I. The arrangement of active sites within the supercomplex may help control reactive oxygen species production. To our knowledge, these are the first complete architectures of the dominant, physiologically relevant state of the electron transport chain."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"scopus_import":"1","volume":537,"project":[{"_id":"2593EBD6-B435-11E9-9278-68D0E5697425","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes"}],"doi":"10.1038/nature19774","external_id":{"isi":["000384331700042"]},"publist_id":"6102","department":[{"_id":"LeSa"}],"intvolume":"       537","quality_controlled":"1","title":"The architecture of respiratory supercomplexes","_id":"1232","date_published":"2016-09-29T00:00:00Z","year":"2016","oa_version":"None","publication_status":"published","author":[{"id":"322DA418-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9864-3586","full_name":"Letts, James A","first_name":"James A","last_name":"Letts"},{"id":"5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0","full_name":"Fiedorczuk, Karol","first_name":"Karol","last_name":"Fiedorczuk"},{"orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","last_name":"Sazanov","full_name":"Sazanov, Leonid A"}],"month":"09","issue":"7622","citation":{"ama":"Letts JA, Fiedorczuk K, Sazanov LA. The architecture of respiratory supercomplexes. <i>Nature</i>. 2016;537(7622):644-648. doi:<a href=\"https://doi.org/10.1038/nature19774\">10.1038/nature19774</a>","mla":"Letts, James A., et al. “The Architecture of Respiratory Supercomplexes.” <i>Nature</i>, vol. 537, no. 7622, Nature Publishing Group, 2016, pp. 644–48, doi:<a href=\"https://doi.org/10.1038/nature19774\">10.1038/nature19774</a>.","apa":"Letts, J. A., Fiedorczuk, K., &#38; Sazanov, L. A. (2016). The architecture of respiratory supercomplexes. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature19774\">https://doi.org/10.1038/nature19774</a>","ieee":"J. A. Letts, K. Fiedorczuk, and L. A. Sazanov, “The architecture of respiratory supercomplexes,” <i>Nature</i>, vol. 537, no. 7622. Nature Publishing Group, pp. 644–648, 2016.","ista":"Letts JA, Fiedorczuk K, Sazanov LA. 2016. The architecture of respiratory supercomplexes. Nature. 537(7622), 644–648.","chicago":"Letts, James A, Karol Fiedorczuk, and Leonid A Sazanov. “The Architecture of Respiratory Supercomplexes.” <i>Nature</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/nature19774\">https://doi.org/10.1038/nature19774</a>.","short":"J.A. Letts, K. Fiedorczuk, L.A. Sazanov, Nature 537 (2016) 644–648."}},{"intvolume":"      9562","quality_controlled":"1","alternative_title":["LNCS"],"_id":"1233","title":"Standard security does imply security against selective opening for markov distributions","oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/853"}],"department":[{"_id":"KrPi"}],"publist_id":"6100","conference":{"start_date":"2016-01-10","end_date":"2016-01-13","name":"TCC: Theory of Cryptography Conference","location":"Tel Aviv, Israel"},"author":[{"full_name":"Fuchsbauer, Georg","first_name":"Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Felix","last_name":"Heuer","full_name":"Heuer, Felix"},{"full_name":"Kiltz, Eike","first_name":"Eike","last_name":"Kiltz"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"citation":{"ieee":"G. Fuchsbauer, F. Heuer, E. Kiltz, and K. Z. Pietrzak, “Standard security does imply security against selective opening for markov distributions,” presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel, 2016, vol. 9562, pp. 282–305.","apa":"Fuchsbauer, G., Heuer, F., Kiltz, E., &#38; Pietrzak, K. Z. (2016). Standard security does imply security against selective opening for markov distributions (Vol. 9562, pp. 282–305). Presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">https://doi.org/10.1007/978-3-662-49096-9_12</a>","mla":"Fuchsbauer, Georg, et al. <i>Standard Security Does Imply Security against Selective Opening for Markov Distributions</i>. Vol. 9562, Springer, 2016, pp. 282–305, doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">10.1007/978-3-662-49096-9_12</a>.","ama":"Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. Standard security does imply security against selective opening for markov distributions. In: Vol 9562. Springer; 2016:282-305. doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">10.1007/978-3-662-49096-9_12</a>","chicago":"Fuchsbauer, Georg, Felix Heuer, Eike Kiltz, and Krzysztof Z Pietrzak. “Standard Security Does Imply Security against Selective Opening for Markov Distributions,” 9562:282–305. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">https://doi.org/10.1007/978-3-662-49096-9_12</a>.","short":"G. Fuchsbauer, F. Heuer, E. Kiltz, K.Z. Pietrzak, in:, Springer, 2016, pp. 282–305.","ista":"Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. 2016. Standard security does imply security against selective opening for markov distributions. TCC: Theory of Cryptography Conference, LNCS, vol. 9562, 282–305."},"month":"01","date_published":"2016-01-01T00:00:00Z","oa_version":"Submitted Version","publication_status":"published","year":"2016","status":"public","date_created":"2018-12-11T11:50:51Z","date_updated":"2025-09-22T09:21:52Z","day":"01","type":"conference","ec_funded":1,"publisher":"Springer","isi":1,"acknowledgement":"G. Fuchsbauer and K. Pietrzak are supported by the European Research Council, ERC Starting Grant (259668-PSPC). F. Heuer is funded by a Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation and DFG SPP 1736, Algorithms for BIG DATA. E. Kiltz is supported by a Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation, the German Israel Foundation, and ERC Project ERCC (FP7/615074).","page":"282 - 305","volume":9562,"project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"external_id":{"isi":["000376041100012"]},"doi":"10.1007/978-3-662-49096-9_12","abstract":[{"text":"About three decades ago it was realized that implementing private channels between parties which can be adaptively corrupted requires an encryption scheme that is secure against selective opening attacks. Whether standard (IND-CPA) security implies security against selective opening attacks has been a major open question since. The only known reduction from selective opening to IND-CPA security loses an exponential factor. A polynomial reduction is only known for the very special case where the distribution considered in the selective opening security experiment is a product distribution, i.e., the messages are sampled independently from each other. In this paper we give a reduction whose loss is quantified via the dependence graph (where message dependencies correspond to edges) of the underlying message distribution. In particular, for some concrete distributions including Markov distributions, our reduction is polynomial.","lang":"eng"}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"scopus_import":"1"},{"citation":{"ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. In: Vol 9636. Springer; 2016:112-129. doi:<a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">10.1007/978-3-662-49674-9_7</a>","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2016). Faster statistical model checking for unbounded temporal properties (Vol. 9636, pp. 112–129). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Eindhoven, The Netherlands: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">https://doi.org/10.1007/978-3-662-49674-9_7</a>","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Eindhoven, The Netherlands, 2016, vol. 9636, pp. 112–129.","mla":"Daca, Przemyslaw, et al. <i>Faster Statistical Model Checking for Unbounded Temporal Properties</i>. Vol. 9636, Springer, 2016, pp. 112–29, doi:<a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">10.1007/978-3-662-49674-9_7</a>.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Springer, 2016, pp. 112–129.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties,” 9636:112–29. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">https://doi.org/10.1007/978-3-662-49674-9_7</a>.","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Faster statistical model checking for unbounded temporal properties. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9636, 112–129."},"month":"01","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1155"},{"status":"public","relation":"later_version","id":"471"}]},"author":[{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan"},{"first_name":"Tatjana","last_name":"Petrov","full_name":"Petrov, Tatjana","orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2016-01-01T00:00:00Z","oa_version":"Preprint","publication_status":"published","year":"2016","_id":"1234","title":"Faster statistical model checking for unbounded temporal properties","intvolume":"      9636","quality_controlled":"1","alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.05739"}],"department":[{"_id":"ToHe"},{"_id":"CaGu"}],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2016-04-02","end_date":"2016-04-08","location":"Eindhoven, The Netherlands"},"publist_id":"6099","oa":1,"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"external_id":{"isi":["000406428000007"],"arxiv":["1504.05739"]},"doi":"10.1007/978-3-662-49674-9_7","volume":9636,"language":[{"iso":"eng"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds."}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-22T09:21:17Z","arxiv":1,"day":"01","type":"conference","status":"public","date_created":"2018-12-11T11:50:51Z","acknowledgement":"This research was funded in part by the European Research Council (ERC) under\r\ngrant  agreement  267989  (QUAREM),  the  Austrian  Science  Fund  (FWF)  under\r\ngrants project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), the Peo-\r\nple Programme (Marie Curie Actions) of the European Union’s Seventh Framework\r\nProgramme (FP7/2007-2013) REA Grant No 291734, the SNSF Advanced Postdoc.\r\nMobility Fellowship – grant number P300P2\r\n161067, and the Czech Science Foun-\r\ndation under grant agreement P202/12/G061.","page":"112 - 129","ec_funded":1,"publisher":"Springer","isi":1},{"_id":"1235","title":"Constrained PRFs for unbounded inputs with short keys","quality_controlled":"1","alternative_title":["LNCS"],"intvolume":"      9696","department":[{"_id":"KrPi"}],"conference":{"location":"Guildford, UK","start_date":"2016-06-19","end_date":"2016-06-22","name":"ACNS: Applied Cryptography and Network Security"},"publist_id":"6098","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/279.pdf"}],"oa":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"83"}]},"citation":{"mla":"Abusalah, Hamza M., and Georg Fuchsbauer. <i>Constrained PRFs for Unbounded Inputs with Short Keys</i>. Vol. 9696, Springer, 2016, pp. 445–63, doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">10.1007/978-3-319-39555-5_24</a>.","apa":"Abusalah, H. M., &#38; Fuchsbauer, G. (2016). Constrained PRFs for unbounded inputs with short keys (Vol. 9696, pp. 445–463). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">https://doi.org/10.1007/978-3-319-39555-5_24</a>","ieee":"H. M. Abusalah and G. Fuchsbauer, “Constrained PRFs for unbounded inputs with short keys,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 445–463.","ama":"Abusalah HM, Fuchsbauer G. Constrained PRFs for unbounded inputs with short keys. In: Vol 9696. Springer; 2016:445-463. doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">10.1007/978-3-319-39555-5_24</a>","ista":"Abusalah HM, Fuchsbauer G. 2016. Constrained PRFs for unbounded inputs with short keys. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696, 445–463.","short":"H.M. Abusalah, G. Fuchsbauer, in:, Springer, 2016, pp. 445–463.","chicago":"Abusalah, Hamza M, and Georg Fuchsbauer. “Constrained PRFs for Unbounded Inputs with Short Keys,” 9696:445–63. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">https://doi.org/10.1007/978-3-319-39555-5_24</a>."},"month":"01","author":[{"full_name":"Abusalah, Hamza M","last_name":"Abusalah","first_name":"Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Georg","last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Submitted Version","publication_status":"published","year":"2016","date_published":"2016-01-01T00:00:00Z","day":"01","type":"conference","date_updated":"2025-09-22T09:20:42Z","status":"public","date_created":"2018-12-11T11:50:52Z","page":"445 - 463","acknowledgement":"H. Abusalah—Research supported by the European Research Council, ERC starting grant (259668-PSPC) and ERC consolidator grant (682815 - TOCNeT).","isi":1,"ec_funded":1,"publisher":"Springer","external_id":{"isi":["000386324500024"]},"doi":"10.1007/978-3-319-39555-5_24","project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography"},{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"volume":9696,"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"A constrained pseudorandom function (CPRF) F: K×X → Y for a family T of subsets of χ is a function where for any key k ∈ K and set S ∈ T one can efficiently compute a short constrained key kS, which allows to evaluate F(k, ·) on all inputs x ∈ S, while the outputs on all inputs x /∈ S look random even given kS. Abusalah et al. recently constructed the first constrained PRF for inputs of arbitrary length whose sets S are decided by Turing machines. They use their CPRF to build broadcast encryption and the first ID-based non-interactive key exchange for an unbounded number of users. Their constrained keys are obfuscated circuits and are therefore large. In this work we drastically reduce the key size and define a constrained key for a Turing machine M as a short signature on M. For this, we introduce a new signature primitive with constrained signing keys that let one only sign certain messages, while forging a signature on others is hard even when knowing the coins for key generation.","lang":"eng"}],"article_processing_charge":"No"},{"date_updated":"2025-09-22T09:20:00Z","day":"02","type":"conference","date_created":"2018-12-11T11:50:52Z","status":"public","acknowledgement":"Supported by the European Research Council, ERC Starting Grant (259668-PSPC).","page":"413 - 428","ec_funded":1,"publisher":"Springer","file_date_updated":"2020-07-14T12:44:41Z","isi":1,"project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"pubrep_id":"764","external_id":{"isi":["000374102500024"]},"doi":"10.1007/978-3-319-29485-8_24","volume":9610,"language":[{"iso":"eng"}],"scopus_import":"1","abstract":[{"text":"A constrained pseudorandom function F: K × X → Y for a family T ⊆ 2X of subsets of X is a function where for any key k ∈ K and set S ∈ T one can efficiently compute a constrained key kS which allows to evaluate F (k, ·) on all inputs x ∈ S, while even given this key, the outputs on all inputs x ∉ S look random. At Asiacrypt’13 Boneh and Waters gave a construction which supports the most general set family so far. Its keys kc are defined for sets decided by boolean circuits C and enable evaluation of the PRF on any x ∈ X where C(x) = 1. In their construction the PRF input length and the size of the circuits C for which constrained keys can be computed must be fixed beforehand during key generation. We construct a constrained PRF that has an unbounded input length and whose constrained keys can be defined for any set recognized by a Turing machine. The only a priori bound we make is on the description size of the machines. We prove our construction secure assuming publiccoin differing-input obfuscation. As applications of our constrained PRF we build a broadcast encryption scheme where the number of potential receivers need not be fixed at setup (in particular, the length of the keys is independent of the number of parties) and the first identity-based non-interactive key exchange protocol with no bound on the number of parties that can agree on a shared key.","lang":"eng"}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1236","title":"Constrained PRFs for unbounded inputs","file":[{"creator":"system","file_id":"4664","file_size":495176,"date_created":"2018-12-12T10:08:05Z","access_level":"open_access","date_updated":"2020-07-14T12:44:41Z","content_type":"application/pdf","relation":"main_file","file_name":"IST-2017-764-v1+1_279.pdf","checksum":"3851cee49933ae13b1272e516f213e13"}],"intvolume":"      9610","quality_controlled":"1","alternative_title":["LNCS"],"department":[{"_id":"KrPi"}],"publist_id":"6097","conference":{"location":"San Francisco, CA, USA","name":"CT-RSA: Topics in Cryptology","end_date":"2016-03-04","start_date":"2016-02-29"},"oa":1,"ddc":["005","600"],"has_accepted_license":"1","citation":{"short":"H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 413–428.","chicago":"Abusalah, Hamza M, Georg Fuchsbauer, and Krzysztof Z Pietrzak. “Constrained PRFs for Unbounded Inputs,” 9610:413–28. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-29485-8_24\">https://doi.org/10.1007/978-3-319-29485-8_24</a>.","ista":"Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Constrained PRFs for unbounded inputs. CT-RSA: Topics in Cryptology, LNCS, vol. 9610, 413–428.","ama":"Abusalah HM, Fuchsbauer G, Pietrzak KZ. Constrained PRFs for unbounded inputs. In: Vol 9610. Springer; 2016:413-428. doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_24\">10.1007/978-3-319-29485-8_24</a>","ieee":"H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Constrained PRFs for unbounded inputs,” presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA, 2016, vol. 9610, pp. 413–428.","apa":"Abusalah, H. M., Fuchsbauer, G., &#38; Pietrzak, K. Z. (2016). Constrained PRFs for unbounded inputs (Vol. 9610, pp. 413–428). Presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-319-29485-8_24\">https://doi.org/10.1007/978-3-319-29485-8_24</a>","mla":"Abusalah, Hamza M., et al. <i>Constrained PRFs for Unbounded Inputs</i>. Vol. 9610, Springer, 2016, pp. 413–28, doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_24\">10.1007/978-3-319-29485-8_24</a>."},"month":"02","related_material":{"record":[{"id":"83","relation":"dissertation_contains","status":"public"}]},"author":[{"id":"40297222-F248-11E8-B48F-1D18A9856A87","full_name":"Abusalah, Hamza M","first_name":"Hamza M","last_name":"Abusalah"},{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer","first_name":"Georg"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2016-02-02T00:00:00Z","publication_status":"published","oa_version":"Submitted Version","year":"2016"},{"conference":{"location":"Marseille, France","name":"CTIC: Computational Topology in Image Context","start_date":"2016-06-15","end_date":"2016-06-17"},"publist_id":"6096","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"title":"Computation of cubical Steenrod squares","_id":"1237","intvolume":"      9667","alternative_title":["LNCS"],"quality_controlled":"1","date_published":"2016-06-02T00:00:00Z","year":"2016","publication_status":"published","oa_version":"None","month":"06","citation":{"ieee":"M. Krcál and P. Pilarczyk, “Computation of cubical Steenrod squares,” presented at the CTIC: Computational Topology in Image Context, Marseille, France, 2016, vol. 9667, pp. 140–151.","apa":"Krcál, M., &#38; Pilarczyk, P. (2016). Computation of cubical Steenrod squares (Vol. 9667, pp. 140–151). Presented at the CTIC: Computational Topology in Image Context, Marseille, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-39441-1_13\">https://doi.org/10.1007/978-3-319-39441-1_13</a>","mla":"Krcál, Marek, and Pawel Pilarczyk. <i>Computation of Cubical Steenrod Squares</i>. Vol. 9667, Springer, 2016, pp. 140–51, doi:<a href=\"https://doi.org/10.1007/978-3-319-39441-1_13\">10.1007/978-3-319-39441-1_13</a>.","ama":"Krcál M, Pilarczyk P. Computation of cubical Steenrod squares. In: Vol 9667. Springer; 2016:140-151. doi:<a href=\"https://doi.org/10.1007/978-3-319-39441-1_13\">10.1007/978-3-319-39441-1_13</a>","chicago":"Krcál, Marek, and Pawel Pilarczyk. “Computation of Cubical Steenrod Squares,” 9667:140–51. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39441-1_13\">https://doi.org/10.1007/978-3-319-39441-1_13</a>.","short":"M. Krcál, P. Pilarczyk, in:, Springer, 2016, pp. 140–151.","ista":"Krcál M, Pilarczyk P. 2016. Computation of cubical Steenrod squares. CTIC: Computational Topology in Image Context, LNCS, vol. 9667, 140–151."},"author":[{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek","first_name":"Marek","last_name":"Krcál"},{"first_name":"Pawel","last_name":"Pilarczyk","full_name":"Pilarczyk, Pawel","id":"3768D56A-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"The research conducted by both authors has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreements no. 291734 (for M. K.) and no. 622033 (for P. P.).","page":"140 - 151","ec_funded":1,"publisher":"Springer","isi":1,"date_updated":"2025-09-22T09:19:17Z","type":"conference","day":"02","status":"public","date_created":"2018-12-11T11:50:52Z","language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"No","abstract":[{"text":"Bitmap images of arbitrary dimension may be formally perceived as unions of m-dimensional boxes aligned with respect to a rectangular grid in ℝm. Cohomology and homology groups are well known topological invariants of such sets. Cohomological operations, such as the cup product, provide higher-order algebraic topological invariants, especially important for digital images of dimension higher than 3. If such an operation is determined at the level of simplicial chains [see e.g. González-Díaz, Real, Homology, Homotopy Appl, 2003, 83-93], then it is effectively computable. However, decomposing a cubical complex into a simplicial one deleteriously affects the efficiency of such an approach. In order to avoid this overhead, a direct cubical approach was applied in [Pilarczyk, Real, Adv. Comput. Math., 2015, 253-275] for the cup product in cohomology, and implemented in the ChainCon software package [http://www.pawelpilarczyk.com/chaincon/]. We establish a formula for the Steenrod square operations [see Steenrod, Annals of Mathematics. Second Series, 1947, 290-320] directly at the level of cubical chains, and we prove the correctness of this formula. An implementation of this formula is programmed in C++ within the ChainCon software framework. We provide a few examples and discuss the effectiveness of this approach. One specific application follows from the fact that Steenrod squares yield tests for the topological extension problem: Can a given map A → Sd to a sphere Sd be extended to a given super-complex X of A? In particular, the ROB-SAT problem, which is to decide for a given function f: X → ℝm and a value r &gt; 0 whether every g: X → ℝm with ∥g - f ∥∞ ≤ r has a root, reduces to the extension problem.","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"name":"Persistent Homology - Images, Data and Maps","grant_number":"622033","call_identifier":"FP7","_id":"255F06BE-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-319-39441-1_13","external_id":{"isi":["000389805800013"]},"volume":9667}]