[{"type":"conference","conference":{"name":"AISTATS: Artificial Intelligence and Statistics","start_date":"2019-04-16","location":"Naha, Okinawa, Japan","end_date":"2019-04-18"},"status":"public","_id":"6747","author":[{"first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"last_name":"Montanari","full_name":"Montanari, Andrea","first_name":"Andrea"}],"external_id":{"arxiv":["1802.07301"]},"article_processing_charge":"No","title":"On the connection between learning two-layers neural networks and tensor decomposition","citation":{"mla":"Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning Two-Layers Neural Networks and Tensor Decomposition.” Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, vol. 89, Proceedings of Machine Learning Research, 2019, pp. 1051–60.","ieee":"M. Mondelli and A. Montanari, “On the connection between learning two-layers neural networks and tensor decomposition,” in Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, Naha, Okinawa, Japan, 2019, vol. 89, pp. 1051–1060.","short":"M. Mondelli, A. Montanari, in:, Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, 2019, pp. 1051–1060.","ama":"Mondelli M, Montanari A. On the connection between learning two-layers neural networks and tensor decomposition. In: Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. Vol 89. Proceedings of Machine Learning Research; 2019:1051-1060.","apa":"Mondelli, M., & Montanari, A. (2019). On the connection between learning two-layers neural networks and tensor decomposition. In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (Vol. 89, pp. 1051–1060). Naha, Okinawa, Japan: Proceedings of Machine Learning Research.","chicago":"Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning Two-Layers Neural Networks and Tensor Decomposition.” In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 89:1051–60. Proceedings of Machine Learning Research, 2019.","ista":"Mondelli M, Montanari A. 2019. On the connection between learning two-layers neural networks and tensor decomposition. Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. AISTATS: Artificial Intelligence and Statistics vol. 89, 1051–1060."},"date_updated":"2021-01-12T08:08:49Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Proceedings of Machine Learning Research","main_file_link":[{"url":"https://arxiv.org/abs/1802.07301","open_access":"1"}],"oa":1,"month":"04","intvolume":" 89","abstract":[{"lang":"eng","text":"We establish connections between the problem of learning a two-layer neural network and tensor decomposition. We consider a model with feature vectors x∈ℝd, r hidden units with weights {wi}1≤i≤r and output y∈ℝ, i.e., y=∑ri=1σ(w𝖳ix), with activation functions given by low-degree polynomials. In particular, if σ(x)=a0+a1x+a3x3, we prove that no polynomial-time learning algorithm can outperform the trivial predictor that assigns to each example the response variable 𝔼(y), when d3/2≪r≪d2. Our conclusion holds for a `natural data distribution', namely standard Gaussian feature vectors x, and output distributed according to a two-layer neural network with random isotropic weights, and under a certain complexity-theoretic assumption on tensor decomposition. Roughly speaking, we assume that no polynomial-time algorithm can substantially outperform current methods for tensor decomposition based on the sum-of-squares hierarchy. We also prove generalizations of this statement for higher degree polynomial activations, and non-random weight vectors. Remarkably, several existing algorithms for learning two-layer networks with rigorous guarantees are based on tensor decomposition. Our results support the idea that this is indeed the core computational difficulty in learning such networks, under the stated generative model for the data. As a side result, we show that under this model learning the network requires accurate learning of its weights, a property that does not hold in a more general setting. "}],"oa_version":"Preprint","page":"1051-1060","volume":89,"date_published":"2019-04-01T00:00:00Z","date_created":"2019-07-31T09:31:26Z","publication_status":"published","year":"2019","day":"01","publication":"Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics","language":[{"iso":"eng"}]},{"year":"2019","day":"15","publication":"IEEE Transactions on Signal Processing","date_published":"2019-11-15T00:00:00Z","doi":"10.1109/TSP.2019.2944738","date_created":"2019-07-31T09:51:14Z","publisher":"IEEE","quality_controlled":"1","oa":1,"citation":{"chicago":"Hashemi, Seyyed Ali, Carlo Condo, Marco Mondelli, and Warren J Gross. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing. IEEE, 2019. https://doi.org/10.1109/TSP.2019.2944738.","ista":"Hashemi SA, Condo C, Mondelli M, Gross WJ. 2019. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 67(22), 8854897.","mla":"Hashemi, Seyyed Ali, et al. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing, vol. 67, no. 22, 8854897, IEEE, 2019, doi:10.1109/TSP.2019.2944738.","short":"S.A. Hashemi, C. Condo, M. Mondelli, W.J. Gross, IEEE Transactions on Signal Processing 67 (2019).","ieee":"S. A. Hashemi, C. Condo, M. Mondelli, and W. J. Gross, “Rate-flexible fast polar decoders,” IEEE Transactions on Signal Processing, vol. 67, no. 22. IEEE, 2019.","apa":"Hashemi, S. A., Condo, C., Mondelli, M., & Gross, W. J. (2019). Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. IEEE. https://doi.org/10.1109/TSP.2019.2944738","ama":"Hashemi SA, Condo C, Mondelli M, Gross WJ. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 2019;67(22). doi:10.1109/TSP.2019.2944738"},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","author":[{"full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi","first_name":"Seyyed Ali"},{"first_name":"Carlo","full_name":"Condo, Carlo","last_name":"Condo"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020"},{"last_name":"Gross","full_name":"Gross, Warren J","first_name":"Warren J"}],"article_processing_charge":"No","external_id":{"arxiv":["1903.09203"]},"title":"Rate-flexible fast polar decoders","article_number":"8854897","publication_identifier":{"issn":["1053587X"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"22","volume":67,"abstract":[{"text":"Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list (SCL) and SC flip (SCF), provide a reasonable error performance for polar codes at the cost of low decoding speed. Fast SC-based decoders, such as Fast-SSC, Fast-SSCL, and Fast-SSCF, identify the special constituent codes in a polar code graph off-line, produce a list of operations, store the list in memory, and feed the list to the decoder to decode the constituent codes in order efficiently, thus increasing the decoding speed. However, the list of operations is dependent on the code rate and as the rate changes, a new list is produced, making fast SC-based decoders not rate-flexible. In this paper, we propose a completely rate-flexible fast SC-based decoder by creating the list of operations directly in hardware, with low implementation complexity. We further propose a hardware architecture implementing the proposed method and show that the area occupation of the rate-flexible fast SC-based decoder in this paper is only 38% of the total area of the memory-based base-line decoder when 5G code rates are supported. ","lang":"eng"}],"oa_version":"Preprint","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.09203"}],"month":"11","intvolume":" 67","date_updated":"2021-01-12T08:08:51Z","department":[{"_id":"MaMo"}],"_id":"6750","article_type":"original","type":"journal_article","status":"public"},{"day":"19","publication":"Electronic Journal of Combinatorics","has_accepted_license":"1","year":"2019","doi":"10.37236/8096","date_published":"2019-07-19T00:00:00Z","date_created":"2019-08-04T21:59:20Z","quality_controlled":"1","publisher":"Electronic Journal of Combinatorics","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17.","chicago":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2019. https://doi.org/10.37236/8096.","short":"V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).","ieee":"V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.","apa":"Jelínek, V., & Töpfer, M. (2019). On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/8096","ama":"Jelínek V, Töpfer M. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 2019;26(3). doi:10.37236/8096","mla":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096."},"title":"On grounded L-graphs and their relatives","author":[{"first_name":"Vít","full_name":"Jelínek, Vít","last_name":"Jelínek"},{"id":"4B865388-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Töpfer, Martin","last_name":"Töpfer"}],"article_processing_charge":"No","external_id":{"arxiv":["1808.04148"]},"article_number":"P3.17","project":[{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"file":[{"file_name":"2019_eJourCombinatorics_Jelinek.pdf","date_created":"2019-08-05T06:46:55Z","file_size":533697,"date_updated":"2020-07-14T12:47:39Z","creator":"dernst","file_id":"6764","checksum":"20fc366fc6683ef0b074a019b73a663a","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["10778926"]},"publication_status":"published","volume":26,"issue":"3","ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that Grounded-L graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. \r\nWe also compare this class to related intersection classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max point-tolerance graphs), or the outer-1-string graphs. We give constructions showing that these classes are all distinct and satisfy only trivial or previously known inclusions."}],"month":"07","intvolume":" 26","scopus_import":"1","ddc":["510"],"date_updated":"2022-03-18T12:32:02Z","department":[{"_id":"DaAl"}],"file_date_updated":"2020-07-14T12:47:39Z","_id":"6759","status":"public","article_type":"original","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)"}},{"project":[{"call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"author":[{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Petr","full_name":"Novotny, Petr","last_name":"Novotny"}],"title":"Bidding games on Markov decision processes","citation":{"ista":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.","chicago":"Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1.","apa":"Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. https://doi.org/10.1007/978-3-030-30806-3_1","ama":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.","ieee":"G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.","mla":"Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Springer","quality_controlled":"1","page":"1-12","date_created":"2019-08-19T07:58:10Z","date_published":"2019-09-06T00:00:00Z","doi":"10.1007/978-3-030-30806-3_1","year":"2019","has_accepted_license":"1","publication":" Proceedings of the 13th International Conference of Reachability Problems","day":"06","conference":{"location":"Brussels, Belgium","end_date":"2019-09-13","start_date":"2019-09-11","name":"RP: Reachability Problems"},"type":"conference","status":"public","_id":"6822","file_date_updated":"2020-07-14T12:47:41Z","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:09:12Z","ddc":["000"],"alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 11674","month":"09","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one."}],"oa_version":"Submitted Version","volume":11674,"publication_status":"published","publication_identifier":{"isbn":["978-303030805-6"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2019-08-19T07:56:40Z","file_name":"prob.pdf","creator":"gavni","date_updated":"2020-07-14T12:47:41Z","file_size":436635,"file_id":"6823","checksum":"45ebbc709af2b247d28c7c293c01504b","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}]},{"status":"public","conference":{"start_date":"2019-08-27","end_date":"2019-08-30","location":"Amsterdam, Netherlands","name":"CONCUR: International Conference on Concurrency Theory"},"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)"},"type":"conference","_id":"6887","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:43Z","ddc":["000"],"date_updated":"2022-08-12T10:54:34Z","intvolume":" 140","month":"08","alternative_title":["LIPIcs"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. "}],"ec_funded":1,"volume":140,"language":[{"iso":"eng"}],"file":[{"creator":"kschuh","file_size":730112,"date_updated":"2020-07-14T12:47:43Z","file_name":"2019_LIPIcs_Chatterjee.pdf","date_created":"2019-10-01T08:20:30Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"6922","checksum":"e1f0e4061212454574f34a1368d018ec"}],"publication_status":"published","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"article_number":"7","title":"Near-linear time algorithms for Streett objectives in graphs and MDPs","article_processing_charge":"No","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Wolfgang","last_name":"Dvorák","full_name":"Dvorák, Wolfgang"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"mla":"Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.7","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7."},"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2019-09-18T08:07:58Z","doi":"10.4230/LIPICS.CONCUR.2019.7","date_published":"2019-08-01T00:00:00Z","publication":"Leibniz International Proceedings in Informatics","day":"01","year":"2019","has_accepted_license":"1"},{"author":[{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"last_name":"Zimmer","full_name":"Zimmer, Manuel","first_name":"Manuel"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"article_processing_charge":"No","title":"Designing worm-inspired neural networks for interpretable robotic control","citation":{"short":"M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2019.","ieee":"M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing worm-inspired neural networks for interpretable robotic control,” in Proceedings - IEEE International Conference on Robotics and Automation, Montreal, QC, Canada, 2019, vol. 2019–May.","ama":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. Designing worm-inspired neural networks for interpretable robotic control. In: Proceedings - IEEE International Conference on Robotics and Automation. Vol 2019-May. IEEE; 2019. doi:10.1109/icra.2019.8793840","apa":"Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., & Grosu, R. (2019). Designing worm-inspired neural networks for interpretable robotic control. In Proceedings - IEEE International Conference on Robotics and Automation (Vol. 2019–May). Montreal, QC, Canada: IEEE. https://doi.org/10.1109/icra.2019.8793840","mla":"Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” Proceedings - IEEE International Conference on Robotics and Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840.","ista":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. 2019. Designing worm-inspired neural networks for interpretable robotic control. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, vol. 2019–May, 8793840.","chicago":"Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” In Proceedings - IEEE International Conference on Robotics and Automation, Vol. 2019–May. IEEE, 2019. https://doi.org/10.1109/icra.2019.8793840."},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"article_number":"8793840","date_published":"2019-05-01T00:00:00Z","doi":"10.1109/icra.2019.8793840","date_created":"2019-09-18T08:09:51Z","has_accepted_license":"1","year":"2019","day":"01","publication":"Proceedings - IEEE International Conference on Robotics and Automation","publisher":"IEEE","quality_controlled":"1","oa":1,"file_date_updated":"2020-10-08T17:30:38Z","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:09:28Z","ddc":["000"],"type":"conference","conference":{"start_date":"2019-05-20","location":"Montreal, QC, Canada","end_date":"2019-05-24","name":"ICRA: International Conference on Robotics and Automation"},"status":"public","_id":"6888","volume":"2019-May","publication_identifier":{"isbn":["9781538660270"]},"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"8636","checksum":"f5545a6b60c3ffd01feb3613f81d03b6","success":1,"creator":"dernst","date_updated":"2020-10-08T17:30:38Z","file_size":3265107,"date_created":"2020-10-08T17:30:38Z","file_name":"2019_ICRA_Lechner.pdf"}],"language":[{"iso":"eng"}],"scopus_import":"1","alternative_title":["ICRA"],"month":"05","abstract":[{"lang":"eng","text":"In this paper, we design novel liquid time-constant recurrent neural networks for robotic control, inspired by the brain of the nematode, C. elegans. In the worm's nervous system, neurons communicate through nonlinear time-varying synaptic links established amongst them by their particular wiring structure. This property enables neurons to express liquid time-constants dynamics and therefore allows the network to originate complex behaviors with a small number of neurons. We identify neuron-pair communication motifs as design operators and use them to configure compact neuronal network structures to govern sequential robotic tasks. The networks are systematically designed to map the environmental observations to motor actions, by their hierarchical topology from sensory neurons, through recurrently-wired interneurons, to motor neurons. The networks are then parametrized in a supervised-learning scheme by a search-based algorithm. We demonstrate that obtained networks realize interpretable dynamics. We evaluate their performance in controlling mobile and arm robots, and compare their attributes to other artificial neural network-based control agents. Finally, we experimentally show their superior resilience to environmental noise, compared to the existing machine learning-based methods."}],"oa_version":"Submitted Version"},{"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"6915","checksum":"4df6d3575c506edb17215adada03cc8e","creator":"kschuh","file_size":741425,"date_updated":"2020-07-14T12:47:43Z","file_name":"2019_LIPIcs_Aghajohari.pdf","date_created":"2019-09-27T12:21:38Z"}],"language":[{"iso":"eng"}],"volume":140,"license":"https://creativecommons.org/licenses/by/3.0/","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets. ","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LIPIcs"],"month":"08","intvolume":" 140","date_updated":"2022-01-26T08:27:10Z","ddc":["000"],"file_date_updated":"2020-07-14T12:47:43Z","department":[{"_id":"ToHe"}],"_id":"6886","type":"conference","conference":{"name":"CONCUR: International Conference on Concurrency Theory","start_date":"2019-08-27","location":"Amsterdam, Netherlands","end_date":"2019-08-30"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"status":"public","has_accepted_license":"1","year":"2019","day":"01","date_published":"2019-08-01T00:00:00Z","doi":"10.4230/LIPICS.CONCUR.2019.20","date_created":"2019-09-18T08:06:58Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"citation":{"ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.20","apa":"Aghajohari, M., Avni, G., & Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.20","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.20.","ista":"Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding infinite-duration games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 20.","chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.20."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Milad","last_name":"Aghajohari","full_name":"Aghajohari, Milad"},{"first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","last_name":"Avni"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"article_processing_charge":"No","external_id":{"arxiv":["1905.03588"]},"title":"Determinacy in discrete-bidding infinite-duration games","article_number":"20","project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering"},{"name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}]},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. "}],"intvolume":" 140","month":"08","alternative_title":["LIPIcs"],"scopus_import":1,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6914","checksum":"4985e26e1572d1575d64d38acabd71d6","date_updated":"2020-07-14T12:47:43Z","file_size":538120,"creator":"kschuh","date_created":"2019-09-27T12:09:35Z","file_name":"2019_LIPIcs_Chatterjee.pdf"}],"publication_status":"published","volume":140,"_id":"6885","status":"public","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)"},"conference":{"start_date":"2019-08-27","location":"Amsterdam, Netherlands","end_date":"2019-08-30","name":"CONCUR: International Conference on Concurrency Theory"},"type":"conference","ddc":["000"],"date_updated":"2021-01-12T08:09:27Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:43Z","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"01","year":"2019","has_accepted_license":"1","date_created":"2019-09-18T08:06:14Z","doi":"10.4230/LIPICS.CONCUR.2019.27","date_published":"2019-08-01T00:00:00Z","article_number":"27","project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.","ista":"Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.","mla":"Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27","ama":"Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.27","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140."},"title":"Long-run average behavior of vector addition systems with states","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}]},{"title":"Combinations of Qualitative Winning for Stochastic Parity Games","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","apa":"Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6","ama":"Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.6","mla":"Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.","ista":"Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6."},"project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"article_number":"6","date_created":"2019-09-18T08:11:43Z","date_published":"2019-08-01T00:00:00Z","doi":"10.4230/LIPICS.CONCUR.2019.6","day":"01","year":"2019","has_accepted_license":"1","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","file_date_updated":"2020-07-14T12:47:43Z","department":[{"_id":"KrCh"}],"ddc":["000"],"date_updated":"2021-01-12T08:09:28Z","status":"public","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)"},"conference":{"name":"CONCUR: International Conference on Concurrency Theory","end_date":"2019-08-30","location":"Amsterdam, Netherlands","start_date":"2019-08-27"},"type":"conference","_id":"6889","volume":140,"language":[{"iso":"eng"}],"file":[{"file_id":"6923","checksum":"7b2ecfd4d9d02360308c0ca986fc10a7","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-10-01T08:49:45Z","file_name":"2019_LIPIcs_Chatterjee.pdf","creator":"kschuh","date_updated":"2020-07-14T12:47:43Z","file_size":509163}],"publication_status":"published","intvolume":" 140","month":"08","scopus_import":1,"alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. "}]},{"_id":"6931","status":"public","keyword":["consensus","approximate agreement","Byzantine faults","chordal graphs","lattice agreement"],"type":"conference","conference":{"location":"Budapest, Hungary","end_date":"2019-10-18","start_date":"2019-10-14","name":"DISC: International Symposium on Distributed Computing"},"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)"},"ddc":["004"],"date_updated":"2021-01-12T08:09:38Z","file_date_updated":"2020-07-14T12:47:44Z","department":[{"_id":"DaAl"}],"oa_version":"Published Version","abstract":[{"text":"Consider a distributed system with n processors out of which f can be Byzantine faulty. In the\r\napproximate agreement task, each processor i receives an input value xi and has to decide on an\r\noutput value yi such that\r\n1. the output values are in the convex hull of the non-faulty processors’ input values,\r\n2. the output values are within distance d of each other.\r\n\r\n\r\nClassically, the values are assumed to be from an m-dimensional Euclidean space, where m ≥ 1.\r\nIn this work, we study the task in a discrete setting, where input values with some structure\r\nexpressible as a graph. Namely, the input values are vertices of a finite graph G and the goal is to\r\noutput vertices that are within distance d of each other in G, but still remain in the graph-induced\r\nconvex hull of the input values. For d = 0, the task reduces to consensus and cannot be solved with\r\na deterministic algorithm in an asynchronous system even with a single crash fault. For any d ≥ 1,\r\nwe show that the task is solvable in asynchronous systems when G is chordal and n > (ω + 1)f,\r\nwhere ω is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a\r\nvariant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact\r\nvariants of these and related tasks over a large class of combinatorial structures.","lang":"eng"}],"intvolume":" 146","scopus_import":1,"alternative_title":["LIPIcs"],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"6934","checksum":"2d2202f90c6ac991e50876451627c4b5","creator":"jrybicki","file_size":639378,"date_updated":"2020-07-14T12:47:44Z","file_name":"LIPIcs-DISC-2019-29.pdf","date_created":"2019-10-08T12:47:19Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-3-95977-126-9"]},"publication_status":"published","volume":146,"ec_funded":1,"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” In 33rd International Symposium on Distributed Computing, 146:29:1--29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.DISC.2019.29.","ista":"Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd International Symposium on Distributed Computing. DISC: International Symposium on Distributed Computing, LIPIcs, vol. 146, 29:1--29:17.","mla":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.","ama":"Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29","apa":"Nowak, T., & Rybicki, J. (2019). Byzantine approximate agreement on graphs. In 33rd International Symposium on Distributed Computing (Vol. 146, p. 29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.DISC.2019.29","ieee":"T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.","short":"T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17."},"title":"Byzantine approximate agreement on graphs","author":[{"first_name":"Thomas","last_name":"Nowak","full_name":"Nowak, Thomas"},{"full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","last_name":"Rybicki","first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"arxiv":["1908.02743"]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"publication":"33rd International Symposium on Distributed Computing","has_accepted_license":"1","year":"2019","date_published":"2019-01-01T00:00:00Z","doi":"10.4230/LIPICS.DISC.2019.29","date_created":"2019-10-08T12:41:38Z","page":"29:1--29:17"},{"author":[{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"last_name":"Amini","full_name":"Amini, Alexander","first_name":"Alexander"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Naser, Felix","last_name":"Naser","first_name":"Felix"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"}],"external_id":{"arxiv":["1809.03864"]},"department":[{"_id":"ToHe"}],"title":"Response characterization for auditing cell dynamics in long short-term memory networks","date_updated":"2021-01-12T08:11:19Z","citation":{"mla":"Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” Proceedings of the International Joint Conference on Neural Networks, 8851954, IEEE, 2019, doi:10.1109/ijcnn.2019.8851954.","short":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, D. Rus, in:, Proceedings of the International Joint Conference on Neural Networks, IEEE, 2019.","ieee":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, and D. Rus, “Response characterization for auditing cell dynamics in long short-term memory networks,” in Proceedings of the International Joint Conference on Neural Networks, Budapest, Hungary, 2019.","apa":"Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., & Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In Proceedings of the International Joint Conference on Neural Networks. Budapest, Hungary: IEEE. https://doi.org/10.1109/ijcnn.2019.8851954","ama":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. Response characterization for auditing cell dynamics in long short-term memory networks. In: Proceedings of the International Joint Conference on Neural Networks. IEEE; 2019. doi:10.1109/ijcnn.2019.8851954","chicago":"Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu, and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” In Proceedings of the International Joint Conference on Neural Networks. IEEE, 2019. https://doi.org/10.1109/ijcnn.2019.8851954.","ista":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. 2019. Response characterization for auditing cell dynamics in long short-term memory networks. Proceedings of the International Joint Conference on Neural Networks. IJCNN: International Joint Conference on Neural Networks, 8851954."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","conference":{"end_date":"2019-07-19","location":"Budapest, Hungary","start_date":"2019-07-14","name":"IJCNN: International Joint Conference on Neural Networks"},"status":"public","_id":"6985","article_number":"8851954","doi":"10.1109/ijcnn.2019.8851954","date_published":"2019-09-30T00:00:00Z","date_created":"2019-11-04T15:59:58Z","publication_identifier":{"isbn":["9781728119854"]},"year":"2019","publication_status":"published","day":"30","publication":"Proceedings of the International Joint Conference on Neural Networks","language":[{"iso":"eng"}],"publisher":"IEEE","quality_controlled":"1","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1809.03864","open_access":"1"}],"oa":1,"month":"09","abstract":[{"text":"In this paper, we introduce a novel method to interpret recurrent neural networks (RNNs), particularly long short-term memory networks (LSTMs) at the cellular level. We propose a systematic pipeline for interpreting individual hidden state dynamics within the network using response characterization methods. The ranked contribution of individual cells to the network's output is computed by analyzing a set of interpretable metrics of their decoupled step and sinusoidal responses. As a result, our method is able to uniquely identify neurons with insightful dynamics, quantify relationships between dynamical properties and test accuracy through ablation analysis, and interpret the impact of network capacity on a network's dynamical distribution. Finally, we demonstrate the generalizability and scalability of our method by evaluating a series of different benchmark sequential datasets.","lang":"eng"}],"oa_version":"Preprint"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms, vol. 12, no. 10, 218, MDPI, 2019, doi:10.3390/a12100218.","short":"M. Mondelli, S.H. Hassani, R. Urbanke, Algorithms 12 (2019).","ieee":"M. Mondelli, S. H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” Algorithms, vol. 12, no. 10. MDPI, 2019.","apa":"Mondelli, M., Hassani, S. H., & Urbanke, R. (2019). A new coding paradigm for the primitive relay channel. Algorithms. MDPI. https://doi.org/10.3390/a12100218","ama":"Mondelli M, Hassani SH, Urbanke R. A new coding paradigm for the primitive relay channel. Algorithms. 2019;12(10). doi:10.3390/a12100218","chicago":"Mondelli, Marco, S. Hamed Hassani, and Rüdiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms. MDPI, 2019. https://doi.org/10.3390/a12100218.","ista":"Mondelli M, Hassani SH, Urbanke R. 2019. A new coding paradigm for the primitive relay channel. Algorithms. 12(10), 218."},"title":"A new coding paradigm for the primitive relay channel","author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020"},{"first_name":"S. Hamed","full_name":"Hassani, S. Hamed","last_name":"Hassani"},{"last_name":"Urbanke","full_name":"Urbanke, Rüdiger","first_name":"Rüdiger"}],"external_id":{"arxiv":["1801.03153"]},"article_number":"218","day":"18","publication":"Algorithms","has_accepted_license":"1","year":"2019","doi":"10.3390/a12100218","date_published":"2019-10-18T00:00:00Z","date_created":"2019-11-12T14:46:19Z","publisher":"MDPI","quality_controlled":"1","oa":1,"ddc":["510"],"date_updated":"2023-02-23T12:49:28Z","department":[{"_id":"MaMo"}],"file_date_updated":"2020-07-14T12:47:47Z","_id":"7007","status":"public","type":"journal_article","article_type":"original","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":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"7008","checksum":"267756d8f9db572f496cd1663c89d59a","creator":"dernst","date_updated":"2020-07-14T12:47:47Z","file_size":696791,"date_created":"2019-11-12T14:48:45Z","file_name":"2019_Algorithms_Mondelli.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1999-4893"]},"publication_status":"published","volume":12,"issue":"10","related_material":{"record":[{"id":"6675","status":"public","relation":"earlier_version"}]},"oa_version":"Published Version","abstract":[{"text":"We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner–Ziv coding. In this paper, we present a novel coding paradigm that provides an improved achievable rate for the primitive relay channel. The idea is to combine compress-and-forward and decode-and-forward via a chaining construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward; and, in the second block, we use decode-and-forward. More specifically, in the first block, the relay does not decode, it compresses the received signal via Wyner–Ziv, and it sends only part of the compression to the destination. In the second block, the relay completely decodes the message, it sends some information to the destination, and it also sends the remaining part of the compression coming from the first block. By doing so, we are able to strictly outperform both compress-and-forward and decode-and-forward. Note that the proposed coding scheme can be implemented with polar codes. As such, it has the typical attractive properties of polar coding schemes, namely, quasi-linear encoding and decoding complexity, and error probability that decays at super-polynomial speed. As a running example, we take into account the special case of the erasure relay channel, and we provide a comparison between the rates achievable by our proposed scheme and the existing upper and lower bounds.","lang":"eng"}],"month":"10","intvolume":" 12","scopus_import":1},{"title":"Dirac masses and isometric rigidity","department":[{"_id":"LaEr"}],"author":[{"full_name":"Geher, Gyorgy Pal","last_name":"Geher","first_name":"Gyorgy Pal"},{"first_name":"Tamas","full_name":"Titkos, Tamas","last_name":"Titkos"},{"full_name":"Virosztek, Daniel","orcid":"0000-0003-1109-5511","last_name":"Virosztek","first_name":"Daniel","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Geher, Gyorgy Pal, et al. “Dirac Masses and Isometric Rigidity.” Kyoto RIMS Kôkyûroku, vol. 2125, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41.","ieee":"G. P. Geher, T. Titkos, and D. Virosztek, “Dirac masses and isometric rigidity,” in Kyoto RIMS Kôkyûroku, Kyoto, Japan, 2019, vol. 2125, pp. 34–41.","short":"G.P. Geher, T. Titkos, D. Virosztek, in:, Kyoto RIMS Kôkyûroku, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41.","apa":"Geher, G. P., Titkos, T., & Virosztek, D. (2019). Dirac masses and isometric rigidity. In Kyoto RIMS Kôkyûroku (Vol. 2125, pp. 34–41). Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University.","ama":"Geher GP, Titkos T, Virosztek D. Dirac masses and isometric rigidity. In: Kyoto RIMS Kôkyûroku. Vol 2125. Research Institute for Mathematical Sciences, Kyoto University; 2019:34-41.","chicago":"Geher, Gyorgy Pal, Tamas Titkos, and Daniel Virosztek. “Dirac Masses and Isometric Rigidity.” In Kyoto RIMS Kôkyûroku, 2125:34–41. Research Institute for Mathematical Sciences, Kyoto University, 2019.","ista":"Geher GP, Titkos T, Virosztek D. 2019. Dirac masses and isometric rigidity. Kyoto RIMS Kôkyûroku. Research on isometries as preserver problems and related topics vol. 2125, 34–41."},"date_updated":"2021-01-12T08:11:33Z","status":"public","type":"conference","conference":{"name":"Research on isometries as preserver problems and related topics","location":"Kyoto, Japan","end_date":"2019-01-30","start_date":"2019-01-28"},"_id":"7035","volume":2125,"date_published":"2019-01-30T00:00:00Z","date_created":"2019-11-18T15:39:53Z","page":"34-41","day":"30","language":[{"iso":"eng"}],"publication":"Kyoto RIMS Kôkyûroku","publication_status":"published","year":"2019","month":"01","intvolume":" 2125","quality_controlled":"1","publisher":"Research Institute for Mathematical Sciences, Kyoto University","main_file_link":[{"url":"http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/2125.html","open_access":"1"}],"oa":1,"oa_version":"Submitted Version","abstract":[{"text":"The aim of this short note is to expound one particular issue that was discussed during the talk [10] given at the symposium ”Researches on isometries as preserver problems and related topics” at Kyoto RIMS. That is, the role of Dirac masses by describing the isometry group of various metric spaces of probability measures. This article is of survey character, and it does not contain any essentially new results.From an isometric point of view, in some cases, metric spaces of measures are similar to C(K)-type function spaces. Similarity means here that their isometries are driven by some nice transformations of the underlying space. Of course, it depends on the particular choice of the metric how nice these transformations should be. Sometimes, as we will see, being a homeomorphism is enough to generate an isometry. But sometimes we need more: the transformation must preserve the underlying distance as well. Statements claiming that isometries in questions are necessarily induced by homeomorphisms are called Banach-Stone-type results, while results asserting that the underlying transformation is necessarily an isometry are termed as isometric rigidity results.As Dirac masses can be considered as building bricks of the set of all Borel measures, a natural question arises:Is it enough to understand how an isometry acts on the set of Dirac masses? Does this action extend uniquely to all measures?In what follows, we will thoroughly investigate this question.","lang":"eng"}]},{"status":"public","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)"},"type":"journal_article","article_type":"original","_id":"7055","file_date_updated":"2020-07-14T12:47:48Z","ddc":["530"],"extern":"1","date_updated":"2021-01-12T08:11:35Z","intvolume":" 7","month":"10","oa_version":"Published Version","abstract":[{"lang":"eng","text":"A recent class of topological nodal-line semimetals with the general formula MSiX (M = Zr, Hf and X = S, Se, Te) has attracted much experimental and theoretical interest due to their properties, particularly their large magnetoresistances and high carrier mobilities. The plateletlike nature of the MSiX crystals and their extremely low residual resistivities make measurements of the resistivity along the [001] direction extremely challenging. To accomplish such measurements, microstructures of single crystals were prepared using focused ion beam techniques. Microstructures prepared in this manner have very well-defined geometries and maintain their high crystal quality, verified by the observations of quantum oscillations. We present magnetoresistance and quantum oscillation data for currents applied along both [001] and [100] in ZrSiS and ZrSiSe, which are consistent with the nontrivial topology of the Dirac line-node, as determined by a measured π Berry phase. Surprisingly, we find that, despite the three dimensional nature of both the Fermi surfaces of ZrSiS and ZrSiSe, both the resistivity anisotropy under applied magnetic fields and the in-plane angular dependent magnetoresistance differ considerably between the two compounds. Finally, we discuss the role microstructuring can play in the study of these materials and our ability to make these microstructures free-standing."}],"issue":"10","volume":7,"language":[{"iso":"eng"}],"file":[{"file_id":"7087","checksum":"142fe7b3e37d8e916071743bb194360d","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-11-20T12:27:01Z","file_name":"2019_APL_Shirer.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:48Z","file_size":2453220}],"publication_status":"published","publication_identifier":{"issn":["2166-532X"]},"article_number":"101116","title":"Out-of-plane transport in ZrSiS and ZrSiSe microstructures","article_processing_charge":"No","author":[{"first_name":"Kent R.","last_name":"Shirer","full_name":"Shirer, Kent R."},{"id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","first_name":"Kimberly A","orcid":"0000-0001-9760-3147","full_name":"Modic, Kimberly A","last_name":"Modic"},{"last_name":"Zimmerling","full_name":"Zimmerling, Tino","first_name":"Tino"},{"full_name":"Bachmann, Maja D.","last_name":"Bachmann","first_name":"Maja D."},{"full_name":"König, Markus","last_name":"König","first_name":"Markus"},{"first_name":"Philip J. W.","last_name":"Moll","full_name":"Moll, Philip J. W."},{"last_name":"Schoop","full_name":"Schoop, Leslie","first_name":"Leslie"},{"first_name":"Andrew P.","full_name":"Mackenzie, Andrew P.","last_name":"Mackenzie"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Shirer, Kent R., et al. “Out-of-Plane Transport in ZrSiS and ZrSiSe Microstructures.” APL Materials, vol. 7, no. 10, 101116, AIP, 2019, doi:10.1063/1.5124568.","ama":"Shirer KR, Modic KA, Zimmerling T, et al. Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. 2019;7(10). doi:10.1063/1.5124568","apa":"Shirer, K. R., Modic, K. A., Zimmerling, T., Bachmann, M. D., König, M., Moll, P. J. W., … Mackenzie, A. P. (2019). Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. AIP. https://doi.org/10.1063/1.5124568","short":"K.R. Shirer, K.A. Modic, T. Zimmerling, M.D. Bachmann, M. König, P.J.W. Moll, L. Schoop, A.P. Mackenzie, APL Materials 7 (2019).","ieee":"K. R. Shirer et al., “Out-of-plane transport in ZrSiS and ZrSiSe microstructures,” APL Materials, vol. 7, no. 10. AIP, 2019.","chicago":"Shirer, Kent R., Kimberly A Modic, Tino Zimmerling, Maja D. Bachmann, Markus König, Philip J. W. Moll, Leslie Schoop, and Andrew P. Mackenzie. “Out-of-Plane Transport in ZrSiS and ZrSiSe Microstructures.” APL Materials. AIP, 2019. https://doi.org/10.1063/1.5124568.","ista":"Shirer KR, Modic KA, Zimmerling T, Bachmann MD, König M, Moll PJW, Schoop L, Mackenzie AP. 2019. Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. 7(10), 101116."},"oa":1,"quality_controlled":"1","publisher":"AIP","date_created":"2019-11-19T12:52:43Z","date_published":"2019-10-17T00:00:00Z","doi":"10.1063/1.5124568","publication":"APL Materials","day":"17","year":"2019","has_accepted_license":"1"},{"oa":1,"publisher":"Springer Nature","quality_controlled":"1","date_created":"2019-11-19T13:00:35Z","doi":"10.1038/s41598-018-38161-7","date_published":"2019-02-14T00:00:00Z","publication":"Scientific Reports","day":"14","year":"2019","has_accepted_license":"1","article_number":"2095","title":"Thermodynamic signatures of Weyl fermions in NbP","article_processing_charge":"No","author":[{"full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147","last_name":"Modic","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","first_name":"Kimberly A"},{"full_name":"Meng, Tobias","last_name":"Meng","first_name":"Tobias"},{"first_name":"Filip","last_name":"Ronning","full_name":"Ronning, Filip"},{"last_name":"Bauer","full_name":"Bauer, Eric D.","first_name":"Eric D."},{"first_name":"Philip J. W.","last_name":"Moll","full_name":"Moll, Philip J. W."},{"last_name":"Ramshaw","full_name":"Ramshaw, B. J.","first_name":"B. J."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. A. Modic, T. Meng, F. Ronning, E. D. Bauer, P. J. W. Moll, and B. J. Ramshaw, “Thermodynamic signatures of Weyl fermions in NbP,” Scientific Reports, vol. 9, no. 1. Springer Nature, 2019.","short":"K.A. Modic, T. Meng, F. Ronning, E.D. Bauer, P.J.W. Moll, B.J. Ramshaw, Scientific Reports 9 (2019).","ama":"Modic KA, Meng T, Ronning F, Bauer ED, Moll PJW, Ramshaw BJ. Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. 2019;9(1). doi:10.1038/s41598-018-38161-7","apa":"Modic, K. A., Meng, T., Ronning, F., Bauer, E. D., Moll, P. J. W., & Ramshaw, B. J. (2019). Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-018-38161-7","mla":"Modic, Kimberly A., et al. “Thermodynamic Signatures of Weyl Fermions in NbP.” Scientific Reports, vol. 9, no. 1, 2095, Springer Nature, 2019, doi:10.1038/s41598-018-38161-7.","ista":"Modic KA, Meng T, Ronning F, Bauer ED, Moll PJW, Ramshaw BJ. 2019. Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. 9(1), 2095.","chicago":"Modic, Kimberly A, Tobias Meng, Filip Ronning, Eric D. Bauer, Philip J. W. Moll, and B. J. Ramshaw. “Thermodynamic Signatures of Weyl Fermions in NbP.” Scientific Reports. Springer Nature, 2019. https://doi.org/10.1038/s41598-018-38161-7."},"intvolume":" 9","month":"02","oa_version":"Published Version","abstract":[{"text":"We present a high magnetic field study of NbP—a member of the monopnictide Weyl semimetal (WSM) family. While the monoarsenides (NbAs and TaAs) have topologically distinct left and right-handed Weyl fermi surfaces, NbP is argued to be “topologically trivial” due to the fact that all pairs of Weyl nodes are encompassed by a single Fermi surface. We use torque magnetometry to measure the magnetic response of NbP up to 60 tesla and uncover a Berry paramagnetic response, characteristic of the topological Weyl nodes, across the entire field range. At the quantum limit B* (≈32 T), τ/B experiences a change in slope when the chemical potential enters the last Landau level. Our calculations confirm that this magnetic response arises from band topology of the Weyl pocket, even though the Fermi surface encompasses both Weyl nodes at zero magnetic field. We also find that the magnetic field pulls the chemical potential to the chiral n = 0 Landau level in the quantum limit, providing a disorder-free way of accessing chiral Weyl fermions in systems that are “not quite” WSMs in zero magnetic field.","lang":"eng"}],"volume":9,"issue":"1","language":[{"iso":"eng"}],"file":[{"date_created":"2019-11-20T12:24:13Z","file_name":"2019_ScientificReports_Modic.pdf","date_updated":"2020-07-14T12:47:48Z","file_size":3256400,"creator":"dernst","checksum":"3b5a7b316e1ff22aa0f89e8d1f1ace91","file_id":"7086","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","publication_identifier":{"issn":["2045-2322"]},"status":"public","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)"},"type":"journal_article","article_type":"original","_id":"7057","file_date_updated":"2020-07-14T12:47:48Z","ddc":["530"],"extern":"1","date_updated":"2021-01-12T08:11:36Z"},{"_id":"7056","status":"public","type":"journal_article","article_type":"original","extern":"1","date_updated":"2021-01-12T08:11:35Z","oa_version":"Preprint","abstract":[{"text":"In the Ca1−x La x FeAs2 (1 1 2) family of pnictide superconductors, we have investigated a highly overdoped composition (x = 0.56), prepared by a high-pressure, high-temperature synthesis. Magnetic measurements show an antiferromagnetic transition at T N = 120 K, well above the one at lower doping (0.15 < x < 0.27).\r\n\r\nBelow the onset of long-range magnetic order at T N, the electrical resistivity is strongly reduced and is dominated by electron–electron interactions, as evident from its temperature dependence. The Seebeck coefficient shows a clear metallic behavior as in narrow band conductors. The temperature dependence of the Hall coefficient and the violation of Kohler's rule agree with the multiband character of the material. No superconductivity was observed down to 1.8 K. The success of the high-pressure synthesis encourages further investigations of the so far only partially explored phase diagram in this family of Iron-based high temperature superconductors.\r\n","lang":"eng"}],"intvolume":" 31","month":"09","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1905.08640"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1361-648X"],"issn":["0953-8984"]},"volume":31,"issue":"48","article_number":"485705","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Martino, Edoardo, Maja D Bachmann, Lidia Rossi, Kimberly A Modic, Ivica Zivkovic, Henrik M Rønnow, Philip J W Moll, Ana Akrap, László Forró, and Sergiy Katrych. “Persistent Antiferromagnetic Order in Heavily Overdoped Ca1−x La x FeAs2.” Journal of Physics: Condensed Matter. IOP Publishing, 2019. https://doi.org/10.1088/1361-648x/ab3b43.","ista":"Martino E, Bachmann MD, Rossi L, Modic KA, Zivkovic I, Rønnow HM, Moll PJW, Akrap A, Forró L, Katrych S. 2019. Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. 31(48), 485705.","mla":"Martino, Edoardo, et al. “Persistent Antiferromagnetic Order in Heavily Overdoped Ca1−x La x FeAs2.” Journal of Physics: Condensed Matter, vol. 31, no. 48, 485705, IOP Publishing, 2019, doi:10.1088/1361-648x/ab3b43.","ieee":"E. Martino et al., “Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2,” Journal of Physics: Condensed Matter, vol. 31, no. 48. IOP Publishing, 2019.","short":"E. Martino, M.D. Bachmann, L. Rossi, K.A. Modic, I. Zivkovic, H.M. Rønnow, P.J.W. Moll, A. Akrap, L. Forró, S. Katrych, Journal of Physics: Condensed Matter 31 (2019).","ama":"Martino E, Bachmann MD, Rossi L, et al. Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. 2019;31(48). doi:10.1088/1361-648x/ab3b43","apa":"Martino, E., Bachmann, M. D., Rossi, L., Modic, K. A., Zivkovic, I., Rønnow, H. M., … Katrych, S. (2019). Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. IOP Publishing. https://doi.org/10.1088/1361-648x/ab3b43"},"title":"Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2","external_id":{"arxiv":["1905.08640"]},"article_processing_charge":"No","author":[{"first_name":"Edoardo","last_name":"Martino","full_name":"Martino, Edoardo"},{"last_name":"Bachmann","full_name":"Bachmann, Maja D","first_name":"Maja D"},{"last_name":"Rossi","full_name":"Rossi, Lidia","first_name":"Lidia"},{"id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","first_name":"Kimberly A","last_name":"Modic","full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147"},{"last_name":"Zivkovic","full_name":"Zivkovic, Ivica","first_name":"Ivica"},{"last_name":"Rønnow","full_name":"Rønnow, Henrik M","first_name":"Henrik M"},{"last_name":"Moll","full_name":"Moll, Philip J W","first_name":"Philip J W"},{"full_name":"Akrap, Ana","last_name":"Akrap","first_name":"Ana"},{"full_name":"Forró, László","last_name":"Forró","first_name":"László"},{"last_name":"Katrych","full_name":"Katrych, Sergiy","first_name":"Sergiy"}],"oa":1,"quality_controlled":"1","publisher":"IOP Publishing","publication":"Journal of Physics: Condensed Matter","day":"03","year":"2019","date_created":"2019-11-19T12:56:17Z","date_published":"2019-09-03T00:00:00Z","doi":"10.1088/1361-648x/ab3b43"},{"oa_version":"None","abstract":[{"lang":"eng","text":"Although crystals of strongly correlated metals exhibit a diverse set of electronic ground states, few approaches exist for spatially modulating their properties. In this study, we demonstrate disorder-free control, on the micrometer scale, over the superconducting state in samples of the heavy-fermion superconductor CeIrIn5. We pattern crystals by focused ion beam milling to tailor the boundary conditions for the elastic deformation upon thermal contraction during cooling. The resulting nonuniform strain fields induce complex patterns of superconductivity, owing to the strong dependence of the transition temperature on the strength and direction of strain. These results showcase a generic approach to manipulating electronic order on micrometer length scales in strongly correlated matter without compromising the cleanliness, stoichiometry, or mean free path."}],"month":"10","intvolume":" 366","publisher":"AAAS","quality_controlled":"1","day":"11","publication":"Science","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"publication_status":"published","year":"2019","volume":366,"doi":"10.1126/science.aao6640","issue":"6462","date_published":"2019-10-11T00:00:00Z","date_created":"2019-11-19T13:55:58Z","page":"221-226","_id":"7082","status":"public","type":"journal_article","article_type":"original","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:11:46Z","citation":{"ista":"Bachmann MD, Ferguson GM, Theuss F, Meng T, Putzke C, Helm T, Shirer KR, Li Y-S, Modic KA, Nicklas M, König M, Low D, Ghosh S, Mackenzie AP, Arnold F, Hassinger E, McDonald RD, Winter LE, Bauer ED, Ronning F, Ramshaw BJ, Nowack KC, Moll PJW. 2019. Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. 366(6462), 221–226.","chicago":"Bachmann, Maja D., G. M. Ferguson, Florian Theuss, Tobias Meng, Carsten Putzke, Toni Helm, K. R. Shirer, et al. “Spatial Control of Heavy-Fermion Superconductivity in CeIrIn5.” Science. AAAS, 2019. https://doi.org/10.1126/science.aao6640.","ama":"Bachmann MD, Ferguson GM, Theuss F, et al. Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. 2019;366(6462):221-226. doi:10.1126/science.aao6640","apa":"Bachmann, M. D., Ferguson, G. M., Theuss, F., Meng, T., Putzke, C., Helm, T., … Moll, P. J. W. (2019). Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. AAAS. https://doi.org/10.1126/science.aao6640","ieee":"M. D. Bachmann et al., “Spatial control of heavy-fermion superconductivity in CeIrIn5,” Science, vol. 366, no. 6462. AAAS, pp. 221–226, 2019.","short":"M.D. Bachmann, G.M. Ferguson, F. Theuss, T. Meng, C. Putzke, T. Helm, K.R. Shirer, Y.-S. Li, K.A. Modic, M. Nicklas, M. König, D. Low, S. Ghosh, A.P. Mackenzie, F. Arnold, E. Hassinger, R.D. McDonald, L.E. Winter, E.D. Bauer, F. Ronning, B.J. Ramshaw, K.C. Nowack, P.J.W. Moll, Science 366 (2019) 221–226.","mla":"Bachmann, Maja D., et al. “Spatial Control of Heavy-Fermion Superconductivity in CeIrIn5.” Science, vol. 366, no. 6462, AAAS, 2019, pp. 221–26, doi:10.1126/science.aao6640."},"title":"Spatial control of heavy-fermion superconductivity in CeIrIn5","author":[{"first_name":"Maja D.","last_name":"Bachmann","full_name":"Bachmann, Maja D."},{"last_name":"Ferguson","full_name":"Ferguson, G. M.","first_name":"G. M."},{"last_name":"Theuss","full_name":"Theuss, Florian","first_name":"Florian"},{"last_name":"Meng","full_name":"Meng, Tobias","first_name":"Tobias"},{"full_name":"Putzke, Carsten","last_name":"Putzke","first_name":"Carsten"},{"first_name":"Toni","last_name":"Helm","full_name":"Helm, Toni"},{"first_name":"K. R.","full_name":"Shirer, K. R.","last_name":"Shirer"},{"first_name":"You-Sheng","last_name":"Li","full_name":"Li, You-Sheng"},{"last_name":"Modic","orcid":"0000-0001-9760-3147","full_name":"Modic, Kimberly A","first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425"},{"first_name":"Michael","last_name":"Nicklas","full_name":"Nicklas, Michael"},{"full_name":"König, Markus","last_name":"König","first_name":"Markus"},{"first_name":"D.","full_name":"Low, D.","last_name":"Low"},{"first_name":"Sayak","full_name":"Ghosh, Sayak","last_name":"Ghosh"},{"first_name":"Andrew P.","full_name":"Mackenzie, Andrew P.","last_name":"Mackenzie"},{"last_name":"Arnold","full_name":"Arnold, Frank","first_name":"Frank"},{"first_name":"Elena","last_name":"Hassinger","full_name":"Hassinger, Elena"},{"last_name":"McDonald","full_name":"McDonald, Ross D.","first_name":"Ross D."},{"first_name":"Laurel E.","full_name":"Winter, Laurel E.","last_name":"Winter"},{"full_name":"Bauer, Eric D.","last_name":"Bauer","first_name":"Eric D."},{"first_name":"Filip","full_name":"Ronning, Filip","last_name":"Ronning"},{"first_name":"B. J.","full_name":"Ramshaw, B. J.","last_name":"Ramshaw"},{"first_name":"Katja C.","full_name":"Nowack, Katja C.","last_name":"Nowack"},{"full_name":"Moll, Philip J. W.","last_name":"Moll","first_name":"Philip J. W."}],"article_processing_charge":"No"},{"quality_controlled":"1","publisher":"Elsevier","oa":1,"has_accepted_license":"1","year":"2019","day":"28","publication":"Cell Reports","page":"2759-2771.e5","date_published":"2019-05-28T00:00:00Z","doi":"10.1016/j.celrep.2019.05.005","date_created":"2019-11-26T22:30:07Z","citation":{"ama":"Torrini C, Cubero RJ, Dirkx E, et al. Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. 2019;27(9):2759-2771.e5. doi:10.1016/j.celrep.2019.05.005","apa":"Torrini, C., Cubero, R. J., Dirkx, E., Braga, L., Ali, H., Prosdocimo, G., … Giacca, M. (2019). Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2019.05.005","short":"C. Torrini, R.J. Cubero, E. Dirkx, L. Braga, H. Ali, G. Prosdocimo, M.I. Gutierrez, C. Collesi, D. Licastro, L. Zentilin, M. Mano, S. Zacchigna, M. Vendruscolo, M. Marsili, A. Samal, M. Giacca, Cell Reports 27 (2019) 2759–2771.e5.","ieee":"C. Torrini et al., “Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation,” Cell Reports, vol. 27, no. 9. Elsevier, p. 2759–2771.e5, 2019.","mla":"Torrini, Consuelo, et al. “Common Regulatory Pathways Mediate Activity of MicroRNAs Inducing Cardiomyocyte Proliferation.” Cell Reports, vol. 27, no. 9, Elsevier, 2019, p. 2759–2771.e5, doi:10.1016/j.celrep.2019.05.005.","ista":"Torrini C, Cubero RJ, Dirkx E, Braga L, Ali H, Prosdocimo G, Gutierrez MI, Collesi C, Licastro D, Zentilin L, Mano M, Zacchigna S, Vendruscolo M, Marsili M, Samal A, Giacca M. 2019. Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. 27(9), 2759–2771.e5.","chicago":"Torrini, Consuelo, Ryan J Cubero, Ellen Dirkx, Luca Braga, Hashim Ali, Giulia Prosdocimo, Maria Ines Gutierrez, et al. “Common Regulatory Pathways Mediate Activity of MicroRNAs Inducing Cardiomyocyte Proliferation.” Cell Reports. Elsevier, 2019. https://doi.org/10.1016/j.celrep.2019.05.005."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Consuelo","last_name":"Torrini","full_name":"Torrini, Consuelo"},{"full_name":"Cubero, Ryan J","orcid":"0000-0003-0002-1867","last_name":"Cubero","id":"850B2E12-9CD4-11E9-837F-E719E6697425","first_name":"Ryan J"},{"first_name":"Ellen","last_name":"Dirkx","full_name":"Dirkx, Ellen"},{"first_name":"Luca","full_name":"Braga, Luca","last_name":"Braga"},{"first_name":"Hashim","last_name":"Ali","full_name":"Ali, Hashim"},{"last_name":"Prosdocimo","full_name":"Prosdocimo, Giulia","first_name":"Giulia"},{"full_name":"Gutierrez, Maria Ines","last_name":"Gutierrez","first_name":"Maria Ines"},{"first_name":"Chiara","last_name":"Collesi","full_name":"Collesi, Chiara"},{"full_name":"Licastro, Danilo","last_name":"Licastro","first_name":"Danilo"},{"first_name":"Lorena","last_name":"Zentilin","full_name":"Zentilin, Lorena"},{"first_name":"Miguel","full_name":"Mano, Miguel","last_name":"Mano"},{"full_name":"Zacchigna, Serena","last_name":"Zacchigna","first_name":"Serena"},{"last_name":"Vendruscolo","full_name":"Vendruscolo, Michele","first_name":"Michele"},{"first_name":"Matteo","full_name":"Marsili, Matteo","last_name":"Marsili"},{"full_name":"Samal, Areejit","last_name":"Samal","first_name":"Areejit"},{"first_name":"Mauro","last_name":"Giacca","full_name":"Giacca, Mauro"}],"article_processing_charge":"Yes","external_id":{"pmid":["31141697"]},"title":"Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation","abstract":[{"text":"Loss of functional cardiomyocytes is a major determinant of heart failure after myocardial infarction. Previous high throughput screening studies have identified a few microRNAs (miRNAs) that can induce cardiomyocyte proliferation and stimulate cardiac regeneration in mice. Here, we show that all of the most effective of these miRNAs activate nuclear localization of the master transcriptional cofactor Yes-associated protein (YAP) and induce expression of YAP-responsive genes. In particular, miR-199a-3p directly targets two mRNAs coding for proteins impinging on the Hippo pathway, the upstream YAP inhibitory kinase TAOK1, and the E3 ubiquitin ligase β-TrCP, which leads to YAP degradation. Several of the pro-proliferative miRNAs (including miR-199a-3p) also inhibit filamentous actin depolymerization by targeting Cofilin2, a process that by itself activates YAP nuclear translocation. Thus, activation of YAP and modulation of the actin cytoskeleton are major components of the pro-proliferative action of miR-199a-3p and other miRNAs that induce cardiomyocyte proliferation.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","month":"05","intvolume":" 27","publication_identifier":{"issn":["2211-1247"]},"publication_status":"published","file":[{"checksum":"c5d855d07263bfec718673385d0ea2d7","file_id":"7129","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-11-26T22:30:43Z","file_name":"torrini_cellreports_2019.pdf","creator":"rcubero","date_updated":"2020-07-14T12:47:50Z","file_size":4650750}],"language":[{"iso":"eng"}],"volume":27,"issue":"9","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","_id":"7128","article_type":"original","type":"journal_article","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"status":"public","keyword":["cardiomyocyte","cell cycle","Cofilin2","cytoskeleton","Hippo","microRNA","regeneration","YAP"],"date_updated":"2021-01-12T08:11:56Z","extern":"1","ddc":["576"],"file_date_updated":"2020-07-14T12:47:50Z"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.00249"}],"month":"06","intvolume":" 2019","abstract":[{"text":"We show that statistical criticality, i.e. the occurrence of power law frequency distributions, arises in samples that are maximally informative about the underlying generating process. In order to reach this conclusion, we first identify the frequency with which different outcomes occur in a sample, as the variable carrying useful information on the generative process. The entropy of the frequency, that we call relevance, provides an upper bound to the number of informative bits. This differs from the entropy of the data, that we take as a measure of resolution. Samples that maximise relevance at a given resolution—that we call maximally informative samples—exhibit statistical criticality. In particular, Zipf's law arises at the optimal trade-off between resolution (i.e. compression) and relevance. As a byproduct, we derive a bound of the maximal number of parameters that can be estimated from a dataset, in the absence of prior knowledge on the generative model.\r\n\r\nFurthermore, we relate criticality to the statistical properties of the representation of the data generating process. We show that, as a consequence of the concentration property of the asymptotic equipartition property, representations that are maximally informative about the data generating process are characterised by an exponential distribution of energy levels. This arises from a principle of minimal entropy, that is conjugate of the maximum entropy principle in statistical mechanics. This explains why statistical criticality requires no parameter fine tuning in maximally informative samples.","lang":"eng"}],"oa_version":"Preprint","issue":"6","volume":2019,"publication_identifier":{"issn":["1742-5468"]},"publication_status":"published","language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","status":"public","keyword":["optimization under uncertainty","source coding","large deviation"],"_id":"7130","date_updated":"2021-01-12T08:11:57Z","extern":"1","quality_controlled":"1","publisher":"IOP Publishing","oa":1,"acknowledgement":"We acknowledge interesting discussions with M Abbott, E Aurell, J Barbier, R Monasson, T Mora, I Nemenman, N Tishby and R Zecchina. This research was supported by the Kavli Foundation and the Centre of Excellence scheme of the Research Council of Norway (Centre for Neural Computation) (RJC and YR), by the Basic Science Research Program through the National Research Foundation of Korea (NRF), funded by the Ministry of Education (2016R1D1A1B03932264) (JJ), and, in part, by the ICTP through the OEA-AC-98 (JS).","doi":"10.1088/1742-5468/ab16c8","date_published":"2019-06-17T00:00:00Z","date_created":"2019-11-26T22:36:09Z","year":"2019","day":"17","publication":"Journal of Statistical Mechanics: Theory and Experiment","article_number":"063402","author":[{"orcid":"0000-0003-0002-1867","full_name":"Cubero, Ryan J","last_name":"Cubero","id":"850B2E12-9CD4-11E9-837F-E719E6697425","first_name":"Ryan J"},{"first_name":"Junghyo","full_name":"Jo, Junghyo","last_name":"Jo"},{"first_name":"Matteo","full_name":"Marsili, Matteo","last_name":"Marsili"},{"first_name":"Yasser","last_name":"Roudi","full_name":"Roudi, Yasser"},{"full_name":"Song, Juyong","last_name":"Song","first_name":"Juyong"}],"external_id":{"arxiv":["1808.00249"]},"article_processing_charge":"No","title":"Statistical criticality arises in most informative representations","citation":{"ista":"Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. 2019. Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. 2019(6), 063402.","chicago":"Cubero, Ryan J, Junghyo Jo, Matteo Marsili, Yasser Roudi, and Juyong Song. “Statistical Criticality Arises in Most Informative Representations.” Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing, 2019. https://doi.org/10.1088/1742-5468/ab16c8.","short":"R.J. Cubero, J. Jo, M. Marsili, Y. Roudi, J. Song, Journal of Statistical Mechanics: Theory and Experiment 2019 (2019).","ieee":"R. J. Cubero, J. Jo, M. Marsili, Y. Roudi, and J. Song, “Statistical criticality arises in most informative representations,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2019, no. 6. IOP Publishing, 2019.","ama":"Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. 2019;2019(6). doi:10.1088/1742-5468/ab16c8","apa":"Cubero, R. J., Jo, J., Marsili, M., Roudi, Y., & Song, J. (2019). Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/ab16c8","mla":"Cubero, Ryan J., et al. “Statistical Criticality Arises in Most Informative Representations.” Journal of Statistical Mechanics: Theory and Experiment, vol. 2019, no. 6, 063402, IOP Publishing, 2019, doi:10.1088/1742-5468/ab16c8."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"status":"public","type":"journal_article","article_type":"original","_id":"7150","extern":"1","date_updated":"2021-01-12T08:12:05Z","month":"12","intvolume":" 32","main_file_link":[{"url":"https://arxiv.org/abs/1503.04963","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an O(n1−2/ω) round matrix multiplication algorithm, where ω<2.3728639 is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include:\r\n\r\n1. triangle and 4-cycle counting in O(n0.158) rounds, improving upon the O(n1/3) algorithm of Dolev et al. [DISC 2012],\r\n2. a (1+o(1))-approximation of all-pairs shortest paths in O(n0.158) rounds, improving upon the O~(n1/2)-round (2+o(1))-approximation algorithm given by Nanongkai [STOC 2014], and\r\n 3. computing the girth in O(n0.158) rounds, which is the first non-trivial solution in this model.\r\n \r\nIn addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles."}],"volume":32,"issue":"6","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0178-2770","1432-0452"]},"publication_status":"published","title":"Algebraic methods in the congested clique","author":[{"first_name":"Keren","full_name":"Censor-Hillel, Keren","last_name":"Censor-Hillel"},{"last_name":"Kaski","full_name":"Kaski, Petteri","first_name":"Petteri"},{"first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","last_name":"Korhonen","full_name":"Korhonen, Janne"},{"first_name":"Christoph","last_name":"Lenzen","full_name":"Lenzen, Christoph"},{"first_name":"Ami","full_name":"Paz, Ami","last_name":"Paz"},{"full_name":"Suomela, Jukka","last_name":"Suomela","first_name":"Jukka"}],"external_id":{"arxiv":["1503.04963"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, and J. Suomela, “Algebraic methods in the congested clique,” Distributed Computing, vol. 32, no. 6. Springer Nature, pp. 461–478, 2019.","short":"K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, J. Suomela, Distributed Computing 32 (2019) 461–478.","apa":"Censor-Hillel, K., Kaski, P., Korhonen, J., Lenzen, C., Paz, A., & Suomela, J. (2019). Algebraic methods in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-016-0270-2","ama":"Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. Algebraic methods in the congested clique. Distributed Computing. 2019;32(6):461-478. doi:10.1007/s00446-016-0270-2","mla":"Censor-Hillel, Keren, et al. “Algebraic Methods in the Congested Clique.” Distributed Computing, vol. 32, no. 6, Springer Nature, 2019, pp. 461–78, doi:10.1007/s00446-016-0270-2.","ista":"Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. 2019. Algebraic methods in the congested clique. Distributed Computing. 32(6), 461–478.","chicago":"Censor-Hillel, Keren, Petteri Kaski, Janne Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela. “Algebraic Methods in the Congested Clique.” Distributed Computing. Springer Nature, 2019. https://doi.org/10.1007/s00446-016-0270-2."},"quality_controlled":"1","publisher":"Springer Nature","oa":1,"doi":"10.1007/s00446-016-0270-2","date_published":"2019-12-01T00:00:00Z","date_created":"2019-12-05T09:49:49Z","page":"461-478","day":"01","publication":"Distributed Computing","year":"2019"}]