[{"status":"public","_id":"3274","issue":"6","publist_id":"3372","doi":"10.1016/j.enganabound.2011.12.014","abstract":[{"lang":"eng","text":"A boundary element model of a tunnel running through horizontally layered soil with anisotropic material properties is presented. Since there is no analytical fundamental solution for wave propagation inside a layered orthotropic medium in 3D, the fundamental displacements and stresses have to be calculated numerically. In our model this is done in the Fourier domain with respect to space and time. The assumption of a straight tunnel with infinite extension in the x direction makes it possible to decouple the system for every wave number kx, leading to a 2.5D-problem, which is suited for parallel computation. The special form of the fundamental solution, resulting from our Fourier ansatz, and the fact, that the calculation of the boundary integral equation is performed in the Fourier domain, enhances the stability and efficiency of the numerical calculations."}],"scopus_import":1,"type":"journal_article","month":"06","date_updated":"2021-01-12T07:42:19Z","publication_status":"published","oa_version":"None","acknowledgement":"This work was supported by the Austrian Federal Ministry of Transport, Innovation and Technology under the Grant Bmvit-isb2 and the FFG under the project Pr. Nr. 809089.","department":[{"_id":"GaTk"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"G. Rieckh, W. Kreuzer, H. Waubke, P. Balazs,  Engineering Analysis with Boundary Elements 36 (2012) 960–967.","ama":"Rieckh G, Kreuzer W, Waubke H, Balazs P. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. <i> Engineering Analysis with Boundary Elements</i>. 2012;36(6):960-967. doi:<a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">10.1016/j.enganabound.2011.12.014</a>","chicago":"Rieckh, Georg, Wolfgang Kreuzer, Holger Waubke, and Peter Balazs. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” <i> Engineering Analysis with Boundary Elements</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">https://doi.org/10.1016/j.enganabound.2011.12.014</a>.","ieee":"G. Rieckh, W. Kreuzer, H. Waubke, and P. Balazs, “A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil,” <i> Engineering Analysis with Boundary Elements</i>, vol. 36, no. 6. Elsevier, pp. 960–967, 2012.","ista":"Rieckh G, Kreuzer W, Waubke H, Balazs P. 2012. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil.  Engineering Analysis with Boundary Elements. 36(6), 960–967.","apa":"Rieckh, G., Kreuzer, W., Waubke, H., &#38; Balazs, P. (2012). A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. <i> Engineering Analysis with Boundary Elements</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">https://doi.org/10.1016/j.enganabound.2011.12.014</a>","mla":"Rieckh, Georg, et al. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” <i> Engineering Analysis with Boundary Elements</i>, vol. 36, no. 6, Elsevier, 2012, pp. 960–67, doi:<a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">10.1016/j.enganabound.2011.12.014</a>."},"day":"01","author":[{"last_name":"Rieckh","full_name":"Rieckh, Georg","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg"},{"first_name":"Wolfgang","full_name":"Kreuzer, Wolfgang","last_name":"Kreuzer"},{"full_name":"Waubke, Holger","first_name":"Holger","last_name":"Waubke"},{"last_name":"Balazs","first_name":"Peter","full_name":"Balazs, Peter"}],"publisher":"Elsevier","title":"A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil","date_published":"2012-06-01T00:00:00Z","quality_controlled":"1","date_created":"2018-12-11T12:02:24Z","intvolume":"        36","page":"960 - 967","year":"2012","publication":" Engineering Analysis with Boundary Elements","volume":36,"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"volume":24,"publication":"Life on Earth and other planetary bodies","year":"2012","page":"387 - 405","date_created":"2018-12-11T12:02:25Z","intvolume":"        24","quality_controlled":"1","title":"Can the evolution of multicellularity be anticipated in the exploration of the solar system?","date_published":"2012-01-01T00:00:00Z","publisher":"Springer","author":[{"last_name":"de Vladar","orcid":"0000-0002-5985-7653","id":"2A181218-F248-11E8-B48F-1D18A9856A87","first_name":"Harold","full_name":"de Vladar, Harold"},{"full_name":"Chela Flores, Julian","first_name":"Julian","last_name":"Chela Flores"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"H. de Vladar and J. Chela Flores, “Can the evolution of multicellularity be anticipated in the exploration of the solar system?,” in <i>Life on Earth and other planetary bodies</i>, vol. 24, Springer, 2012, pp. 387–405.","chicago":"Vladar, Harold de, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” In <i>Life on Earth and Other Planetary Bodies</i>, 24:387–405. Springer, 2012. <a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">https://doi.org/10.1007/978-94-007-4966-5_22</a>.","ama":"de Vladar H, Chela Flores J. Can the evolution of multicellularity be anticipated in the exploration of the solar system? In: <i>Life on Earth and Other Planetary Bodies</i>. Vol 24. Springer; 2012:387-405. doi:<a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">10.1007/978-94-007-4966-5_22</a>","short":"H. de Vladar, J. Chela Flores, in:, Life on Earth and Other Planetary Bodies, Springer, 2012, pp. 387–405.","apa":"de Vladar, H., &#38; Chela Flores, J. (2012). Can the evolution of multicellularity be anticipated in the exploration of the solar system? In <i>Life on Earth and other planetary bodies</i> (Vol. 24, pp. 387–405). Springer. <a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">https://doi.org/10.1007/978-94-007-4966-5_22</a>","mla":"de Vladar, Harold, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” <i>Life on Earth and Other Planetary Bodies</i>, vol. 24, Springer, 2012, pp. 387–405, doi:<a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">10.1007/978-94-007-4966-5_22</a>.","ista":"de Vladar H, Chela Flores J. 2012.Can the evolution of multicellularity be anticipated in the exploration of the solar system? In: Life on Earth and other planetary bodies. Cellular Origin, Life in Extreme Habitats and Astrobiology, vol. 24, 387–405."},"day":"01","department":[{"_id":"NiBa"}],"date_updated":"2021-01-12T07:42:20Z","publication_status":"published","oa_version":"None","month":"01","type":"book_chapter","alternative_title":["Cellular Origin, Life in Extreme Habitats and Astrobiology"],"publist_id":"3369","abstract":[{"text":"The problem of the origin of metazoa is becoming more urgent in the context of astrobiology. By now it is clear that clues to the understanding of this crucial transition in the evolution of life can arise in a fourth pathway besides the three possibilities in the quest for simplicity outlined by Bonner in his classical book. In other words, solar system exploration seems to be one way in the long-term to elucidate the simplicity of evolutionary development. We place these ideas in the context of different inheritance systems, namely the genotypic and phenotypic replicators with limited or unlimited heredity, and ask which of these can support multicellular development, and to which degree of complexity. However, the quest for evidence on the evolution of biotas from planets around other stars does not seem to be feasible with present technology with direct visualization of living organisms on exoplanets. But this may be attempted on the Galilean moons of Jupiter where there is a possibility of detecting reliable biomarkers in the next decade with the Europa Jupiter System Mission, in view of recent progress by landing micropenetrators on planetary, or satellite surfaces. Mars is a second possibility in the inner Solar System, in spite of the multiple difficulties faced by the fleet of past, present and future missions. We discuss a series of preliminary ideas for elucidating the origin of metazoan analogues with available instrumentation in potential payloads of feasible space missions to the Galilean moons.","lang":"eng"}],"doi":"10.1007/978-94-007-4966-5_22","_id":"3277","status":"public"},{"alternative_title":["LNCS"],"month":"05","publication_status":"published","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","day":"04","ec_funded":1,"status":"public","abstract":[{"text":"We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the number of queries to the PRF. Our construction requires only O(logq) invocations to the underlying PRG with each query. In comparison, the number of invocations by the best previous hardness-preserving construction (GGM using Levin's trick) is logarithmic in the hardness of the PRG. For example, starting from an exponentially secure PRG {0,1} n → {0,1} 2n, we get a PRF which is exponentially secure if queried at most q = exp(√n)times and where each invocation of the PRF requires Θ(√n) queries to the underlying PRG. This is much less than the Θ(n) required by known constructions. \r\n","lang":"eng"}],"publist_id":"3367","doi":"10.1007/978-3-642-28914-9_21","intvolume":"      7194","page":"369 - 382","language":[{"iso":"eng"}],"publisher":"Springer","type":"conference","date_updated":"2021-01-12T07:42:21Z","oa_version":"None","department":[{"_id":"KrPi"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"A. Jain, K. Z. Pietrzak, and A. Tentes, “Hardness preserving constructions of pseudorandom functions,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 369–382.","ama":"Jain A, Pietrzak KZ, Tentes A. Hardness preserving constructions of pseudorandom functions. In: Vol 7194. Springer; 2012:369-382. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">10.1007/978-3-642-28914-9_21</a>","short":"A. Jain, K.Z. Pietrzak, A. Tentes, in:, Springer, 2012, pp. 369–382.","chicago":"Jain, Abhishek, Krzysztof Z Pietrzak, and Aris Tentes. “Hardness Preserving Constructions of Pseudorandom Functions,” 7194:369–82. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">https://doi.org/10.1007/978-3-642-28914-9_21</a>.","ista":"Jain A, Pietrzak KZ, Tentes A. 2012. Hardness preserving constructions of pseudorandom functions. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 369–382.","mla":"Jain, Abhishek, et al. <i>Hardness Preserving Constructions of Pseudorandom Functions</i>. Vol. 7194, Springer, 2012, pp. 369–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">10.1007/978-3-642-28914-9_21</a>.","apa":"Jain, A., Pietrzak, K. Z., &#38; Tentes, A. (2012). Hardness preserving constructions of pseudorandom functions (Vol. 7194, pp. 369–382). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">https://doi.org/10.1007/978-3-642-28914-9_21</a>"},"author":[{"first_name":"Abhishek","full_name":"Jain, Abhishek","last_name":"Jain"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"first_name":"Aris","full_name":"Tentes, Aris","last_name":"Tentes"}],"_id":"3279","scopus_import":1,"date_created":"2018-12-11T12:02:25Z","main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/tcc2012-index.html"}],"year":"2012","volume":7194,"conference":{"name":"TCC: Theory of Cryptography Conference","end_date":"2012-03-21","start_date":"2012-03-19","location":"Taormina, Sicily, Italy"},"project":[{"grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"title":"Hardness preserving constructions of pseudorandom functions","date_published":"2012-05-04T00:00:00Z","quality_controlled":"1"},{"status":"public","doi":"10.1007/978-3-642-28914-9_31","abstract":[{"text":"The (decisional) learning with errors problem (LWE) asks to distinguish &quot;noisy&quot; inner products of a secret vector with random vectors from uniform. The learning parities with noise problem (LPN) is the special case where the elements of the vectors are bits. In recent years, the LWE and LPN problems have found many applications in cryptography. In this paper we introduce a (seemingly) much stronger adaptive assumption, called &quot;subspace LWE&quot; (SLWE), where the adversary can learn the inner product of the secret and random vectors after they were projected into an adaptively and adversarially chosen subspace. We prove that, surprisingly, the SLWE problem mapping into subspaces of dimension d is almost as hard as LWE using secrets of length d (the other direction is trivial.) This result immediately implies that several existing cryptosystems whose security is based on the hardness of the LWE/LPN problems are provably secure in a much stronger sense than anticipated. As an illustrative example we show that the standard way of using LPN for symmetric CPA secure encryption is even secure against a very powerful class of related key attacks. ","lang":"eng"}],"publist_id":"3366","month":"05","alternative_title":["LNCS"],"day":"04","ec_funded":1,"acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC).","publication_status":"published","publisher":"Springer","page":"548 - 563","intvolume":"      7194","language":[{"iso":"eng"}],"_id":"3280","type":"conference","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Pietrzak KZ. 2012. Subspace LWE. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 548–563.","apa":"Pietrzak, K. Z. (2012). Subspace LWE (Vol. 7194, pp. 548–563). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">https://doi.org/10.1007/978-3-642-28914-9_31</a>","mla":"Pietrzak, Krzysztof Z. <i>Subspace LWE</i>. Vol. 7194, Springer, 2012, pp. 548–63, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">10.1007/978-3-642-28914-9_31</a>.","ieee":"K. Z. Pietrzak, “Subspace LWE,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 548–563.","short":"K.Z. Pietrzak, in:, Springer, 2012, pp. 548–563.","ama":"Pietrzak KZ. Subspace LWE. In: Vol 7194. Springer; 2012:548-563. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">10.1007/978-3-642-28914-9_31</a>","chicago":"Pietrzak, Krzysztof Z. “Subspace LWE,” 7194:548–63. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">https://doi.org/10.1007/978-3-642-28914-9_31</a>."},"author":[{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"oa":1,"oa_version":"Submitted Version","date_updated":"2021-01-12T07:42:21Z","department":[{"_id":"KrPi"}],"conference":{"name":"TCC: Theory of Cryptography Conference","end_date":"2012-03-21","location":"Taormina, Sicily, Italy","start_date":"2012-03-19"},"quality_controlled":"1","project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"title":"Subspace LWE","date_published":"2012-05-04T00:00:00Z","date_created":"2018-12-11T12:02:26Z","volume":7194,"main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/71940166/71940166.pdf","open_access":"1"}],"year":"2012"},{"abstract":[{"text":"We consider the problem of amplifying the &quot;lossiness&quot; of functions. We say that an oracle circuit C*: {0,1} m → {0,1}* amplifies relative lossiness from ℓ/n to L/m if for every function f:{0,1} n → {0,1} n it holds that 1 If f is injective then so is C f. 2 If f has image size of at most 2 n-ℓ, then C f has image size at most 2 m-L. The question is whether such C* exists for L/m ≫ ℓ/n. This problem arises naturally in the context of cryptographic &quot;lossy functions,&quot; where the relative lossiness is the key parameter. We show that for every circuit C* that makes at most t queries to f, the relative lossiness of C f is at most L/m ≤ ℓ/n + O(log t)/n. In particular, no black-box method making a polynomial t = poly(n) number of queries can amplify relative lossiness by more than an O(logn)/n additive term. We show that this is tight by giving a simple construction (cascading with some randomization) that achieves such amplification.","lang":"eng"}],"doi":"10.1007/978-3-642-28914-9_26","publist_id":"3365","_id":"3281","status":"public","author":[{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rosen","full_name":"Rosen, Alon","first_name":"Alon"},{"full_name":"Segev, Gil","first_name":"Gil","last_name":"Segev"}],"day":"04","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Pietrzak KZ, Rosen A, Segev G. 2012. Lossy functions do not amplify well. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 458–475.","apa":"Pietrzak, K. Z., Rosen, A., &#38; Segev, G. (2012). Lossy functions do not amplify well (Vol. 7194, pp. 458–475). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">https://doi.org/10.1007/978-3-642-28914-9_26</a>","mla":"Pietrzak, Krzysztof Z., et al. <i>Lossy Functions Do Not Amplify Well</i>. Vol. 7194, Springer, 2012, pp. 458–75, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">10.1007/978-3-642-28914-9_26</a>.","short":"K.Z. Pietrzak, A. Rosen, G. Segev, in:, Springer, 2012, pp. 458–475.","ama":"Pietrzak KZ, Rosen A, Segev G. Lossy functions do not amplify well. In: Vol 7194. Springer; 2012:458-475. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">10.1007/978-3-642-28914-9_26</a>","chicago":"Pietrzak, Krzysztof Z, Alon Rosen, and Gil Segev. “Lossy Functions Do Not Amplify Well,” 7194:458–75. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">https://doi.org/10.1007/978-3-642-28914-9_26</a>.","ieee":"K. Z. Pietrzak, A. Rosen, and G. Segev, “Lossy functions do not amplify well,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 458–475."},"department":[{"_id":"KrPi"}],"acknowledgement":"We would like to thank Oded Goldreich and Omer Rein- gold for discussions at an early stage of this project, and Scott Aaronson for clarifications regarding the collision problem.\r\n","publication_status":"published","oa_version":"None","date_updated":"2021-01-12T07:42:22Z","month":"05","type":"conference","alternative_title":["LNCS"],"quality_controlled":"1","date_published":"2012-05-04T00:00:00Z","title":"Lossy functions do not amplify well","publisher":"Springer","conference":{"name":"TCC: Theory of Cryptography Conference","location":"Taormina, Sicily, Italy","start_date":"2012-03-19","end_date":"2012-03-21"},"volume":7194,"language":[{"iso":"eng"}],"year":"2012","main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/tcc2012-index.html"}],"page":"458 - 475","date_created":"2018-12-11T12:02:26Z","intvolume":"      7194"},{"ddc":["000","004"],"date_created":"2018-12-11T12:02:27Z","year":"2012","volume":7237,"conference":{"end_date":"2012-04-19","location":"Cambridge, UK","start_date":"2012-04-15","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668"}],"title":"Message authentication, revisited","date_published":"2012-03-10T00:00:00Z","quality_controlled":"1","pubrep_id":"686","type":"conference","date_updated":"2021-01-12T07:42:22Z","oa_version":"Submitted Version","department":[{"_id":"KrPi"}],"file":[{"file_name":"IST-2016-686-v1+1_059.pdf","file_size":372292,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:06Z","access_level":"open_access","date_created":"2018-12-12T10:14:23Z","file_id":"5074","relation":"main_file","checksum":"8557c17a8c2586d06ebfe62d934f5c5f","creator":"system"}],"citation":{"ama":"Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. Message authentication, revisited. In: Vol 7237. Springer; 2012:355-374. doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">10.1007/978-3-642-29011-4_22</a>","short":"Y. Dodis, K.Z. Pietrzak, E. Kiltz, D. Wichs, in:, Springer, 2012, pp. 355–374.","chicago":"Dodis, Yevgeniy, Krzysztof Z Pietrzak, Eike Kiltz, and Daniel Wichs. “Message Authentication, Revisited,” 7237:355–74. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">https://doi.org/10.1007/978-3-642-29011-4_22</a>.","ieee":"Y. Dodis, K. Z. Pietrzak, E. Kiltz, and D. Wichs, “Message authentication, revisited,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK, 2012, vol. 7237, pp. 355–374.","ista":"Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. 2012. Message authentication, revisited. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 7237, 355–374.","apa":"Dodis, Y., Pietrzak, K. Z., Kiltz, E., &#38; Wichs, D. (2012). Message authentication, revisited (Vol. 7237, pp. 355–374). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">https://doi.org/10.1007/978-3-642-29011-4_22</a>","mla":"Dodis, Yevgeniy, et al. <i>Message Authentication, Revisited</i>. Vol. 7237, Springer, 2012, pp. 355–74, doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">10.1007/978-3-642-29011-4_22</a>."},"has_accepted_license":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Yevgeniy","full_name":"Dodis, Yevgeniy","last_name":"Dodis"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"},{"full_name":"Kiltz, Eike","first_name":"Eike","last_name":"Kiltz"},{"first_name":"Daniel","full_name":"Wichs, Daniel","last_name":"Wichs"}],"oa":1,"_id":"3282","file_date_updated":"2020-07-14T12:46:06Z","intvolume":"      7237","page":"355 - 374","language":[{"iso":"eng"}],"publisher":"Springer","alternative_title":["LNCS"],"month":"03","publication_status":"published","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","day":"10","ec_funded":1,"status":"public","license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"lang":"eng","text":"Traditionally, symmetric-key message authentication codes (MACs) are easily built from pseudorandom functions (PRFs). In this work we propose a wide variety of other approaches to building efficient MACs, without going through a PRF first. In particular, unlike deterministic PRF-based MACs, where each message has a unique valid tag, we give a number of probabilistic MAC constructions from various other primitives/assumptions. Our main results are summarized as follows: We show several new probabilistic MAC constructions from a variety of general assumptions, including CCA-secure encryption, Hash Proof Systems and key-homomorphic weak PRFs. By instantiating these frameworks under concrete number theoretic assumptions, we get several schemes which are more efficient than just using a state-of-the-art PRF instantiation under the corresponding assumption. For probabilistic MACs, unlike deterministic ones, unforgeability against a chosen message attack (uf-cma ) alone does not imply security if the adversary can additionally make verification queries (uf-cmva ). We give an efficient generic transformation from any uf-cma secure MAC which is &quot;message-hiding&quot; into a uf-cmva secure MAC. This resolves the main open problem of Kiltz et al. from Eurocrypt'11; By using our transformation on their constructions, we get the first efficient MACs from the LPN assumption. While all our new MAC constructions immediately give efficient actively secure, two-round symmetric-key identification schemes, we also show a very simple, three-round actively secure identification protocol from any weak PRF. In particular, the resulting protocol is much more efficient than the trivial approach of building a regular PRF from a weak PRF. © 2012 International Association for Cryptologic Research."}],"doi":"10.1007/978-3-642-29011-4_22","publist_id":"3364"},{"month":"01","type":"conference","date_updated":"2021-01-12T07:42:23Z","publication_status":"published","acknowledgement":"Vladimir Kolmogorov is supported by the Royal Academy of Eng ineering/EPSRC.","oa":1,"author":[{"full_name":"Vladimir Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"},{"last_name":"Živný","full_name":"Živný, Stanislav","first_name":"Stanislav"}],"extern":1,"day":"01","citation":{"ista":"Kolmogorov V, Živný S. 2012. The complexity of conservative valued CSPs. SODA: Symposium on Discrete Algorithms, 750–759.","mla":"Kolmogorov, Vladimir, and Stanislav Živný. <i>The Complexity of Conservative Valued CSPs</i>. SIAM, 2012, pp. 750–59.","apa":"Kolmogorov, V., &#38; Živný, S. (2012). The complexity of conservative valued CSPs (pp. 750–759). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.","ama":"Kolmogorov V, Živný S. The complexity of conservative valued CSPs. In: SIAM; 2012:750-759.","short":"V. Kolmogorov, S. Živný, in:, SIAM, 2012, pp. 750–759.","chicago":"Kolmogorov, Vladimir, and Stanislav Živný. “The Complexity of Conservative Valued CSPs,” 750–59. SIAM, 2012.","ieee":"V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 750–759."},"_id":"3284","status":"public","publist_id":"3362","abstract":[{"text":"We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a constraint language, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimise the sum. Under the unique games conjecture, the approximability of finite-valued VCSPs is well-understood, see Raghavendra [FOCS’08]. However, there is no characterisation of finite-valued VCSPs, let alone general-valued VCSPs, that can be solved exactly in polynomial time, thus giving insights from a combinatorial optimisation perspective.\nWe consider the case of languages containing all possible unary cost functions. In the case of languages consisting of only {0, ∞}-valued cost functions (i.e. relations), such languages have been called conservative and studied by Bulatov [LICS’03] and recently by Barto [LICS’11]. Since we study valued languages, we call a language conservative if it contains all finite-valued unary cost functions. The computational complexity of conservative valued languages has been studied by Cohen et al. [AIJ’06] for languages over Boolean domains, by Deineko et al. [JACM’08] for {0,1}-valued languages (a.k.a Max-CSP), and by Takhanov [STACS’10] for {0,∞}-valued languages containing all finite- valued unary cost functions (a.k.a. Min-Cost-Hom).\nWe prove a Schaefer-like dichotomy theorem for conservative valued languages: if all cost functions in the language satisfy a certain condition (specified by a complementary combination of STP and MJN multimorphisms), then any instance can be solved in polynomial time (via a new algorithm developed in this paper), otherwise the language is NP-hard. This is the first complete complexity classification of general-valued constraint languages over non-Boolean domains. It is a common phenomenon that complexity classifications of problems over non-Boolean domains is significantly harder than the Boolean case. The polynomial-time algorithm we present for the tractable cases is a generalisation of the submodular minimisation problem and a result of Cohen et al. [TCS’08].\nOur results generalise previous results by Takhanov [STACS’10] and (a subset of results) by Cohen et al. [AIJ’06] and Deineko et al. [JACM’08]. Moreover, our results do not rely on any computer-assisted search as in Deineko et al. [JACM’08], and provide a powerful tool for proving hardness of finite-valued and general-valued languages.","lang":"eng"}],"date_created":"2018-12-11T12:02:27Z","page":"750 - 759","main_file_link":[{"url":"http://arxiv.org/abs/1008.1555","open_access":"1"}],"year":"2012","conference":{"name":"SODA: Symposium on Discrete Algorithms"},"publisher":"SIAM","title":"The complexity of conservative valued CSPs","date_published":"2012-01-01T00:00:00Z","quality_controlled":0},{"department":[{"_id":"JoBo"}],"date_updated":"2021-01-12T07:42:25Z","oa_version":"Submitted Version","author":[{"last_name":"Pereira","full_name":"Pereira, Anna","first_name":"Anna"},{"first_name":"Flávia","full_name":"Leite, Flávia","id":"36705F98-F248-11E8-B48F-1D18A9856A87","last_name":"Leite"},{"last_name":"Brasil","full_name":"Brasil, Bruno","first_name":"Bruno"},{"first_name":"Jamaria","full_name":"Soares Martins, Jamaria","last_name":"Soares Martins"},{"last_name":"Torres","first_name":"Alice","full_name":"Torres, Alice"},{"last_name":"Pimenta","full_name":"Pimenta, Paulo","first_name":"Paulo"},{"last_name":"Souto Padrón","full_name":"Souto Padrón, Thais","first_name":"Thais"},{"last_name":"Tranktman","full_name":"Tranktman, Paula","first_name":"Paula"},{"last_name":"Ferreira","full_name":"Ferreira, Paulo","first_name":"Paulo"},{"last_name":"Kroon","full_name":"Kroon, Erna","first_name":"Erna"},{"full_name":"Bonjardim, Cláudio","first_name":"Cláudio","last_name":"Bonjardim"}],"oa":1,"citation":{"chicago":"Pereira, Anna, Flávia Leite, Bruno Brasil, Jamaria Soares Martins, Alice Torres, Paulo Pimenta, Thais Souto Padrón, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” <i>Journal of Virology</i>. ASM, 2012. <a href=\"https://doi.org/10.1128/JVI.05638-11\">https://doi.org/10.1128/JVI.05638-11</a>.","short":"A. Pereira, F. Leite, B. Brasil, J. Soares Martins, A. Torres, P. Pimenta, T. Souto Padrón, P. Tranktman, P. Ferreira, E. Kroon, C. Bonjardim, Journal of Virology 86 (2012) 172–184.","ama":"Pereira A, Leite F, Brasil B, et al. A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. <i>Journal of Virology</i>. 2012;86(1):172-184. doi:<a href=\"https://doi.org/10.1128/JVI.05638-11\">10.1128/JVI.05638-11</a>","ieee":"A. Pereira <i>et al.</i>, “A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization,” <i>Journal of Virology</i>, vol. 86, no. 1. ASM, pp. 172–184, 2012.","mla":"Pereira, Anna, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” <i>Journal of Virology</i>, vol. 86, no. 1, ASM, 2012, pp. 172–84, doi:<a href=\"https://doi.org/10.1128/JVI.05638-11\">10.1128/JVI.05638-11</a>.","apa":"Pereira, A., Leite, F., Brasil, B., Soares Martins, J., Torres, A., Pimenta, P., … Bonjardim, C. (2012). A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. <i>Journal of Virology</i>. ASM. <a href=\"https://doi.org/10.1128/JVI.05638-11\">https://doi.org/10.1128/JVI.05638-11</a>","ista":"Pereira A, Leite F, Brasil B, Soares Martins J, Torres A, Pimenta P, Souto Padrón T, Tranktman P, Ferreira P, Kroon E, Bonjardim C. 2012. A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. Journal of Virology. 86(1), 172–184."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"journal_article","external_id":{"pmid":["22031940"]},"scopus_import":1,"_id":"3289","year":"2012","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3255887/"}],"volume":86,"publication":"Journal of Virology","date_created":"2018-12-11T12:02:29Z","date_published":"2012-01-01T00:00:00Z","title":"A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization","quality_controlled":"1","publication_status":"published","acknowledgement":"This work was supported by grants from Fundação de Amparo a Pesquisa do Estado de Minas Gerais (FAPEMIG), the Brazilian Federal Agency for Support and Evaluation of Graduate Education (CAPES), and the National Council for Scientific and Technological Development (CNPq). A.C.T.C.P., B.S.A.F.B., F.G.G.L., and J.A.P.S.-M. were recipients of predoctoral fellowships from CNPq. C.A.B., E.G.K., T.S.-P., P.F.P.P., and P.C.P.F. are recipients of research fellowships from CNPq. \r\n\r\n\r\nWe are grateful to Angela S. Lopes, Ilda M. V. Gama, João R. dos Santos, and Andreza A. Carvalho for their secretarial/technical assistance and to Fernanda Gambogi for help with immunofluorescence microscopy. We also thank M. C. Sogayar (Department of Biochemistry, University of São Paulo, São Paulo, Brazil), who kindly provided us with the A31 cell line, and R. Davis (Howard Hughes Medical Institute, University of Massachusetts Medical School, Worcester, MA) for the WT and JNK1/2-, MKK4-, MKK7-, and MKK4/7-KO cells. VACV WR was from C. Jungwirth (Universität Würzburg, Würzburg, Germany). The recombinant VACV vF13L-GFP and the rabbit polyclonal antibodies against viral proteins, B5R, D8L, L1R, and A36R, were from B. Moss (NIAID, Bethesda, MD). The pcDNA3-Myc-JNK2-MKK7 WT plasmid was from Eugen Kerkhoff (Universität Würzburg, Würzburg, Germany). We also thank Flávio G. da Fonseca (UFMG, Belo Horizonte, MG, Brazil) and Kathleen A. Boyle (Medical College of Wisconsin, Milwaukee, WI) for critically reading the manuscript.","day":"01","month":"01","issue":"1","abstract":[{"text":"Viral manipulation of transduction pathways associated with key cellular functions such as survival, response to microbial infection, and cytoskeleton reorganization can provide the supportive milieu for a productive infection. Here, we demonstrate that vaccinia virus (VACV) infection leads to activation of the stress-activated protein kinase (SAPK)/extracellular signal-regulated kinase (ERK) 4/7 (MKK4/7)-c-Jun N-terminal protein kinase 1/2 (JNK1/2) pathway; further, the stimulation of this pathway requires postpenetration, prereplicative events in the viral replication cycle. Although the formation of intracellular mature virus (IMV) was not affected in MKK4/7- or JNK1/2-knockout (KO) cells, we did note an accentuated deregulation of microtubule and actin network organization in infected JNK1/2-KO cells. This was followed by deregulated viral trafficking to the periphery and enhanced enveloped particle release. Furthermore, VACV infection induced alterations in the cell contractility and morphology, and cell migration was reduced in the JNK-KO cells. In addition, phosphorylation of proteins implicated with early cell contractility and cell migration, such as microtubule-associated protein 1B and paxillin, respectively, was not detected in the VACV-infected KO cells. In sum, our findings uncover a regulatory role played by the MKK4/7-JNK1/2 pathway in cytoskeleton reorganization during VACV infection.\r\n","lang":"eng"}],"publist_id":"3356","doi":"10.1128/JVI.05638-11","status":"public","pmid":1,"language":[{"iso":"eng"}],"intvolume":"        86","page":"172 - 184","publisher":"ASM"},{"abstract":[{"lang":"eng","text":"A procedure for the continuous production of Cu 2ZnSnS 4 (CZTS) nanoparticles with controlled composition is presented. CZTS nanoparticles were prepared through the reaction of the metals' amino complexes with elemental sulfur in a continuous-flow reactor at moderate temperatures (300-330 °C). High-resolution transmission electron microscopy and X-ray diffraction analysis showed the nanocrystals to have a crystallographic structure compatible with that of the kesterite. Chemical characterization of the materials showed the presence of the four elements in each individual nanocrystal. Composition control was achieved by adjusting the solution flow rate through the reactor and the proper choice of the nominal precursor concentration within the flowing solution. Single-particle analysis revealed a composition distribution within each sample, which was optimized at the highest synthesis temperatures used. "}],"doi":"10.1021/ja209688a","publist_id":"7531","issue":"3","_id":"330","status":"public","author":[{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"last_name":"Cadavid","full_name":"Cadavid, Doris","first_name":"Doris"},{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Ibáñez"},{"first_name":"Alex","full_name":"Carrete, Alex","last_name":"Carrete"},{"first_name":"Andreu","full_name":"Cabot, Andreu","last_name":"Cabot"}],"extern":"1","citation":{"ieee":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, and A. Cabot, “Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor,” <i>Journal of the American Chemical Society</i>, vol. 134, no. 3. ACS, pp. 1438–1441, 2012.","ama":"Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. <i>Journal of the American Chemical Society</i>. 2012;134(3):1438-1441. doi:<a href=\"https://doi.org/10.1021/ja209688a\">10.1021/ja209688a</a>","short":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, A. Cabot, Journal of the American Chemical Society 134 (2012) 1438–1441.","chicago":"Shavel, Alexey, Doris Cadavid, Maria Ibáñez, Alex Carrete, and Andreu Cabot. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” <i>Journal of the American Chemical Society</i>. ACS, 2012. <a href=\"https://doi.org/10.1021/ja209688a\">https://doi.org/10.1021/ja209688a</a>.","ista":"Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. 2012. Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the American Chemical Society. 134(3), 1438–1441.","mla":"Shavel, Alexey, et al. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” <i>Journal of the American Chemical Society</i>, vol. 134, no. 3, ACS, 2012, pp. 1438–41, doi:<a href=\"https://doi.org/10.1021/ja209688a\">10.1021/ja209688a</a>.","apa":"Shavel, A., Cadavid, D., Ibáñez, M., Carrete, A., &#38; Cabot, A. (2012). Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. <i>Journal of the American Chemical Society</i>. ACS. <a href=\"https://doi.org/10.1021/ja209688a\">https://doi.org/10.1021/ja209688a</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"02","date_updated":"2021-01-12T07:42:29Z","oa_version":"None","publication_status":"published","month":"01","type":"journal_article","quality_controlled":"1","title":"Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor","date_published":"2012-01-02T00:00:00Z","publisher":"ACS","article_processing_charge":"No","language":[{"iso":"eng"}],"volume":134,"publication":"Journal of the American Chemical Society","year":"2012","article_type":"original","page":"1438 - 1441","intvolume":"       134","date_created":"2018-12-11T11:45:51Z"},{"date_published":"2012-08-01T00:00:00Z","title":"A point calculus for interlevel set homology","quality_controlled":"1","ddc":["000"],"date_created":"2018-12-11T12:02:36Z","year":"2012","publication":"Pattern Recognition Letters","volume":33,"_id":"3310","file_date_updated":"2020-07-14T12:46:06Z","scopus_import":1,"pubrep_id":"542","type":"journal_article","date_updated":"2021-01-12T07:42:34Z","oa_version":"Submitted Version","file":[{"creator":"system","relation":"main_file","checksum":"d65f79775b51258a604ca5ec741297cc","file_size":280280,"date_updated":"2020-07-14T12:46:06Z","content_type":"application/pdf","file_name":"IST-2016-542-v1+1_2012-J-01-Poinculus.pdf","date_created":"2018-12-12T10:15:00Z","file_id":"5116","access_level":"open_access"}],"department":[{"_id":"HeEd"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.","mla":"Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” <i>Pattern Recognition Letters</i>, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi:<a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">10.1016/j.patrec.2011.10.007</a>.","apa":"Bendich, P., Cabello, S., &#38; Edelsbrunner, H. (2012). A point calculus for interlevel set homology. <i>Pattern Recognition Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">https://doi.org/10.1016/j.patrec.2011.10.007</a>","ama":"Bendich P, Cabello S, Edelsbrunner H. A point calculus for interlevel set homology. <i>Pattern Recognition Letters</i>. 2012;33(11):1436-1444. doi:<a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">10.1016/j.patrec.2011.10.007</a>","short":"P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012) 1436–1444.","chicago":"Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus for Interlevel Set Homology.” <i>Pattern Recognition Letters</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">https://doi.org/10.1016/j.patrec.2011.10.007</a>.","ieee":"P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” <i>Pattern Recognition Letters</i>, vol. 33, no. 11. Elsevier, pp. 1436–1444, 2012."},"has_accepted_license":"1","author":[{"last_name":"Bendich","first_name":"Paul","full_name":"Bendich, Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cabello, Sergio","first_name":"Sergio","last_name":"Cabello"},{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"}],"oa":1,"publisher":"Elsevier","intvolume":"        33","page":"1436 - 1444","language":[{"iso":"eng"}],"status":"public","issue":"11","abstract":[{"lang":"eng","text":"The theory of persistent homology opens up the possibility to reason about topological features of a space or a function quantitatively and in combinatorial terms. We refer to this new angle at a classical subject within algebraic topology as a point calculus, which we present for the family of interlevel sets of a real-valued function. Our account of the subject is expository, devoid of proofs, and written for non-experts in algebraic topology."}],"doi":"10.1016/j.patrec.2011.10.007","publist_id":"3330","month":"08","publication_status":"published","acknowledgement":"Research by the third author is partially supported by the National Science Foundation (NSF) under grant DBI-0820624.","day":"01"},{"volume":23,"language":[{"iso":"eng"}],"publication":"International Journal of Foundations of Computer Science","year":"2012","page":"609 - 625","date_created":"2018-12-11T12:02:37Z","intvolume":"        23","quality_controlled":"1","date_published":"2012-04-01T00:00:00Z","title":"Discounting and averaging in games across time scales","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publisher":"World Scientific Publishing","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar"}],"citation":{"ieee":"K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” <i>International Journal of Foundations of Computer Science</i>, vol. 23, no. 3. World Scientific Publishing, pp. 609–625, 2012.","ama":"Chatterjee K, Majumdar R. Discounting and averaging in games across time scales. <i>International Journal of Foundations of Computer Science</i>. 2012;23(3):609-625. doi:<a href=\"https://doi.org/10.1142/S0129054112400308\">10.1142/S0129054112400308</a>","short":"K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625.","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing, 2012. <a href=\"https://doi.org/10.1142/S0129054112400308\">https://doi.org/10.1142/S0129054112400308</a>.","ista":"Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 23(3), 609–625.","apa":"Chatterjee, K., &#38; Majumdar, R. (2012). Discounting and averaging in games across time scales. <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129054112400308\">https://doi.org/10.1142/S0129054112400308</a>","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” <i>International Journal of Foundations of Computer Science</i>, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:<a href=\"https://doi.org/10.1142/S0129054112400308\">10.1142/S0129054112400308</a>."},"day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T07:42:35Z","publication_status":"published","oa_version":"None","month":"04","type":"journal_article","scopus_import":1,"publist_id":"3326","abstract":[{"text":"We introduce two-level discounted and mean-payoff games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted or mean-payoff game and the lower level game is a (undiscounted) reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. For both discounted and mean-payoff two-level games, we show the existence of pure memoryless optimal strategies for both players and an ordered field property. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted or mean-payoff games can be decided in NP ∩ coNP. We also give an alternate strategy improvement algorithm to compute the value. © 2012 World Scientific Publishing Company.","lang":"eng"}],"doi":"10.1142/S0129054112400308","issue":"3","_id":"3314","status":"public"},{"status":"public","issue":"1","doi":"10.1038/nrn3125","abstract":[{"lang":"eng","text":"The physical distance between presynaptic Ca2+ channels and the Ca2+ sensors that trigger exocytosis of neurotransmitter-containing vesicles is a key determinant of the signalling properties of synapses in the nervous system. Recent functional analysis indicates that in some fast central synapses, transmitter release is triggered by a small number of Ca2+ channels that are coupled to Ca2+ sensors at the nanometre scale. Molecular analysis suggests that this tight coupling is generated by protein–protein interactions involving Ca2+ channels, Ca2+ sensors and various other synaptic proteins. Nanodomain coupling has several functional advantages, as it increases the efficacy, speed and energy efficiency of synaptic transmission."}],"publist_id":"3322","month":"01","publication_status":"published","acknowledgement":"Work of the authors was funded by grants of the Deutsche Forschungsgemeinschaft to P.J. (grants SFB 780/A5, TR 3/B10 and the Leibniz programme), a European Research Council Advanced grant to P.J. and a Swiss National Foundation fellowship to E.E.\r\nWe thank D. Tsien and E. Neher for their comments on this Review, J. Guzmán and A. Pernía-Andrade for reading earlier versions and E. Kramberger for perfect editorial support. We apologize that owing to space constraints, not all relevant papers could be cited.\r\n","day":"01","publisher":"Nature Publishing Group","intvolume":"        13","page":"7 - 21","language":[{"iso":"eng"}],"_id":"3317","file_date_updated":"2020-07-14T12:46:07Z","scopus_import":1,"pubrep_id":"820","type":"journal_article","oa_version":"Submitted Version","date_updated":"2021-01-12T07:42:36Z","file":[{"access_level":"open_access","date_created":"2018-12-12T10:12:13Z","file_id":"4931","file_name":"IST-2017-820-v1+1_17463_3_art_file_109404_ltmxbw.pdf","file_size":314246,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:07Z","relation":"main_file","checksum":"4c1c86b2f6e4e1562f5bb800b457ea9f","creator":"system"},{"file_name":"IST-2017-820-v1+2_17463_3_figure_109402_ltmwlp.pdf","file_size":1840216,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:07Z","access_level":"open_access","date_created":"2018-12-12T10:12:14Z","file_id":"4932","relation":"main_file","checksum":"bceb2efdd49d115f4dde8486bc1be3f2","creator":"system"}],"department":[{"_id":"PeJo"}],"citation":{"apa":"Eggermann, E., Bucurenciu, I., Goswami, S., &#38; Jonas, P. M. (2012). Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. <i>Nature Reviews Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nrn3125\">https://doi.org/10.1038/nrn3125</a>","mla":"Eggermann, Emmanuel, et al. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” <i>Nature Reviews Neuroscience</i>, vol. 13, no. 1, Nature Publishing Group, 2012, pp. 7–21, doi:<a href=\"https://doi.org/10.1038/nrn3125\">10.1038/nrn3125</a>.","ista":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. 2012. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. 13(1), 7–21.","ieee":"E. Eggermann, I. Bucurenciu, S. Goswami, and P. M. Jonas, “Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses,” <i>Nature Reviews Neuroscience</i>, vol. 13, no. 1. Nature Publishing Group, pp. 7–21, 2012.","chicago":"Eggermann, Emmanuel, Iancu Bucurenciu, Sarit Goswami, and Peter M Jonas. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” <i>Nature Reviews Neuroscience</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nrn3125\">https://doi.org/10.1038/nrn3125</a>.","ama":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. <i>Nature Reviews Neuroscience</i>. 2012;13(1):7-21. doi:<a href=\"https://doi.org/10.1038/nrn3125\">10.1038/nrn3125</a>","short":"E. Eggermann, I. Bucurenciu, S. Goswami, P.M. Jonas, Nature Reviews Neuroscience 13 (2012) 7–21."},"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"id":"34DACA34-E9AE-11E9-849C-D35BD8ADC20C","first_name":"Emmanuel","full_name":"Eggermann, Emmanuel","last_name":"Eggermann"},{"last_name":"Bucurenciu","full_name":"Bucurenciu, Iancu","first_name":"Iancu","id":"4BD1D872-E9AE-11E9-9EE9-8BF4597A9E2A"},{"full_name":"Goswami, Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87","first_name":"Sarit","last_name":"Goswami"},{"last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"}],"project":[{"grant_number":"JO_780/A5","name":"Synaptic Mechanisms of Neuronal Network Function","_id":"25BC64A8-B435-11E9-9278-68D0E5697425"},{"grant_number":"SFB-TR3-TP10B","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"title":"Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses","date_published":"2012-01-01T00:00:00Z","quality_controlled":"1","ddc":["570"],"date_created":"2018-12-11T12:02:38Z","year":"2012","publication":"Nature Reviews Neuroscience","volume":13},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.1510"}],"year":"2012","volume":47,"language":[{"iso":"eng"}],"publication":" Journal of Symbolic Computation","date_created":"2018-12-11T12:02:43Z","intvolume":"        47","page":"239 - 258","title":"A worst case bound for topology computation of algebraic curves","date_published":"2012-03-01T00:00:00Z","quality_controlled":"1","publisher":"Elsevier","department":[{"_id":"HeEd"}],"publication_status":"published","oa_version":"Preprint","date_updated":"2021-01-12T07:42:43Z","author":[{"full_name":"Kerber, Michael","first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299","last_name":"Kerber"},{"full_name":"Sagraloff, Michael","first_name":"Michael","last_name":"Sagraloff"}],"oa":1,"citation":{"ista":"Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves.  Journal of Symbolic Computation. 47(3), 239–258.","mla":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i> Journal of Symbolic Computation</i>, vol. 47, no. 3, Elsevier, 2012, pp. 239–58, doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>.","apa":"Kerber, M., &#38; Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. <i> Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>","ama":"Kerber M, Sagraloff M. A worst case bound for topology computation of algebraic curves. <i> Journal of Symbolic Computation</i>. 2012;47(3):239-258. doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>","short":"M. Kerber, M. Sagraloff,  Journal of Symbolic Computation 47 (2012) 239–258.","chicago":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i> Journal of Symbolic Computation</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>.","ieee":"M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” <i> Journal of Symbolic Computation</i>, vol. 47, no. 3. Elsevier, pp. 239–258, 2012."},"day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"03","type":"journal_article","issue":"3","scopus_import":1,"publist_id":"3303","abstract":[{"lang":"eng","text":"Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is isotopic to C and thus represents its topology in R2. We prove that, for a polynomial of degree n with integer coefficients bounded by 2ρ, the topology of the induced curve can be computed with  bit operations ( indicates that we omit logarithmic factors). Our analysis improves the previous best known complexity bounds by a factor of n2. The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and on the consequent amortized analysis of the critical fibers of the algebraic curve."}],"doi":"10.1016/j.jsc.2011.11.001","_id":"3331","status":"public"},{"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_published":"2012-03-22T00:00:00Z","title":"Robustness of structurally equivalent concurrent parity games","quality_controlled":"1","conference":{"name":"FoSSaCS: Foundations of Software Science and Computation Structures","start_date":"2012-03-24","location":"Tallinn, Estonia","end_date":"2012-04-01"},"year":"2012","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2009"}],"volume":7213,"date_created":"2018-12-11T12:02:46Z","external_id":{"arxiv":["1107.2009"]},"scopus_import":1,"_id":"3341","oa_version":"Preprint","date_updated":"2023-02-23T12:23:46Z","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.","ama":"Chatterjee K. Robustness of structurally equivalent concurrent parity games. In: Vol 7213. Springer; 2012:270-285. doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>","short":"K. Chatterjee, in:, Springer, 2012, pp. 270–285.","chicago":"Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,” 7213:270–85. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>.","ista":"Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.","apa":"Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>","mla":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. Vol. 7213, Springer, 2012, pp. 270–85, doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>."},"oa":1,"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"}],"type":"conference","publisher":"Springer","arxiv":1,"language":[{"iso":"eng"}],"intvolume":"      7213","page":"270 - 285","publist_id":"3284","doi":"10.1007/978-3-642-28729-9_18","abstract":[{"lang":"eng","text":"We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine a probability distribution over the successor states. We also consider the important special case of turn-based stochastic games where players make moves in turns, rather than concurrently. We study concurrent games with \\omega-regular winning conditions specified as parity objectives. The value for player 1 for a parity objective is the maximal probability with which the player can guarantee the satisfaction of the objective against all strategies of the opponent. We study the problem of continuity and robustness of the value function in concurrent and turn-based stochastic parity gameswith respect to imprecision in the transition probabilities. We present quantitative bounds on the difference of the value function (in terms of the imprecision of the transition probabilities) and show the value continuity for structurally equivalent concurrent games (two games are structurally equivalent if the support of the transition function is same and the probabilities differ). We also show robustness of optimal strategies for structurally equivalent turn-based stochastic parity games. Finally we show that the value continuity property breaks without the structurally equivalent assumption (even for Markov chains) and show that our quantitative bound is asymptotically optimal. Hence our results are tight (the assumption is both necessary and sufficient) and optimal (our quantitative bound is asymptotically optimal)."}],"status":"public","publication_status":"published","day":"22","ec_funded":1,"alternative_title":["LNCS"],"related_material":{"record":[{"id":"5382","relation":"earlier_version","status":"public"}]},"month":"03"},{"language":[{"iso":"eng"}],"intvolume":"        57","article_number":"X21.00008","publisher":"American Physical Society","acknowledgement":"This work was supported by the Center for Emergent Superconductivity, an Energy Frontier Research Center funded by the U.S. DOE, Office of Science, under Award No. DE-AC0298CH1088.","publication_status":"published","extern":"1","day":"01","alternative_title":["Bulletin of the American Physical Society"],"month":"02","issue":"1","abstract":[{"lang":"eng","text":"The goal of this work is to study the superconducting coherence length in the fluctuation regime in cuprate superconductors. In this work we present cantilever torque magnetometry measurements of micron-size BSCCO flakes patterned with arrays of nanometer scale rings or holes. Using ultrasensitive dynamic torque magnetometry, oscillations in magnetization are observed near Tc as a function of the applied magnetic flux threading the array. Special effort was made to detect the oscillations in magnetization at temperatures above Tc, where the Nernst effect and magnetization measurements suggest the possibility of pairing. To constrain the magnitude of the coherence length in the fluctuation regime, we will present the dependence of the amplitude of the h/2e period oscillations as a function of temperature and hole size."}],"status":"public","publication_identifier":{"issn":["0003-0503"]},"main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR12/Event/167014"}],"year":"2012","article_processing_charge":"No","volume":57,"publication":"APS March Meeting 2012","date_created":"2022-02-08T10:39:08Z","date_published":"2012-02-01T00:00:00Z","title":"Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc","quality_controlled":"1","conference":{"end_date":"2012-03-02","start_date":"2012-02-27","location":"Boston, MA, United States","name":"APS: American Physical Society"},"date_updated":"2022-02-08T10:48:01Z","oa_version":"Published Version","author":[{"orcid":"0000-0001-8223-8896","full_name":"Polshyn, Hryhoriy","first_name":"Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","last_name":"Polshyn"},{"last_name":"Budakian","full_name":"Budakian, Raffi","first_name":"Raffi"}],"oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"apa":"Polshyn, H., &#38; Budakian, R. (2012). Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. In <i>APS March Meeting 2012</i> (Vol. 57). Boston, MA, United States: American Physical Society.","mla":"Polshyn, Hryhoriy, and Raffi Budakian. “Cantilever Torque Magnetometry Study of Multiply Connected BSCCO Arrays near Tc.” <i>APS March Meeting 2012</i>, vol. 57, no. 1, X21.00008, American Physical Society, 2012.","ista":"Polshyn H, Budakian R. 2012. Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. APS March Meeting 2012. APS: American Physical Society, Bulletin of the American Physical Society, vol. 57, X21.00008.","chicago":"Polshyn, Hryhoriy, and Raffi Budakian. “Cantilever Torque Magnetometry Study of Multiply Connected BSCCO Arrays near Tc.” In <i>APS March Meeting 2012</i>, Vol. 57. American Physical Society, 2012.","short":"H. Polshyn, R. Budakian, in:, APS March Meeting 2012, American Physical Society, 2012.","ama":"Polshyn H, Budakian R. Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. In: <i>APS March Meeting 2012</i>. Vol 57. American Physical Society; 2012.","ieee":"H. Polshyn and R. Budakian, “Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc,” in <i>APS March Meeting 2012</i>, Boston, MA, United States, 2012, vol. 57, no. 1."},"type":"conference","_id":"10750"},{"language":[{"iso":"eng"}],"article_processing_charge":"No","publication":"Adenosine","year":"2012","page":"109-129","date_created":"2022-03-21T07:16:12Z","quality_controlled":"1","title":"The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books","date_published":"2012-07-23T00:00:00Z","edition":"1","publisher":"Springer","place":"New York","author":[{"id":"3C77F464-F248-11E8-B48F-1D18A9856A87","first_name":"Stephanie","full_name":"zur Nedden, Stephanie","last_name":"zur Nedden"},{"last_name":"Doney","full_name":"Doney, Alexander S.","first_name":"Alexander S."},{"first_name":"Bruno G.","full_name":"Frenguelli, Bruno G.","last_name":"Frenguelli"}],"day":"23","citation":{"ieee":"S. zur Nedden, A. S. Doney, and B. G. Frenguelli, “The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books,” in <i>Adenosine</i>, 1st ed., S. Masino and D. Boison, Eds. New York: Springer, 2012, pp. 109–129.","short":"S. zur Nedden, A.S. Doney, B.G. Frenguelli, in:, S. Masino, D. Boison (Eds.), Adenosine, 1st ed., Springer, New York, 2012, pp. 109–129.","ama":"zur Nedden S, Doney AS, Frenguelli BG. The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books. In: Masino S, Boison D, eds. <i>Adenosine</i>. 1st ed. New York: Springer; 2012:109-129. doi:<a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">10.1007/978-1-4614-3903-5_6</a>","chicago":"Nedden, Stephanie zur, Alexander S. Doney, and Bruno G. Frenguelli. “The Double-Edged Sword: Gaining Adenosine at the Expense of ATP. How to Balance the Books.” In <i>Adenosine</i>, edited by Susan Masino and Detlev Boison, 1st ed., 109–29. New York: Springer, 2012. <a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">https://doi.org/10.1007/978-1-4614-3903-5_6</a>.","ista":"zur Nedden S, Doney AS, Frenguelli BG. 2012.The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books. In: Adenosine. , 109–129.","mla":"zur Nedden, Stephanie, et al. “The Double-Edged Sword: Gaining Adenosine at the Expense of ATP. How to Balance the Books.” <i>Adenosine</i>, edited by Susan Masino and Detlev Boison, 1st ed., Springer, 2012, pp. 109–29, doi:<a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">10.1007/978-1-4614-3903-5_6</a>.","apa":"zur Nedden, S., Doney, A. S., &#38; Frenguelli, B. G. (2012). The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books. In S. Masino &#38; D. Boison (Eds.), <i>Adenosine</i> (1st ed., pp. 109–129). New York: Springer. <a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">https://doi.org/10.1007/978-1-4614-3903-5_6</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HaJa"}],"oa_version":"None","acknowledgement":"We are grateful to Research into Ageing/Ageing UK and The Dunhill Trust for funding SzN’s graduate studies, and to Prof Nicholas Dale for his valuable input.","date_updated":"2022-06-21T11:51:58Z","publication_status":"published","month":"07","type":"book_chapter","scopus_import":"1","abstract":[{"text":"Under physiological conditions the brain, via the purine salvage pathway, reuses the preformed purine bases hypoxanthine, derived from ATP degradation, and adenine (Ade), derived from polyamine synthesis, to restore its ATP pool. However, the massive degradation of ATP during ischemia, although providing valuable neuroprotective adenosine, results in the accumulation and loss of diffusible purine metabolites and thereby leads to a protracted reduction in the post-ischemic ATP pool size. In vivo, this may both limit the ability to deploy ATP-dependent reparative mechanisms and reduce the subsequent availability of adenosine, whilst in brain slices results in tissue with substantially lower levels of ATP than in vivo. In the present review, we describe the mechanisms by which brain tissue replenishes its ATP, how this can be improved with the clinically tolerated chemicals D-ribose and adenine, and the functional, and potential therapeutic, implications of doing so.","lang":"eng"}],"doi":"10.1007/978-1-4614-3903-5_6","editor":[{"full_name":"Masino, Susan","first_name":"Susan","last_name":"Masino"},{"first_name":"Detlev","full_name":"Boison, Detlev","last_name":"Boison"}],"publication_identifier":{"eisbn":["9781461439035"],"isbn":["9781461439028"]},"_id":"10896","status":"public"},{"quality_controlled":"1","title":"Accurate invariant checking for programs manipulating lists and arrays with infinite data","date_published":"2012-10-15T00:00:00Z","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2012-10-06","start_date":"2012-10-03","location":"Thiruvananthapuram, India"},"article_processing_charge":"No","volume":7561,"publication":"Automated Technology for Verification and Analysis","year":"2012","date_created":"2022-03-21T07:58:39Z","scopus_import":"1","_id":"10903","author":[{"last_name":"Bouajjani","full_name":"Bouajjani, Ahmed","first_name":"Ahmed"},{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","full_name":"Dragoi, Cezara","first_name":"Cezara","last_name":"Dragoi"},{"last_name":"Enea","first_name":"Constantin","full_name":"Enea, Constantin"},{"first_name":"Mihaela","full_name":"Sighireanu, Mihaela","last_name":"Sighireanu"}],"citation":{"chicago":"Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” In <i>Automated Technology for Verification and Analysis</i>, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">https://doi.org/10.1007/978-3-642-33386-6_14</a>.","short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.","ama":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. Accurate invariant checking for programs manipulating lists and arrays with infinite data. In: <i>Automated Technology for Verification and Analysis</i>. Vol 7561. LNCS. Berlin, Heidelberg: Springer; 2012:167-182. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">10.1007/978-3-642-33386-6_14</a>","ieee":"A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking for programs manipulating lists and arrays with infinite data,” in <i>Automated Technology for Verification and Analysis</i>, Thiruvananthapuram, India, 2012, vol. 7561, pp. 167–182.","mla":"Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” <i>Automated Technology for Verification and Analysis</i>, vol. 7561, Springer, 2012, pp. 167–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">10.1007/978-3-642-33386-6_14</a>.","apa":"Bouajjani, A., Dragoi, C., Enea, C., &#38; Sighireanu, M. (2012). Accurate invariant checking for programs manipulating lists and arrays with infinite data. In <i>Automated Technology for Verification and Analysis</i> (Vol. 7561, pp. 167–182). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">https://doi.org/10.1007/978-3-642-33386-6_14</a>","ista":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Accurate invariant checking for programs manipulating lists and arrays with infinite data. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and AnalysisLNCS, LNCS, vol. 7561, 167–182."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"ToHe"}],"date_updated":"2023-09-05T14:07:24Z","oa_version":"None","type":"conference","publisher":"Springer","language":[{"iso":"eng"}],"page":"167-182","intvolume":"      7561","doi":"10.1007/978-3-642-33386-6_14","abstract":[{"lang":"eng","text":"We propose a logic-based framework for automated reasoning about sequential programs manipulating singly-linked lists and arrays with unbounded data. We introduce the logic SLAD, which allows combining shape constraints, written in a fragment of Separation Logic, with data and size constraints. We address the problem of checking the entailment between SLAD formulas, which is crucial in performing pre-post condition reasoning. Although this problem is undecidable in general for SLAD, we propose a sound and powerful procedure that is able to solve this problem for a large class of formulas, beyond the capabilities of existing techniques and tools. We prove that this procedure is complete, i.e., it is actually a decision procedure for this problem, for an important fragment of SLAD including known decidable logics. We implemented this procedure and shown its preciseness and its efficiency on a significant benchmark of formulas."}],"publication_identifier":{"eisbn":["9783642333866"],"isbn":["9783642333859"],"eissn":["1611-3349"],"issn":["0302-9743"]},"status":"public","place":"Berlin, Heidelberg","series_title":"LNCS","day":"15","acknowledgement":"This work has been partially supported by the French ANR project Veridyc","publication_status":"published","month":"10","alternative_title":["LNCS"]},{"intvolume":"      7454","page":"115-131","language":[{"iso":"eng"}],"arxiv":1,"publisher":"Springer","alternative_title":["LNCS"],"month":"09","related_material":{"record":[{"status":"public","relation":"later_version","id":"2716"}]},"acknowledgement":"Author supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Start Grant (279307: Graph Games), Microsoft faculty fellowship.","publication_status":"published","place":"Berlin, Heidelberg","ec_funded":1,"day":"15","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642329395"],"eisbn":["9783642329401"]},"doi":"10.1007/978-3-642-32940-1_10","abstract":[{"text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω-regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on VASS (vector addition systems with states). Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.","lang":"eng"}],"date_created":"2022-03-21T08:00:21Z","year":"2012","article_processing_charge":"No","volume":7454,"publication":"CONCUR 2012 - Concurrency Theory","conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2012-09-04","location":"Newcastle upon Tyne, United Kingdom","end_date":"2012-09-07"},"date_published":"2012-09-15T00:00:00Z","title":"Strategy synthesis for multi-dimensional quantitative objectives","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":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","type":"conference","department":[{"_id":"KrCh"}],"oa_version":"Preprint","date_updated":"2023-02-23T10:55:06Z","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Mickael","full_name":"Randour, Mickael","last_name":"Randour"},{"first_name":"Jean-François","full_name":"Raskin, Jean-François","last_name":"Raskin"}],"citation":{"ieee":"K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in <i>CONCUR 2012 - Concurrency Theory</i>, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.","ama":"Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional quantitative objectives. In: Koutny M, Ulidowski I, eds. <i>CONCUR 2012 - Concurrency Theory</i>. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>","short":"K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” In <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>.","ista":"Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference on Concurrency Theory, LNCS, vol. 7454, 115–131.","apa":"Chatterjee, K., Randour, M., &#38; Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny &#38; I. Ulidowski (Eds.), <i>CONCUR 2012 - Concurrency Theory</i> (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>","mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10904","editor":[{"last_name":"Koutny","full_name":"Koutny, Maciej","first_name":"Maciej"},{"last_name":"Ulidowski","full_name":"Ulidowski, Irek","first_name":"Irek"}],"external_id":{"arxiv":["1201.5073"]},"scopus_import":"1"},{"type":"conference","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In <i>Algorithms – ESA 2012</i> (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithms – ESA 2012</i>, vol. 7501, Springer, 2012, pp. 301–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>.","ista":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. Algorithms – ESA 2012. ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in <i>Algorithms – ESA 2012</i>, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” In <i>Algorithms – ESA 2012</i>, 7501:301–12. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>.","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms – ESA 2012, Springer, 2012, pp. 301–312.","ama":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. In: <i>Algorithms – ESA 2012</i>. Vol 7501. Springer; 2012:301-312. doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>"},"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Sebastian","full_name":"Krinninger, Sebastian","last_name":"Krinninger"},{"last_name":"Nanongkai","full_name":"Nanongkai, Danupon","first_name":"Danupon"}],"oa":1,"date_updated":"2023-09-05T14:09:30Z","oa_version":"Preprint","department":[{"_id":"KrCh"}],"_id":"10905","scopus_import":"1","external_id":{"arxiv":["1604.08234"]},"date_created":"2022-03-21T08:01:45Z","publication":"Algorithms – ESA 2012","volume":7501,"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08234"}],"year":"2012","conference":{"location":"Ljubljana, Slovenia","start_date":"2012-09-10","end_date":"2012-09-12","name":"ESA: European Symposium on Algorithms"},"quality_controlled":"1","project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_published":"2012-10-01T00:00:00Z","title":"Polynomial-time algorithms for energy games with special weight structures","related_material":{"record":[{"status":"public","relation":"later_version","id":"535"}]},"month":"10","alternative_title":["LNCS"],"day":"01","ec_funded":1,"publication_status":"published","acknowledgement":"Supported by the Austrian Science Fund (FWF): P23499-N23, the Austrian Science Fund (FWF): S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award","publication_identifier":{"eisbn":["9783642330902"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642330896"]},"status":"public","doi":"10.1007/978-3-642-33090-2_27","abstract":[{"text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While the existence of polynomial-time algorithms has been a major open problem for decades, there is no algorithm that solves any non-trivial subclass in polynomial time.\r\nIn this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several counter examples that show that many previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting graph structures need not help.","lang":"eng"}],"page":"301-312","intvolume":"      7501","arxiv":1,"language":[{"iso":"eng"}],"publisher":"Springer"},{"date_published":"2012-04-01T00:00:00Z","title":"HSF(C): A software verifier based on Horn clauses","quality_controlled":"1","conference":{"end_date":"2012-04-01","start_date":"2012-03-24","location":"Tallinn, Estonia","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"main_file_link":[{"url":"https://doi.org/10.1007/978-3-642-28756-5_46","open_access":"1"}],"year":"2012","publication":"Tools and Algorithms for the Construction and Analysis of Systems","volume":7214,"article_processing_charge":"No","date_created":"2022-03-21T08:03:30Z","scopus_import":"1","_id":"10906","editor":[{"full_name":"Flanagan, Cormac","first_name":"Cormac","last_name":"Flanagan"},{"full_name":"König, Barbara","first_name":"Barbara","last_name":"König"}],"oa_version":"Published Version","date_updated":"2023-09-05T14:09:54Z","department":[{"_id":"ToHe"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.","ama":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software verifier based on Horn clauses. In: Flanagan C, König B, eds. <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 7214. LNCS. Berlin, Heidelberg: Springer; 2012:549-551. doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>","chicago":"Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>.","ieee":"S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.","ista":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.","apa":"Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., &#38; Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &#38; B. König (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>","mla":"Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>."},"oa":1,"author":[{"full_name":"Grebenshchikov, Sergey","first_name":"Sergey","last_name":"Grebenshchikov"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","full_name":"Gupta, Ashutosh","last_name":"Gupta"},{"last_name":"Lopes","full_name":"Lopes, Nuno P.","first_name":"Nuno P."},{"last_name":"Popeea","first_name":"Corneliu","full_name":"Popeea, Corneliu"},{"full_name":"Rybalchenko, Andrey","first_name":"Andrey","last_name":"Rybalchenko"}],"type":"conference","publisher":"Springer","language":[{"iso":"eng"}],"intvolume":"      7214","page":"549-551","doi":"10.1007/978-3-642-28756-5_46","abstract":[{"lang":"eng","text":"HSF(C) is a tool that automates verification of safety and liveness properties for C programs. This paper describes the verification approach taken by HSF(C) and provides instructions on how to install and use the tool."}],"status":"public","publication_identifier":{"eisbn":["9783642287565"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642287558"]},"publication_status":"published","day":"01","place":"Berlin, Heidelberg","series_title":"LNCS","alternative_title":["LNCS"],"month":"04"}]