[{"year":"2018","has_accepted_license":"1","isi":1,"publication":"2018 International Conference on Embedded Software","day":"30","page":"1-10","date_created":"2019-02-13T09:19:28Z","date_published":"2018-09-30T00:00:00Z","doi":"10.1109/emsoft.2018.8537203","oa":1,"publisher":"IEEE","quality_controlled":"1","citation":{"chicago":"Bakhirkin, Alexey, Thomas Ferrere, Thomas A Henzinger, and Deian Nickovicl. “Keynote: The First-Order Logic of Signals.” In 2018 International Conference on Embedded Software, 1–10. IEEE, 2018. https://doi.org/10.1109/emsoft.2018.8537203.","ista":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. 2018. Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. EMSOFT: International Conference on Embedded Software, 1–10.","mla":"Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.” 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10, doi:10.1109/emsoft.2018.8537203.","short":"A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10.","ieee":"A. Bakhirkin, T. Ferrere, T. A. Henzinger, and D. Nickovicl, “Keynote: The first-order logic of signals,” in 2018 International Conference on Embedded Software, Turin, Italy, 2018, pp. 1–10.","apa":"Bakhirkin, A., Ferrere, T., Henzinger, T. A., & Nickovicl, D. (2018). Keynote: The first-order logic of signals. In 2018 International Conference on Embedded Software (pp. 1–10). Turin, Italy: IEEE. https://doi.org/10.1109/emsoft.2018.8537203","ama":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. Keynote: The first-order logic of signals. In: 2018 International Conference on Embedded Software. IEEE; 2018:1-10. doi:10.1109/emsoft.2018.8537203"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","external_id":{"isi":["000492828500005"]},"author":[{"first_name":"Alexey","last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","last_name":"Ferrere"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Nickovicl, Deian","last_name":"Nickovicl","first_name":"Deian"}],"title":"Keynote: The first-order logic of signals","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication_status":"published","publication_identifier":{"isbn":["9781538655603"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2018_EMSOFT_Bakhirkin.pdf","date_created":"2020-05-14T16:01:29Z","file_size":338006,"date_updated":"2020-07-14T12:47:13Z","creator":"dernst","file_id":"7839","checksum":"234a33ad9055b3458fcdda6af251b33a","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"abstract":[{"lang":"eng","text":"Formalizing properties of systems with continuous dynamics is a challenging task. In this paper, we propose a formal framework for specifying and monitoring rich temporal properties of real-valued signals. We introduce signal first-order logic (SFO) as a specification language that combines first-order logic with linear-real arithmetic and unary function symbols interpreted as piecewise-linear signals. We first show that while the satisfiability problem for SFO is undecidable, its membership and monitoring problems are decidable. We develop an offline monitoring procedure for SFO that has polynomial complexity in the size of the input trace and the specification, for a fixed number of quantifiers and function symbols. We show that the algorithm has computation time linear in the size of the input trace for the important fragment of bounded-response specifications interpreted over input traces with finite variability. We can use our results to extend signal temporal logic with first-order quantifiers over time and value parameters, while preserving its efficient monitoring. We finally demonstrate the practical appeal of our logic through a case study in the micro-electronics domain."}],"oa_version":"Published Version","scopus_import":"1","month":"09","date_updated":"2023-09-19T10:41:29Z","ddc":["000"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:13Z","_id":"5959","conference":{"end_date":"2018-10-05","location":"Turin, Italy","start_date":"2018-09-30","name":"EMSOFT: International Conference on Embedded Software"},"type":"conference","status":"public"},{"citation":{"ista":"Alistarh D-A, De Sa C, Konstantinov NH. 2018. The convergence of stochastic gradient descent in asynchronous shared memory. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 169–178.","chicago":"Alistarh, Dan-Adrian, Christopher De Sa, and Nikola H Konstantinov. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 169–78. ACM Press, 2018. https://doi.org/10.1145/3212734.3212763.","ieee":"D.-A. Alistarh, C. De Sa, and N. H. Konstantinov, “The convergence of stochastic gradient descent in asynchronous shared memory,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 169–178.","short":"D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 169–178.","ama":"Alistarh D-A, De Sa C, Konstantinov NH. The convergence of stochastic gradient descent in asynchronous shared memory. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:169-178. doi:10.1145/3212734.3212763","apa":"Alistarh, D.-A., De Sa, C., & Konstantinov, N. H. (2018). The convergence of stochastic gradient descent in asynchronous shared memory. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 169–178). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212763","mla":"Alistarh, Dan-Adrian, et al. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 169–78, doi:10.1145/3212734.3212763."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000458186900022"],"arxiv":["1803.08841"]},"article_processing_charge":"No","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"},{"first_name":"Christopher","last_name":"De Sa","full_name":"De Sa, Christopher"},{"first_name":"Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","last_name":"Konstantinov","full_name":"Konstantinov, Nikola H"}],"title":"The convergence of stochastic gradient descent in asynchronous shared memory","year":"2018","isi":1,"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","day":"23","page":"169-178","date_created":"2019-02-13T09:58:58Z","doi":"10.1145/3212734.3212763","date_published":"2018-07-23T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"ACM Press","date_updated":"2023-09-19T10:42:53Z","department":[{"_id":"DaAl"}],"_id":"5962","conference":{"name":"PODC: Principles of Distributed Computing","end_date":"2018-07-27","location":"Egham, United Kingdom","start_date":"2018-07-23"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"isbn":["9781450357951"]},"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning, representing the optimization backbone for training several classic models, from regression to neural networks. Given the recent practical focus on distributed machine learning, significant work has been dedicated to the convergence properties of this algorithm under the inconsistent and noisy updates arising from execution in a distributed environment. However, surprisingly, the convergence properties of this classic algorithm in the standard shared-memory model are still not well-understood. In this work, we address this gap, and provide new convergence bounds for lock-free concurrent stochastic gradient descent, executing in the classic asynchronous shared memory model, against a strong adaptive adversary. Our results give improved upper and lower bounds on the \"price of asynchrony'' when executing the fundamental SGD algorithm in a concurrent setting. They show that this classic optimization tool can converge faster and with a wider range of parameters than previously known under asynchronous iterations. At the same time, we exhibit a fundamental trade-off between the maximum delay in the system and the rate at which SGD can converge, which governs the set of parameters under which this algorithm can still work efficiently."}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1803.08841","open_access":"1"}],"scopus_import":"1","month":"07"},{"article_number":"20180395","citation":{"ista":"Corominas-Murtra B, Seoane LF, Solé R. 2018. Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. 15(149), 20180395.","chicago":"Corominas-Murtra, Bernat, Luís F. Seoane, and Ricard Solé. “Zipf’s Law, Unbounded Complexity and Open-Ended Evolution.” Journal of the Royal Society Interface. Royal Society Publishing, 2018. https://doi.org/10.1098/rsif.2018.0395.","ama":"Corominas-Murtra B, Seoane LF, Solé R. Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. 2018;15(149). doi:10.1098/rsif.2018.0395","apa":"Corominas-Murtra, B., Seoane, L. F., & Solé, R. (2018). Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. Royal Society Publishing. https://doi.org/10.1098/rsif.2018.0395","short":"B. Corominas-Murtra, L.F. Seoane, R. Solé, Journal of the Royal Society Interface 15 (2018).","ieee":"B. Corominas-Murtra, L. F. Seoane, and R. Solé, “Zipf’s Law, unbounded complexity and open-ended evolution,” Journal of the Royal Society Interface, vol. 15, no. 149. Royal Society Publishing, 2018.","mla":"Corominas-Murtra, Bernat, et al. “Zipf’s Law, Unbounded Complexity and Open-Ended Evolution.” Journal of the Royal Society Interface, vol. 15, no. 149, 20180395, Royal Society Publishing, 2018, doi:10.1098/rsif.2018.0395."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","external_id":{"isi":["000456783800002"],"arxiv":["1612.01605"]},"author":[{"last_name":"Corominas-Murtra","full_name":"Corominas-Murtra, Bernat","orcid":"0000-0001-9806-5643","id":"43BE2298-F248-11E8-B48F-1D18A9856A87","first_name":"Bernat"},{"full_name":"Seoane, Luís F.","last_name":"Seoane","first_name":"Luís F."},{"last_name":"Solé","full_name":"Solé, Ricard","first_name":"Ricard"}],"title":"Zipf's Law, unbounded complexity and open-ended evolution","oa":1,"publisher":"Royal Society Publishing","quality_controlled":"1","year":"2018","isi":1,"publication":"Journal of the Royal Society Interface","day":"12","date_created":"2019-01-20T22:59:19Z","doi":"10.1098/rsif.2018.0395","date_published":"2018-12-12T00:00:00Z","_id":"5860","type":"journal_article","status":"public","date_updated":"2023-09-19T10:40:38Z","department":[{"_id":"EdHa"}],"abstract":[{"lang":"eng","text":"A major problem for evolutionary theory is understanding the so-called open-ended nature of evolutionary change, from its definition to its origins. Open-ended evolution (OEE) refers to the unbounded increase in complexity that seems to characterize evolution on multiple scales. This property seems to be a characteristic feature of biological and technological evolution and is strongly tied to the generative potential associated with combinatorics, which allows the system to grow and expand their available state spaces. Interestingly, many complex systems presumably displaying OEE, from language to proteins, share a common statistical property: the presence of Zipf's Law. Given an inventory of basic items (such as words or protein domains) required to build more complex structures (sentences or proteins) Zipf's Law tells us that most of these elements are rare whereas a few of them are extremely common. Using algorithmic information theory, in this paper we provide a fundamental definition for open-endedness, which can be understood as postulates. Its statistical counterpart, based on standard Shannon information theory, has the structure of a variational problem which is shown to lead to Zipf's Law as the expected consequence of an evolutionary process displaying OEE. We further explore the problem of information conservation through an OEE process and we conclude that statistical information (standard Shannon information) is not conserved, resulting in the paradoxical situation in which the increase of information content has the effect of erasing itself. We prove that this paradox is solved if we consider non-statistical forms of information. This last result implies that standard information theory may not be a suitable theoretical framework to explore the persistence and increase of the information content in OEE systems."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.01605"}],"scopus_import":"1","intvolume":" 15","month":"12","publication_status":"published","publication_identifier":{"issn":["17425689"]},"language":[{"iso":"eng"}],"issue":"149","volume":15},{"abstract":[{"text":"The area of machine learning has made considerable progress over the past decade, enabled by the widespread availability of large datasets, as well as by improved algorithms and models. Given the large computational demands of machine learning workloads, parallelism, implemented either through single-node concurrency or through multi-node distribution, has been a third key ingredient to advances in machine learning.\r\nThe goal of this tutorial is to provide the audience with an overview of standard distribution techniques in machine learning, with an eye towards the intriguing trade-offs between synchronization and communication costs of distributed machine learning algorithms, on the one hand, and their convergence, on the other.The tutorial will focus on parallelization strategies for the fundamental stochastic gradient descent (SGD) algorithm, which is a key tool when training machine learning models, from classical instances such as linear regression, to state-of-the-art neural network architectures.\r\nThe tutorial will describe the guarantees provided by this algorithm in the sequential case, and then move on to cover both shared-memory and message-passing parallelization strategies, together with the guarantees they provide, and corresponding trade-offs. The presentation will conclude with a broad overview of ongoing research in distributed and concurrent machine learning. The tutorial will assume no prior knowledge beyond familiarity with basic concepts in algebra and analysis.\r\n","lang":"eng"}],"oa_version":"None","scopus_import":"1","quality_controlled":"1","publisher":"ACM Press","month":"07","publication_identifier":{"isbn":["9781450357951"]},"isi":1,"year":"2018","publication_status":"published","day":"27","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","language":[{"iso":"eng"}],"page":"487-488","doi":"10.1145/3212734.3212798","date_published":"2018-07-27T00:00:00Z","date_created":"2019-02-13T09:48:55Z","_id":"5961","type":"conference","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23","end_date":"2018-07-27","location":"Egham, United Kingdom"},"status":"public","date_updated":"2023-09-19T10:42:28Z","citation":{"ista":"Alistarh D-A. 2018. A brief tutorial on distributed and concurrent machine learning. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 487–488.","chicago":"Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 487–88. ACM Press, 2018. https://doi.org/10.1145/3212734.3212798.","ama":"Alistarh D-A. A brief tutorial on distributed and concurrent machine learning. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:487-488. doi:10.1145/3212734.3212798","apa":"Alistarh, D.-A. (2018). A brief tutorial on distributed and concurrent machine learning. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 487–488). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212798","short":"D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 487–488.","ieee":"D.-A. Alistarh, “A brief tutorial on distributed and concurrent machine learning,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 487–488.","mla":"Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 487–88, doi:10.1145/3212734.3212798."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"}],"article_processing_charge":"No","external_id":{"isi":["000458186900063"]},"title":"A brief tutorial on distributed and concurrent machine learning","department":[{"_id":"DaAl"}]},{"month":"10","intvolume":" 37","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.01341"}],"oa_version":"Preprint","abstract":[{"text":"In this paper we present a reliable method to verify the existence of loops along the uncertain trajectory of a robot, based on proprioceptive measurements only, within a bounded-error context. The loop closure detection is one of the key points in simultaneous localization and mapping (SLAM) methods, especially in homogeneous environments with difficult scenes recognitions. The proposed approach is generic and could be coupled with conventional SLAM algorithms to reliably reduce their computing burden, thus improving the localization and mapping processes in the most challenging environments such as unexplored underwater extents. To prove that a robot performed a loop whatever the uncertainties in its evolution, we employ the notion of topological degree that originates in the field of differential topology. We show that a verification tool based on the topological degree is an optimal method for proving robot loops. This is demonstrated both on datasets from real missions involving autonomous underwater vehicles and by a mathematical discussion.","lang":"eng"}],"issue":"12","volume":37,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0278-3649"],"eissn":["1741-3176"]},"publication_status":"published","status":"public","type":"journal_article","_id":"5960","department":[{"_id":"UlWa"}],"date_updated":"2023-09-19T10:41:59Z","quality_controlled":"1","publisher":"SAGE Publications","oa":1,"doi":"10.1177/0278364918808367","date_published":"2018-10-24T00:00:00Z","date_created":"2019-02-13T09:36:20Z","page":"1500-1516","day":"24","publication":"The International Journal of Robotics Research","isi":1,"year":"2018","title":"Proving the existence of loops in robot trajectories","author":[{"full_name":"Rohou, Simon","last_name":"Rohou","first_name":"Simon"},{"id":"473294AE-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Franek","orcid":"0000-0001-8878-8397","full_name":"Franek, Peter"},{"first_name":"Clément","full_name":"Aubry, Clément","last_name":"Aubry"},{"last_name":"Jaulin","full_name":"Jaulin, Luc","first_name":"Luc"}],"article_processing_charge":"No","external_id":{"arxiv":["1712.01341"],"isi":["000456881100004"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516.","ieee":"S. Rohou, P. Franek, C. Aubry, and L. Jaulin, “Proving the existence of loops in robot trajectories,” The International Journal of Robotics Research, vol. 37, no. 12. SAGE Publications, pp. 1500–1516, 2018.","ama":"Rohou S, Franek P, Aubry C, Jaulin L. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 2018;37(12):1500-1516. doi:10.1177/0278364918808367","apa":"Rohou, S., Franek, P., Aubry, C., & Jaulin, L. (2018). Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. SAGE Publications. https://doi.org/10.1177/0278364918808367","mla":"Rohou, Simon, et al. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research, vol. 37, no. 12, SAGE Publications, 2018, pp. 1500–16, doi:10.1177/0278364918808367.","ista":"Rohou S, Franek P, Aubry C, Jaulin L. 2018. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 37(12), 1500–1516.","chicago":"Rohou, Simon, Peter Franek, Clément Aubry, and Luc Jaulin. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research. SAGE Publications, 2018. https://doi.org/10.1177/0278364918808367."}},{"_id":"5963","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23","location":"Egham, United Kingdom","end_date":"2018-07-27"},"type":"conference","status":"public","date_updated":"2023-09-19T10:43:21Z","department":[{"_id":"DaAl"}],"abstract":[{"text":"There has been significant progress in understanding the parallelism inherent to iterative sequential algorithms: for many classic algorithms, the depth of the dependence structure is now well understood, and scheduling techniques have been developed to exploit this shallow dependence structure for efficient parallel implementations. A related, applied research strand has studied methods by which certain iterative task-based algorithms can be efficiently parallelized via relaxed concurrent priority schedulers. These allow for high concurrency when inserting and removing tasks, at the cost of executing superfluous work due to the relaxed semantics of the scheduler. In this work, we take a step towards unifying these two research directions, by showing that there exists a family of relaxed priority schedulers that can efficiently and deterministically execute classic iterative algorithms such as greedy maximal independent set (MIS) and matching. Our primary result shows that, given a randomized scheduler with an expected relaxation factor of k in terms of the maximum allowed priority inversions on a task, and any graph on n vertices, the scheduler is able to execute greedy MIS with only an additive factor of \\poly(k) expected additional iterations compared to an exact (but not scalable) scheduler. This counter-intuitive result demonstrates that the overhead of relaxation when computing MIS is not dependent on the input size or structure of the input graph. Experimental results show that this overhead can be clearly offset by the gain in performance due to the highly scalable scheduler. In sum, we present an efficient method to deterministically parallelize iterative sequential algorithms, with provable runtime guarantees in terms of the number of executed tasks to completion.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1808.04155","open_access":"1"}],"scopus_import":"1","month":"07","publication_status":"published","publication_identifier":{"isbn":["9781450357951"]},"language":[{"iso":"eng"}],"citation":{"chicago":"Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 377–86. ACM Press, 2018. https://doi.org/10.1145/3212734.3212756.","ista":"Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. 2018. Relaxed schedulers can efficiently parallelize iterative algorithms. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 377–386.","mla":"Alistarh, Dan-Adrian, et al. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 377–86, doi:10.1145/3212734.3212756.","ieee":"D.-A. Alistarh, T. A. Brown, J. Kopinsky, and G. Nadiradze, “Relaxed schedulers can efficiently parallelize iterative algorithms,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 377–386.","short":"D.-A. Alistarh, T.A. Brown, J. Kopinsky, G. Nadiradze, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 377–386.","apa":"Alistarh, D.-A., Brown, T. A., Kopinsky, J., & Nadiradze, G. (2018). Relaxed schedulers can efficiently parallelize iterative algorithms. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 377–386). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212756","ama":"Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:377-386. doi:10.1145/3212734.3212756"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","external_id":{"isi":["000458186900048"],"arxiv":["1808.04155"]},"author":[{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A","last_name":"Brown","full_name":"Brown, Trevor A"},{"first_name":"Justin","full_name":"Kopinsky, Justin","last_name":"Kopinsky"},{"first_name":"Giorgi","full_name":"Nadiradze, Giorgi","last_name":"Nadiradze"}],"title":"Relaxed schedulers can efficiently parallelize iterative algorithms","oa":1,"publisher":"ACM Press","quality_controlled":"1","year":"2018","isi":1,"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","day":"23","page":"377-386","date_created":"2019-02-13T10:03:25Z","date_published":"2018-07-23T00:00:00Z","doi":"10.1145/3212734.3212756"},{"page":"133-142","date_published":"2018-07-16T00:00:00Z","doi":"10.1145/3210377.3210411","date_created":"2019-02-13T10:17:19Z","isi":1,"year":"2018","day":"16","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","quality_controlled":"1","publisher":"ACM Press","oa":1,"author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A","last_name":"Brown"},{"last_name":"Kopinsky","full_name":"Kopinsky, Justin","first_name":"Justin"},{"full_name":"Li, Jerry Z.","last_name":"Li","first_name":"Jerry Z."},{"last_name":"Nadiradze","full_name":"Nadiradze, Giorgi","first_name":"Giorgi"}],"external_id":{"arxiv":["1804.01018"],"isi":["000545269600016"]},"article_processing_charge":"No","title":"Distributionally linearizable data structures","citation":{"mla":"Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 133–42, doi:10.1145/3210377.3210411.","ama":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press; 2018:133-142. doi:10.1145/3210377.3210411","apa":"Alistarh, D.-A., Brown, T. A., Kopinsky, J., Li, J. Z., & Nadiradze, G. (2018). Distributionally linearizable data structures. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 133–142). Vienna, Austria: ACM Press. https://doi.org/10.1145/3210377.3210411","short":"D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 133–142.","ieee":"D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.","chicago":"Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 133–42. ACM Press, 2018. https://doi.org/10.1145/3210377.3210411.","ista":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. 2018. Distributionally linearizable data structures. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 133–142."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"relation":"dissertation_contains","id":"10429","status":"public"}]},"publication_identifier":{"isbn":["9781450357999"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1804.01018","open_access":"1"}],"month":"07","abstract":[{"lang":"eng","text":"Relaxed concurrent data structures have become increasingly popular, due to their scalability in graph processing and machine learning applications (\\citeNguyen13, gonzalez2012powergraph ). Despite considerable interest, there exist families of natural, high performing randomized relaxed concurrent data structures, such as the popular MultiQueue~\\citeMQ pattern for implementing relaxed priority queue data structures, for which no guarantees are known in the concurrent setting~\\citeAKLN17. Our main contribution is in showing for the first time that, under a set of analytic assumptions, a family of relaxed concurrent data structures, including variants of MultiQueues, but also a new approximate counting algorithm we call the MultiCounter, provides strong probabilistic guarantees on the degree of relaxation with respect to the sequential specification, in arbitrary concurrent executions. We formalize these guarantees via a new correctness condition called distributional linearizability, tailored to concurrent implementations with randomized relaxations. Our result is based on a new analysis of an asynchronous variant of the classic power-of-two-choices load balancing algorithm, in which placement choices can be based on inconsistent, outdated information (this result may be of independent interest). We validate our results empirically, showing that the MultiCounter algorithm can implement scalable relaxed timestamps."}],"oa_version":"Preprint","department":[{"_id":"DaAl"}],"date_updated":"2023-09-19T10:44:13Z","type":"conference","conference":{"start_date":"2018-07-16","end_date":"2018-07-18","location":"Vienna, Austria","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"status":"public","_id":"5965"},{"title":"The Big Match with a clock and a bit of memory","author":[{"full_name":"Hansen, Kristoffer Arnsfelt","last_name":"Hansen","first_name":"Kristoffer Arnsfelt"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"first_name":"Abraham","full_name":"Neyman, Abraham","last_name":"Neyman"}],"article_processing_charge":"No","external_id":{"isi":["000492755100020"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, 149–50. ACM Press, 2018. https://doi.org/10.1145/3219166.3219198.","ista":"Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. EC: Conference on Economics and Computation, 149–150.","mla":"Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–50, doi:10.1145/3219166.3219198.","ieee":"K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.","short":"K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–150.","ama":"Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit of memory. In: Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. ACM Press; 2018:149-150. doi:10.1145/3219166.3219198","apa":"Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM Press. https://doi.org/10.1145/3219166.3219198"},"doi":"10.1145/3219166.3219198","date_published":"2018-06-18T00:00:00Z","date_created":"2019-02-13T10:31:41Z","page":"149-150","day":"18","publication":"Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18","isi":1,"has_accepted_license":"1","year":"2018","quality_controlled":"1","publisher":"ACM Press","oa":1,"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:14Z","ddc":["000"],"date_updated":"2023-09-19T10:45:15Z","status":"public","type":"conference","conference":{"name":"EC: Conference on Economics and Computation","end_date":"2018-06-22","location":"Ithaca, NY, United States","start_date":"2018-06-18"},"_id":"5967","file":[{"creator":"dernst","date_updated":"2020-07-14T12:47:14Z","file_size":302539,"date_created":"2019-11-19T08:24:24Z","file_name":"2018_EC18_Hansen.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"7054","checksum":"bb52683e349cfd864f4769a8f38f2798"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450358293"]},"publication_status":"published","month":"06","scopus_import":"1","oa_version":"Submitted Version","abstract":[{"text":"The Big Match is a multi-stage two-player game. In each stage Player 1 hides one or two pebbles in his hand, and his opponent has to guess that number; Player 1 loses a point if Player 2 is correct, and otherwise he wins a point. As soon as Player 1 hides one pebble, the players cannot change their choices in any future stage.\r\nBlackwell and Ferguson (1968) give an ε-optimal strategy for Player 1 that hides, in each stage, one pebble with a probability that depends on the entire past history. Any strategy that depends just on the clock or on a finite memory is worthless. The long-standing natural open problem has been whether every strategy that depends just on the clock and a finite memory is worthless. We prove that there is such a strategy that is ε-optimal. In fact, we show that just two states of memory are sufficient.\r\n","lang":"eng"}]},{"oa":1,"publisher":"ACM Press","quality_controlled":"1","year":"2018","isi":1,"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","day":"16","page":"383-392","date_created":"2019-02-13T10:26:07Z","date_published":"2018-07-16T00:00:00Z","doi":"10.1145/3210377.3210406","citation":{"ista":"Alistarh D-A, Haider SK, Kübler R, Nadiradze G. 2018. The transactional conflict problem. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 383–392.","chicago":"Alistarh, Dan-Adrian, Syed Kamran Haider, Raphael Kübler, and Giorgi Nadiradze. “The Transactional Conflict Problem.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 383–92. ACM Press, 2018. https://doi.org/10.1145/3210377.3210406.","apa":"Alistarh, D.-A., Haider, S. K., Kübler, R., & Nadiradze, G. (2018). The transactional conflict problem. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 383–392). Vienna, Austria: ACM Press. https://doi.org/10.1145/3210377.3210406","ama":"Alistarh D-A, Haider SK, Kübler R, Nadiradze G. The transactional conflict problem. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press; 2018:383-392. doi:10.1145/3210377.3210406","short":"D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 383–392.","ieee":"D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 383–392.","mla":"Alistarh, Dan-Adrian, et al. “The Transactional Conflict Problem.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 383–92, doi:10.1145/3210377.3210406."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","external_id":{"arxiv":["1804.00947"],"isi":["000545269600046"]},"author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Syed Kamran","full_name":"Haider, Syed Kamran","last_name":"Haider"},{"first_name":"Raphael","full_name":"Kübler, Raphael","last_name":"Kübler"},{"last_name":"Nadiradze","full_name":"Nadiradze, Giorgi","first_name":"Giorgi"}],"title":"The transactional conflict problem","abstract":[{"text":"The transactional conflict problem arises in transactional systems whenever two or more concurrent transactions clash on a data item. While the standard solution to such conflicts is to immediately abort one of the transactions, some practical systems consider the alternative of delaying conflict resolution for a short interval, which may allow one of the transactions to commit. The challenge in the transactional conflict problem is to choose the optimal length of this delay interval so as to minimize the overall running time penalty for the conflicting transactions. In this paper, we propose a family of optimal online algorithms for the transactional conflict problem. Specifically, we consider variants of this problem which arise in different implementations of transactional systems, namely \"requestor wins'' and \"requestor aborts'' implementations: in the former, the recipient of a coherence request is aborted, whereas in the latter, it is the requestor which has to abort. Both strategies are implemented by real systems. We show that the requestor aborts case can be reduced to a classic instance of the ski rental problem, while the requestor wins case leads to a new version of this classical problem, for which we derive optimal deterministic and randomized algorithms. Moreover, we prove that, under a simplified adversarial model, our algorithms are constant-competitive with the offline optimum in terms of throughput. We validate our algorithmic results empirically through a hardware simulation of hardware transactional memory (HTM), showing that our algorithms can lead to non-trivial performance improvements for classic concurrent data structures.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1804.00947","open_access":"1"}],"scopus_import":"1","month":"07","publication_status":"published","publication_identifier":{"isbn":["9781450357999"]},"language":[{"iso":"eng"}],"_id":"5966","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","start_date":"2018-07-16","end_date":"2018-07-18","location":"Vienna, Austria"},"type":"conference","status":"public","date_updated":"2023-09-19T10:44:49Z","department":[{"_id":"DaAl"}]},{"date_created":"2019-02-13T12:59:33Z","doi":"10.1137/16m1093306","date_published":"2018-11-08T00:00:00Z","page":"2029-2056","publication":"SIAM Journal on Computing","day":"08","year":"2018","isi":1,"oa":1,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","quality_controlled":"1","title":"Commutativity in the algorithmic Lovász local lemma","external_id":{"isi":["000453785100001"],"arxiv":["1506.08547"]},"article_processing_charge":"No","author":[{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 2018;47(6):2029-2056. doi:10.1137/16m1093306","apa":"Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). https://doi.org/10.1137/16m1093306","ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM Journal on Computing, vol. 47, no. 6. Society for Industrial & Applied Mathematics (SIAM), pp. 2029–2056, 2018.","short":"V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.","mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial & Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.","ista":"Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056.","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM), 2018. https://doi.org/10.1137/16m1093306."},"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"volume":47,"issue":"6","related_material":{"record":[{"status":"public","id":"1193","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"intvolume":" 47","month":"11","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.08547"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the recent formulation of the algorithmic Lov ́asz Local Lemma [N. Har-vey and J. Vondr ́ak, inProceedings of FOCS, 2015, pp. 1327–1345; D. Achlioptas and F. Iliopoulos,inProceedings of SODA, 2016, pp. 2024–2038; D. Achlioptas, F. Iliopoulos, and V. Kolmogorov,ALocal Lemma for Focused Stochastic Algorithms, arXiv preprint, 2018] for finding objects that avoid“bad features,” or “flaws.” It extends the Moser–Tardos resampling algorithm [R. A. Moser andG. Tardos,J. ACM, 57 (2010), 11] to more general discrete spaces. At each step the method picks aflaw present in the current state and goes to a new state according to some prespecified probabilitydistribution (which depends on the current state and the selected flaw). However, the recent formu-lation is less flexible than the Moser–Tardos method since it requires a specific flaw selection rule,whereas the algorithm of Moser and Tardos allows an arbitrary rule (and thus can potentially beimplemented more efficiently). We formulate a new “commutativity” condition and prove that it issufficient for an arbitrary rule to work. It also enables an efficient parallelization under an additionalassumption. We then show that existing resampling oracles for perfect matchings and permutationsdo satisfy this condition."}],"department":[{"_id":"VlKo"}],"date_updated":"2023-09-19T14:24:58Z","status":"public","type":"journal_article","_id":"5975"},{"_id":"5964","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23","end_date":"2018-07-27","location":"Egham, United Kingdom"},"type":"conference","status":"public","date_updated":"2023-09-19T10:43:45Z","department":[{"_id":"DaAl"}],"abstract":[{"text":"A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is an alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. A lock can be viewed as a queue that arbitrates the order in which the critical sections are executed, and a natural question is whether we can use stochastic analysis to predict the resulting throughput. As a preliminary evidence to the affirmative, we describe a simple model that can be used to predict the throughput of coarse-grained lock-based algorithms. We show that our model works well for CLH lock, and we expect it to work for other popular lock designs such as TTAS, MCS, etc.","lang":"eng"}],"oa_version":"Submitted Version","main_file_link":[{"url":"https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1","open_access":"1"}],"scopus_import":"1","month":"07","publication_status":"published","publication_identifier":{"isbn":["9781450357951"]},"language":[{"iso":"eng"}],"citation":{"ista":"Aksenov V, Alistarh D-A, Kuznetsov P. 2018. Brief Announcement: Performance prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 411–413.","chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 411–13. ACM Press, 2018. https://doi.org/10.1145/3212734.3212785.","short":"V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 411–413.","ieee":"V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 411–413.","apa":"Aksenov, V., Alistarh, D.-A., & Kuznetsov, P. (2018). Brief Announcement: Performance prediction for coarse-grained locking. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 411–413). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212785","ama":"Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:411-413. doi:10.1145/3212734.3212785","mla":"Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 411–13, doi:10.1145/3212734.3212785."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","external_id":{"isi":["000458186900052"]},"author":[{"full_name":"Aksenov, Vitaly","last_name":"Aksenov","first_name":"Vitaly"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Petr","full_name":"Kuznetsov, Petr","last_name":"Kuznetsov"}],"title":"Brief Announcement: Performance prediction for coarse-grained locking","oa":1,"quality_controlled":"1","publisher":"ACM Press","year":"2018","isi":1,"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","day":"23","page":"411-413","date_created":"2019-02-13T10:08:19Z","date_published":"2018-07-23T00:00:00Z","doi":"10.1145/3212734.3212785"},{"project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"article_number":"1950009","title":"Bounds on the norm of Wigner-type random matrices","author":[{"last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"},{"first_name":"Peter","full_name":"Mühlbacher, Peter","last_name":"Mühlbacher"}],"article_processing_charge":"No","external_id":{"arxiv":["1802.05175"],"isi":["000477677200002"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Erdös L, Mühlbacher P. 2018. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications., 1950009.","chicago":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications. World Scientific Publishing, 2018. https://doi.org/10.1142/s2010326319500096.","short":"L. Erdös, P. Mühlbacher, Random Matrices: Theory and Applications (2018).","ieee":"L. Erdös and P. Mühlbacher, “Bounds on the norm of Wigner-type random matrices,” Random matrices: Theory and applications. World Scientific Publishing, 2018.","ama":"Erdös L, Mühlbacher P. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications. 2018. doi:10.1142/s2010326319500096","apa":"Erdös, L., & Mühlbacher, P. (2018). Bounds on the norm of Wigner-type random matrices. Random Matrices: Theory and Applications. World Scientific Publishing. https://doi.org/10.1142/s2010326319500096","mla":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications, 1950009, World Scientific Publishing, 2018, doi:10.1142/s2010326319500096."},"publisher":"World Scientific Publishing","quality_controlled":"1","oa":1,"doi":"10.1142/s2010326319500096","date_published":"2018-09-26T00:00:00Z","date_created":"2019-02-13T10:40:54Z","day":"26","publication":"Random matrices: Theory and applications","isi":1,"year":"2018","status":"public","type":"journal_article","_id":"5971","department":[{"_id":"LaEr"}],"date_updated":"2023-09-19T14:24:05Z","month":"09","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1802.05175","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"We consider a Wigner-type ensemble, i.e. large hermitian N×N random matrices H=H∗ with centered independent entries and with a general matrix of variances Sxy=𝔼∣∣Hxy∣∣2. The norm of H is asymptotically given by the maximum of the support of the self-consistent density of states. We establish a bound on this maximum in terms of norms of powers of S that substantially improves the earlier bound 2∥S∥1/2∞ given in [O. Ajanki, L. Erdős and T. Krüger, Universality for general Wigner-type matrices, Prob. Theor. Rel. Fields169 (2017) 667–727]. The key element of the proof is an effective Markov chain approximation for the contributions of the weighted Dyck paths appearing in the iterative solution of the corresponding Dyson equation.","lang":"eng"}],"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2010-3271"],"issn":["2010-3263"]},"publication_status":"published"},{"ddc":["570"],"date_updated":"2023-09-19T14:29:32Z","file_date_updated":"2020-07-14T12:47:14Z","department":[{"_id":"HaJa"},{"_id":"CaGu"},{"_id":"MiSi"}],"_id":"5984","status":"public","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"file_name":"2018_Springer_Morri.pdf","date_created":"2019-02-14T10:58:29Z","creator":"kschuh","file_size":1349914,"date_updated":"2020-07-14T12:47:14Z","checksum":"8325fcc194264af4749e662a73bf66b5","file_id":"5985","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2041-1723"]},"publication_status":"published","volume":9,"issue":"1","license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"oa_version":"Published Version","abstract":[{"text":"G-protein-coupled receptors (GPCRs) form the largest receptor family, relay environmental stimuli to changes in cell behavior and represent prime drug targets. Many GPCRs are classified as orphan receptors because of the limited knowledge on their ligands and coupling to cellular signaling machineries. Here, we engineer a library of 63 chimeric receptors that contain the signaling domains of human orphan and understudied GPCRs functionally linked to the light-sensing domain of rhodopsin. Upon stimulation with visible light, we identify activation of canonical cell signaling pathways, including cAMP-, Ca2+-, MAPK/ERK-, and Rho-dependent pathways, downstream of the engineered receptors. For the human pseudogene GPR33, we resurrect a signaling function that supports its hypothesized role as a pathogen entry site. These results demonstrate that substituting unknown chemical activators with a light switch can reveal information about protein function and provide an optically controlled protein library for exploring the physiology and therapeutic potential of understudied GPCRs.","lang":"eng"}],"month":"12","intvolume":" 9","scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Morri M, Sanchez-Romero I, Tichy A-M, Kainrath S, Gerrard EJ, Hirschfeld P, Schwarz J, Janovjak HL. 2018. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 9(1), 1950.","chicago":"Morri, Maurizio, Inmaculada Sanchez-Romero, Alexandra-Madelaine Tichy, Stephanie Kainrath, Elliot J. Gerrard, Priscila Hirschfeld, Jan Schwarz, and Harald L Janovjak. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04342-1.","apa":"Morri, M., Sanchez-Romero, I., Tichy, A.-M., Kainrath, S., Gerrard, E. J., Hirschfeld, P., … Janovjak, H. L. (2018). Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04342-1","ama":"Morri M, Sanchez-Romero I, Tichy A-M, et al. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-04342-1","ieee":"M. Morri et al., “Optical functionalization of human class A orphan G-protein-coupled receptors,” Nature Communications, vol. 9, no. 1. Springer Nature, 2018.","short":"M. Morri, I. Sanchez-Romero, A.-M. Tichy, S. Kainrath, E.J. Gerrard, P. Hirschfeld, J. Schwarz, H.L. Janovjak, Nature Communications 9 (2018).","mla":"Morri, Maurizio, et al. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” Nature Communications, vol. 9, no. 1, 1950, Springer Nature, 2018, doi:10.1038/s41467-018-04342-1."},"title":"Optical functionalization of human class A orphan G-protein-coupled receptors","author":[{"last_name":"Morri","full_name":"Morri, Maurizio","id":"4863116E-F248-11E8-B48F-1D18A9856A87","first_name":"Maurizio"},{"id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","first_name":"Inmaculada","full_name":"Sanchez-Romero, Inmaculada","last_name":"Sanchez-Romero"},{"first_name":"Alexandra-Madelaine","id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87","full_name":"Tichy, Alexandra-Madelaine","last_name":"Tichy"},{"last_name":"Kainrath","full_name":"Kainrath, Stephanie","first_name":"Stephanie","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Elliot J.","last_name":"Gerrard","full_name":"Gerrard, Elliot J."},{"last_name":"Hirschfeld","full_name":"Hirschfeld, Priscila","first_name":"Priscila","id":"435ACB3A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","last_name":"Schwarz","full_name":"Schwarz, Jan"},{"first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315"}],"article_processing_charge":"No","external_id":{"isi":["000432280000006"]},"article_number":"1950","project":[{"grant_number":"303564","name":"Microbial Ion Channels for Synthetic Neurobiology","_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Molecular Drug Targets","grant_number":"W1232-B24","call_identifier":"FWF","_id":"255A6082-B435-11E9-9278-68D0E5697425"}],"day":"01","publication":"Nature Communications","isi":1,"has_accepted_license":"1","year":"2018","date_published":"2018-12-01T00:00:00Z","doi":"10.1038/s41467-018-04342-1","date_created":"2019-02-14T10:50:24Z","publisher":"Springer Nature","quality_controlled":"1","oa":1},{"type":"journal_article","article_type":"original","pubrep_id":"1068","status":"public","_id":"5976","file_date_updated":"2020-07-14T12:47:14Z","department":[{"_id":"BeBi"}],"date_updated":"2023-09-19T14:25:30Z","ddc":["000"],"scopus_import":"1","intvolume":" 37","month":"11","abstract":[{"text":"We propose FlexMaps, a novel framework for fabricating smooth shapes out of flat, flexible panels with tailored mechanical properties. We start by mapping the 3D surface onto a 2D domain as in traditional UV mapping to design a set of deformable flat panels called FlexMaps. For these panels, we design and obtain specific mechanical properties such that, once they are assembled, the static equilibrium configuration matches the desired 3D shape. FlexMaps can be fabricated from an almost rigid material, such as wood or plastic, and are made flexible in a controlled way by using computationally designed spiraling microstructures.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":37,"issue":"6","publication_status":"published","publication_identifier":{"issn":["0730-0301"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2019-09-23T12:48:52Z","file_name":"flexmaps_author_version.pdf","date_updated":"2020-07-14T12:47:14Z","file_size":100109811,"creator":"bbickel","checksum":"d0529a41c78b37ab8840685579fb33b4","file_id":"6901","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"},{"grant_number":"645599","name":"Soft-bodied intelligence for Manipulation","_id":"25082902-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_number":"241","article_processing_charge":"No","external_id":{"isi":["000455953100064"]},"author":[{"last_name":"Malomo","full_name":"Malomo, Luigi","first_name":"Luigi"},{"first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","full_name":"Perez Rodriguez, Jesus","last_name":"Perez Rodriguez"},{"full_name":"Iarussi, Emmanuel","last_name":"Iarussi","first_name":"Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"},{"first_name":"Eder","full_name":"Miguel, Eder","last_name":"Miguel"},{"last_name":"Cignoni","full_name":"Cignoni, Paolo","first_name":"Paolo"},{"last_name":"Bickel","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"title":"FlexMaps: Computational design of flat flexible shells for shaping 3D objects","citation":{"chicago":"Malomo, Luigi, Jesus Perez Rodriguez, Emmanuel Iarussi, Nico Pietroni, Eder Miguel, Paolo Cignoni, and Bernd Bickel. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” ACM Transactions on Graphics. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3272127.3275076.","ista":"Malomo L, Perez Rodriguez J, Iarussi E, Pietroni N, Miguel E, Cignoni P, Bickel B. 2018. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 37(6), 241.","mla":"Malomo, Luigi, et al. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” ACM Transactions on Graphics, vol. 37, no. 6, 241, Association for Computing Machinery (ACM), 2018, doi:10.1145/3272127.3275076.","ama":"Malomo L, Perez Rodriguez J, Iarussi E, et al. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 2018;37(6). doi:10.1145/3272127.3275076","apa":"Malomo, L., Perez Rodriguez, J., Iarussi, E., Pietroni, N., Miguel, E., Cignoni, P., & Bickel, B. (2018). FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. Association for Computing Machinery (ACM). https://doi.org/10.1145/3272127.3275076","ieee":"L. Malomo et al., “FlexMaps: Computational design of flat flexible shells for shaping 3D objects,” ACM Transactions on Graphics, vol. 37, no. 6. Association for Computing Machinery (ACM), 2018.","short":"L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018)."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"publisher":"Association for Computing Machinery (ACM)","quality_controlled":"1","date_created":"2019-02-13T13:12:53Z","date_published":"2018-11-01T00:00:00Z","doi":"10.1145/3272127.3275076","year":"2018","isi":1,"has_accepted_license":"1","publication":"ACM Transactions on Graphics","day":"01"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. 2018. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 98(22), 224506.","chicago":"Yakaboylu, Enderalp, Bikashkali Midya, Andreas Deuchert, Nikolai K Leopold, and Mikhail Lemeshko. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/physrevb.98.224506.","short":"E. Yakaboylu, B. Midya, A. Deuchert, N.K. Leopold, M. Lemeshko, Physical Review B 98 (2018).","ieee":"E. Yakaboylu, B. Midya, A. Deuchert, N. K. Leopold, and M. Lemeshko, “Theory of the rotating polaron: Spectrum and self-localization,” Physical Review B, vol. 98, no. 22. American Physical Society, 2018.","ama":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 2018;98(22). doi:10.1103/physrevb.98.224506","apa":"Yakaboylu, E., Midya, B., Deuchert, A., Leopold, N. K., & Lemeshko, M. (2018). Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.98.224506","mla":"Yakaboylu, Enderalp, et al. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” Physical Review B, vol. 98, no. 22, 224506, American Physical Society, 2018, doi:10.1103/physrevb.98.224506."},"title":"Theory of the rotating polaron: Spectrum and self-localization","author":[{"first_name":"Enderalp","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","last_name":"Yakaboylu","orcid":"0000-0001-5973-0874","full_name":"Yakaboylu, Enderalp"},{"first_name":"Bikashkali","id":"456187FC-F248-11E8-B48F-1D18A9856A87","last_name":"Midya","full_name":"Midya, Bikashkali"},{"orcid":"0000-0003-3146-6746","full_name":"Deuchert, Andreas","last_name":"Deuchert","first_name":"Andreas","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Leopold","full_name":"Leopold, Nikolai K","orcid":"0000-0002-0495-6822","first_name":"Nikolai K","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko"}],"article_processing_charge":"No","external_id":{"arxiv":["1809.01204"],"isi":["000452992700008"]},"article_number":"224506","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"694227","name":"Analysis of quantum many-body systems"}],"day":"12","publication":"Physical Review B","isi":1,"year":"2018","date_published":"2018-12-12T00:00:00Z","doi":"10.1103/physrevb.98.224506","date_created":"2019-02-14T10:37:09Z","publisher":"American Physical Society","quality_controlled":"1","oa":1,"date_updated":"2023-09-19T14:29:03Z","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"_id":"5983","status":"public","type":"journal_article","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"publication_status":"published","issue":"22","volume":98,"ec_funded":1,"oa_version":"Preprint","abstract":[{"text":"We study a quantum impurity possessing both translational and internal rotational degrees of freedom interacting with a bosonic bath. Such a system corresponds to a “rotating polaron,” which can be used to model, e.g., a rotating molecule immersed in an ultracold Bose gas or superfluid helium. We derive the Hamiltonian of the rotating polaron and study its spectrum in the weak- and strong-coupling regimes using a combination of variational, diagrammatic, and mean-field approaches. We reveal how the coupling between linear and angular momenta affects stable quasiparticle states, and demonstrate that internal rotation leads to an enhanced self-localization in the translational degrees of freedom.","lang":"eng"}],"month":"12","intvolume":" 98","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01204"}]},{"date_updated":"2023-09-19T14:28:31Z","department":[{"_id":"MaIb"}],"_id":"5982","status":"public","article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1433-7851"]},"publication_status":"published","issue":"52","volume":57,"oa_version":"Submitted Version","abstract":[{"text":"In the present work, we detail a fast and simple solution-based method to synthesize hexagonal SnSe2 nanoplates (NPLs) and their use to produce crystallographically textured SnSe2 nanomaterials. We also demonstrate that the same strategy can be used to produce orthorhombic SnSe nanostructures and nanomaterials. NPLs are grown through a screw dislocation-driven mechanism. This mechanism typically results in pyramidal structures, but we demonstrate here that the growth from multiple dislocations results in flower-like structures. Crystallographically textured SnSe2 bulk nanomaterials obtained from the hot pressing of these SnSe2 structures display highly anisotropic charge and heat transport properties and thermoelectric (TE) figures of merit limited by relatively low electrical conductivities. To improve this parameter, SnSe2 NPLs are blended here with metal nanoparticles. The electrical conductivities of the blends are significantly improved with respect to bare SnSe2 NPLs, what translates into a three-fold increase of the TE Figure of merit, reaching unprecedented ZT values up to 0.65.","lang":"eng"}],"month":"12","intvolume":" 57","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://upcommons.upc.edu/bitstream/2117/130444/1/Zhang%20preprint.pdf"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Zhang Y, Liu Y, Lim KH, Xing C, Li M, Zhang T, Tang P, Arbiol J, Llorca J, Ng KM, Ibáñez M, Guardia P, Prato M, Cadavid D, Cabot A. 2018. Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. 57(52), 17063–17068.","chicago":"Zhang, Yu, Yu Liu, Khak Ho Lim, Congcong Xing, Mengyao Li, Ting Zhang, Pengyi Tang, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” Angewandte Chemie International Edition. Wiley, 2018. https://doi.org/10.1002/anie.201809847.","apa":"Zhang, Y., Liu, Y., Lim, K. H., Xing, C., Li, M., Zhang, T., … Cabot, A. (2018). Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201809847","ama":"Zhang Y, Liu Y, Lim KH, et al. Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. 2018;57(52):17063-17068. doi:10.1002/anie.201809847","ieee":"Y. Zhang et al., “Tin diselenide molecular precursor for solution-processable thermoelectric materials,” Angewandte Chemie International Edition, vol. 57, no. 52. Wiley, pp. 17063–17068, 2018.","short":"Y. Zhang, Y. Liu, K.H. Lim, C. Xing, M. Li, T. Zhang, P. Tang, J. Arbiol, J. Llorca, K.M. Ng, M. Ibáñez, P. Guardia, M. Prato, D. Cadavid, A. Cabot, Angewandte Chemie International Edition 57 (2018) 17063–17068.","mla":"Zhang, Yu, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” Angewandte Chemie International Edition, vol. 57, no. 52, Wiley, 2018, pp. 17063–68, doi:10.1002/anie.201809847."},"title":"Tin diselenide molecular precursor for solution-processable thermoelectric materials","author":[{"first_name":"Yu","full_name":"Zhang, Yu","last_name":"Zhang"},{"first_name":"Yu","full_name":"Liu, Yu","last_name":"Liu"},{"first_name":"Khak Ho","full_name":"Lim, Khak Ho","last_name":"Lim"},{"full_name":"Xing, Congcong","last_name":"Xing","first_name":"Congcong"},{"last_name":"Li","full_name":"Li, Mengyao","first_name":"Mengyao"},{"full_name":"Zhang, Ting","last_name":"Zhang","first_name":"Ting"},{"first_name":"Pengyi","last_name":"Tang","full_name":"Tang, Pengyi"},{"first_name":"Jordi","full_name":"Arbiol, Jordi","last_name":"Arbiol"},{"first_name":"Jordi","last_name":"Llorca","full_name":"Llorca, Jordi"},{"last_name":"Ng","full_name":"Ng, Ka Ming","first_name":"Ka Ming"},{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Pablo","full_name":"Guardia, Pablo","last_name":"Guardia"},{"last_name":"Prato","full_name":"Prato, Mirko","first_name":"Mirko"},{"full_name":"Cadavid, Doris","last_name":"Cadavid","first_name":"Doris"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"article_processing_charge":"No","external_id":{"isi":["000454575500020"]},"day":"21","publication":"Angewandte Chemie International Edition","isi":1,"year":"2018","doi":"10.1002/anie.201809847","date_published":"2018-12-21T00:00:00Z","date_created":"2019-02-14T10:23:27Z","page":"17063-17068","publisher":"Wiley","quality_controlled":"1","oa":1},{"conference":{"end_date":"2018-02-07","location":"New Orleans, LU, United States","start_date":"2018-02-02","name":"AAAI: Conference on Artificial Intelligence"},"type":"conference","status":"public","_id":"5978","article_processing_charge":"No","external_id":{"isi":["000485488906082"],"arxiv":["2004.06370"]},"author":[{"first_name":"Stefan","full_name":"Haller, Stefan","last_name":"Haller"},{"full_name":"Swoboda, Paul","last_name":"Swoboda","first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Bogdan","last_name":"Savchynskyy","full_name":"Savchynskyy, Bogdan"}],"title":"Exact MAP-inference by confining combinatorial search with LP relaxation","department":[{"_id":"VlKo"}],"date_updated":"2023-09-19T14:26:52Z","citation":{"mla":"Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–88.","ama":"Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial search with LP relaxation. In: Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI Press; 2018:6581-6588.","apa":"Haller, S., Swoboda, P., & Savchynskyy, B. (2018). Exact MAP-inference by confining combinatorial search with LP relaxation. In Proceedings of the 32st AAAI Conference on Artificial Intelligence (pp. 6581–6588). New Orleans, LU, United States: AAAI Press.","short":"S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.","ieee":"S. Haller, P. Swoboda, and B. Savchynskyy, “Exact MAP-inference by confining combinatorial search with LP relaxation,” in Proceedings of the 32st AAAI Conference on Artificial Intelligence, New Orleans, LU, United States, 2018, pp. 6581–6588.","chicago":"Haller, Stefan, Paul Swoboda, and Bogdan Savchynskyy. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” In Proceedings of the 32st AAAI Conference on Artificial Intelligence, 6581–88. AAAI Press, 2018.","ista":"Haller S, Swoboda P, Savchynskyy B. 2018. Exact MAP-inference by confining combinatorial search with LP relaxation. Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence, 6581–6588."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2004.06370","open_access":"1"}],"quality_controlled":"1","publisher":"AAAI Press","scopus_import":"1","month":"02","abstract":[{"lang":"eng","text":"We consider the MAP-inference problem for graphical models,which is a valued constraint satisfaction problem defined onreal numbers with a natural summation operation. We proposea family of relaxations (different from the famous Sherali-Adams hierarchy), which naturally define lower bounds for itsoptimum. This family always contains a tight relaxation andwe give an algorithm able to find it and therefore, solve theinitial non-relaxed NP-hard problem.The relaxations we consider decompose the original probleminto two non-overlapping parts: an easy LP-tight part and adifficult one. For the latter part a combinatorial solver must beused. As we show in our experiments, in a number of applica-tions the second, difficult part constitutes only a small fractionof the whole problem. This property allows to significantlyreduce the computational time of the combinatorial solver andtherefore solve problems which were out of reach before."}],"oa_version":"Preprint","page":"6581-6588","date_created":"2019-02-13T13:32:48Z","date_published":"2018-02-01T00:00:00Z","publication_status":"published","year":"2018","isi":1,"publication":"Proceedings of the 32st AAAI Conference on Artificial Intelligence","language":[{"iso":"eng"}],"day":"01"},{"publisher":"Wiley","quality_controlled":"1","oa":1,"doi":"10.1002/adma.201802257","date_published":"2018-11-02T00:00:00Z","date_created":"2019-02-14T12:14:26Z","isi":1,"year":"2018","day":"02","publication":"Advanced Materials","article_number":"1802257","author":[{"first_name":"Joost","full_name":"Ridderbos, Joost","last_name":"Ridderbos"},{"id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias","full_name":"Brauns, Matthias","last_name":"Brauns"},{"full_name":"Shen, Jie","last_name":"Shen","first_name":"Jie"},{"full_name":"de Vries, Folkert K.","last_name":"de Vries","first_name":"Folkert K."},{"full_name":"Li, Ang","last_name":"Li","first_name":"Ang"},{"first_name":"Erik P. A. M.","last_name":"Bakkers","full_name":"Bakkers, Erik P. A. M."},{"full_name":"Brinkman, Alexander","last_name":"Brinkman","first_name":"Alexander"},{"first_name":"Floris A.","last_name":"Zwanenburg","full_name":"Zwanenburg, Floris A."}],"external_id":{"isi":["000450232800015"],"arxiv":["1809.08487"]},"article_processing_charge":"No","title":"Josephson effect in a few-hole quantum dot","citation":{"mla":"Ridderbos, Joost, et al. “Josephson Effect in a Few-Hole Quantum Dot.” Advanced Materials, vol. 30, no. 44, 1802257, Wiley, 2018, doi:10.1002/adma.201802257.","ieee":"J. Ridderbos et al., “Josephson effect in a few-hole quantum dot,” Advanced Materials, vol. 30, no. 44. Wiley, 2018.","short":"J. Ridderbos, M. Brauns, J. Shen, F.K. de Vries, A. Li, E.P.A.M. Bakkers, A. Brinkman, F.A. Zwanenburg, Advanced Materials 30 (2018).","apa":"Ridderbos, J., Brauns, M., Shen, J., de Vries, F. K., Li, A., Bakkers, E. P. A. M., … Zwanenburg, F. A. (2018). Josephson effect in a few-hole quantum dot. Advanced Materials. Wiley. https://doi.org/10.1002/adma.201802257","ama":"Ridderbos J, Brauns M, Shen J, et al. Josephson effect in a few-hole quantum dot. Advanced Materials. 2018;30(44). doi:10.1002/adma.201802257","chicago":"Ridderbos, Joost, Matthias Brauns, Jie Shen, Folkert K. de Vries, Ang Li, Erik P. A. M. Bakkers, Alexander Brinkman, and Floris A. Zwanenburg. “Josephson Effect in a Few-Hole Quantum Dot.” Advanced Materials. Wiley, 2018. https://doi.org/10.1002/adma.201802257.","ista":"Ridderbos J, Brauns M, Shen J, de Vries FK, Li A, Bakkers EPAM, Brinkman A, Zwanenburg FA. 2018. Josephson effect in a few-hole quantum dot. Advanced Materials. 30(44), 1802257."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.08487"}],"month":"11","intvolume":" 30","abstract":[{"text":"A Ge–Si core–shell nanowire is used to realize a Josephson field‐effect transistor with highly transparent contacts to superconducting leads. By changing the electric field, access to two distinct regimes, not combined before in a single device, is gained: in the accumulation mode the device is highly transparent and the supercurrent is carried by multiple subbands, while near depletion, the supercurrent is carried by single‐particle levels of a strongly coupled quantum dot operating in the few‐hole regime. These results establish Ge–Si nanowires as an important platform for hybrid superconductor–semiconductor physics and Majorana fermions.","lang":"eng"}],"oa_version":"Preprint","issue":"44","volume":30,"publication_identifier":{"issn":["0935-9648"]},"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"5990","department":[{"_id":"GeKa"}],"date_updated":"2023-09-19T14:29:58Z"},{"author":[{"first_name":"Sanjit","full_name":"Chatterjee, Sanjit","last_name":"Chatterjee"},{"last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kumar","full_name":"Kumar, Vikas","first_name":"Vikas"}],"article_processing_charge":"No","external_id":{"isi":["000430950400002"]},"department":[{"_id":"KrPi"}],"title":"Private set-intersection with common set-up","date_updated":"2023-09-19T14:27:59Z","citation":{"mla":"Chatterjee, Sanjit, et al. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences, vol. 12, no. 1, AIMS, 2018, pp. 17–47, doi:10.3934/amc.2018002.","ieee":"S. Chatterjee, C. Kamath Hosdurg, and V. Kumar, “Private set-intersection with common set-up,” American Institute of Mathematical Sciences, vol. 12, no. 1. AIMS, pp. 17–47, 2018.","short":"S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical Sciences 12 (2018) 17–47.","ama":"Chatterjee S, Kamath Hosdurg C, Kumar V. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 2018;12(1):17-47. doi:10.3934/amc.2018002","apa":"Chatterjee, S., Kamath Hosdurg, C., & Kumar, V. (2018). Private set-intersection with common set-up. American Institute of Mathematical Sciences. AIMS. https://doi.org/10.3934/amc.2018002","chicago":"Chatterjee, Sanjit, Chethan Kamath Hosdurg, and Vikas Kumar. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences. AIMS, 2018. https://doi.org/10.3934/amc.2018002.","ista":"Chatterjee S, Kamath Hosdurg C, Kumar V. 2018. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 12(1), 17–47."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"journal_article","status":"public","_id":"5980","page":"17-47","doi":"10.3934/amc.2018002","issue":"1","volume":12,"date_published":"2018-02-01T00:00:00Z","date_created":"2019-02-13T13:49:41Z","isi":1,"publication_status":"published","year":"2018","day":"01","language":[{"iso":"eng"}],"publication":"American Institute of Mathematical Sciences","publisher":"AIMS","scopus_import":"1","quality_controlled":"1","month":"02","intvolume":" 12","abstract":[{"lang":"eng","text":"The problem of private set-intersection (PSI) has been traditionally treated as an instance of the more general problem of multi-party computation (MPC). Consequently, in order to argue security, or compose these protocols one has to rely on the general theory that was developed for the purpose of MPC. The pursuit of efficient protocols, however, has resulted in designs that exploit properties pertaining to PSI. In almost all practical applications where a PSI protocol is deployed, it is expected to be executed multiple times, possibly on related inputs. In this work we initiate a dedicated study of PSI in the multi-interaction (MI) setting. In this model a server sets up the common system parameters and executes set-intersection multiple times with potentially different clients. We discuss a few attacks that arise when protocols are naïvely composed in this manner and, accordingly, craft security definitions for the MI setting and study their inter-relation. Finally, we suggest a set of protocols that are MI-secure, at the same time almost as efficient as their parent, stand-alone, protocols."}],"oa_version":"None"},{"file":[{"creator":"kschuh","date_updated":"2020-07-14T12:47:15Z","file_size":4592947,"date_created":"2019-02-14T13:14:35Z","file_name":"2018_PLOS_Velicky.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"34aa9a5972f61889c19f18be8ee787a0","file_id":"6000"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1553-7404"]},"publication_status":"published","issue":"10","volume":14,"oa_version":"Published Version","abstract":[{"text":"Genome amplification and cellular senescence are commonly associated with pathological processes. While physiological roles for polyploidization and senescence have been described in mouse development, controversy exists over their significance in humans. Here, we describe tetraploidization and senescence as phenomena of normal human placenta development. During pregnancy, placental extravillous trophoblasts (EVTs) invade the pregnant endometrium, termed decidua, to establish an adapted microenvironment required for the developing embryo. This process is critically dependent on continuous cell proliferation and differentiation, which is thought to follow the classical model of cell cycle arrest prior to terminal differentiation. Strikingly, flow cytometry and DNAseq revealed that EVT formation is accompanied with a genome-wide polyploidization, independent of mitotic cycles. DNA replication in these cells was analysed by a fluorescent cell-cycle indicator reporter system, cell cycle marker expression and EdU incorporation. Upon invasion into the decidua, EVTs widely lose their replicative potential and enter a senescent state characterized by high senescence-associated (SA) β-galactosidase activity, induction of a SA secretory phenotype as well as typical metabolic alterations. Furthermore, we show that the shift from endocycle-dependent genome amplification to growth arrest is disturbed in androgenic complete hydatidiform moles (CHM), a hyperplastic pregnancy disorder associated with increased risk of developing choriocarinoma. Senescence is decreased in CHM-EVTs, accompanied by exacerbated endoreduplication and hyperploidy. We propose induction of cellular senescence as a ploidy-limiting mechanism during normal human placentation and unravel a link between excessive polyploidization and reduced senescence in CHM.","lang":"eng"}],"month":"10","intvolume":" 14","scopus_import":"1","ddc":["570"],"date_updated":"2023-09-19T14:31:43Z","department":[{"_id":"JoDa"}],"file_date_updated":"2020-07-14T12:47:15Z","_id":"5998","status":"public","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"12","publication":"PLOS Genetics","has_accepted_license":"1","isi":1,"year":"2018","doi":"10.1371/journal.pgen.1007698","date_published":"2018-10-12T00:00:00Z","date_created":"2019-02-14T13:07:45Z","quality_controlled":"1","publisher":"Public Library of Science","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Velicky P, Meinhardt G, Plessl K, Vondra S, Weiss T, Haslinger P, Lendl T, Aumayr K, Mairhofer M, Zhu X, Schütz B, Hannibal RL, Lindau R, Weil B, Ernerudh J, Neesen J, Egger G, Mikula M, Röhrl C, Urban AE, Baker J, Knöfler M, Pollheimer J. 2018. Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. 14(10), e1007698.","chicago":"Velicky, Philipp, Gudrun Meinhardt, Kerstin Plessl, Sigrid Vondra, Tamara Weiss, Peter Haslinger, Thomas Lendl, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” PLOS Genetics. Public Library of Science, 2018. https://doi.org/10.1371/journal.pgen.1007698.","apa":"Velicky, P., Meinhardt, G., Plessl, K., Vondra, S., Weiss, T., Haslinger, P., … Pollheimer, J. (2018). Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007698","ama":"Velicky P, Meinhardt G, Plessl K, et al. Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. 2018;14(10). doi:10.1371/journal.pgen.1007698","ieee":"P. Velicky et al., “Genome amplification and cellular senescence are hallmarks of human placenta development,” PLOS Genetics, vol. 14, no. 10. Public Library of Science, 2018.","short":"P. Velicky, G. Meinhardt, K. Plessl, S. Vondra, T. Weiss, P. Haslinger, T. Lendl, K. Aumayr, M. Mairhofer, X. Zhu, B. Schütz, R.L. Hannibal, R. Lindau, B. Weil, J. Ernerudh, J. Neesen, G. Egger, M. Mikula, C. Röhrl, A.E. Urban, J. Baker, M. Knöfler, J. Pollheimer, PLOS Genetics 14 (2018).","mla":"Velicky, Philipp, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” PLOS Genetics, vol. 14, no. 10, e1007698, Public Library of Science, 2018, doi:10.1371/journal.pgen.1007698."},"title":"Genome amplification and cellular senescence are hallmarks of human placenta development","author":[{"id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp","last_name":"Velicky","full_name":"Velicky, Philipp","orcid":"0000-0002-2340-7431"},{"first_name":"Gudrun","full_name":"Meinhardt, Gudrun","last_name":"Meinhardt"},{"full_name":"Plessl, Kerstin","last_name":"Plessl","first_name":"Kerstin"},{"first_name":"Sigrid","full_name":"Vondra, Sigrid","last_name":"Vondra"},{"first_name":"Tamara","full_name":"Weiss, Tamara","last_name":"Weiss"},{"last_name":"Haslinger","full_name":"Haslinger, Peter","first_name":"Peter"},{"full_name":"Lendl, Thomas","last_name":"Lendl","first_name":"Thomas"},{"last_name":"Aumayr","full_name":"Aumayr, Karin","first_name":"Karin"},{"first_name":"Mario","last_name":"Mairhofer","full_name":"Mairhofer, Mario"},{"first_name":"Xiaowei","last_name":"Zhu","full_name":"Zhu, Xiaowei"},{"full_name":"Schütz, Birgit","last_name":"Schütz","first_name":"Birgit"},{"first_name":"Roberta L.","last_name":"Hannibal","full_name":"Hannibal, Roberta L."},{"first_name":"Robert","last_name":"Lindau","full_name":"Lindau, Robert"},{"last_name":"Weil","full_name":"Weil, Beatrix","first_name":"Beatrix"},{"last_name":"Ernerudh","full_name":"Ernerudh, Jan","first_name":"Jan"},{"first_name":"Jürgen","full_name":"Neesen, Jürgen","last_name":"Neesen"},{"first_name":"Gerda","last_name":"Egger","full_name":"Egger, Gerda"},{"first_name":"Mario","full_name":"Mikula, Mario","last_name":"Mikula"},{"first_name":"Clemens","full_name":"Röhrl, Clemens","last_name":"Röhrl"},{"last_name":"Urban","full_name":"Urban, Alexander E.","first_name":"Alexander E."},{"first_name":"Julie","full_name":"Baker, Julie","last_name":"Baker"},{"last_name":"Knöfler","full_name":"Knöfler, Martin","first_name":"Martin"},{"full_name":"Pollheimer, Jürgen","last_name":"Pollheimer","first_name":"Jürgen"}],"article_processing_charge":"No","external_id":{"isi":["000449328500025"]},"article_number":"e1007698"}]