[{"file_date_updated":"2020-07-14T12:46:00Z","type":"conference","conference":{"name":"ESOP: European Symposium on Programming","start_date":"2018-04-16","location":"Thessaloniki, Greece","end_date":"2018-04-19"},"doi":"10.1007/978-3-319-89884-1_26","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","acknowledgement":"The research was partially supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games).","citation":{"short":"K. Chatterjee, A.K. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.","ama":"Chatterjee K, Goharshady AK, Velner Y. Quantitative analysis of smart contracts. In: Vol 10801. Springer; 2018:739-767. doi:10.1007/978-3-319-89884-1_26","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,” 10801:739–67. Springer, 2018. https://doi.org/10.1007/978-3-319-89884-1_26.","apa":"Chatterjee, K., Goharshady, A. K., & Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89884-1_26","ieee":"K. Chatterjee, A. K. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.","ista":"Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767.","mla":"Chatterjee, Krishnendu, et al. Quantitative Analysis of Smart Contracts. Vol. 10801, Springer, 2018, pp. 739–67, doi:10.1007/978-3-319-89884-1_26."},"department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"publisher":"Springer","article_processing_charge":"No","quality_controlled":"1","day":"01","intvolume":" 10801","date_published":"2018-04-01T00:00:00Z","publist_id":"7554","page":"739 - 767","ec_funded":1,"abstract":[{"text":"Smart contracts are computer programs that are executed by a network of mutually distrusting agents, without the need of an external trusted authority. Smart contracts handle and transfer assets of considerable value (in the form of crypto-currency like Bitcoin). Hence, it is crucial that their implementation is bug-free. We identify the utility (or expected payoff) of interacting with such smart contracts as the basic and canonical quantitative property for such contracts. We present a framework for such quantitative analysis of smart contracts. Such a formal framework poses new and novel research challenges in programming languages, as it requires modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior and modeling utilities which are not specified as standard temporal properties such as safety and termination. While game-theoretic incentives have been analyzed in the security community, their analysis has been restricted to the very special case of stateless games. However, to analyze smart contracts, stateful analysis is required as it must account for the different program states of the protocol. Our main contributions are as follows: we present (i)~a simplified programming language for smart contracts; (ii)~an automatic translation of the programs to state-based games; (iii)~an abstraction-refinement approach to solve such games; and (iv)~experimental results on real-world-inspired smart contracts.","lang":"eng"}],"volume":10801,"project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"year":"2018","date_created":"2018-12-11T11:45:45Z","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"oa_version":"Published Version","language":[{"iso":"eng"}],"_id":"311","title":"Quantitative analysis of smart contracts","scopus_import":"1","status":"public","file":[{"file_id":"5716","creator":"dernst","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2018_ESOP_Chatterjee.pdf","file_size":1394993,"checksum":"9c8a8338c571903b599b6ca93abd2cce","date_created":"2018-12-17T15:45:49Z","date_updated":"2020-07-14T12:46:00Z"}],"date_updated":"2026-05-15T22:31:16Z","publication_status":"published","ddc":["000"],"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir","full_name":"Goharshady, Amir"},{"last_name":"Velner","first_name":"Yaron","full_name":"Velner, Yaron"}],"month":"04"},{"publisher":"IEEE","department":[{"_id":"KrCh"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"A.K. Goharshady, A. Behrouz, K. Chatterjee, in:, Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–1348.","ama":"Goharshady AK, Behrouz A, Chatterjee K. Secure Credit Reporting on the Blockchain. In: Proceedings of the IEEE International Conference on Blockchain. IEEE; 2018:1343-1348. doi:10.1109/Cybermatics_2018.2018.00231","ista":"Goharshady AK, Behrouz A, Chatterjee K. 2018. Secure Credit Reporting on the Blockchain. Proceedings of the IEEE International Conference on Blockchain. IEEE International Conference on Blockchain, 1343–1348.","apa":"Goharshady, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE. https://doi.org/10.1109/Cybermatics_2018.2018.00231","chicago":"Goharshady, Amir Kafshdar, Ali Behrouz, and Krishnendu Chatterjee. “Secure Credit Reporting on the Blockchain.” In Proceedings of the IEEE International Conference on Blockchain, 1343–48. IEEE, 2018. https://doi.org/10.1109/Cybermatics_2018.2018.00231.","ieee":"A. K. Goharshady, A. Behrouz, and K. Chatterjee, “Secure Credit Reporting on the Blockchain,” in Proceedings of the IEEE International Conference on Blockchain, Halifax, Canada, 2018, pp. 1343–1348.","mla":"Goharshady, Amir Kafshdar, et al. “Secure Credit Reporting on the Blockchain.” Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–48, doi:10.1109/Cybermatics_2018.2018.00231."},"publication_identifier":{"isbn":["978-1-5386-7975-3 "]},"article_processing_charge":"No","arxiv":1,"day":"01","quality_controlled":"1","date_published":"2018-09-01T00:00:00Z","conference":{"location":"Halifax, Canada","end_date":"2018-08-03","name":"IEEE International Conference on Blockchain","start_date":"2018-07-30"},"type":"conference","file_date_updated":"2020-07-14T12:47:27Z","oa":1,"doi":"10.1109/Cybermatics_2018.2018.00231","has_accepted_license":"1","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","_id":"6340","publication":"Proceedings of the IEEE International Conference on Blockchain","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"blockchain2018.pdf","creator":"akafshda","file_id":"6341","date_created":"2019-04-18T10:36:39Z","date_updated":"2020-07-14T12:47:27Z","file_size":624338,"checksum":"b25c9bb7cf6e7e6634e692d26d41ead8"}],"status":"public","scopus_import":"1","title":"Secure Credit Reporting on the Blockchain","ddc":["000"],"publication_status":"published","date_updated":"2026-05-15T22:31:16Z","author":[{"full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Behrouz","full_name":"Behrouz, Ali","first_name":"Ali"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"}],"month":"09","abstract":[{"text":"We present a secure approach for maintaining andreporting credit history records on the Blockchain. Our ap-proach removes third-parties such as credit reporting agen-cies from the lending process and replaces them with smartcontracts. This allows customers to interact directly with thelenders or banks while ensuring the integrity, unmalleabilityand privacy of their credit data. Additionally, each customerhas full control over complete or selective disclosure of hercredit records, eliminating the risk of privacy violations or databreaches. Moreover, our approach provides strong guaranteesfor the lenders as well. A lender can check both correctness andcompleteness of the credit data disclosed to her. This is the firstapproach that can perform all credit reporting tasks withouta central authority or changing the financial mechanisms*.","lang":"eng"}],"ec_funded":1,"page":"1343-1348","year":"2018","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"isi":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"date_created":"2019-04-18T10:37:35Z","external_id":{"arxiv":["1805.09104"],"isi":["000481634500196"]},"oa_version":"Submitted Version"},{"abstract":[{"lang":"eng","text":"We study algorithmic questions wrt algebraic path properties in concurrent systems, where the transitions of the system are labeled from a complete, closed semiring. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\nOur main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.\r\n"}],"ec_funded":1,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"volume":40,"isi":1,"year":"2018","external_id":{"isi":["000444694800001"],"arxiv":["1510.07565"]},"date_created":"2019-02-14T14:31:52Z","related_material":{"record":[{"relation":"earlier_version","id":"5441","status":"public"},{"status":"public","relation":"earlier_version","id":"5442"},{"status":"public","relation":"earlier_version","id":"1437"},{"status":"public","relation":"dissertation_contains","id":"8934"}]},"oa_version":"Preprint","_id":"6009","language":[{"iso":"eng"}],"publication":"ACM Transactions on Programming Languages and Systems","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","scopus_import":"1","status":"public","date_updated":"2026-05-15T22:31:16Z","publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","orcid":"0000-0003-4783-0389"},{"orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"}],"month":"08","main_file_link":[{"url":"https://arxiv.org/abs/1510.07565","open_access":"1"}],"type":"journal_article","oa":1,"doi":"10.1145/3210257","article_number":"9","corr_author":"1","department":[{"_id":"KrCh"}],"citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 2018;40(3). doi:10.1145/3210257","short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).","mla":"Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, 9, Association for Computing Machinery, 2018, doi:10.1145/3210257.","ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9.","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery, 2018.","apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery. https://doi.org/10.1145/3210257","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery, 2018. https://doi.org/10.1145/3210257."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3","publisher":"Association for Computing Machinery","publication_identifier":{"issn":["0164-0925"]},"article_processing_charge":"No","arxiv":1,"day":"01","quality_controlled":"1","date_published":"2018-08-01T00:00:00Z","intvolume":" 40"},{"page":"4700-4707","ec_funded":1,"abstract":[{"lang":"eng","text":"We consider the stochastic shortest path (SSP)problem for succinct Markov decision processes(MDPs), where the MDP consists of a set of vari-ables, and a set of nondeterministic rules that up-date the variables. First, we show that several ex-amples from the AI literature can be modeled assuccinct MDPs. Then we present computationalapproaches for upper and lower bounds for theSSP problem: (a) for computing upper bounds, ourmethod is polynomial-time in the implicit descrip-tion of the MDP; (b) for lower bounds, we present apolynomial-time (in the size of the implicit descrip-tion) reduction to quadratic programming. Our ap-proach is applicable even to infinite-state MDPs.Finally, we present experimental results to demon-strate the effectiveness of our approach on severalclassical examples from the AI literature."}],"volume":2018,"isi":1,"project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"year":"2018","date_created":"2019-02-13T13:26:27Z","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"external_id":{"arxiv":["1804.08984"],"isi":["000764175404118"]},"oa_version":"Preprint","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","language":[{"iso":"eng"}],"_id":"5977","title":"Computational approaches for stochastic shortest path on succinct MDPs","scopus_import":"1","status":"public","date_updated":"2026-05-15T22:31:17Z","publication_status":"published","month":"07","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei","first_name":"Hongfei"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir"},{"last_name":"Okati","full_name":"Okati, Nastaran","first_name":"Nastaran"}],"type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/1804.08984","open_access":"1"}],"conference":{"start_date":"2018-07-13","name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","location":"Stockholm, Sweden"},"doi":"10.24963/ijcai.2018/653","oa":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018, IJCAI, 2018, pp. 4700–07, doi:10.24963/ijcai.2018/653.","ista":"Chatterjee K, Fu H, Goharshady AK, Okati N. 2018. Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4700–4707.","apa":"Chatterjee, K., Fu, H., Goharshady, A. K., & Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/653","ieee":"K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018:4700–4707. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/653.","ama":"Chatterjee K, Fu H, Goharshady AK, Okati N. Computational approaches for stochastic shortest path on succinct MDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018. IJCAI; 2018:4700-4707. doi:10.24963/ijcai.2018/653","short":"K. Chatterjee, H. Fu, A.K. Goharshady, N. Okati, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4700–4707."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"publisher":"IJCAI","article_processing_charge":"No","publication_identifier":{"isbn":["9780999241127"],"issn":["1045-0823"]},"quality_controlled":"1","day":"17","arxiv":1,"intvolume":" 2018","date_published":"2018-07-17T00:00:00Z"},{"day":"05","quality_controlled":"1","date_published":"2018-01-05T00:00:00Z","intvolume":" 8","publisher":"Bio-protocol","issue":"1","citation":{"ama":"Li L, Krens G, Fendrych M, Friml J. Real-time analysis of auxin response, cell wall pH and elongation in Arabidopsis thaliana Hypocotyls. Bio-protocol. 2018;8(1). doi:10.21769/BioProtoc.2685","short":"L. Li, G. Krens, M. Fendrych, J. Friml, Bio-Protocol 8 (2018).","mla":"Li, Lanxin, et al. “Real-Time Analysis of Auxin Response, Cell Wall PH and Elongation in Arabidopsis Thaliana Hypocotyls.” Bio-Protocol, vol. 8, no. 1, Bio-protocol, 2018, doi:10.21769/BioProtoc.2685.","ista":"Li L, Krens G, Fendrych M, Friml J. 2018. Real-time analysis of auxin response, cell wall pH and elongation in Arabidopsis thaliana Hypocotyls. Bio-protocol. 8(1).","chicago":"Li, Lanxin, Gabriel Krens, Matyas Fendrych, and Jiří Friml. “Real-Time Analysis of Auxin Response, Cell Wall PH and Elongation in Arabidopsis Thaliana Hypocotyls.” Bio-Protocol. Bio-protocol, 2018. https://doi.org/10.21769/BioProtoc.2685.","ieee":"L. Li, G. Krens, M. Fendrych, and J. Friml, “Real-time analysis of auxin response, cell wall pH and elongation in Arabidopsis thaliana Hypocotyls,” Bio-protocol, vol. 8, no. 1. Bio-protocol, 2018.","apa":"Li, L., Krens, G., Fendrych, M., & Friml, J. (2018). Real-time analysis of auxin response, cell wall pH and elongation in Arabidopsis thaliana Hypocotyls. Bio-Protocol. Bio-protocol. https://doi.org/10.21769/BioProtoc.2685"},"department":[{"_id":"JiFr"},{"_id":"Bio"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2331-8325"]},"pubrep_id":"970","article_processing_charge":"No","acknowledgement":"This protocol was adapted from Fendrych et al., 2016. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385, and Austrian Science Fund (FWF) [M 2128-B21]. ","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","type":"journal_article","file_date_updated":"2020-07-14T12:46:29Z","oa":1,"doi":"10.21769/BioProtoc.2685","ddc":["576","581"],"publication_status":"published","date_updated":"2026-05-15T22:31:18Z","month":"01","author":[{"id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","last_name":"Li","first_name":"Lanxin","orcid":"0000-0002-5607-272X","full_name":"Li, Lanxin"},{"first_name":"Gabriel","orcid":"0000-0003-4761-5996","full_name":"Krens, Gabriel","id":"2B819732-F248-11E8-B48F-1D18A9856A87","last_name":"Krens"},{"last_name":"Fendrych","id":"43905548-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9767-8699","first_name":"Matyas","full_name":"Fendrych, Matyas"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí"}],"_id":"442","language":[{"iso":"eng"}],"publication":"Bio-protocol","article_type":"original","status":"public","file":[{"date_updated":"2020-07-14T12:46:29Z","date_created":"2018-12-12T10:17:43Z","checksum":"6644ba698206eda32b0abf09128e63e3","file_size":11352389,"file_name":"IST-2018-970-v1+1_2018_Lanxin_Real-time_analysis.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","creator":"system","file_id":"5299"}],"title":"Real-time analysis of auxin response, cell wall pH and elongation in Arabidopsis thaliana Hypocotyls","date_created":"2018-12-11T11:46:30Z","related_material":{"record":[{"relation":"dissertation_contains","id":"10083","status":"public"}]},"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The rapid auxin-triggered growth of the Arabidopsis hypocotyls involves the nuclear TIR1/AFB-Aux/IAA signaling and is accompanied by acidification of the apoplast and cell walls (Fendrych et al., 2016). Here, we describe in detail the method for analysis of the elongation and the TIR1/AFB-Aux/IAA-dependent auxin response in hypocotyl segments as well as the determination of relative values of the cell wall pH."}],"ec_funded":1,"publist_id":"7381","year":"2018","volume":8,"project":[{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}]},{"publication_status":"published","date_updated":"2025-09-22T09:59:49Z","month":"08","author":[{"last_name":"Sun","full_name":"Sun, Wuping","first_name":"Wuping"},{"last_name":"Zhai","id":"34009CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Ming-Zhu","full_name":"Zhai, Ming-Zhu"},{"first_name":"Da","full_name":"Li, Da","last_name":"Li"},{"last_name":"Zhou","full_name":"Zhou, Yiming","first_name":"Yiming"},{"first_name":"Nana","full_name":"Chen, Nana","last_name":"Chen"},{"last_name":"Guo","full_name":"Guo, Ming","first_name":"Ming"},{"full_name":"Zhou, Shisheng","first_name":"Shisheng","last_name":"Zhou"}],"_id":"1146","publication":"Clinical Nutrition","language":[{"iso":"eng"}],"scopus_import":"1","status":"public","title":"Comparison of the effects of nicotinic acid and nicotinamide degradation on plasma betaine and choline levels","external_id":{"isi":["000404315200029"]},"date_created":"2018-12-11T11:50:24Z","oa_version":"None","abstract":[{"lang":"eng","text":"Aim: The present study was to compare the effects of nicotinic acid and nicotinamide on the plasma methyl donors, choline and betaine. Methods: Thirty adult subjects were randomly divided into three groups of equal size, and orally received purified water (C group), nicotinic acid (300 mg, NA group) or nicotinamide (300 mg, NM group). Plasma nicotinamide, N 1-methylnicotinamide, homocysteine, betaine and choline levels before and 1.5-h and 3-h post-dosing, plasma normetanephrine and metanephrine concentrations at 3-h post-dosing, and the urinary excretion of N 1-methyl-2-pyridone-5-carboxamide during the test period were examined. Results: The level of 3-h plasma nicotinamide, N 1-methylnicotinamide, homocysteine, the urinary excretion of N 1-methyl-2-pyridone-5-carboxamide and pulse pressure (PP) in the NM group was 221%, 3972%, 61%, 1728% and 21.2% higher than that of the control group (P < 0.01, except homocysteine and PP P < 0.05), while the 3-h plasma betaine, normetanephrine and metanephrine level in the NM group was 24.4%, 9.4% and 11.7% lower (P < 0.05, except betaine P < 0.01), without significant difference in choline levels. Similar but less pronounced changes were observed in the NA group, with a lower level of 3-h plasma N 1-methylnicotinamide (1.90 ± 0.20 μmol/l vs. 3.62 ± 0.27 μmol/l, P < 0.01) and homocysteine (12.85 ± 1.39 μmol/l vs. 18.08 ± 1.02 μmol/l, P < 0.05) but a higher level of betaine (27.44 ± 0.71 μmol/l vs. 23.52 ± 0.61 μmol/l, P < 0.05) than that of the NM group. Conclusion: The degradation of nicotinamide consumes more betaine than that of nicotinic acid at identical doses. This difference should be taken into consideration in niacin fortification. © 2016 Elsevier Ltd and European Society for Clinical Nutrition and Metabolism."}],"page":"1136-1142","publist_id":"6212","year":"2017","volume":36,"isi":1,"day":"01","quality_controlled":"1","date_published":"2017-08-01T00:00:00Z","intvolume":" 36","issue":"4","publisher":"Elsevier","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"mla":"Sun, Wuping, et al. “Comparison of the Effects of Nicotinic Acid and Nicotinamide Degradation on Plasma Betaine and Choline Levels.” Clinical Nutrition, vol. 36, no. 4, Elsevier, 2017, pp. 1136–42, doi:10.1016/j.clnu.2016.07.016.","ista":"Sun W, Zhai M-Z, Li D, Zhou Y, Chen N, Guo M, Zhou S. 2017. Comparison of the effects of nicotinic acid and nicotinamide degradation on plasma betaine and choline levels. Clinical Nutrition. 36(4), 1136–1142.","apa":"Sun, W., Zhai, M.-Z., Li, D., Zhou, Y., Chen, N., Guo, M., & Zhou, S. (2017). Comparison of the effects of nicotinic acid and nicotinamide degradation on plasma betaine and choline levels. Clinical Nutrition. Elsevier. https://doi.org/10.1016/j.clnu.2016.07.016","ieee":"W. Sun et al., “Comparison of the effects of nicotinic acid and nicotinamide degradation on plasma betaine and choline levels,” Clinical Nutrition, vol. 36, no. 4. Elsevier, pp. 1136–1142, 2017.","chicago":"Sun, Wuping, Ming-Zhu Zhai, Da Li, Yiming Zhou, Nana Chen, Ming Guo, and Shisheng Zhou. “Comparison of the Effects of Nicotinic Acid and Nicotinamide Degradation on Plasma Betaine and Choline Levels.” Clinical Nutrition. Elsevier, 2017. https://doi.org/10.1016/j.clnu.2016.07.016.","ama":"Sun W, Zhai M-Z, Li D, et al. Comparison of the effects of nicotinic acid and nicotinamide degradation on plasma betaine and choline levels. Clinical Nutrition. 2017;36(4):1136-1142. doi:10.1016/j.clnu.2016.07.016","short":"W. Sun, M.-Z. Zhai, D. Li, Y. Zhou, N. Chen, M. Guo, S. Zhou, Clinical Nutrition 36 (2017) 1136–1142."},"department":[{"_id":"RySh"}],"publication_identifier":{"issn":["0261-5614"]},"article_processing_charge":"No","acknowledgement":"We thank all the participants for their contribution to this study and volunteers from the Nursing School of Dalian University for their supporting to collect blood and urine samples of the participants. We also thank Dr. Yasunori Takayama from National Institute for Physiological Sciences of Japan for his kind help.","type":"journal_article","doi":"10.1016/j.clnu.2016.07.016"},{"volume":18,"isi":1,"year":"2017","abstract":[{"text":"We propose a new memetic strategy that can solve the multi-physics, complex inverse problems, formulated as the multi-objective optimization ones, in which objectives are misfits between the measured and simulated states of various governing processes. The multi-deme structure of the strategy allows for both, intensive, relatively cheap exploration with a moderate accuracy and more accurate search many regions of Pareto set in parallel. The special type of selection operator prefers the coherent alternative solutions, eliminating artifacts appearing in the particular processes. The additional accuracy increment is obtained by the parallel convex searches applied to the local scalarizations of the misfit vector. The strategy is dedicated for solving ill-conditioned problems, for which inverting the single physical process can lead to the ambiguous results. The skill of the selection in artifact elimination is shown on the benchmark problem, while the whole strategy was applied for identification of oil deposits, where the misfits are related to various frequencies of the magnetic and electric waves of the magnetotelluric measurements. 2016 Elsevier B.V.","lang":"eng"}],"publist_id":"6206","page":"85 - 94","oa_version":"Submitted Version","external_id":{"isi":["000393528700009"]},"date_created":"2018-12-11T11:50:26Z","title":"A multi objective memetic inverse solver reinforced by local optimization methods","file":[{"date_updated":"2019-01-18T08:43:16Z","success":1,"date_created":"2019-01-18T08:43:16Z","file_size":1083911,"file_name":"2016_jocs_ewa.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","creator":"dernst","file_id":"5842"}],"status":"public","scopus_import":"1","_id":"1152","language":[{"iso":"eng"}],"publication":"Journal of Computational Science","author":[{"id":"47794CF0-F248-11E8-B48F-1D18A9856A87","last_name":"Gajda-Zagorska","full_name":"Gajda-Zagorska, Ewa P","first_name":"Ewa P"},{"first_name":"Robert","full_name":"Schaefer, Robert","last_name":"Schaefer"},{"last_name":"Smołka","first_name":"Maciej","full_name":"Smołka, Maciej"},{"last_name":"Pardo","first_name":"David","full_name":"Pardo, David"},{"last_name":"Alvarez Aramberri","first_name":"Julen","full_name":"Alvarez Aramberri, Julen"}],"month":"01","ddc":["000"],"date_updated":"2025-07-10T11:50:11Z","publication_status":"published","oa":1,"doi":"10.1016/j.jocs.2016.06.007","file_date_updated":"2019-01-18T08:43:16Z","type":"journal_article","has_accepted_license":"1","publication_identifier":{"issn":["1877-7503"]},"article_processing_charge":"No","department":[{"_id":"ChWo"}],"citation":{"ista":"Gajda-Zagorska EP, Schaefer R, Smołka M, Pardo D, Alvarez Aramberri J. 2017. A multi objective memetic inverse solver reinforced by local optimization methods. Journal of Computational Science. 18, 85–94.","ieee":"E. P. Gajda-Zagorska, R. Schaefer, M. Smołka, D. Pardo, and J. Alvarez Aramberri, “A multi objective memetic inverse solver reinforced by local optimization methods,” Journal of Computational Science, vol. 18. Elsevier, pp. 85–94, 2017.","apa":"Gajda-Zagorska, E. P., Schaefer, R., Smołka, M., Pardo, D., & Alvarez Aramberri, J. (2017). A multi objective memetic inverse solver reinforced by local optimization methods. Journal of Computational Science. Elsevier. https://doi.org/10.1016/j.jocs.2016.06.007","chicago":"Gajda-Zagorska, Ewa P, Robert Schaefer, Maciej Smołka, David Pardo, and Julen Alvarez Aramberri. “A Multi Objective Memetic Inverse Solver Reinforced by Local Optimization Methods.” Journal of Computational Science. Elsevier, 2017. https://doi.org/10.1016/j.jocs.2016.06.007.","mla":"Gajda-Zagorska, Ewa P., et al. “A Multi Objective Memetic Inverse Solver Reinforced by Local Optimization Methods.” Journal of Computational Science, vol. 18, Elsevier, 2017, pp. 85–94, doi:10.1016/j.jocs.2016.06.007.","short":"E.P. Gajda-Zagorska, R. Schaefer, M. Smołka, D. Pardo, J. Alvarez Aramberri, Journal of Computational Science 18 (2017) 85–94.","ama":"Gajda-Zagorska EP, Schaefer R, Smołka M, Pardo D, Alvarez Aramberri J. A multi objective memetic inverse solver reinforced by local optimization methods. Journal of Computational Science. 2017;18:85-94. doi:10.1016/j.jocs.2016.06.007"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","date_published":"2017-01-01T00:00:00Z","intvolume":" 18","day":"01","quality_controlled":"1"},{"month":"01","author":[{"last_name":"Steenackers","first_name":"Ward","full_name":"Steenackers, Ward"},{"last_name":"Klíma","full_name":"Klíma, Petr","first_name":"Petr"},{"last_name":"Quareshy","first_name":"Mussa","full_name":"Quareshy, Mussa"},{"last_name":"Cesarino","first_name":"Igor","full_name":"Cesarino, Igor"},{"first_name":"Robert","full_name":"Kumpf, Robert","last_name":"Kumpf"},{"full_name":"Corneillie, Sander","first_name":"Sander","last_name":"Corneillie"},{"last_name":"Araújo","first_name":"Pedro","full_name":"Araújo, Pedro"},{"last_name":"Viaene","first_name":"Tom","full_name":"Viaene, Tom"},{"full_name":"Goeminne, Geert","first_name":"Geert","last_name":"Goeminne"},{"full_name":"Nowack, Moritz","first_name":"Moritz","last_name":"Nowack"},{"first_name":"Karin","full_name":"Ljung, Karin","last_name":"Ljung"},{"first_name":"Jirí","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml"},{"full_name":"Blakeslee, Joshua","first_name":"Joshua","last_name":"Blakeslee"},{"last_name":"Novák","first_name":"Ondřej","full_name":"Novák, Ondřej"},{"first_name":"Eva","full_name":"Zažímalová, Eva","last_name":"Zažímalová"},{"last_name":"Napier","first_name":"Richard","full_name":"Napier, Richard"},{"full_name":"Boerjan, Wout","first_name":"Wout","last_name":"Boerjan"},{"last_name":"Vanholme","first_name":"Bartel","full_name":"Vanholme, Bartel"}],"ddc":["580"],"date_updated":"2025-04-15T07:48:02Z","publication_status":"published","article_type":"original","title":"Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation","status":"public","scopus_import":"1","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2016_PlantPhysi_Steenackers.pdf","file_id":"7040","creator":"dernst","date_created":"2019-11-18T16:12:25Z","date_updated":"2020-07-14T12:44:36Z","checksum":"fd4d1cfe7ed70e54bb12ae3881f3fb91","file_size":4109142}],"_id":"1159","publication":"Plant Physiology","language":[{"iso":"eng"}],"oa_version":"Submitted Version","external_id":{"isi":["000394135800041"],"pmid":["27837086"]},"date_created":"2018-12-11T11:50:28Z","project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300"}],"isi":1,"volume":173,"year":"2017","abstract":[{"text":"Auxin steers numerous physiological processes in plants, making the tight control of its endogenous levels and spatiotemporal distribution a necessity. This regulation is achieved by different mechanisms, including auxin biosynthesis, metabolic conversions, degradation, and transport. Here, we introduce cis-cinnamic acid (c-CA) as a novel and unique addition to a small group of endogenous molecules affecting in planta auxin concentrations. c-CA is the photo-isomerization product of the phenylpropanoid pathway intermediate trans-CA (t-CA). When grown on c-CA-containing medium, an evolutionary diverse set of plant species were shown to exhibit phenotypes characteristic for high auxin levels, including inhibition of primary root growth, induction of root hairs, and promotion of adventitious and lateral rooting. By molecular docking and receptor binding assays, we showed that c-CA itself is neither an auxin nor an anti-auxin, and auxin profiling data revealed that c-CA does not significantly interfere with auxin biosynthesis. Single cell-based auxin accumulation assays showed that c-CA, and not t-CA, is a potent inhibitor of auxin efflux. Auxin signaling reporters detected changes in spatiotemporal distribution of the auxin response along the root of c-CA-treated plants, and long-distance auxin transport assays showed no inhibition of rootward auxin transport. Overall, these results suggest that the phenotypes of c-CA-treated plants are the consequence of a local change in auxin accumulation, induced by the inhibition of auxin efflux. This work reveals a novel mechanism how plants may regulate auxin levels and adds a novel, naturally occurring molecule to the chemical toolbox for the studies of auxin homeostasis.","lang":"eng"}],"ec_funded":1,"publist_id":"6199","page":"552 - 565","date_published":"2017-01-01T00:00:00Z","intvolume":" 173","day":"01","quality_controlled":"1","publication_identifier":{"issn":["0032-0889"]},"article_processing_charge":"No","department":[{"_id":"JiFr"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Steenackers, Ward, et al. “Cis-Cinnamic Acid Is a Novel Natural Auxin Efflux Inhibitor That Promotes Lateral Root Formation.” Plant Physiology, vol. 173, no. 1, American Society of Plant Biologists, 2017, pp. 552–65, doi:10.1104/pp.16.00943.","ieee":"W. Steenackers et al., “Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation,” Plant Physiology, vol. 173, no. 1. American Society of Plant Biologists, pp. 552–565, 2017.","chicago":"Steenackers, Ward, Petr Klíma, Mussa Quareshy, Igor Cesarino, Robert Kumpf, Sander Corneillie, Pedro Araújo, et al. “Cis-Cinnamic Acid Is a Novel Natural Auxin Efflux Inhibitor That Promotes Lateral Root Formation.” Plant Physiology. American Society of Plant Biologists, 2017. https://doi.org/10.1104/pp.16.00943.","apa":"Steenackers, W., Klíma, P., Quareshy, M., Cesarino, I., Kumpf, R., Corneillie, S., … Vanholme, B. (2017). Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. Plant Physiology. American Society of Plant Biologists. https://doi.org/10.1104/pp.16.00943","ista":"Steenackers W, Klíma P, Quareshy M, Cesarino I, Kumpf R, Corneillie S, Araújo P, Viaene T, Goeminne G, Nowack M, Ljung K, Friml J, Blakeslee J, Novák O, Zažímalová E, Napier R, Boerjan W, Vanholme B. 2017. Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. Plant Physiology. 173(1), 552–565.","ama":"Steenackers W, Klíma P, Quareshy M, et al. Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. Plant Physiology. 2017;173(1):552-565. doi:10.1104/pp.16.00943","short":"W. Steenackers, P. Klíma, M. Quareshy, I. Cesarino, R. Kumpf, S. Corneillie, P. Araújo, T. Viaene, G. Goeminne, M. Nowack, K. Ljung, J. Friml, J. Blakeslee, O. Novák, E. Zažímalová, R. Napier, W. Boerjan, B. Vanholme, Plant Physiology 173 (2017) 552–565."},"publisher":"American Society of Plant Biologists","issue":"1","has_accepted_license":"1","oa":1,"doi":"10.1104/pp.16.00943","file_date_updated":"2020-07-14T12:44:36Z","type":"journal_article","pmid":1},{"publication_identifier":{"issn":["2045-2322"]},"article_processing_charge":"No","pubrep_id":"743","citation":{"short":"S. Altmeyer, Y. Do, Y. Lai, Scientific Reports 7 (2017).","ama":"Altmeyer S, Do Y, Lai Y. Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. Scientific Reports. 2017;7. doi:10.1038/srep40012","chicago":"Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Dynamics of Ferrofluidic Flow in the Taylor-Couette System with a Small Aspect Ratio.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/srep40012.","apa":"Altmeyer, S., Do, Y., & Lai, Y. (2017). Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep40012","ieee":"S. Altmeyer, Y. Do, and Y. Lai, “Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio,” Scientific Reports, vol. 7. Nature Publishing Group, 2017.","ista":"Altmeyer S, Do Y, Lai Y. 2017. Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. Scientific Reports. 7, 40012.","mla":"Altmeyer, Sebastian, et al. “Dynamics of Ferrofluidic Flow in the Taylor-Couette System with a Small Aspect Ratio.” Scientific Reports, vol. 7, 40012, Nature Publishing Group, 2017, doi:10.1038/srep40012."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"BjHo"}],"publisher":"Nature Publishing Group","date_published":"2017-01-06T00:00:00Z","intvolume":" 7","day":"06","quality_controlled":"1","oa":1,"doi":"10.1038/srep40012","file_date_updated":"2020-07-14T12:44:36Z","type":"journal_article","has_accepted_license":"1","article_number":"40012","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio","scopus_import":"1","status":"public","file":[{"date_updated":"2020-07-14T12:44:36Z","date_created":"2018-12-12T10:10:16Z","file_size":4546835,"checksum":"694aa70399444570825099c1a7ec91f2","file_name":"IST-2017-743-v1+1_srep40012.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"4802","creator":"system"}],"_id":"1160","publication":"Scientific Reports","language":[{"iso":"eng"}],"month":"01","author":[{"orcid":"0000-0001-5964-0203","first_name":"Sebastian","full_name":"Altmeyer, Sebastian","last_name":"Altmeyer","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Do, Younghae","first_name":"Younghae","last_name":"Do"},{"first_name":"Ying","full_name":"Lai, Ying","last_name":"Lai"}],"ddc":["532"],"date_updated":"2025-07-10T11:50:13Z","publication_status":"published","volume":7,"isi":1,"year":"2017","abstract":[{"lang":"eng","text":"We investigate fundamental nonlinear dynamics of ferrofluidic Taylor-Couette flow - flow confined be-tween two concentric independently rotating cylinders - consider small aspect ratio by solving the ferro-hydrodynamical equations, carrying out systematic bifurcation analysis. Without magnetic field, we find steady flow patterns, previously observed with a simple fluid, such as those containing normal one- or two vortex cells, as well as anomalous one-cell and twin-cell flow states. However, when a symmetry-breaking transverse magnetic field is present, all flow states exhibit stimulated, finite two-fold mode. Various bifurcations between steady and unsteady states can occur, corresponding to the transitions between the two-cell and one-cell states. While unsteady, axially oscillating flow states can arise, we also detect the emergence of new unsteady flow states. In particular, we uncover two new states: one contains only the azimuthally oscillating solution in the configuration of the twin-cell flow state, and an-other a rotating flow state. Topologically, these flow states are a limit cycle and a quasiperiodic solution on a two-torus, respectively. Emergence of new flow states in addition to observed ones with classical fluid, indicates that richer but potentially more controllable dynamics in ferrofluidic flows, as such flow states depend on the external magnetic field."}],"publist_id":"6198","oa_version":"Published Version","external_id":{"isi":["000391269700001"]},"date_created":"2018-12-11T11:50:28Z"},{"quality_controlled":"1","day":"09","OA_place":"publisher","intvolume":" 27","date_published":"2017-01-09T00:00:00Z","publisher":"Cell Press","issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiSi"}],"citation":{"ista":"Müller J, Sixt MK. 2017. Cell migration: Making the waves. Current Biology. 27(1), R24–R25.","ieee":"J. Müller and M. K. Sixt, “Cell migration: Making the waves,” Current Biology, vol. 27, no. 1. Cell Press, pp. R24–R25, 2017.","chicago":"Müller, Jan, and Michael K Sixt. “Cell Migration: Making the Waves.” Current Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2016.11.035.","apa":"Müller, J., & Sixt, M. K. (2017). Cell migration: Making the waves. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2016.11.035","mla":"Müller, Jan, and Michael K. Sixt. “Cell Migration: Making the Waves.” Current Biology, vol. 27, no. 1, Cell Press, 2017, pp. R24–25, doi:10.1016/j.cub.2016.11.035.","short":"J. Müller, M.K. Sixt, Current Biology 27 (2017) R24–R25.","ama":"Müller J, Sixt MK. Cell migration: Making the waves. Current Biology. 2017;27(1):R24-R25. doi:10.1016/j.cub.2016.11.035"},"article_processing_charge":"No","publication_identifier":{"issn":["09609822"]},"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cub.2016.11.035"}],"doi":"10.1016/j.cub.2016.11.035","oa":1,"publication_status":"published","date_updated":"2025-06-26T09:01:10Z","OA_type":"free access","author":[{"id":"AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D","last_name":"Müller","full_name":"Müller, Jan","first_name":"Jan"},{"full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"month":"01","language":[{"iso":"eng"}],"publication":"Current Biology","_id":"1161","scopus_import":"1","status":"public","title":"Cell migration: Making the waves","article_type":"letter_note","date_created":"2018-12-11T11:50:29Z","external_id":{"isi":["000391902500010"]},"oa_version":"Published Version","page":"R24 - R25","publist_id":"6197","abstract":[{"lang":"eng","text":"Coordinated changes of cell shape are often the result of the excitable, wave-like dynamics of the actin cytoskeleton. New work shows that, in migrating cells, protrusion waves arise from mechanochemical crosstalk between adhesion sites, membrane tension and the actin protrusive machinery."}],"year":"2017","isi":1,"volume":27},{"article_number":"024506","main_file_link":[{"url":"https://arxiv.org/abs/1606.03247","open_access":"1"}],"type":"journal_article","oa":1,"doi":"10.1103/PhysRevB.95.024506","day":"13","arxiv":1,"quality_controlled":"1","date_published":"2017-01-13T00:00:00Z","intvolume":" 95","citation":{"mla":"Spałek, Jozef, et al. “Universal Properties of High Temperature Superconductors from Real Space Pairing T-J-U Model and Its Quantitative Comparison with Experiment.” Physical Review B - Condensed Matter and Materials Physics, vol. 95, no. 2, 024506, American Physical Society, 2017, doi:10.1103/PhysRevB.95.024506.","ista":"Spałek J, Zegrodnik M, Kaczmarczyk J. 2017. Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. Physical Review B - Condensed Matter and Materials Physics. 95(2), 024506.","apa":"Spałek, J., Zegrodnik, M., & Kaczmarczyk, J. (2017). Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. Physical Review B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.95.024506","ieee":"J. Spałek, M. Zegrodnik, and J. Kaczmarczyk, “Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment,” Physical Review B - Condensed Matter and Materials Physics, vol. 95, no. 2. American Physical Society, 2017.","chicago":"Spałek, Jozef, Michał Zegrodnik, and Jan Kaczmarczyk. “Universal Properties of High Temperature Superconductors from Real Space Pairing T-J-U Model and Its Quantitative Comparison with Experiment.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.95.024506.","ama":"Spałek J, Zegrodnik M, Kaczmarczyk J. Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. Physical Review B - Condensed Matter and Materials Physics. 2017;95(2). doi:10.1103/PhysRevB.95.024506","short":"J. Spałek, M. Zegrodnik, J. Kaczmarczyk, Physical Review B - Condensed Matter and Materials Physics 95 (2017)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","issue":"2","publication_identifier":{"issn":["2469-9950"]},"article_processing_charge":"No","date_created":"2018-12-11T11:50:29Z","external_id":{"isi":["000391852800006"],"arxiv":["1606.03247"]},"oa_version":"Submitted Version","ec_funded":1,"abstract":[{"text":"Selected universal experimental properties of high-temperature superconducting (HTS) cuprates have been singled out in the last decade. One of the pivotal challenges in this field is the designation of a consistent interpretation framework within which we can describe quantitatively the universal features of those systems. Here we analyze in a detailed manner the principal experimental data and compare them quantitatively with the approach based on a single-band model of strongly correlated electrons supplemented with strong antiferromagnetic (super)exchange interaction (the so-called t−J−U model). The model rationale is provided by estimating its microscopic parameters on the basis of the three-band approach for the Cu-O plane. We use our original full Gutzwiller wave-function solution by going beyond the renormalized mean-field theory (RMFT) in a systematic manner. Our approach reproduces very well the observed hole doping (δ) dependence of the kinetic-energy gain in the superconducting phase, one of the principal non-Bardeen-Cooper-Schrieffer features of the cuprates. The calculated Fermi velocity in the nodal direction is practically δ-independent and its universal value agrees very well with that determined experimentally. Also, a weak doping dependence of the Fermi wave vector leads to an almost constant value of the effective mass in a pure superconducting phase which is both observed in experiment and reproduced within our approach. An assessment of the currently used models (t−J, Hubbard) is carried out and the results of the canonical RMFT as a zeroth-order solution are provided for comparison to illustrate the necessity of the introduced higher-order contributions.","lang":"eng"}],"publist_id":"6195","isi":1,"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"volume":95,"year":"2017","date_updated":"2025-06-04T08:39:41Z","publication_status":"published","author":[{"last_name":"Spałek","first_name":"Jozef","full_name":"Spałek, Jozef"},{"first_name":"Michał","full_name":"Zegrodnik, Michał","last_name":"Zegrodnik"},{"last_name":"Kaczmarczyk","id":"46C405DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1629-3675","first_name":"Jan","full_name":"Kaczmarczyk, Jan"}],"month":"01","_id":"1162","language":[{"iso":"eng"}],"publication":"Physical Review B - Condensed Matter and Materials Physics","title":"Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment","status":"public","scopus_import":"1"},{"issue":"3","publisher":"Springer","citation":{"ama":"Perrone E, Rappold A, Müller W. D inf s optimality in copula models. Statistical Methods and Applications. 2017;26(3):403-418. doi:10.1007/s10260-016-0375-6","short":"E. Perrone, A. Rappold, W. Müller, Statistical Methods and Applications 26 (2017) 403–418.","mla":"Perrone, Elisa, et al. “D Inf s Optimality in Copula Models.” Statistical Methods and Applications, vol. 26, no. 3, Springer, 2017, pp. 403–18, doi:10.1007/s10260-016-0375-6.","ista":"Perrone E, Rappold A, Müller W. 2017. D inf s optimality in copula models. Statistical Methods and Applications. 26(3), 403–418.","ieee":"E. Perrone, A. Rappold, and W. Müller, “D inf s optimality in copula models,” Statistical Methods and Applications, vol. 26, no. 3. Springer, pp. 403–418, 2017.","chicago":"Perrone, Elisa, Andreas Rappold, and Werner Müller. “D Inf s Optimality in Copula Models.” Statistical Methods and Applications. Springer, 2017. https://doi.org/10.1007/s10260-016-0375-6.","apa":"Perrone, E., Rappold, A., & Müller, W. (2017). D inf s optimality in copula models. Statistical Methods and Applications. Springer. https://doi.org/10.1007/s10260-016-0375-6"},"department":[{"_id":"CaUh"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","pubrep_id":"739","article_processing_charge":"No","day":"01","quality_controlled":"1","date_published":"2017-08-01T00:00:00Z","intvolume":" 26","type":"journal_article","file_date_updated":"2020-07-14T12:44:37Z","oa":1,"doi":"10.1007/s10260-016-0375-6","acknowledgement":"This work has been supported by the project ANR-2011-IS01-001-01 “DESIRE” and Austrian Science Fund (FWF) I833-N18. Open access funding is provided by the Austrian Science Fund (FWF). ","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","_id":"1168","language":[{"iso":"eng"}],"publication":"Statistical Methods and Applications","file":[{"checksum":"0b2d1b647ca96e9ef13a14b8b6775e0f","file_size":56664,"date_created":"2018-12-12T10:16:13Z","date_updated":"2020-07-14T12:44:37Z","file_id":"5199","creator":"system","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"IST-2017-739-v1+2_10260_2016_375_MOESM1_ESM.pdf"},{"access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"IST-2017-739-v1+3_s10260-016-0375-6.pdf","creator":"system","file_id":"5200","date_created":"2018-12-12T10:16:14Z","date_updated":"2020-07-14T12:44:37Z","file_size":688953,"checksum":"3321ef34e02e28acfc427f77cf32812a"}],"status":"public","scopus_import":"1","title":"D inf s optimality in copula models","ddc":["519"],"publication_status":"published","date_updated":"2024-10-09T20:57:17Z","month":"08","author":[{"id":"2A5F8724-F248-11E8-B48F-1D18A9856A87","last_name":"Perrone","first_name":"Elisa","orcid":"0000-0003-0370-9835","full_name":"Perrone, Elisa"},{"first_name":"Andreas","full_name":"Rappold, Andreas","last_name":"Rappold"},{"full_name":"Müller, Werner","first_name":"Werner","last_name":"Müller"}],"abstract":[{"text":"Optimum experimental design theory has recently been extended for parameter estimation in copula models. The use of these models allows one to gain in flexibility by considering the model parameter set split into marginal and dependence parameters. However, this separation also leads to the natural issue of estimating only a subset of all model parameters. In this work, we treat this problem with the application of the (Formula presented.)-optimality to copula models. First, we provide an extension of the corresponding equivalence theory. Then, we analyze a wide range of flexible copula models to highlight the usefulness of (Formula presented.)-optimality in many possible scenarios. Finally, we discuss how the usage of the introduced design criterion also relates to the more general issue of copula selection and optimal design for model discrimination.","lang":"eng"}],"page":"403 - 418","publist_id":"6189","year":"2017","isi":1,"volume":26,"date_created":"2018-12-11T11:50:31Z","external_id":{"isi":["000407973200004"]},"oa_version":"Submitted Version"},{"type":"journal_article","file_date_updated":"2020-07-14T12:44:37Z","doi":"10.1534/genetics.116.193946","oa":1,"has_accepted_license":"1","issue":"1","publisher":"Genetics Society of America","department":[{"_id":"NiBa"}],"citation":{"ama":"Novak S, Kollár R. Spatial gene frequency waves under genotype dependent dispersal. Genetics. 2017;205(1):367-374. doi:10.1534/genetics.116.193946","short":"S. Novak, R. Kollár, Genetics 205 (2017) 367–374.","mla":"Novak, Sebastian, and Richard Kollár. “Spatial Gene Frequency Waves under Genotype Dependent Dispersal.” Genetics, vol. 205, no. 1, Genetics Society of America, 2017, pp. 367–74, doi:10.1534/genetics.116.193946.","ista":"Novak S, Kollár R. 2017. Spatial gene frequency waves under genotype dependent dispersal. Genetics. 205(1), 367–374.","apa":"Novak, S., & Kollár, R. (2017). Spatial gene frequency waves under genotype dependent dispersal. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.116.193946","chicago":"Novak, Sebastian, and Richard Kollár. “Spatial Gene Frequency Waves under Genotype Dependent Dispersal.” Genetics. Genetics Society of America, 2017. https://doi.org/10.1534/genetics.116.193946.","ieee":"S. Novak and R. Kollár, “Spatial gene frequency waves under genotype dependent dispersal,” Genetics, vol. 205, no. 1. Genetics Society of America, pp. 367–374, 2017."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"727","article_processing_charge":"No","publication_identifier":{"issn":["0016-6731"]},"quality_controlled":"1","day":"01","intvolume":" 205","date_published":"2017-01-01T00:00:00Z","page":"367 - 374","publist_id":"6188","ec_funded":1,"abstract":[{"lang":"eng","text":"Dispersal is a crucial factor in natural evolution, since it determines the habitat experienced by any population and defines the spatial scale of interactions between individuals. There is compelling evidence for systematic differences in dispersal characteristics within the same population, i.e., genotype-dependent dispersal. The consequences of genotype-dependent dispersal on other evolutionary phenomena, however, are poorly understood. In this article we investigate the effect of genotype-dependent dispersal on spatial gene frequency patterns, using a generalization of the classical diffusion model of selection and dispersal. Dispersal is characterized by the variance of dispersal (diffusion coefficient) and the mean displacement (directional advection term). We demonstrate that genotype-dependent dispersal may change the qualitative behavior of Fisher waves, which change from being “pulled” to being “pushed” wave fronts as the discrepancy in dispersal between genotypes increases. The speed of any wave is partitioned into components due to selection, genotype-dependent variance of dispersal, and genotype-dependent mean displacement. We apply our findings to wave fronts maintained by selection against heterozygotes. Furthermore, we identify a benefit of increased variance of dispersal, quantify its effect on the speed of the wave, and discuss the implications for the evolution of dispersal strategies."}],"year":"2017","volume":205,"isi":1,"project":[{"name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","grant_number":"618091"},{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152"}],"external_id":{"isi":["000393677300025"]},"date_created":"2018-12-11T11:50:31Z","oa_version":"Submitted Version","publication":"Genetics","language":[{"iso":"eng"}],"_id":"1169","scopus_import":"1","status":"public","file":[{"file_size":361500,"checksum":"7c8ab79cda1f92760bbbbe0f53175bfc","date_created":"2018-12-12T10:10:43Z","date_updated":"2020-07-14T12:44:37Z","file_id":"4833","creator":"system","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"IST-2016-727-v1+1_SFC_Genetics_final.pdf"}],"title":"Spatial gene frequency waves under genotype dependent dispersal","publication_status":"published","date_updated":"2025-07-10T11:50:13Z","ddc":["576"],"month":"01","author":[{"id":"461468AE-F248-11E8-B48F-1D18A9856A87","last_name":"Novak","full_name":"Novak, Sebastian","first_name":"Sebastian","orcid":"0000-0002-2519-824X"},{"first_name":"Richard","full_name":"Kollár, Richard","last_name":"Kollár"}]},{"arxiv":1,"day":"01","quality_controlled":"1","date_published":"2017-10-01T00:00:00Z","intvolume":" 37","publisher":"Springer","issue":"5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"citation":{"short":"H. Edelsbrunner, A. Glazyrin, O. Musin, A. Nikitenko, Combinatorica 37 (2017) 887–910.","ama":"Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. 2017;37(5):887-910. doi:10.1007/s00493-016-3308-y","chicago":"Edelsbrunner, Herbert, Alexey Glazyrin, Oleg Musin, and Anton Nikitenko. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” Combinatorica. Springer, 2017. https://doi.org/10.1007/s00493-016-3308-y.","apa":"Edelsbrunner, H., Glazyrin, A., Musin, O., & Nikitenko, A. (2017). The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. Springer. https://doi.org/10.1007/s00493-016-3308-y","ieee":"H. Edelsbrunner, A. Glazyrin, O. Musin, and A. Nikitenko, “The Voronoi functional is maximized by the Delaunay triangulation in the plane,” Combinatorica, vol. 37, no. 5. Springer, pp. 887–910, 2017.","ista":"Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. 2017. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. 37(5), 887–910.","mla":"Edelsbrunner, Herbert, et al. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” Combinatorica, vol. 37, no. 5, Springer, 2017, pp. 887–910, doi:10.1007/s00493-016-3308-y."},"publication_identifier":{"issn":["0209-9683"]},"article_processing_charge":"No","acknowledgement":"This research is partially supported by the Russian Government under the Mega Project 11.G34.31.0053, by the Toposys project FP7-ICT-318493-STREP, by ESF under the ACAT Research Network Programme, by RFBR grant 11-01-00735, and by NSF grants DMS-1101688, DMS-1400876.","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1411.6337"}],"type":"journal_article","oa":1,"doi":"10.1007/s00493-016-3308-y","publication_status":"published","date_updated":"2025-06-04T08:44:44Z","month":"10","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"full_name":"Glazyrin, Alexey","first_name":"Alexey","last_name":"Glazyrin"},{"last_name":"Musin","full_name":"Musin, Oleg","first_name":"Oleg"},{"id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","last_name":"Nikitenko","first_name":"Anton","orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton"}],"_id":"1173","language":[{"iso":"eng"}],"publication":"Combinatorica","scopus_import":"1","status":"public","title":"The Voronoi functional is maximized by the Delaunay triangulation in the plane","date_created":"2018-12-11T11:50:32Z","external_id":{"isi":["000418056000005"],"arxiv":["1411.6337"]},"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result neither extends to topological triangulations in the plane nor to geometric triangulations in three and higher dimensions."}],"ec_funded":1,"page":"887 - 910","publist_id":"6182","year":"2017","project":[{"grant_number":"318493","name":"Topological Complex Systems","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"volume":37,"isi":1},{"publist_id":"6180","ec_funded":1,"abstract":[{"text":"Security of cryptographic applications is typically defined by security games. The adversary, within certain resources, cannot win with probability much better than 0 (for unpredictability applications, like one-way functions) or much better than 1/2 (indistinguishability applications for instance encryption schemes). In so called squared-friendly applications the winning probability of the adversary, for different values of the application secret randomness, is not only close to 0 or 1/2 on average, but also concentrated in the sense that its second central moment is small. The class of squared-friendly applications, which contains all unpredictability applications and many indistinguishability applications, is particularly important for key derivation. Barak et al. observed that for square-friendly applications one can beat the "RT-bound", extracting secure keys with significantly smaller entropy loss. In turn Dodis and Yu showed that in squared-friendly applications one can directly use a "weak" key, which has only high entropy, as a secure key. In this paper we give sharp lower bounds on square security assuming security for "weak" keys. We show that any application which is either (a) secure with weak keys or (b) allows for entropy savings for keys derived by universal hashing, must be square-friendly. Quantitatively, our lower bounds match the positive results of Dodis and Yu and Barak et al. (TCC\\'13, CRYPTO\\'11) Hence, they can be understood as a general characterization of squared-friendly applications. While the positive results on squared-friendly applications where derived by one clever application of the Cauchy-Schwarz Inequality, for tight lower bounds we need more machinery. In our approach we use convex optimization techniques and some theory of circular matrices.","lang":"eng"}],"year":"2017","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"isi":1,"volume":66,"date_created":"2018-12-11T11:50:32Z","external_id":{"isi":["000521077300057"]},"oa_version":"Submitted Version","language":[{"iso":"eng"}],"_id":"1174","status":"public","scopus_import":"1","title":"Lower bounds on key derivation for square-friendly applications","publication_status":"published","date_updated":"2025-07-10T11:50:14Z","author":[{"full_name":"Skórski, Maciej","first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski"}],"month":"03","type":"conference","main_file_link":[{"url":"http://drops.dagstuhl.de/opus/volltexte/2017/6976","open_access":"1"}],"conference":{"start_date":"2017-03-08","name":"STACS: Symposium on Theoretical Aspects of Computer Science","end_date":"2017-03-11","location":"Hannover, Germany"},"doi":"10.4230/LIPIcs.STACS.2017.57","oa":1,"article_number":"57","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"department":[{"_id":"KrPi"}],"citation":{"short":"M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ama":"Skórski M. Lower bounds on key derivation for square-friendly applications. In: Vol 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.STACS.2017.57","ieee":"M. Skórski, “Lower bounds on key derivation for square-friendly applications,” presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 2017, vol. 66.","chicago":"Skórski, Maciej. “Lower Bounds on Key Derivation for Square-Friendly Applications,” Vol. 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.STACS.2017.57.","apa":"Skórski, M. (2017). Lower bounds on key derivation for square-friendly applications (Vol. 66). Presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2017.57","ista":"Skórski M. 2017. Lower bounds on key derivation for square-friendly applications. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 66, 57.","mla":"Skórski, Maciej. Lower Bounds on Key Derivation for Square-Friendly Applications. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.STACS.2017.57."},"article_processing_charge":"No","publication_identifier":{"issn":["1868-8969"]},"quality_controlled":"1","day":"01","intvolume":" 66","date_published":"2017-03-01T00:00:00Z"},{"title":"Cumulative space in black-white pebbling and resolution","file":[{"file_id":"5263","creator":"system","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2018-927-v1+1_LIPIcs-ITCS-2017-38.pdf","file_size":557769,"checksum":"dbc94810be07c2fb1945d5c2a6130e6c","date_created":"2018-12-12T10:17:11Z","date_updated":"2020-07-14T12:44:37Z"}],"status":"public","scopus_import":"1","_id":"1175","language":[{"iso":"eng"}],"month":"01","author":[{"full_name":"Alwen, Joel F","first_name":"Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"De Rezende","full_name":"De Rezende, Susanna","first_name":"Susanna"},{"last_name":"Nordstrom","full_name":"Nordstrom, Jakob","first_name":"Jakob"},{"last_name":"Vinyals","full_name":"Vinyals, Marc","first_name":"Marc"}],"ddc":["005","600"],"date_updated":"2025-09-10T10:49:13Z","editor":[{"first_name":"Christos","full_name":"Papadimitriou, Christos","last_name":"Papadimitriou"}],"publication_status":"published","volume":67,"isi":1,"year":"2017","abstract":[{"text":"We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation. Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the non- deterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10–15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure.","lang":"eng"}],"publist_id":"6179","page":"38:1-38-21","oa_version":"Published Version","external_id":{"isi":["001532708700038"]},"date_created":"2018-12-11T11:50:33Z","publication_identifier":{"issn":["1868-8969"]},"pubrep_id":"927","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"KrPi"}],"citation":{"short":"J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.","ama":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:38:1-38-21. doi:10.4230/LIPIcs.ITCS.2017.38","apa":"Alwen, J. F., De Rezende, S., Nordstrom, J., & Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2017.38","chicago":"Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.ITCS.2017.38.","ieee":"J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space in black-white pebbling and resolution,” presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.","ista":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.","mla":"Alwen, Joel F., et al. Cumulative Space in Black-White Pebbling and Resolution. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:10.4230/LIPIcs.ITCS.2017.38."},"alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2017-01-01T00:00:00Z","intvolume":" 67","day":"01","quality_controlled":"1","oa":1,"doi":"10.4230/LIPIcs.ITCS.2017.38","conference":{"location":"Berkeley, CA, United States","end_date":"2017-01-11","name":"ITCS: Innovations in Theoretical Computer Science","start_date":"2017-01-09"},"file_date_updated":"2020-07-14T12:44:37Z","type":"conference","corr_author":"1","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"external_id":{"isi":["000424197300011"]},"date_created":"2018-12-11T11:50:33Z","oa_version":"Submitted Version","publist_id":"6178","abstract":[{"lang":"eng","text":"The algorithm Argon2i-B of Biryukov, Dinu and Khovratovich is currently being considered by the IRTF (Internet Research Task Force) as a new de-facto standard for password hashing. An older version (Argon2i-A) of the same algorithm was chosen as the winner of the recent Password Hashing Competition. An important competitor to Argon2i-B is the recently introduced Balloon Hashing (BH) algorithm of Corrigan-Gibs, Boneh and Schechter. A key security desiderata for any such algorithm is that evaluating it (even using a custom device) requires a large amount of memory amortized across multiple instances. Alwen and Blocki (CRYPTO 2016) introduced a class of theoretical attacks against Argon2i-A and BH. While these attacks yield large asymptotic reductions in the amount of memory, it was not, a priori, clear if (1) they can be extended to the newer Argon2i-B, (2) the attacks are effective on any algorithm for practical parameter ranges (e.g., 1GB of memory) and (3) if they can be effectively instantiated against any algorithm under realistic hardware constrains. In this work we answer all three of these questions in the affirmative for all three algorithms. This is also the first work to analyze the security of Argon2i-B. In more detail, we extend the theoretical attacks of Alwen and Blocki (CRYPTO 2016) to the recent Argon2i-B proposal demonstrating severe asymptotic deficiencies in its security. Next we introduce several novel heuristics for improving the attack's concrete memory efficiency even when on-chip memory bandwidth is bounded. We then simulate our attacks on randomly sampled Argon2i-A, Argon2i-B and BH instances and measure the resulting memory consumption for various practical parameter ranges and for a variety of upperbounds on the amount of parallelism available to the attacker. Finally we describe, implement, and test a new heuristic for applying the Alwen-Blocki attack to functions employing a technique developed by Corrigan-Gibs et al. for improving concrete security of memory-hard functions. We analyze the collected data and show the effects various parameters have on the memory consumption of the attack. In particular, we can draw several interesting conclusions about the level of security provided by these functions. · For the Alwen-Blocki attack to fail against practical memory parameters, Argon2i-B must be instantiated with more than 10 passes on memory - beyond the \"paranoid\" parameter setting in the current IRTF proposal. · The technique of Corrigan-Gibs for improving security can also be overcome by the Alwen-Blocki attack under realistic hardware constraints. · On a positive note, both the asymptotic and concrete security of Argon2i-B seem to improve on that of Argon2i-A."}],"isi":1,"year":"2017","date_updated":"2023-09-20T11:22:25Z","publication_status":"published","month":"07","author":[{"last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","first_name":"Joel F"},{"last_name":"Blocki","first_name":"Jeremiah","full_name":"Blocki, Jeremiah"}],"language":[{"iso":"eng"}],"_id":"1176","title":"Towards practical attacks on Argon2i and balloon hashing","status":"public","scopus_import":"1","article_number":"7961977","type":"conference","main_file_link":[{"url":"https://eprint.iacr.org/2016/759","open_access":"1"}],"conference":{"name":"EuroS&P: European Symposium on Security and Privacy","start_date":"2017-04-26","location":"Paris, France","end_date":"2017-04-28"},"doi":"10.1109/EuroSP.2017.47","oa":1,"quality_controlled":"1","day":"03","date_published":"2017-07-03T00:00:00Z","department":[{"_id":"KrPi"}],"citation":{"ama":"Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing. In: IEEE; 2017. doi:10.1109/EuroSP.2017.47","short":"J.F. Alwen, J. Blocki, in:, IEEE, 2017.","mla":"Alwen, Joel F., and Jeremiah Blocki. Towards Practical Attacks on Argon2i and Balloon Hashing. 7961977, IEEE, 2017, doi:10.1109/EuroSP.2017.47.","ista":"Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&P: European Symposium on Security and Privacy, 7961977.","apa":"Alwen, J. F., & Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&P: European Symposium on Security and Privacy, Paris, France: IEEE. https://doi.org/10.1109/EuroSP.2017.47","ieee":"J. F. Alwen and J. Blocki, “Towards practical attacks on Argon2i and balloon hashing,” presented at the EuroS&P: European Symposium on Security and Privacy, Paris, France, 2017.","chicago":"Alwen, Joel F, and Jeremiah Blocki. “Towards Practical Attacks on Argon2i and Balloon Hashing.” IEEE, 2017. https://doi.org/10.1109/EuroSP.2017.47."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"IEEE","article_processing_charge":"No","publication_identifier":{"isbn":["978-150905761-0"]}},{"publication_identifier":{"issn":["0001-8708"]},"article_processing_charge":"No","department":[{"_id":"HeEd"}],"citation":{"ama":"Akopyan A, Bárány I, Robins S. Algebraic vertices of non-convex polyhedra. Advances in Mathematics. 2017;308:627-644. doi:10.1016/j.aim.2016.12.026","short":"A. Akopyan, I. Bárány, S. Robins, Advances in Mathematics 308 (2017) 627–644.","mla":"Akopyan, Arseniy, et al. “Algebraic Vertices of Non-Convex Polyhedra.” Advances in Mathematics, vol. 308, Academic Press, 2017, pp. 627–44, doi:10.1016/j.aim.2016.12.026.","ista":"Akopyan A, Bárány I, Robins S. 2017. Algebraic vertices of non-convex polyhedra. Advances in Mathematics. 308, 627–644.","ieee":"A. Akopyan, I. Bárány, and S. Robins, “Algebraic vertices of non-convex polyhedra,” Advances in Mathematics, vol. 308. Academic Press, pp. 627–644, 2017.","chicago":"Akopyan, Arseniy, Imre Bárány, and Sinai Robins. “Algebraic Vertices of Non-Convex Polyhedra.” Advances in Mathematics. Academic Press, 2017. https://doi.org/10.1016/j.aim.2016.12.026.","apa":"Akopyan, A., Bárány, I., & Robins, S. (2017). Algebraic vertices of non-convex polyhedra. Advances in Mathematics. Academic Press. https://doi.org/10.1016/j.aim.2016.12.026"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Academic Press","date_published":"2017-02-21T00:00:00Z","intvolume":" 308","arxiv":1,"day":"21","quality_controlled":"1","oa":1,"doi":"10.1016/j.aim.2016.12.026","main_file_link":[{"url":"https://arxiv.org/abs/1508.07594","open_access":"1"}],"type":"journal_article","title":"Algebraic vertices of non-convex polyhedra","status":"public","scopus_import":"1","_id":"1180","publication":"Advances in Mathematics","language":[{"iso":"eng"}],"author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bárány","full_name":"Bárány, Imre","first_name":"Imre"},{"first_name":"Sinai","full_name":"Robins, Sinai","last_name":"Robins"}],"month":"02","date_updated":"2025-06-04T08:45:48Z","publication_status":"published","isi":1,"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"volume":308,"year":"2017","abstract":[{"text":"In this article we define an algebraic vertex of a generalized polyhedron and show that the set of algebraic vertices is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope P is a linear combination of indicator functions of simplices whose vertices are algebraic vertices of P. We also show that the indicator function of any generalized polyhedron is a linear combination, with integer coefficients, of indicator functions of cones with apices at algebraic vertices and line-cones. The concept of an algebraic vertex is closely related to the Fourier–Laplace transform. We show that a point v is an algebraic vertex of a generalized polyhedron P if and only if the tangent cone of P, at v, has non-zero Fourier–Laplace transform.","lang":"eng"}],"ec_funded":1,"publist_id":"6173","page":"627 - 644","oa_version":"Submitted Version","external_id":{"arxiv":["1508.07594"],"isi":["000409292900015"]},"date_created":"2018-12-11T11:50:34Z"},{"file_date_updated":"2020-07-14T12:44:37Z","type":"journal_article","doi":"10.1007/s00145-016-9247-3","oa":1,"has_accepted_license":"1","department":[{"_id":"KrPi"}],"citation":{"short":"E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.","ama":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. Efficient authentication from hard learning problems. Journal of Cryptology. 2017;30(4):1238-1275. doi:10.1007/s00145-016-9247-3","apa":"Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., & Jain, A. (2017). Efficient authentication from hard learning problems. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-016-9247-3","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, Daniele Venturi, David Cash, and Abhishek Jain. “Efficient Authentication from Hard Learning Problems.” Journal of Cryptology. Springer, 2017. https://doi.org/10.1007/s00145-016-9247-3.","ieee":"E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” Journal of Cryptology, vol. 30, no. 4. Springer, pp. 1238–1275, 2017.","ista":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.","mla":"Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.” Journal of Cryptology, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:10.1007/s00145-016-9247-3."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"4","publisher":"Springer","article_processing_charge":"No","quality_controlled":"1","day":"01","intvolume":" 30","date_published":"2017-10-01T00:00:00Z","publist_id":"6166","page":"1238 - 1275","ec_funded":1,"abstract":[{"lang":"eng","text":"We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work—starting with the (Formula presented.) protocol of Hopper and Blum in 2001—until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle attacks. A MAC implies such a (two-round) protocol."}],"isi":1,"project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"},{"grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"volume":30,"year":"2017","external_id":{"isi":["000410788600007"]},"date_created":"2018-12-11T11:50:37Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3238"}]},"oa_version":"Submitted Version","publication":"Journal of Cryptology","language":[{"iso":"eng"}],"_id":"1187","title":"Efficient authentication from hard learning problems","scopus_import":"1","status":"public","file":[{"checksum":"c647520d115b772a1682fc06fa273eb1","file_size":516959,"date_updated":"2020-07-14T12:44:37Z","date_created":"2020-05-14T16:30:17Z","creator":"dernst","file_id":"7843","file_name":"2017_JournalCrypto_Kiltz.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"article_type":"original","date_updated":"2025-04-14T07:22:06Z","publication_status":"published","ddc":["000"],"month":"10","author":[{"first_name":"Eike","full_name":"Kiltz, Eike","last_name":"Kiltz"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"first_name":"Daniele","full_name":"Venturi, Daniele","last_name":"Venturi"},{"full_name":"Cash, David","first_name":"David","last_name":"Cash"},{"full_name":"Jain, Abhishek","first_name":"Abhishek","last_name":"Jain"}]},{"oa_version":"Preprint","external_id":{"isi":["000395156200005"],"arxiv":["1607.00944"]},"date_created":"2018-12-11T11:50:38Z","year":"2017","volume":79,"isi":1,"project":[{"grant_number":"618091","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation"},{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation"}],"page":"525-559","publist_id":"6160","abstract":[{"lang":"eng","text":"Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed."}],"ec_funded":1,"author":[{"last_name":"Kollár","first_name":"Richard","full_name":"Kollár, Richard"},{"id":"461468AE-F248-11E8-B48F-1D18A9856A87","last_name":"Novak","full_name":"Novak, Sebastian","first_name":"Sebastian","orcid":"0000-0002-2519-824X"}],"month":"03","publication_status":"published","date_updated":"2025-09-22T09:44:54Z","status":"public","scopus_import":"1","title":"Existence of traveling waves for the generalized F–KPP equation","publication":"Bulletin of Mathematical Biology","language":[{"iso":"eng"}],"_id":"1191","acknowledgement":"We thank Nick Barton, Katarína Bod’ová, and Sr\r\n-\r\ndan Sarikas for constructive feed-\r\nback and support. Furthermore, we would like to express our deep gratitude to the anonymous referees (one\r\nof whom, Jimmy Garnier, agreed to reveal his identity) and the editor Max Souza, for very helpful and\r\ndetailed comments and suggestions that significantly helped us to improve the manuscript. This project has\r\nreceived funding from the European Union’s Seventh Framework Programme for research, technological\r\ndevelopment and demonstration under Grant Agreement 618091 Speed of Adaptation in Population Genet-\r\nics and Evolutionary Computation (SAGE) and the European Research Council (ERC) Grant No. 250152\r\n(SN), from the Scientific Grant Agency of the Slovak Republic under the Grant 1/0459/13 and by the Slovak\r\nResearch and Development Agency under the Contract No. APVV-14-0378 (RK). RK would also like to\r\nthank IST Austria for its hospitality during the work on this project.","doi":"10.1007/s11538-016-0244-3","oa":1,"type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1607.00944","open_access":"1"}],"intvolume":" 79","date_published":"2017-03-01T00:00:00Z","quality_controlled":"1","arxiv":1,"day":"01","article_processing_charge":"No","issue":"3","publisher":"Springer","citation":{"mla":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology, vol. 79, no. 3, Springer, 2017, pp. 525–59, doi:10.1007/s11538-016-0244-3.","apa":"Kollár, R., & Novak, S. (2017). Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. Springer. https://doi.org/10.1007/s11538-016-0244-3","chicago":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology. Springer, 2017. https://doi.org/10.1007/s11538-016-0244-3.","ieee":"R. Kollár and S. Novak, “Existence of traveling waves for the generalized F–KPP equation,” Bulletin of Mathematical Biology, vol. 79, no. 3. Springer, pp. 525–559, 2017.","ista":"Kollár R, Novak S. 2017. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 79(3), 525–559.","ama":"Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 2017;79(3):525-559. doi:10.1007/s11538-016-0244-3","short":"R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559."},"department":[{"_id":"NiBa"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"}]