[{"author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F","full_name":"Alwen, Joel F"},{"full_name":"De Rezende, Susanna","last_name":"De Rezende","first_name":"Susanna"},{"full_name":"Nordstrom, Jakob","first_name":"Jakob","last_name":"Nordstrom"},{"first_name":"Marc","last_name":"Vinyals","full_name":"Vinyals, Marc"}],"file":[{"file_size":557769,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","checksum":"dbc94810be07c2fb1945d5c2a6130e6c","file_id":"5263","creator":"system","date_created":"2018-12-12T10:17:11Z","file_name":"IST-2018-927-v1+1_LIPIcs-ITCS-2017-38.pdf","date_updated":"2020-07-14T12:44:37Z"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01","alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","title":"Cumulative space in black-white pebbling and resolution","type":"conference","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","date_created":"2018-12-11T11:50:33Z","page":"38:1-38-21","editor":[{"full_name":"Papadimitriou, Christos","first_name":"Christos","last_name":"Papadimitriou"}],"quality_controlled":"1","volume":67,"pubrep_id":"927","publist_id":"6179","_id":"1175","abstract":[{"text":"We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation.  Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the non- deterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10–15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure.","lang":"eng"}],"date_updated":"2021-01-12T06:48:51Z","year":"2017","month":"01","status":"public","publication_identifier":{"issn":["18688969"]},"oa":1,"oa_version":"Published Version","date_published":"2017-01-01T00:00:00Z","doi":"10.4230/LIPIcs.ITCS.2017.38","conference":{"start_date":"2017-01-09","name":"ITCS: Innovations in Theoretical Computer Science","end_date":"2017-01-11","location":"Berkeley, CA, United States"},"publication_status":"published","intvolume":"        67","citation":{"ama":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:38:1-38-21. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">10.4230/LIPIcs.ITCS.2017.38</a>","ieee":"J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space in black-white pebbling and resolution,” presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.","short":"J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.","chicago":"Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">https://doi.org/10.4230/LIPIcs.ITCS.2017.38</a>.","apa":"Alwen, J. F., De Rezende, S., Nordstrom, J., &#38; Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">https://doi.org/10.4230/LIPIcs.ITCS.2017.38</a>","ista":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.","mla":"Alwen, Joel F., et al. <i>Cumulative Space in Black-White Pebbling and Resolution</i>. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">10.4230/LIPIcs.ITCS.2017.38</a>."},"scopus_import":1,"file_date_updated":"2020-07-14T12:44:37Z","ddc":["005","600"]},{"oa":1,"publication_identifier":{"isbn":["978-150905761-0"]},"status":"public","month":"07","year":"2017","abstract":[{"lang":"eng","text":"The algorithm Argon2i-B of Biryukov, Dinu and Khovratovich is currently being considered by the IRTF (Internet Research Task Force) as a new de-facto standard for password hashing. An older version (Argon2i-A) of the same algorithm was chosen as the winner of the recent Password Hashing Competition. An important competitor to Argon2i-B is the recently introduced Balloon Hashing (BH) algorithm of Corrigan-Gibs, Boneh and Schechter. A key security desiderata for any such algorithm is that evaluating it (even using a custom device) requires a large amount of memory amortized across multiple instances. Alwen and Blocki (CRYPTO 2016) introduced a class of theoretical attacks against Argon2i-A and BH. While these attacks yield large asymptotic reductions in the amount of memory, it was not, a priori, clear if (1) they can be extended to the newer Argon2i-B, (2) the attacks are effective on any algorithm for practical parameter ranges (e.g., 1GB of memory) and (3) if they can be effectively instantiated against any algorithm under realistic hardware constrains. In this work we answer all three of these questions in the affirmative for all three algorithms. This is also the first work to analyze the security of Argon2i-B. In more detail, we extend the theoretical attacks of Alwen and Blocki (CRYPTO 2016) to the recent Argon2i-B proposal demonstrating severe asymptotic deficiencies in its security. Next we introduce several novel heuristics for improving the attack's concrete memory efficiency even when on-chip memory bandwidth is bounded. We then simulate our attacks on randomly sampled Argon2i-A, Argon2i-B and BH instances and measure the resulting memory consumption for various practical parameter ranges and for a variety of upperbounds on the amount of parallelism available to the attacker. Finally we describe, implement, and test a new heuristic for applying the Alwen-Blocki attack to functions employing a technique developed by Corrigan-Gibs et al. for improving concrete security of memory-hard functions. We analyze the collected data and show the effects various parameters have on the memory consumption of the attack. In particular, we can draw several interesting conclusions about the level of security provided by these functions. · For the Alwen-Blocki attack to fail against practical memory parameters, Argon2i-B must be instantiated with more than 10 passes on memory - beyond the \"paranoid\" parameter setting in the current IRTF proposal. · The technique of Corrigan-Gibs for improving security can also be overcome by the Alwen-Blocki attack under realistic hardware constraints. · On a positive note, both the asymptotic and concrete security of Argon2i-B seem to improve on that of Argon2i-A."}],"date_updated":"2023-09-20T11:22:25Z","_id":"1176","article_number":"7961977","scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2016/759","open_access":"1"}],"citation":{"ista":"Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&#38;P: European Symposium on Security and Privacy, 7961977.","apa":"Alwen, J. F., &#38; Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&#38;P: European Symposium on Security and Privacy, Paris, France: IEEE. <a href=\"https://doi.org/10.1109/EuroSP.2017.47\">https://doi.org/10.1109/EuroSP.2017.47</a>","mla":"Alwen, Joel F., and Jeremiah Blocki. <i>Towards Practical Attacks on Argon2i and Balloon Hashing</i>. 7961977, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/EuroSP.2017.47\">10.1109/EuroSP.2017.47</a>.","chicago":"Alwen, Joel F, and Jeremiah Blocki. “Towards Practical Attacks on Argon2i and Balloon Hashing.” IEEE, 2017. <a href=\"https://doi.org/10.1109/EuroSP.2017.47\">https://doi.org/10.1109/EuroSP.2017.47</a>.","ama":"Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing. In: IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/EuroSP.2017.47\">10.1109/EuroSP.2017.47</a>","ieee":"J. F. Alwen and J. Blocki, “Towards practical attacks on Argon2i and balloon hashing,” presented at the EuroS&#38;P: European Symposium on Security and Privacy, Paris, France, 2017.","short":"J.F. Alwen, J. Blocki, in:, IEEE, 2017."},"doi":"10.1109/EuroSP.2017.47","publication_status":"published","conference":{"end_date":"2017-04-28","location":"Paris, France","start_date":"2017-04-26","name":"EuroS&P: European Symposium on Security and Privacy"},"date_published":"2017-07-03T00:00:00Z","oa_version":"Submitted Version","title":"Towards practical attacks on Argon2i and balloon hashing","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"IEEE","day":"03","isi":1,"author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F","full_name":"Alwen, Joel F"},{"last_name":"Blocki","first_name":"Jeremiah","full_name":"Blocki, Jeremiah"}],"article_processing_charge":"No","publist_id":"6178","quality_controlled":"1","external_id":{"isi":["000424197300011"]},"date_created":"2018-12-11T11:50:33Z","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"type":"conference"},{"language":[{"iso":"eng"}],"date_published":"2017-12-22T00:00:00Z","oa_version":"None","type":"conference","date_created":"2022-08-08T13:16:37Z","page":"40–44","publication":"44th International Conference on Current Trends in Theory and Practice of Computer Science","conference":{"name":"SOFSEM: Theory and Practice of Computer Science","start_date":"2018-01-29","location":"Krems, Austria","end_date":"2018-02-02"},"publication_status":"published","doi":"10.1007/978-3-319-73117-9_3","intvolume":"     10706","citation":{"ista":"Henzinger MH. 2017. The state of the art in dynamic graph algorithms. 44th International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM: Theory and Practice of Computer Science, LNCS, vol. 10706, 40–44.","apa":"Henzinger, M. H. (2017). The state of the art in dynamic graph algorithms. In <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i> (Vol. 10706, pp. 40–44). Krems, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">https://doi.org/10.1007/978-3-319-73117-9_3</a>","mla":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>, vol. 10706, Springer Nature, 2017, pp. 40–44, doi:<a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">10.1007/978-3-319-73117-9_3</a>.","chicago":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” In <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>, 10706:40–44. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">https://doi.org/10.1007/978-3-319-73117-9_3</a>.","short":"M.H. Henzinger, in:, 44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.","ieee":"M. H. Henzinger, “The state of the art in dynamic graph algorithms,” in <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>, Krems, Austria, 2017, vol. 10706, pp. 40–44.","ama":"Henzinger MH. The state of the art in dynamic graph algorithms. In: <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>. Vol 10706. Springer Nature; 2017:40–44. doi:<a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">10.1007/978-3-319-73117-9_3</a>"},"volume":10706,"quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","_id":"11772","author":[{"first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"}],"day":"22","year":"2017","extern":"1","date_updated":"2023-02-10T08:36:03Z","abstract":[{"lang":"eng","text":"A dynamic graph algorithm is a data structure that supports operations on dynamically changing graphs."}],"month":"12","alternative_title":["LNCS"],"title":"The state of the art in dynamic graph algorithms","publication_identifier":{"isbn":["9783319731162"],"eisbn":["9783319731179"],"issn":["0302-9743"]},"status":"public","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"type":"conference","language":[{"iso":"eng"}],"page":"159 - 179","date_created":"2018-12-11T11:50:34Z","volume":9985,"quality_controlled":"1","external_id":{"isi":["000390176000007"]},"article_processing_charge":"No","publist_id":"6176","isi":1,"author":[{"first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski","full_name":"Skórski, Maciej"}],"acknowledgement":"This work was supported by the National Science Center, Poland (2015/17/N/ST6/03564).","extern":"1","day":"01","alternative_title":["LNCS"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Springer","title":"Simulating auxiliary inputs, revisited","oa_version":"Submitted Version","date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-662-53641-4_7","conference":{"name":"TCC: Theory of Cryptography Conference"},"publication_status":"published","intvolume":"      9985","citation":{"short":"M. Skórski, in:, Springer, 2017, pp. 159–179.","ama":"Skórski M. Simulating auxiliary inputs, revisited. In: Vol 9985. Springer; 2017:159-179. doi:<a href=\"https://doi.org/10.1007/978-3-662-53641-4_7\">10.1007/978-3-662-53641-4_7</a>","ieee":"M. Skórski, “Simulating auxiliary inputs, revisited,” presented at the TCC: Theory of Cryptography Conference, 2017, vol. 9985, pp. 159–179.","chicago":"Skórski, Maciej. “Simulating Auxiliary Inputs, Revisited,” 9985:159–79. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-662-53641-4_7\">https://doi.org/10.1007/978-3-662-53641-4_7</a>.","apa":"Skórski, M. (2017). Simulating auxiliary inputs, revisited (Vol. 9985, pp. 159–179). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-662-53641-4_7\">https://doi.org/10.1007/978-3-662-53641-4_7</a>","ista":"Skórski M. 2017. Simulating auxiliary inputs, revisited. TCC: Theory of Cryptography Conference, LNCS, vol. 9985, 159–179.","mla":"Skórski, Maciej. <i>Simulating Auxiliary Inputs, Revisited</i>. Vol. 9985, Springer, 2017, pp. 159–79, doi:<a href=\"https://doi.org/10.1007/978-3-662-53641-4_7\">10.1007/978-3-662-53641-4_7</a>."},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/808.pdf "}],"_id":"1178","abstract":[{"text":"For any pair (X, Z) of correlated random variables we can think of Z as a randomized function of X. If the domain of Z is small, one can make this function computationally efficient by allowing it to be only approximately correct. In folklore this problem is known as simulating auxiliary inputs. This idea of simulating auxiliary information turns out to be a very usefull tool, finding applications in complexity theory, cryptography, pseudorandomness and zero-knowledge. In this paper we revisit this problem, achieving the following results: (a) We present a novel boosting algorithm for constructing the simulator. This boosting proof is of independent interest, as it shows how to handle “negative mass” issues when constructing probability measures by shifting distinguishers in descent algorithms. Our technique essentially fixes the flaw in the TCC’14 paper “How to Fake Auxiliary Inputs”. (b) The complexity of our simulator is better than in previous works, including results derived from the uniform min-max theorem due to Vadhan and Zheng. To achieve (s,ϵ) -indistinguishability we need the complexity O(s⋅25ℓϵ−2) in time/circuit size, which improve previous bounds by a factor of ϵ−2. In particular, with we get meaningful provable security for the EUROCRYPT’09 leakage-resilient stream cipher instantiated with a standard 256-bit block cipher, like ","lang":"eng"}],"date_updated":"2023-09-20T11:21:57Z","year":"2017","month":"01","status":"public","oa":1},{"oa":1,"title":"Time-space trade-offs in population protocols","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"SIAM","month":"01","year":"2017","extern":"1","day":"01","acknowledgement":"Dan  Alistarh  was  supported  by  a  Swiss  National  Science\r\nFoundation Ambizione Fellowship.  James Aspnes was supported  by  the  National  Science  Foundation  under  grants\r\nCCF-1637385 and CCF-1650596.  Rati Gelashvili was supported  by  the  National  Science  Foundation  under  grants\r\nCCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and\r\nOracle and Intel corporations.\r\nThe  authors  would  like  to  thank  David  Doty,  David\r\nSoloveichik,  and Milan Vojnovic for insightful discussions\r\nand feedback during the development of this work.","abstract":[{"text":"Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as leader election (which requires convergence to a single agent in a special &quot;leader&quot; state), and majority (in which agents must converge to a decision as to which of two possible initial states had higher initial count). Known results point towards an inherent trade-off between the time complexity of such algorithms, and the space complexity, i.e. size of the memory available to each agent. In this paper, we explore this trade-off and provide new upper and lower bounds for majority and leader election. First, we prove a unified lower bound, which relates the space available per node with the time complexity achievable by a protocol: for instance, our result implies that any protocol solving either of these tasks for n agents using O(log log n) states must take (n=polylogn) expected time. This is the first result to characterize time complexity for protocols which employ super-constant number of states per node, and proves that fast, poly-logarithmic running times require protocols to have relatively large space costs. On the positive side, we give algorithms showing that fast, poly-logarithmic convergence time can be achieved using O(log2 n) space per node, in the case of both tasks. Overall, our results highlight a time complexity separation between O(log log n) and (log2 n) state space size for both majority and leader election in population protocols, and introduce new techniques, which should be applicable more broadly.","lang":"eng"}],"date_updated":"2023-02-23T13:19:13Z","_id":"787","author":[{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"first_name":"James","last_name":"Aspnes","full_name":"Aspnes, James"},{"last_name":"Eisenstat","first_name":"David","full_name":"Eisenstat, David"},{"last_name":"Rivest","first_name":"Ronald","full_name":"Rivest, Ronald"},{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"}],"publist_id":"6869","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.08032"}],"citation":{"short":"D.-A. Alistarh, J. Aspnes, D. Eisenstat, R. Rivest, R. Gelashvili, in:, SIAM, 2017, pp. 2560–2579.","ieee":"D.-A. Alistarh, J. Aspnes, D. Eisenstat, R. Rivest, and R. Gelashvili, “Time-space trade-offs in population protocols,” presented at the SODA: Symposium on Discrete Algorithms, 2017, pp. 2560–2579.","ama":"Alistarh D-A, Aspnes J, Eisenstat D, Rivest R, Gelashvili R. Time-space trade-offs in population protocols. In: SIAM; 2017:2560-2579. doi:<a href=\"https://doi.org/doi.org/10.1137/1.9781611974782.169\">doi.org/10.1137/1.9781611974782.169</a>","apa":"Alistarh, D.-A., Aspnes, J., Eisenstat, D., Rivest, R., &#38; Gelashvili, R. (2017). Time-space trade-offs in population protocols (pp. 2560–2579). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. <a href=\"https://doi.org/doi.org/10.1137/1.9781611974782.169\">https://doi.org/doi.org/10.1137/1.9781611974782.169</a>","mla":"Alistarh, Dan-Adrian, et al. <i>Time-Space Trade-Offs in Population Protocols</i>. SIAM, 2017, pp. 2560–79, doi:<a href=\"https://doi.org/doi.org/10.1137/1.9781611974782.169\">doi.org/10.1137/1.9781611974782.169</a>.","ista":"Alistarh D-A, Aspnes J, Eisenstat D, Rivest R, Gelashvili R. 2017. Time-space trade-offs in population protocols. SODA: Symposium on Discrete Algorithms, 2560–2579.","chicago":"Alistarh, Dan-Adrian, James Aspnes, David Eisenstat, Ronald Rivest, and Rati Gelashvili. “Time-Space Trade-Offs in Population Protocols,” 2560–79. SIAM, 2017. <a href=\"https://doi.org/doi.org/10.1137/1.9781611974782.169\">https://doi.org/doi.org/10.1137/1.9781611974782.169</a>."},"page":"2560 - 2579","date_created":"2018-12-11T11:48:30Z","doi":"doi.org/10.1137/1.9781611974782.169","publication_status":"published","conference":{"name":"SODA: Symposium on Discrete Algorithms"},"date_published":"2017-01-01T00:00:00Z","language":[{"iso":"eng"}],"type":"conference","oa_version":"None"},{"language":[{"iso":"eng"}],"type":"conference","date_created":"2018-12-11T11:48:30Z","page":"155 - 171","external_id":{"arxiv":["1706.09937"]},"quality_controlled":"1","volume":"10467 LNCS","publist_id":"6868","article_processing_charge":"No","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Dudek, Bartłomiej","last_name":"Dudek","first_name":"Bartłomiej"},{"last_name":"Kosowski","first_name":"Adrian","full_name":"Kosowski, Adrian"},{"last_name":"Soloveichik","first_name":"David","full_name":"Soloveichik, David"},{"last_name":"Uznański","first_name":"Przemysław","full_name":"Uznański, Przemysław"}],"day":"01","extern":"1","acknowledgement":"D. Alistarh - Supported by an SNF Ambizione Fellowship. A. Kosowski — Supported by Inria project GANG, ANR project DESCARTES, and\r\nNCN grant 2015/17/B/ST6/01897. D. Soloveichik — Supported by NSF grants CCF-1618895 and CCF-1652824.\r\n\r\n","alternative_title":["LNCS"],"title":"Robust detection in leak-prone population protocols","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-01-01T00:00:00Z","oa_version":"None","publication_status":"published","conference":{"name":"DNA Computing and Molecular Programming"},"doi":"10.1007/978-3-319-66799-7_11","citation":{"ieee":"D.-A. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, and P. Uznański, “Robust detection in leak-prone population protocols,” presented at the DNA Computing and Molecular Programming, 2017, vol. 10467 LNCS, pp. 155–171.","ama":"Alistarh D-A, Dudek B, Kosowski A, Soloveichik D, Uznański P. Robust detection in leak-prone population protocols. In: Vol 10467 LNCS. Springer; 2017:155-171. doi:<a href=\"https://doi.org/10.1007/978-3-319-66799-7_11\">10.1007/978-3-319-66799-7_11</a>","short":"D.-A. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, P. Uznański, in:, Springer, 2017, pp. 155–171.","chicago":"Alistarh, Dan-Adrian, Bartłomiej Dudek, Adrian Kosowski, David Soloveichik, and Przemysław Uznański. “Robust Detection in Leak-Prone Population Protocols,” 10467 LNCS:155–71. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-66799-7_11\">https://doi.org/10.1007/978-3-319-66799-7_11</a>.","ista":"Alistarh D-A, Dudek B, Kosowski A, Soloveichik D, Uznański P. 2017. Robust detection in leak-prone population protocols. DNA Computing and Molecular Programming, LNCS, vol. 10467 LNCS, 155–171.","apa":"Alistarh, D.-A., Dudek, B., Kosowski, A., Soloveichik, D., &#38; Uznański, P. (2017). Robust detection in leak-prone population protocols (Vol. 10467 LNCS, pp. 155–171). Presented at the DNA Computing and Molecular Programming, Springer. <a href=\"https://doi.org/10.1007/978-3-319-66799-7_11\">https://doi.org/10.1007/978-3-319-66799-7_11</a>","mla":"Alistarh, Dan-Adrian, et al. <i>Robust Detection in Leak-Prone Population Protocols</i>. Vol. 10467 LNCS, Springer, 2017, pp. 155–71, doi:<a href=\"https://doi.org/10.1007/978-3-319-66799-7_11\">10.1007/978-3-319-66799-7_11</a>."},"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1706.09937","open_access":"1"}],"_id":"788","year":"2017","date_updated":"2022-03-18T12:48:02Z","arxiv":1,"abstract":[{"lang":"eng","text":"In contrast to electronic computation, chemical computation is noisy and susceptible to a variety of sources of error, which has prevented the construction of robust complex systems. To be effective, chemical algorithms must be designed with an appropriate error model in mind. Here we consider the model of chemical reaction networks that preserve molecular count (population protocols), and ask whether computation can be made robust to a natural model of unintended “leak” reactions. Our definition of leak is motivated by both the particular spurious behavior seen when implementing chemical reaction networks with DNA strand displacement cascades, as well as the unavoidable side reactions in any implementation due to the basic laws of chemistry. We develop a new “Robust Detection” algorithm for the problem of fast (logarithmic time) single molecule detection, and prove that it is robust to this general model of leaks. Besides potential applications in single molecule detection, the error-correction ideas developed here might enable a new class of robust-by-design chemical algorithms. Our analysis is based on a non-standard hybrid argument, combining ideas from discrete analysis of population protocols with classic Markov chain techniques."}],"month":"01","oa":1,"status":"public"},{"_id":"789","author":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"full_name":"Leiserson, William","first_name":"William","last_name":"Leiserson"},{"full_name":"Matveev, Alexander","first_name":"Alexander","last_name":"Matveev"},{"full_name":"Shavit, Nir","first_name":"Nir","last_name":"Shavit"}],"day":"01","extern":"1","year":"2017","date_updated":"2023-02-23T13:19:44Z","abstract":[{"text":"The problem of efficient concurrent memory reclamation in unmanaged languages such as C or C++ is one of the major challenges facing the parallelization of billions of lines of legacy code. Garbage collectors for C/C++ can be inefficient; thus, programmers are often forced to use finely-crafted concurrent memory reclamation techniques. These techniques can provide good performance, but require considerable programming effort to deploy, and have strict requirements, allowing the programmer very little room for error. In this work, we present Forkscan, a new conservative concurrent memory reclamation scheme which is fully automatic and surprisingly scalable. Forkscan's semantics place it between automatic garbage collectors (it requires the programmer to explicitly retire nodes before they can be reclaimed), and concurrent memory reclamation techniques (as it does not assume that nodes are completely unlinked from the data structure for correctness). Forkscan's implementation exploits these new semantics for efficiency: we leverage parallelism and optimized implementations of signaling and copy-on-write in modern operating systems to efficiently obtain and process consistent snapshots of memory that can be scanned concurrently with the normal program operation. Empirical evaluation on a range of classical concurrent data structure microbenchmarks shows that Forkscan can preserve the scalability of the original code, while maintaining an order of magnitude lower latency than automatic garbage collection, and demonstrating competitive performance with finely crafted memory reclamation techniques.","lang":"eng"}],"acknowledgement":"William Leiserson, Alexander Matveev, and Nir Shavit were supported by the NSF under grants IIS-1447786 and CCF-1563880, and Dan Alistarh was supported by a Swiss National Fund Ambizione Fellowship.","month":"01","title":"Forkscan: Conservative memory reclamation for modern operating systems","status":"public","publisher":"ACM","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_published":"2017-01-01T00:00:00Z","type":"conference","oa_version":"None","page":"483 - 498","date_created":"2018-12-11T11:48:30Z","conference":{"name":"EuroSys: European Conference on Computer Systems"},"publication_status":"published","doi":"10.1145/3064176.3064214","citation":{"mla":"Alistarh, Dan-Adrian, et al. <i>Forkscan: Conservative Memory Reclamation for Modern Operating Systems</i>. ACM, 2017, pp. 483–98, doi:<a href=\"https://doi.org/10.1145/3064176.3064214\">10.1145/3064176.3064214</a>.","apa":"Alistarh, D.-A., Leiserson, W., Matveev, A., &#38; Shavit, N. (2017). Forkscan: Conservative memory reclamation for modern operating systems (pp. 483–498). Presented at the EuroSys: European Conference on Computer Systems, ACM. <a href=\"https://doi.org/10.1145/3064176.3064214\">https://doi.org/10.1145/3064176.3064214</a>","ista":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2017. Forkscan: Conservative memory reclamation for modern operating systems. EuroSys: European Conference on Computer Systems, 483–498.","chicago":"Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “Forkscan: Conservative Memory Reclamation for Modern Operating Systems,” 483–98. ACM, 2017. <a href=\"https://doi.org/10.1145/3064176.3064214\">https://doi.org/10.1145/3064176.3064214</a>.","ieee":"D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “Forkscan: Conservative memory reclamation for modern operating systems,” presented at the EuroSys: European Conference on Computer Systems, 2017, pp. 483–498.","ama":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. Forkscan: Conservative memory reclamation for modern operating systems. In: ACM; 2017:483-498. doi:<a href=\"https://doi.org/10.1145/3064176.3064214\">10.1145/3064176.3064214</a>","short":"D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, in:, ACM, 2017, pp. 483–498."},"publist_id":"6867","article_processing_charge":"No"},{"month":"06","title":"FPGA-accelerated dense linear machine learning: A precision-convergence trade-off","status":"public","publisher":"IEEE","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"790","author":[{"full_name":"Kara, Kaan","last_name":"Kara","first_name":"Kaan"},{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Alonso","first_name":"Gustavo","full_name":"Alonso, Gustavo"},{"full_name":"Mutlu, Onur","first_name":"Onur","last_name":"Mutlu"},{"last_name":"Zhang","first_name":"Ce","full_name":"Zhang, Ce"}],"day":"30","year":"2017","extern":"1","date_updated":"2023-02-23T13:19:52Z","abstract":[{"text":"Stochastic gradient descent (SGD) is a commonly used algorithm for training linear machine learning models. Based on vector algebra, it benefits from the inherent parallelism available in an FPGA. In this paper, we first present a single-precision floating-point SGD implementation on an FPGA that provides similar performance as a 10-core CPU. We then adapt the design to make it capable of processing low-precision data. The low-precision data is obtained from a novel compression scheme - called stochastic quantization, specifically designed for machine learning applications. We test both full-precision and low-precision designs on various regression and classification data sets. We achieve up to an order of magnitude training speedup when using low-precision data compared to a full-precision SGD on the same FPGA and a state-of-the-art multi-core solution, while maintaining the quality of training. We open source the designs presented in this paper.","lang":"eng"}],"citation":{"chicago":"Kara, Kaan, Dan-Adrian Alistarh, Gustavo Alonso, Onur Mutlu, and Ce Zhang. “FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off,” 160–67. IEEE, 2017. <a href=\"https://doi.org/10.1109/FCCM.2017.39\">https://doi.org/10.1109/FCCM.2017.39</a>.","mla":"Kara, Kaan, et al. <i>FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off</i>. IEEE, 2017, pp. 160–67, doi:<a href=\"https://doi.org/10.1109/FCCM.2017.39\">10.1109/FCCM.2017.39</a>.","apa":"Kara, K., Alistarh, D.-A., Alonso, G., Mutlu, O., &#38; Zhang, C. (2017). FPGA-accelerated dense linear machine learning: A precision-convergence trade-off (pp. 160–167). Presented at the FCCM: Field-Programmable Custom Computing Machines, IEEE. <a href=\"https://doi.org/10.1109/FCCM.2017.39\">https://doi.org/10.1109/FCCM.2017.39</a>","ista":"Kara K, Alistarh D-A, Alonso G, Mutlu O, Zhang C. 2017. FPGA-accelerated dense linear machine learning: A precision-convergence trade-off. FCCM: Field-Programmable Custom Computing Machines, 160–167.","ama":"Kara K, Alistarh D-A, Alonso G, Mutlu O, Zhang C. FPGA-accelerated dense linear machine learning: A precision-convergence trade-off. In: IEEE; 2017:160-167. doi:<a href=\"https://doi.org/10.1109/FCCM.2017.39\">10.1109/FCCM.2017.39</a>","ieee":"K. Kara, D.-A. Alistarh, G. Alonso, O. Mutlu, and C. Zhang, “FPGA-accelerated dense linear machine learning: A precision-convergence trade-off,” presented at the FCCM: Field-Programmable Custom Computing Machines, 2017, pp. 160–167.","short":"K. Kara, D.-A. Alistarh, G. Alonso, O. Mutlu, C. Zhang, in:, IEEE, 2017, pp. 160–167."},"publist_id":"6865","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2017-06-30T00:00:00Z","oa_version":"None","type":"conference","date_created":"2018-12-11T11:48:31Z","page":"160 - 167","conference":{"name":"FCCM: Field-Programmable Custom Computing Machines"},"publication_status":"published","doi":"10.1109/FCCM.2017.39"},{"citation":{"mla":"Alistarh, Dan-Adrian, et al. “The Power of Choice in Priority Scheduling.” <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, vol. Part F129314, ACM, 2017, pp. 283–92, doi:<a href=\"https://doi.org/10.1145/3087801.3087810\">10.1145/3087801.3087810</a>.","ista":"Alistarh D-A, Kopinsky J, Li J, Nadiradze G. 2017. The power of choice in priority scheduling. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing vol. Part F129314, 283–292.","apa":"Alistarh, D.-A., Kopinsky, J., Li, J., &#38; Nadiradze, G. (2017). The power of choice in priority scheduling. In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i> (Vol. Part F129314, pp. 283–292). Washington, WA, USA: ACM. <a href=\"https://doi.org/10.1145/3087801.3087810\">https://doi.org/10.1145/3087801.3087810</a>","chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Giorgi Nadiradze. “The Power of Choice in Priority Scheduling.” In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, Part F129314:283–92. ACM, 2017. <a href=\"https://doi.org/10.1145/3087801.3087810\">https://doi.org/10.1145/3087801.3087810</a>.","short":"D.-A. Alistarh, J. Kopinsky, J. Li, G. Nadiradze, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, 2017, pp. 283–292.","ama":"Alistarh D-A, Kopinsky J, Li J, Nadiradze G. The power of choice in priority scheduling. In: <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>. Vol Part F129314. ACM; 2017:283-292. doi:<a href=\"https://doi.org/10.1145/3087801.3087810\">10.1145/3087801.3087810</a>","ieee":"D.-A. Alistarh, J. Kopinsky, J. Li, and G. Nadiradze, “The power of choice in priority scheduling,” in <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, Washington, WA, USA, 2017, vol. Part F129314, pp. 283–292."},"main_file_link":[{"url":"https://arxiv.org/abs/1706.04178","open_access":"1"}],"scopus_import":"1","oa_version":"Submitted Version","date_published":"2017-07-26T00:00:00Z","doi":"10.1145/3087801.3087810","publication_status":"published","conference":{"location":"Washington, WA, USA","end_date":"2017-07-27","name":"PODC: Principles of Distributed Computing","start_date":"2017-07-25"},"month":"07","status":"public","oa":1,"publication_identifier":{"isbn":["978-145034992-5"]},"_id":"791","abstract":[{"text":"Consider the following random process: we are given n queues, into which elements of increasing labels are inserted uniformly at random. To remove an element, we pick two queues at random, and remove the element of lower label (higher priority) among the two. The cost of a removal is the rank of the label removed, among labels still present in any of the queues, that is, the distance from the optimal choice at each step. Variants of this strategy are prevalent in state-of-the-art concurrent priority queue implementations. Nonetheless, it is not known whether such implementations provide any rank guarantees, even in a sequential model. We answer this question, showing that this strategy provides surprisingly strong guarantees: Although the single-choice process, where we always insert and remove from a single randomly chosen queue, has degrading cost, going to infinity as we increase the number of steps, in the two choice process, the expected rank of a removed element is O(n) while the expected worst-case cost is O(n log n). These bounds are tight, and hold irrespective of the number of steps for which we run the process. The argument is based on a new technical connection between &quot;heavily loaded&quot; balls-into-bins processes and priority scheduling. Our analytic results inspire a new concurrent priority queue implementation, which improves upon the state of the art in terms of practical performance.","lang":"eng"}],"date_updated":"2023-09-27T12:17:59Z","year":"2017","quality_controlled":"1","volume":"Part F129314","external_id":{"isi":["000462995000035"]},"article_processing_charge":"No","publist_id":"6864","type":"conference","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing","date_created":"2018-12-11T11:48:31Z","page":"283 - 292","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"ACM","title":"The power of choice in priority scheduling","isi":1,"author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kopinsky","first_name":"Justin","full_name":"Kopinsky, Justin"},{"first_name":"Jerry","last_name":"Li","full_name":"Li, Jerry"},{"id":"3279A00C-F248-11E8-B48F-1D18A9856A87","last_name":"Nadiradze","first_name":"Giorgi","orcid":"0000-0001-5634-0731","full_name":"Nadiradze, Giorgi"}],"day":"26"},{"day":"25","isi":1,"author":[{"full_name":"Budanur, Nazmi B","orcid":"0000-0003-0423-5010","first_name":"Nazmi B","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","last_name":"Budanur"},{"full_name":"Short, Kimberly","last_name":"Short","first_name":"Kimberly"},{"last_name":"Farazmand","first_name":"Mohammad","full_name":"Farazmand, Mohammad"},{"first_name":"Ashley","last_name":"Willis","full_name":"Willis, Ashley"},{"first_name":"Predrag","last_name":"Cvitanović","full_name":"Cvitanović, Predrag"}],"project":[{"name":"ROOTS Genome-wide Analysis of Root Traits","_id":"25636330-B435-11E9-9278-68D0E5697425","grant_number":"11-NSF-1070"}],"title":"Relative periodic orbits form the backbone of turbulent pipe flow","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Cambridge University Press","publication":"Journal of Fluid Mechanics","page":"274 - 301","date_created":"2018-12-11T11:48:32Z","department":[{"_id":"BjHo"}],"language":[{"iso":"eng"}],"type":"journal_article","article_processing_charge":"No","publist_id":"6862","quality_controlled":"1","volume":833,"external_id":{"isi":["000414641700001"]},"year":"2017","abstract":[{"text":"The chaotic dynamics of low-dimensional systems, such as Lorenz or Rössler flows, is guided by the infinity of periodic orbits embedded in their strange attractors. Whether this is also the case for the infinite-dimensional dynamics of Navier–Stokes equations has long been speculated, and is a topic of ongoing study. Periodic and relative periodic solutions have been shown to be involved in transitions to turbulence. Their relevance to turbulent dynamics – specifically, whether periodic orbits play the same role in high-dimensional nonlinear systems like the Navier–Stokes equations as they do in lower-dimensional systems – is the focus of the present investigation. We perform here a detailed study of pipe flow relative periodic orbits with energies and mean dissipations close to turbulent values. We outline several approaches to reduction of the translational symmetry of the system. We study pipe flow in a minimal computational cell at   Re=2500, and report a library of invariant solutions found with the aid of the method of slices. Detailed study of the unstable manifolds of a sample of these solutions is consistent with the picture that relative periodic orbits are embedded in the chaotic saddle and that they guide the turbulent dynamics.","lang":"eng"}],"date_updated":"2023-09-27T12:17:35Z","_id":"792","publication_identifier":{"issn":["00221120"]},"oa":1,"status":"public","month":"12","doi":"10.1017/jfm.2017.699","publication_status":"published","date_published":"2017-12-25T00:00:00Z","oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.03720"}],"scopus_import":"1","intvolume":"       833","citation":{"short":"N.B. Budanur, K. Short, M. Farazmand, A. Willis, P. Cvitanović, Journal of Fluid Mechanics 833 (2017) 274–301.","ieee":"N. B. Budanur, K. Short, M. Farazmand, A. Willis, and P. Cvitanović, “Relative periodic orbits form the backbone of turbulent pipe flow,” <i>Journal of Fluid Mechanics</i>, vol. 833. Cambridge University Press, pp. 274–301, 2017.","ama":"Budanur NB, Short K, Farazmand M, Willis A, Cvitanović P. Relative periodic orbits form the backbone of turbulent pipe flow. <i>Journal of Fluid Mechanics</i>. 2017;833:274-301. doi:<a href=\"https://doi.org/10.1017/jfm.2017.699\">10.1017/jfm.2017.699</a>","ista":"Budanur NB, Short K, Farazmand M, Willis A, Cvitanović P. 2017. Relative periodic orbits form the backbone of turbulent pipe flow. Journal of Fluid Mechanics. 833, 274–301.","mla":"Budanur, Nazmi B., et al. “Relative Periodic Orbits Form the Backbone of Turbulent Pipe Flow.” <i>Journal of Fluid Mechanics</i>, vol. 833, Cambridge University Press, 2017, pp. 274–301, doi:<a href=\"https://doi.org/10.1017/jfm.2017.699\">10.1017/jfm.2017.699</a>.","apa":"Budanur, N. B., Short, K., Farazmand, M., Willis, A., &#38; Cvitanović, P. (2017). Relative periodic orbits form the backbone of turbulent pipe flow. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2017.699\">https://doi.org/10.1017/jfm.2017.699</a>","chicago":"Budanur, Nazmi B, Kimberly Short, Mohammad Farazmand, Ashley Willis, and Predrag Cvitanović. “Relative Periodic Orbits Form the Backbone of Turbulent Pipe Flow.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1017/jfm.2017.699\">https://doi.org/10.1017/jfm.2017.699</a>."}},{"date_created":"2018-12-11T11:48:32Z","page":"28 - 31","publication":"Computational Geometry: Theory and Applications","language":[{"iso":"eng"}],"department":[{"_id":"UlWa"}],"type":"journal_article","publist_id":"6861","article_processing_charge":"No","external_id":{"isi":["000412039700003"]},"volume":66,"quality_controlled":"1","day":"01","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"isi":1,"author":[{"full_name":"Fulek, Radoslav","first_name":"Radoslav","orcid":"0000-0001-8485-1774","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mojarrad, Hossein","last_name":"Mojarrad","first_name":"Hossein"},{"full_name":"Naszódi, Márton","last_name":"Naszódi","first_name":"Márton"},{"first_name":"József","last_name":"Solymosi","full_name":"Solymosi, József"},{"full_name":"Stich, Sebastian","last_name":"Stich","first_name":"Sebastian"},{"first_name":"May","last_name":"Szedlák","full_name":"Szedlák, May"}],"title":"On the existence of ordinary triangles","publisher":"Elsevier","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","doi":"10.1016/j.comgeo.2017.07.002","date_published":"2017-01-01T00:00:00Z","oa_version":"Submitted Version","main_file_link":[{"url":"https://arxiv.org/abs/1701.08183","open_access":"1"}],"citation":{"ista":"Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. 2017. On the existence of ordinary triangles. Computational Geometry: Theory and Applications. 66, 28–31.","mla":"Fulek, Radoslav, et al. “On the Existence of Ordinary Triangles.” <i>Computational Geometry: Theory and Applications</i>, vol. 66, Elsevier, 2017, pp. 28–31, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2017.07.002\">10.1016/j.comgeo.2017.07.002</a>.","apa":"Fulek, R., Mojarrad, H., Naszódi, M., Solymosi, J., Stich, S., &#38; Szedlák, M. (2017). On the existence of ordinary triangles. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2017.07.002\">https://doi.org/10.1016/j.comgeo.2017.07.002</a>","chicago":"Fulek, Radoslav, Hossein Mojarrad, Márton Naszódi, József Solymosi, Sebastian Stich, and May Szedlák. “On the Existence of Ordinary Triangles.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.comgeo.2017.07.002\">https://doi.org/10.1016/j.comgeo.2017.07.002</a>.","ama":"Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. On the existence of ordinary triangles. <i>Computational Geometry: Theory and Applications</i>. 2017;66:28-31. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2017.07.002\">10.1016/j.comgeo.2017.07.002</a>","ieee":"R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, and M. Szedlák, “On the existence of ordinary triangles,” <i>Computational Geometry: Theory and Applications</i>, vol. 66. Elsevier, pp. 28–31, 2017.","short":"R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, M. Szedlák, Computational Geometry: Theory and Applications 66 (2017) 28–31."},"intvolume":"        66","year":"2017","date_updated":"2023-09-27T12:15:16Z","abstract":[{"text":"Let P be a finite point set in the plane. A cordinary triangle in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P . Motivated by a question of Erdös, and answering a question of de Zeeuw, we prove that there exists a constant c &gt; 0such that P contains a c-ordinary triangle, provided that P is not contained in the union of two lines. Furthermore, the number of c-ordinary triangles in P is Ω(| P |). ","lang":"eng"}],"_id":"793","oa":1,"publication_identifier":{"issn":["09257721"]},"status":"public","ec_funded":1,"month":"01"},{"intvolume":"        66","citation":{"ieee":"R. Fulek, “C-planarity of embedded cyclic c-graphs,” <i>Computational Geometry: Theory and Applications</i>, vol. 66. Elsevier, pp. 1–13, 2017.","ama":"Fulek R. C-planarity of embedded cyclic c-graphs. <i>Computational Geometry: Theory and Applications</i>. 2017;66:1-13. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2017.06.016\">10.1016/j.comgeo.2017.06.016</a>","short":"R. Fulek, Computational Geometry: Theory and Applications 66 (2017) 1–13.","chicago":"Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.comgeo.2017.06.016\">https://doi.org/10.1016/j.comgeo.2017.06.016</a>.","apa":"Fulek, R. (2017). C-planarity of embedded cyclic c-graphs. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2017.06.016\">https://doi.org/10.1016/j.comgeo.2017.06.016</a>","ista":"Fulek R. 2017. C-planarity of embedded cyclic c-graphs. Computational Geometry: Theory and Applications. 66, 1–13.","mla":"Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.” <i>Computational Geometry: Theory and Applications</i>, vol. 66, Elsevier, 2017, pp. 1–13, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2017.06.016\">10.1016/j.comgeo.2017.06.016</a>."},"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.01346"}],"oa_version":"Preprint","date_published":"2017-12-01T00:00:00Z","doi":"10.1016/j.comgeo.2017.06.016","publication_status":"published","month":"12","status":"public","oa":1,"_id":"794","abstract":[{"text":"We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph G with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment G by adding edges without creating an edge-crossing so that in the resulting spherical graph the vertices of each part induce a connected sub-graph. We proceed by a reduction to the problem of testing the existence of a perfect matching in planar bipartite graphs. We formulate our result in a slightly more general setting of cyclic clustered graphs, i.e., the simple graph obtained by contracting each cluster, where we disregard loops and multi-edges, is a cycle.","lang":"eng"}],"date_updated":"2023-09-27T12:14:49Z","year":"2017","quality_controlled":"1","volume":66,"external_id":{"isi":["000412039700001"]},"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1165"}]},"article_processing_charge":"No","publist_id":"6860","type":"journal_article","department":[{"_id":"UlWa"}],"language":[{"iso":"eng"}],"publication":"Computational Geometry: Theory and Applications","page":"1 - 13","date_created":"2018-12-11T11:48:32Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Elsevier","title":"C-planarity of embedded cyclic c-graphs","author":[{"last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav","full_name":"Fulek, Radoslav"}],"isi":1,"acknowledgement":"I would like to thank Jan Kynčl, Dömötör Pálvölgyi and anonymous referees for many comments and suggestions that helped to improve the presentation of the result.","day":"01"},{"article_number":"P3.18","_id":"795","abstract":[{"text":"We introduce a common generalization of the strong Hanani–Tutte theorem and the weak Hanani–Tutte theorem: if a graph G has a drawing D in the plane where every pair of independent edges crosses an even number of times, then G has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in D. The theorem is implicit in the proof of the strong Hanani–Tutte theorem by Pelsmajer, Schaefer and Štefankovič. We give a new, somewhat simpler proof.","lang":"eng"}],"issue":"3","date_updated":"2022-03-18T12:58:53Z","year":"2017","month":"07","ec_funded":1,"status":"public","oa":1,"publication_identifier":{"issn":["10778926"]},"oa_version":"Published Version","date_published":"2017-07-28T00:00:00Z","doi":"10.37236/6663","publication_status":"published","intvolume":"        24","citation":{"mla":"Fulek, Radoslav, et al. “Unified Hanani Tutte Theorem.” <i>Electronic Journal of Combinatorics</i>, vol. 24, no. 3, P3.18, International Press, 2017, doi:<a href=\"https://doi.org/10.37236/6663\">10.37236/6663</a>.","apa":"Fulek, R., Kynčl, J., &#38; Pálvölgyi, D. (2017). Unified Hanani Tutte theorem. <i>Electronic Journal of Combinatorics</i>. International Press. <a href=\"https://doi.org/10.37236/6663\">https://doi.org/10.37236/6663</a>","ista":"Fulek R, Kynčl J, Pálvölgyi D. 2017. Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. 24(3), P3.18.","chicago":"Fulek, Radoslav, Jan Kynčl, and Dömötör Pálvölgyi. “Unified Hanani Tutte Theorem.” <i>Electronic Journal of Combinatorics</i>. International Press, 2017. <a href=\"https://doi.org/10.37236/6663\">https://doi.org/10.37236/6663</a>.","short":"R. Fulek, J. Kynčl, D. Pálvölgyi, Electronic Journal of Combinatorics 24 (2017).","ieee":"R. Fulek, J. Kynčl, and D. Pálvölgyi, “Unified Hanani Tutte theorem,” <i>Electronic Journal of Combinatorics</i>, vol. 24, no. 3. International Press, 2017.","ama":"Fulek R, Kynčl J, Pálvölgyi D. Unified Hanani Tutte theorem. <i>Electronic Journal of Combinatorics</i>. 2017;24(3). doi:<a href=\"https://doi.org/10.37236/6663\">10.37236/6663</a>"},"scopus_import":"1","file_date_updated":"2020-07-14T12:48:06Z","ddc":["000"],"author":[{"last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav"},{"full_name":"Kynčl, Jan","last_name":"Kynčl","first_name":"Jan"},{"full_name":"Pálvölgyi, Dömötör","last_name":"Pálvölgyi","first_name":"Dömötör"}],"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"file":[{"file_size":236944,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"dernst","file_id":"5853","checksum":"ef320cff0f062051e858f929be6a3581","date_created":"2019-01-18T14:04:08Z","file_name":"2017_ElectrCombi_Fulek.pdf","date_updated":"2020-07-14T12:48:06Z"}],"day":"28","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"International Press","title":"Unified Hanani Tutte theorem","type":"journal_article","department":[{"_id":"UlWa"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"Electronic Journal of Combinatorics","date_created":"2018-12-11T11:48:32Z","volume":24,"quality_controlled":"1","article_type":"original","article_processing_charge":"No","publist_id":"6859"},{"title":"Al transmon qubits on silicon on insulator for quantum device integration","publisher":"American Institute of Physics","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","acknowledgement":"This work was supported by the AFOSR MURI Quantum Photonic Matter (Grant No. 16RT0696), the AFOSR MURI Wiring Quantum Networks with Mechanical Transducers (Grant No. FA9550-15-1-0015), the Institute for Quantum Information and Matter, an NSF Physics Frontiers Center (Grant No. PHY-1125565) with the support of the Gordon and Betty Moore Foundation, and the Kavli Nanoscience Institute at Caltech. A.J.K. acknowledges the IQIM Postdoctoral Fellowship.","author":[{"full_name":"Keller, Andrew J","first_name":"Andrew J","last_name":"Keller"},{"full_name":"Dieterle, Paul","last_name":"Dieterle","first_name":"Paul"},{"full_name":"Fang, Michael","last_name":"Fang","first_name":"Michael"},{"last_name":"Berger","first_name":"Brett","full_name":"Berger, Brett"},{"orcid":"0000-0001-8112-028X","first_name":"Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M"},{"full_name":"Painter, Oskar","first_name":"Oskar","last_name":"Painter"}],"isi":1,"publist_id":"6857","article_processing_charge":"No","external_id":{"isi":["000406779700031"]},"quality_controlled":"1","volume":111,"date_created":"2018-12-11T11:48:33Z","publication":"Applied Physics Letters","language":[{"iso":"eng"}],"department":[{"_id":"JoFi"}],"type":"journal_article","publication_identifier":{"issn":["00036951"]},"oa":1,"status":"public","month":"07","year":"2017","date_updated":"2023-09-27T12:13:36Z","issue":"4","abstract":[{"lang":"eng","text":"We present the fabrication and characterization of an aluminum transmon qubit on a silicon-on-insulator substrate. Key to the qubit fabrication is the use of an anhydrous hydrofluoric vapor process which selectively removes the lossy silicon oxide buried underneath the silicon device layer. For a 5.6 GHz qubit measured dispersively by a 7.1 GHz resonator, we find T1 = 3.5 μs and T∗2 = 2.2 μs. This process in principle permits the co-fabrication of silicon photonic and mechanical elements, providing a route towards chip-scale integration of electro-opto-mechanical transducers for quantum networking of superconducting microwave quantum circuits. The additional processing steps are compatible with established fabrication techniques for aluminum transmon qubits on silicon."}],"_id":"796","article_number":"042603","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.10195"}],"intvolume":"       111","citation":{"ama":"Keller AJ, Dieterle P, Fang M, Berger B, Fink JM, Painter O. Al transmon qubits on silicon on insulator for quantum device integration. <i>Applied Physics Letters</i>. 2017;111(4). doi:<a href=\"https://doi.org/10.1063/1.4994661\">10.1063/1.4994661</a>","ieee":"A. J. Keller, P. Dieterle, M. Fang, B. Berger, J. M. Fink, and O. Painter, “Al transmon qubits on silicon on insulator for quantum device integration,” <i>Applied Physics Letters</i>, vol. 111, no. 4. American Institute of Physics, 2017.","short":"A.J. Keller, P. Dieterle, M. Fang, B. Berger, J.M. Fink, O. Painter, Applied Physics Letters 111 (2017).","chicago":"Keller, Andrew J, Paul Dieterle, Michael Fang, Brett Berger, Johannes M Fink, and Oskar Painter. “Al Transmon Qubits on Silicon on Insulator for Quantum Device Integration.” <i>Applied Physics Letters</i>. American Institute of Physics, 2017. <a href=\"https://doi.org/10.1063/1.4994661\">https://doi.org/10.1063/1.4994661</a>.","ista":"Keller AJ, Dieterle P, Fang M, Berger B, Fink JM, Painter O. 2017. Al transmon qubits on silicon on insulator for quantum device integration. Applied Physics Letters. 111(4), 042603.","mla":"Keller, Andrew J., et al. “Al Transmon Qubits on Silicon on Insulator for Quantum Device Integration.” <i>Applied Physics Letters</i>, vol. 111, no. 4, 042603, American Institute of Physics, 2017, doi:<a href=\"https://doi.org/10.1063/1.4994661\">10.1063/1.4994661</a>.","apa":"Keller, A. J., Dieterle, P., Fang, M., Berger, B., Fink, J. M., &#38; Painter, O. (2017). Al transmon qubits on silicon on insulator for quantum device integration. <i>Applied Physics Letters</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4994661\">https://doi.org/10.1063/1.4994661</a>"},"publication_status":"published","doi":"10.1063/1.4994661","date_published":"2017-07-01T00:00:00Z","oa_version":"Submitted Version"},{"oa_version":"None","type":"journal_article","date_published":"2017-05-01T00:00:00Z","department":[{"_id":"JoFi"}],"language":[{"iso":"eng"}],"doi":"10.1002/piuz.201770305","publication_status":"published","publication":"Physik in unserer Zeit","date_created":"2018-12-11T11:48:33Z","page":"111 - 113","citation":{"ama":"Fink JM. Photonenblockade aufgelöst. <i>Physik in unserer Zeit</i>. 2017;48(3):111-113. doi:<a href=\"https://doi.org/10.1002/piuz.201770305\">10.1002/piuz.201770305</a>","ieee":"J. M. Fink, “Photonenblockade aufgelöst,” <i>Physik in unserer Zeit</i>, vol. 48, no. 3. Wiley, pp. 111–113, 2017.","short":"J.M. Fink, Physik in Unserer Zeit 48 (2017) 111–113.","mla":"Fink, Johannes M. “Photonenblockade Aufgelöst.” <i>Physik in Unserer Zeit</i>, vol. 48, no. 3, Wiley, 2017, pp. 111–13, doi:<a href=\"https://doi.org/10.1002/piuz.201770305\">10.1002/piuz.201770305</a>.","ista":"Fink JM. 2017. Photonenblockade aufgelöst. Physik in unserer Zeit. 48(3), 111–113.","apa":"Fink, J. M. (2017). Photonenblockade aufgelöst. <i>Physik in Unserer Zeit</i>. Wiley. <a href=\"https://doi.org/10.1002/piuz.201770305\">https://doi.org/10.1002/piuz.201770305</a>","chicago":"Fink, Johannes M. “Photonenblockade Aufgelöst.” <i>Physik in Unserer Zeit</i>. Wiley, 2017. <a href=\"https://doi.org/10.1002/piuz.201770305\">https://doi.org/10.1002/piuz.201770305</a>."},"intvolume":"        48","quality_controlled":"1","volume":48,"article_processing_charge":"No","article_type":"original","publist_id":"6856","author":[{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","orcid":"0000-0001-8112-028X","first_name":"Johannes M","full_name":"Fink, Johannes M"}],"_id":"797","abstract":[{"lang":"ger","text":"Phasenübergänge helfen beim Verständnis von Vielteilchensystemen in der Festkörperphysik und Fluiddynamik bis hin zur Teilchenphysik. Unserer internationalen Kollaboration ist es gelungen, einen neuartigen Phasenübergang in einem Quantensystem zu beobachten [1]. In einem Mikrowellenresonator konnte erstmals die spontane Zustandsänderung von undurchsichtig zu transparent nachgewiesen werden."}],"issue":"3","date_updated":"2022-03-24T09:16:20Z","year":"2017","day":"01","month":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Wiley","status":"public","title":"Photonenblockade aufgelöst"},{"has_accepted_license":"1","date_created":"2018-12-11T11:48:33Z","publication":"Nature Communications","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"JoFi"}],"publist_id":"6855","article_processing_charge":"Yes (in subscription journal)","pubrep_id":"867","external_id":{"isi":["000412999700021"]},"volume":8,"quality_controlled":"1","day":"16","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"project":[{"call_identifier":"H2020","name":"Hybrid Optomechanical Technologies","_id":"257EB838-B435-11E9-9278-68D0E5697425","grant_number":"732894"},{"_id":"258047B6-B435-11E9-9278-68D0E5697425","grant_number":"707438","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics","call_identifier":"H2020"}],"author":[{"last_name":"Barzanjeh","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0415-1423","first_name":"Shabir","full_name":"Barzanjeh, Shabir"},{"full_name":"Wulf, Matthias","id":"45598606-F248-11E8-B48F-1D18A9856A87","last_name":"Wulf","first_name":"Matthias","orcid":"0000-0001-6613-1378"},{"orcid":"0000-0002-3415-4628","first_name":"Matilda","last_name":"Peruzzo","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","full_name":"Peruzzo, Matilda"},{"full_name":"Kalaee, Mahmoud","last_name":"Kalaee","first_name":"Mahmoud"},{"last_name":"Dieterle","first_name":"Paul","full_name":"Dieterle, Paul"},{"last_name":"Painter","first_name":"Oskar","full_name":"Painter, Oskar"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","first_name":"Johannes M","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M"}],"isi":1,"file":[{"creator":"system","checksum":"b68dafa71d1834c23b742cd9987a3d5f","file_id":"5145","access_level":"open_access","file_name":"IST-2017-867-v1+1_s41467-017-01304-x.pdf","date_updated":"2020-07-14T12:48:06Z","date_created":"2018-12-12T10:15:25Z","content_type":"application/pdf","relation":"main_file","file_size":1467696}],"publisher":"Nature Publishing Group","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Mechanical on chip microwave circulator","publication_status":"published","doi":"10.1038/s41467-017-01304-x","oa_version":"Published Version","date_published":"2017-10-16T00:00:00Z","file_date_updated":"2020-07-14T12:48:06Z","scopus_import":"1","ddc":["539"],"intvolume":"         8","citation":{"ama":"Barzanjeh S, Wulf M, Peruzzo M, et al. Mechanical on chip microwave circulator. <i>Nature Communications</i>. 2017;8(1). doi:<a href=\"https://doi.org/10.1038/s41467-017-01304-x\">10.1038/s41467-017-01304-x</a>","ieee":"S. Barzanjeh <i>et al.</i>, “Mechanical on chip microwave circulator,” <i>Nature Communications</i>, vol. 8, no. 1. Nature Publishing Group, 2017.","short":"S. Barzanjeh, M. Wulf, M. Peruzzo, M. Kalaee, P. Dieterle, O. Painter, J.M. Fink, Nature Communications 8 (2017).","apa":"Barzanjeh, S., Wulf, M., Peruzzo, M., Kalaee, M., Dieterle, P., Painter, O., &#38; Fink, J. M. (2017). Mechanical on chip microwave circulator. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41467-017-01304-x\">https://doi.org/10.1038/s41467-017-01304-x</a>","mla":"Barzanjeh, Shabir, et al. “Mechanical on Chip Microwave Circulator.” <i>Nature Communications</i>, vol. 8, no. 1, 1304, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/s41467-017-01304-x\">10.1038/s41467-017-01304-x</a>.","ista":"Barzanjeh S, Wulf M, Peruzzo M, Kalaee M, Dieterle P, Painter O, Fink JM. 2017. Mechanical on chip microwave circulator. Nature Communications. 8(1), 1304.","chicago":"Barzanjeh, Shabir, Matthias Wulf, Matilda Peruzzo, Mahmoud Kalaee, Paul Dieterle, Oskar Painter, and Johannes M Fink. “Mechanical on Chip Microwave Circulator.” <i>Nature Communications</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/s41467-017-01304-x\">https://doi.org/10.1038/s41467-017-01304-x</a>."},"date_updated":"2023-09-27T12:11:28Z","abstract":[{"lang":"eng","text":"Nonreciprocal circuit elements form an integral part of modern measurement and communication systems. Mathematically they require breaking of time-reversal symmetry, typically achieved using magnetic materials and more recently using the quantum Hall effect, parametric permittivity modulation or Josephson nonlinearities. Here we demonstrate an on-chip magnetic-free circulator based on reservoir-engineered electromechanic interactions. Directional circulation is achieved with controlled phase-sensitive interference of six distinct electro-mechanical signal conversion paths. The presented circulator is compact, its silicon-on-insulator platform is compatible with both superconducting qubits and silicon photonics, and its noise performance is close to the quantum limit. With a high dynamic range, a tunable bandwidth of up to 30 MHz and an in situ reconfigurability as beam splitter or wavelength converter, it could pave the way for superconducting qubit processors with multiplexed on-chip signal processing and readout."}],"issue":"1","year":"2017","article_number":"1304","_id":"798","status":"public","oa":1,"publication_identifier":{"issn":["20411723"]},"month":"10","ec_funded":1},{"alternative_title":["SpringerBriefs in Molecular Science"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","title":"Polysaccharides in supercapacitors","author":[{"last_name":"Yee Liew","first_name":"Soon","full_name":"Yee Liew, Soon"},{"first_name":"Wim","last_name":"Thielemans","full_name":"Thielemans, Wim"},{"full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger"},{"first_name":"Stefan","last_name":"Spirk","full_name":"Spirk, Stefan"}],"file":[{"file_size":3339826,"content_type":"application/pdf","relation":"main_file","date_created":"2020-06-29T14:13:44Z","file_name":"Final_EPNOE.pdf","date_updated":"2020-07-14T12:48:06Z","access_level":"open_access","file_id":"8048","checksum":"4182aeee32c9263a626a7e522f1934f5","creator":"sfreunbe"}],"extern":"1","day":"26","editor":[{"first_name":"Soon","last_name":"Yee Liew","full_name":"Yee Liew, Soon"},{"last_name":"Thielemans","first_name":"Wim","full_name":"Thielemans, Wim"},{"full_name":"Freunberger, Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger","first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319"},{"full_name":"Spirk, Stefan","first_name":"Stefan","last_name":"Spirk"}],"quality_controlled":"1","article_processing_charge":"No","type":"book_chapter","language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"Polysaccharide Based Supercapacitors","page":"15-53","date_created":"2020-06-19T08:11:08Z","month":"03","status":"public","publication_identifier":{"issn":["2191-5407","2191-5415"],"isbn":["9783319507538","9783319507545"]},"oa":1,"_id":"7980","abstract":[{"lang":"eng","text":"In this part, the use of polysaccharides, either directly through composite approaches, or by carbonization will be described. In many cases, materials are obtained which are competitive in terms of capacitance and cycle lifetime. In this part, the use of polysaccharides, either directly through composite approaches, or by carbonization will be described. In many cases, materials are obtained which are competitive in terms of capacitance and cycle lifetime. The following part will focus mainly on cellulosic composites with conductive polymers since cellulose is most abundant and therefore has attracted much more research interest in this field whereas in the second part also other polysaccharides, such as chitin, xylans, alginates, pectins, dextrans and caragenaans have been used in carbonization experiments."}],"date_updated":"2021-01-12T08:16:19Z","year":"2017","citation":{"short":"S. Yee Liew, W. Thielemans, S.A. Freunberger, S. Spirk, in:, S. Yee Liew, W. Thielemans, S.A. Freunberger, S. Spirk (Eds.), Polysaccharide Based Supercapacitors, Springer Nature, 2017, pp. 15–53.","ieee":"S. Yee Liew, W. Thielemans, S. A. Freunberger, and S. Spirk, “Polysaccharides in supercapacitors,” in <i>Polysaccharide Based Supercapacitors</i>, S. Yee Liew, W. Thielemans, S. A. Freunberger, and S. Spirk, Eds. Springer Nature, 2017, pp. 15–53.","ama":"Yee Liew S, Thielemans W, Freunberger SA, Spirk S. Polysaccharides in supercapacitors. In: Yee Liew S, Thielemans W, Freunberger SA, Spirk S, eds. <i>Polysaccharide Based Supercapacitors</i>. Springer Nature; 2017:15-53. doi:<a href=\"https://doi.org/10.1007/978-3-319-50754-5_2\">10.1007/978-3-319-50754-5_2</a>","chicago":"Yee Liew, Soon, Wim Thielemans, Stefan Alexander Freunberger, and Stefan Spirk. “Polysaccharides in Supercapacitors.” In <i>Polysaccharide Based Supercapacitors</i>, edited by Soon Yee Liew, Wim Thielemans, Stefan Alexander Freunberger, and Stefan Spirk, 15–53. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-50754-5_2\">https://doi.org/10.1007/978-3-319-50754-5_2</a>.","ista":"Yee Liew S, Thielemans W, Freunberger SA, Spirk S. 2017.Polysaccharides in supercapacitors. In: Polysaccharide Based Supercapacitors. SpringerBriefs in Molecular Science, , 15–53.","apa":"Yee Liew, S., Thielemans, W., Freunberger, S. A., &#38; Spirk, S. (2017). Polysaccharides in supercapacitors. In S. Yee Liew, W. Thielemans, S. A. Freunberger, &#38; S. Spirk (Eds.), <i>Polysaccharide Based Supercapacitors</i> (pp. 15–53). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-50754-5_2\">https://doi.org/10.1007/978-3-319-50754-5_2</a>","mla":"Yee Liew, Soon, et al. “Polysaccharides in Supercapacitors.” <i>Polysaccharide Based Supercapacitors</i>, edited by Soon Yee Liew et al., Springer Nature, 2017, pp. 15–53, doi:<a href=\"https://doi.org/10.1007/978-3-319-50754-5_2\">10.1007/978-3-319-50754-5_2</a>."},"file_date_updated":"2020-07-14T12:48:06Z","ddc":["540","541"],"oa_version":"Submitted Version","date_published":"2017-03-26T00:00:00Z","doi":"10.1007/978-3-319-50754-5_2","publication_status":"published"},{"abstract":[{"lang":"ger","text":"Aprotische Natrium‐O2‐Batterien basieren auf der reversiblen Bildung und Auflösung von Natriumsuperoxid (NaO2) während des Zellbetriebs. Nebenreaktionen des Elektrolyten und der Elektrode mit dem stark nukleophilen und basischen NaO2 führen zu mangelhafter Zyklenstabilität. Seine Reaktivität allein kann die Nebenreaktionen und schlechte Reversibilität jedoch nicht schlüssig erklären. Hier wird gezeigt, dass Singulett‐Sauerstoff (1O2) in allen Phasen des Betriebs entsteht und eine Hauptursache für Nebenreaktionen ist. 1O2 wurde in situ und ex situ mit einem 1O2‐Fänger detektiert, der schnell und selektiv ein Addukt mit 1O2 bildet. Mechanistisch betrachtet entsteht 1O2 entweder durch protonenunterstützte Disproportionierung von Superoxid während des Entladens, Lagerns und Ladens unter ca. 3.3 V oder durch direkte elektrochemische 1O2‐Entwicklung über ca. 3.3 V. Spuren von Wasser ermöglichen hohe Kapazitäten, beschleunigen aber auch Nebenreaktionen. Daher muss das hochreaktive 1O2 unbedingt kontrolliert werden, um die Zelle reversibel zu betreiben."}],"issue":"49","date_updated":"2021-01-12T08:16:20Z","year":"2017","_id":"7981","status":"public","publication_identifier":{"issn":["0044-8249"]},"oa":1,"month":"12","doi":"10.1002/ange.201709351","publication_status":"published","oa_version":"Published Version","date_published":"2017-12-04T00:00:00Z","file_date_updated":"2020-07-14T12:48:06Z","ddc":["540"],"intvolume":"       129","citation":{"ista":"Schafzahl L, Mahne N, Schafzahl B, Wilkening M, Slugovc C, Borisov SM, Freunberger SA. 2017. Singulett-Sauerstoff in der aprotischen Natrium-O2-Batterie. Angewandte Chemie. 129(49), 15934–15938.","apa":"Schafzahl, L., Mahne, N., Schafzahl, B., Wilkening, M., Slugovc, C., Borisov, S. M., &#38; Freunberger, S. A. (2017). Singulett-Sauerstoff in der aprotischen Natrium-O2-Batterie. <i>Angewandte Chemie</i>. Wiley. <a href=\"https://doi.org/10.1002/ange.201709351\">https://doi.org/10.1002/ange.201709351</a>","mla":"Schafzahl, Lukas, et al. “Singulett-Sauerstoff in Der Aprotischen Natrium-O2-Batterie.” <i>Angewandte Chemie</i>, vol. 129, no. 49, Wiley, 2017, pp. 15934–38, doi:<a href=\"https://doi.org/10.1002/ange.201709351\">10.1002/ange.201709351</a>.","chicago":"Schafzahl, Lukas, Nika Mahne, Bettina Schafzahl, Martin Wilkening, Christian Slugovc, Sergey M. Borisov, and Stefan Alexander Freunberger. “Singulett-Sauerstoff in Der Aprotischen Natrium-O2-Batterie.” <i>Angewandte Chemie</i>. Wiley, 2017. <a href=\"https://doi.org/10.1002/ange.201709351\">https://doi.org/10.1002/ange.201709351</a>.","short":"L. Schafzahl, N. Mahne, B. Schafzahl, M. Wilkening, C. Slugovc, S.M. Borisov, S.A. Freunberger, Angewandte Chemie 129 (2017) 15934–15938.","ieee":"L. Schafzahl <i>et al.</i>, “Singulett-Sauerstoff in der aprotischen Natrium-O2-Batterie,” <i>Angewandte Chemie</i>, vol. 129, no. 49. Wiley, pp. 15934–15938, 2017.","ama":"Schafzahl L, Mahne N, Schafzahl B, et al. Singulett-Sauerstoff in der aprotischen Natrium-O2-Batterie. <i>Angewandte Chemie</i>. 2017;129(49):15934-15938. doi:<a href=\"https://doi.org/10.1002/ange.201709351\">10.1002/ange.201709351</a>"},"extern":"1","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"day":"04","author":[{"first_name":"Lukas","last_name":"Schafzahl","full_name":"Schafzahl, Lukas"},{"last_name":"Mahne","first_name":"Nika","full_name":"Mahne, Nika"},{"last_name":"Schafzahl","first_name":"Bettina","full_name":"Schafzahl, Bettina"},{"full_name":"Wilkening, Martin","first_name":"Martin","last_name":"Wilkening"},{"full_name":"Slugovc, Christian","last_name":"Slugovc","first_name":"Christian"},{"last_name":"Borisov","first_name":"Sergey M.","full_name":"Borisov, Sergey M."},{"full_name":"Freunberger, Stefan Alexander","first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"}],"file":[{"file_id":"7987","creator":"dernst","checksum":"38f2c2383bc9573f6770c1dba72d7a9a","access_level":"open_access","file_name":"2017_AngChemieDT_Schafzahl.pdf","date_updated":"2020-07-14T12:48:06Z","date_created":"2020-06-19T11:39:09Z","content_type":"application/pdf","relation":"main_file","file_size":988125}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Wiley","title":"Singulett-Sauerstoff in der aprotischen Natrium-O2-Batterie","has_accepted_license":"1","publication":"Angewandte Chemie","date_created":"2020-06-19T08:22:06Z","page":"15934-15938","type":"journal_article","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","quality_controlled":"1","volume":129},{"type":"journal_article","language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"Nature Energy","date_created":"2020-06-19T08:23:47Z","quality_controlled":"1","volume":2,"external_id":{"arxiv":["2002.00712"]},"article_type":"original","article_processing_charge":"No","author":[{"orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander"}],"file":[{"date_created":"2020-06-29T13:26:55Z","date_updated":"2020-07-14T12:48:06Z","file_name":"NEnergy_Comment_final.pdf","access_level":"open_access","checksum":"2564255b76f5346a32e764dbfd17fa2f","file_id":"8046","creator":"sfreunbe","file_size":817665,"relation":"main_file","content_type":"application/pdf"}],"extern":"1","day":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","title":"True performance metrics in beyond-intercalation batteries","oa_version":"Submitted Version","date_published":"2017-06-05T00:00:00Z","doi":"10.1038/nenergy.2017.91","publication_status":"published","intvolume":"         2","citation":{"apa":"Freunberger, S. A. (2017). True performance metrics in beyond-intercalation batteries. <i>Nature Energy</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nenergy.2017.91\">https://doi.org/10.1038/nenergy.2017.91</a>","mla":"Freunberger, Stefan Alexander. “True Performance Metrics in Beyond-Intercalation Batteries.” <i>Nature Energy</i>, vol. 2, no. 7, 17091, Springer Nature, 2017, doi:<a href=\"https://doi.org/10.1038/nenergy.2017.91\">10.1038/nenergy.2017.91</a>.","ista":"Freunberger SA. 2017. True performance metrics in beyond-intercalation batteries. Nature Energy. 2(7), 17091.","chicago":"Freunberger, Stefan Alexander. “True Performance Metrics in Beyond-Intercalation Batteries.” <i>Nature Energy</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1038/nenergy.2017.91\">https://doi.org/10.1038/nenergy.2017.91</a>.","ama":"Freunberger SA. True performance metrics in beyond-intercalation batteries. <i>Nature Energy</i>. 2017;2(7). doi:<a href=\"https://doi.org/10.1038/nenergy.2017.91\">10.1038/nenergy.2017.91</a>","ieee":"S. A. Freunberger, “True performance metrics in beyond-intercalation batteries,” <i>Nature Energy</i>, vol. 2, no. 7. Springer Nature, 2017.","short":"S.A. Freunberger, Nature Energy 2 (2017)."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2002.00712"}],"file_date_updated":"2020-07-14T12:48:06Z","ddc":["540","546","541"],"article_number":"17091","_id":"7982","issue":"7","arxiv":1,"abstract":[{"text":"Beyond-intercalation batteries promise a step-change in energy storage compared to intercalation-based lithium-ion and sodium-ion batteries. However, only performance metrics that include all cell components and operation parameters can tell whether a true advance over intercalation batteries has been achieved.","lang":"eng"}],"date_updated":"2021-01-12T08:16:20Z","year":"2017","month":"06","status":"public","oa":1,"publication_identifier":{"issn":["2058-7546"]}},{"title":"Singlet oxygen generation as a major cause for parasitic reactions during cycling of aprotic lithium–oxygen batteries","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Mahne, Nika","last_name":"Mahne","first_name":"Nika"},{"last_name":"Schafzahl","first_name":"Bettina","full_name":"Schafzahl, Bettina"},{"last_name":"Leypold","first_name":"Christian","full_name":"Leypold, Christian"},{"full_name":"Leypold, Mario","first_name":"Mario","last_name":"Leypold"},{"full_name":"Grumm, Sandra","first_name":"Sandra","last_name":"Grumm"},{"full_name":"Leitgeb, Anita","last_name":"Leitgeb","first_name":"Anita"},{"first_name":"Gernot A.","last_name":"Strohmeier","full_name":"Strohmeier, Gernot A."},{"first_name":"Martin","last_name":"Wilkening","full_name":"Wilkening, Martin"},{"full_name":"Fontaine, Olivier","last_name":"Fontaine","first_name":"Olivier"},{"last_name":"Kramer","first_name":"Denis","full_name":"Kramer, Denis"},{"first_name":"Christian","last_name":"Slugovc","full_name":"Slugovc, Christian"},{"full_name":"Borisov, Sergey M.","first_name":"Sergey M.","last_name":"Borisov"},{"first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","full_name":"Freunberger, Stefan Alexander"}],"day":"20","extern":"1","external_id":{"arxiv":["1711.10340"]},"volume":2,"quality_controlled":"1","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"type":"journal_article","date_created":"2020-06-19T10:42:33Z","publication":"Nature Energy","month":"03","publication_identifier":{"issn":["2058-7546"]},"oa":1,"status":"public","_id":"7986","article_number":"17036 ","year":"2017","date_updated":"2021-01-12T08:16:21Z","arxiv":1,"issue":"5","intvolume":"         2","citation":{"apa":"Mahne, N., Schafzahl, B., Leypold, C., Leypold, M., Grumm, S., Leitgeb, A., … Freunberger, S. A. (2017). Singlet oxygen generation as a major cause for parasitic reactions during cycling of aprotic lithium–oxygen batteries. <i>Nature Energy</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nenergy.2017.36\">https://doi.org/10.1038/nenergy.2017.36</a>","mla":"Mahne, Nika, et al. “Singlet Oxygen Generation as a Major Cause for Parasitic Reactions during Cycling of Aprotic Lithium–Oxygen Batteries.” <i>Nature Energy</i>, vol. 2, no. 5, 17036, Springer Nature, 2017, doi:<a href=\"https://doi.org/10.1038/nenergy.2017.36\">10.1038/nenergy.2017.36</a>.","ista":"Mahne N, Schafzahl B, Leypold C, Leypold M, Grumm S, Leitgeb A, Strohmeier GA, Wilkening M, Fontaine O, Kramer D, Slugovc C, Borisov SM, Freunberger SA. 2017. Singlet oxygen generation as a major cause for parasitic reactions during cycling of aprotic lithium–oxygen batteries. Nature Energy. 2(5), 17036.","chicago":"Mahne, Nika, Bettina Schafzahl, Christian Leypold, Mario Leypold, Sandra Grumm, Anita Leitgeb, Gernot A. Strohmeier, et al. “Singlet Oxygen Generation as a Major Cause for Parasitic Reactions during Cycling of Aprotic Lithium–Oxygen Batteries.” <i>Nature Energy</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1038/nenergy.2017.36\">https://doi.org/10.1038/nenergy.2017.36</a>.","ieee":"N. Mahne <i>et al.</i>, “Singlet oxygen generation as a major cause for parasitic reactions during cycling of aprotic lithium–oxygen batteries,” <i>Nature Energy</i>, vol. 2, no. 5. Springer Nature, 2017.","ama":"Mahne N, Schafzahl B, Leypold C, et al. Singlet oxygen generation as a major cause for parasitic reactions during cycling of aprotic lithium–oxygen batteries. <i>Nature Energy</i>. 2017;2(5). doi:<a href=\"https://doi.org/10.1038/nenergy.2017.36\">10.1038/nenergy.2017.36</a>","short":"N. Mahne, B. Schafzahl, C. Leypold, M. Leypold, S. Grumm, A. Leitgeb, G.A. Strohmeier, M. Wilkening, O. Fontaine, D. Kramer, C. Slugovc, S.M. Borisov, S.A. Freunberger, Nature Energy 2 (2017)."},"main_file_link":[{"url":"https://arxiv.org/abs/1711.10340","open_access":"1"}],"date_published":"2017-03-20T00:00:00Z","oa_version":"Preprint","publication_status":"published","doi":"10.1038/nenergy.2017.36"}]