[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3400","oa_version":"Submitted Version","month":"01","ddc":["000"],"date_updated":"2021-01-12T07:42:10Z","publication_status":"published","oa":1,"conference":{"name":"MEMICS: Mathematical and Engineering Methods in Computer Science","start_date":"2011-10-14","end_date":"2011-10-16","location":"Lednice, Czech Republic"},"alternative_title":["LNCS"],"has_accepted_license":"1","page":"37 - 46","_id":"3255","intvolume":"      7119","doi":"10.1007/978-3-642-25929-6_3","department":[{"_id":"KrCh"}],"acknowledgement":"This work was partially supported by FWF NFN Grant S11407-N23 (RiSE) and a Microsoft faculty fellowship.","quality_controlled":"1","citation":{"ieee":"K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol. 7119, pp. 37–46.","ista":"Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119, 37–46.","ama":"Chatterjee K, Doyen L. Games and Markov decision processes with mean payoff parity and energy parity objectives. In: Vol 7119. Springer; 2012:37-46. doi:<a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">10.1007/978-3-642-25929-6_3</a>","short":"K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives,” 7119:37–46. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">https://doi.org/10.1007/978-3-642-25929-6_3</a>.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives</i>. Vol. 7119, Springer, 2012, pp. 37–46, doi:<a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">10.1007/978-3-642-25929-6_3</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">https://doi.org/10.1007/978-3-642-25929-6_3</a>"},"article_processing_charge":"No","type":"conference","status":"public","title":"Games and Markov decision processes with mean payoff parity and energy parity objectives","day":"01","language":[{"iso":"eng"}],"year":"2012","file_date_updated":"2020-07-14T12:46:05Z","abstract":[{"lang":"eng","text":"In this paper we survey results of two-player games on graphs and Markov decision processes with parity, mean-payoff and energy objectives, and the combination of mean-payoff and energy objectives with parity objectives. These problems have applications in verification and synthesis of reactive systems in resource-constrained environments."}],"volume":7119,"date_published":"2012-01-01T00:00:00Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"}],"date_created":"2018-12-11T12:02:17Z","file":[{"date_created":"2020-05-15T12:53:12Z","creator":"dernst","relation":"main_file","checksum":"eed2cc1e76b160418c977e76e8899a60","file_id":"7863","file_name":"2012_MEMICS_Chatterjee.pdf","file_size":114060,"access_level":"open_access","date_updated":"2020-07-14T12:46:05Z","content_type":"application/pdf"}],"publisher":"Springer","scopus_import":1},{"citation":{"chicago":"Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00454-011-9382-4\">https://doi.org/10.1007/s00454-011-9382-4</a>.","ama":"Edelsbrunner H, Kerber M. Dual complexes of cubical subdivisions of ℝn. <i>Discrete &#38; Computational Geometry</i>. 2012;47(2):393-414. doi:<a href=\"https://doi.org/10.1007/s00454-011-9382-4\">10.1007/s00454-011-9382-4</a>","short":"H. Edelsbrunner, M. Kerber, Discrete &#38; Computational Geometry 47 (2012) 393–414.","mla":"Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” <i>Discrete &#38; Computational Geometry</i>, vol. 47, no. 2, Springer, 2012, pp. 393–414, doi:<a href=\"https://doi.org/10.1007/s00454-011-9382-4\">10.1007/s00454-011-9382-4</a>.","apa":"Edelsbrunner, H., &#38; Kerber, M. (2012). Dual complexes of cubical subdivisions of ℝn. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-011-9382-4\">https://doi.org/10.1007/s00454-011-9382-4</a>","ieee":"H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of ℝn,” <i>Discrete &#38; Computational Geometry</i>, vol. 47, no. 2. Springer, pp. 393–414, 2012.","ista":"Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of ℝn. Discrete &#38; Computational Geometry. 47(2), 393–414."},"title":"Dual complexes of cubical subdivisions of ℝn","pubrep_id":"543","type":"journal_article","status":"public","doi":"10.1007/s00454-011-9382-4","intvolume":"        47","_id":"3256","page":"393 - 414","quality_controlled":"1","acknowledgement":"This research is partially supported by the Defense Advanced Research Projects Agency (DARPA) under grants HR0011-05-1-0057 and HR0011-09-0065 as well as the National Science Foundation (NSF) under grant DBI-0820624.","department":[{"_id":"HeEd"}],"has_accepted_license":"1","oa_version":"Submitted Version","month":"03","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3398","publication_status":"published","oa":1,"ddc":["000"],"date_updated":"2021-01-12T07:42:10Z","file":[{"file_id":"4675","date_created":"2018-12-12T10:08:15Z","creator":"system","checksum":"76486f3b2c9e7fd81342f3832ca387e7","relation":"main_file","date_updated":"2020-07-14T12:46:05Z","content_type":"application/pdf","file_name":"IST-2016-543-v1+1_2012-J-08-HierarchyCubeComplex.pdf","access_level":"open_access","file_size":203636}],"publisher":"Springer","scopus_import":1,"date_created":"2018-12-11T12:02:17Z","file_date_updated":"2020-07-14T12:46:05Z","issue":"2","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Michael","last_name":"Kerber","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael"}],"date_published":"2012-03-01T00:00:00Z","abstract":[{"lang":"eng","text":"We use a distortion to define the dual complex of a cubical subdivision of ℝ n as an n-dimensional subcomplex of the nerve of the set of n-cubes. Motivated by the topological analysis of high-dimensional digital image data, we consider such subdivisions defined by generalizations of quad- and oct-trees to n dimensions. Assuming the subdivision is balanced, we show that mapping each vertex to the center of the corresponding n-cube gives a geometric realization of the dual complex in ℝ n."}],"volume":47,"publication":"Discrete & Computational Geometry","language":[{"iso":"eng"}],"year":"2012","day":"01"},{"arxiv":1,"publication_status":"published","oa":1,"date_updated":"2023-02-23T11:04:49Z","oa_version":"Preprint","month":"03","related_material":{"record":[{"relation":"earlier_version","id":"2934","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3397","title":"Generalized roof duality and bisubmodular functions","status":"public","type":"journal_article","citation":{"mla":"Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” <i>Discrete Applied Mathematics</i>, vol. 160, no. 4–5, Elsevier, 2012, pp. 416–26, doi:<a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">10.1016/j.dam.2011.10.026</a>.","apa":"Kolmogorov, V. (2012). Generalized roof duality and bisubmodular functions. <i>Discrete Applied Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">https://doi.org/10.1016/j.dam.2011.10.026</a>","ama":"Kolmogorov V. Generalized roof duality and bisubmodular functions. <i>Discrete Applied Mathematics</i>. 2012;160(4-5):416-426. doi:<a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">10.1016/j.dam.2011.10.026</a>","short":"V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 416–426.","chicago":"Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” <i>Discrete Applied Mathematics</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">https://doi.org/10.1016/j.dam.2011.10.026</a>.","ista":"Kolmogorov V. 2012. Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. 160(4–5), 416–426.","ieee":"V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” <i>Discrete Applied Mathematics</i>, vol. 160, no. 4–5. Elsevier, pp. 416–426, 2012."},"quality_controlled":"1","department":[{"_id":"VlKo"}],"doi":"10.1016/j.dam.2011.10.026","external_id":{"arxiv":["1005.2305"]},"_id":"3257","page":"416 - 426","intvolume":"       160","author":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"}],"volume":160,"abstract":[{"lang":"eng","text":"Consider a convex relaxation f̂ of a pseudo-Boolean function f. We say that the relaxation is totally half-integral if f̂(x) is a polyhedral function with half-integral extreme points x, and this property is preserved after adding an arbitrary combination of constraints of the form x i=x j, x i=1-x j, and x i=γ where γ∈{0,1,1/2} is a constant. A well-known example is the roof duality relaxation for quadratic pseudo-Boolean functions f. We argue that total half-integrality is a natural requirement for generalizations of roof duality to arbitrary pseudo-Boolean functions. Our contributions are as follows. First, we provide a complete characterization of totally half-integral relaxations f̂ by establishing a one-to-one correspondence with bisubmodular functions. Second, we give a new characterization of bisubmodular functions. Finally, we show some relationships between general totally half-integral relaxations and relaxations based on the roof duality. On the conceptual level, our results show that bisubmodular functions provide a natural generalization of the roof duality approach to higher-order terms. This can be viewed as a non-submodular analogue of the fact that submodular functions generalize the s-t minimum cut problem with non-negative weights to higher-order terms."}],"date_published":"2012-03-01T00:00:00Z","issue":"4-5","publication":"Discrete Applied Mathematics","day":"01","language":[{"iso":"eng"}],"year":"2012","scopus_import":1,"publisher":"Elsevier","main_file_link":[{"url":"http://arxiv.org/abs/1005.2305","open_access":"1"}],"date_created":"2018-12-11T12:02:18Z"},{"publication_status":"published","oa":1,"publication_identifier":{"issn":["1546-1726"]},"date_updated":"2023-09-07T11:43:52Z","oa_version":"Published Version","month":"04","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publist_id":"3390","related_material":{"record":[{"relation":"dissertation_contains","id":"2964","status":"public"}]},"quality_controlled":"1","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (TR 3/B10) and the European Union (European Research Council Advanced grant to P.J.).","department":[{"_id":"PeJo"}],"external_id":{"pmid":["22388958"]},"doi":"10.1038/nn.3060","intvolume":"        15","_id":"3258","page":"600 - 606","title":"Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons","status":"public","type":"journal_article","citation":{"ista":"Kim S, Guzmán J, Hu H, Jonas PM. 2012. Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. Nature Neuroscience. 15(4), 600–606.","ieee":"S. Kim, J. Guzmán, H. Hu, and P. M. Jonas, “Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons,” <i>Nature Neuroscience</i>, vol. 15, no. 4. Nature Publishing Group, pp. 600–606, 2012.","short":"S. Kim, J. Guzmán, H. Hu, P.M. Jonas, Nature Neuroscience 15 (2012) 600–606.","chicago":"Kim, Sooyun, José Guzmán, Hua Hu, and Peter M Jonas. “Active Dendrites Support Efficient Initiation of Dendritic Spikes in Hippocampal CA3 Pyramidal Neurons.” <i>Nature Neuroscience</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nn.3060\">https://doi.org/10.1038/nn.3060</a>.","ama":"Kim S, Guzmán J, Hu H, Jonas PM. Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. <i>Nature Neuroscience</i>. 2012;15(4):600-606. doi:<a href=\"https://doi.org/10.1038/nn.3060\">10.1038/nn.3060</a>","apa":"Kim, S., Guzmán, J., Hu, H., &#38; Jonas, P. M. (2012). Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. <i>Nature Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nn.3060\">https://doi.org/10.1038/nn.3060</a>","mla":"Kim, Sooyun, et al. “Active Dendrites Support Efficient Initiation of Dendritic Spikes in Hippocampal CA3 Pyramidal Neurons.” <i>Nature Neuroscience</i>, vol. 15, no. 4, Nature Publishing Group, 2012, pp. 600–06, doi:<a href=\"https://doi.org/10.1038/nn.3060\">10.1038/nn.3060</a>."},"article_processing_charge":"No","publication":"Nature Neuroscience","year":"2012","language":[{"iso":"eng"}],"day":"01","author":[{"id":"394AB1C8-F248-11E8-B48F-1D18A9856A87","full_name":"Kim, Sooyun","first_name":"Sooyun","last_name":"Kim"},{"id":"30CC5506-F248-11E8-B48F-1D18A9856A87","full_name":"Guzmán, José","first_name":"José","last_name":"Guzmán","orcid":"0000-0003-2209-5242"},{"first_name":"Hua","last_name":"Hu","full_name":"Hu, Hua","id":"4AC0145C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804"}],"date_published":"2012-04-01T00:00:00Z","abstract":[{"text":"CA3 pyramidal neurons are important for memory formation and pattern completion in the hippocampal network. It is generally thought that proximal synapses from the mossy fibers activate these neurons most efficiently, whereas distal inputs from the perforant path have a weaker modulatory influence. We used confocally targeted patch-clamp recording from dendrites and axons to map the activation of rat CA3 pyramidal neurons at the subcellular level. Our results reveal two distinct dendritic domains. In the proximal domain, action potentials initiated in the axon backpropagate actively with large amplitude and fast time course. In the distal domain, Na+ channel–mediated dendritic spikes are efficiently initiated by waveforms mimicking synaptic events. CA3 pyramidal neuron dendrites showed a high Na+-to-K+ conductance density ratio, providing ideal conditions for active backpropagation and dendritic spike initiation. Dendritic spikes may enhance the computational power of CA3 pyramidal neurons in the hippocampal network.","lang":"eng"}],"volume":15,"issue":"4","article_type":"original","date_created":"2018-12-11T12:02:18Z","project":[{"grant_number":"SFB-TR3-TP10B","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3617474/"}],"pmid":1,"publisher":"Nature Publishing Group"},{"ec_funded":1,"year":"2012","language":[{"iso":"eng"}],"day":"01","publication":"Theoretical Population Biology","date_published":"2012-02-01T00:00:00Z","volume":81,"abstract":[{"text":"Many scenarios in the living world, where individual organisms compete for winning positions (or resources), have properties of auctions. Here we study the evolution of bids in biological auctions. For each auction, n individuals are drawn at random from a population of size N. Each individual makes a bid which entails a cost. The winner obtains a benefit of a certain value. Costs and benefits are translated into reproductive success (fitness). Therefore, successful bidding strategies spread in the population. We compare two types of auctions. In “biological all-pay auctions”, the costs are the bid for every participating individual. In “biological second price all-pay auctions”, the cost for everyone other than the winner is the bid, but the cost for the winner is the second highest bid. Second price all-pay auctions are generalizations of the “war of attrition” introduced by Maynard Smith. We study evolutionary dynamics in both types of auctions. We calculate pairwise invasion plots and evolutionarily stable distributions over the continuous strategy space. We find that the average bid in second price all-pay auctions is higher than in all-pay auctions, but the average cost for the winner is similar in both auctions. In both cases, the average bid is a declining function of the number of participants, n. The more individuals participate in an auction the smaller is the chance of winning, and thus expensive bids must be avoided.\r\n","lang":"eng"}],"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353","last_name":"Reiter","first_name":"Johannes"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"issue":"1","project":[{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T12:02:19Z","scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3279759/ ","open_access":"1"}],"pmid":1,"publisher":"Academic Press","date_updated":"2023-09-07T11:40:43Z","publication_status":"published","oa":1,"publist_id":"3388","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"1400","relation":"dissertation_contains"}]},"oa_version":"Submitted Version","month":"02","department":[{"_id":"KrCh"}],"quality_controlled":"1","intvolume":"        81","page":"69 - 80","_id":"3260","external_id":{"pmid":["22120126"]},"doi":"10.1016/j.tpb.2011.11.003","type":"journal_article","status":"public","title":"Evolutionary dynamics of biological auctions","citation":{"apa":"Chatterjee, K., Reiter, J., &#38; Nowak, M. (2012). Evolutionary dynamics of biological auctions. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">https://doi.org/10.1016/j.tpb.2011.11.003</a>","mla":"Chatterjee, Krishnendu, et al. “Evolutionary Dynamics of Biological Auctions.” <i>Theoretical Population Biology</i>, vol. 81, no. 1, Academic Press, 2012, pp. 69–80, doi:<a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">10.1016/j.tpb.2011.11.003</a>.","chicago":"Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary Dynamics of Biological Auctions.” <i>Theoretical Population Biology</i>. Academic Press, 2012. <a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">https://doi.org/10.1016/j.tpb.2011.11.003</a>.","short":"K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012) 69–80.","ama":"Chatterjee K, Reiter J, Nowak M. Evolutionary dynamics of biological auctions. <i>Theoretical Population Biology</i>. 2012;81(1):69-80. doi:<a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">10.1016/j.tpb.2011.11.003</a>","ista":"Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 69–80.","ieee":"K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological auctions,” <i>Theoretical Population Biology</i>, vol. 81, no. 1. Academic Press, pp. 69–80, 2012."}},{"publication":" Physical Review E statistical nonlinear and soft matter physics ","day":"01","year":"2012","language":[{"iso":"eng"}],"author":[{"full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","last_name":"Tkacik","orcid":"0000-0002-6699-1455"},{"last_name":"Walczak","first_name":"Aleksandra","full_name":"Walczak, Aleksandra"},{"full_name":"Bialek, William","last_name":"Bialek","first_name":"William"}],"volume":85,"abstract":[{"lang":"eng","text":"Living cells must control the reading out or &quot;expression&quot; of information encoded in their genomes, and this regulation often is mediated by transcription factors--proteins that bind to DNA and either enhance or repress the expression of nearby genes. But the expression of transcription factor proteins is itself regulated, and many transcription factors regulate their own expression in addition to responding to other input signals. Here we analyze the simplest of such self-regulatory circuits, asking how parameters can be chosen to optimize information transmission from inputs to outputs in the steady state. Some nonzero level of self-regulation is almost always optimal, with self-activation dominant when transcription factor concentrations are low and self-repression dominant when concentrations are high. In steady state the optimal self-activation is never strong enough to induce bistability, although there is a limit in which the optimal parameters are very close to the critical point."}],"date_published":"2012-04-01T00:00:00Z","issue":"4","date_created":"2018-12-11T12:02:20Z","scopus_import":1,"publisher":"American Institute of Physics","main_file_link":[{"url":"http://arxiv.org/abs/1112.5026","open_access":"1"}],"publication_status":"published","oa":1,"date_updated":"2021-01-12T07:42:14Z","oa_version":"Preprint","month":"04","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3386","article_number":"041903","acknowledgement":"We thank T. Gregor, E. F. Wieschaus, and, especially, C. G. Callan for helpful discussions.\r\nWork at Princeton was supported in part by NSF Grants No. PHY–0957573 and No. CCF–0939370, by NIH Grant No. R01 GM077599, and by the W. M. Keck Foundation. For part of this work, G.T. was supported in part by NSF Grant No. EF–0928048 and by the Vice Provost for Research at the University of Pennsylvania.","quality_controlled":"1","department":[{"_id":"GaTk"}],"doi":"10.1103/PhysRevE.85.041903","_id":"3262","intvolume":"        85","title":"Optimizing information flow in small genetic networks. III. A self-interacting gene","status":"public","type":"journal_article","citation":{"apa":"Tkačik, G., Walczak, A., &#38; Bialek, W. (2012). Optimizing information flow in small genetic networks. III. A self-interacting gene. <i> Physical Review E Statistical Nonlinear and Soft Matter Physics </i>. American Institute of Physics. <a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">https://doi.org/10.1103/PhysRevE.85.041903</a>","mla":"Tkačik, Gašper, et al. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” <i> Physical Review E Statistical Nonlinear and Soft Matter Physics </i>, vol. 85, no. 4, 041903, American Institute of Physics, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">10.1103/PhysRevE.85.041903</a>.","ama":"Tkačik G, Walczak A, Bialek W. Optimizing information flow in small genetic networks. III. A self-interacting gene. <i> Physical Review E statistical nonlinear and soft matter physics </i>. 2012;85(4). doi:<a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">10.1103/PhysRevE.85.041903</a>","chicago":"Tkačik, Gašper, Aleksandra Walczak, and William Bialek. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” <i> Physical Review E Statistical Nonlinear and Soft Matter Physics </i>. American Institute of Physics, 2012. <a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">https://doi.org/10.1103/PhysRevE.85.041903</a>.","short":"G. Tkačik, A. Walczak, W. Bialek,  Physical Review E Statistical Nonlinear and Soft Matter Physics  85 (2012).","ieee":"G. Tkačik, A. Walczak, and W. Bialek, “Optimizing information flow in small genetic networks. III. A self-interacting gene,” <i> Physical Review E statistical nonlinear and soft matter physics </i>, vol. 85, no. 4. American Institute of Physics, 2012.","ista":"Tkačik G, Walczak A, Bialek W. 2012. Optimizing information flow in small genetic networks. III. A self-interacting gene.  Physical Review E statistical nonlinear and soft matter physics . 85(4), 041903."}},{"project":[{"call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography"}],"date_created":"2018-12-11T12:02:26Z","main_file_link":[{"open_access":"1","url":"http://www.iacr.org/archive/tcc2012/71940166/71940166.pdf"}],"publisher":"Springer","ec_funded":1,"year":"2012","language":[{"iso":"eng"}],"day":"04","author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"date_published":"2012-05-04T00:00:00Z","volume":7194,"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"}],"quality_controlled":"1","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC).","department":[{"_id":"KrPi"}],"doi":"10.1007/978-3-642-28914-9_31","intvolume":"      7194","_id":"3280","page":"548 - 563","title":"Subspace LWE","type":"conference","status":"public","citation":{"ista":"Pietrzak KZ. 2012. Subspace LWE. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 548–563.","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>.","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>.","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>"},"conference":{"location":"Taormina, Sicily, Italy","start_date":"2012-03-19","name":"TCC: Theory of Cryptography Conference","end_date":"2012-03-21"},"publication_status":"published","oa":1,"date_updated":"2021-01-12T07:42:21Z","month":"05","oa_version":"Submitted Version","publist_id":"3366","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"]},{"file_date_updated":"2020-07-14T12:46:06Z","author":[{"first_name":"Yevgeniy","last_name":"Dodis","full_name":"Dodis, Yevgeniy"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"full_name":"Wichs, Daniel","first_name":"Daniel","last_name":"Wichs"}],"date_published":"2012-03-10T00:00:00Z","abstract":[{"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.","lang":"eng"}],"volume":7237,"language":[{"iso":"eng"}],"year":"2012","day":"10","ec_funded":1,"file":[{"date_updated":"2020-07-14T12:46:06Z","content_type":"application/pdf","file_name":"IST-2016-686-v1+1_059.pdf","access_level":"open_access","file_size":372292,"file_id":"5074","date_created":"2018-12-12T10:14:23Z","creator":"system","checksum":"8557c17a8c2586d06ebfe62d934f5c5f","relation":"main_file"}],"publisher":"Springer","date_created":"2018-12-11T12:02:27Z","project":[{"call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","alternative_title":["LNCS"],"oa_version":"Submitted Version","month":"03","publist_id":"3364","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Cambridge, UK","end_date":"2012-04-19","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","start_date":"2012-04-15"},"oa":1,"publication_status":"published","date_updated":"2021-01-12T07:42:22Z","ddc":["000","004"],"citation":{"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.","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.","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>.","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>","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>.","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."},"title":"Message authentication, revisited","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"pubrep_id":"686","status":"public","type":"conference","doi":"10.1007/978-3-642-29011-4_22","intvolume":"      7237","_id":"3282","license":"https://creativecommons.org/licenses/by/4.0/","page":"355 - 374","quality_controlled":"1","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","department":[{"_id":"KrPi"}]},{"acknowledgement":"Vladimir Kolmogorov is supported by the Royal Academy of Eng ineering/EPSRC.","quality_controlled":0,"date_created":"2018-12-11T12:02:27Z","_id":"3284","page":"750 - 759","title":"The complexity of conservative valued CSPs","status":"public","type":"conference","publisher":"SIAM","extern":1,"citation":{"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.","chicago":"Kolmogorov, Vladimir, and Stanislav Živný. “The Complexity of Conservative Valued CSPs,” 750–59. SIAM, 2012.","short":"V. Kolmogorov, S. Živný, in:, SIAM, 2012, pp. 750–759.","ama":"Kolmogorov V, Živný S. The complexity of conservative valued CSPs. In: SIAM; 2012:750-759.","ieee":"V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 750–759.","ista":"Kolmogorov V, Živný S. 2012. The complexity of conservative valued CSPs. SODA: Symposium on Discrete Algorithms, 750–759."},"main_file_link":[{"url":"http://arxiv.org/abs/1008.1555","open_access":"1"}],"publication_status":"published","oa":1,"conference":{"name":"SODA: Symposium on Discrete Algorithms"},"date_updated":"2021-01-12T07:42:23Z","month":"01","publist_id":"3362","day":"01","year":"2012","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","first_name":"Vladimir","last_name":"Kolmogorov"},{"last_name":"Živný","first_name":"Stanislav","full_name":"Živný, Stanislav"}],"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_published":"2012-01-01T00:00:00Z"},{"publication":"Journal of Virology","day":"01","year":"2012","language":[{"iso":"eng"}],"author":[{"full_name":"Pereira, Anna","last_name":"Pereira","first_name":"Anna"},{"last_name":"Leite","first_name":"Flávia","id":"36705F98-F248-11E8-B48F-1D18A9856A87","full_name":"Leite, Flávia"},{"last_name":"Brasil","first_name":"Bruno","full_name":"Brasil, Bruno"},{"full_name":"Soares Martins, Jamaria","last_name":"Soares Martins","first_name":"Jamaria"},{"full_name":"Torres, Alice","first_name":"Alice","last_name":"Torres"},{"first_name":"Paulo","last_name":"Pimenta","full_name":"Pimenta, Paulo"},{"last_name":"Souto Padrón","first_name":"Thais","full_name":"Souto Padrón, Thais"},{"first_name":"Paula","last_name":"Tranktman","full_name":"Tranktman, Paula"},{"full_name":"Ferreira, Paulo","first_name":"Paulo","last_name":"Ferreira"},{"first_name":"Erna","last_name":"Kroon","full_name":"Kroon, Erna"},{"last_name":"Bonjardim","first_name":"Cláudio","full_name":"Bonjardim, Cláudio"}],"abstract":[{"lang":"eng","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"}],"volume":86,"date_published":"2012-01-01T00:00:00Z","issue":"1","date_created":"2018-12-11T12:02:29Z","scopus_import":1,"publisher":"ASM","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3255887/","open_access":"1"}],"pmid":1,"publication_status":"published","oa":1,"date_updated":"2021-01-12T07:42:25Z","oa_version":"Submitted Version","month":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3356","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.","quality_controlled":"1","department":[{"_id":"JoBo"}],"doi":"10.1128/JVI.05638-11","external_id":{"pmid":["22031940"]},"_id":"3289","page":"172 - 184","intvolume":"        86","title":"A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization","status":"public","type":"journal_article","citation":{"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.","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.","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>","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>.","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>","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>."}},{"scopus_import":1,"file":[{"file_id":"5116","checksum":"d65f79775b51258a604ca5ec741297cc","relation":"main_file","creator":"system","date_created":"2018-12-12T10:15:00Z","content_type":"application/pdf","date_updated":"2020-07-14T12:46:06Z","file_size":280280,"access_level":"open_access","file_name":"IST-2016-542-v1+1_2012-J-01-Poinculus.pdf"}],"publisher":"Elsevier","date_created":"2018-12-11T12:02:36Z","date_published":"2012-08-01T00:00:00Z","volume":33,"abstract":[{"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.","lang":"eng"}],"author":[{"first_name":"Paul","last_name":"Bendich","full_name":"Bendich, Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Cabello","first_name":"Sergio","full_name":"Cabello, Sergio"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"issue":"11","file_date_updated":"2020-07-14T12:46:06Z","language":[{"iso":"eng"}],"year":"2012","day":"01","publication":"Pattern Recognition Letters","pubrep_id":"542","type":"journal_article","status":"public","title":"A point calculus for interlevel set homology","citation":{"ista":"Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.","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.","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>","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>.","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."},"department":[{"_id":"HeEd"}],"quality_controlled":"1","acknowledgement":"Research by the third author is partially supported by the National Science Foundation (NSF) under grant DBI-0820624.","intvolume":"        33","_id":"3310","page":"1436 - 1444","doi":"10.1016/j.patrec.2011.10.007","has_accepted_license":"1","ddc":["000"],"date_updated":"2021-01-12T07:42:34Z","oa":1,"publication_status":"published","publist_id":"3330","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","month":"08"},{"publist_id":"3322","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","month":"01","date_updated":"2021-01-12T07:42:36Z","ddc":["570"],"publication_status":"published","oa":1,"has_accepted_license":"1","intvolume":"        13","page":"7 - 21","_id":"3317","doi":"10.1038/nrn3125","department":[{"_id":"PeJo"}],"quality_controlled":"1","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","citation":{"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.","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."},"pubrep_id":"820","type":"journal_article","status":"public","title":"Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses","language":[{"iso":"eng"}],"year":"2012","day":"01","publication":"Nature Reviews Neuroscience","issue":"1","file_date_updated":"2020-07-14T12:46:07Z","date_published":"2012-01-01T00:00:00Z","abstract":[{"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.","lang":"eng"}],"volume":13,"author":[{"first_name":"Emmanuel","last_name":"Eggermann","id":"34DACA34-E9AE-11E9-849C-D35BD8ADC20C","full_name":"Eggermann, Emmanuel"},{"full_name":"Bucurenciu, Iancu","id":"4BD1D872-E9AE-11E9-9EE9-8BF4597A9E2A","first_name":"Iancu","last_name":"Bucurenciu"},{"full_name":"Goswami, Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87","first_name":"Sarit","last_name":"Goswami"},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas"}],"date_created":"2018-12-11T12:02:38Z","project":[{"grant_number":"JO_780/A5","name":"Synaptic Mechanisms of Neuronal Network Function","_id":"25BC64A8-B435-11E9-9278-68D0E5697425"},{"grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen"}],"publisher":"Nature Publishing Group","file":[{"date_updated":"2020-07-14T12:46:07Z","content_type":"application/pdf","file_name":"IST-2017-820-v1+1_17463_3_art_file_109404_ltmxbw.pdf","file_size":314246,"access_level":"open_access","file_id":"4931","date_created":"2018-12-12T10:12:13Z","creator":"system","checksum":"4c1c86b2f6e4e1562f5bb800b457ea9f","relation":"main_file"},{"file_name":"IST-2017-820-v1+2_17463_3_figure_109402_ltmwlp.pdf","file_size":1840216,"access_level":"open_access","date_updated":"2020-07-14T12:46:07Z","content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:12:14Z","relation":"main_file","checksum":"bceb2efdd49d115f4dde8486bc1be3f2","file_id":"4932"}],"scopus_import":1},{"date_updated":"2021-01-12T07:42:43Z","oa":1,"publication_status":"published","day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3303","year":"2012","language":[{"iso":"eng"}],"oa_version":"Preprint","month":"03","publication":" Journal of Symbolic Computation","volume":47,"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."}],"date_published":"2012-03-01T00:00:00Z","author":[{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael","orcid":"0000-0002-8030-9299"},{"first_name":"Michael","last_name":"Sagraloff","full_name":"Sagraloff, Michael"}],"issue":"3","department":[{"_id":"HeEd"}],"quality_controlled":"1","page":"239 - 258","_id":"3331","intvolume":"        47","date_created":"2018-12-11T12:02:43Z","doi":"10.1016/j.jsc.2011.11.001","status":"public","type":"journal_article","scopus_import":1,"title":"A worst case bound for topology computation of algebraic curves","publisher":"Elsevier","main_file_link":[{"url":"http://arxiv.org/abs/1104.1510","open_access":"1"}],"citation":{"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>","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>.","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>.","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>","ista":"Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves.  Journal of Symbolic Computation. 47(3), 239–258.","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."}},{"status":"public","type":"conference","title":"Robustness of structurally equivalent concurrent parity games","citation":{"ista":"Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.","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.","short":"K. Chatterjee, in:, Springer, 2012, 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>","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>.","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>."},"department":[{"_id":"KrCh"}],"quality_controlled":"1","intvolume":"      7213","_id":"3341","page":"270 - 285","external_id":{"arxiv":["1107.2009"]},"doi":"10.1007/978-3-642-28729-9_18","alternative_title":["LNCS"],"arxiv":1,"date_updated":"2023-02-23T12:23:46Z","conference":{"location":"Tallinn, Estonia","start_date":"2012-03-24","end_date":"2012-04-01","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"oa":1,"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"earlier_version","id":"5382","status":"public"}]},"publist_id":"3284","month":"03","oa_version":"Preprint","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2009"}],"publisher":"Springer","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_created":"2018-12-11T12:02:46Z","date_published":"2012-03-22T00:00:00Z","volume":7213,"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)."}],"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"}],"ec_funded":1,"language":[{"iso":"eng"}],"year":"2012","day":"22"},{"publication":"APS March Meeting 2012","language":[{"iso":"eng"}],"year":"2012","day":"01","issue":"1","author":[{"orcid":"0000-0001-8223-8896","first_name":"Hryhoriy","last_name":"Polshyn","full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48"},{"first_name":"Raffi","last_name":"Budakian","full_name":"Budakian, Raffi"}],"date_published":"2012-02-01T00:00:00Z","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."}],"volume":57,"date_created":"2022-02-08T10:39:08Z","main_file_link":[{"url":"https://meetings.aps.org/Meeting/MAR12/Event/167014","open_access":"1"}],"publisher":"American Physical Society","month":"02","oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","conference":{"location":"Boston, MA, United States","name":"APS: American Physical Society","end_date":"2012-03-02","start_date":"2012-02-27"},"oa":1,"publication_status":"published","publication_identifier":{"issn":["0003-0503"]},"date_updated":"2022-02-08T10:48:01Z","alternative_title":["Bulletin of the American Physical Society"],"article_number":"X21.00008","intvolume":"        57","_id":"10750","quality_controlled":"1","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.","citation":{"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.","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.","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.","short":"H. Polshyn, R. Budakian, in:, APS March Meeting 2012, American Physical Society, 2012.","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.","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.","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."},"article_processing_charge":"No","extern":"1","title":"Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc","type":"conference","status":"public"},{"title":"Polynomial-time algorithms for energy games with special weight structures","type":"conference","status":"public","article_processing_charge":"No","citation":{"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.","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>","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>.","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>."},"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","quality_controlled":"1","department":[{"_id":"KrCh"}],"doi":"10.1007/978-3-642-33090-2_27","external_id":{"arxiv":["1604.08234"]},"_id":"10905","page":"301-312","intvolume":"      7501","arxiv":1,"alternative_title":["LNCS"],"oa":1,"publication_status":"published","conference":{"start_date":"2012-09-10","name":"ESA: European Symposium on Algorithms","end_date":"2012-09-12","location":"Ljubljana, Slovenia"},"date_updated":"2023-09-05T14:09:30Z","publication_identifier":{"eisbn":["9783642330902"],"issn":["0302-9743"],"isbn":["9783642330896"],"eissn":["1611-3349"]},"oa_version":"Preprint","month":"10","related_material":{"record":[{"status":"public","relation":"later_version","id":"535"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","publisher":"Springer","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08234"}],"date_created":"2022-03-21T08:01:45Z","project":[{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"volume":7501,"abstract":[{"lang":"eng","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."}],"date_published":"2012-10-01T00:00:00Z","ec_funded":1,"publication":"Algorithms – ESA 2012","day":"01","year":"2012","language":[{"iso":"eng"}]},{"author":[{"full_name":"Grebenshchikov, Sergey","last_name":"Grebenshchikov","first_name":"Sergey"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta","first_name":"Ashutosh"},{"full_name":"Lopes, Nuno P.","first_name":"Nuno P.","last_name":"Lopes"},{"first_name":"Corneliu","last_name":"Popeea","full_name":"Popeea, Corneliu"},{"full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko","first_name":"Andrey"}],"date_published":"2012-04-01T00:00:00Z","volume":7214,"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."}],"publication":"Tools and Algorithms for the Construction and Analysis of Systems","year":"2012","language":[{"iso":"eng"}],"day":"01","scopus_import":"1","series_title":"LNCS","main_file_link":[{"url":"https://doi.org/10.1007/978-3-642-28756-5_46","open_access":"1"}],"publisher":"Springer","date_created":"2022-03-21T08:03:30Z","alternative_title":["LNCS"],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2012-03-24","end_date":"2012-04-01","location":"Tallinn, Estonia"},"publication_status":"published","oa":1,"publication_identifier":{"isbn":["9783642287558"],"eissn":["1611-3349"],"eisbn":["9783642287565"],"issn":["0302-9743"]},"date_updated":"2023-09-05T14:09:54Z","month":"04","oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"HSF(C): A software verifier based on Horn clauses","type":"conference","status":"public","citation":{"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>.","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>","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>.","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.","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.","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."},"article_processing_charge":"No","quality_controlled":"1","editor":[{"full_name":"Flanagan, Cormac","last_name":"Flanagan","first_name":"Cormac"},{"last_name":"König","first_name":"Barbara","full_name":"König, Barbara"}],"place":"Berlin, Heidelberg","department":[{"_id":"ToHe"}],"doi":"10.1007/978-3-642-28756-5_46","intvolume":"      7214","_id":"10906","page":"549-551"},{"date_updated":"2022-07-18T08:58:48Z","publication_identifier":{"issn":["0092-8674"]},"oa":1,"publication_status":"published","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","month":"05","oa_version":"Published Version","quality_controlled":"1","_id":"11090","page":"733-735","intvolume":"       149","doi":"10.1016/j.cell.2012.04.018","external_id":{"pmid":["22579277"]},"status":"public","type":"journal_article","title":"RNP export by nuclear envelope budding","citation":{"mla":"Hatch, Emily M., and Martin Hetzer. “RNP Export by Nuclear Envelope Budding.” <i>Cell</i>, vol. 149, no. 4, Elsevier, 2012, pp. 733–35, doi:<a href=\"https://doi.org/10.1016/j.cell.2012.04.018\">10.1016/j.cell.2012.04.018</a>.","apa":"Hatch, E. M., &#38; Hetzer, M. (2012). RNP export by nuclear envelope budding. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2012.04.018\">https://doi.org/10.1016/j.cell.2012.04.018</a>","ama":"Hatch EM, Hetzer M. RNP export by nuclear envelope budding. <i>Cell</i>. 2012;149(4):733-735. doi:<a href=\"https://doi.org/10.1016/j.cell.2012.04.018\">10.1016/j.cell.2012.04.018</a>","chicago":"Hatch, Emily M., and Martin Hetzer. “RNP Export by Nuclear Envelope Budding.” <i>Cell</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.cell.2012.04.018\">https://doi.org/10.1016/j.cell.2012.04.018</a>.","short":"E.M. Hatch, M. Hetzer, Cell 149 (2012) 733–735.","ista":"Hatch EM, Hetzer M. 2012. RNP export by nuclear envelope budding. Cell. 149(4), 733–735.","ieee":"E. M. Hatch and M. Hetzer, “RNP export by nuclear envelope budding,” <i>Cell</i>, vol. 149, no. 4. Elsevier, pp. 733–735, 2012."},"extern":"1","article_processing_charge":"No","keyword":["General Biochemistry","Genetics and Molecular Biology"],"day":"11","year":"2012","language":[{"iso":"eng"}],"publication":"Cell","volume":149,"abstract":[{"lang":"eng","text":"Nuclear export of mRNAs is thought to occur exclusively through nuclear pore complexes. In this issue of Cell, Speese et al. identify an alternate pathway for mRNA export in muscle cells where ribonucleoprotein complexes involved in forming neuromuscular junctions transit the nuclear envelope by fusing with and budding through the nuclear membrane."}],"date_published":"2012-05-11T00:00:00Z","author":[{"first_name":"Emily M.","last_name":"Hatch","full_name":"Hatch, Emily M."},{"first_name":"Martin W","last_name":"HETZER","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"issue":"4","date_created":"2022-04-07T07:51:45Z","article_type":"letter_note","scopus_import":"1","publisher":"Elsevier","pmid":1,"main_file_link":[{"url":"https://doi.org/10.1016/j.cell.2012.04.018","open_access":"1"}]},{"language":[{"iso":"eng"}],"year":"2012","day":"19","publication":"Developmental Cell","keyword":["Developmental Biology","Cell Biology","General Biochemistry","Genetics and Molecular Biology","Molecular Biology"],"issue":"2","date_published":"2012-01-19T00:00:00Z","volume":22,"abstract":[{"lang":"eng","text":"Nuclear pore complexes (NPCs) are built from ∼30 different proteins called nucleoporins or Nups. Previous studies have shown that several Nups exhibit cell-type-specific expression and that mutations in NPC components result in tissue-specific diseases. Here we show that a specific change in NPC composition is required for both myogenic and neuronal differentiation. The transmembrane nucleoporin Nup210 is absent in proliferating myoblasts and embryonic stem cells (ESCs) but becomes expressed and incorporated into NPCs during cell differentiation. Preventing Nup210 production by RNAi blocks myogenesis and the differentiation of ESCs into neuroprogenitors. We found that the addition of Nup210 to NPCs does not affect nuclear transport but is required for the induction of genes that are essential for cell differentiation. Our results identify a single change in NPC composition as an essential step in cell differentiation and establish a role for Nup210 in gene expression regulation and cell fate determination."}],"author":[{"full_name":"D'Angelo, Maximiliano A.","last_name":"D'Angelo","first_name":"Maximiliano A."},{"first_name":"J. Sebastian","last_name":"Gomez-Cavazos","full_name":"Gomez-Cavazos, J. Sebastian"},{"last_name":"Mei","first_name":"Arianna","full_name":"Mei, Arianna"},{"last_name":"Lackner","first_name":"Daniel H.","full_name":"Lackner, Daniel H."},{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","first_name":"Martin W","last_name":"HETZER","orcid":"0000-0002-2111-992X"}],"article_type":"original","date_created":"2022-04-07T07:52:10Z","pmid":1,"main_file_link":[{"url":"https://doi.org/10.1016/j.devcel.2011.11.021","open_access":"1"}],"publisher":"Elsevier","scopus_import":"1","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","oa_version":"Published Version","month":"01","publication_identifier":{"issn":["1534-5807"]},"date_updated":"2022-07-18T08:53:16Z","publication_status":"published","oa":1,"intvolume":"        22","_id":"11093","page":"446-458","external_id":{"pmid":["22264802"]},"doi":"10.1016/j.devcel.2011.11.021","quality_controlled":"1","extern":"1","article_processing_charge":"No","citation":{"apa":"D’Angelo, M. A., Gomez-Cavazos, J. S., Mei, A., Lackner, D. H., &#38; Hetzer, M. (2012). A change in nuclear pore complex composition regulates cell differentiation. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2011.11.021\">https://doi.org/10.1016/j.devcel.2011.11.021</a>","mla":"D’Angelo, Maximiliano A., et al. “A Change in Nuclear Pore Complex Composition Regulates Cell Differentiation.” <i>Developmental Cell</i>, vol. 22, no. 2, Elsevier, 2012, pp. 446–58, doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.11.021\">10.1016/j.devcel.2011.11.021</a>.","ama":"D’Angelo MA, Gomez-Cavazos JS, Mei A, Lackner DH, Hetzer M. A change in nuclear pore complex composition regulates cell differentiation. <i>Developmental Cell</i>. 2012;22(2):446-458. doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.11.021\">10.1016/j.devcel.2011.11.021</a>","short":"M.A. D’Angelo, J.S. Gomez-Cavazos, A. Mei, D.H. Lackner, M. Hetzer, Developmental Cell 22 (2012) 446–458.","chicago":"D’Angelo, Maximiliano A., J. Sebastian Gomez-Cavazos, Arianna Mei, Daniel H. Lackner, and Martin Hetzer. “A Change in Nuclear Pore Complex Composition Regulates Cell Differentiation.” <i>Developmental Cell</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.devcel.2011.11.021\">https://doi.org/10.1016/j.devcel.2011.11.021</a>.","ieee":"M. A. D’Angelo, J. S. Gomez-Cavazos, A. Mei, D. H. Lackner, and M. Hetzer, “A change in nuclear pore complex composition regulates cell differentiation,” <i>Developmental Cell</i>, vol. 22, no. 2. Elsevier, pp. 446–458, 2012.","ista":"D’Angelo MA, Gomez-Cavazos JS, Mei A, Lackner DH, Hetzer M. 2012. A change in nuclear pore complex composition regulates cell differentiation. Developmental Cell. 22(2), 446–458."},"type":"journal_article","status":"public","title":"A change in nuclear pore complex composition regulates cell differentiation"},{"title":"Solidification of a cornstarch and water suspension","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"status":"public","type":"journal_article","extern":"1","citation":{"ama":"Waitukaitis SR, Jaeger H. Solidification of a cornstarch and water suspension. <i>Revista Cubana de Fisica</i>. 2012;29(1E):1E31-1E33.","short":"S.R. Waitukaitis, H. Jaeger, Revista Cubana de Fisica 29 (2012) 1E31-1E33.","chicago":"Waitukaitis, Scott R, and Heinrich Jaeger. “Solidification of a Cornstarch and Water Suspension.” <i>Revista Cubana de Fisica</i>. Universidad de La Habana, 2012.","apa":"Waitukaitis, S. R., &#38; Jaeger, H. (2012). Solidification of a cornstarch and water suspension. <i>Revista Cubana de Fisica</i>. Universidad de La Habana.","mla":"Waitukaitis, Scott R., and Heinrich Jaeger. “Solidification of a Cornstarch and Water Suspension.” <i>Revista Cubana de Fisica</i>, vol. 29, no. 1E, Universidad de La Habana, 2012, p. 1E31-1E33.","ieee":"S. R. Waitukaitis and H. Jaeger, “Solidification of a cornstarch and water suspension,” <i>Revista Cubana de Fisica</i>, vol. 29, no. 1E. Universidad de La Habana, p. 1E31-1E33, 2012.","ista":"Waitukaitis SR, Jaeger H. 2012. Solidification of a cornstarch and water suspension. Revista Cubana de Fisica. 29(1E), 1E31-1E33."},"quality_controlled":"1","acknowledgement":"This work was supported by the NSF through its MRSEC program (DMR-0820054). S. R. W. acknowledges support from a Millikan fellowship.","intvolume":"        29","license":"https://creativecommons.org/licenses/by-nc/4.0/","_id":"114","page":"1E31 - 1E33","has_accepted_license":"1","oa":1,"publication_status":"published","date_updated":"2021-01-12T06:48:34Z","ddc":["530"],"month":"08","oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7940","publisher":"Universidad de La Habana","file":[{"success":1,"file_id":"6461","date_created":"2019-05-16T11:08:52Z","creator":"kschuh","relation":"main_file","date_updated":"2019-05-16T11:08:52Z","content_type":"application/pdf","file_name":"2012_RCF_Waitukaitis.pdf","file_size":589776,"access_level":"open_access"}],"date_created":"2018-12-11T11:44:42Z","author":[{"orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","first_name":"Scott R","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jaeger, Heinrich","first_name":"Heinrich","last_name":"Jaeger"}],"date_published":"2012-08-14T00:00:00Z","abstract":[{"text":"We report on an investigation of the solidification of a cornstarch and water suspension during normal impact on its surface. We find that a finite time after impact, the suspension displays characteristics reminiscent of a solid, including localized stress transmission, the development of a yield stress, and some elastic energy storage. The time dependence of these characteristics depends on the thickness of the cornstarch layer, showing that the solidification is a dynamic process driven by the impacting object. These findings confirm previous speculations that rapidly applied normal stress transforms the normally fluid-like suspension into a temporarily jammed solid and draw a clear distinction between the effects of normal stress and shear stress in dense suspensions.","lang":"eng"}],"volume":29,"file_date_updated":"2019-05-16T11:08:52Z","issue":"1E","publication":"Revista Cubana de Fisica","year":"2012","language":[{"iso":"eng"}],"day":"14"}]