[{"extern":"1","page":"396-409","intvolume":"      8668","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","last_name":"Biswas","full_name":"Biswas, Ranita"},{"first_name":"Partha","full_name":"Bhowmick, Partha","last_name":"Bhowmick"}],"place":"Berlin, Heidelberg","year":"2014","oa_version":"None","date_updated":"2019-01-24T13:22:49Z","date_published":"2014-01-01T00:00:00Z","type":"conference","publisher":"Springer","publication_identifier":{"isbn":["9783642387081","9783642387098"],"issn":["0302-9743","1611-3349"]},"series_title":"Lecture Notes in Computer Science","status":"public","doi":"10.1007/978-3-319-09955-2_33","language":[{"iso":"eng"}],"date_created":"2019-01-08T20:45:32Z","publication_status":"published","citation":{"ieee":"R. Biswas and P. Bhowmick, “On Finding Spherical Geodesic Paths and Circles in ℤ3,” vol. 8668. Springer, Berlin, Heidelberg, pp. 396–409, 2014.","mla":"Biswas, Ranita, and Partha Bhowmick. <i>On Finding Spherical Geodesic Paths and Circles in ℤ3</i>. Vol. 8668, Springer, 2014, pp. 396–409, doi:<a href=\"https://doi.org/10.1007/978-3-319-09955-2_33\">10.1007/978-3-319-09955-2_33</a>.","short":"R. Biswas, P. Bhowmick, 8668 (2014) 396–409.","chicago":"Biswas, Ranita, and Partha Bhowmick. “On Finding Spherical Geodesic Paths and Circles in ℤ3.” Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-09955-2_33\">https://doi.org/10.1007/978-3-319-09955-2_33</a>.","ista":"Biswas R, Bhowmick P. 2014. On Finding Spherical Geodesic Paths and Circles in ℤ3. 8668, 396–409.","ama":"Biswas R, Bhowmick P. On Finding Spherical Geodesic Paths and Circles in ℤ3. 2014;8668:396-409. doi:<a href=\"https://doi.org/10.1007/978-3-319-09955-2_33\">10.1007/978-3-319-09955-2_33</a>","apa":"Biswas, R., &#38; Bhowmick, P. (2014). On Finding Spherical Geodesic Paths and Circles in ℤ3. Presented at the DGCI: International Conference on Discrete Geometry for Computer Imagery, Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-319-09955-2_33\">https://doi.org/10.1007/978-3-319-09955-2_33</a>"},"abstract":[{"lang":"eng","text":"A discrete spherical geodesic path between two voxels s and t lying on a discrete sphere is a/the 1-connected shortest path from s to t, comprising voxels of the discrete sphere intersected by the real plane passing through s, t, and the center of the sphere. We show that the set of sphere voxels intersected by the aforesaid real plane always contains a 1-connected cycle passing through s and t, and each voxel in this set lies within an isothetic distance of 32 from the concerned plane. Hence, to compute the path, the algorithm starts from s, and iteratively computes each voxel p of the path from the predecessor of p. A novel number-theoretic property and the 48-symmetry of discrete sphere are used for searching the 1-connected voxels comprising the path. The algorithm is output-sensitive, having its time and space complexities both linear in the length of the path. It can be extended for constructing 1-connected discrete 3D circles of arbitrary orientations, specified by a few appropriate input parameters. Experimental results and related analysis demonstrate its efficiency and versatility."}],"conference":{"end_date":"2014-09-12","location":"Siena, Italy","start_date":"2014-09-10","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery"},"quality_controlled":"1","title":"On Finding Spherical Geodesic Paths and Circles in ℤ3","volume":8668,"_id":"5810"},{"quality_controlled":"1","title":"How to achieve the capacity of asymmetric channels","month":"10","_id":"6740","citation":{"mla":"Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.” <i>52nd Annual Allerton Conference on Communication, Control, and Computing</i>, IEEE, 2014, pp. 789–96, doi:<a href=\"https://doi.org/10.1109/allerton.2014.7028535\">10.1109/allerton.2014.7028535</a>.","short":"M. Mondelli, R. Urbanke, H. Hassani, in:, 52nd Annual Allerton Conference on Communication, Control, and Computing, IEEE, 2014, pp. 789–796.","ieee":"M. Mondelli, R. Urbanke, and H. Hassani, “How to achieve the capacity of asymmetric channels,” in <i>52nd Annual Allerton Conference on Communication, Control, and Computing</i>, Monticello, IL, United States, 2014, pp. 789–796.","ama":"Mondelli M, Urbanke R, Hassani H. How to achieve the capacity of asymmetric channels. In: <i>52nd Annual Allerton Conference on Communication, Control, and Computing</i>. IEEE; 2014:789-796. doi:<a href=\"https://doi.org/10.1109/allerton.2014.7028535\">10.1109/allerton.2014.7028535</a>","apa":"Mondelli, M., Urbanke, R., &#38; Hassani, H. (2014). How to achieve the capacity of asymmetric channels. In <i>52nd Annual Allerton Conference on Communication, Control, and Computing</i> (pp. 789–796). Monticello, IL, United States: IEEE. <a href=\"https://doi.org/10.1109/allerton.2014.7028535\">https://doi.org/10.1109/allerton.2014.7028535</a>","chicago":"Mondelli, Marco, Rudiger Urbanke, and Hamed Hassani. “How to Achieve the Capacity of Asymmetric Channels.” In <i>52nd Annual Allerton Conference on Communication, Control, and Computing</i>, 789–96. IEEE, 2014. <a href=\"https://doi.org/10.1109/allerton.2014.7028535\">https://doi.org/10.1109/allerton.2014.7028535</a>.","ista":"Mondelli M, Urbanke R, Hassani H. 2014. How to achieve the capacity of asymmetric channels. 52nd Annual Allerton Conference on Communication, Control, and Computing. Allerton Conference on Communication, Control, and Computing, 789–796."},"related_material":{"record":[{"relation":"later_version","status":"public","id":"6678"}]},"abstract":[{"lang":"eng","text":"We describe coding techniques that achieve the capacity of a discrete memoryless asymmetric channel. To do so, we discuss how recent advances in coding for symmetric channels yield more efficient solutions also for the asymmetric case. In more detail, we consider three basic approaches. The first one is Gallager's scheme that concatenates a linear code with a non-linear mapper, in order to bias the input distribution. We explicitly show that both polar codes and spatially coupled codes can be employed in this scenario. Further, we derive a scaling law between the gap to capacity, the cardinality of channel input and output alphabets, and the required size of the mapper. The second one is an integrated approach in which the coding scheme is used both for source coding, in order to create codewords with the capacity-achieving distribution, and for channel coding, in order to provide error protection. Such a technique has been recently introduced by Honda and Yamamoto in the context of polar codes, and we show how to apply it also to the design of sparse graph codes. The third approach is based on an idea due to Böcherer and Mathar and separates completely the two tasks of source coding and channel coding by “chaining” together several codewords. We prove that we can combine any suitable source code with any suitable channel code in order to provide optimal schemes for asymmetric channels. In particular, polar codes and spatially coupled codes fulfill the required conditions."}],"conference":{"start_date":"2014-09-30","name":"Allerton Conference on Communication, Control, and Computing","end_date":"2014-10-03","location":"Monticello, IL, United States"},"publication_status":"published","arxiv":1,"language":[{"iso":"eng"}],"doi":"10.1109/allerton.2014.7028535","external_id":{"arxiv":["1406.7373"]},"date_created":"2019-07-31T07:24:23Z","oa":1,"publication_identifier":{"eisbn":["978-1-4799-8009-3"]},"status":"public","day":"01","main_file_link":[{"url":"https://arxiv.org/abs/1406.7373","open_access":"1"}],"publisher":"IEEE","type":"conference","oa_version":"Preprint","year":"2014","date_updated":"2023-02-23T12:49:36Z","date_published":"2014-10-01T00:00:00Z","extern":"1","page":"789-796","author":[{"orcid":"0000-0002-3242-7020","last_name":"Mondelli","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"first_name":"Rudiger","last_name":"Urbanke","full_name":"Urbanke, Rudiger"},{"last_name":"Hassani","full_name":"Hassani, Hamed","first_name":"Hamed"}],"publication":"52nd Annual Allerton Conference on Communication, Control, and Computing","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"doi":"10.1109/twc.2014.020914.130669","date_created":"2019-07-31T09:05:07Z","publication_status":"published","citation":{"mla":"Mondelli, Marco, et al. “Joint Power Allocation and Path Selection for Multi-Hop Noncoherent Decode and Forward UWB Communications.” <i>IEEE Transactions on Wireless Communications</i>, vol. 13, no. 3, IEEE, 2014, pp. 1397–409, doi:<a href=\"https://doi.org/10.1109/twc.2014.020914.130669\">10.1109/twc.2014.020914.130669</a>.","short":"M. Mondelli, Q. Zhou, V. Lottici, X. Ma, IEEE Transactions on Wireless Communications 13 (2014) 1397–1409.","ieee":"M. Mondelli, Q. Zhou, V. Lottici, and X. Ma, “Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications,” <i>IEEE Transactions on Wireless Communications</i>, vol. 13, no. 3. IEEE, pp. 1397–1409, 2014.","ama":"Mondelli M, Zhou Q, Lottici V, Ma X. Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications. <i>IEEE Transactions on Wireless Communications</i>. 2014;13(3):1397-1409. doi:<a href=\"https://doi.org/10.1109/twc.2014.020914.130669\">10.1109/twc.2014.020914.130669</a>","apa":"Mondelli, M., Zhou, Q., Lottici, V., &#38; Ma, X. (2014). Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications. <i>IEEE Transactions on Wireless Communications</i>. IEEE. <a href=\"https://doi.org/10.1109/twc.2014.020914.130669\">https://doi.org/10.1109/twc.2014.020914.130669</a>","chicago":"Mondelli, Marco, Qi Zhou, Vincenzo Lottici, and Xiaoli Ma. “Joint Power Allocation and Path Selection for Multi-Hop Noncoherent Decode and Forward UWB Communications.” <i>IEEE Transactions on Wireless Communications</i>. IEEE, 2014. <a href=\"https://doi.org/10.1109/twc.2014.020914.130669\">https://doi.org/10.1109/twc.2014.020914.130669</a>.","ista":"Mondelli M, Zhou Q, Lottici V, Ma X. 2014. Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications. IEEE Transactions on Wireless Communications. 13(3), 1397–1409."},"abstract":[{"text":"With the aim of extending the coverage and improving the performance of impulse radio ultra-wideband (UWB) systems, this paper focuses on developing a novel single differential encoded decode and forward (DF) non-cooperative relaying scheme (NCR). To favor simple receiver structures, differential noncoherent detection is employed which enables effective energy capture without any channel estimation. Putting emphasis on the general case of multi-hop relaying, we illustrate an original algorithm for the joint power allocation and path selection (JPAPS), minimizing an approximate expression of the overall bit error rate (BER). In particular, after deriving a closed-form power allocation strategy, the optimal path selection is reduced to a shortest path problem on a connected graph, which can be solved without any topology information with complexity O(N 3 ), N being the number of available relays of the network. An approximate scheme is also presented, which reduces the complexity to O(N 2 ) while showing a negligible performance loss, and for benchmarking purposes, an exhaustive-search based multi-hop DF cooperative strategy is derived. Simulation results for various network setups corroborate the effectiveness of the proposed low-complexity JPAPS algorithm, which favorably compares to existing AF and DF relaying methods.","lang":"eng"}],"month":"03","quality_controlled":"1","title":"Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications","volume":13,"_id":"6744","intvolume":"        13","page":"1397-1409","extern":"1","publication":"IEEE Transactions on Wireless Communications","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-3242-7020","last_name":"Mondelli","full_name":"Mondelli, Marco","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"last_name":"Zhou","full_name":"Zhou, Qi","first_name":"Qi"},{"full_name":"Lottici, Vincenzo","last_name":"Lottici","first_name":"Vincenzo"},{"first_name":"Xiaoli","last_name":"Ma","full_name":"Ma, Xiaoli"}],"date_updated":"2021-01-12T08:08:48Z","oa_version":"None","year":"2014","date_published":"2014-03-20T00:00:00Z","issue":"3","type":"journal_article","day":"20","publisher":"IEEE","status":"public"},{"type":"book","day":"01","publisher":"Springer Nature","edition":"1","status":"public","series_title":"SpringerBriefs in Applied Sciences and Technology","publication_identifier":{"eisbn":["9-783-3190-5957-0"],"isbn":["9-783-3190-5956-3"],"issn":["2191-530X"],"eissn":["2191-5318"]},"scopus_import":"1","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","place":"Cham","page":"IX, 110","date_published":"2014-01-01T00:00:00Z","oa_version":"None","year":"2014","date_updated":"2022-03-04T07:47:54Z","article_processing_charge":"No","abstract":[{"lang":"eng","text":"This monograph presents a short course in computational geometry and topology. In the first part the book covers Voronoi diagrams and Delaunay triangulations, then it presents the theory of alpha complexes which play a crucial role in biology. The central part of the book is the homology theory and their computation, including the theory of persistence which is indispensable for applications, e.g. shape reconstruction. The target audience comprises researchers and practitioners in mathematics, biology, neuroscience and computer science, but the book may also be beneficial to graduate students of these fields."}],"citation":{"ieee":"H. Edelsbrunner, <i>A Short Course in Computational Geometry and Topology</i>, 1st ed. Cham: Springer Nature, 2014.","mla":"Edelsbrunner, Herbert. <i>A Short Course in Computational Geometry and Topology</i>. 1st ed., Springer Nature, 2014, doi:<a href=\"https://doi.org/10.1007/978-3-319-05957-0\">10.1007/978-3-319-05957-0</a>.","short":"H. Edelsbrunner, A Short Course in Computational Geometry and Topology, 1st ed., Springer Nature, Cham, 2014.","chicago":"Edelsbrunner, Herbert. <i>A Short Course in Computational Geometry and Topology</i>. 1st ed. SpringerBriefs in Applied Sciences and Technology. Cham: Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-319-05957-0\">https://doi.org/10.1007/978-3-319-05957-0</a>.","ista":"Edelsbrunner H. 2014. A Short Course in Computational Geometry and Topology 1st ed., Cham: Springer Nature, IX, 110p.","ama":"Edelsbrunner H. <i>A Short Course in Computational Geometry and Topology</i>. 1st ed. Cham: Springer Nature; 2014. doi:<a href=\"https://doi.org/10.1007/978-3-319-05957-0\">10.1007/978-3-319-05957-0</a>","apa":"Edelsbrunner, H. (2014). <i>A Short Course in Computational Geometry and Topology</i> (1st ed.). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-05957-0\">https://doi.org/10.1007/978-3-319-05957-0</a>"},"related_material":{"link":[{"description":"available as eBook via catalog IST BookList","relation":"other","url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=356106"},{"relation":"other","url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=373842","description":"available via catalog IST BookList"}]},"_id":"6853","quality_controlled":"1","title":"A Short Course in Computational Geometry and Topology","month":"01","department":[{"_id":"HeEd"}],"date_created":"2019-09-06T09:22:33Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-05957-0","alternative_title":["SpringerBriefs in Applied Sciences and Technology"],"publication_status":"published"},{"date_published":"2014-01-29T00:00:00Z","oa_version":"None","year":"2014","date_updated":"2021-01-12T08:12:53Z","publication":"The Journal of Physical Chemistry C","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Li","full_name":"Li, Chunmei","first_name":"Chunmei"},{"last_name":"Fontaine","full_name":"Fontaine, Olivier","first_name":"Olivier"},{"first_name":"Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","full_name":"Freunberger, Stefan Alexander","last_name":"Freunberger","orcid":"0000-0003-2902-5319"},{"first_name":"Lee","last_name":"Johnson","full_name":"Johnson, Lee"},{"first_name":"Sylvie","full_name":"Grugeon, Sylvie","last_name":"Grugeon"},{"first_name":"Stéphane","last_name":"Laruelle","full_name":"Laruelle, Stéphane"},{"first_name":"Peter G.","last_name":"Bruce","full_name":"Bruce, Peter G."},{"full_name":"Armand, Michel","last_name":"Armand","first_name":"Michel"}],"extern":"1","page":"3393-3401","intvolume":"       118","status":"public","publication_identifier":{"issn":["1932-7447","1932-7455"]},"type":"journal_article","publisher":"ACS","day":"29","issue":"7","publication_status":"published","date_created":"2020-01-15T12:17:28Z","language":[{"iso":"eng"}],"doi":"10.1021/jp4093805","article_type":"original","volume":118,"_id":"7301","quality_controlled":"1","title":"Aprotic Li–O2 battery: Influence of complexing agents on oxygen reduction in an aprotic solvent","month":"01","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Several problems arise at the O2 (positive) electrode in the Li-air battery, including solvent/electrode decomposition and electrode passivation by insulating Li2O2. Progress partially depends on exploring the basic electrochemistry of O2 reduction. Here we describe the effect of complexing-cations on the electrochemical reduction of O2 in DMSO in the presence and absence of a Li salt. The solubility of alkaline peroxides in DMSO is enhanced by the complexing-cations, consistent with their strong interaction with reduced O2. The complexing-cations also increase the rate of the 1-electron O2 reduction to O2•– by up to six-fold (k° = 2.4 ×10–3 to 1.5 × 10–2 cm s–1) whether or not Li+ ions are present. In the absence of Li+, the complexing-cations also promote the reduction of O2•– to O22–. In the presence of Li+ and complexing-cations, and despite the interaction of the reduced O2 with the latter, SERS confirms that the product is still Li2O2."}],"citation":{"ama":"Li C, Fontaine O, Freunberger SA, et al. Aprotic Li–O2 battery: Influence of complexing agents on oxygen reduction in an aprotic solvent. <i>The Journal of Physical Chemistry C</i>. 2014;118(7):3393-3401. doi:<a href=\"https://doi.org/10.1021/jp4093805\">10.1021/jp4093805</a>","apa":"Li, C., Fontaine, O., Freunberger, S. A., Johnson, L., Grugeon, S., Laruelle, S., … Armand, M. (2014). Aprotic Li–O2 battery: Influence of complexing agents on oxygen reduction in an aprotic solvent. <i>The Journal of Physical Chemistry C</i>. ACS. <a href=\"https://doi.org/10.1021/jp4093805\">https://doi.org/10.1021/jp4093805</a>","chicago":"Li, Chunmei, Olivier Fontaine, Stefan Alexander Freunberger, Lee Johnson, Sylvie Grugeon, Stéphane Laruelle, Peter G. Bruce, and Michel Armand. “Aprotic Li–O2 Battery: Influence of Complexing Agents on Oxygen Reduction in an Aprotic Solvent.” <i>The Journal of Physical Chemistry C</i>. ACS, 2014. <a href=\"https://doi.org/10.1021/jp4093805\">https://doi.org/10.1021/jp4093805</a>.","ista":"Li C, Fontaine O, Freunberger SA, Johnson L, Grugeon S, Laruelle S, Bruce PG, Armand M. 2014. Aprotic Li–O2 battery: Influence of complexing agents on oxygen reduction in an aprotic solvent. The Journal of Physical Chemistry C. 118(7), 3393–3401.","mla":"Li, Chunmei, et al. “Aprotic Li–O2 Battery: Influence of Complexing Agents on Oxygen Reduction in an Aprotic Solvent.” <i>The Journal of Physical Chemistry C</i>, vol. 118, no. 7, ACS, 2014, pp. 3393–401, doi:<a href=\"https://doi.org/10.1021/jp4093805\">10.1021/jp4093805</a>.","short":"C. Li, O. Fontaine, S.A. Freunberger, L. Johnson, S. Grugeon, S. Laruelle, P.G. Bruce, M. Armand, The Journal of Physical Chemistry C 118 (2014) 3393–3401.","ieee":"C. Li <i>et al.</i>, “Aprotic Li–O2 battery: Influence of complexing agents on oxygen reduction in an aprotic solvent,” <i>The Journal of Physical Chemistry C</i>, vol. 118, no. 7. ACS, pp. 3393–3401, 2014."}},{"intvolume":"        11","page":"773 - 784","extern":"1","author":[{"last_name":"Cadavid","full_name":"Cadavid, Doris","first_name":"Doris"},{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Umberto","full_name":"Anselmi Tamburini, Umberto","last_name":"Anselmi Tamburini"},{"first_name":"Oscar","full_name":"Durá, Oscar","last_name":"Durá"},{"full_name":"De La Torre, Marco","last_name":"De La Torre","first_name":"Marco"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"International Journal of Nanotechnology","date_updated":"2021-01-12T07:43:44Z","year":"2014","oa_version":"None","date_published":"2014-01-01T00:00:00Z","issue":"9-11","publisher":"Inderscience Enterprises Limited ","type":"journal_article","day":"01","status":"public","article_type":"original","doi":"10.1504/IJNT.2014.063787","publist_id":"7476","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:45:57Z","publication_status":"published","citation":{"ista":"Cadavid D, Ibáñez M, Anselmi Tamburini U, Durá O, De La Torre M, Cabot A. 2014. Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites. International Journal of Nanotechnology. 11(9–11), 773–784.","chicago":"Cadavid, Doris, Maria Ibáñez, Umberto Anselmi Tamburini, Oscar Durá, Marco De La Torre, and Andreu Cabot. “Thermoelectric Properties of Bottom up Assembled Bi2S 3-XTex Nanocomposites.” <i>International Journal of Nanotechnology</i>. Inderscience Enterprises Limited , 2014. <a href=\"https://doi.org/10.1504/IJNT.2014.063787\">https://doi.org/10.1504/IJNT.2014.063787</a>.","apa":"Cadavid, D., Ibáñez, M., Anselmi Tamburini, U., Durá, O., De La Torre, M., &#38; Cabot, A. (2014). Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites. <i>International Journal of Nanotechnology</i>. Inderscience Enterprises Limited . <a href=\"https://doi.org/10.1504/IJNT.2014.063787\">https://doi.org/10.1504/IJNT.2014.063787</a>","ama":"Cadavid D, Ibáñez M, Anselmi Tamburini U, Durá O, De La Torre M, Cabot A. Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites. <i>International Journal of Nanotechnology</i>. 2014;11(9-11):773-784. doi:<a href=\"https://doi.org/10.1504/IJNT.2014.063787\">10.1504/IJNT.2014.063787</a>","ieee":"D. Cadavid, M. Ibáñez, U. Anselmi Tamburini, O. Durá, M. De La Torre, and A. Cabot, “Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites,” <i>International Journal of Nanotechnology</i>, vol. 11, no. 9–11. Inderscience Enterprises Limited , pp. 773–784, 2014.","short":"D. Cadavid, M. Ibáñez, U. Anselmi Tamburini, O. Durá, M. De La Torre, A. Cabot, International Journal of Nanotechnology 11 (2014) 773–784.","mla":"Cadavid, Doris, et al. “Thermoelectric Properties of Bottom up Assembled Bi2S 3-XTex Nanocomposites.” <i>International Journal of Nanotechnology</i>, vol. 11, no. 9–11, Inderscience Enterprises Limited , 2014, pp. 773–84, doi:<a href=\"https://doi.org/10.1504/IJNT.2014.063787\">10.1504/IJNT.2014.063787</a>."},"abstract":[{"lang":"eng","text":"Bi2S3-xTex bulk nanocomposites with crystal domain sizes in the range from 50 nm to 100 nm were obtained from the reaction of Bi2S3 nanorods with Te powder. The thermoelectric properties of the obtained nanocomposites were analysed in the temperature range from 0°C to 300°C. We observed how the thermoelectric properties of the material improved with the annealing temperature, being a spark plasma sintering process needed to maintain the material nanostructuration while maximising its electrical properties. Finally thermoelectric dimensionless figures of merit ZT up to 0.42 were obtained before any charge carrier concentration optimisation. Copyright © 2014 Inderscience Enterprises Ltd.\r\n\r\n"}],"article_processing_charge":"No","month":"01","title":"Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites","quality_controlled":"1","volume":11,"_id":"348"},{"date_published":"2014-03-03T00:00:00Z","date_updated":"2021-01-12T07:44:26Z","oa_version":"None","year":"2014","author":[{"first_name":"Tirma","last_name":"Herranz","full_name":"Herranz, Tirma"},{"orcid":"0000-0001-5013-2843","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","last_name":"Ibáñez"},{"full_name":"Gómez De La Fuente, José","last_name":"Gómez De La Fuente","first_name":"José"},{"first_name":"Francisco","full_name":"Pérez Alonso, Francisco","last_name":"Pérez Alonso"},{"first_name":"Miguel","last_name":"Peña","full_name":"Peña, Miguel"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"},{"last_name":"Rojas","full_name":"Rojas, Sergio","first_name":"Sergio"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"ChemElectroChem","intvolume":"         1","page":"885 - 895","extern":"1","status":"public","acknowledgement":"The Spanish Ministry of Science and Innovation (Project ENE2010–15381) and the CSIC (Project 201080E116) are acknowledged for financial support.","issue":"5","publisher":"Wiley-Blackwell","type":"journal_article","day":"03","publication_status":"published","date_created":"2018-12-11T11:46:00Z","article_type":"original","doi":"10.1002/celc.201300254","publist_id":"7474","language":[{"iso":"eng"}],"_id":"358","volume":1,"month":"03","title":"In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles","quality_controlled":"1","article_processing_charge":"No","abstract":[{"text":"Monodispersed Pt3Sn nanoparticles were prepared through a mild thermal synthesis in the presence of surfactants. The performance of Pt3Sn for the electrooxidation of ethanol and adsorbed carbon monoxide (COad) in acid medium was studied by a combination of electrochemical and insitu spectroscopic methods, namely, infrared reflection absorption spectroscopy and differential electrochemical mass spectrometry (DEMS), and the results were compared to those obtained with the use of Pt black. The formation of the Pt3Sn solid solution promoted the oxidation of COad at less-positive potentials than those required for Pt black. Also, the electrooxidation of ethanol, especially at lower potentials, was more favorable with Pt3Sn, as deduced from the higher faradaic currents recorded during the ethanol oxidation reaction (EOR). However, the distribution of products as deduced by DEMS analysis suggested that the formation of C1 products, CO2 inclusive, is less significant on Pt3Sn than on Pt. In fact, the higher faradaic current recorded with the former catalyst can be attributed to the greater amounts of acetaldehyde and acetic acid formed. After the EOR, the surface of both Pt and Pt3Sn remained covered by ethanol adsorbates. Whereas C2 fragments were the main adsorbates at the surface of Pt3Sn after the EOR, both C1 and C2 species remained adsorbed at Pt black.","lang":"eng"}],"citation":{"ieee":"T. Herranz <i>et al.</i>, “In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles,” <i>ChemElectroChem</i>, vol. 1, no. 5. Wiley-Blackwell, pp. 885–895, 2014.","mla":"Herranz, Tirma, et al. “In Situ Study of Ethanol Electrooxidation on Monodispersed Pt Inf 3 Inf Sn Nanoparticles.” <i>ChemElectroChem</i>, vol. 1, no. 5, Wiley-Blackwell, 2014, pp. 885–95, doi:<a href=\"https://doi.org/10.1002/celc.201300254\">10.1002/celc.201300254</a>.","short":"T. Herranz, M. Ibáñez, J. Gómez De La Fuente, F. Pérez Alonso, M. Peña, A. Cabot, S. Rojas, ChemElectroChem 1 (2014) 885–895.","ista":"Herranz T, Ibáñez M, Gómez De La Fuente J, Pérez Alonso F, Peña M, Cabot A, Rojas S. 2014. In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles. ChemElectroChem. 1(5), 885–895.","chicago":"Herranz, Tirma, Maria Ibáñez, José Gómez De La Fuente, Francisco Pérez Alonso, Miguel Peña, Andreu Cabot, and Sergio Rojas. “In Situ Study of Ethanol Electrooxidation on Monodispersed Pt Inf 3 Inf Sn Nanoparticles.” <i>ChemElectroChem</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/celc.201300254\">https://doi.org/10.1002/celc.201300254</a>.","apa":"Herranz, T., Ibáñez, M., Gómez De La Fuente, J., Pérez Alonso, F., Peña, M., Cabot, A., &#38; Rojas, S. (2014). In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles. <i>ChemElectroChem</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/celc.201300254\">https://doi.org/10.1002/celc.201300254</a>","ama":"Herranz T, Ibáñez M, Gómez De La Fuente J, et al. In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles. <i>ChemElectroChem</i>. 2014;1(5):885-895. doi:<a href=\"https://doi.org/10.1002/celc.201300254\">10.1002/celc.201300254</a>"}},{"file":[{"relation":"main_file","access_level":"open_access","checksum":"dab6ab36a5f6af94f2b597e6404ed11d","content_type":"application/pdf","date_updated":"2020-07-14T12:45:28Z","file_id":"4999","date_created":"2018-12-12T10:13:17Z","file_name":"IST-2016-682-v1+1_578.pdf","creator":"system","file_size":492310}],"oa":1,"file_date_updated":"2020-07-14T12:45:28Z","author":[{"last_name":"Gazi","full_name":"Gazi, Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter"},{"orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"},{"first_name":"Michal","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","full_name":"Rybar, Michal","last_name":"Rybar"}],"scopus_import":"1","intvolume":"      8616","ec_funded":1,"volume":8616,"quality_controlled":"1","abstract":[{"lang":"eng","text":"NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). Security proofs and attacks for NMAC can typically be lifted to HMAC. NMAC was introduced by Bellare, Canetti and Krawczyk [Crypto'96], who proved it to be a secure pseudorandom function (PRF), and thus also a MAC, assuming that (1) f is a PRF and (2) the function we get when cascading f is weakly collision-resistant. Unfortunately, HMAC is typically instantiated with cryptographic hash functions like MD5 or SHA-1 for which (2) has been found to be wrong. To restore the provable guarantees for NMAC, Bellare [Crypto'06] showed its security based solely on the assumption that f is a PRF, albeit via a non-uniform reduction. - Our first contribution is a simpler and uniform proof for this fact: If f is an ε-secure PRF (against q queries) and a δ-non-adaptively secure PRF (against q queries), then NMAC f is an (ε+ℓqδ)-secure PRF against q queries of length at most ℓ blocks each. - We then show that this ε+ℓqδ bound is basically tight. For the most interesting case where ℓqδ ≥ ε we prove this by constructing an f for which an attack with advantage ℓqδ exists. This also violates the bound O(ℓε) on the PRF-security of NMAC recently claimed by Koblitz and Menezes. - Finally, we analyze the PRF-security of a modification of NMAC called NI [An and Bellare, Crypto'99] that differs mainly by using a compression function with an additional keying input. This avoids the constant rekeying on multi-block messages in NMAC and allows for a security proof starting by the standard switch from a PRF to a random function, followed by an information-theoretic analysis. We carry out such an analysis, obtaining a tight ℓq2/2 c bound for this step, improving over the trivial bound of ℓ2q2/2c. The proof borrows combinatorial techniques originally developed for proving the security of CBC-MAC [Bellare et al., Crypto'05]."}],"editor":[{"first_name":"Juan","full_name":"Garay, Juan","last_name":"Garay"},{"first_name":"Rosario","full_name":"Gennaro, Rosario","last_name":"Gennaro"}],"publication_status":"published","date_created":"2018-12-11T11:55:36Z","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"corr_author":"1","status":"public","issue":"1","type":"conference","publisher":"Springer","day":"01","has_accepted_license":"1","date_published":"2014-01-01T00:00:00Z","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"date_updated":"2026-04-08T14:18:39Z","oa_version":"Submitted Version","year":"2014","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"113 - 130","_id":"2082","month":"01","title":"The exact PRF-security of NMAC and HMAC","conference":{"location":"Santa Barbara, USA","end_date":"2014-08-21","name":"CRYPTO: International Cryptology Conference","start_date":"2014-08-17"},"related_material":{"record":[{"id":"838","status":"public","relation":"dissertation_contains"}]},"citation":{"ama":"Gazi P, Pietrzak KZ, Rybar M. The exact PRF-security of NMAC and HMAC. In: Garay J, Gennaro R, eds. Vol 8616. Springer; 2014:113-130. doi:<a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">10.1007/978-3-662-44371-2_7</a>","apa":"Gazi, P., Pietrzak, K. Z., &#38; Rybar, M. (2014). The exact PRF-security of NMAC and HMAC. In J. Garay &#38; R. Gennaro (Eds.) (Vol. 8616, pp. 113–130). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">https://doi.org/10.1007/978-3-662-44371-2_7</a>","chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact PRF-Security of NMAC and HMAC.” edited by Juan Garay and Rosario Gennaro, 8616:113–30. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">https://doi.org/10.1007/978-3-662-44371-2_7</a>.","ista":"Gazi P, Pietrzak KZ, Rybar M. 2014. The exact PRF-security of NMAC and HMAC. CRYPTO: International Cryptology Conference, LNCS, vol. 8616, 113–130.","short":"P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer, 2014, pp. 113–130.","mla":"Gazi, Peter, et al. <i>The Exact PRF-Security of NMAC and HMAC</i>. Edited by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30, doi:<a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">10.1007/978-3-662-44371-2_7</a>.","ieee":"P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact PRF-security of NMAC and HMAC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA, 2014, vol. 8616, no. 1, pp. 113–130."},"ddc":["000","004"],"pubrep_id":"682","alternative_title":["LNCS"],"publist_id":"4955","doi":"10.1007/978-3-662-44371-2_7"},{"ddc":["510"],"pubrep_id":"534","doi":"10.1145/2582112.2582134","publist_id":"4847","_id":"2159","title":"Eliminating Tverberg points, I. An analogue of the Whitney trick","month":"06","conference":{"end_date":"2014-06-11","location":"Kyoto, Japan","start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry"},"citation":{"chicago":"Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 171–80. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582134\">https://doi.org/10.1145/2582112.2582134</a>.","ista":"Mabillard I, Wagner U. 2014. Eliminating Tverberg points, I. An analogue of the Whitney trick. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 171–180.","ama":"Mabillard I, Wagner U. Eliminating Tverberg points, I. An analogue of the Whitney trick. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:171-180. doi:<a href=\"https://doi.org/10.1145/2582112.2582134\">10.1145/2582112.2582134</a>","apa":"Mabillard, I., &#38; Wagner, U. (2014). Eliminating Tverberg points, I. An analogue of the Whitney trick. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 171–180). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582134\">https://doi.org/10.1145/2582112.2582134</a>","ieee":"I. Mabillard and U. Wagner, “Eliminating Tverberg points, I. An analogue of the Whitney trick,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 171–180.","mla":"Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 171–80, doi:<a href=\"https://doi.org/10.1145/2582112.2582134\">10.1145/2582112.2582134</a>.","short":"I. Mabillard, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 171–180."},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1123"}]},"date_published":"2014-06-08T00:00:00Z","has_accepted_license":"1","year":"2014","oa_version":"Submitted Version","date_updated":"2026-04-08T14:24:22Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"171 - 180","status":"public","type":"conference","publisher":"ACM","day":"08","publication_status":"published","department":[{"_id":"UlWa"}],"date_created":"2018-12-11T11:56:03Z","corr_author":"1","language":[{"iso":"eng"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"Motivated by topological Tverberg-type problems, we consider multiple (double, triple, and higher multiplicity) selfintersection points of maps from finite simplicial complexes (compact polyhedra) into ℝd and study conditions under which such multiple points can be eliminated. The most classical case is that of embeddings (i.e., maps without double points) of a κ-dimensional complex K into ℝ2κ. For this problem, the work of van Kampen, Shapiro, and Wu provides an efficiently testable necessary condition for embeddability (namely, vanishing of the van Kampen ob-struction). For κ ≥ 3, the condition is also sufficient, and yields a polynomial-time algorithm for deciding embeddability: One starts with an arbitrary map f : K→ℝ2κ, which generically has finitely many double points; if k ≥ 3 and if the obstruction vanishes then one can successively remove these double points by local modifications of the map f. One of the main tools is the famous Whitney trick that permits eliminating pairs of double points of opposite intersection sign. We are interested in generalizing this approach to intersection points of higher multiplicity. We call a point y 2 ℝd an r-fold Tverberg point of a map f : Kκ →ℝd if y lies in the intersection f(σ1)∩. ∩f(σr) of the images of r pairwise disjoint simplices of K. The analogue of (non-)embeddability that we study is the problem Tverbergκ r→d: Given a κ-dimensional complex K, does it satisfy a Tverberg-type theorem with parameters r and d, i.e., does every map f : K κ → ℝd have an r-fold Tverberg point? Here, we show that for fixed r, κ and d of the form d = rm and k = (r-1)m, m ≥ 3, there is a polynomial-time algorithm for deciding this (based on the vanishing of a cohomological obstruction, as in the case of embeddings). Our main tool is an r-fold analogue of the Whitney trick: Given r pairwise disjoint simplices of K such that the intersection of their images contains two r-fold Tverberg points y+ and y- of opposite intersection sign, we can eliminate y+ and y- by a local isotopy of f. In a subsequent paper, we plan to develop this further and present a generalization of the classical Haeiger-Weber Theorem (which yields a necessary and sufficient condition for embeddability of κ-complexes into ℝd for a wider range of dimensions) to intersection points of higher multiplicity."}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","file_date_updated":"2020-07-14T12:45:30Z","scopus_import":1,"author":[{"id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac","last_name":"Mabillard","full_name":"Mabillard, Isaac"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"file":[{"file_name":"IST-2016-534-v1+1_Eliminating_Tverberg_points_I._An_analogue_of_the_Whitney_trick.pdf","creator":"system","date_created":"2018-12-12T10:09:12Z","file_id":"4735","file_size":914396,"checksum":"2aae223fee8ffeaf57bbabd8d92b6a2c","content_type":"application/pdf","date_updated":"2020-07-14T12:45:30Z","access_level":"open_access","relation":"main_file"}],"acknowledgement":"Swiss National Science Foundation (Project SNSF-PP00P2-138948)","oa":1},{"abstract":[{"lang":"eng","text":"While fixing concurrency bugs, program repair algorithms may introduce new concurrency bugs. We present an algorithm that avoids such regressions. The solution space is given by a set of program transformations we consider in the repair process. These include reordering of instructions within a thread and inserting atomic sections. The new algorithm learns a constraint on the space of candidate solutions, from both positive examples (error-free traces) and counterexamples (error traces). From each counterexample, the algorithm learns a constraint necessary to remove the errors. From each positive examples, it learns a constraint that is necessary in order to prevent the repair from turning the trace into an error trace. We implemented the algorithm and evaluated it on simplified Linux device drivers with known bugs."}],"volume":8559,"quality_controlled":"1","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:56:23Z","language":[{"iso":"eng"}],"publication_status":"published","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007%2F978-3-319-08867-9_38","open_access":"1"}],"file":[{"date_updated":"2020-07-14T12:45:33Z","content_type":"application/pdf","checksum":"a631d3105509f239724644e77a1212e2","file_size":416732,"file_id":"4995","date_created":"2018-12-12T10:13:14Z","creator":"system","file_name":"IST-2014-297-v1+1_cav14-final.pdf","relation":"main_file","access_level":"open_access"},{"access_level":"open_access","relation":"main_file","file_size":616293,"file_name":"IST-2014-297-v2+1_cav14-final2.pdf","creator":"system","date_created":"2018-12-12T10:13:15Z","file_id":"4996","date_updated":"2020-07-14T12:45:33Z","checksum":"f8b0f748cc9fa697ca992cc56c87bc4e","content_type":"application/pdf"}],"publication_identifier":{"isbn":["978-331908866-2"]},"oa":1,"author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ryzhyk","full_name":"Ryzhyk, Leonid","first_name":"Leonid"},{"orcid":"0000-0003-4409-8487","last_name":"Tarrach","full_name":"Tarrach, Thorsten","first_name":"Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","file_date_updated":"2020-07-14T12:45:33Z","ec_funded":1,"intvolume":"      8559","conference":{"location":"Vienna, Austria","end_date":"2014-07-22","name":"CAV: Computer Aided Verification","start_date":"2014-07-18"},"citation":{"chicago":"Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Regression-Free Synthesis for Concurrency,” 8559:568–84. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">https://doi.org/10.1007/978-3-319-08867-9_38</a>.","ista":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2014. Regression-free synthesis for concurrency. CAV: Computer Aided Verification, LNCS, vol. 8559, 568–584.","ama":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Regression-free synthesis for concurrency. In: Vol 8559. Springer; 2014:568-584. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">10.1007/978-3-319-08867-9_38</a>","apa":"Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., &#38; Tarrach, T. (2014). Regression-free synthesis for concurrency (Vol. 8559, pp. 568–584). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">https://doi.org/10.1007/978-3-319-08867-9_38</a>","ieee":"P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Regression-free synthesis for concurrency,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 568–584.","mla":"Cerny, Pavol, et al. <i>Regression-Free Synthesis for Concurrency</i>. Vol. 8559, Springer, 2014, pp. 568–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">10.1007/978-3-319-08867-9_38</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2014, pp. 568–584."},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1130"}]},"_id":"2218","title":"Regression-free synthesis for concurrency","month":"07","doi":"10.1007/978-3-319-08867-9_38","publist_id":"4749","alternative_title":["LNCS"],"ddc":["000"],"pubrep_id":"297","publisher":"Springer","day":"22","type":"conference","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"568 - 584","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","date_published":"2014-07-22T00:00:00Z","year":"2014","oa_version":"Submitted Version","date_updated":"2026-04-09T10:54:00Z"},{"page":"90","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"full_name":"Marhavá, Petra","last_name":"Marhavá","first_name":"Petra","id":"44E59624-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-04-09T14:27:28Z","year":"2014","oa_version":"None","date_published":"2014-12-01T00:00:00Z","day":"01","publisher":"Institute of Science and Technology Austria","type":"dissertation","publication_identifier":{"issn":["2663-337X"]},"status":"public","alternative_title":["ISTA Thesis"],"corr_author":"1","language":[{"iso":"eng"}],"OA_place":"publisher","publist_id":"5805","date_created":"2018-12-11T11:51:49Z","department":[{"_id":"JiFr"}],"publication_status":"published","degree_awarded":"PhD","citation":{"ieee":"P. Marhavá, “Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana,” Institute of Science and Technology Austria, 2014.","short":"P. Marhavá, Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana, Institute of Science and Technology Austria, 2014.","mla":"Marhavá, Petra. <i>Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana</i>. Institute of Science and Technology Austria, 2014.","chicago":"Marhavá, Petra. “Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana.” Institute of Science and Technology Austria, 2014.","ista":"Marhavá P. 2014. Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana. Institute of Science and Technology Austria.","ama":"Marhavá P. Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana. 2014.","apa":"Marhavá, P. (2014). <i>Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana</i>. Institute of Science and Technology Austria."},"supervisor":[{"full_name":"Friml, Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596"}],"abstract":[{"text":"Phosphatidylinositol (Ptdlns) is a structural phospholipid that can be phosphorylated into various lipid signaling molecules, designated polyphosphoinositides (PPIs). The reversible phosphorylation of PPIs on the 3, 4, or 5 position of inositol is performed by a set of organelle-specific kinases and phosphatases, and the characteristic head groups make these molecules ideal for regulating biological processes in time and space. In yeast and mammals, Ptdlns3P and Ptdlns(3,5)P2 play crucial roles in trafficking toward the lytic compartments, whereas the role in plants is not yet fully understood. Here we identified the role of a land plant-specific subgroup of PPI phosphatases, the suppressor of actin 2 (SAC2) to SAC5, during vauolar trafficking and morphogenesis in Arabidopsis thaliana. SAC2-SAC5 localize to the tonoplast along with Ptdlns3P, the presumable product of their activity. in SAC gain- and loss-of-function mutants, the levels of Ptdlns monophosphates and bisphosphates were changed, with opposite effects on the morphology of storage and lytic vacuoles, and the trafficking toward the vacuoles was defective. Moreover, multiple sac knockout mutants had an increased number of smaller storage and lytic vacuoles, whereas extralarge vacuoles were observed in the overexpression lines, correlating with various growth and developmental defects. The fragmented vacuolar phenotype of sac mutants could be mimicked by treating wild-type seedlings with Ptdlns(3,5)P2, corroborating that this PPI is important for vacuole morphology. Taken together, these results provide evidence that PPIs, together with their metabolic enzymes SAC2-SAC5, are crucial for vacuolar trafficking and for vacuolar morphology and function in plants.","lang":"eng"}],"article_processing_charge":"No","month":"12","title":"Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana","_id":"1402"},{"scopus_import":"1","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","full_name":"Daca, Przemyslaw"}],"ec_funded":1,"intvolume":"      8559","volume":8559,"quality_controlled":"1","abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems.We focus on qualitative properties forMDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability. We introduce a new simulation relation to capture the refinement relation ofMDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.We present an automated technique for assume-guarantee style reasoning for compositional analysis ofMDPs with qualitative properties by giving a counterexample guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements.","lang":"eng"}],"publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T11:55:30Z","corr_author":"1","language":[{"iso":"eng"}],"status":"public","publisher":"Springer","day":"01","type":"conference","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"date_published":"2014-07-01T00:00:00Z","oa_version":"None","year":"2014","date_updated":"2026-04-15T10:02:12Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"473 - 490","_id":"2063","title":"CEGAR for qualitative analysis of probabilistic systems","month":"07","conference":{"name":"CAV: Computer Aided Verification","start_date":"2014-07-18","location":"Vienna, Austria","end_date":"2014-07-22"},"citation":{"short":"K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490.","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. Vol. 8559, Springer, 2014, pp. 473–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">10.1007/978-3-319-08867-9_31</a>.","ieee":"K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.","apa":"Chatterjee, K., Chmelik, M., &#38; Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">https://doi.org/10.1007/978-3-319-08867-9_31</a>","ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for qualitative analysis of probabilistic systems. In: Vol 8559. Springer; 2014:473-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">10.1007/978-3-319-08867-9_31</a>","ista":"Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">https://doi.org/10.1007/978-3-319-08867-9_31</a>."},"related_material":{"record":[{"id":"5412","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5413"},{"relation":"earlier_version","status":"public","id":"5414"},{"relation":"dissertation_contains","status":"public","id":"1155"}]},"publist_id":"4978","doi":"10.1007/978-3-319-08867-9_31","alternative_title":["LNCS"]},{"page":"78-97","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","year":"2014","date_updated":"2026-04-16T10:00:03Z","date_published":"2014-01-30T00:00:00Z","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publisher":"Springer Nature","type":"conference","day":"30","status":"public","OA_place":"repository","doi":"10.1007/978-3-642-54013-4_5","alternative_title":["LNCS"],"OA_type":"green","arxiv":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">10.1007/978-3-642-54013-4_5</a>.","short":"K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.","apa":"Chatterjee, K., Doyen, L., Filiot, E., &#38; Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i> (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">https://doi.org/10.1007/978-3-642-54013-4_5</a>","ama":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular games. In: <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>. Vol 8318. Springer Nature; 2014:78-97. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">10.1007/978-3-642-54013-4_5</a>","ista":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, 8318:78–97. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">https://doi.org/10.1007/978-3-642-54013-4_5</a>."},"related_material":{"record":[{"id":"681","relation":"later_version","status":"public"}]},"article_processing_charge":"No","conference":{"end_date":"2014-01-21","location":"San Diego, CA, United States","start_date":"2014-01-19","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation"},"title":"Doomsday equilibria for omega-regular games","month":"01","_id":"10885","ec_funded":1,"intvolume":"      8318","scopus_import":"1","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"last_name":"Filiot","full_name":"Filiot, Emmanuel","first_name":"Emmanuel"},{"first_name":"Jean-François","last_name":"Raskin","full_name":"Raskin, Jean-François"}],"publication":"VMCAI 2014: Verification, Model Checking, and Abstract Interpretation","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1311.3238"}],"publication_identifier":{"isbn":["9783642540127"],"eisbn":["9783642540134"],"eissn":["1611-3349"],"issn":["0302-9743"]},"oa":1,"acknowledgement":" Supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No\r\nS11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","language":[{"iso":"eng"}],"external_id":{"arxiv":["1311.3238"]},"department":[{"_id":"KrCh"}],"date_created":"2022-03-18T13:03:15Z","publication_status":"published","abstract":[{"text":"Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games.\r\nIn this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile such that all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players objective, then the objective of every player is violated.\r\nWe present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games.We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games.","lang":"eng"}],"quality_controlled":"1","volume":8318},{"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"2f93f3e63a38a85cd4404d7953913b14","date_updated":"2020-07-14T12:45:35Z","date_created":"2018-12-12T10:16:18Z","file_id":"5204","creator":"system","file_name":"IST-2016-549-v1+1_2014-J-06-LengthEstimate.pdf","file_size":3941391}],"publication_identifier":{"issn":["0924-9907"]},"oa":1,"publication":"Journal of Mathematical Imaging and Vision","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","full_name":"Pausinger, Florian","last_name":"Pausinger","orcid":"0000-0002-8379-3768"}],"file_date_updated":"2020-07-14T12:45:35Z","scopus_import":"1","isi":1,"intvolume":"        50","ec_funded":1,"volume":50,"quality_controlled":"1","abstract":[{"lang":"eng","text":"Motivated by applications in biology, we present an algorithm for estimating the length of tube-like shapes in 3-dimensional Euclidean space. In a first step, we combine the tube formula of Weyl with integral geometric methods to obtain an integral representation of the length, which we approximate using a variant of the Koksma-Hlawka Theorem. In a second step, we use tools from computational topology to decrease the dependence on small perturbations of the shape. We present computational experiments that shed light on the stability and the convergence rate of our algorithm."}],"publication_status":"published","date_created":"2018-12-11T11:56:36Z","department":[{"_id":"HeEd"}],"external_id":{"isi":["000339823000012"]},"corr_author":"1","language":[{"iso":"eng"}],"status":"public","issue":"1","type":"journal_article","publisher":"Springer","day":"01","project":[{"call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"date_published":"2014-09-01T00:00:00Z","has_accepted_license":"1","date_updated":"2026-04-16T10:09:04Z","oa_version":"Submitted Version","year":"2014","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"164 - 177","_id":"2255","month":"09","title":"Stable length estimates of tube-like shapes","article_processing_charge":"No","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2843"},{"status":"public","relation":"dissertation_contains","id":"1399"}]},"citation":{"mla":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>Journal of Mathematical Imaging and Vision</i>, vol. 50, no. 1, Springer, 2014, pp. 164–77, doi:<a href=\"https://doi.org/10.1007/s10851-013-0468-x\">10.1007/s10851-013-0468-x</a>.","short":"H. Edelsbrunner, F. Pausinger, Journal of Mathematical Imaging and Vision 50 (2014) 164–177.","ieee":"H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” <i>Journal of Mathematical Imaging and Vision</i>, vol. 50, no. 1. Springer, pp. 164–177, 2014.","ama":"Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. <i>Journal of Mathematical Imaging and Vision</i>. 2014;50(1):164-177. doi:<a href=\"https://doi.org/10.1007/s10851-013-0468-x\">10.1007/s10851-013-0468-x</a>","apa":"Edelsbrunner, H., &#38; Pausinger, F. (2014). Stable length estimates of tube-like shapes. <i>Journal of Mathematical Imaging and Vision</i>. Springer. <a href=\"https://doi.org/10.1007/s10851-013-0468-x\">https://doi.org/10.1007/s10851-013-0468-x</a>","chicago":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>Journal of Mathematical Imaging and Vision</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s10851-013-0468-x\">https://doi.org/10.1007/s10851-013-0468-x</a>.","ista":"Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177."},"ddc":["000"],"pubrep_id":"549","doi":"10.1007/s10851-013-0468-x","publist_id":"4691"},{"publication_status":"published","external_id":{"arxiv":["1310.3822"]},"date_created":"2022-07-07T09:14:48Z","language":[{"iso":"eng"}],"volume":779,"quality_controlled":"1","abstract":[{"lang":"eng","text":"We present the spatially resolved Hα dynamics of 16 star-forming galaxies at z ∼ 0.81 using the new KMOS multi-object integral field spectrograph on the ESO Very Large Telescope. These galaxies, selected using 1.18 μm narrowband imaging from the 10 deg2 CFHT-HiZELS survey of the SA 22 hr field, are found in a ∼4 Mpc overdensity of Hα emitters and likely reside in a group/intermediate environment, but not a cluster. We confirm and identify a rich group of star-forming galaxies at z = 0.813 ± 0.003, with 13 galaxies within 1000 km s−1 of each other, and seven within a diameter of 3 Mpc. All of our galaxies are “typical” star-forming galaxies at their redshift, 0.8 ± 0.4 SFR$^*_{z = 0.8}$, spanning a range of specific star formation rates (sSFRs) of 0.2–1.1 Gyr−1 and have a median metallicity very close to solar of 12 + log(O/H) = 8.62 ± 0.06. We measure the spatially resolved Hα dynamics of the galaxies in our sample and show that 13 out of 16 galaxies can be described by rotating disks and use the data to derive inclination corrected rotation speeds of 50–275 km s−1. The fraction of disks within our sample is 75% ± 8%, consistent with previous results based on Hubble Space Telescope morphologies of Hα-selected galaxies at z ∼ 1 and confirming that disks dominate the SFR density at z ∼ 1. Our Hα galaxies are well fitted by the z ∼ 1–2 Tully–Fisher (TF) relation, confirming the evolution seen in the zero point. Apart from having, on average, higher stellar masses and lower sSFRs, our group galaxies at z = 0.81 present the same mass–metallicity and TF relation as z ∼ 1 field galaxies and are all disk galaxies."}],"article_number":"139","publication":"The Astrophysical Journal","author":[{"first_name":"D.","full_name":"Sobral, D.","last_name":"Sobral"},{"last_name":"Swinbank","full_name":"Swinbank, A. M.","first_name":"A. M."},{"first_name":"J. P.","last_name":"Stott","full_name":"Stott, J. P."},{"last_name":"Matthee","full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J","orcid":"0000-0003-2871-127X"},{"full_name":"Bower, R. G.","last_name":"Bower","first_name":"R. G."},{"last_name":"Smail","full_name":"Smail, Ian","first_name":"Ian"},{"full_name":"Best, P.","last_name":"Best","first_name":"P."},{"first_name":"J. E.","full_name":"Geach, J. E.","last_name":"Geach"},{"full_name":"Sharples, R. M.","last_name":"Sharples","first_name":"R. M."}],"keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution – galaxies","high-redshift – galaxies","starburst"],"scopus_import":"1","intvolume":"       779","acknowledgement":"We thank the referee for many helpful comments and suggestions which greatly improved the clarity and quality of this work. D.S. acknowledges financial support from the Netherlands Organisation for Scientific research (NWO) through a Veni fellowship and also funding from the European Community Seventh Framework Programme (FP7/2007-2013) under grant agreement number RG226604 (OPTICON) which allowed access to CFHT time (proposals: 11BO29 & 12AO19). A.M.S. gratefully acknowledges an STFC Advanced Fellowship through grant number ST/H005234/1. I.R.S., J.P.S., and R.G.B. acknowledge support from the UK Science and Technology Facilities Council (STFC) under ST/I001573/1. I.R.S. acknowledges STFC (ST/J001422/1), the ERC Advanced Investigator program DUSTYGAL and a Royal Society/Wolfson Merit Award. P.N.B. acknowledges support from STFC. R.M.S. acknowledges support from the grant ST/1001573/1. The data presented here are based on observations with the KMOS spectrograph on the ESO/VLT under program 60.A-9460 and can be accessed through the ESO data archive. The authors also wish to acknowledge the help from Michael Hilker in preparing the KMOS observations.","oa":1,"publication_identifier":{"issn":["0004-637X"],"eissn":["1538-4357"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1310.3822"}],"arxiv":1,"doi":"10.1088/0004-637x/779/2/139","article_type":"original","_id":"11520","title":"The dynamics of z=0.8 H-alpha-selected star-forming galaxies from KMOS/CF-HiZELS","month":"12","article_processing_charge":"No","citation":{"chicago":"Sobral, D., A. M. Swinbank, J. P. Stott, Jorryt J Matthee, R. G. Bower, Ian Smail, P. Best, J. E. Geach, and R. M. Sharples. “The Dynamics of Z=0.8 H-Alpha-Selected Star-Forming Galaxies from KMOS/CF-HiZELS.” <i>The Astrophysical Journal</i>. IOP Publishing, 2013. <a href=\"https://doi.org/10.1088/0004-637x/779/2/139\">https://doi.org/10.1088/0004-637x/779/2/139</a>.","ista":"Sobral D, Swinbank AM, Stott JP, Matthee JJ, Bower RG, Smail I, Best P, Geach JE, Sharples RM. 2013. The dynamics of z=0.8 H-alpha-selected star-forming galaxies from KMOS/CF-HiZELS. The Astrophysical Journal. 779(2), 139.","ama":"Sobral D, Swinbank AM, Stott JP, et al. The dynamics of z=0.8 H-alpha-selected star-forming galaxies from KMOS/CF-HiZELS. <i>The Astrophysical Journal</i>. 2013;779(2). doi:<a href=\"https://doi.org/10.1088/0004-637x/779/2/139\">10.1088/0004-637x/779/2/139</a>","apa":"Sobral, D., Swinbank, A. M., Stott, J. P., Matthee, J. J., Bower, R. G., Smail, I., … Sharples, R. M. (2013). The dynamics of z=0.8 H-alpha-selected star-forming galaxies from KMOS/CF-HiZELS. <i>The Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/0004-637x/779/2/139\">https://doi.org/10.1088/0004-637x/779/2/139</a>","ieee":"D. Sobral <i>et al.</i>, “The dynamics of z=0.8 H-alpha-selected star-forming galaxies from KMOS/CF-HiZELS,” <i>The Astrophysical Journal</i>, vol. 779, no. 2. IOP Publishing, 2013.","mla":"Sobral, D., et al. “The Dynamics of Z=0.8 H-Alpha-Selected Star-Forming Galaxies from KMOS/CF-HiZELS.” <i>The Astrophysical Journal</i>, vol. 779, no. 2, 139, IOP Publishing, 2013, doi:<a href=\"https://doi.org/10.1088/0004-637x/779/2/139\">10.1088/0004-637x/779/2/139</a>.","short":"D. Sobral, A.M. Swinbank, J.P. Stott, J.J. Matthee, R.G. Bower, I. Smail, P. Best, J.E. Geach, R.M. Sharples, The Astrophysical Journal 779 (2013)."},"date_published":"2013-12-03T00:00:00Z","oa_version":"Preprint","year":"2013","date_updated":"2022-08-18T10:43:07Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","status":"public","publisher":"IOP Publishing","day":"03","type":"journal_article","issue":"2"},{"oa":1,"publication_identifier":{"issn":["1611-3349"],"isbn":["9783642450457"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1310.3153"}],"intvolume":"      8289","author":[{"first_name":"Paul","last_name":"Dütting","full_name":"Dütting, Paul"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Starnberger, Martin","last_name":"Starnberger","first_name":"Martin"}],"publication":"9th International Conference on Web and Internet Economics","scopus_import":"1","quality_controlled":"1","volume":8289,"abstract":[{"lang":"eng","text":"The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions the truthful direct-revelation mechanism that maximizes social welfare is the VCG mechanism. For many valuation spaces computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrictions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that the welfare loss increases in expressiveness. All our bounds apply to equilibrium concepts that can be computed in polynomial time as well as to learning outcomes."}],"publication_status":"published","language":[{"iso":"eng"}],"external_id":{"arxiv":["1310.3153"]},"date_created":"2022-08-11T11:05:14Z","status":"public","publisher":"Springer Nature","type":"conference","day":"01","oa_version":"Preprint","year":"2013","date_updated":"2024-11-06T12:12:00Z","date_published":"2013-12-01T00:00:00Z","extern":"1","page":"146–159","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Valuation compressions in VCG-based combinatorial auctions","month":"12","_id":"11791","citation":{"short":"P. Dütting, M. Henzinger, M. Starnberger, in:, 9th International Conference on Web and Internet Economics, Springer Nature, 2013, pp. 146–159.","mla":"Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.” <i>9th International Conference on Web and Internet Economics</i>, vol. 8289, Springer Nature, 2013, pp. 146–159, doi:<a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">10.1007/978-3-642-45046-4_13</a>.","ieee":"P. Dütting, M. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” in <i>9th International Conference on Web and Internet Economics</i>, Cambridge, MA, USA, 2013, vol. 8289, pp. 146–159.","ama":"Dütting P, Henzinger M, Starnberger M. Valuation compressions in VCG-based combinatorial auctions. In: <i>9th International Conference on Web and Internet Economics</i>. Vol 8289. Springer Nature; 2013:146–159. doi:<a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">10.1007/978-3-642-45046-4_13</a>","apa":"Dütting, P., Henzinger, M., &#38; Starnberger, M. (2013). Valuation compressions in VCG-based combinatorial auctions. In <i>9th International Conference on Web and Internet Economics</i> (Vol. 8289, pp. 146–159). Cambridge, MA, USA: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">https://doi.org/10.1007/978-3-642-45046-4_13</a>","chicago":"Dütting, Paul, Monika Henzinger, and Martin Starnberger. “Valuation Compressions in VCG-Based Combinatorial Auctions.” In <i>9th International Conference on Web and Internet Economics</i>, 8289:146–159. Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">https://doi.org/10.1007/978-3-642-45046-4_13</a>.","ista":"Dütting P, Henzinger M, Starnberger M. 2013. Valuation compressions in VCG-based combinatorial auctions. 9th International Conference on Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 8289, 146–159."},"article_processing_charge":"No","conference":{"name":"WINE: International Conference on Web and Internet Economics","start_date":"2013-12-01","location":"Cambridge, MA, USA","end_date":"2013-12-14"},"arxiv":1,"doi":"10.1007/978-3-642-45046-4_13","alternative_title":["LNCS"]},{"article_processing_charge":"No","conference":{"end_date":"2013-09-04","location":"Sophia Antipolis, France","start_date":"2013-09-02","name":"ESA: European Symposium on Algorithms"},"citation":{"chicago":"Dvořák, Wolfgang, Monika Henzinger, and David P. Williamson. “Maximizing a Submodular Function with Viability Constraints.” In <i>21st Annual European Symposium on Algorithms</i>, 8125:409–20. Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">https://doi.org/10.1007/978-3-642-40450-4_35</a>.","ista":"Dvořák W, Henzinger M, Williamson DP. 2013. Maximizing a submodular function with viability constraints. 21st Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 8125, 409–420.","ama":"Dvořák W, Henzinger M, Williamson DP. Maximizing a submodular function with viability constraints. In: <i>21st Annual European Symposium on Algorithms</i>. Vol 8125. Springer Nature; 2013:409-420. doi:<a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">10.1007/978-3-642-40450-4_35</a>","apa":"Dvořák, W., Henzinger, M., &#38; Williamson, D. P. (2013). Maximizing a submodular function with viability constraints. In <i>21st Annual European Symposium on Algorithms</i> (Vol. 8125, pp. 409–420). Sophia Antipolis, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">https://doi.org/10.1007/978-3-642-40450-4_35</a>","ieee":"W. Dvořák, M. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” in <i>21st Annual European Symposium on Algorithms</i>, Sophia Antipolis, France, 2013, vol. 8125, pp. 409–420.","short":"W. Dvořák, M. Henzinger, D.P. Williamson, in:, 21st Annual European Symposium on Algorithms, Springer Nature, 2013, pp. 409–420.","mla":"Dvořák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.” <i>21st Annual European Symposium on Algorithms</i>, vol. 8125, Springer Nature, 2013, pp. 409–20, doi:<a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">10.1007/978-3-642-40450-4_35</a>."},"related_material":{"record":[{"status":"public","relation":"later_version","id":"11792"}]},"_id":"11792","title":"Maximizing a submodular function with viability constraints","month":"09","doi":"10.1007/978-3-642-40450-4_35","alternative_title":["LNCS"],"arxiv":1,"type":"conference","publisher":"Springer Nature","day":"01","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","page":"409 - 420","date_published":"2013-09-01T00:00:00Z","year":"2013","oa_version":"Preprint","date_updated":"2024-11-06T12:12:13Z","abstract":[{"lang":"eng","text":"We study the problem of maximizing a monotone submodular function with viability constraints. This problem originates from computational biology, where we are given a phylogenetic tree over a set of species and a directed graph, the so-called food web, encoding viability constraints between these species. These food webs usually have constant depth. The goal is to select a subset of k species that satisfies the viability constraints and has maximal phylogenetic diversity. As this problem is known to be NP-hard, we investigate approximation algorithm. We present the first constant factor approximation algorithm if the depth is constant. Its approximation ratio is (1−1𝑒√). This algorithm not only applies to phylogenetic trees with viability constraints but for arbitrary monotone submodular set functions with viability constraints. Second, we show that there is no (1 − 1/e + ε)-approximation algorithm for our problem setting (even for additive functions) and that there is no approximation algorithm for a slight extension of this setting."}],"volume":8125,"quality_controlled":"1","external_id":{"arxiv":["1611.05753"]},"date_created":"2022-08-11T11:18:19Z","language":[{"iso":"eng"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.05753"}],"oa":1,"publication_identifier":{"isbn":["9783642404498"],"issn":["1611-3349"]},"scopus_import":"1","publication":"21st Annual European Symposium on Algorithms","author":[{"first_name":"Wolfgang","full_name":"Dvořák, Wolfgang","last_name":"Dvořák"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"full_name":"Williamson, David P.","last_name":"Williamson","first_name":"David P."}],"intvolume":"      8125"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1512.08147"}],"publication_identifier":{"issn":["1611-3349"],"isbn":["9783642392115"]},"oa":1,"intvolume":"      7966","author":[{"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"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"scopus_import":"1","publication":"40th International Colloquium on Automata, Languages, and Programming","abstract":[{"lang":"eng","text":"We study the problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We show (1 + ε)-approximation algorithms whose amortized time (over some number of link changes) is sublinear in D, the maximum diameter of the network. This breaks the Θ(D) time bound of recomputing “from scratch”.\r\n\r\nOur technique also leads to a (1 + ε)-approximate incremental algorithm for single-source shortest paths (SSSP) in the sequential (usual RAM) model. Prior to our work, the state of the art was the classic exact algorithm of [9] that is optimal under some assumptions [27]. Our result is the first to show that, in the incremental setting, this bound can be beaten in certain cases if a small approximation is allowed."}],"quality_controlled":"1","volume":7966,"language":[{"iso":"eng"}],"date_created":"2022-08-11T11:25:13Z","external_id":{"arxiv":["1512.08147"]},"publication_status":"published","day":"01","publisher":"Springer Nature","type":"conference","status":"public","page":"607–619","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-11-06T12:12:27Z","oa_version":"Preprint","year":"2013","date_published":"2013-07-01T00:00:00Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"11793"}]},"citation":{"ista":"Henzinger M, Krinninger S, Nanongkai D. 2013. Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. 40th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 7966, 607–619.","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” In <i>40th International Colloquium on Automata, Languages, and Programming</i>, 7966:607–619. Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">https://doi.org/10.1007/978-3-642-39212-2_53</a>.","apa":"Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2013). Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In <i>40th International Colloquium on Automata, Languages, and Programming</i> (Vol. 7966, pp. 607–619). Riga, Latvia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">https://doi.org/10.1007/978-3-642-39212-2_53</a>","ama":"Henzinger M, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In: <i>40th International Colloquium on Automata, Languages, and Programming</i>. Vol 7966. Springer Nature; 2013:607–619. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">10.1007/978-3-642-39212-2_53</a>","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks,” in <i>40th International Colloquium on Automata, Languages, and Programming</i>, Riga, Latvia, 2013, vol. 7966, pp. 607–619.","mla":"Henzinger, Monika, et al. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” <i>40th International Colloquium on Automata, Languages, and Programming</i>, vol. 7966, Springer Nature, 2013, pp. 607–619, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">10.1007/978-3-642-39212-2_53</a>.","short":"M. Henzinger, S. Krinninger, D. Nanongkai, in:, 40th International Colloquium on Automata, Languages, and Programming, Springer Nature, 2013, pp. 607–619."},"conference":{"end_date":"2013-07-12","location":"Riga, Latvia","start_date":"2013-07-08","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"article_processing_charge":"No","month":"07","title":"Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks","_id":"11793","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-39212-2_53","arxiv":1},{"publication":"54th Annual Symposium on Foundations of Computer Science","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"last_name":"Nanongkai","full_name":"Nanongkai, Danupon","first_name":"Danupon"}],"scopus_import":"1","oa":1,"publication_identifier":{"eisbn":["978-0-7695-5135-7"],"issn":["0272-5428"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1308.0776"}],"publication_status":"published","language":[{"iso":"eng"}],"external_id":{"arxiv":["1308.0776"]},"date_created":"2022-08-16T08:22:37Z","quality_controlled":"1","abstract":[{"text":"We study dynamic (1 + ϵ)-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected n-node m-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of Ȏ(mn) and constant query time by Roditty and Zwick (FOCS 2004). The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach (JACM 1981); it has a total update time of O(mn 2 ) and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of Ȏ(n 5/2 ) and constant query time that has an additive error of two in addition to the 1 + ϵ multiplicative error. This beats the previous Ȏ(mn) time when m = Ω(n 3/2 ). Note that the additive error is unavoidable since, even in the static case, an O(n 3-δ )-time (a so-called truly sub cubic) combinatorial algorithm with 1 + ϵ multiplicative error cannot have an additive error less than 2 - ϵ, unless we make a major breakthrough for Boolean matrix multiplication (Dor, Halperin and Zwick FOCS 1996) and many other long-standing problems (Vassilevska Williams and Williams FOCS 2010). The algorithm can also be turned into a (2 + ϵ)-approximation algorithm (without an additive error) with the same time guarantees, improving the recent (3 + ϵ)-approximation algorithm with Ȏ(n 5/2+O(1√(log n)) ) running time of Bernstein and Roditty (SODA 2011) in terms of both approximation and time guarantees. (2) We present a deterministic algorithm with a total update time of Ȏ(mn) and a query time of O(log log n). The algorithm has a multiplicative error of 1 + ϵ and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein in his STOC 2013 paper. In order to achieve our results, we introduce two new techniques: (1) A lazy Even-Shiloach tree algorithm which maintains a bounded-distance shortest-paths tree on a certain type of emulator called locally persevering emulator. (2) A derandomization technique based on moving Even-Shiloach trees as a way to derandomize the standard random set argument. These techniques might be of independent interest.","lang":"eng"}],"year":"2013","oa_version":"Preprint","date_updated":"2024-11-06T12:18:28Z","date_published":"2013-10-01T00:00:00Z","extern":"1","page":"538-547","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"Institute of Electrical and Electronics Engineers","type":"conference","day":"01","arxiv":1,"doi":"10.1109/focs.2013.64","title":"Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization","month":"10","_id":"11856","citation":{"ista":"Henzinger M, Krinninger S, Nanongkai D. 2013. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. 54th Annual Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science, 538–547.","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” In <i>54th Annual Symposium on Foundations of Computer Science</i>, 538–47. Institute of Electrical and Electronics Engineers, 2013. <a href=\"https://doi.org/10.1109/focs.2013.64\">https://doi.org/10.1109/focs.2013.64</a>.","apa":"Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2013). Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In <i>54th Annual Symposium on Foundations of Computer Science</i> (pp. 538–547). Berkeley, CA, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/focs.2013.64\">https://doi.org/10.1109/focs.2013.64</a>","ama":"Henzinger M, Krinninger S, Nanongkai D. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In: <i>54th Annual Symposium on Foundations of Computer Science</i>. Institute of Electrical and Electronics Engineers; 2013:538-547. doi:<a href=\"https://doi.org/10.1109/focs.2013.64\">10.1109/focs.2013.64</a>","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” in <i>54th Annual Symposium on Foundations of Computer Science</i>, Berkeley, CA, United States, 2013, pp. 538–547.","mla":"Henzinger, Monika, et al. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” <i>54th Annual Symposium on Foundations of Computer Science</i>, Institute of Electrical and Electronics Engineers, 2013, pp. 538–47, doi:<a href=\"https://doi.org/10.1109/focs.2013.64\">10.1109/focs.2013.64</a>.","short":"M. Henzinger, S. Krinninger, D. Nanongkai, in:, 54th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2013, pp. 538–547."},"article_processing_charge":"No","conference":{"location":"Berkeley, CA, United States","end_date":"2013-10-29","name":"FOCS: Symposium on Foundations of Computer Science","start_date":"2013-10-26"}},{"abstract":[{"lang":"eng","text":"We consider Hermitian and symmetric random band matrices H = (h xy ) in d⩾1 d ⩾ 1 dimensions. The matrix entries h xy , indexed by x,y∈(Z/LZ)d x , y ∈ ( Z / L Z ) d , are independent, centred random variables with variances sxy=E|hxy|2 s x y = E | h x y | 2 . We assume that s xy is negligible if |x − y| exceeds the band width W. In one dimension we prove that the eigenvectors of H are delocalized if W≫L4/5 W ≫ L 4 / 5 . We also show that the magnitude of the matrix entries |Gxy|2 | G x y | 2 of the resolvent G=G(z)=(H−z)−1 G = G ( z ) = ( H - z ) - 1 is self-averaging and we compute E|Gxy|2 E | G x y | 2 . We show that, as L→∞ L → ∞ and W≫L4/5 W ≫ L 4 / 5 , the behaviour of E|Gxy|2 E | G x y | 2 is governed by a diffusion operator whose diffusion constant we compute. Similar results are obtained in higher dimensions."}],"citation":{"mla":"Erdös, László, et al. “Delocalization and Diffusion Profile for Random Band Matrices.” <i>Communications in Mathematical Physics</i>, vol. 323, no. 1, Springer, 2013, pp. 367–416, doi:<a href=\"https://doi.org/10.1007/s00220-013-1773-3\">10.1007/s00220-013-1773-3</a>.","short":"L. Erdös, A. Knowles, H. Yau, J. Yin, Communications in Mathematical Physics 323 (2013) 367–416.","ieee":"L. Erdös, A. Knowles, H. Yau, and J. Yin, “Delocalization and diffusion profile for random band matrices,” <i>Communications in Mathematical Physics</i>, vol. 323, no. 1. Springer, pp. 367–416, 2013.","apa":"Erdös, L., Knowles, A., Yau, H., &#38; Yin, J. (2013). Delocalization and diffusion profile for random band matrices. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-013-1773-3\">https://doi.org/10.1007/s00220-013-1773-3</a>","ama":"Erdös L, Knowles A, Yau H, Yin J. Delocalization and diffusion profile for random band matrices. <i>Communications in Mathematical Physics</i>. 2013;323(1):367-416. doi:<a href=\"https://doi.org/10.1007/s00220-013-1773-3\">10.1007/s00220-013-1773-3</a>","ista":"Erdös L, Knowles A, Yau H, Yin J. 2013. Delocalization and diffusion profile for random band matrices. Communications in Mathematical Physics. 323(1), 367–416.","chicago":"Erdös, László, Antti Knowles, Horng Yau, and Jun Yin. “Delocalization and Diffusion Profile for Random Band Matrices.” <i>Communications in Mathematical Physics</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s00220-013-1773-3\">https://doi.org/10.1007/s00220-013-1773-3</a>."},"volume":323,"_id":"2697","month":"10","title":"Delocalization and diffusion profile for random band matrices","quality_controlled":0,"date_created":"2018-12-11T11:59:07Z","doi":"10.1007/s00220-013-1773-3","publist_id":"4199","publication_status":"published","issue":"1","type":"journal_article","day":"01","publisher":"Springer","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1205.5669"}],"status":"public","oa":1,"publication":"Communications in Mathematical Physics","author":[{"full_name":"László Erdös","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603"},{"first_name":"Antti","last_name":"Knowles","full_name":"Knowles, Antti"},{"full_name":"Yau, Horng-Tzer","last_name":"Yau","first_name":"Horng"},{"full_name":"Yin, Jun","last_name":"Yin","first_name":"Jun"}],"intvolume":"       323","page":"367 - 416","extern":1,"date_published":"2013-10-01T00:00:00Z","date_updated":"2021-01-12T06:59:07Z","year":"2013"}]