[{"date_published":"2014-10-01T00:00:00Z","title":"Decremental single-source shortest paths on undirected graphs in near-linear total update time","scopus_import":"1","month":"10","extern":"1","year":"2014","_id":"11855","language":[{"iso":"eng"}],"article_processing_charge":"No","status":"public","abstract":[{"text":"The decremental single-source shortest paths (SSSP) problem concerns maintaining the distances between a given source node s to every node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be easily solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach (JACM 1981) has been the fastest known algorithm for three decades. With the loss of a (1 + ε)-approximation factor, the running time was recently improved to O(n 2+o(1) ) by Bernstein and Roditty (SODA 2011), and more recently to O(n 1.8+o(1) + m 1+o(1) ) by Henzinger, Krinninger, and Nanongkai (SODA 2014). In this paper, we finally bring the running time of this case down to near-linear: We give a (1 + ε)-approximation algorithm with O(m 1+o(1) ) total update time, thus obtaining near-linear time. Moreover, we obtain O(m 1+o(1) log W) time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn log W) time is the O(mn 0.986 log W)-time algorithm by Henzinger, Krinninger, and Nanongkai (STOC 2014) which works for the general weighted directed case. In contrast to the previous results which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (d, ε)-hop set introduced by Cohen (JACM 2000) in the PRAM literature. A (d, ε)-hop set of a graph G = (V, E) is a set E' of weighted edges such that the distance between any pair of nodes in G can be (1 + ε)-approximated by their d-hop distance (given by a path containing at most d edges) on G'=(V, E∪E'). Our algorithm can maintain an (n o(1) , ε)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain the distances on this hop set, we develop a monotone bounded-hop Even-Shiloach tree. It results from extending and combining the monotone Even-Shiloach tree of Henzinger, Krinninger, and Nanongkai (FOCS 2013) with the bounded-hop SSSP technique of Bernstein (STOC 2013). These two new tools might be of independent interest.","lang":"eng"}],"oa_version":"Preprint","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1402.0054"]},"oa":1,"publication_identifier":{"issn":["0272-5428"],"eisbn":["978-1-4799-6517-5"]},"date_updated":"2024-11-06T12:18:18Z","author":[{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Krinninger, Sebastian","first_name":"Sebastian","last_name":"Krinninger"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"date_created":"2022-08-16T08:14:33Z","doi":"10.1109/focs.2014.24","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1402.0054"}],"citation":{"mla":"Henzinger, Monika, et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” <i>55th Annual Symposium on Foundations of Computer Science</i>, Institute of Electrical and Electronics Engineers, 2014, pp. 146–55, doi:<a href=\"https://doi.org/10.1109/focs.2014.24\">10.1109/focs.2014.24</a>.","ama":"Henzinger M, Krinninger S, Nanongkai D. Decremental single-source shortest paths on undirected graphs in near-linear total update time. In: <i>55th Annual Symposium on Foundations of Computer Science</i>. Institute of Electrical and Electronics Engineers; 2014:146-155. doi:<a href=\"https://doi.org/10.1109/focs.2014.24\">10.1109/focs.2014.24</a>","apa":"Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2014). Decremental single-source shortest paths on undirected graphs in near-linear total update time. In <i>55th Annual Symposium on Foundations of Computer Science</i> (pp. 146–155). Philadelphia, PA, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/focs.2014.24\">https://doi.org/10.1109/focs.2014.24</a>","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” In <i>55th Annual Symposium on Foundations of Computer Science</i>, 146–55. Institute of Electrical and Electronics Engineers, 2014. <a href=\"https://doi.org/10.1109/focs.2014.24\">https://doi.org/10.1109/focs.2014.24</a>.","ista":"Henzinger M, Krinninger S, Nanongkai D. 2014. Decremental single-source shortest paths on undirected graphs in near-linear total update time. 55th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 146–155.","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” in <i>55th Annual Symposium on Foundations of Computer Science</i>, Philadelphia, PA, United States, 2014, pp. 146–155.","short":"M. Henzinger, S. Krinninger, D. Nanongkai, in:, 55th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2014, pp. 146–155."},"day":"01","conference":{"start_date":"2014-10-18","name":"FOCS: Annual Symposium on Foundations of Computer Science","end_date":"2014-10-21","location":"Philadelphia, PA, United States"},"page":"146-155","publication":"55th Annual Symposium on Foundations of Computer Science","publisher":"Institute of Electrical and Electronics Engineers","related_material":{"record":[{"id":"11768","status":"public","relation":"later_version"}]},"type":"conference","publication_status":"published","quality_controlled":"1"},{"date_created":"2022-08-16T09:41:57Z","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Krinninger, Sebastian","first_name":"Sebastian","last_name":"Krinninger"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"publication_identifier":{"isbn":["978-145032710-7"],"issn":["0737-8017"]},"date_updated":"2024-11-06T12:20:12Z","external_id":{"arxiv":["1504.07959"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"abstract":[{"lang":"eng","text":"We consider dynamic algorithms for maintaining Single-Source Reachability (SSR) and approximate Single-Source Shortest Paths (SSSP) on n-node m-edge directed graphs under edge deletions (decremental algorithms). The previous fastest algorithm for SSR and SSSP goes back three decades to Even and Shiloach (JACM 1981); it has O(1) query time and O(mn) total update time (i.e., linear amortized update time if all edges are deleted). This algorithm serves as a building block for several other dynamic algorithms. The question whether its total update time can be improved is a major, long standing, open problem.\r\n\r\nIn this paper, we answer this question affirmatively. We obtain a randomized algorithm which, in a simplified form, achieves an Õ(mn0.984) expected total update time for SSR and (1 + ε)-approximate SSSP, where Õ(·) hides poly log n. We also extend our algorithm to achieve roughly the same running time for Strongly Connected Components (SCC), improving the algorithm of Roditty and Zwick (FOCS 2002), and an algorithm that improves the Õ (mn log W)-time algorithm of Bernstein (STOC 2013) for approximating SSSP on weighted directed graphs, where the edge weights are integers from 1 to W. All our algorithms have constant query time in the worst case."}],"oa_version":"Preprint","arxiv":1,"status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","_id":"11870","year":"2014","date_published":"2014-05-01T00:00:00Z","scopus_import":"1","extern":"1","month":"05","title":"Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs","publication_status":"published","type":"conference","quality_controlled":"1","publisher":"Association for Computing Machinery","publication":"46th Annual ACM Symposium on Theory of Computing","conference":{"start_date":"2014-05-31","end_date":"2014-06-03","name":"STOC: Symposium on Theory of Computing","location":"New York, NY, United States"},"day":"01","main_file_link":[{"url":"https://arxiv.org/abs/1504.07959","open_access":"1"}],"citation":{"short":"M. Henzinger, S. Krinninger, D. Nanongkai, in:, 46th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2014.","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs,” in <i>46th Annual ACM Symposium on Theory of Computing</i>, New York, NY, United States, 2014.","ista":"Henzinger M, Krinninger S, Nanongkai D. 2014. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. 46th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 674–683.","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.” In <i>46th Annual ACM Symposium on Theory of Computing</i>. Association for Computing Machinery, 2014. <a href=\"https://doi.org/10.1145/2591796.2591869\">https://doi.org/10.1145/2591796.2591869</a>.","ama":"Henzinger M, Krinninger S, Nanongkai D. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In: <i>46th Annual ACM Symposium on Theory of Computing</i>. Association for Computing Machinery; 2014. doi:<a href=\"https://doi.org/10.1145/2591796.2591869\">10.1145/2591796.2591869</a>","apa":"Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2014). Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In <i>46th Annual ACM Symposium on Theory of Computing</i>. New York, NY, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2591796.2591869\">https://doi.org/10.1145/2591796.2591869</a>","mla":"Henzinger, Monika, et al. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.” <i>46th Annual ACM Symposium on Theory of Computing</i>, 674–683, Association for Computing Machinery, 2014, doi:<a href=\"https://doi.org/10.1145/2591796.2591869\">10.1145/2591796.2591869</a>."},"article_number":"674 - 683","doi":"10.1145/2591796.2591869"},{"language":[{"iso":"eng"}],"article_processing_charge":"No","status":"public","date_published":"2014-01-01T00:00:00Z","month":"01","scopus_import":"1","extern":"1","title":"Deterministic fully dynamic data structures for vertex cover and matching","_id":"11875","year":"2014","publication_identifier":{"isbn":["978-1-61197-374-7"],"eisbn":["978-1-61197-373-0"]},"date_updated":"2024-11-06T12:22:53Z","date_created":"2022-08-16T12:36:42Z","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Giuseppe F.","last_name":"Italiano","full_name":"Italiano, Giuseppe F."}],"abstract":[{"lang":"eng","text":"We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph in  time per update. In particular, for minimum vertex cover we provide deterministic data structures for maintaining a (2 + ε) approximation in O(log n/ε2) amortized time per update. For maximum matching, we show how to maintain a (3 + e) approximation in O(m1/3/ε2) amortized time per update, and a (4 + ε) approximation in O(m1/3/ε2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [13]."}],"oa_version":"Preprint","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1412.1318"]},"oa":1,"conference":{"start_date":"2015-01-04","location":"San Diego, CA, United States","name":"SODA: Symposium on Discrete Algorithms","end_date":"2015-01-06"},"page":"785-804","doi":"10.1137/1.9781611973730.54","day":"01","main_file_link":[{"url":"https://arxiv.org/abs/1412.1318","open_access":"1"}],"citation":{"short":"S. Bhattacharya, M. Henzinger, G.F. Italiano, in:, 26th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 785–804.","ieee":"S. Bhattacharya, M. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” in <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, San Diego, CA, United States, 2014, pp. 785–804.","chicago":"Bhattacharya, Sayan, Monika Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” In <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 785–804. Society for Industrial and Applied Mathematics, 2014. <a href=\"https://doi.org/10.1137/1.9781611973730.54\">https://doi.org/10.1137/1.9781611973730.54</a>.","ista":"Bhattacharya S, Henzinger M, Italiano GF. 2014. Deterministic fully dynamic data structures for vertex cover and matching. 26th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 785–804.","ama":"Bhattacharya S, Henzinger M, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. In: <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2014:785-804. doi:<a href=\"https://doi.org/10.1137/1.9781611973730.54\">10.1137/1.9781611973730.54</a>","apa":"Bhattacharya, S., Henzinger, M., &#38; Italiano, G. F. (2014). Deterministic fully dynamic data structures for vertex cover and matching. In <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 785–804). San Diego, CA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973730.54\">https://doi.org/10.1137/1.9781611973730.54</a>","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2014, pp. 785–804, doi:<a href=\"https://doi.org/10.1137/1.9781611973730.54\">10.1137/1.9781611973730.54</a>."},"publication_status":"published","type":"conference","quality_controlled":"1","publication":"26th Annual ACM-SIAM Symposium on Discrete Algorithms","publisher":"Society for Industrial and Applied Mathematics","related_material":{"record":[{"status":"public","id":"11890","relation":"later_version"}]}},{"title":"A subquadratic-time algorithm for decremental single-source shortest paths","doi":"10.1137/1.9781611973402.79","extern":"1","scopus_import":"1","month":"01","date_published":"2014-01-01T00:00:00Z","_id":"11876","main_file_link":[{"url":"https://doi.org/10.1137/1.9781611973402.79","open_access":"1"}],"year":"2014","citation":{"short":"M. Henzinger, S. Krinninger, D. Nanongkai, in:, 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 1053–1072.","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “A subquadratic-time algorithm for decremental single-source shortest paths,” in <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Portland, OR, United States, 2014, pp. 1053–1072.","ista":"Henzinger M, Krinninger S, Nanongkai D. 2014. A subquadratic-time algorithm for decremental single-source shortest paths. 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1053–1072.","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” In <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1053–72. Society for Industrial and Applied Mathematics, 2014. <a href=\"https://doi.org/10.1137/1.9781611973402.79\">https://doi.org/10.1137/1.9781611973402.79</a>.","ama":"Henzinger M, Krinninger S, Nanongkai D. A subquadratic-time algorithm for decremental single-source shortest paths. In: <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2014:1053-1072. doi:<a href=\"https://doi.org/10.1137/1.9781611973402.79\">10.1137/1.9781611973402.79</a>","apa":"Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2014). A subquadratic-time algorithm for decremental single-source shortest paths. In <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1053–1072). Portland, OR, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973402.79\">https://doi.org/10.1137/1.9781611973402.79</a>","mla":"Henzinger, Monika, et al. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2014, pp. 1053–72, doi:<a href=\"https://doi.org/10.1137/1.9781611973402.79\">10.1137/1.9781611973402.79</a>."},"day":"01","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","page":"1053-1072","conference":{"location":"Portland, OR, United States","end_date":"2014-01-07","name":"SODA: Symposium on Discrete Algorithms","start_date":"2014-01-05"},"oa_version":"Published Version","abstract":[{"text":"We study dynamic (1 + ∊)-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n-node m-edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O(n2+o(1)) total update time and constant query time by Bernstein and Roditty (SODA 2011). In this paper, we improve the total update time to O(n1.8+o(1) + m1+o(1)) while keeping the query time constant. This running time is essentially tight when m = Ω(n1.8) since we need Ω(m) time even in the static setting. For smaller values of m, the running time of our algorithm is subquadratic, and is the first that breaks through the quadratic time barrier.\r\n\r\nIn obtaining this result, we develop a fast algorithm for what we call center cover data structure. We also make non-trivial extensions to our previous techniques called lazy-update and monotone Even-Shiloach trees (ICALP 2013 and FOCS 2013). As by-products of our new techniques, we obtain two new results for the decremental all-pairs shortest-paths problem. Our first result is the first approximation algorithm whose total update time is faster than Õ(mn) for all values of m. Our second result is a new trade-off between the total update time and the additive approximation guarantee.","lang":"eng"}],"publication":"25th Annual ACM-SIAM Symposium on Discrete Algorithms","oa":1,"publisher":"Society for Industrial and Applied Mathematics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-11-06T12:21:22Z","publication_identifier":{"eisbn":["978-1-61197-340-2"],"isbn":["978-1-61197-338-9"]},"author":[{"last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"quality_controlled":"1","date_created":"2022-08-16T12:58:31Z","type":"conference","publication_status":"published"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1309.2578"]},"volume":112,"oa":1,"abstract":[{"text":"Observations of flowing granular matter have suggested that same-material tribocharging depends on particle size, typically rendering large grains positive and small ones negative. Models assuming the transfer of trapped electrons can account for this trend, but have not been validated. Tracking individual grains in an electric field, we show quantitatively that charge is transferred based on size between materially identical grains. However, the surface density of trapped electrons, measured independently by thermoluminescence techniques, is orders of magnitude too small to account for the scale of charge transferred. This reveals that trapped electrons are not a necessary ingredient for same-material tribocharging.","lang":"eng"}],"oa_version":"Submitted Version","arxiv":1,"date_created":"2018-12-11T11:44:44Z","author":[{"full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis","first_name":"Scott R"},{"first_name":"Victor","last_name":"Lee","full_name":"Lee, Victor"},{"full_name":"Pierson, James","last_name":"Pierson","first_name":"James"},{"full_name":"Forman, Steven","last_name":"Forman","first_name":"Steven"},{"full_name":"Jaeger, Heinrich","last_name":"Jaeger","first_name":"Heinrich"}],"date_updated":"2021-01-12T06:48:58Z","intvolume":"       112","year":"2014","_id":"119","date_published":"2014-05-30T00:00:00Z","month":"05","extern":"1","title":"Size-dependent same-material tribocharging in insulating grains","status":"public","language":[{"iso":"eng"}],"publisher":"American Physical Society","publication":"APS Physics, Physical Review Letters","publication_status":"published","type":"journal_article","quality_controlled":"1","day":"30","publist_id":"7935","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1309.2578"}],"citation":{"chicago":"Waitukaitis, Scott R, Victor Lee, James Pierson, Steven Forman, and Heinrich Jaeger. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” <i>APS Physics, Physical Review Letters</i>. American Physical Society, 2014. <a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">https://doi.org/10.1103/PhysRevLett.112.218001</a>.","ista":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. 2014. Size-dependent same-material tribocharging in insulating grains. APS Physics, Physical Review Letters. 112(21), 218001.","ama":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. Size-dependent same-material tribocharging in insulating grains. <i>APS Physics, Physical Review Letters</i>. 2014;112(21). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">10.1103/PhysRevLett.112.218001</a>","apa":"Waitukaitis, S. R., Lee, V., Pierson, J., Forman, S., &#38; Jaeger, H. (2014). Size-dependent same-material tribocharging in insulating grains. <i>APS Physics, Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">https://doi.org/10.1103/PhysRevLett.112.218001</a>","mla":"Waitukaitis, Scott R., et al. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” <i>APS Physics, Physical Review Letters</i>, vol. 112, no. 21, 218001, American Physical Society, 2014, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">10.1103/PhysRevLett.112.218001</a>.","short":"S.R. Waitukaitis, V. Lee, J. Pierson, S. Forman, H. Jaeger, APS Physics, Physical Review Letters 112 (2014).","ieee":"S. R. Waitukaitis, V. Lee, J. Pierson, S. Forman, and H. Jaeger, “Size-dependent same-material tribocharging in insulating grains,” <i>APS Physics, Physical Review Letters</i>, vol. 112, no. 21. American Physical Society, 2014."},"article_number":"218001","doi":"10.1103/PhysRevLett.112.218001","issue":"21","acknowledgement":"This work was supported by the NSF through DMR-1309611. Access to the shared experimental facilities provided by the NSF-supported Chicago MRSEC (DMR-0820054) is gratefully acknowledged. S. L. F. and J. L. P. acknowledge funding from UIC NSF Grants No. 0850830 and No. 0602308. S. R. W. acknowledges support from a University of Chicago Millikan Fellowship and from Mrs. Joan Winstein through the Winstein Prize for Instrumentation."},{"title":"Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow","scopus_import":"1","extern":"1","month":"11","date_published":"2014-11-01T00:00:00Z","year":"2014","_id":"11967","intvolume":"         7","article_type":"original","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","oa_version":"None","abstract":[{"lang":"eng","text":"An experimentally easy to perform method for the generation of alumina-supported Fe3O4 nanoparticles [(6±1) nm size, 0.67 wt %]and the use of this material in hydrazine-mediated heterogeneously catalyzed reductions of nitroarenes to anilines under batch and continuous-flow conditions is presented. The bench-stable, reusable nano-Fe3O4@Al2O3 catalyst can selectively reduce functionalized nitroarenes at 1 mol % catalyst loading by using a 20 mol % excess of hydrazine hydrate in an elevated temperature regime (150 °C, reaction time 2–6 min in batch). For continuous-flow processing, the catalyst material is packed into dedicated cartridges and used in a commercially available high-temperature/-pressure flow device. In continuous mode, reaction times can be reduced to less than 1 min at 150 °C (30 bar back pressure) in a highly intensified process. The nano-Fe3O4@Al2O3 catalyst demonstrated stable reduction of nitrobenzene (0.5 M in MeOH) for more than 10 h on stream at a productivity of 30 mmol h−1 (0.72 mol per day). Importantly, virtually no leaching of the catalytically active material could be observed by inductively coupled plasma MS monitoring."}],"volume":7,"pmid":1,"external_id":{"pmid":["25209099"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T10:09:42Z","publication_identifier":{"issn":["1864-5631"],"eissn":["1864-564X"]},"author":[{"full_name":"Moghaddam, Mojtaba Mirhosseini","first_name":"Mojtaba Mirhosseini","last_name":"Moghaddam"},{"orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","last_name":"Pieber"},{"full_name":"Glasnov, Toma","last_name":"Glasnov","first_name":"Toma"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"date_created":"2022-08-25T08:36:54Z","issue":"11","doi":"10.1002/cssc.201402455","citation":{"ieee":"M. M. Moghaddam, B. Pieber, T. Glasnov, and C. O. Kappe, “Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow,” <i>ChemSusChem</i>, vol. 7, no. 11. Wiley, pp. 3122–3131, 2014.","short":"M.M. Moghaddam, B. Pieber, T. Glasnov, C.O. Kappe, ChemSusChem 7 (2014) 3122–3131.","mla":"Moghaddam, Mojtaba Mirhosseini, et al. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” <i>ChemSusChem</i>, vol. 7, no. 11, Wiley, 2014, pp. 3122–31, doi:<a href=\"https://doi.org/10.1002/cssc.201402455\">10.1002/cssc.201402455</a>.","apa":"Moghaddam, M. M., Pieber, B., Glasnov, T., &#38; Kappe, C. O. (2014). Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. <i>ChemSusChem</i>. Wiley. <a href=\"https://doi.org/10.1002/cssc.201402455\">https://doi.org/10.1002/cssc.201402455</a>","ama":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. <i>ChemSusChem</i>. 2014;7(11):3122-3131. doi:<a href=\"https://doi.org/10.1002/cssc.201402455\">10.1002/cssc.201402455</a>","chicago":"Moghaddam, Mojtaba Mirhosseini, Bartholomäus Pieber, Toma Glasnov, and C. Oliver Kappe. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” <i>ChemSusChem</i>. Wiley, 2014. <a href=\"https://doi.org/10.1002/cssc.201402455\">https://doi.org/10.1002/cssc.201402455</a>.","ista":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. 2014. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. ChemSusChem. 7(11), 3122–3131."},"day":"01","page":"3122-3131","publication":"ChemSusChem","publisher":"Wiley","quality_controlled":"1","type":"journal_article","publication_status":"published"},{"publisher":"Elsevier","publication":"Developmental Cell","publication_status":"published","type":"journal_article","quality_controlled":"1","day":"23","citation":{"ama":"Hofbauer HF, Schopf FH, Schleifer H, et al. Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. <i>Developmental Cell</i>. 2014;29(6):P729-739. doi:<a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">10.1016/j.devcel.2014.04.025</a>","apa":"Hofbauer, H. F., Schopf, F. H., Schleifer, H., Knittelfelder, O. L., Pieber, B., Rechberger, G. N., … Kohlwein, S. D. (2014). Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">https://doi.org/10.1016/j.devcel.2014.04.025</a>","chicago":"Hofbauer, Harald F., Florian H. Schopf, Hannes Schleifer, Oskar L. Knittelfelder, Bartholomäus Pieber, Gerald N. Rechberger, Heimo Wolinski, et al. “Regulation of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” <i>Developmental Cell</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">https://doi.org/10.1016/j.devcel.2014.04.025</a>.","ista":"Hofbauer HF, Schopf FH, Schleifer H, Knittelfelder OL, Pieber B, Rechberger GN, Wolinski H, Gaspar ML, Kappe CO, Stadlmann J, Mechtler K, Zenz A, Lohner K, Tehlivets O, Henry SA, Kohlwein SD. 2014. Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. Developmental Cell. 29(6), P729-739.","mla":"Hofbauer, Harald F., et al. “Regulation of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” <i>Developmental Cell</i>, vol. 29, no. 6, Elsevier, 2014, pp. P729-739, doi:<a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">10.1016/j.devcel.2014.04.025</a>.","ieee":"H. F. Hofbauer <i>et al.</i>, “Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids,” <i>Developmental Cell</i>, vol. 29, no. 6. Elsevier, pp. P729-739, 2014.","short":"H.F. Hofbauer, F.H. Schopf, H. Schleifer, O.L. Knittelfelder, B. Pieber, G.N. Rechberger, H. Wolinski, M.L. Gaspar, C.O. Kappe, J. Stadlmann, K. Mechtler, A. Zenz, K. Lohner, O. Tehlivets, S.A. Henry, S.D. Kohlwein, Developmental Cell 29 (2014) P729-739."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.devcel.2014.04.025"}],"issue":"6","doi":"10.1016/j.devcel.2014.04.025","page":"P729-739","external_id":{"pmid":["24960695"]},"pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"volume":29,"abstract":[{"lang":"eng","text":"Membrane phospholipids typically contain fatty acids (FAs) of 16 and 18 carbon atoms. This particular chain length is evolutionarily highly conserved and presumably provides maximum stability and dynamic properties to biological membranes in response to nutritional or environmental cues. Here, we show that the relative proportion of C16 versus C18 FAs is regulated by the activity of acetyl-CoA carboxylase (Acc1), the first and rate-limiting enzyme of FA de novo synthesis. Acc1 activity is attenuated by AMPK/Snf1-dependent phosphorylation, which is required to maintain an appropriate acyl-chain length distribution. Moreover, we find that the transcriptional repressor Opi1 preferentially binds to C16 over C18 phosphatidic acid (PA) species: thus, C16-chain containing PA sequesters Opi1 more effectively to the ER, enabling AMPK/Snf1 control of PA acyl-chain length to determine the degree of derepression of Opi1 target genes. These findings reveal an unexpected regulatory link between the major energy-sensing kinase, membrane lipid composition, and transcription."}],"oa_version":"Published Version","date_created":"2022-08-25T08:42:42Z","author":[{"full_name":"Hofbauer, Harald F.","first_name":"Harald F.","last_name":"Hofbauer"},{"first_name":"Florian H.","last_name":"Schopf","full_name":"Schopf, Florian H."},{"last_name":"Schleifer","first_name":"Hannes","full_name":"Schleifer, Hannes"},{"last_name":"Knittelfelder","first_name":"Oskar L.","full_name":"Knittelfelder, Oskar L."},{"first_name":"Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"full_name":"Rechberger, Gerald N.","first_name":"Gerald N.","last_name":"Rechberger"},{"last_name":"Wolinski","first_name":"Heimo","full_name":"Wolinski, Heimo"},{"full_name":"Gaspar, Maria L.","last_name":"Gaspar","first_name":"Maria L."},{"first_name":"C. Oliver","last_name":"Kappe","full_name":"Kappe, C. Oliver"},{"full_name":"Stadlmann, Johannes","last_name":"Stadlmann","first_name":"Johannes"},{"last_name":"Mechtler","first_name":"Karl","full_name":"Mechtler, Karl"},{"full_name":"Zenz, Alexandra","last_name":"Zenz","first_name":"Alexandra"},{"full_name":"Lohner, Karl","first_name":"Karl","last_name":"Lohner"},{"first_name":"Oksana","last_name":"Tehlivets","full_name":"Tehlivets, Oksana"},{"full_name":"Henry, Susan A.","last_name":"Henry","first_name":"Susan A."},{"first_name":"Sepp D.","last_name":"Kohlwein","full_name":"Kohlwein, Sepp D."}],"publication_identifier":{"eissn":["1878-1551"],"issn":["1534-5807"]},"date_updated":"2023-02-21T10:09:45Z","intvolume":"        29","_id":"11968","year":"2014","date_published":"2014-06-23T00:00:00Z","extern":"1","month":"06","scopus_import":"1","title":"Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","article_type":"original"},{"date_published":"2014-03-03T00:00:00Z","article_number":"13430","title":"Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow","extern":"1","month":"03","scopus_import":"1","issue":"26","doi":"10.1039/c4ra01442a","intvolume":"         4","year":"2014","_id":"11987","citation":{"short":"B. Pieber, T. Glasnov, C.O. Kappe, RSC Advances 4 (2014).","ieee":"B. Pieber, T. Glasnov, and C. O. Kappe, “Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow,” <i>RSC Advances</i>, vol. 4, no. 26. Royal Society of Chemistry, 2014.","mla":"Pieber, Bartholomäus, et al. “Flash Carboxylation: Fast Lithiation–Carboxylation Sequence at Room Temperature in Continuous Flow.” <i>RSC Advances</i>, vol. 4, no. 26, 13430, Royal Society of Chemistry, 2014, doi:<a href=\"https://doi.org/10.1039/c4ra01442a\">10.1039/c4ra01442a</a>.","chicago":"Pieber, Bartholomäus, Toma Glasnov, and C. O. Kappe. “Flash Carboxylation: Fast Lithiation–Carboxylation Sequence at Room Temperature in Continuous Flow.” <i>RSC Advances</i>. Royal Society of Chemistry, 2014. <a href=\"https://doi.org/10.1039/c4ra01442a\">https://doi.org/10.1039/c4ra01442a</a>.","ista":"Pieber B, Glasnov T, Kappe CO. 2014. Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. RSC Advances. 4(26), 13430.","apa":"Pieber, B., Glasnov, T., &#38; Kappe, C. O. (2014). Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. <i>RSC Advances</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c4ra01442a\">https://doi.org/10.1039/c4ra01442a</a>","ama":"Pieber B, Glasnov T, Kappe CO. Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. <i>RSC Advances</i>. 2014;4(26). doi:<a href=\"https://doi.org/10.1039/c4ra01442a\">10.1039/c4ra01442a</a>"},"day":"03","language":[{"iso":"eng"}],"article_type":"letter_note","article_processing_charge":"No","status":"public","abstract":[{"text":"A method for the direct lithiation of terminal alkynes and heterocycles with subsequent carboxylation in a continuous flow format was developed. This method provides carboxylic acids at ambient conditions within less than five seconds with only little excess of the organometallic base and CO2.","lang":"eng"}],"publication":"RSC Advances","oa_version":"None","publisher":"Royal Society of Chemistry","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":4,"publication_identifier":{"eissn":["2046-2069"]},"date_updated":"2023-02-21T10:10:31Z","type":"journal_article","publication_status":"published","author":[{"orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus","first_name":"Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"},{"first_name":"Toma","last_name":"Glasnov","full_name":"Glasnov, Toma"},{"first_name":"C. O.","last_name":"Kappe","full_name":"Kappe, C. O."}],"quality_controlled":"1","date_created":"2022-08-25T11:48:19Z"},{"date_published":"2014-04-01T00:00:00Z","title":"Universality of general β-ensembles","scopus_import":"1","month":"04","intvolume":"       163","_id":"2699","year":"2014","language":[{"iso":"eng"}],"article_processing_charge":"No","status":"public","abstract":[{"text":"We prove the universality of the β-ensembles with convex analytic potentials and for any β &gt;\r\n0, i.e. we show that the spacing distributions of log-gases at any inverse temperature β coincide with those of the Gaussian β-ensembles.","lang":"eng"}],"oa_version":"Preprint","arxiv":1,"external_id":{"arxiv":["1104.2272"],"isi":["000334478100003"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"volume":163,"date_updated":"2025-09-29T11:11:17Z","author":[{"first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"last_name":"Bourgade","first_name":"Paul","full_name":"Bourgade, Paul"},{"full_name":"Yau, Horng","first_name":"Horng","last_name":"Yau"}],"date_created":"2018-12-11T11:59:08Z","doi":"10.1215/00127094-2649752","issue":"6","citation":{"ieee":"L. Erdös, P. Bourgade, and H. Yau, “Universality of general β-ensembles,” <i>Duke Mathematical Journal</i>, vol. 163, no. 6. Duke University Press, pp. 1127–1190, 2014.","short":"L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 1127–1190.","mla":"Erdös, László, et al. “Universality of General β-Ensembles.” <i>Duke Mathematical Journal</i>, vol. 163, no. 6, Duke University Press, 2014, pp. 1127–90, doi:<a href=\"https://doi.org/10.1215/00127094-2649752\">10.1215/00127094-2649752</a>.","ama":"Erdös L, Bourgade P, Yau H. Universality of general β-ensembles. <i>Duke Mathematical Journal</i>. 2014;163(6):1127-1190. doi:<a href=\"https://doi.org/10.1215/00127094-2649752\">10.1215/00127094-2649752</a>","apa":"Erdös, L., Bourgade, P., &#38; Yau, H. (2014). Universality of general β-ensembles. <i>Duke Mathematical Journal</i>. Duke University Press. <a href=\"https://doi.org/10.1215/00127094-2649752\">https://doi.org/10.1215/00127094-2649752</a>","chicago":"Erdös, László, Paul Bourgade, and Horng Yau. “Universality of General β-Ensembles.” <i>Duke Mathematical Journal</i>. Duke University Press, 2014. <a href=\"https://doi.org/10.1215/00127094-2649752\">https://doi.org/10.1215/00127094-2649752</a>.","ista":"Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke Mathematical Journal. 163(6), 1127–1190."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.2272"}],"day":"01","isi":1,"publist_id":"4197","page":"1127 - 1190","publication":"Duke Mathematical Journal","publisher":"Duke University Press","department":[{"_id":"LaEr"}],"type":"journal_article","publication_status":"published","quality_controlled":"1"},{"date_published":"2014-06-01T00:00:00Z","month":"06","scopus_import":"1","title":"Strategy synthesis for multi-dimensional quantitative objectives","intvolume":"        51","_id":"2716","year":"2014","language":[{"iso":"eng"}],"article_processing_charge":"No","article_type":"original","status":"public","abstract":[{"text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.","lang":"eng"}],"arxiv":1,"oa_version":"Preprint","external_id":{"arxiv":["1201.5073"],"isi":["000335981500002"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"volume":51,"date_updated":"2025-09-29T11:10:44Z","project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"}],"date_created":"2018-12-11T11:59:14Z","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mickael","last_name":"Randour","full_name":"Randour, Mickael"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"issue":"3-4","doi":"10.1007/s00236-013-0182-6","acknowledgement":"Krishnendu Chatterjee is supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307: Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS. fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499: inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful to the anonymous reviewers for their insightful comments. ","publist_id":"4176","day":"01","isi":1,"citation":{"chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>Acta Informatica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00236-013-0182-6\">https://doi.org/10.1007/s00236-013-0182-6</a>.","ista":"Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.","ama":"Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional quantitative objectives. <i>Acta Informatica</i>. 2014;51(3-4):129-163. doi:<a href=\"https://doi.org/10.1007/s00236-013-0182-6\">10.1007/s00236-013-0182-6</a>","apa":"Chatterjee, K., Randour, M., &#38; Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-013-0182-6\">https://doi.org/10.1007/s00236-013-0182-6</a>","mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>Acta Informatica</i>, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:<a href=\"https://doi.org/10.1007/s00236-013-0182-6\">10.1007/s00236-013-0182-6</a>.","short":"K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.","ieee":"K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” <i>Acta Informatica</i>, vol. 51, no. 3–4. Springer, pp. 129–163, 2014."},"main_file_link":[{"url":"http://arxiv.org/abs/1201.5073","open_access":"1"}],"page":"129 - 163","publication":"Acta Informatica","publisher":"Springer","related_material":{"record":[{"status":"public","id":"10904","relation":"earlier_version"}]},"department":[{"_id":"KrCh"}],"publication_status":"published","type":"journal_article","quality_controlled":"1"},{"publisher":"Springer","related_material":{"record":[{"relation":"earlier_version","id":"3225","status":"public"}]},"publication":"Journal of Cryptology","type":"journal_article","publication_status":"published","quality_controlled":"1","department":[{"_id":"KrPi"}],"citation":{"ieee":"M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” <i>Journal of Cryptology</i>, vol. 27, no. 3. Springer, pp. 397–428, 2014.","short":"M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.","mla":"Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.” <i>Journal of Cryptology</i>, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:<a href=\"https://doi.org/10.1007/s00145-013-9148-7\">10.1007/s00145-013-9148-7</a>.","apa":"Fischlin, M., Lehmann, A., &#38; Pietrzak, K. Z. (2014). Robust multi-property combiners for hash functions. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-013-9148-7\">https://doi.org/10.1007/s00145-013-9148-7</a>","ama":"Fischlin M, Lehmann A, Pietrzak KZ. Robust multi-property combiners for hash functions. <i>Journal of Cryptology</i>. 2014;27(3):397-428. doi:<a href=\"https://doi.org/10.1007/s00145-013-9148-7\">10.1007/s00145-013-9148-7</a>","ista":"Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners for hash functions. Journal of Cryptology. 27(3), 397–428.","chicago":"Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi-Property Combiners for Hash Functions.” <i>Journal of Cryptology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00145-013-9148-7\">https://doi.org/10.1007/s00145-013-9148-7</a>."},"day":"01","publist_id":"3940","isi":1,"doi":"10.1007/s00145-013-9148-7","issue":"3","page":"397 - 428","external_id":{"isi":["000336370500001"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":27,"abstract":[{"lang":"eng","text":"A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combiners only aim at preserving a single property such as collision-resistance or pseudorandomness. However, when hash functions are used in protocols like TLS they are often required to provide several properties simultaneously. We therefore put forward the notion of robust multi-property combiners and elaborate on different definitions for such combiners. We then propose a combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code. This combiner satisfies the strongest notion we propose, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function. If the underlying hash functions have output length n, the combiner has output length 2 n. This basically matches a known lower bound for black-box combiners for collision-resistance only, thus the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the property of being indifferentiable from a random oracle, slightly increasing the output length to 2 n+ω(log n). Moreover, we show how to augment our constructions in order to make them also robust for the one-wayness property, but in this case require an a priory upper bound on the input length."}],"oa_version":"None","author":[{"full_name":"Fischlin, Marc","last_name":"Fischlin","first_name":"Marc"},{"last_name":"Lehmann","first_name":"Anja","full_name":"Lehmann, Anja"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"date_created":"2018-12-11T11:59:56Z","date_updated":"2025-09-29T11:09:56Z","intvolume":"        27","year":"2014","_id":"2852","date_published":"2014-07-01T00:00:00Z","title":"Robust multi-property combiners for hash functions","scopus_import":"1","month":"07","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No"},{"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Morozovy","first_name":"Dmitriy","full_name":"Morozovy, Dmitriy"}],"date_created":"2018-12-11T12:00:16Z","date_updated":"2025-06-03T11:46:59Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","abstract":[{"text":"Persistent homology is a recent grandchild of homology that has found use in\r\nscience and engineering as well as in mathematics. This paper surveys the method as well\r\nas the applications, neglecting completeness in favor of highlighting ideas and directions.","lang":"eng"}],"status":"public","article_processing_charge":"No","language":[{"iso":"eng"}],"_id":"2905","year":"2014","pubrep_id":"544","title":"Persistent homology: Theory and practice","month":"01","date_published":"2014-01-01T00:00:00Z","quality_controlled":"1","type":"conference","publication_status":"published","corr_author":"1","file":[{"date_created":"2018-12-12T10:16:43Z","relation":"main_file","checksum":"1d4a046f1af945c407c5c4d411d4c5e4","creator":"system","access_level":"open_access","file_name":"IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf","date_updated":"2020-07-14T12:45:52Z","file_id":"5232","content_type":"application/pdf","file_size":435320}],"department":[{"_id":"HeEd"}],"has_accepted_license":"1","publisher":"European Mathematical Society","ddc":["000"],"conference":{"location":"Kraków, Poland","name":"ECM: European Congress of Mathematics","end_date":"2012-07-07","start_date":"2012-07-02"},"page":"31 - 50","file_date_updated":"2020-07-14T12:45:52Z","citation":{"ama":"Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: European Mathematical Society; 2014:31-50. doi:<a href=\"https://doi.org/10.4171/120-1/3\">10.4171/120-1/3</a>","apa":"Edelsbrunner, H., &#38; Morozovy, D. (2014). Persistent homology: Theory and practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics, Kraków, Poland: European Mathematical Society. <a href=\"https://doi.org/10.4171/120-1/3\">https://doi.org/10.4171/120-1/3</a>","chicago":"Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. European Mathematical Society, 2014. <a href=\"https://doi.org/10.4171/120-1/3\">https://doi.org/10.4171/120-1/3</a>.","ista":"Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.","mla":"Edelsbrunner, Herbert, and Dmitriy Morozovy. <i>Persistent Homology: Theory and Practice</i>. European Mathematical Society, 2014, pp. 31–50, doi:<a href=\"https://doi.org/10.4171/120-1/3\">10.4171/120-1/3</a>.","ieee":"H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,” presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014, pp. 31–50.","short":"H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society, 2014, pp. 31–50."},"day":"01","publist_id":"3842","acknowledgement":"This research is partially supported by NSF under grant DBI-0820624, by ESF under the Research Networking Programme, and by the Russian Government Project 11.G34.31.0053.","doi":"10.4171/120-1/3"},{"publisher":"Public Library of Science","has_accepted_license":"1","publication":"PLoS One","ddc":["570"],"publication_status":"published","type":"journal_article","quality_controlled":"1","department":[{"_id":"GaTk"}],"corr_author":"1","file":[{"relation":"main_file","date_created":"2018-12-12T10:13:28Z","date_updated":"2020-07-14T12:46:06Z","file_name":"IST-2016-432-v1+1_journal.pone.0085841.pdf","access_level":"open_access","creator":"system","checksum":"1d5816b343abe5eadc3eb419bcece971","file_id":"5011","content_type":"application/pdf","file_size":1568524}],"publist_id":"3385","day":"21","isi":1,"citation":{"short":"G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014).","ieee":"G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in higher-order stimulus statistics in the salamander retina,” <i>PLoS One</i>, vol. 9, no. 1. Public Library of Science, 2014.","mla":"Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” <i>PLoS One</i>, vol. 9, no. 1, e85841, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0085841\">10.1371/journal.pone.0085841</a>.","chicago":"Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0085841\">https://doi.org/10.1371/journal.pone.0085841</a>.","ista":"Tkačik G, Ghosh A, Schneidman E, Segev R. 2014. Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. 9(1), e85841.","ama":"Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order stimulus statistics in the salamander retina. <i>PLoS One</i>. 2014;9(1). doi:<a href=\"https://doi.org/10.1371/journal.pone.0085841\">10.1371/journal.pone.0085841</a>","apa":"Tkačik, G., Ghosh, A., Schneidman, E., &#38; Segev, R. (2014). Adaptation to changes in higher-order stimulus statistics in the salamander retina. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0085841\">https://doi.org/10.1371/journal.pone.0085841</a>"},"license":"https://creativecommons.org/licenses/by/4.0/","article_number":"e85841","issue":"1","doi":"10.1371/journal.pone.0085841","acknowledgement":"This work was supported by The Israel Science Foundation and The Human Frontiers Science Program.\r\nWe thank the referees for helping significantly improve this paper. We also thank Vijay Balasubramanian, Kristina Simmons, and Jason Prentice for stimulating discussions. GT wishes to thank the faculty and students of the “Methods in Computational Neuroscience” course at Marine Biological Laboratory, Woods Hole.\r\n","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2020-07-14T12:46:06Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000330244500130"]},"oa":1,"volume":9,"abstract":[{"lang":"eng","text":"Adaptation in the retina is thought to optimize the encoding of natural light signals into sequences of spikes sent to the brain. While adaptive changes in retinal processing to the variations of the mean luminance level and second-order stimulus statistics have been documented before, no such measurements have been performed when higher-order moments of the light distribution change. We therefore measured the ganglion cell responses in the tiger salamander retina to controlled changes in the second (contrast), third (skew) and fourth (kurtosis) moments of the light intensity distribution of spatially uniform temporally independent stimuli. The skew and kurtosis of the stimuli were chosen to cover the range observed in natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear models that capture well the retinal encoding properties across all stimuli. We found that the encoding properties of retinal ganglion cells change only marginally when higher-order statistics change, compared to the changes observed in response to the variation in contrast. By analyzing optimal coding in LN-type models, we showed that neurons can maintain a high information rate without large dynamic adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli, spatio-temporal summation within the receptive field averages away non-gaussian aspects of the light intensity distribution."}],"oa_version":"Published Version","date_created":"2018-12-11T12:02:20Z","author":[{"orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","first_name":"Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ghosh, Anandamohan","last_name":"Ghosh","first_name":"Anandamohan"},{"last_name":"Schneidman","first_name":"Elad","full_name":"Schneidman, Elad"},{"last_name":"Segev","first_name":"Ronen","full_name":"Segev, Ronen"}],"date_updated":"2025-09-29T11:09:18Z","intvolume":"         9","_id":"3263","year":"2014","pubrep_id":"432","date_published":"2014-01-21T00:00:00Z","scopus_import":"1","month":"01","title":"Adaptation to changes in higher-order stimulus statistics in the salamander retina","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No"},{"intvolume":"       136","day":"11","publist_id":"7513","_id":"332","year":"2014","citation":{"apa":"Yu, X., Shavel, A., An, X., Luo, Z., Ibáñez, M., &#38; Cabot, A. (2014). Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. <i>Journal of the American Chemical Society</i>. ACS. <a href=\"https://doi.org/10.1021/ja502076b\">https://doi.org/10.1021/ja502076b</a>","ama":"Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. <i>Journal of the American Chemical Society</i>. 2014;136(26):9236-9239. doi:<a href=\"https://doi.org/10.1021/ja502076b\">10.1021/ja502076b</a>","ista":"Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. 2014. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. 136(26), 9236–9239.","chicago":"Yu, Xuelian, Alexey Shavel, Xiaoqiang An, Zhishan Luo, Maria Ibáñez, and Andreu Cabot. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for Photocatalytic Water Splitting and Pollutant Degradation.” <i>Journal of the American Chemical Society</i>. ACS, 2014. <a href=\"https://doi.org/10.1021/ja502076b\">https://doi.org/10.1021/ja502076b</a>.","mla":"Yu, Xuelian, et al. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for Photocatalytic Water Splitting and Pollutant Degradation.” <i>Journal of the American Chemical Society</i>, vol. 136, no. 26, ACS, 2014, pp. 9236–39, doi:<a href=\"https://doi.org/10.1021/ja502076b\">10.1021/ja502076b</a>.","ieee":"X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, and A. Cabot, “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation,” <i>Journal of the American Chemical Society</i>, vol. 136, no. 26. ACS, pp. 9236–9239, 2014.","short":"X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, A. Cabot, Journal of the American Chemical Society 136 (2014) 9236–9239."},"date_published":"2014-06-11T00:00:00Z","doi":"10.1021/ja502076b","extern":"1","month":"06","issue":"26","title":"Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation","page":"9236 - 9239","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","article_type":"original","publisher":"ACS","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":136,"publication":"Journal of the American Chemical Society","abstract":[{"lang":"eng","text":"Cu2ZnSnS4, based on abundant and environmental friendly elements and with a direct band gap of 1.5 eV, is a main candidate material for solar energy conversion through both photovoltaics and photocatalysis. We detail here the synthesis of quasi-spherical Cu 2ZnSnS4 nanoparticles with unprecedented narrow size distributions. We further detail their use as seeds to produce CZTS-Au and CZTS-Pt heterostructured nanoparticles. Such heterostructured nanoparticles are shown to have excellent photocatalytic properties toward degradation of Rhodamine B and hydrogen generation by water splitting. "}],"oa_version":"None","publication_status":"published","type":"journal_article","date_created":"2018-12-11T11:45:52Z","author":[{"full_name":"Yu, Xuelian","last_name":"Yu","first_name":"Xuelian"},{"first_name":"Alexey","last_name":"Shavel","full_name":"Shavel, Alexey"},{"full_name":"An, Xiaoqiang","first_name":"Xiaoqiang","last_name":"An"},{"full_name":"Luo, Zhishan","last_name":"Luo","first_name":"Zhishan"},{"last_name":"Ibáñez","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"quality_controlled":"1","date_updated":"2021-01-12T07:42:37Z"},{"status":"public","article_type":"original","article_processing_charge":"No","language":[{"iso":"eng"}],"_id":"13399","year":"2014","intvolume":"         8","title":"Watching single molecules move in response to light","month":"12","scopus_import":"1","extern":"1","date_published":"2014-12-23T00:00:00Z","author":[{"first_name":"Pintu K.","last_name":"Kundu","full_name":"Kundu, Pintu K."},{"full_name":"Klajn, Rafal","last_name":"Klajn","first_name":"Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b"}],"date_created":"2023-08-01T09:45:42Z","date_updated":"2024-10-14T12:18:29Z","publication_identifier":{"issn":["1936-0851"],"eissn":["1936-086X"]},"volume":8,"pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["25474733"]},"oa_version":"None","abstract":[{"lang":"eng","text":"Nature has long inspired scientists with its seemingly unlimited ability to harness solar energy and to utilize it to drive various physiological processes. With the help of man-made molecular photoswitches, we now have the potential to outperform natural systems in many ways, with the ultimate goal of fabricating multifunctional materials that operate at different light wavelengths. An important challenge in developing light-controlled artificial molecular machines lies in attaining a detailed understanding of the photoisomerization-coupled conformational changes that occur in macromolecules and molecular assemblies. In this issue of ACS Nano, Bléger, Rabe, and co-workers use force microscopy to provide interesting insights into the behavior of individual photoresponsive molecules and to identify contraction, extension, and crawling events accompanying light-induced isomerization."}],"page":"11913-11916","keyword":["General Physics and Astronomy","General Engineering","General Materials Science"],"citation":{"mla":"Kundu, Pintu K., and Rafal Klajn. “Watching Single Molecules Move in Response to Light.” <i>ACS Nano</i>, vol. 8, no. 12, American Chemical Society, 2014, pp. 11913–16, doi:<a href=\"https://doi.org/10.1021/nn506656r\">10.1021/nn506656r</a>.","ista":"Kundu PK, Klajn R. 2014. Watching single molecules move in response to light. ACS Nano. 8(12), 11913–11916.","chicago":"Kundu, Pintu K., and Rafal Klajn. “Watching Single Molecules Move in Response to Light.” <i>ACS Nano</i>. American Chemical Society, 2014. <a href=\"https://doi.org/10.1021/nn506656r\">https://doi.org/10.1021/nn506656r</a>.","apa":"Kundu, P. K., &#38; Klajn, R. (2014). Watching single molecules move in response to light. <i>ACS Nano</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/nn506656r\">https://doi.org/10.1021/nn506656r</a>","ama":"Kundu PK, Klajn R. Watching single molecules move in response to light. <i>ACS Nano</i>. 2014;8(12):11913-11916. doi:<a href=\"https://doi.org/10.1021/nn506656r\">10.1021/nn506656r</a>","short":"P.K. Kundu, R. Klajn, ACS Nano 8 (2014) 11913–11916.","ieee":"P. K. Kundu and R. Klajn, “Watching single molecules move in response to light,” <i>ACS Nano</i>, vol. 8, no. 12. American Chemical Society, pp. 11913–11916, 2014."},"day":"23","issue":"12","doi":"10.1021/nn506656r","quality_controlled":"1","type":"journal_article","publication_status":"published","publisher":"American Chemical Society","publication":"ACS Nano"},{"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"date_updated":"2024-10-14T12:20:09Z","author":[{"last_name":"Singh","first_name":"Gurvinder","full_name":"Singh, Gurvinder"},{"last_name":"Chan","first_name":"Henry","full_name":"Chan, Henry"},{"full_name":"Baskin, Artem","first_name":"Artem","last_name":"Baskin"},{"full_name":"Gelman, Elijah","first_name":"Elijah","last_name":"Gelman"},{"last_name":"Repnin","first_name":"Nikita","full_name":"Repnin, Nikita"},{"full_name":"Král, Petr","last_name":"Král","first_name":"Petr"},{"full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal","last_name":"Klajn"}],"date_created":"2023-08-01T09:45:56Z","abstract":[{"text":"Organizing inorganic nanocrystals into complex architectures is challenging and typically relies on preexisting templates, such as properly folded DNA or polypeptide chains. We found that under carefully controlled conditions, cubic nanocrystals of magnetite self-assemble into arrays of helical superstructures in a template-free manner with >99% yield. Computer simulations revealed that the formation of helices is determined by the interplay of van der Waals and magnetic dipole-dipole interactions, Zeeman coupling, and entropic forces and can be attributed to spontaneous formation of chiral nanocube clusters. Neighboring helices within their densely packed ensembles tended to adopt the same handedness in order to maximize packing, thus revealing a novel mechanism of symmetry breaking and chirality amplification.","lang":"eng"}],"oa_version":"None","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["25061133"]},"volume":345,"language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","status":"public","date_published":"2014-07-24T00:00:00Z","title":"Self-assembly of magnetite nanocubes into helical superstructures","month":"07","scopus_import":"1","extern":"1","intvolume":"       345","_id":"13400","year":"2014","type":"journal_article","publication_status":"published","quality_controlled":"1","publication":"Science","publisher":"American Association for the Advancement of Science","keyword":["Multidisciplinary"],"page":"1149-1153","doi":"10.1126/science.1254132","issue":"6201","citation":{"mla":"Singh, Gurvinder, et al. “Self-Assembly of Magnetite Nanocubes into Helical Superstructures.” <i>Science</i>, vol. 345, no. 6201, American Association for the Advancement of Science, 2014, pp. 1149–53, doi:<a href=\"https://doi.org/10.1126/science.1254132\">10.1126/science.1254132</a>.","ama":"Singh G, Chan H, Baskin A, et al. Self-assembly of magnetite nanocubes into helical superstructures. <i>Science</i>. 2014;345(6201):1149-1153. doi:<a href=\"https://doi.org/10.1126/science.1254132\">10.1126/science.1254132</a>","apa":"Singh, G., Chan, H., Baskin, A., Gelman, E., Repnin, N., Král, P., &#38; Klajn, R. (2014). Self-assembly of magnetite nanocubes into helical superstructures. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1254132\">https://doi.org/10.1126/science.1254132</a>","ista":"Singh G, Chan H, Baskin A, Gelman E, Repnin N, Král P, Klajn R. 2014. Self-assembly of magnetite nanocubes into helical superstructures. Science. 345(6201), 1149–1153.","chicago":"Singh, Gurvinder, Henry Chan, Artem Baskin, Elijah Gelman, Nikita Repnin, Petr Král, and Rafal Klajn. “Self-Assembly of Magnetite Nanocubes into Helical Superstructures.” <i>Science</i>. American Association for the Advancement of Science, 2014. <a href=\"https://doi.org/10.1126/science.1254132\">https://doi.org/10.1126/science.1254132</a>.","ieee":"G. Singh <i>et al.</i>, “Self-assembly of magnetite nanocubes into helical superstructures,” <i>Science</i>, vol. 345, no. 6201. American Association for the Advancement of Science, pp. 1149–1153, 2014.","short":"G. Singh, H. Chan, A. Baskin, E. Gelman, N. Repnin, P. Král, R. Klajn, Science 345 (2014) 1149–1153."},"day":"24"},{"date_published":"2014-08-13T00:00:00Z","month":"08","extern":"1","scopus_import":"1","title":"Cyclic kinetics during thermal equilibration of an axially chiral bis-spiropyran","intvolume":"       136","_id":"13401","year":"2014","language":[{"iso":"eng"}],"article_processing_charge":"No","article_type":"original","status":"public","abstract":[{"text":"A compound combining the features of a molecular rotor and a photoswitch was synthesized and was shown to exist as three diastereomers, which interconvert via a reversible cyclic reaction scheme. Each of the three diastereomers was isolated, and by following the equilibration kinetics, activation barriers for all reactions were calculated. The results indicate that the properties of molecular switches depend heavily on their immediate chemical environment. The conclusions are important in the context of designing new switchable molecules and materials.","lang":"eng"}],"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["25072292"]},"pmid":1,"volume":136,"publication_identifier":{"issn":["0002-7863"],"eissn":["1520-5126"]},"date_updated":"2024-10-14T12:20:21Z","date_created":"2023-08-01T09:46:12Z","author":[{"full_name":"Kundu, Pintu K.","first_name":"Pintu K.","last_name":"Kundu"},{"last_name":"Lerner","first_name":"Avishai","full_name":"Lerner, Avishai"},{"full_name":"Kučanda, Kristina","first_name":"Kristina","last_name":"Kučanda"},{"full_name":"Leitus, Gregory","first_name":"Gregory","last_name":"Leitus"},{"id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal","last_name":"Klajn","full_name":"Klajn, Rafal"}],"issue":"32","doi":"10.1021/ja505948q","day":"13","citation":{"short":"P.K. Kundu, A. Lerner, K. Kučanda, G. Leitus, R. Klajn, Journal of the American Chemical Society 136 (2014) 11276–11279.","ieee":"P. K. Kundu, A. Lerner, K. Kučanda, G. Leitus, and R. Klajn, “Cyclic kinetics during thermal equilibration of an axially chiral bis-spiropyran,” <i>Journal of the American Chemical Society</i>, vol. 136, no. 32. American Chemical Society, pp. 11276–11279, 2014.","ista":"Kundu PK, Lerner A, Kučanda K, Leitus G, Klajn R. 2014. Cyclic kinetics during thermal equilibration of an axially chiral bis-spiropyran. Journal of the American Chemical Society. 136(32), 11276–11279.","chicago":"Kundu, Pintu K., Avishai Lerner, Kristina Kučanda, Gregory Leitus, and Rafal Klajn. “Cyclic Kinetics during Thermal Equilibration of an Axially Chiral Bis-Spiropyran.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2014. <a href=\"https://doi.org/10.1021/ja505948q\">https://doi.org/10.1021/ja505948q</a>.","ama":"Kundu PK, Lerner A, Kučanda K, Leitus G, Klajn R. Cyclic kinetics during thermal equilibration of an axially chiral bis-spiropyran. <i>Journal of the American Chemical Society</i>. 2014;136(32):11276-11279. doi:<a href=\"https://doi.org/10.1021/ja505948q\">10.1021/ja505948q</a>","apa":"Kundu, P. K., Lerner, A., Kučanda, K., Leitus, G., &#38; Klajn, R. (2014). Cyclic kinetics during thermal equilibration of an axially chiral bis-spiropyran. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/ja505948q\">https://doi.org/10.1021/ja505948q</a>","mla":"Kundu, Pintu K., et al. “Cyclic Kinetics during Thermal Equilibration of an Axially Chiral Bis-Spiropyran.” <i>Journal of the American Chemical Society</i>, vol. 136, no. 32, American Chemical Society, 2014, pp. 11276–79, doi:<a href=\"https://doi.org/10.1021/ja505948q\">10.1021/ja505948q</a>."},"keyword":["Colloid and Surface Chemistry","Biochemistry","General Chemistry","Catalysis"],"page":"11276-11279","publication":"Journal of the American Chemical Society","publisher":"American Chemical Society","publication_status":"published","type":"journal_article","quality_controlled":"1"},{"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"status":"public","scopus_import":"1","month":"04","extern":"1","title":"Nanoporous frameworks exhibiting multiple stimuli responsiveness","date_published":"2014-04-07T00:00:00Z","year":"2014","_id":"13402","intvolume":"         5","date_updated":"2024-10-14T12:20:30Z","publication_identifier":{"eissn":["2041-1723"]},"date_created":"2023-08-01T09:46:27Z","author":[{"full_name":"Kundu, Pintu K.","last_name":"Kundu","first_name":"Pintu K."},{"first_name":"Gregory L.","last_name":"Olsen","full_name":"Olsen, Gregory L."},{"last_name":"Kiss","first_name":"Vladimir","full_name":"Kiss, Vladimir"},{"full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal","last_name":"Klajn"}],"oa_version":"Published Version","abstract":[{"text":"Nanoporous frameworks are polymeric materials built from rigid molecules, which give rise to their nanoporous structures with applications in gas sorption and storage, catalysis and others. Conceptually new applications could emerge, should these beneficial properties be manipulated by external stimuli in a reversible manner. One approach to render nanoporous frameworks responsive to external signals would be to immobilize molecular switches within their nanopores. Although the majority of molecular switches require conformational freedom to isomerize, and switching in the solid state is prohibited, the nanopores may provide enough room for the switches to efficiently isomerize. Here we describe two families of nanoporous materials incorporating the spiropyran molecular switch. These materials exhibit a variety of interesting properties, including reversible photochromism and acidochromism under solvent-free conditions, light-controlled capture and release of metal ions, as well reversible chromism induced by solvation/desolvation.","lang":"eng"}],"oa":1,"volume":5,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"external_id":{"pmid":["24709950"]},"keyword":["General Physics and Astronomy","General Biochemistry","Genetics and Molecular Biology","General Chemistry","Multidisciplinary"],"doi":"10.1038/ncomms4588","article_number":"3588","day":"07","citation":{"ieee":"P. K. Kundu, G. L. Olsen, V. Kiss, and R. Klajn, “Nanoporous frameworks exhibiting multiple stimuli responsiveness,” <i>Nature Communications</i>, vol. 5. Springer Nature, 2014.","short":"P.K. Kundu, G.L. Olsen, V. Kiss, R. Klajn, Nature Communications 5 (2014).","mla":"Kundu, Pintu K., et al. “Nanoporous Frameworks Exhibiting Multiple Stimuli Responsiveness.” <i>Nature Communications</i>, vol. 5, 3588, Springer Nature, 2014, doi:<a href=\"https://doi.org/10.1038/ncomms4588\">10.1038/ncomms4588</a>.","apa":"Kundu, P. K., Olsen, G. L., Kiss, V., &#38; Klajn, R. (2014). Nanoporous frameworks exhibiting multiple stimuli responsiveness. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/ncomms4588\">https://doi.org/10.1038/ncomms4588</a>","ama":"Kundu PK, Olsen GL, Kiss V, Klajn R. Nanoporous frameworks exhibiting multiple stimuli responsiveness. <i>Nature Communications</i>. 2014;5. doi:<a href=\"https://doi.org/10.1038/ncomms4588\">10.1038/ncomms4588</a>","chicago":"Kundu, Pintu K., Gregory L. Olsen, Vladimir Kiss, and Rafal Klajn. “Nanoporous Frameworks Exhibiting Multiple Stimuli Responsiveness.” <i>Nature Communications</i>. Springer Nature, 2014. <a href=\"https://doi.org/10.1038/ncomms4588\">https://doi.org/10.1038/ncomms4588</a>.","ista":"Kundu PK, Olsen GL, Kiss V, Klajn R. 2014. Nanoporous frameworks exhibiting multiple stimuli responsiveness. Nature Communications. 5, 3588."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/ncomms4588"}],"quality_controlled":"1","publication_status":"published","type":"journal_article","publication":"Nature Communications","publisher":"Springer Nature"},{"page":"2711-2714","keyword":["Colloid and Surface Chemistry","Biochemistry","General Chemistry","Catalysis"],"citation":{"apa":"Zdobinsky, T., Sankar Maiti, P., &#38; Klajn, R. (2014). Support curvature and conformational freedom control chemical reactivity of immobilized species. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/ja411573a\">https://doi.org/10.1021/ja411573a</a>","ama":"Zdobinsky T, Sankar Maiti P, Klajn R. Support curvature and conformational freedom control chemical reactivity of immobilized species. <i>Journal of the American Chemical Society</i>. 2014;136(7):2711-2714. doi:<a href=\"https://doi.org/10.1021/ja411573a\">10.1021/ja411573a</a>","ista":"Zdobinsky T, Sankar Maiti P, Klajn R. 2014. Support curvature and conformational freedom control chemical reactivity of immobilized species. Journal of the American Chemical Society. 136(7), 2711–2714.","chicago":"Zdobinsky, Tino, Pradipta Sankar Maiti, and Rafal Klajn. “Support Curvature and Conformational Freedom Control Chemical Reactivity of Immobilized Species.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2014. <a href=\"https://doi.org/10.1021/ja411573a\">https://doi.org/10.1021/ja411573a</a>.","mla":"Zdobinsky, Tino, et al. “Support Curvature and Conformational Freedom Control Chemical Reactivity of Immobilized Species.” <i>Journal of the American Chemical Society</i>, vol. 136, no. 7, American Chemical Society, 2014, pp. 2711–14, doi:<a href=\"https://doi.org/10.1021/ja411573a\">10.1021/ja411573a</a>.","ieee":"T. Zdobinsky, P. Sankar Maiti, and R. Klajn, “Support curvature and conformational freedom control chemical reactivity of immobilized species,” <i>Journal of the American Chemical Society</i>, vol. 136, no. 7. American Chemical Society, pp. 2711–2714, 2014.","short":"T. Zdobinsky, P. Sankar Maiti, R. Klajn, Journal of the American Chemical Society 136 (2014) 2711–2714."},"day":"19","doi":"10.1021/ja411573a","issue":"7","quality_controlled":"1","type":"journal_article","publication_status":"published","publisher":"American Chemical Society","publication":"Journal of the American Chemical Society","status":"public","article_type":"original","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2014","_id":"13403","intvolume":"       136","title":"Support curvature and conformational freedom control chemical reactivity of immobilized species","month":"02","scopus_import":"1","extern":"1","date_published":"2014-02-19T00:00:00Z","author":[{"last_name":"Zdobinsky","first_name":"Tino","full_name":"Zdobinsky, Tino"},{"full_name":"Sankar Maiti, Pradipta","last_name":"Sankar Maiti","first_name":"Pradipta"},{"id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","last_name":"Klajn","first_name":"Rafal","full_name":"Klajn, Rafal"}],"date_created":"2023-08-01T09:46:44Z","date_updated":"2024-10-14T12:20:41Z","publication_identifier":{"issn":["0002-7863"],"eissn":["1520-5126"]},"volume":136,"external_id":{"pmid":["24320557"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"oa_version":"None","abstract":[{"text":"We show that bimolecular reactions between species confined to the surfaces of nanoparticles can be manipulated by the nature of the linker, as well as by the curvature of the underlying particles.","lang":"eng"}]},{"keyword":["General Chemistry"],"page":"148-184","doi":"10.1039/c3cs60181a","issue":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1039/C3CS60181A"}],"citation":{"mla":"Klajn, Rafal. “Spiropyran-Based Dynamic Materials.” <i>Chemical Society Reviews</i>, vol. 43, no. 1, Royal Society of Chemistry, 2014, pp. 148–84, doi:<a href=\"https://doi.org/10.1039/c3cs60181a\">10.1039/c3cs60181a</a>.","ama":"Klajn R. Spiropyran-based dynamic materials. <i>Chemical Society Reviews</i>. 2014;43(1):148-184. doi:<a href=\"https://doi.org/10.1039/c3cs60181a\">10.1039/c3cs60181a</a>","apa":"Klajn, R. (2014). Spiropyran-based dynamic materials. <i>Chemical Society Reviews</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c3cs60181a\">https://doi.org/10.1039/c3cs60181a</a>","chicago":"Klajn, Rafal. “Spiropyran-Based Dynamic Materials.” <i>Chemical Society Reviews</i>. Royal Society of Chemistry, 2014. <a href=\"https://doi.org/10.1039/c3cs60181a\">https://doi.org/10.1039/c3cs60181a</a>.","ista":"Klajn R. 2014. Spiropyran-based dynamic materials. Chemical Society Reviews. 43(1), 148–184.","ieee":"R. Klajn, “Spiropyran-based dynamic materials,” <i>Chemical Society Reviews</i>, vol. 43, no. 1. Royal Society of Chemistry, pp. 148–184, 2014.","short":"R. Klajn, Chemical Society Reviews 43 (2014) 148–184."},"day":"27","quality_controlled":"1","type":"journal_article","publication_status":"published","publication":"Chemical Society Reviews","publisher":"Royal Society of Chemistry","article_type":"original","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","title":"Spiropyran-based dynamic materials","month":"01","scopus_import":"1","extern":"1","date_published":"2014-01-27T00:00:00Z","_id":"13404","year":"2014","intvolume":"        43","date_updated":"2024-10-14T12:20:49Z","publication_identifier":{"issn":["0306-0012"],"eissn":["1460-4744"]},"author":[{"full_name":"Klajn, Rafal","last_name":"Klajn","first_name":"Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b"}],"date_created":"2023-08-01T09:47:03Z","oa_version":"Published Version","abstract":[{"text":"In the past few years, spiropyran has emerged as the molecule-of-choice for the construction of novel dynamic materials. This unique molecular switch undergoes structural isomerisation in response to a variety of orthogonal stimuli, e.g. light, temperature, metal ions, redox potential, and mechanical stress. Incorporation of this switch onto macromolecular supports or inorganic scaffolds allows for the creation of robust dynamic materials. This review discusses the synthesis, switching conditions, and use of dynamic materials in which spiropyran has been attached to the surfaces of polymers, biomacromolecules, inorganic nanoparticles, as well as solid surfaces. The resulting materials show fascinating properties whereby the state of the switch intimately affects a multitude of useful properties of the support. The utility of the spiropyran switch will undoubtedly endow these materials with far-reaching applications in the near future.","lang":"eng"}],"volume":43,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["23979515"]},"pmid":1}]