[{"intvolume":"       175","publisher":"Princeton University Press","abstract":[{"text":"The Manin conjecture is established for Châtelet surfaces over Q aris-ing as minimal proper smooth models of the surface Y 2 + Z 2 = f(X) in A 3 Q, where f ∈ Z[X] is a totally reducible polynomial of degree 3 without repeated roots. These surfaces do not satisfy weak approximation.","lang":"eng"}],"month":"01","publication":"Annals of Mathematics","extern":1,"date_published":"2012-01-01T00:00:00Z","page":"297 - 343","author":[{"last_name":"De La Bretèche","full_name":"de la Bretèche, Régis","first_name":"Régis"},{"orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","last_name":"Browning","full_name":"Timothy Browning"},{"first_name":"Emmanuel","last_name":"Peyre","full_name":"Peyre, Emmanuel"}],"day":"01","quality_controlled":0,"volume":175,"citation":{"chicago":"De La Bretèche, Régis, Timothy D Browning, and Emmanuel Peyre. “On Manin’s Conjecture for a Family of Châtelet Surfaces.” <i>Annals of Mathematics</i>. Princeton University Press, 2012. <a href=\"https://doi.org/10.4007/annals.2012.175.1.8\">https://doi.org/10.4007/annals.2012.175.1.8</a>.","ama":"De La Bretèche R, Browning TD, Peyre E. On Manin’s conjecture for a family of Châtelet surfaces. <i>Annals of Mathematics</i>. 2012;175(1):297-343. doi:<a href=\"https://doi.org/10.4007/annals.2012.175.1.8\">10.4007/annals.2012.175.1.8</a>","ieee":"R. De La Bretèche, T. D. Browning, and E. Peyre, “On Manin’s conjecture for a family of Châtelet surfaces,” <i>Annals of Mathematics</i>, vol. 175, no. 1. Princeton University Press, pp. 297–343, 2012.","apa":"De La Bretèche, R., Browning, T. D., &#38; Peyre, E. (2012). On Manin’s conjecture for a family of Châtelet surfaces. <i>Annals of Mathematics</i>. Princeton University Press. <a href=\"https://doi.org/10.4007/annals.2012.175.1.8\">https://doi.org/10.4007/annals.2012.175.1.8</a>","mla":"De La Bretèche, Régis, et al. “On Manin’s Conjecture for a Family of Châtelet Surfaces.” <i>Annals of Mathematics</i>, vol. 175, no. 1, Princeton University Press, 2012, pp. 297–343, doi:<a href=\"https://doi.org/10.4007/annals.2012.175.1.8\">10.4007/annals.2012.175.1.8</a>.","short":"R. De La Bretèche, T.D. Browning, E. Peyre, Annals of Mathematics 175 (2012) 297–343.","ista":"De La Bretèche R, Browning TD, Peyre E. 2012. On Manin’s conjecture for a family of Châtelet surfaces. Annals of Mathematics. 175(1), 297–343."},"issue":"1","type":"journal_article","title":"On Manin's conjecture for a family of Châtelet surfaces","publication_status":"published","status":"public","_id":"237","acknowledgement":"EP/E053262/1\tEngineering and Physical Sciences Research Council","doi":"10.4007/annals.2012.175.1.8","date_updated":"2021-01-12T06:57:04Z","year":"2012","publist_id":"7667","date_created":"2018-12-11T11:45:22Z"},{"intvolume":"      2051","publisher":"Springer","abstract":[{"text":"Bose–Einstein condensation (BEC) in cold atomic gases was first achieved experimentally in 1995 [1, 6]. After initial failed attempts with spin-polarized atomic hydrogen, the first successful demonstrations of this phenomenon used gases of rubidium and sodium atoms, respectively. Since then there has been a surge of activity in this field, with ingenious experiments putting forth more and more astonishing results about the behavior of matter at very cold temperatures.\n","lang":"eng"}],"publication":"Quantum Many Body Systems","month":"01","extern":1,"date_published":"2012-01-01T00:00:00Z","page":"55 - 92","author":[{"orcid":"0000-0002-6781-0521","last_name":"Seiringer","full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"day":"01","quality_controlled":0,"volume":2051,"citation":{"ista":"Seiringer R. 2012.Cold quantum gases and bose einstein condensation. In: Quantum Many Body Systems. Lecture Notes in Mathematics, vol. 2051, 55–92.","short":"R. Seiringer, in:, V. Rivasseau, R. Seiringer, J. Solovej, T. Spencer (Eds.), Quantum Many Body Systems, Springer, 2012, pp. 55–92.","mla":"Seiringer, Robert. “Cold Quantum Gases and Bose Einstein Condensation.” <i>Quantum Many Body Systems</i>, edited by Vincent Rivasseau et al., vol. 2051, Springer, 2012, pp. 55–92, doi:<a href=\"https://doi.org/10.1007/978-3-642-29511-9_2\">10.1007/978-3-642-29511-9_2</a>.","apa":"Seiringer, R. (2012). Cold quantum gases and bose einstein condensation. In V. Rivasseau, R. Seiringer, J. Solovej, &#38; T. Spencer (Eds.), <i>Quantum Many Body Systems</i> (Vol. 2051, pp. 55–92). Springer. <a href=\"https://doi.org/10.1007/978-3-642-29511-9_2\">https://doi.org/10.1007/978-3-642-29511-9_2</a>","ieee":"R. Seiringer, “Cold quantum gases and bose einstein condensation,” in <i>Quantum Many Body Systems</i>, vol. 2051, V. Rivasseau, R. Seiringer, J. Solovej, and T. Spencer, Eds. Springer, 2012, pp. 55–92.","ama":"Seiringer R. Cold quantum gases and bose einstein condensation. In: Rivasseau V, Seiringer R, Solovej J, Spencer T, eds. <i>Quantum Many Body Systems</i>. Vol 2051. Springer; 2012:55-92. doi:<a href=\"https://doi.org/10.1007/978-3-642-29511-9_2\">10.1007/978-3-642-29511-9_2</a>","chicago":"Seiringer, Robert. “Cold Quantum Gases and Bose Einstein Condensation.” In <i>Quantum Many Body Systems</i>, edited by Vincent Rivasseau, Robert Seiringer, Jan Solovej, and Thomas Spencer, 2051:55–92. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29511-9_2\">https://doi.org/10.1007/978-3-642-29511-9_2</a>."},"type":"book_chapter","title":"Cold quantum gases and bose einstein condensation","publication_status":"published","status":"public","_id":"2399","doi":"10.1007/978-3-642-29511-9_2","date_updated":"2021-01-12T06:57:14Z","year":"2012","editor":[{"last_name":"Rivasseau","full_name":"Rivasseau, Vincent","first_name":"Vincent"},{"last_name":"Seiringer","full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521"},{"full_name":"Solovej, Jan P","last_name":"Solovej","first_name":"Jan"},{"full_name":"Spencer, Thomas","last_name":"Spencer","first_name":"Thomas"}],"publist_id":"4526","alternative_title":["Lecture Notes in Mathematics"],"date_created":"2018-12-11T11:57:26Z"},{"acknowledgement":"EP/E053262/1\tEngineering and Physical Sciences Research Council","doi":"10.1017/S001309151100037X","date_updated":"2021-01-12T06:57:23Z","year":"2012","publist_id":"7662","oa":1,"date_created":"2018-12-11T11:45:23Z","title":"Averages of shifted convolutions of d3 (n)","type":"journal_article","publication_status":"published","status":"public","_id":"242","page":"551 - 576","author":[{"last_name":"Baier","full_name":"Baier, Stephan","first_name":"Stephan"},{"orcid":"0000-0002-8314-0177","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning","last_name":"Browning"},{"last_name":"Marasingha","full_name":"Marasingha, Gihan","first_name":"Gihan"},{"last_name":"Zhao","full_name":"Zhao, Liangyi","first_name":"Liangyi"}],"day":"01","quality_controlled":0,"volume":55,"citation":{"mla":"Baier, Stephan, et al. “Averages of Shifted Convolutions of D3 (N).” <i>Proceedings of the Edinburgh Mathematical Society</i>, vol. 55, no. 3, Cambridge University Press, 2012, pp. 551–76, doi:<a href=\"https://doi.org/10.1017/S001309151100037X\">10.1017/S001309151100037X</a>.","apa":"Baier, S., Browning, T. D., Marasingha, G., &#38; Zhao, L. (2012). Averages of shifted convolutions of d3 (n). <i>Proceedings of the Edinburgh Mathematical Society</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S001309151100037X\">https://doi.org/10.1017/S001309151100037X</a>","short":"S. Baier, T.D. Browning, G. Marasingha, L. Zhao, Proceedings of the Edinburgh Mathematical Society 55 (2012) 551–576.","ista":"Baier S, Browning TD, Marasingha G, Zhao L. 2012. Averages of shifted convolutions of d3 (n). Proceedings of the Edinburgh Mathematical Society. 55(3), 551–576.","chicago":"Baier, Stephan, Timothy D Browning, Gihan Marasingha, and Liangyi Zhao. “Averages of Shifted Convolutions of D3 (N).” <i>Proceedings of the Edinburgh Mathematical Society</i>. Cambridge University Press, 2012. <a href=\"https://doi.org/10.1017/S001309151100037X\">https://doi.org/10.1017/S001309151100037X</a>.","ama":"Baier S, Browning TD, Marasingha G, Zhao L. Averages of shifted convolutions of d3 (n). <i>Proceedings of the Edinburgh Mathematical Society</i>. 2012;55(3):551-576. doi:<a href=\"https://doi.org/10.1017/S001309151100037X\">10.1017/S001309151100037X</a>","ieee":"S. Baier, T. D. Browning, G. Marasingha, and L. Zhao, “Averages of shifted convolutions of d3 (n),” <i>Proceedings of the Edinburgh Mathematical Society</i>, vol. 55, no. 3. Cambridge University Press, pp. 551–576, 2012."},"issue":"3","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1101.5464"}],"intvolume":"        55","publisher":"Cambridge University Press","abstract":[{"text":"We investigate the first and second moments of shifted convolutions of the generalized divisor function d 3(n).","lang":"eng"}],"month":"10","publication":"Proceedings of the Edinburgh Mathematical Society","extern":1,"date_published":"2012-10-01T00:00:00Z"},{"type":"journal_article","title":"Quantitative regional and ultra structural localization of the Ca v2 3 subunit of R type calcium channel in mouse brain","publication_status":"published","status":"public","_id":"2689","doi":"10.1523/JNEUROSCI.1142-12.2012","date_updated":"2021-01-12T06:59:04Z","year":"2012","publist_id":"4208","date_created":"2018-12-11T11:59:05Z","intvolume":"        32","publisher":"Society for Neuroscience","abstract":[{"lang":"eng","text":"R-type calcium channels (RTCCs) are well known for their role in synaptic plasticity, but little is known about their subcellular distribution across various neuronal compartments. Using subtype-specific antibodies, we characterized the regional and subcellular localization of Ca v2.3 in mice and rats at both light and electron microscopic levels. Ca v2.3 immunogold particles were found to be predominantly presynaptic in the interpeduncular nucleus, but postsynaptic in other brain regions. Serial section analysis of electron microscopic images from the hippocampal CA1 revealed a higher density of immunogold particles in the dendritic shaft plasma membrane compared with the pyramidal cell somata. However, the labeling densities were not significantly different among the apical, oblique, or basal dendrites. Immunogold particles were also observed over the plasma membrane of dendritic spines, including both synaptic and extrasynaptic sites. Individual spine heads contained &lt;20 immunogold particles, with an average density of ~260 immunoparticles per μm 3 spine head volume, in accordance with the density of RTCCs estimated using calcium imaging (Sabatini and Svoboda, 2000). The Ca v2.3 density was variable among similar-sized spine heads and did not correlate with the density in the parent dendrite, implying that spines are individual calcium compartments operating autonomously from their parent dendrites."}],"publication":"Journal of Neuroscience","month":"09","extern":1,"date_published":"2012-09-26T00:00:00Z","page":"13555 - 13567","author":[{"first_name":"Laxmi","full_name":"Parajuli, Laxmi K","last_name":"Parajuli"},{"last_name":"Nakajima","full_name":"Nakajima, Chikako","first_name":"Chikako"},{"last_name":"Kulik","full_name":"Kulik, Ákos","first_name":"Ákos"},{"first_name":"Ko","full_name":"Matsui, Ko","last_name":"Matsui"},{"first_name":"Toni","last_name":"Schneider","full_name":"Schneider, Toni"},{"orcid":"0000-0001-8761-9444","last_name":"Shigemoto","full_name":"Ryuichi Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"first_name":"Yugo","last_name":"Fukazawa","full_name":"Fukazawa, Yugo"}],"day":"26","volume":32,"quality_controlled":0,"citation":{"ieee":"L. Parajuli <i>et al.</i>, “Quantitative regional and ultra structural localization of the Ca v2 3 subunit of R type calcium channel in mouse brain,” <i>Journal of Neuroscience</i>, vol. 32, no. 39. Society for Neuroscience, pp. 13555–13567, 2012.","ama":"Parajuli L, Nakajima C, Kulik Á, et al. Quantitative regional and ultra structural localization of the Ca v2 3 subunit of R type calcium channel in mouse brain. <i>Journal of Neuroscience</i>. 2012;32(39):13555-13567. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1142-12.2012\">10.1523/JNEUROSCI.1142-12.2012</a>","chicago":"Parajuli, Laxmi, Chikako Nakajima, Ákos Kulik, Ko Matsui, Toni Schneider, Ryuichi Shigemoto, and Yugo Fukazawa. “Quantitative Regional and Ultra Structural Localization of the Ca v2 3 Subunit of R Type Calcium Channel in Mouse Brain.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2012. <a href=\"https://doi.org/10.1523/JNEUROSCI.1142-12.2012\">https://doi.org/10.1523/JNEUROSCI.1142-12.2012</a>.","short":"L. Parajuli, C. Nakajima, Á. Kulik, K. Matsui, T. Schneider, R. Shigemoto, Y. Fukazawa, Journal of Neuroscience 32 (2012) 13555–13567.","ista":"Parajuli L, Nakajima C, Kulik Á, Matsui K, Schneider T, Shigemoto R, Fukazawa Y. 2012. Quantitative regional and ultra structural localization of the Ca v2 3 subunit of R type calcium channel in mouse brain. Journal of Neuroscience. 32(39), 13555–13567.","mla":"Parajuli, Laxmi, et al. “Quantitative Regional and Ultra Structural Localization of the Ca v2 3 Subunit of R Type Calcium Channel in Mouse Brain.” <i>Journal of Neuroscience</i>, vol. 32, no. 39, Society for Neuroscience, 2012, pp. 13555–67, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1142-12.2012\">10.1523/JNEUROSCI.1142-12.2012</a>.","apa":"Parajuli, L., Nakajima, C., Kulik, Á., Matsui, K., Schneider, T., Shigemoto, R., &#38; Fukazawa, Y. (2012). Quantitative regional and ultra structural localization of the Ca v2 3 subunit of R type calcium channel in mouse brain. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1142-12.2012\">https://doi.org/10.1523/JNEUROSCI.1142-12.2012</a>"},"issue":"39"},{"publisher":"Springer","abstract":[{"lang":"eng","text":"Consider N × N Hermitian or symmetric random matrices H where the distribution of the (i, j) matrix element is given by a probability measure ν ij with a subexponential decay. Let σ ij 2 be the variance for the probability measure ν ij with the normalization property that Σ iσ i,j 2 = 1 for all j. Under essentially the only condition that c ≤ N σ ij 2 ≤ c -1 for some constant c &gt; 0, we prove that, in the limit N → ∞, the eigenvalue spacing statistics of H in the bulk of the spectrum coincide with those of the Gaussian unitary or orthogonal ensemble (GUE or GOE). We also show that for band matrices with bandwidth M the local semicircle law holds to the energy scale M -1. "}],"intvolume":"       154","extern":1,"date_published":"2012-10-01T00:00:00Z","publication":"Probability Theory and Related Fields","month":"10","day":"01","page":"341 - 407","author":[{"full_name":"László Erdös","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"},{"full_name":"Yau, Horng-Tzer","last_name":"Yau","first_name":"Horng"},{"last_name":"Yin","full_name":"Yin, Jun","first_name":"Jun"}],"citation":{"ista":"Erdös L, Yau H, Yin J. 2012. Bulk universality for generalized Wigner matrices. Probability Theory and Related Fields. 154(1–2), 341–407.","short":"L. Erdös, H. Yau, J. Yin, Probability Theory and Related Fields 154 (2012) 341–407.","mla":"Erdös, László, et al. “Bulk Universality for Generalized Wigner Matrices.” <i>Probability Theory and Related Fields</i>, vol. 154, no. 1–2, Springer, 2012, pp. 341–407, doi:<a href=\"https://doi.org/10.1007/s00440-011-0390-3\">10.1007/s00440-011-0390-3</a>.","apa":"Erdös, L., Yau, H., &#38; Yin, J. (2012). Bulk universality for generalized Wigner matrices. <i>Probability Theory and Related Fields</i>. Springer. <a href=\"https://doi.org/10.1007/s00440-011-0390-3\">https://doi.org/10.1007/s00440-011-0390-3</a>","ieee":"L. Erdös, H. Yau, and J. Yin, “Bulk universality for generalized Wigner matrices,” <i>Probability Theory and Related Fields</i>, vol. 154, no. 1–2. Springer, pp. 341–407, 2012.","chicago":"Erdös, László, Horng Yau, and Jun Yin. “Bulk Universality for Generalized Wigner Matrices.” <i>Probability Theory and Related Fields</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00440-011-0390-3\">https://doi.org/10.1007/s00440-011-0390-3</a>.","ama":"Erdös L, Yau H, Yin J. Bulk universality for generalized Wigner matrices. <i>Probability Theory and Related Fields</i>. 2012;154(1-2):341-407. doi:<a href=\"https://doi.org/10.1007/s00440-011-0390-3\">10.1007/s00440-011-0390-3</a>"},"issue":"1-2","volume":154,"quality_controlled":0,"type":"journal_article","title":"Bulk universality for generalized Wigner matrices","_id":"2767","publication_status":"published","status":"public","year":"2012","doi":"10.1007/s00440-011-0390-3","date_updated":"2021-01-12T06:59:33Z","date_created":"2018-12-11T11:59:29Z","publist_id":"4123"},{"date_created":"2018-12-11T11:59:30Z","publist_id":"4120","year":"2012","date_updated":"2021-01-12T06:59:35Z","doi":"10.1016/j.aim.2011.12.010","_id":"2770","status":"public","publication_status":"published","type":"journal_article","title":"Rigidity of eigenvalues of generalized Wigner matrices","issue":"3","citation":{"chicago":"Erdös, László, Horng Yau, and Jun Yin. “Rigidity of Eigenvalues of Generalized Wigner Matrices.” <i>Advances in Mathematics</i>. Academic Press, 2012. <a href=\"https://doi.org/10.1016/j.aim.2011.12.010\">https://doi.org/10.1016/j.aim.2011.12.010</a>.","ama":"Erdös L, Yau H, Yin J. Rigidity of eigenvalues of generalized Wigner matrices. <i>Advances in Mathematics</i>. 2012;229(3):1435-1515. doi:<a href=\"https://doi.org/10.1016/j.aim.2011.12.010\">10.1016/j.aim.2011.12.010</a>","ieee":"L. Erdös, H. Yau, and J. Yin, “Rigidity of eigenvalues of generalized Wigner matrices,” <i>Advances in Mathematics</i>, vol. 229, no. 3. Academic Press, pp. 1435–1515, 2012.","mla":"Erdös, László, et al. “Rigidity of Eigenvalues of Generalized Wigner Matrices.” <i>Advances in Mathematics</i>, vol. 229, no. 3, Academic Press, 2012, pp. 1435–515, doi:<a href=\"https://doi.org/10.1016/j.aim.2011.12.010\">10.1016/j.aim.2011.12.010</a>.","apa":"Erdös, L., Yau, H., &#38; Yin, J. (2012). Rigidity of eigenvalues of generalized Wigner matrices. <i>Advances in Mathematics</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.aim.2011.12.010\">https://doi.org/10.1016/j.aim.2011.12.010</a>","ista":"Erdös L, Yau H, Yin J. 2012. Rigidity of eigenvalues of generalized Wigner matrices. Advances in Mathematics. 229(3), 1435–1515.","short":"L. Erdös, H. Yau, J. Yin, Advances in Mathematics 229 (2012) 1435–1515."},"quality_controlled":0,"volume":229,"day":"15","author":[{"last_name":"Erdös","full_name":"László Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603"},{"full_name":"Yau, Horng-Tzer","last_name":"Yau","first_name":"Horng"},{"last_name":"Yin","full_name":"Yin, Jun","first_name":"Jun"}],"page":"1435 - 1515","date_published":"2012-02-15T00:00:00Z","extern":1,"publication":"Advances in Mathematics","month":"02","abstract":[{"lang":"eng","text":"Consider N×N Hermitian or symmetric random matrices H with independent entries, where the distribution of the (i,j) matrix element is given by the probability measure vij with zero expectation and with variance σ ιj 2. We assume that the variances satisfy the normalization condition Σiσij2=1 for all j and that there is a positive constant c such that c≤Nσ ιj 2 ιc -1. We further assume that the probability distributions νij have a uniform subexponential decay. We prove that the Stieltjes transform of the empirical eigenvalue distribution of H is given by the Wigner semicircle law uniformly up to the edges of the spectrum with an error of order (Nη) -1 where η is the imaginary part of the spectral parameter in the Stieltjes transform. There are three corollaries to this strong local semicircle law: (1) Rigidity of eigenvalues: If γj=γj,N denotes the classical location of the j-th eigenvalue under the semicircle law ordered in increasing order, then the j-th eigenvalue λj is close to γj in the sense that for some positive constants C, c P{double-struck}(∃j:|λ j-γ j|≥(logN) CloglogN[min(j,N-j+1)] -1/3N -2/3)≤ C exp[-(logN) cloglogN] for N large enough. (2) The proof of Dyson's conjecture (Dyson, 1962 [15]) which states that the time scale of the Dyson Brownian motion to reach local equilibrium is of order N -1 up to logarithmic corrections. (3) The edge universality holds in the sense that the probability distributions of the largest (and the smallest) eigenvalues of two generalized Wigner ensembles are the same in the large N limit provided that the second moments of the two ensembles are identical."}],"publisher":"Academic Press","intvolume":"       229"},{"title":"A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices","type":"journal_article","_id":"2773","publication_status":"published","status":"public","year":"2012","doi":"10.1214/EJP.v17-1779","date_updated":"2021-01-12T06:59:36Z","date_created":"2018-12-11T11:59:31Z","publist_id":"4117","publisher":"Institute of Mathematical Statistics","abstract":[{"lang":"eng","text":"Recently we proved [3, 4, 6, 7, 9, 10, 11] that the eigenvalue correlation functions of a general class of random matrices converge, weakly with respect to the energy, to the corresponding ones of Gaussian matrices. Tao and Vu [15] gave a proof that for the special case of Hermitian Wigner matrices the convergence can be strengthened to vague convergence at any fixed energy in the bulk. In this article we show that this theorem is an immediate corollary of our earlier results. Indeed, a more general form of this theorem also follows directly from our work [2]."}],"intvolume":"        17","extern":1,"date_published":"2012-04-10T00:00:00Z","month":"04","publication":"Electronic Journal of Probability","day":"10","author":[{"orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"László Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng-Tzer"}],"citation":{"ieee":"L. Erdös and H. Yau, “A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices,” <i>Electronic Journal of Probability</i>, vol. 17. Institute of Mathematical Statistics, 2012.","chicago":"Erdös, László, and Horng Yau. “A Comment on the Wigner-Dyson-Mehta Bulk Universality Conjecture for Wigner Matrices.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2012. <a href=\"https://doi.org/10.1214/EJP.v17-1779\">https://doi.org/10.1214/EJP.v17-1779</a>.","ama":"Erdös L, Yau H. A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices. <i>Electronic Journal of Probability</i>. 2012;17. doi:<a href=\"https://doi.org/10.1214/EJP.v17-1779\">10.1214/EJP.v17-1779</a>","short":"L. Erdös, H. Yau, Electronic Journal of Probability 17 (2012).","ista":"Erdös L, Yau H. 2012. A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices. Electronic Journal of Probability. 17.","apa":"Erdös, L., &#38; Yau, H. (2012). A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/EJP.v17-1779\">https://doi.org/10.1214/EJP.v17-1779</a>","mla":"Erdös, László, and Horng Yau. “A Comment on the Wigner-Dyson-Mehta Bulk Universality Conjecture for Wigner Matrices.” <i>Electronic Journal of Probability</i>, vol. 17, Institute of Mathematical Statistics, 2012, doi:<a href=\"https://doi.org/10.1214/EJP.v17-1779\">10.1214/EJP.v17-1779</a>."},"quality_controlled":0,"volume":17},{"volume":312,"quality_controlled":0,"citation":{"ieee":"L. Erdös, S. Fournais, and J. Solovej, “Scott correction for large atoms and molecules in a self-generated magnetic field,” <i>Communications in Mathematical Physics</i>, vol. 312, no. 3. Springer, pp. 847–882, 2012.","chicago":"Erdös, László, Søren Fournais, and Jan Solovej. “Scott Correction for Large Atoms and Molecules in a Self-Generated Magnetic Field.” <i>Communications in Mathematical Physics</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00220-012-1468-1\">https://doi.org/10.1007/s00220-012-1468-1</a>.","ama":"Erdös L, Fournais S, Solovej J. Scott correction for large atoms and molecules in a self-generated magnetic field. <i>Communications in Mathematical Physics</i>. 2012;312(3):847-882. doi:<a href=\"https://doi.org/10.1007/s00220-012-1468-1\">10.1007/s00220-012-1468-1</a>","ista":"Erdös L, Fournais S, Solovej J. 2012. Scott correction for large atoms and molecules in a self-generated magnetic field. Communications in Mathematical Physics. 312(3), 847–882.","short":"L. Erdös, S. Fournais, J. Solovej, Communications in Mathematical Physics 312 (2012) 847–882.","apa":"Erdös, L., Fournais, S., &#38; Solovej, J. (2012). Scott correction for large atoms and molecules in a self-generated magnetic field. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-012-1468-1\">https://doi.org/10.1007/s00220-012-1468-1</a>","mla":"Erdös, László, et al. “Scott Correction for Large Atoms and Molecules in a Self-Generated Magnetic Field.” <i>Communications in Mathematical Physics</i>, vol. 312, no. 3, Springer, 2012, pp. 847–82, doi:<a href=\"https://doi.org/10.1007/s00220-012-1468-1\">10.1007/s00220-012-1468-1</a>."},"issue":"3","page":"847 - 882","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","full_name":"László Erdös","orcid":"0000-0001-5366-9603"},{"last_name":"Fournais","full_name":"Fournais, Søren","first_name":"Søren"},{"first_name":"Jan","last_name":"Solovej","full_name":"Solovej, Jan P"}],"day":"01","month":"06","publication":"Communications in Mathematical Physics","extern":1,"date_published":"2012-06-01T00:00:00Z","intvolume":"       312","publisher":"Springer","abstract":[{"text":"We consider a large neutral molecule with total nuclear charge Z in non-relativistic quantum mechanics with a self-generated classical electromagnetic field. To ensure stability, we assume that Zα 2 ≤ κ 0 for a sufficiently small κ 0, where α denotes the fine structure constant. We show that, in the simultaneous limit Z → ∞, α → 0 such that κ = Zα 2 is fixed, the ground state energy of the system is given by a two term expansion c 1Z 7/3 + c 2(κ) Z 2 + o(Z 2). The leading term is given by the non-magnetic Thomas-Fermi theory. Our result shows that the magnetic field affects only the second (so-called Scott) term in the expansion.","lang":"eng"}],"publist_id":"4116","date_created":"2018-12-11T11:59:31Z","doi":"10.1007/s00220-012-1468-1","date_updated":"2021-01-12T06:59:36Z","year":"2012","publication_status":"published","status":"public","_id":"2774","title":"Scott correction for large atoms and molecules in a self-generated magnetic field","type":"journal_article"},{"issue":"3","citation":{"ieee":"L. Erdös, A. Knowles, H. Yau, and J. Yin, “Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues,” <i>Communications in Mathematical Physics</i>, vol. 314, no. 3. Springer, pp. 587–640, 2012.","ama":"Erdös L, Knowles A, Yau H, Yin J. Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues. <i>Communications in Mathematical Physics</i>. 2012;314(3):587-640. doi:<a href=\"https://doi.org/10.1007/s00220-012-1527-7\">10.1007/s00220-012-1527-7</a>","chicago":"Erdös, László, Antti Knowles, Horng Yau, and Jun Yin. “Spectral Statistics of Erdős-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues.” <i>Communications in Mathematical Physics</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00220-012-1527-7\">https://doi.org/10.1007/s00220-012-1527-7</a>.","ista":"Erdös L, Knowles A, Yau H, Yin J. 2012. Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues. Communications in Mathematical Physics. 314(3), 587–640.","short":"L. Erdös, A. Knowles, H. Yau, J. Yin, Communications in Mathematical Physics 314 (2012) 587–640.","apa":"Erdös, L., Knowles, A., Yau, H., &#38; Yin, J. (2012). Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-012-1527-7\">https://doi.org/10.1007/s00220-012-1527-7</a>","mla":"Erdös, László, et al. “Spectral Statistics of Erdős-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues.” <i>Communications in Mathematical Physics</i>, vol. 314, no. 3, Springer, 2012, pp. 587–640, doi:<a href=\"https://doi.org/10.1007/s00220-012-1527-7\">10.1007/s00220-012-1527-7</a>."},"quality_controlled":0,"volume":314,"day":"01","author":[{"orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"László Erdös","last_name":"Erdös"},{"first_name":"Antti","last_name":"Knowles","full_name":"Knowles, Antti"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng-Tzer"},{"full_name":"Yin, Jun","last_name":"Yin","first_name":"Jun"}],"page":"587 - 640","date_published":"2012-09-01T00:00:00Z","extern":1,"month":"09","publication":"Communications in Mathematical Physics","abstract":[{"text":"We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, i.e. graphs on N vertices where every edge is chosen independently and with probability p ≡ p(N). We rescale the matrix so that its bulk eigenvalues are of order one. Under the assumption pN≫N2/3 , we prove the universality of eigenvalue distributions both in the bulk and at the edge of the spectrum. More precisely, we prove (1) that the eigenvalue spacing of the Erdős-Rényi graph in the bulk of the spectrum has the same distribution as that of the Gaussian orthogonal ensemble; and (2) that the second largest eigenvalue of the Erdős-Rényi graph has the same distribution as the largest eigenvalue of the Gaussian orthogonal ensemble. As an application of our method, we prove the bulk universality of generalized Wigner matrices under the assumption that the matrix entries have at least 4 + ε moments.","lang":"eng"}],"publisher":"Springer","intvolume":"       314","date_created":"2018-12-11T11:59:32Z","publist_id":"4114","year":"2012","date_updated":"2021-01-12T06:59:37Z","doi":"10.1007/s00220-012-1527-7","_id":"2776","status":"public","publication_status":"published","title":"Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues","type":"journal_article"},{"date_updated":"2021-01-12T06:59:37Z","doi":"10.1063/1.3697417","year":"2012","publist_id":"4113","date_created":"2018-12-11T11:59:32Z","type":"journal_article","title":"Relativistic Scott correction in self-generated magnetic fields","status":"public","publication_status":"published","_id":"2777","author":[{"orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"László Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"},{"full_name":"Fournais, Søren","last_name":"Fournais","first_name":"Søren"},{"first_name":"Jan","last_name":"Solovej","full_name":"Solovej, Jan P"}],"day":"28","quality_controlled":0,"volume":53,"issue":"9","citation":{"ista":"Erdös L, Fournais S, Solovej J. 2012. Relativistic Scott correction in self-generated magnetic fields. Journal of Mathematical Physics. 53(9).","short":"L. Erdös, S. Fournais, J. Solovej, Journal of Mathematical Physics 53 (2012).","mla":"Erdös, László, et al. “Relativistic Scott Correction in Self-Generated Magnetic Fields.” <i>Journal of Mathematical Physics</i>, vol. 53, no. 9, American Institute of Physics, 2012, doi:<a href=\"https://doi.org/10.1063/1.3697417\">10.1063/1.3697417</a>.","apa":"Erdös, L., Fournais, S., &#38; Solovej, J. (2012). Relativistic Scott correction in self-generated magnetic fields. <i>Journal of Mathematical Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.3697417\">https://doi.org/10.1063/1.3697417</a>","ieee":"L. Erdös, S. Fournais, and J. Solovej, “Relativistic Scott correction in self-generated magnetic fields,” <i>Journal of Mathematical Physics</i>, vol. 53, no. 9. American Institute of Physics, 2012.","chicago":"Erdös, László, Søren Fournais, and Jan Solovej. “Relativistic Scott Correction in Self-Generated Magnetic Fields.” <i>Journal of Mathematical Physics</i>. American Institute of Physics, 2012. <a href=\"https://doi.org/10.1063/1.3697417\">https://doi.org/10.1063/1.3697417</a>.","ama":"Erdös L, Fournais S, Solovej J. Relativistic Scott correction in self-generated magnetic fields. <i>Journal of Mathematical Physics</i>. 2012;53(9). doi:<a href=\"https://doi.org/10.1063/1.3697417\">10.1063/1.3697417</a>"},"intvolume":"        53","abstract":[{"lang":"eng","text":"We consider a large neutral molecule with total nuclear charge Z in a model with self-generated classical magnetic field and where the kinetic energy of the electrons is treated relativistically. To ensure stability, we assume that Zα &lt; 2/π, where α denotes the fine structure constant. We are interested in the ground state energy in the simultaneous limit Z → ∞, α → 0 such that κ = Zα is fixed. The leading term in the energy asymptotics is independent of κ, it is given by the Thomas-Fermi energy of order Z7/3 and it is unchanged by including the self-generated magnetic field. We prove the first correction term to this energy, the so-called Scott correction of the form S(αZ)Z2. The current paper extends the result of Solovej et al. [Commun. Pure Appl. Math.LXIII, 39-118 (2010)] on the Scott correction for relativistic molecules to include a self-generated magnetic field. Furthermore, we show that the corresponding Scott correction function S, first identified by Solovej et al. [Commun. Pure Appl. Math.LXIII, 39-118 (2010)], is unchanged by including a magnetic field. We also prove new Lieb-Thirring inequalities for the relativistic kinetic energy with magnetic fields."}],"publisher":"American Institute of Physics","month":"09","publication":"Journal of Mathematical Physics","date_published":"2012-09-28T00:00:00Z","extern":1},{"publication_identifier":{"issn":["0302-9743"],"isbn":["9783642333859"],"eisbn":["9783642333866"],"eissn":["1611-3349"]},"year":"2012","doi":"10.1007/978-3-642-33386-6_14","acknowledgement":"This work has been partially supported by the French ANR project Veridyc","date_created":"2022-03-21T07:58:39Z","alternative_title":["LNCS"],"conference":{"name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2012-10-03","location":"Thiruvananthapuram, India","end_date":"2012-10-06"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"type":"conference","title":"Accurate invariant checking for programs manipulating lists and arrays with infinite data","series_title":"LNCS","publication_status":"published","day":"15","author":[{"first_name":"Ahmed","full_name":"Bouajjani, Ahmed","last_name":"Bouajjani"},{"last_name":"Dragoi","full_name":"Dragoi, Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara"},{"first_name":"Constantin","last_name":"Enea","full_name":"Enea, Constantin"},{"first_name":"Mihaela","last_name":"Sighireanu","full_name":"Sighireanu, Mihaela"}],"oa_version":"None","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."}],"date_published":"2012-10-15T00:00:00Z","publication":"Automated Technology for Verification and Analysis","date_updated":"2024-10-09T21:02:34Z","department":[{"_id":"ToHe"}],"scopus_import":"1","corr_author":"1","_id":"10903","status":"public","article_processing_charge":"No","page":"167-182","citation":{"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>","short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.","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.","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>","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>.","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."},"quality_controlled":"1","volume":7561,"publisher":"Springer","intvolume":"      7561","month":"10","place":"Berlin, Heidelberg"},{"publication_status":"published","type":"conference","title":"Strategy synthesis for multi-dimensional quantitative objectives","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2012-09-07","location":"Newcastle upon Tyne, United Kingdom","name":"CONCUR: Conference on Concurrency Theory","start_date":"2012-09-04"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_created":"2022-03-21T08:00:21Z","doi":"10.1007/978-3-642-32940-1_10","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.","year":"2012","publication_identifier":{"issn":["0302-9743"],"isbn":["9783642329395"],"eissn":["1611-3349"],"eisbn":["9783642329401"]},"editor":[{"first_name":"Maciej","last_name":"Koutny","full_name":"Koutny, Maciej"},{"first_name":"Irek","last_name":"Ulidowski","full_name":"Ulidowski, Irek"}],"publication":"CONCUR 2012 - Concurrency Theory","external_id":{"arxiv":["1201.5073"]},"date_published":"2012-09-15T00:00:00Z","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"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1201.5073"}],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Randour","full_name":"Randour, Mickael","first_name":"Mickael"},{"first_name":"Jean-François","last_name":"Raskin","full_name":"Raskin, Jean-François"}],"day":"15","status":"public","_id":"10904","corr_author":"1","scopus_import":"1","arxiv":1,"department":[{"_id":"KrCh"}],"related_material":{"record":[{"id":"2716","status":"public","relation":"later_version"}]},"oa":1,"date_updated":"2025-09-29T11:10:44Z","month":"09","place":"Berlin, Heidelberg","OA_place":"repository","intvolume":"      7454","publisher":"Springer","volume":7454,"quality_controlled":"1","OA_type":"green","citation":{"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>.","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>","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.","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>.","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>","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.","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."},"page":"115-131","ec_funded":1,"article_processing_charge":"No"},{"date_published":"2012-10-01T00:00:00Z","external_id":{"arxiv":["1604.08234"]},"publication":"Algorithms – ESA 2012","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."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08234"}],"oa_version":"Preprint","day":"01","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"first_name":"Sebastian","full_name":"Krinninger, Sebastian","last_name":"Krinninger"},{"first_name":"Danupon","full_name":"Nanongkai, Danupon","last_name":"Nanongkai"}],"publication_status":"published","language":[{"iso":"eng"}],"type":"conference","title":"Polynomial-time algorithms for energy games with special weight structures","project":[{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_created":"2022-03-21T08:01:45Z","alternative_title":["LNCS"],"conference":{"location":"Ljubljana, Slovenia","name":"ESA: European Symposium on Algorithms","start_date":"2012-09-10","end_date":"2012-09-12"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0302-9743"],"isbn":["9783642330896"],"eisbn":["9783642330902"],"eissn":["1611-3349"]},"year":"2012","doi":"10.1007/978-3-642-33090-2_27","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","month":"10","publisher":"Springer","intvolume":"      7501","citation":{"ieee":"K. Chatterjee, M. 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 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>.","ama":"Chatterjee K, Henzinger M, 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>","ista":"Chatterjee K, Henzinger M, 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.","short":"K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms – ESA 2012, Springer, 2012, pp. 301–312.","apa":"Chatterjee, K., Henzinger, M., 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>."},"volume":7501,"quality_controlled":"1","article_processing_charge":"No","ec_funded":1,"page":"301-312","_id":"10905","corr_author":"1","status":"public","department":[{"_id":"KrCh"}],"arxiv":1,"scopus_import":"1","oa":1,"related_material":{"record":[{"id":"535","status":"public","relation":"later_version"}]},"date_updated":"2025-09-29T13:18:37Z"},{"department":[{"_id":"ToHe"}],"ddc":["000"],"scopus_import":"1","corr_author":"1","_id":"10906","status":"public","date_updated":"2026-06-18T10:45:24Z","oa":1,"publisher":"Springer","intvolume":"      7214","month":"04","place":"Berlin, Heidelberg","article_processing_charge":"No","page":"549-551","citation":{"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.","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.","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>","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.","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>."},"volume":7214,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","title":"HSF(C): A software verifier based on Horn clauses","publication_status":"published","series_title":"LNCS","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642287565"],"issn":["0302-9743"],"isbn":["9783642287558"]},"year":"2012","editor":[{"first_name":"Cormac","last_name":"Flanagan","full_name":"Flanagan, Cormac"},{"last_name":"König","full_name":"König, Barbara","first_name":"Barbara"}],"doi":"10.1007/978-3-642-28756-5_46","date_created":"2022-03-21T08:03:30Z","alternative_title":["LNCS"],"conference":{"start_date":"2012-03-24","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Tallinn, Estonia","end_date":"2012-04-01"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"date_published":"2012-04-01T00:00:00Z","publication":"Tools and Algorithms for the Construction and Analysis of Systems","day":"01","author":[{"last_name":"Grebenshchikov","full_name":"Grebenshchikov, Sergey","first_name":"Sergey"},{"last_name":"Gupta","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh"},{"first_name":"Nuno P.","last_name":"Lopes","full_name":"Lopes, Nuno P."},{"full_name":"Popeea, Corneliu","last_name":"Popeea","first_name":"Corneliu"},{"full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko","first_name":"Andrey"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-642-28756-5_46"}],"oa_version":"Published Version"},{"date_updated":"2022-08-11T09:34:39Z","scopus_import":"1","arxiv":1,"_id":"11751","status":"public","article_processing_charge":"No","page":"5729-5734","citation":{"ama":"Lukas KC, Joshi G, Modic KA, Ren ZF, Opeil CP. Thermoelectric properties of Ho-doped Bi0.88Sb0.12. <i>Journal of Materials Science</i>. 2012;47(15):5729-5734. doi:<a href=\"https://doi.org/10.1007/s10853-012-6463-6\">10.1007/s10853-012-6463-6</a>","chicago":"Lukas, K. C., G. Joshi, Kimberly A Modic, Z. F. Ren, and C. P. Opeil. “Thermoelectric Properties of Ho-Doped Bi0.88Sb0.12.” <i>Journal of Materials Science</i>. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/s10853-012-6463-6\">https://doi.org/10.1007/s10853-012-6463-6</a>.","ieee":"K. C. Lukas, G. Joshi, K. A. Modic, Z. F. Ren, and C. P. Opeil, “Thermoelectric properties of Ho-doped Bi0.88Sb0.12,” <i>Journal of Materials Science</i>, vol. 47, no. 15. Springer Nature, pp. 5729–5734, 2012.","apa":"Lukas, K. C., Joshi, G., Modic, K. A., Ren, Z. F., &#38; Opeil, C. P. (2012). Thermoelectric properties of Ho-doped Bi0.88Sb0.12. <i>Journal of Materials Science</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10853-012-6463-6\">https://doi.org/10.1007/s10853-012-6463-6</a>","mla":"Lukas, K. C., et al. “Thermoelectric Properties of Ho-Doped Bi0.88Sb0.12.” <i>Journal of Materials Science</i>, vol. 47, no. 15, Springer Nature, 2012, pp. 5729–34, doi:<a href=\"https://doi.org/10.1007/s10853-012-6463-6\">10.1007/s10853-012-6463-6</a>.","ista":"Lukas KC, Joshi G, Modic KA, Ren ZF, Opeil CP. 2012. Thermoelectric properties of Ho-doped Bi0.88Sb0.12. Journal of Materials Science. 47(15), 5729–5734.","short":"K.C. Lukas, G. Joshi, K.A. Modic, Z.F. Ren, C.P. Opeil, Journal of Materials Science 47 (2012) 5729–5734."},"volume":47,"quality_controlled":"1","publisher":"Springer Nature","intvolume":"        47","extern":"1","month":"08","year":"2012","publication_identifier":{"issn":["0022-2461"],"eissn":["1573-4803"]},"doi":"10.1007/s10853-012-6463-6","date_created":"2022-08-08T08:28:20Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"type":"journal_article","title":"Thermoelectric properties of Ho-doped Bi0.88Sb0.12","article_type":"original","publication_status":"published","day":"01","author":[{"first_name":"K. C.","last_name":"Lukas","full_name":"Lukas, K. C."},{"full_name":"Joshi, G.","last_name":"Joshi","first_name":"G."},{"full_name":"Modic, Kimberly A","last_name":"Modic","first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147"},{"last_name":"Ren","full_name":"Ren, Z. F.","first_name":"Z. F."},{"last_name":"Opeil","full_name":"Opeil, C. P.","first_name":"C. P."}],"issue":"15","oa_version":"Preprint","abstract":[{"text":"The Seebeck coefficients, electrical resistivities, total thermal conductivities, and magnetization are reported for temperatures between 5 and 350 K for n-type Bi0.88Sb0.12 nano-composite alloys made by Ho-doping at the 0, 1, and 3 % atomic levels. The alloys were prepared using a dc hot-pressing method, and are shown to be single phase for both Ho contents with grain sizes on the average of 900 nm. We find the parent compound has a maximum of ZT = 0.28 at 231 K, while doping 1 % Ho increases the maximum ZT to 0.31 at 221 K and the 3 % doped sample suppresses the maximum ZT = 0.24 at a temperature of 260 K.","lang":"eng"}],"external_id":{"arxiv":["1201.6304"]},"date_published":"2012-08-01T00:00:00Z","publication":"Journal of Materials Science"},{"extern":"1","month":"12","publisher":"Springer Nature","intvolume":"      7695","citation":{"mla":"Dütting, Paul, et al. “Auctions with Heterogeneous Items and Budget Limits.” <i>8th International Workshop on Internet and Network Economics</i>, vol. 7695, Springer Nature, 2012, pp. 44–57, doi:<a href=\"https://doi.org/10.1007/978-3-642-35311-6_4\">10.1007/978-3-642-35311-6_4</a>.","apa":"Dütting, P., Henzinger, M., &#38; Starnberger, M. (2012). Auctions with heterogeneous items and budget limits. In <i>8th International Workshop on Internet and Network Economics</i> (Vol. 7695, pp. 44–57). Liverpool, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-35311-6_4\">https://doi.org/10.1007/978-3-642-35311-6_4</a>","ista":"Dütting P, Henzinger M, Starnberger M. 2012. Auctions with heterogeneous items and budget limits. 8th International Workshop on Internet and Network Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 7695, 44–57.","short":"P. Dütting, M. Henzinger, M. Starnberger, in:, 8th International Workshop on Internet and Network Economics, Springer Nature, 2012, pp. 44–57.","ama":"Dütting P, Henzinger M, Starnberger M. Auctions with heterogeneous items and budget limits. In: <i>8th International Workshop on Internet and Network Economics</i>. Vol 7695. Springer Nature; 2012:44–57. doi:<a href=\"https://doi.org/10.1007/978-3-642-35311-6_4\">10.1007/978-3-642-35311-6_4</a>","chicago":"Dütting, Paul, Monika Henzinger, and Martin Starnberger. “Auctions with Heterogeneous Items and Budget Limits.” In <i>8th International Workshop on Internet and Network Economics</i>, 7695:44–57. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-35311-6_4\">https://doi.org/10.1007/978-3-642-35311-6_4</a>.","ieee":"P. Dütting, M. Henzinger, and M. Starnberger, “Auctions with heterogeneous items and budget limits,” in <i>8th International Workshop on Internet and Network Economics</i>, Liverpool, United Kingdom, 2012, vol. 7695, pp. 44–57."},"volume":7695,"quality_controlled":"1","article_processing_charge":"No","page":"44–57","_id":"11794","status":"public","arxiv":1,"scopus_import":"1","related_material":{"record":[{"id":"11794","status":"public","relation":"later_version"}]},"oa":1,"date_updated":"2024-11-06T12:12:38Z","external_id":{"arxiv":["1209.6448"]},"date_published":"2012-12-01T00:00:00Z","publication":"8th International Workshop on Internet and Network Economics","abstract":[{"text":"We study individual rational, Pareto optimal, and incentive compatible mechanisms for auctions with heterogeneous items and budget limits. For multi-dimensional valuations we show that there can be no deterministic mechanism with these properties for divisible items. We use this to show that there can also be no randomized mechanism that achieves this for either divisible or indivisible items. For single-dimensional valuations we show that there can be no deterministic mechanism with these properties for indivisible items, but that there is a randomized mechanism that achieves this for either divisible or indivisible items. The impossibility results hold for public budgets, while the mechanism allows private budgets, which is in both cases the harder variant to show. While all positive results are polynomial-time algorithms, all negative results hold independent of complexity considerations.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1209.6448","open_access":"1"}],"oa_version":"Preprint","day":"01","author":[{"last_name":"Dütting","full_name":"Dütting, Paul","first_name":"Paul"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Starnberger, Martin","last_name":"Starnberger","first_name":"Martin"}],"publication_status":"published","language":[{"iso":"eng"}],"title":"Auctions with heterogeneous items and budget limits","type":"conference","date_created":"2022-08-11T11:32:25Z","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Liverpool, United Kingdom","name":"WINE: International Conference on Web and Internet Economics","start_date":"2012-12-11","end_date":"2012-12-14"},"publication_identifier":{"issn":["1611-3349"],"isbn":["9783642353109"]},"year":"2012","doi":"10.1007/978-3-642-35311-6_4"},{"date_updated":"2024-11-06T12:12:51Z","related_material":{"record":[{"id":"11795","status":"public","relation":"later_version"}]},"scopus_import":"1","status":"public","_id":"11795","page":"1–12","article_processing_charge":"No","volume":7392,"quality_controlled":"1","citation":{"ieee":"R. Colini-Baldeschi, M. Henzinger, S. Leonardi, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” in <i>39th International Colloquium on Automata, Languages, and Programming</i>, Warwick, United Kingdom, 2012, vol. 7392, pp. 1–12.","ama":"Colini-Baldeschi R, Henzinger M, Leonardi S, Starnberger M. On multiple keyword sponsored search auctions with budgets. In: <i>39th International Colloquium on Automata, Languages, and Programming</i>. Vol 7392. Springer Nature; 2012:1–12. doi:<a href=\"https://doi.org/10.1007/978-3-642-31585-5_1\">10.1007/978-3-642-31585-5_1</a>","chicago":"Colini-Baldeschi, Riccardo, Monika Henzinger, Stefano Leonardi, and Martin Starnberger. “On Multiple Keyword Sponsored Search Auctions with Budgets.” In <i>39th International Colloquium on Automata, Languages, and Programming</i>, 7392:1–12. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31585-5_1\">https://doi.org/10.1007/978-3-642-31585-5_1</a>.","ista":"Colini-Baldeschi R, Henzinger M, Leonardi S, Starnberger M. 2012. On multiple keyword sponsored search auctions with budgets. 39th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 7392, 1–12.","short":"R. Colini-Baldeschi, M. Henzinger, S. Leonardi, M. Starnberger, in:, 39th International Colloquium on Automata, Languages, and Programming, Springer Nature, 2012, pp. 1–12.","mla":"Colini-Baldeschi, Riccardo, et al. “On Multiple Keyword Sponsored Search Auctions with Budgets.” <i>39th International Colloquium on Automata, Languages, and Programming</i>, vol. 7392, Springer Nature, 2012, pp. 1–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-31585-5_1\">10.1007/978-3-642-31585-5_1</a>.","apa":"Colini-Baldeschi, R., Henzinger, M., Leonardi, S., &#38; Starnberger, M. (2012). On multiple keyword sponsored search auctions with budgets. In <i>39th International Colloquium on Automata, Languages, and Programming</i> (Vol. 7392, pp. 1–12). Warwick, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-31585-5_1\">https://doi.org/10.1007/978-3-642-31585-5_1</a>"},"intvolume":"      7392","publisher":"Springer Nature","month":"07","extern":"1","doi":"10.1007/978-3-642-31585-5_1","year":"2012","publication_identifier":{"issn":["0302-9743"],"isbn":["9783642315848"]},"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2012-07-09","location":"Warwick, United Kingdom","end_date":"2012-07-13"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_created":"2022-08-11T11:46:51Z","title":"On multiple keyword sponsored search auctions with budgets","type":"conference","language":[{"iso":"eng"}],"publication_status":"published","author":[{"last_name":"Colini-Baldeschi","full_name":"Colini-Baldeschi, Riccardo","first_name":"Riccardo"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Leonardi","full_name":"Leonardi, Stefano","first_name":"Stefano"},{"last_name":"Starnberger","full_name":"Starnberger, Martin","first_name":"Martin"}],"day":"01","oa_version":"None","abstract":[{"text":"We study multiple keyword sponsored search auctions with budgets. Each keyword has multiple ad slots with a click-through rate. The bidders have additive valuations, which are linear in the click-through rates, and budgets, which are restricting their overall payments. Additionally, the number of slots per keyword assigned to a bidder is bounded.\r\n\r\nWe show the following results: (1) We give the first mechanism for multiple keywords, where click-through rates differ among slots. Our mechanism is incentive compatible in expectation, individually rational in expectation, and Pareto optimal. (2) We study the combinatorial setting, where each bidder is only interested in a subset of the keywords. We give an incentive compatible, individually rational, Pareto optimal, and deterministic mechanism for identical click-through rates. (3) We give an impossibility result for incentive compatible, individually rational, Pareto optimal, and deterministic mechanisms for bidders with diminishing marginal valuations.","lang":"eng"}],"publication":"39th International Colloquium on Automata, Languages, and Programming","date_published":"2012-07-01T00:00:00Z"},{"year":"2012","acknowledgement":"Sebastian Faust acknowledges support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within part of this work was performed; and from the CFEM research center, supported by the Danish Strategic Research Council. \r\nSupported by the European Research Council/ERC Starting Grant 259668-PSPC.\r\n","doi":"10.1007/978-3-642-33027-8_13","date_created":"2018-12-11T11:55:25Z","alternative_title":["LNCS"],"conference":{"start_date":"2012-09-09","name":"CHES: Cryptographic Hardware and Embedded Systems","location":"Leuven, Belgium","end_date":"2012-09-12"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"title":"Practical leakage-resilient symmetric cryptography","type":"conference","project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668"}],"publication_status":"published","day":"01","author":[{"full_name":"Faust, Sebastian","last_name":"Faust","first_name":"Sebastian"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"},{"full_name":"Schipper, Joachim","last_name":"Schipper","first_name":"Joachim","id":"7BE863D4-E9CF-11E9-9EDB-90527418172C"}],"main_file_link":[{"url":"http://www.iacr.org/archive/ches2012/74280211/74280211.pdf","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Leakage resilient cryptography attempts to incorporate side-channel leakage into the black-box security model and designs cryptographic schemes that are provably secure within it. Informally, a scheme is leakage-resilient if it remains secure even if an adversary learns a bounded amount of arbitrary information about the schemes internal state. Unfortunately, most leakage resilient schemes are unnecessarily complicated in order to achieve strong provable security guarantees. As advocated by Yu et al. [CCS’10], this mostly is an artefact of the security proof and in practice much simpler construction may already suffice to protect against realistic side-channel attacks. In this paper, we show that indeed for simpler constructions leakage-resilience can be obtained when we aim for relaxed security notions where the leakage-functions and/or the inputs to the primitive are chosen non-adaptively. For example, we show that a three round Feistel network instantiated with a leakage resilient PRF yields a leakage resilient PRP if the inputs are chosen non-adaptively (This complements the result of Dodis and Pietrzak [CRYPTO’10] who show that if a adaptive queries are allowed, a superlogarithmic number of rounds is necessary.) We also show that a minor variation of the classical GGM construction gives a leakage resilient PRF if both, the leakage-function and the inputs, are chosen non-adaptively."}],"date_published":"2012-09-01T00:00:00Z","publication":" Conference proceedings CHES 2012","date_updated":"2021-01-12T06:54:58Z","oa":1,"publist_id":"5003","department":[{"_id":"KrPi"}],"scopus_import":1,"_id":"2048","status":"public","ec_funded":1,"page":"213 - 232","citation":{"ieee":"S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric cryptography,” in <i> Conference proceedings CHES 2012</i>, Leuven, Belgium, 2012, vol. 7428, pp. 213–232.","chicago":"Faust, Sebastian, Krzysztof Z Pietrzak, and Joachim Schipper. “Practical Leakage-Resilient Symmetric Cryptography.” In <i> Conference Proceedings CHES 2012</i>, 7428:213–32. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>.","ama":"Faust S, Pietrzak KZ, Schipper J. Practical leakage-resilient symmetric cryptography. In: <i> Conference Proceedings CHES 2012</i>. Vol 7428. Springer; 2012:213-232. doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>","short":"S. Faust, K.Z. Pietrzak, J. Schipper, in:,  Conference Proceedings CHES 2012, Springer, 2012, pp. 213–232.","ista":"Faust S, Pietrzak KZ, Schipper J. 2012. Practical leakage-resilient symmetric cryptography.  Conference proceedings CHES 2012. CHES: Cryptographic Hardware and Embedded Systems, LNCS, vol. 7428, 213–232.","mla":"Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.” <i> Conference Proceedings CHES 2012</i>, vol. 7428, Springer, 2012, pp. 213–32, doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>.","apa":"Faust, S., Pietrzak, K. Z., &#38; Schipper, J. (2012). Practical leakage-resilient symmetric cryptography. In <i> Conference proceedings CHES 2012</i> (Vol. 7428, pp. 213–232). Leuven, Belgium: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>"},"volume":7428,"quality_controlled":"1","publisher":"Springer","intvolume":"      7428","month":"09"},{"day":"09","oa_version":"None","abstract":[{"text":"This book constitutes the thoroughly refereed post-conference proceedings of the Third International Conference on Scale Space Methods and Variational Methods in Computer Vision, SSVM 2011, held in Ein-Gedi, Israel in May/June 2011.\r\nThe 24 revised full papers presented together with 44 poster papers were carefully reviewed and selected from 78 submissions. The papers are organized in topical sections on denoising and enhancement, segmentation, image representation and invariants, shape analysis, and optical flow. ","lang":"eng"}],"date_published":"2012-01-09T00:00:00Z","editor":[{"first_name":"Alfred M.","last_name":"Bruckstein","full_name":"Bruckstein, Alfred M."},{"full_name":"ter Haar Romeny, Bart M.","last_name":"ter Haar Romeny","first_name":"Bart M."},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730"},{"first_name":"Michael M.","last_name":"Bronstein","full_name":"Bronstein, Michael M."}],"year":"2012","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642247859"],"issn":["0302-9743"],"isbn":["9783642247842"]},"doi":"10.1007/978-3-642-24785-9","date_created":"2024-10-15T11:20:54Z","alternative_title":["Lecture Notes in Computer Science"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"title":"Scale Space and Variational Methods in Computer Vision","type":"book_editor","edition":"1","publication_status":"published","series_title":"LNCS","article_processing_charge":"No","page":"XIV, 798","citation":{"ama":"Bruckstein AM, ter Haar Romeny BM, Bronstein A, Bronstein MM, eds. <i>Scale Space and Variational Methods in Computer Vision</i>. Vol 6667. 1st ed. Berlin, Heidelberg: Springer Nature; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-24785-9\">10.1007/978-3-642-24785-9</a>","chicago":"Bruckstein, Alfred M., Bart M. ter Haar Romeny, Alexander Bronstein, and Michael M. Bronstein, eds. <i>Scale Space and Variational Methods in Computer Vision</i>. 1st ed. Vol. 6667. LNCS. Berlin, Heidelberg: Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-24785-9\">https://doi.org/10.1007/978-3-642-24785-9</a>.","ieee":"A. M. Bruckstein, B. M. ter Haar Romeny, A. Bronstein, and M. M. Bronstein, Eds., <i>Scale Space and Variational Methods in Computer Vision</i>, 1st ed., vol. 6667. Berlin, Heidelberg: Springer Nature, 2012.","apa":"Bruckstein, A. M., ter Haar Romeny, B. M., Bronstein, A., &#38; Bronstein, M. M. (Eds.). (2012). <i>Scale Space and Variational Methods in Computer Vision</i> (1st ed., Vol. 6667). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-24785-9\">https://doi.org/10.1007/978-3-642-24785-9</a>","mla":"Bruckstein, Alfred M., et al., editors. <i>Scale Space and Variational Methods in Computer Vision</i>. 1st ed., vol. 6667, Springer Nature, 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-24785-9\">10.1007/978-3-642-24785-9</a>.","ista":"Bruckstein AM, ter Haar Romeny BM, Bronstein A, Bronstein MM eds. 2012. Scale Space and Variational Methods in Computer Vision 1st ed., Berlin, Heidelberg: Springer Nature, XIV, 798p.","short":"A.M. Bruckstein, B.M. ter Haar Romeny, A. Bronstein, M.M. Bronstein, eds., Scale Space and Variational Methods in Computer Vision, 1st ed., Springer Nature, Berlin, Heidelberg, 2012."},"quality_controlled":"1","volume":6667,"publisher":"Springer Nature","intvolume":"      6667","extern":"1","place":"Berlin, Heidelberg","month":"01","date_updated":"2025-01-23T11:35:34Z","scopus_import":"1","_id":"18340","status":"public"},{"abstract":[{"text":"Similarity and correspondence are two fundamental archetype problems in shape analysis, encountered in numerous application in computer vision and pattern recognition. Many methods for shape similarity and correspondence boil down to the minimum-distortion correspondence problem, in which two shapes are endowed with certain structure, and one attempts to find the matching with smallest structure distortion between them. Defining structures invariant to some class of shape transformations results in an invariant minimum-distortion correspondence or similarity. In this paper, we model shapes using local and global structures, formulate the invariant correspondence problem as binary graph labeling, and show how different choice of structure results in invariance under various classes of deformations.","lang":"eng"}],"date_published":"2012-01-09T00:00:00Z","publication":"3rd International Conference on Scale Space and Variational Methods in Computer Vision","day":"09","author":[{"last_name":"Wang","full_name":"Wang, Chaohui","first_name":"Chaohui"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730"},{"first_name":"Nikos","full_name":"Paragios, Nikos","last_name":"Paragios"}],"oa_version":"None","language":[{"iso":"eng"}],"title":"Discrete minimum distortion correspondence problems for non-rigid shape matching","type":"conference","publication_status":"published","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642247859"],"issn":["0302-9743"],"isbn":["9783642247842"]},"year":"2012","doi":"10.1007/978-3-642-24785-9_49","date_created":"2024-10-15T11:20:54Z","alternative_title":["LNCS"],"conference":{"location":"Ein-Gedi, Israel","name":"SSVM: Scale Space and Variational Methods in Computer Vision","start_date":"2011-05-29","end_date":"2011-06-02"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","intvolume":"      6667","extern":"1","month":"01","place":"Berlin, Heidelberg","article_processing_charge":"No","page":"580 - 591","citation":{"ama":"Wang C, Bronstein MM, Bronstein AM, Paragios N. Discrete minimum distortion correspondence problems for non-rigid shape matching. In: <i>3rd International Conference on Scale Space and Variational Methods in Computer Vision</i>. Vol 6667. Berlin, Heidelberg: Springer Nature; 2012:580-591. doi:<a href=\"https://doi.org/10.1007/978-3-642-24785-9_49\">10.1007/978-3-642-24785-9_49</a>","chicago":"Wang, Chaohui, Michael M. Bronstein, Alex M. Bronstein, and Nikos Paragios. “Discrete Minimum Distortion Correspondence Problems for Non-Rigid Shape Matching.” In <i>3rd International Conference on Scale Space and Variational Methods in Computer Vision</i>, 6667:580–91. Berlin, Heidelberg: Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-24785-9_49\">https://doi.org/10.1007/978-3-642-24785-9_49</a>.","ieee":"C. Wang, M. M. Bronstein, A. M. Bronstein, and N. Paragios, “Discrete minimum distortion correspondence problems for non-rigid shape matching,” in <i>3rd International Conference on Scale Space and Variational Methods in Computer Vision</i>, Ein-Gedi, Israel, 2012, vol. 6667, pp. 580–591.","mla":"Wang, Chaohui, et al. “Discrete Minimum Distortion Correspondence Problems for Non-Rigid Shape Matching.” <i>3rd International Conference on Scale Space and Variational Methods in Computer Vision</i>, vol. 6667, Springer Nature, 2012, pp. 580–91, doi:<a href=\"https://doi.org/10.1007/978-3-642-24785-9_49\">10.1007/978-3-642-24785-9_49</a>.","apa":"Wang, C., Bronstein, M. M., Bronstein, A. M., &#38; Paragios, N. (2012). Discrete minimum distortion correspondence problems for non-rigid shape matching. In <i>3rd International Conference on Scale Space and Variational Methods in Computer Vision</i> (Vol. 6667, pp. 580–591). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-24785-9_49\">https://doi.org/10.1007/978-3-642-24785-9_49</a>","short":"C. Wang, M.M. Bronstein, A.M. Bronstein, N. Paragios, in:, 3rd International Conference on Scale Space and Variational Methods in Computer Vision, Springer Nature, Berlin, Heidelberg, 2012, pp. 580–591.","ista":"Wang C, Bronstein MM, Bronstein AM, Paragios N. 2012. Discrete minimum distortion correspondence problems for non-rigid shape matching. 3rd International Conference on Scale Space and Variational Methods in Computer Vision. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 6667, 580–591."},"volume":6667,"quality_controlled":"1","scopus_import":"1","_id":"18341","status":"public","date_updated":"2025-01-16T14:10:43Z"}]