[{"has_accepted_license":"1","conference":{"start_date":"2018-09-30","end_date":"2018-10-05","name":"EMSOFT: Embedded Software","location":"Turin, Italy"},"citation":{"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","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.","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.","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.","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","ista":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. 2018. Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. EMSOFT: Embedded Software, 1–10."},"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."}],"date_published":"2018-09-30T00:00:00Z","date_updated":"2025-07-10T11:53:06Z","publication":"2018 International Conference on Embedded Software","author":[{"full_name":"Bakhirkin, Alexey","last_name":"Bakhirkin","first_name":"Alexey"},{"last_name":"Ferrere","orcid":"0000-0001-5199-3143","first_name":"Thomas","full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Nickovicl, Deian","first_name":"Deian","last_name":"Nickovicl"}],"status":"public","page":"1-10","file":[{"file_id":"7839","file_name":"2018_EMSOFT_Bakhirkin.pdf","content_type":"application/pdf","file_size":338006,"access_level":"open_access","date_created":"2020-05-14T16:01:29Z","creator":"dernst","date_updated":"2020-07-14T12:47:13Z","checksum":"234a33ad9055b3458fcdda6af251b33a","relation":"main_file"}],"ddc":["000"],"month":"09","doi":"10.1109/emsoft.2018.8537203","oa_version":"Published Version","scopus_import":"1","_id":"5959","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:13Z","date_created":"2019-02-13T09:19:28Z","isi":1,"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"quality_controlled":"1","type":"conference","oa":1,"day":"30","external_id":{"isi":["000492828500005"]},"publisher":"IEEE","year":"2018","publication_status":"published","department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["9781538655603"]},"title":"Keynote: The first-order logic of signals","article_processing_charge":"No"},{"date_updated":"2023-09-19T10:41:59Z","intvolume":" 37","citation":{"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","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.","short":"S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516.","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.","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.","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","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."},"abstract":[{"lang":"eng","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."}],"date_published":"2018-10-24T00:00:00Z","page":"1500-1516","month":"10","volume":37,"issue":"12","publication":"The International Journal of Robotics Research","status":"public","author":[{"last_name":"Rohou","first_name":"Simon","full_name":"Rohou, Simon"},{"first_name":"Peter","orcid":"0000-0001-8878-8397","last_name":"Franek","id":"473294AE-F248-11E8-B48F-1D18A9856A87","full_name":"Franek, Peter"},{"last_name":"Aubry","first_name":"Clément","full_name":"Aubry, Clément"},{"first_name":"Luc","last_name":"Jaulin","full_name":"Jaulin, Luc"}],"isi":1,"date_created":"2019-02-13T09:36:20Z","quality_controlled":"1","_id":"5960","oa_version":"Preprint","scopus_import":"1","doi":"10.1177/0278364918808367","language":[{"iso":"eng"}],"arxiv":1,"publication_identifier":{"eissn":["1741-3176"],"issn":["0278-3649"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","title":"Proving the existence of loops in robot trajectories","day":"24","external_id":{"isi":["000456881100004"],"arxiv":["1712.01341"]},"oa":1,"type":"journal_article","department":[{"_id":"UlWa"}],"main_file_link":[{"url":"https://arxiv.org/abs/1712.01341","open_access":"1"}],"publication_status":"published","year":"2018","publisher":"SAGE Publications"},{"page":"487-488","publication_identifier":{"isbn":["9781450357951"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","title":"A brief tutorial on distributed and concurrent machine learning","month":"07","type":"conference","external_id":{"isi":["000458186900063"]},"day":"27","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","year":"2018","publication_status":"published","publisher":"ACM","department":[{"_id":"DaAl"}],"status":"public","author":[{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"date_created":"2019-02-13T09:48:55Z","isi":1,"date_updated":"2025-06-03T11:56:33Z","quality_controlled":"1","doi":"10.1145/3212734.3212798","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, 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; 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. 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, 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, 2018, pp. 487–88, doi:10.1145/3212734.3212798.","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."},"_id":"5961","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"}],"conference":{"location":"Egham, United Kingdom","name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23","end_date":"2018-07-27"},"oa_version":"None","scopus_import":"1","date_published":"2018-07-27T00:00:00Z","language":[{"iso":"eng"}]},{"quality_controlled":"1","isi":1,"date_created":"2019-02-13T09:58:58Z","language":[{"iso":"eng"}],"_id":"5962","scopus_import":"1","oa_version":"Preprint","doi":"10.1145/3212734.3212763","article_processing_charge":"No","title":"The convergence of stochastic gradient descent in asynchronous shared memory","arxiv":1,"publication_identifier":{"isbn":["9781450357951"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.08841"}],"year":"2018","publication_status":"published","publisher":"ACM","day":"23","external_id":{"arxiv":["1803.08841"],"isi":["000458186900022"]},"oa":1,"type":"conference","date_updated":"2025-06-03T11:56:41Z","date_published":"2018-07-23T00:00:00Z","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.","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. https://doi.org/10.1145/3212734.3212763","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, 2018, pp. 169–178.","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.","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, 2018, pp. 169–78, doi:10.1145/3212734.3212763.","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, 2018. https://doi.org/10.1145/3212734.3212763.","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; 2018:169-178. doi:10.1145/3212734.3212763"},"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."}],"conference":{"start_date":"2018-07-23","end_date":"2018-07-27","name":"PODC: Principles of Distributed Computing","location":"Egham, United Kingdom"},"month":"07","page":"169-178","status":"public","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"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","last_name":"Konstantinov","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","full_name":"Konstantinov, Nikola H"}],"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18"},{"citation":{"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; 2018:377-386. doi:10.1145/3212734.3212756","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, 2018. https://doi.org/10.1145/3212734.3212756.","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, 2018, pp. 377–386.","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.","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, 2018, pp. 377–86, doi:10.1145/3212734.3212756.","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. 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."},"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"}],"conference":{"name":"PODC: Principles of Distributed Computing","location":"Egham, United Kingdom","end_date":"2018-07-27","start_date":"2018-07-23"},"date_published":"2018-07-23T00:00:00Z","date_updated":"2025-06-03T11:56:49Z","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","status":"public","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A","last_name":"Brown","first_name":"Trevor A"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"last_name":"Nadiradze","first_name":"Giorgi","full_name":"Nadiradze, Giorgi"}],"page":"377-386","month":"07","doi":"10.1145/3212734.3212756","_id":"5963","scopus_import":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"date_created":"2019-02-13T10:03:25Z","isi":1,"quality_controlled":"1","type":"conference","external_id":{"arxiv":["1808.04155"],"isi":["000458186900048"]},"day":"23","oa":1,"year":"2018","publication_status":"published","publisher":"ACM","department":[{"_id":"DaAl"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.04155"}],"publication_identifier":{"isbn":["9781450357951"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"article_processing_charge":"No","title":"Relaxed schedulers can efficiently parallelize iterative algorithms"},{"date_published":"2018-07-23T00:00:00Z","abstract":[{"lang":"eng","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."}],"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.","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. https://doi.org/10.1145/3212734.3212785","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.","short":"V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 411–413.","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, 2018, pp. 411–13, doi:10.1145/3212734.3212785.","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, 2018. 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; 2018:411-413. doi:10.1145/3212734.3212785"},"conference":{"end_date":"2018-07-27","start_date":"2018-07-23","name":"PODC: Principles of Distributed Computing","location":"Egham, United Kingdom"},"date_updated":"2025-06-03T11:58:00Z","status":"public","author":[{"last_name":"Aksenov","first_name":"Vitaly","full_name":"Aksenov, Vitaly"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"full_name":"Kuznetsov, Petr","first_name":"Petr","last_name":"Kuznetsov"}],"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","month":"07","page":"411-413","language":[{"iso":"eng"}],"doi":"10.1145/3212734.3212785","_id":"5964","oa_version":"Submitted Version","scopus_import":"1","quality_controlled":"1","date_created":"2019-02-13T10:08:19Z","isi":1,"year":"2018","publication_status":"published","publisher":"ACM","department":[{"_id":"DaAl"}],"main_file_link":[{"url":"https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1","open_access":"1"}],"type":"conference","external_id":{"isi":["000458186900052"]},"day":"23","oa":1,"article_processing_charge":"No","title":"Brief Announcement: Performance prediction for coarse-grained locking","publication_identifier":{"isbn":["9781450357951"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"doi":"10.1145/3210377.3210406","oa_version":"Preprint","scopus_import":"1","_id":"5966","quality_controlled":"1","date_created":"2019-02-13T10:26:07Z","isi":1,"publisher":"ACM","year":"2018","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.00947"}],"department":[{"_id":"DaAl"}],"type":"conference","oa":1,"external_id":{"isi":["000545269600046"],"arxiv":["1804.00947"]},"day":"16","title":"The transactional conflict problem","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["9781450357999"]},"arxiv":1,"date_published":"2018-07-16T00:00:00Z","conference":{"location":"Vienna, Austria","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","start_date":"2018-07-16","end_date":"2018-07-18"},"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.","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. https://doi.org/10.1145/3210377.3210406","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, 2018, pp. 383–92, 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, 2018, pp. 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, 2018. 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; 2018:383-392. doi:10.1145/3210377.3210406"},"abstract":[{"lang":"eng","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."}],"date_updated":"2025-06-03T11:58:22Z","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Haider, Syed Kamran","first_name":"Syed Kamran","last_name":"Haider"},{"full_name":"Kübler, Raphael","first_name":"Raphael","last_name":"Kübler"},{"last_name":"Nadiradze","first_name":"Giorgi","full_name":"Nadiradze, Giorgi"}],"status":"public","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","month":"07","page":"383-392"},{"article_processing_charge":"No","title":"The Big Match with a clock and a bit of memory","publication_identifier":{"isbn":["9781450358293"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","year":"2018","publisher":"ACM","department":[{"_id":"KrCh"}],"type":"conference","day":"18","external_id":{"isi":["000492755100020"]},"oa":1,"quality_controlled":"1","date_created":"2019-02-13T10:31:41Z","isi":1,"file_date_updated":"2020-07-14T12:47:14Z","language":[{"iso":"eng"}],"doi":"10.1145/3219166.3219198","_id":"5967","scopus_import":"1","oa_version":"Submitted Version","ddc":["000"],"month":"06","page":"149-150","file":[{"content_type":"application/pdf","file_size":302539,"file_id":"7054","file_name":"2018_EC18_Hansen.pdf","checksum":"bb52683e349cfd864f4769a8f38f2798","relation":"main_file","date_created":"2019-11-19T08:24:24Z","access_level":"open_access","date_updated":"2020-07-14T12:47:14Z","creator":"dernst"}],"status":"public","author":[{"full_name":"Hansen, Kristoffer Arnsfelt","last_name":"Hansen","first_name":"Kristoffer Arnsfelt"},{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Neyman, Abraham","first_name":"Abraham","last_name":"Neyman"}],"publication":"Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18","date_updated":"2025-05-14T11:24:35Z","date_published":"2018-06-18T00:00:00Z","has_accepted_license":"1","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"}],"citation":{"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, 2018, pp. 149–50, doi:10.1145/3219166.3219198.","short":"K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM, 2018, pp. 149–150.","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.","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. https://doi.org/10.1145/3219166.3219198","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; 2018:149-150. doi:10.1145/3219166.3219198","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, 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."},"conference":{"location":"Ithaca, NY, United States","name":"EC: Conference on Economics and Computation","start_date":"2018-06-18","end_date":"2018-06-22"}},{"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804"}],"quality_controlled":"1","date_created":"2019-02-13T10:40:54Z","isi":1,"language":[{"iso":"eng"}],"doi":"10.1142/s2010326319500096","oa_version":"Preprint","scopus_import":"1","_id":"5971","title":"Bounds on the norm of Wigner-type random matrices","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"eissn":["2010-3271"],"issn":["2010-3263"]},"arxiv":1,"publisher":"World Scientific Publishing","publication_status":"published","year":"2018","department":[{"_id":"LaEr"}],"main_file_link":[{"url":"https://arxiv.org/abs/1802.05175","open_access":"1"}],"type":"journal_article","oa":1,"day":"26","external_id":{"isi":["000477677200002"],"arxiv":["1802.05175"]},"date_updated":"2025-04-15T08:05:02Z","date_published":"2018-09-26T00:00:00Z","abstract":[{"lang":"eng","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."}],"citation":{"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","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.","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.","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.","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","ista":"Erdös L, Mühlbacher P. 2018. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications., 1950009."},"article_number":"1950009","ec_funded":1,"month":"09","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","first_name":"László","orcid":"0000-0001-5366-9603","last_name":"Erdös"},{"last_name":"Mühlbacher","first_name":"Peter","full_name":"Mühlbacher, Peter"}],"status":"public","publication":"Random matrices: Theory and applications"},{"intvolume":" 47","date_updated":"2025-09-22T09:44:20Z","date_published":"2018-11-08T00:00:00Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1193"}]},"citation":{"apa":"Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. Society for Industrial and Applied Mathematics. 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 and Applied Mathematics, 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 and Applied Mathematics, 2018, pp. 2029–56, doi:10.1137/16m1093306.","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2018. https://doi.org/10.1137/16m1093306.","ama":"Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 2018;47(6):2029-2056. doi:10.1137/16m1093306","ista":"Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056."},"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."}],"month":"11","volume":47,"ec_funded":1,"page":"2029-2056","status":"public","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"publication":"SIAM Journal on Computing","issue":"6","quality_controlled":"1","project":[{"grant_number":"616160","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"isi":1,"date_created":"2019-02-13T12:59:33Z","language":[{"iso":"eng"}],"_id":"5975","scopus_import":"1","oa_version":"Preprint","doi":"10.1137/16m1093306","article_processing_charge":"No","title":"Commutativity in the algorithmic Lovász local lemma","arxiv":1,"publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"VlKo"}],"main_file_link":[{"url":"https://arxiv.org/abs/1506.08547","open_access":"1"}],"publication_status":"published","year":"2018","publisher":"Society for Industrial and Applied Mathematics","external_id":{"arxiv":["1506.08547"],"isi":["000453785100001"]},"day":"08","oa":1,"type":"journal_article"},{"doi":"10.1145/3272127.3275076","_id":"5976","oa_version":"Published Version","scopus_import":"1","article_type":"original","file_date_updated":"2020-07-14T12:47:14Z","language":[{"iso":"eng"}],"date_created":"2019-02-13T13:12:53Z","isi":1,"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767"},{"grant_number":"645599","call_identifier":"H2020","name":"Soft-bodied intelligence for Manipulation","_id":"25082902-B435-11E9-9278-68D0E5697425"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"}],"quality_controlled":"1","type":"journal_article","external_id":{"isi":["000455953100064"]},"day":"01","oa":1,"year":"2018","publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"BeBi"}],"publication_identifier":{"issn":["0730-0301"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","title":"FlexMaps: Computational design of flat flexible shells for shaping 3D objects","has_accepted_license":"1","abstract":[{"lang":"eng","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."}],"citation":{"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","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, 2018. https://doi.org/10.1145/3272127.3275076.","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, 2018, doi: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, 2018.","short":"L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018).","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. 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."},"date_published":"2018-11-01T00:00:00Z","date_updated":"2025-03-31T15:59:13Z","intvolume":" 37","pubrep_id":"1068","issue":"6","publication":"ACM Transactions on Graphics","status":"public","author":[{"first_name":"Luigi","last_name":"Malomo","full_name":"Malomo, Luigi"},{"first_name":"Jesus","last_name":"Perez Rodriguez","full_name":"Perez Rodriguez, Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Emmanuel","last_name":"Iarussi","full_name":"Iarussi, Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"},{"full_name":"Miguel, Eder","last_name":"Miguel","first_name":"Eder"},{"first_name":"Paolo","last_name":"Cignoni","full_name":"Cignoni, Paolo"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel"}],"file":[{"relation":"main_file","checksum":"d0529a41c78b37ab8840685579fb33b4","date_updated":"2020-07-14T12:47:14Z","creator":"bbickel","date_created":"2019-09-23T12:48:52Z","access_level":"open_access","file_size":100109811,"content_type":"application/pdf","file_name":"flexmaps_author_version.pdf","file_id":"6901"}],"ec_funded":1,"volume":37,"article_number":"241","ddc":["000"],"month":"11"},{"date_updated":"2023-09-19T14:26:52Z","isi":1,"date_created":"2019-02-13T13:32:48Z","quality_controlled":"1","citation":{"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.","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.","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.","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.","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.","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."},"_id":"5978","abstract":[{"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.","lang":"eng"}],"scopus_import":"1","oa_version":"Preprint","conference":{"start_date":"2018-02-02","end_date":"2018-02-07","location":"New Orleans, LU, United States","name":"AAAI: Conference on Artificial Intelligence"},"date_published":"2018-02-01T00:00:00Z","language":[{"iso":"eng"}],"arxiv":1,"page":"6581-6588","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"02","article_processing_charge":"No","title":"Exact MAP-inference by confining combinatorial search with LP relaxation","day":"01","external_id":{"isi":["000485488906082"],"arxiv":["2004.06370"]},"oa":1,"publication":"Proceedings of the 32st AAAI Conference on Artificial Intelligence","type":"conference","status":"public","department":[{"_id":"VlKo"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2004.06370"}],"author":[{"last_name":"Haller","first_name":"Stefan","full_name":"Haller, Stefan"},{"first_name":"Paul","last_name":"Swoboda","full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Bogdan","last_name":"Savchynskyy","full_name":"Savchynskyy, Bogdan"}],"publication_status":"published","year":"2018","publisher":"AAAI Press"},{"type":"journal_article","issue":"1","publication":"American Institute of Mathematical Sciences","day":"01","external_id":{"isi":["000430950400002"]},"publisher":"AIMS","year":"2018","publication_status":"published","author":[{"last_name":"Chatterjee","first_name":"Sanjit","full_name":"Chatterjee, Sanjit"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","last_name":"Kamath Hosdurg"},{"last_name":"Kumar","first_name":"Vikas","full_name":"Kumar, Vikas"}],"department":[{"_id":"KrPi"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"17-47","title":"Private set-intersection with common set-up","article_processing_charge":"No","volume":12,"month":"02","doi":"10.3934/amc.2018002","oa_version":"None","scopus_import":"1","citation":{"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.","short":"S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical Sciences 12 (2018) 17–47.","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.","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","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","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."},"_id":"5980","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"date_published":"2018-02-01T00:00:00Z","date_created":"2019-02-13T13:49:41Z","date_updated":"2023-09-19T14:27:59Z","isi":1,"quality_controlled":"1","intvolume":" 12"},{"date_published":"2018-12-21T00:00:00Z","citation":{"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.","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.","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.","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","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.","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."},"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"}],"intvolume":" 57","date_updated":"2023-09-19T14:28:31Z","author":[{"full_name":"Zhang, Yu","last_name":"Zhang","first_name":"Yu"},{"full_name":"Liu, Yu","first_name":"Yu","last_name":"Liu"},{"last_name":"Lim","first_name":"Khak Ho","full_name":"Lim, Khak Ho"},{"first_name":"Congcong","last_name":"Xing","full_name":"Xing, Congcong"},{"first_name":"Mengyao","last_name":"Li","full_name":"Li, Mengyao"},{"full_name":"Zhang, Ting","last_name":"Zhang","first_name":"Ting"},{"last_name":"Tang","first_name":"Pengyi","full_name":"Tang, Pengyi"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"last_name":"Llorca","first_name":"Jordi","full_name":"Llorca, Jordi"},{"first_name":"Ka Ming","last_name":"Ng","full_name":"Ng, Ka Ming"},{"orcid":"0000-0001-5013-2843","last_name":"Ibáñez","first_name":"Maria","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Guardia","first_name":"Pablo","full_name":"Guardia, Pablo"},{"last_name":"Prato","first_name":"Mirko","full_name":"Prato, Mirko"},{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"status":"public","publication":"Angewandte Chemie International Edition","issue":"52","month":"12","volume":57,"page":"17063-17068","language":[{"iso":"eng"}],"article_type":"original","scopus_import":"1","oa_version":"Submitted Version","_id":"5982","doi":"10.1002/anie.201809847","quality_controlled":"1","isi":1,"date_created":"2019-02-14T10:23:27Z","department":[{"_id":"MaIb"}],"main_file_link":[{"open_access":"1","url":"https://upcommons.upc.edu/bitstream/2117/130444/1/Zhang%20preprint.pdf"}],"publisher":"Wiley","publication_status":"published","year":"2018","oa":1,"day":"21","external_id":{"isi":["000454575500020"]},"type":"journal_article","title":"Tin diselenide molecular precursor for solution-processable thermoelectric materials","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["1433-7851"]}},{"oa":1,"day":"12","external_id":{"isi":["000452992700008"],"arxiv":["1809.01204"]},"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01204"}],"department":[{"_id":"MiLe"},{"_id":"RoSe"}],"publisher":"American Physical Society","year":"2018","publication_status":"published","arxiv":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"title":"Theory of the rotating polaron: Spectrum and self-localization","article_processing_charge":"No","oa_version":"Preprint","scopus_import":"1","_id":"5983","doi":"10.1103/physrevb.98.224506","language":[{"iso":"eng"}],"isi":1,"date_created":"2019-02-14T10:37:09Z","quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"694227"}],"publication":"Physical Review B","issue":"22","author":[{"last_name":"Yakaboylu","orcid":"0000-0001-5973-0874","first_name":"Enderalp","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp"},{"id":"456187FC-F248-11E8-B48F-1D18A9856A87","full_name":"Midya, Bikashkali","first_name":"Bikashkali","last_name":"Midya"},{"id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","full_name":"Deuchert, Andreas","first_name":"Andreas","last_name":"Deuchert","orcid":"0000-0003-3146-6746"},{"full_name":"Leopold, Nikolai K","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","first_name":"Nikolai K","last_name":"Leopold","orcid":"0000-0002-0495-6822"},{"full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","first_name":"Mikhail"}],"status":"public","month":"12","article_number":"224506","ec_funded":1,"volume":98,"abstract":[{"lang":"eng","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."}],"citation":{"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","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.","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.","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","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."},"date_published":"2018-12-12T00:00:00Z","date_updated":"2025-04-14T07:26:59Z","intvolume":" 98"},{"has_accepted_license":"1","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"}],"citation":{"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.","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","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","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.","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.","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).","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."},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2018-12-01T00:00:00Z","date_updated":"2025-04-15T07:22:42Z","intvolume":" 9","issue":"1","publication":"Nature Communications","status":"public","author":[{"full_name":"Morri, Maurizio","id":"4863116E-F248-11E8-B48F-1D18A9856A87","first_name":"Maurizio","last_name":"Morri"},{"full_name":"Sanchez-Romero, Inmaculada","id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","first_name":"Inmaculada","last_name":"Sanchez-Romero"},{"first_name":"Alexandra-Madelaine","last_name":"Tichy","full_name":"Tichy, Alexandra-Madelaine","id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stephanie","last_name":"Kainrath","full_name":"Kainrath, Stephanie","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Elliot J.","last_name":"Gerrard","full_name":"Gerrard, Elliot J."},{"last_name":"Hirschfeld","first_name":"Priscila","id":"435ACB3A-F248-11E8-B48F-1D18A9856A87","full_name":"Hirschfeld, Priscila"},{"full_name":"Schwarz, Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","last_name":"Schwarz","first_name":"Jan"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315","first_name":"Harald L"}],"file":[{"checksum":"8325fcc194264af4749e662a73bf66b5","relation":"main_file","date_created":"2019-02-14T10:58:29Z","access_level":"open_access","creator":"kschuh","date_updated":"2020-07-14T12:47:14Z","content_type":"application/pdf","file_size":1349914,"file_id":"5985","file_name":"2018_Springer_Morri.pdf"}],"volume":9,"ec_funded":1,"ddc":["570"],"article_number":"1950","month":"12","doi":"10.1038/s41467-018-04342-1","_id":"5984","oa_version":"Published Version","scopus_import":"1","file_date_updated":"2020-07-14T12:47:14Z","language":[{"iso":"eng"}],"date_created":"2019-02-14T10:50:24Z","isi":1,"project":[{"_id":"25548C20-B435-11E9-9278-68D0E5697425","name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7","grant_number":"303564"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","name":"Molecular Drug Targets","call_identifier":"FWF","grant_number":"W1232-B24"}],"quality_controlled":"1","type":"journal_article","external_id":{"isi":["000432280000006"]},"day":"01","oa":1,"publication_status":"published","year":"2018","publisher":"Springer Nature","department":[{"_id":"HaJa"},{"_id":"CaGu"},{"_id":"MiSi"}],"publication_identifier":{"issn":["2041-1723"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","license":"https://creativecommons.org/licenses/by/4.0/","article_processing_charge":"No","title":"Optical functionalization of human class A orphan G-protein-coupled receptors"},{"month":"03","volume":10,"ddc":["570"],"file":[{"file_size":529755,"content_type":"application/pdf","file_name":"2018_GBE_Kincaid_Smith.pdf","file_id":"5991","relation":"main_file","checksum":"736a459cb77de5824354466bb0331caf","creator":"dernst","date_updated":"2020-07-14T12:47:15Z","access_level":"open_access","date_created":"2019-02-14T12:20:01Z"}],"page":"840-856","status":"public","author":[{"full_name":"Kincaid-Smith, Julien","last_name":"Kincaid-Smith","first_name":"Julien"},{"orcid":"0000-0002-8101-2518","last_name":"Picard","first_name":"Marion A L","full_name":"Picard, Marion A L","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Céline","last_name":"Cosseau","full_name":"Cosseau, Céline"},{"full_name":"Boissier, Jérôme","first_name":"Jérôme","last_name":"Boissier"},{"full_name":"Severac, Dany","first_name":"Dany","last_name":"Severac"},{"last_name":"Grunau","first_name":"Christoph","full_name":"Grunau, Christoph"},{"full_name":"Toulza, Eve","first_name":"Eve","last_name":"Toulza"}],"publication":"Genome Biology and Evolution","issue":"3","intvolume":" 10","date_updated":"2023-09-19T14:39:08Z","date_published":"2018-03-01T00:00:00Z","tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"citation":{"apa":"Kincaid-Smith, J., Picard, M. A. L., Cosseau, C., Boissier, J., Severac, D., Grunau, C., & Toulza, E. (2018). Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. Oxford University Press. https://doi.org/10.1093/gbe/evy037","mla":"Kincaid-Smith, Julien, et al. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution, vol. 10, no. 3, Oxford University Press, 2018, pp. 840–56, doi:10.1093/gbe/evy037.","ieee":"J. Kincaid-Smith et al., “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites,” Genome Biology and Evolution, vol. 10, no. 3. Oxford University Press, pp. 840–856, 2018.","short":"J. Kincaid-Smith, M.A.L. Picard, C. Cosseau, J. Boissier, D. Severac, C. Grunau, E. Toulza, Genome Biology and Evolution 10 (2018) 840–856.","chicago":"Kincaid-Smith, Julien, Marion A L Picard, Céline Cosseau, Jérôme Boissier, Dany Severac, Christoph Grunau, and Eve Toulza. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution. Oxford University Press, 2018. https://doi.org/10.1093/gbe/evy037.","ama":"Kincaid-Smith J, Picard MAL, Cosseau C, et al. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 2018;10(3):840-856. doi:10.1093/gbe/evy037","ista":"Kincaid-Smith J, Picard MAL, Cosseau C, Boissier J, Severac D, Grunau C, Toulza E. 2018. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 10(3), 840–856."},"abstract":[{"lang":"eng","text":"Schistosomes are the causative agents of schistosomiasis, a neglected tropical disease affecting over 230 million people worldwide.Additionally to their major impact on human health, they are also models of choice in evolutionary biology. These parasitic flatwormsare unique among the common hermaphroditic trematodes as they have separate sexes. This so-called “evolutionary scandal”displays a female heterogametic genetic sex-determination system (ZZ males and ZW females), as well as a pronounced adult sexualdimorphism. These phenotypic differences are determined by a shared set of genes in both sexes, potentially leading to intralocussexual conflicts. To resolve these conflicts in sexually selected traits, molecular mechanisms such as sex-biased gene expression couldoccur, but parent-of-origin gene expression also provides an alternative. In this work we investigated the latter mechanism, that is,genes expressed preferentially from either the maternal or the paternal allele, inSchistosoma mansonispecies. To this end, tran-scriptomes from male and female hybrid adults obtained by strain crosses were sequenced. Strain-specific single nucleotide poly-morphism (SNP) markers allowed us to discriminate the parental origin, while reciprocal crosses helped to differentiate parentalexpression from strain-specific expression. We identified genes containing SNPs expressed in a parent-of-origin manner consistentwith paternal and maternal imprints. Although the majority of the SNPs was identified in mitochondrial and Z-specific loci, theremaining SNPs found in male and female transcriptomes were situated in genes that have the potential to explain sexual differencesin schistosome parasites. Furthermore, we identified and validated four new Z-specific scaffolds."}],"has_accepted_license":"1","article_processing_charge":"No","title":"Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites","license":"https://creativecommons.org/licenses/by-nc/4.0/","publication_identifier":{"issn":["1759-6653"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"BeVi"}],"publication_status":"published","year":"2018","publisher":"Oxford University Press","external_id":{"isi":["000429483700013"]},"day":"01","oa":1,"type":"journal_article","quality_controlled":"1","isi":1,"date_created":"2019-02-14T12:13:52Z","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:15Z","_id":"5989","oa_version":"Published Version","scopus_import":"1","doi":"10.1093/gbe/evy037"},{"type":"journal_article","oa":1,"day":"02","external_id":{"arxiv":["1809.08487"],"isi":["000450232800015"]},"publisher":"Wiley","year":"2018","publication_status":"published","department":[{"_id":"GeKa"}],"main_file_link":[{"url":"https://arxiv.org/abs/1809.08487","open_access":"1"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["0935-9648"]},"arxiv":1,"title":"Josephson effect in a few-hole quantum dot","article_processing_charge":"No","doi":"10.1002/adma.201802257","scopus_import":"1","oa_version":"Preprint","_id":"5990","language":[{"iso":"eng"}],"date_created":"2019-02-14T12:14:26Z","isi":1,"quality_controlled":"1","issue":"44","publication":"Advanced Materials","author":[{"first_name":"Joost","last_name":"Ridderbos","full_name":"Ridderbos, Joost"},{"id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","full_name":"Brauns, Matthias","last_name":"Brauns","first_name":"Matthias"},{"last_name":"Shen","first_name":"Jie","full_name":"Shen, Jie"},{"last_name":"de Vries","first_name":"Folkert K.","full_name":"de Vries, Folkert K."},{"full_name":"Li, Ang","last_name":"Li","first_name":"Ang"},{"full_name":"Bakkers, Erik P. A. M.","last_name":"Bakkers","first_name":"Erik P. A. M."},{"full_name":"Brinkman, Alexander","last_name":"Brinkman","first_name":"Alexander"},{"full_name":"Zwanenburg, Floris A.","first_name":"Floris A.","last_name":"Zwanenburg"}],"status":"public","article_number":"1802257","volume":30,"month":"11","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"}],"citation":{"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.","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","ieee":"J. Ridderbos et al., “Josephson effect in a few-hole quantum dot,” Advanced Materials, vol. 30, no. 44. Wiley, 2018.","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.","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).","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.","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"},"date_published":"2018-11-02T00:00:00Z","date_updated":"2023-09-19T14:29:58Z","intvolume":" 30"},{"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:15Z","oa_version":"Published Version","scopus_import":"1","_id":"5992","doi":"10.1091/mbc.e18-02-0082","quality_controlled":"1","isi":1,"date_created":"2019-02-14T12:25:47Z","department":[{"_id":"MiSi"}],"publisher":"American Society for Cell Biology ","year":"2018","publication_status":"published","oa":1,"pmid":1,"external_id":{"isi":["000455641000011"],"pmid":["30156465"]},"day":"01","type":"journal_article","title":"On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility","article_processing_charge":"No","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"eissn":["1939-4586"]},"date_published":"2018-11-01T00:00:00Z","tmp":{"image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"citation":{"ama":"Dolati S, Kage F, Mueller J, et al. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. 2018;29(22):2674-2686. doi:10.1091/mbc.e18-02-0082","chicago":"Dolati, Setareh, Frieda Kage, Jan Mueller, Mathias Müsken, Marieluise Kirchner, Gunnar Dittmar, Michael K Sixt, Klemens Rottner, and Martin Falcke. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” Molecular Biology of the Cell. American Society for Cell Biology , 2018. https://doi.org/10.1091/mbc.e18-02-0082.","mla":"Dolati, Setareh, et al. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” Molecular Biology of the Cell, vol. 29, no. 22, American Society for Cell Biology , 2018, pp. 2674–86, doi:10.1091/mbc.e18-02-0082.","ieee":"S. Dolati et al., “On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility,” Molecular Biology of the Cell, vol. 29, no. 22. American Society for Cell Biology , pp. 2674–2686, 2018.","short":"S. Dolati, F. Kage, J. Mueller, M. Müsken, M. Kirchner, G. Dittmar, M.K. Sixt, K. Rottner, M. Falcke, Molecular Biology of the Cell 29 (2018) 2674–2686.","apa":"Dolati, S., Kage, F., Mueller, J., Müsken, M., Kirchner, M., Dittmar, G., … Falcke, M. (2018). On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. American Society for Cell Biology . https://doi.org/10.1091/mbc.e18-02-0082","ista":"Dolati S, Kage F, Mueller J, Müsken M, Kirchner M, Dittmar G, Sixt MK, Rottner K, Falcke M. 2018. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. 29(22), 2674–2686."},"abstract":[{"text":"Lamellipodia are flat membrane protrusions formed during mesenchymal motion. Polymerization at the leading edge assembles the actin filament network and generates protrusion force. How this force is supported by the network and how the assembly rate is shared between protrusion and network retrograde flow determines the protrusion rate. We use mathematical modeling to understand experiments changing the F-actin density in lamellipodia of B16-F1 melanoma cells by modulation of Arp2/3 complex activity or knockout of the formins FMNL2 and FMNL3. Cells respond to a reduction of density with a decrease of protrusion velocity, an increase in the ratio of force to filament number, but constant network assembly rate. The relation between protrusion force and tension gradient in the F-actin network and the density dependency of friction, elasticity, and viscosity of the network explain the experimental observations. The formins act as filament nucleators and elongators with differential rates. Modulation of their activity suggests an effect on network assembly rate. Contrary to these expectations, the effect of changes in elongator composition is much weaker than the consequences of the density change. We conclude that the force acting on the leading edge membrane is the force required to drive F-actin network retrograde flow.","lang":"eng"}],"has_accepted_license":"1","intvolume":" 29","date_updated":"2023-09-19T14:30:23Z","author":[{"last_name":"Dolati","first_name":"Setareh","full_name":"Dolati, Setareh"},{"first_name":"Frieda","last_name":"Kage","full_name":"Kage, Frieda"},{"first_name":"Jan","last_name":"Mueller","full_name":"Mueller, Jan"},{"full_name":"Müsken, Mathias","last_name":"Müsken","first_name":"Mathias"},{"full_name":"Kirchner, Marieluise","first_name":"Marieluise","last_name":"Kirchner"},{"full_name":"Dittmar, Gunnar","last_name":"Dittmar","first_name":"Gunnar"},{"first_name":"Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rottner, Klemens","last_name":"Rottner","first_name":"Klemens"},{"last_name":"Falcke","first_name":"Martin","full_name":"Falcke, Martin"}],"status":"public","publication":"Molecular Biology of the Cell","issue":"22","month":"11","ddc":["570"],"volume":29,"file":[{"date_updated":"2020-07-14T12:47:15Z","creator":"kschuh","access_level":"open_access","date_created":"2019-02-14T12:34:29Z","relation":"main_file","checksum":"e98465b4416b3e804c47f40086932af2","file_name":"2018_ASCB_Dolati.pdf","file_id":"5994","file_size":6668971,"content_type":"application/pdf"}],"page":"2674-2686"},{"isi":1,"date_created":"2019-02-14T12:29:10Z","quality_controlled":"1","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"scopus_import":"1","oa_version":"Submitted Version","_id":"5993","doi":"10.1145/3174800","language":[{"iso":"eng"}],"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0164-0925"]},"title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","article_processing_charge":"No","oa":1,"external_id":{"isi":["000434634500003"],"arxiv":["1510.08517"]},"day":"01","type":"journal_article","department":[{"_id":"KrCh"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1510.08517"}],"publisher":"Association for Computing Machinery","publication_status":"published","year":"2018","date_updated":"2025-04-15T08:12:22Z","intvolume":" 40","citation":{"apa":"Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery. https://doi.org/10.1145/3174800","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2. Association for Computing Machinery, 2018.","mla":"Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery, 2018, doi:10.1145/3174800.","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018).","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery, 2018. https://doi.org/10.1145/3174800.","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 2018;40(2). doi:10.1145/3174800","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 40(2), 7."},"abstract":[{"lang":"eng","text":"In this article, we consider the termination problem of probabilistic programs with real-valued variables. Thequestions concerned are: qualitative ones that ask (i) whether the program terminates with probability 1(almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); andquantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) tocompute a boundBsuch that the probability not to terminate afterBsteps decreases exponentially (con-centration problem). To solve these questions, we utilize the notion of ranking supermartingales, which isa powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmicsynthesis of linear ranking-supermartingales over affine probabilistic programs (Apps) with both angelic anddemonic non-determinism. An important subclass of Apps is LRApp which is defined as the class of all Appsover which a linear ranking-supermartingale exists.Our main contributions are as follows. Firstly, we show that the membership problem of LRApp (i) canbe decided in polynomial time for Apps with at most demonic non-determinism, and (ii) isNP-hard and inPSPACEfor Apps with angelic non-determinism. Moreover, theNP-hardness result holds already for Appswithout probability and demonic non-determinism. Secondly, we show that the concentration problem overLRApp can be solved in the same complexity as for the membership problem of LRApp. Finally, we show thatthe expectation problem over LRApp can be solved in2EXPTIMEand isPSPACE-hard even for Apps withoutprobability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate theeffectiveness of our approach to answer the qualitative and quantitative questions over Apps with at mostdemonic non-determinism."}],"date_published":"2018-06-01T00:00:00Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1438"}]},"month":"06","article_number":"7","ec_funded":1,"volume":40,"publication":"ACM Transactions on Programming Languages and Systems","issue":"2","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Novotný","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr"},{"first_name":"Rouzbeh","last_name":"Hasheminezhad","full_name":"Hasheminezhad, Rouzbeh"}],"status":"public"}]