[{"abstract":[{"text":"We consider real symmetric and complex Hermitian random matrices with the additional symmetry hxy = hN-y,N-x. The matrix elements are independent (up to the fourfold symmetry) and not necessarily identically distributed. This ensemble naturally arises as the Fourier transform of a Gaussian orthogonal ensemble. Italso occurs as the flip matrix model - an approximation of the two-dimensional Anderson model at small disorder. We show that the density of states converges to the Wigner semicircle law despite the new symmetry type. We also prove the local version of the semicircle law on the optimal scale.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"http://arxiv.org/abs/1506.04683","open_access":"1"}],"scopus_import":1,"intvolume":" 56","month":"10","publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"volume":56,"issue":"10","related_material":{"record":[{"status":"public","id":"149","relation":"dissertation_contains"}]},"_id":"1677","type":"journal_article","status":"public","date_updated":"2023-09-07T12:38:08Z","department":[{"_id":"LaEr"}],"oa":1,"publisher":"American Institute of Physics","quality_controlled":"1","year":"2015","publication":"Journal of Mathematical Physics","day":"09","date_created":"2018-12-11T11:53:25Z","doi":"10.1063/1.4932606","date_published":"2015-10-09T00:00:00Z","article_number":"103301","project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold Symmetry.” Journal of Mathematical Physics, vol. 56, no. 10, 103301, American Institute of Physics, 2015, doi:10.1063/1.4932606.","ama":"Alt J. The local semicircle law for random matrices with a fourfold symmetry. Journal of Mathematical Physics. 2015;56(10). doi:10.1063/1.4932606","apa":"Alt, J. (2015). The local semicircle law for random matrices with a fourfold symmetry. Journal of Mathematical Physics. American Institute of Physics. https://doi.org/10.1063/1.4932606","short":"J. Alt, Journal of Mathematical Physics 56 (2015).","ieee":"J. Alt, “The local semicircle law for random matrices with a fourfold symmetry,” Journal of Mathematical Physics, vol. 56, no. 10. American Institute of Physics, 2015.","chicago":"Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold Symmetry.” Journal of Mathematical Physics. American Institute of Physics, 2015. https://doi.org/10.1063/1.4932606.","ista":"Alt J. 2015. The local semicircle law for random matrices with a fourfold symmetry. Journal of Mathematical Physics. 56(10), 103301."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","last_name":"Alt","full_name":"Alt, Johannes"}],"publist_id":"5472","title":"The local semicircle law for random matrices with a fourfold symmetry"},{"author":[{"id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","first_name":"Álvaro","orcid":"0000-0002-5409-8571","full_name":"Inglés Prieto, Álvaro","last_name":"Inglés Prieto"},{"first_name":"Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","last_name":"Gschaider-Reichhart","full_name":"Gschaider-Reichhart, Eva","orcid":"0000-0002-7218-7738"},{"full_name":"Muellner, Markus","last_name":"Muellner","first_name":"Markus"},{"last_name":"Nowak","full_name":"Nowak, Matthias","first_name":"Matthias","id":"30845DAA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sebastian","last_name":"Nijman","full_name":"Nijman, Sebastian"},{"first_name":"Michael","last_name":"Grusch","full_name":"Grusch, Michael"},{"last_name":"Janovjak","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315","first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5471","title":"Light-assisted small-molecule screening against protein kinases","citation":{"chicago":"Inglés Prieto, Álvaro, Eva Gschaider-Reichhart, Markus Muellner, Matthias Nowak, Sebastian Nijman, Michael Grusch, and Harald L Janovjak. “Light-Assisted Small-Molecule Screening against Protein Kinases.” Nature Chemical Biology. Nature Publishing Group, 2015. https://doi.org/10.1038/nchembio.1933.","ista":"Inglés Prieto Á, Gschaider-Reichhart E, Muellner M, Nowak M, Nijman S, Grusch M, Janovjak HL. 2015. Light-assisted small-molecule screening against protein kinases. Nature Chemical Biology. 11(12), 952–954.","mla":"Inglés Prieto, Álvaro, et al. “Light-Assisted Small-Molecule Screening against Protein Kinases.” Nature Chemical Biology, vol. 11, no. 12, Nature Publishing Group, 2015, pp. 952–54, doi:10.1038/nchembio.1933.","apa":"Inglés Prieto, Á., Gschaider-Reichhart, E., Muellner, M., Nowak, M., Nijman, S., Grusch, M., & Janovjak, H. L. (2015). Light-assisted small-molecule screening against protein kinases. Nature Chemical Biology. Nature Publishing Group. https://doi.org/10.1038/nchembio.1933","ama":"Inglés Prieto Á, Gschaider-Reichhart E, Muellner M, et al. Light-assisted small-molecule screening against protein kinases. Nature Chemical Biology. 2015;11(12):952-954. doi:10.1038/nchembio.1933","short":"Á. Inglés Prieto, E. Gschaider-Reichhart, M. Muellner, M. Nowak, S. Nijman, M. Grusch, H.L. Janovjak, Nature Chemical Biology 11 (2015) 952–954.","ieee":"Á. Inglés Prieto et al., “Light-assisted small-molecule screening against protein kinases,” Nature Chemical Biology, vol. 11, no. 12. Nature Publishing Group, pp. 952–954, 2015."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FP7","_id":"25548C20-B435-11E9-9278-68D0E5697425","name":"Microbial Ion Channels for Synthetic Neurobiology","grant_number":"303564"},{"name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator)","grant_number":"RGY0084/2012","_id":"255BFFFA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","name":"Molecular Drug Targets"}],"page":"952 - 954","date_created":"2018-12-11T11:53:25Z","doi":"10.1038/nchembio.1933","date_published":"2015-10-12T00:00:00Z","year":"2015","has_accepted_license":"1","publication":"Nature Chemical Biology","day":"12","oa":1,"publisher":"Nature Publishing Group","quality_controlled":"1","acknowledgement":"This work was supported by grants from the European Union Seventh Framework Programme (CIG-303564 to H.J. and ERC-StG-311166 to S.M.B.N.), the Human Frontier Science Program (RGY0084_2012 to H.J.) and the Herzfelder Foundation (to M.G.). A.I.-P. was supported by a Ramon Areces fellowship, and E.R. by the graduate program MolecularDrugTargets (Austrian Science Fund (FWF): W 1232) and a FemTech fellowship (3580812 Austrian Research Promotion Agency).","file_date_updated":"2020-07-14T12:45:12Z","department":[{"_id":"HaJa"},{"_id":"LifeSc"}],"date_updated":"2023-09-07T12:49:09Z","ddc":["571"],"type":"journal_article","pubrep_id":"837","status":"public","_id":"1678","ec_funded":1,"issue":"12","volume":11,"related_material":{"record":[{"id":"418","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","language":[{"iso":"eng"}],"file":[{"creator":"system","file_size":1308364,"date_updated":"2020-07-14T12:45:12Z","file_name":"IST-2017-837-v1+1_ingles-prieto.pdf","date_created":"2018-12-12T10:10:51Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4842","checksum":"e9fb251dfcb7cd209b83f17867e61321"}],"scopus_import":1,"intvolume":" 11","month":"10","abstract":[{"lang":"eng","text":"High-throughput live-cell screens are intricate elements of systems biology studies and drug discovery pipelines. Here, we demonstrate an optogenetics-assisted method that avoids the need for chemical activators and reporters, reduces the number of operational steps and increases information content in a cell-based small-molecule screen against human protein kinases, including an orphan receptor tyrosine kinase. This blueprint for all-optical screening can be adapted to many drug targets and cellular processes."}],"oa_version":"Submitted Version"},{"quality_controlled":"1","publisher":"American Physical Society","oa":1,"date_published":"2015-12-08T00:00:00Z","doi":"10.1103/PhysRevLett.115.248101","date_created":"2018-12-11T11:52:49Z","year":"2015","day":"08","publication":"Physical Review Letters","project":[{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"248101","publist_id":"5595","author":[{"full_name":"Cepeda Humerez, Sarah A","last_name":"Cepeda Humerez","id":"3DEE19A4-F248-11E8-B48F-1D18A9856A87","first_name":"Sarah A"},{"full_name":"Rieckh, Georg","last_name":"Rieckh","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg"},{"orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","last_name":"Tkacik","first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"title":"Stochastic proofreading mechanism alleviates crosstalk in transcriptional regulation","citation":{"mla":"Cepeda Humerez, Sarah A., et al. “Stochastic Proofreading Mechanism Alleviates Crosstalk in Transcriptional Regulation.” Physical Review Letters, vol. 115, no. 24, 248101, American Physical Society, 2015, doi:10.1103/PhysRevLett.115.248101.","short":"S.A. Cepeda Humerez, G. Rieckh, G. Tkačik, Physical Review Letters 115 (2015).","ieee":"S. A. Cepeda Humerez, G. Rieckh, and G. Tkačik, “Stochastic proofreading mechanism alleviates crosstalk in transcriptional regulation,” Physical Review Letters, vol. 115, no. 24. American Physical Society, 2015.","apa":"Cepeda Humerez, S. A., Rieckh, G., & Tkačik, G. (2015). Stochastic proofreading mechanism alleviates crosstalk in transcriptional regulation. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.115.248101","ama":"Cepeda Humerez SA, Rieckh G, Tkačik G. Stochastic proofreading mechanism alleviates crosstalk in transcriptional regulation. Physical Review Letters. 2015;115(24). doi:10.1103/PhysRevLett.115.248101","chicago":"Cepeda Humerez, Sarah A, Georg Rieckh, and Gašper Tkačik. “Stochastic Proofreading Mechanism Alleviates Crosstalk in Transcriptional Regulation.” Physical Review Letters. American Physical Society, 2015. https://doi.org/10.1103/PhysRevLett.115.248101.","ista":"Cepeda Humerez SA, Rieckh G, Tkačik G. 2015. Stochastic proofreading mechanism alleviates crosstalk in transcriptional regulation. Physical Review Letters. 115(24), 248101."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1504.05716","open_access":"1"}],"month":"12","intvolume":" 115","abstract":[{"lang":"eng","text":"Gene expression is controlled primarily by interactions between transcription factor proteins (TFs) and the regulatory DNA sequence, a process that can be captured well by thermodynamic models of regulation. These models, however, neglect regulatory crosstalk: the possibility that noncognate TFs could initiate transcription, with potentially disastrous effects for the cell. Here, we estimate the importance of crosstalk, suggest that its avoidance strongly constrains equilibrium models of TF binding, and propose an alternative nonequilibrium scheme that implements kinetic proofreading to suppress erroneous initiation. This proposal is consistent with the observed covalent modifications of the transcriptional apparatus and predicts increased noise in gene expression as a trade-off for improved specificity. Using information theory, we quantify this trade-off to find when optimal proofreading architectures are favored over their equilibrium counterparts. Such architectures exhibit significant super-Poisson noise at low expression in steady state."}],"oa_version":"Preprint","related_material":{"record":[{"relation":"part_of_dissertation","id":"6473","status":"public"}]},"volume":115,"issue":"24","ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"1576","department":[{"_id":"GaTk"}],"date_updated":"2023-09-07T12:55:21Z"},{"abstract":[{"lang":"eng","text":"We study conditions under which a finite simplicial complex $K$ can be mapped to $\\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\\to \\mathbb R^d$ such that the images of any $r$\r\npairwise disjoint simplices of $K$ do not have a common point. We show that if $r$ is not a prime power and $d\\geq 2r+1$, then there is a counterexample to the topological Tverberg conjecture, i.e., there is an almost $r$-embedding of\r\nthe $(d+1)(r-1)$-simplex in $\\mathbb R^d$. This improves on previous constructions of counterexamples (for $d\\geq 3r$) based on a series of papers by M. \\\"Ozaydin, M. Gromov, P. Blagojevi\\'c, F. Frick, G. Ziegler, and the second and fourth present authors. The counterexamples are obtained by proving the following algebraic criterion in codimension 2: If $r\\ge3$ and if $K$ is a finite $2(r-1)$-complex then there exists an almost $r$-embedding $K\\to \\mathbb R^{2r}$ if and only if there exists a general position PL map $f:K\\to \\mathbb R^{2r}$ such that the algebraic intersection number of the $f$-images of any $r$ pairwise disjoint simplices of $K$ is zero. This result can be restated in terms of cohomological obstructions or equivariant maps, and extends an analogous codimension 3 criterion by the second and fourth authors. As another application we classify ornaments $f:S^3 \\sqcup S^3\\sqcup S^3\\to \\mathbb R^5$ up to ornament\r\nconcordance. It follows from work of M. Freedman, V. Krushkal and P. Teichner that the analogous criterion for $r=2$ is false. We prove a lemma on singular higher-dimensional Borromean rings, yielding an elementary proof of the counterexample."}],"acknowledgement":"We would like to thank A. Klyachko, V. Krushkal, S. Melikhov, M. Tancer, P. Teichner and anonymous referees for helpful discussions.","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.03501"}],"oa":1,"month":"11","publication_status":"submitted","year":"2015","publication":"arXiv","language":[{"iso":"eng"}],"day":"15","date_created":"2020-07-30T10:45:19Z","related_material":{"record":[{"id":"9308","status":"public","relation":"later_version"},{"relation":"later_version","status":"public","id":"10220"},{"id":"8156","status":"public","relation":"dissertation_contains"}]},"date_published":"2015-11-15T00:00:00Z","_id":"8183","article_number":"1511.03501","type":"preprint","status":"public","citation":{"ista":"Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv, 1511.03501.","chicago":"Avvakumov, Sergey, Isaac Mabillard, A. Skopenkov, and Uli Wagner. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” ArXiv, n.d.","apa":"Avvakumov, S., Mabillard, I., Skopenkov, A., & Wagner, U. (n.d.). Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv.","ama":"Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv.","short":"S. Avvakumov, I. Mabillard, A. Skopenkov, U. Wagner, ArXiv (n.d.).","ieee":"S. Avvakumov, I. Mabillard, A. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity intersections, III. Codimension 2,” arXiv. .","mla":"Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” ArXiv, 1511.03501."},"date_updated":"2023-09-07T13:12:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1511.03501"]},"article_processing_charge":"No","author":[{"first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey","last_name":"Avvakumov"},{"first_name":"Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","last_name":"Mabillard","full_name":"Mabillard, Isaac"},{"first_name":"A.","last_name":"Skopenkov","full_name":"Skopenkov, A."},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"title":"Eliminating higher-multiplicity intersections, III. Codimension 2","department":[{"_id":"UlWa"}]},{"date_updated":"2023-09-19T14:36:19Z","citation":{"apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria. https://doi.org/10.15479/AT:IST-2015-340-v1-1","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria; 2015. doi:10.15479/AT:IST-2015-340-v1-1","short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015, doi:10.15479/AT:IST-2015-340-v1-1.","ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"last_name":"Goharshady","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"}],"file_date_updated":"2020-07-14T12:46:56Z","department":[{"_id":"KrCh"}],"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","_id":"5441","type":"technical_report","status":"public","pubrep_id":"340","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","year":"2015","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5531","checksum":"df383dc62c94d7b2ea639aba088a76c6","file_size":861396,"date_updated":"2020-07-14T12:46:56Z","creator":"system","file_name":"IST-2015-340-v1+1_main.pdf","date_created":"2018-12-12T11:54:09Z"}],"day":"11","language":[{"iso":"eng"}],"page":"24","doi":"10.15479/AT:IST-2015-340-v1-1","related_material":{"record":[{"id":"1437","status":"public","relation":"later_version"},{"status":"public","id":"5442","relation":"earlier_version"},{"relation":"later_version","status":"public","id":"6009"}]},"date_published":"2015-07-11T00:00:00Z","date_created":"2018-12-12T11:39:21Z","abstract":[{"lang":"eng","text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. 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. Our 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."}],"oa_version":"Published Version","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"month":"07"},{"month":"07","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"scopus_import":1,"oa":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural properties that arise in program analysis.\r\nWe consider that each component of the concurrent system is a graph with constant treewidth, and it is known that the controlflow graphs of most programs have constant treewidth. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis problems (e.g., alias analysis). The study of multiple queries allows us to consider the tradeoff between the resource usage of the \\emph{one-time} preprocessing and for \\emph{each individual} query. The traditional approaches construct the product graph of all components and apply the best-known graph algorithm on the product. In the traditional approach, even the answer to a single query requires the transitive closure computation (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\n\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, \r\neach 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 that show that the worst-case running times of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (such as improving \r\nthe worst-case bounds for the shortest path problem in general graphs whose current best-known bound has not been improved in five decades). Finally, we provide a prototype implementation of our algorithms which significantly outperforms the existing algorithmic methods on several benchmarks."}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"1437"},{"id":"5441","status":"public","relation":"later_version"},{"relation":"later_version","status":"public","id":"6009"}]},"date_published":"2015-07-14T00:00:00Z","date_created":"2018-12-12T11:39:21Z","page":"22","file":[{"date_updated":"2020-07-14T12:46:57Z","file_size":658747,"creator":"system","date_created":"2018-12-12T11:53:37Z","file_name":"IST-2015-343-v2+1_main.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5498","checksum":"98fd936102f3e057fc321ef6d316001d"},{"relation":"main_file","access_level":"closed","content_type":"text/plain","file_id":"6316","checksum":"b31d09b1241b59c75e1f42dadf09d258","creator":"dernst","file_size":139,"date_updated":"2020-07-14T12:46:57Z","file_name":"IST-2015-343-v2+2_anonymous.txt","date_created":"2019-04-16T12:36:08Z"}],"day":"14","language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","year":"2015","status":"public","pubrep_id":"344","type":"technical_report","_id":"5442","file_date_updated":"2020-07-14T12:46:57Z","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","author":[{"first_name":"1","last_name":"Anonymous","full_name":"Anonymous, 1"},{"first_name":"2","full_name":"Anonymous, 2","last_name":"Anonymous"},{"full_name":"Anonymous, 3","last_name":"Anonymous","first_name":"3"},{"first_name":"4","last_name":"Anonymous","full_name":"Anonymous, 4"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"citation":{"ista":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 22p.","chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015.","ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria; 2015.","apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.","ieee":"1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.","mla":"Anonymous, 1, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015."},"date_updated":"2023-09-19T14:36:19Z"},{"doi":"10.1145/2728606.2728608","related_material":{"record":[{"status":"public","id":"1407","relation":"later_version"}]},"date_published":"2015-04-14T00:00:00Z","ec_funded":1,"date_created":"2018-12-11T11:53:29Z","page":"259 - 268","day":"14","publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","language":[{"iso":"eng"}],"publication_status":"published","year":"2015","month":"04","publisher":"ACM","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.5387"}],"oa":1,"oa_version":"Preprint","abstract":[{"text":"We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. We demonstrate our approach on an illustrative case study.","lang":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games","publist_id":"5456","author":[{"first_name":"Mária","last_name":"Svoreňová","full_name":"Svoreňová, Mária"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cěrná, Ivana","last_name":"Cěrná","first_name":"Ivana"},{"full_name":"Belta, Cǎlin","last_name":"Belta","first_name":"Cǎlin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-20T09:43:09Z","citation":{"ista":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 259–268.","chicago":"Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015. https://doi.org/10.1145/2728606.2728608.","ieee":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 259–268.","short":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–268.","apa":"Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 259–268). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728608","ama":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. ACM; 2015:259-268. doi:10.1145/2728606.2728608","mla":"Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–68, doi:10.1145/2728606.2728608."},"project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"}],"status":"public","type":"conference","conference":{"name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2015-04-14","end_date":"2015-04-16","location":"Seattle, WA, United States"},"_id":"1689"},{"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-21668-3_11.","ista":"Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis. 9207, 180–197.","mla":"Cerny, Pavol, et al. From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis. Vol. 9207, Springer, 2015, pp. 180–97, doi:10.1007/978-3-319-21668-3_11.","apa":"Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., & Tarrach, T. (2015). From non-preemptive to preemptive scheduling using synchronization synthesis. Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21668-3_11","ama":"Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling using synchronization synthesis. 2015;9207:180-197. doi:10.1007/978-3-319-21668-3_11","short":"P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, 9207 (2015) 180–197.","ieee":"P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015."},"title":"From non-preemptive to preemptive scheduling using synchronization synthesis","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny"},{"last_name":"Clarke","full_name":"Clarke, Edmund","first_name":"Edmund"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"},{"first_name":"Leonid","full_name":"Ryzhyk, Leonid","last_name":"Ryzhyk"},{"id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","first_name":"Roopsha","last_name":"Samanta","full_name":"Samanta, Roopsha"},{"first_name":"Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","full_name":"Tarrach, Thorsten","orcid":"0000-0003-4409-8487","last_name":"Tarrach"}],"publist_id":"5398","quality_controlled":"1","publisher":"Springer","day":"01","year":"2015","has_accepted_license":"1","date_created":"2018-12-11T11:53:42Z","date_published":"2015-07-01T00:00:00Z","doi":"10.1007/978-3-319-21668-3_11","page":"180 - 197","series_title":"Lecture Notes in Computer Science","_id":"1729","pubrep_id":"336","status":"public","conference":{"start_date":"2015-07-18","location":"San Francisco, CA, United States","end_date":"2015-07-24","name":"CAV: Computer Aided Verification"},"type":"conference","ddc":["000"],"date_updated":"2023-09-20T11:13:50Z","file_date_updated":"2020-07-14T12:45:13Z","department":[{"_id":"ToHe"}],"oa_version":"Submitted Version","abstract":[{"text":"We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of such sequences produced under a non-preemptive scheduler. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and rules for inserting synchronization. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient, and, since it does not require explicit specifications, is more practical than the conventional approach based on user-provided assertions.","lang":"eng"}],"intvolume":" 9207","month":"07","scopus_import":1,"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2015-336-v1+1_long_version.pdf","date_created":"2018-12-12T10:08:53Z","creator":"system","file_size":481922,"date_updated":"2020-07-14T12:45:13Z","file_id":"4715","checksum":"6ff58ac220e2f20cb001ba35d4924495","relation":"main_file","access_level":"local","content_type":"application/pdf"}],"publication_status":"published","ec_funded":1,"related_material":{"record":[{"status":"public","id":"1130","relation":"dissertation_contains"},{"id":"1338","status":"public","relation":"later_version"}]},"volume":9207},{"department":[{"_id":"ToHe"},{"_id":"CaGu"},{"_id":"NiBa"}],"date_updated":"2023-09-20T11:06:03Z","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2015-04-11","location":"London, United Kingdom","end_date":"2015-04-18"},"type":"conference","status":"public","_id":"1835","series_title":"Lecture Notes in Computer Science","ec_funded":1,"volume":9035,"related_material":{"record":[{"id":"1351","status":"public","relation":"later_version"}]},"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1410.7704","open_access":"1"}],"alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 9035","month":"04","abstract":[{"text":"The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight parameters represent the gene interaction strength that may change due to genetic mutations. For a property of interest, we synthesise the constraints over the parameter space that represent the set of GRNs satisfying the property. We experimentally show that our parameter synthesis procedure computes the mutational robustness of GRNs –an important problem of interest in evolutionary biology– more efficiently than the classical simulation method. We specify the property in linear temporal logics. We employ symbolic bounded model checking and SMT solving to compute the space of GRNs that satisfy the property, which amounts to synthesizing a set of linear constraints on the weights.","lang":"eng"}],"oa_version":"Preprint","publist_id":"5267","author":[{"first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","last_name":"Giacobbe","full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","last_name":"Guet","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","full_name":"Gupta, Ashutosh","last_name":"Gupta"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","full_name":"Paixao, Tiago","orcid":"0000-0003-2361-3953","last_name":"Paixao"},{"id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","first_name":"Tatjana","full_name":"Petrov, Tatjana","orcid":"0000-0002-9041-0905","last_name":"Petrov"}],"title":"Model checking gene regulatory networks","citation":{"mla":"Giacobbe, Mirco, et al. Model Checking Gene Regulatory Networks. Vol. 9035, Springer, 2015, pp. 469–83, doi:10.1007/978-3-662-46681-0_47.","ama":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking gene regulatory networks. 2015;9035:469-483. doi:10.1007/978-3-662-46681-0_47","apa":"Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., & Petrov, T. (2015). Model checking gene regulatory networks. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_47","ieee":"M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov, “Model checking gene regulatory networks,” vol. 9035. Springer, pp. 469–483, 2015.","short":"M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, 9035 (2015) 469–483.","chicago":"Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago Paixao, and Tatjana Petrov. “Model Checking Gene Regulatory Networks.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_47.","ista":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2015. Model checking gene regulatory networks. 9035, 469–483."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"},{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"page":"469 - 483","date_created":"2018-12-11T11:54:16Z","doi":"10.1007/978-3-662-46681-0_47","date_published":"2015-04-01T00:00:00Z","year":"2015","day":"01","oa":1,"quality_controlled":"1","publisher":"Springer","acknowledgement":"SNSF Early Postdoc.Mobility Fellowship, the grant number P2EZP2 148797.\r\n"},{"date_published":"2015-10-01T00:00:00Z","doi":"10.12688/f1000research.7143.1","date_created":"2018-12-11T11:52:26Z","day":"01","publication":"F1000 Research ","has_accepted_license":"1","year":"2015","publisher":"F1000 Research","quality_controlled":"1","oa":1,"acknowledgement":"This work was supported by ERC Independent Research grant (ERC-2011-StG-20101109-PSDP to JF). JM internship was supported by the grant “Action Austria – Slovakia”.\r\nData associated with the article are available under the terms of the Creative Commons Zero \"No rights reserved\" data waiver (CC0 1.0 Public domain dedication). \r\n\r\nData availability: \r\nF1000Research: Dataset 1. Dataset 1, 10.5256/f1000research.7143.d104552\r\n\r\nF1000Research: Dataset 2. Dataset 2, 10.5256/f1000research.7143.d104553\r\n\r\nF1000Research: Dataset 3. Dataset 3, 10.5256/f1000research.7143.d104554","title":"Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene","publist_id":"5668","author":[{"last_name":"Michalko","full_name":"Michalko, Jaroslav","first_name":"Jaroslav","id":"483727CA-F248-11E8-B48F-1D18A9856A87"},{"id":"4342E402-F248-11E8-B48F-1D18A9856A87","first_name":"Marta","last_name":"Dravecka","full_name":"Dravecka, Marta","orcid":"0000-0002-2519-8004"},{"orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Tobias","last_name":"Bollenbach","first_name":"Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Michalko, Jaroslav, Marta Lukacisinova, Mark Tobias Bollenbach, and Jiří Friml. “Embryo-Lethal Phenotypes in Early Abp1 Mutants Are Due to Disruption of the Neighboring BSM Gene.” F1000 Research . F1000 Research, 2015. https://doi.org/10.12688/f1000research.7143.1.","ista":"Michalko J, Lukacisinova M, Bollenbach MT, Friml J. 2015. Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000 Research . 4.","mla":"Michalko, Jaroslav, et al. “Embryo-Lethal Phenotypes in Early Abp1 Mutants Are Due to Disruption of the Neighboring BSM Gene.” F1000 Research , vol. 4, F1000 Research, 2015, doi:10.12688/f1000research.7143.1.","ieee":"J. Michalko, M. Lukacisinova, M. T. Bollenbach, and J. Friml, “Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene,” F1000 Research , vol. 4. F1000 Research, 2015.","short":"J. Michalko, M. Lukacisinova, M.T. Bollenbach, J. Friml, F1000 Research 4 (2015).","ama":"Michalko J, Lukacisinova M, Bollenbach MT, Friml J. Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000 Research . 2015;4. doi:10.12688/f1000research.7143.1","apa":"Michalko, J., Lukacisinova, M., Bollenbach, M. T., & Friml, J. (2015). Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000 Research . F1000 Research. https://doi.org/10.12688/f1000research.7143.1"},"project":[{"grant_number":"282300","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"volume":4,"ec_funded":1,"file":[{"creator":"system","file_size":4414248,"date_updated":"2020-07-14T12:44:59Z","file_name":"IST-2016-497-v1+1_10.12688_f1000research.7143.1_20151102.pdf","date_created":"2018-12-12T10:16:12Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5198","checksum":"8beae5cbe988e1060265ae7de2ee8306"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"10","intvolume":" 4","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"The Auxin Binding Protein1 (ABP1) has been identified based on its ability to bind auxin with high affinity and studied for a long time as a prime candidate for the extracellular auxin receptor responsible for mediating in particular the fast non-transcriptional auxin responses. However, the contradiction between the embryo-lethal phenotypes of the originally described Arabidopsis T-DNA insertional knock-out alleles (abp1-1 and abp1-1s) and the wild type-like phenotypes of other recently described loss-of-function alleles (abp1-c1 and abp1-TD1) questions the biological importance of ABP1 and relevance of the previous genetic studies. Here we show that there is no hidden copy of the ABP1 gene in the Arabidopsis genome but the embryo-lethal phenotypes of abp1-1 and abp1-1s alleles are very similar to the knock-out phenotypes of the neighboring gene, BELAYA SMERT (BSM). Furthermore, the allelic complementation test between bsm and abp1 alleles shows that the embryo-lethality in the abp1-1 and abp1-1s alleles is caused by the off-target disruption of the BSM locus by the T-DNA insertions. This clarifies the controversy of different phenotypes among published abp1 knock-out alleles and asks for reflections on the developmental role of ABP1."}],"file_date_updated":"2020-07-14T12:44:59Z","department":[{"_id":"JiFr"},{"_id":"ToBo"}],"ddc":["570"],"date_updated":"2023-10-10T14:10:24Z","status":"public","pubrep_id":"497","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"1509"},{"title":"Evolution of decisions in population games with sequentially searching individuals","article_processing_charge":"No","publist_id":"5467","author":[{"first_name":"Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","full_name":"Priklopil, Tadeas","last_name":"Priklopil"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Priklopil, T., & Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. Games. MDPI. https://doi.org/10.3390/g6040413","ama":"Priklopil T, Chatterjee K. Evolution of decisions in population games with sequentially searching individuals. Games. 2015;6(4):413-437. doi:10.3390/g6040413","short":"T. Priklopil, K. Chatterjee, Games 6 (2015) 413–437.","ieee":"T. Priklopil and K. Chatterjee, “Evolution of decisions in population games with sequentially searching individuals,” Games, vol. 6, no. 4. MDPI, pp. 413–437, 2015.","mla":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” Games, vol. 6, no. 4, MDPI, 2015, pp. 413–37, doi:10.3390/g6040413.","ista":"Priklopil T, Chatterjee K. 2015. Evolution of decisions in population games with sequentially searching individuals. Games. 6(4), 413–437.","chicago":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” Games. MDPI, 2015. https://doi.org/10.3390/g6040413."},"project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-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","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_created":"2018-12-11T11:53:26Z","date_published":"2015-09-29T00:00:00Z","doi":"10.3390/g6040413","page":"413 - 437","publication":"Games","day":"29","year":"2015","has_accepted_license":"1","oa":1,"publisher":"MDPI","quality_controlled":"1","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:45:12Z","ddc":["000"],"date_updated":"2023-10-17T11:42:52Z","pubrep_id":"448","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","_id":"1681","ec_funded":1,"issue":"4","volume":6,"language":[{"iso":"eng"}],"file":[{"creator":"system","file_size":518832,"date_updated":"2020-07-14T12:45:12Z","file_name":"IST-2016-448-v1+1_games-06-00413.pdf","date_created":"2018-12-12T10:12:41Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4959","checksum":"912e1acbaf201100f447a43e4d5958bd"}],"publication_status":"published","publication_identifier":{"eissn":["2073-4336"]},"intvolume":" 6","month":"09","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"In many social situations, individuals endeavor to find the single best possible partner, but are constrained to evaluate the candidates in sequence. Examples include the search for mates, economic partnerships, or any other long-term ties where the choice to interact involves two parties. Surprisingly, however, previous theoretical work on mutual choice problems focuses on finding equilibrium solutions, while ignoring the evolutionary dynamics of decisions. Empirically, this may be of high importance, as some equilibrium solutions can never be reached unless the population undergoes radical changes and a sufficient number of individuals change their decisions simultaneously. To address this question, we apply a mutual choice sequential search problem in an evolutionary game-theoretical model that allows one to find solutions that are favored by evolution. As an example, we study the influence of sequential search on the evolutionary dynamics of cooperation. For this, we focus on the classic snowdrift game and the prisoner’s dilemma game.","lang":"eng"}]},{"volume":17,"issue":"10","ec_funded":1,"file":[{"file_name":"IST-2016-464-v1+1_entropy-17-07266.pdf","date_created":"2018-12-12T10:12:25Z","creator":"system","file_size":6455007,"date_updated":"2020-07-14T12:45:08Z","checksum":"945d99631a96e0315acb26dc8541dcf9","file_id":"4943","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"10","intvolume":" 17","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Quantifying behaviors of robots which were generated autonomously from task-independent objective functions is an important prerequisite for objective comparisons of algorithms and movements of animals. The temporal sequence of such a behavior can be considered as a time series and hence complexity measures developed for time series are natural candidates for its quantification. The predictive information and the excess entropy are such complexity measures. They measure the amount of information the past contains about the future and thus quantify the nonrandom structure in the temporal sequence. However, when using these measures for systems with continuous states one has to deal with the fact that their values will depend on the resolution with which the systems states are observed. For deterministic systems both measures will diverge with increasing resolution. We therefore propose a new decomposition of the excess entropy in resolution dependent and resolution independent parts and discuss how they depend on the dimensionality of the dynamics, correlations and the noise level. For the practical estimation we propose to use estimates based on the correlation integral instead of the direct estimation of the mutual information based on next neighbor statistics because the latter allows less control of the scale dependencies. Using our algorithm we are able to show how autonomous learning generates behavior of increasing complexity with increasing learning duration.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:08Z","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"ddc":["000"],"date_updated":"2023-10-17T11:42:00Z","status":"public","pubrep_id":"464","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"1655","doi":"10.3390/e17107266","date_published":"2015-10-23T00:00:00Z","date_created":"2018-12-11T11:53:17Z","page":"7266 - 7297","day":"23","publication":"Entropy","has_accepted_license":"1","year":"2015","quality_controlled":"1","publisher":"MDPI","oa":1,"acknowledgement":"This work was supported by the DFG priority program 1527 (Autonomous Learning) and by the European Community’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 318723 (MatheMACS) and from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 291734.","title":"Quantifying emergent behavior of autonomous robots","author":[{"full_name":"Martius, Georg S","last_name":"Martius","first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Eckehard","last_name":"Olbrich","full_name":"Olbrich, Eckehard"}],"publist_id":"5495","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"G.S. Martius, E. Olbrich, Entropy 17 (2015) 7266–7297.","ieee":"G. S. Martius and E. Olbrich, “Quantifying emergent behavior of autonomous robots,” Entropy, vol. 17, no. 10. MDPI, pp. 7266–7297, 2015.","ama":"Martius GS, Olbrich E. Quantifying emergent behavior of autonomous robots. Entropy. 2015;17(10):7266-7297. doi:10.3390/e17107266","apa":"Martius, G. S., & Olbrich, E. (2015). Quantifying emergent behavior of autonomous robots. Entropy. MDPI. https://doi.org/10.3390/e17107266","mla":"Martius, Georg S., and Eckehard Olbrich. “Quantifying Emergent Behavior of Autonomous Robots.” Entropy, vol. 17, no. 10, MDPI, 2015, pp. 7266–97, doi:10.3390/e17107266.","ista":"Martius GS, Olbrich E. 2015. Quantifying emergent behavior of autonomous robots. Entropy. 17(10), 7266–7297.","chicago":"Martius, Georg S, and Eckehard Olbrich. “Quantifying Emergent Behavior of Autonomous Robots.” Entropy. MDPI, 2015. https://doi.org/10.3390/e17107266."},"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}]},{"doi":"10.1177/1759091415575845","date_published":"2015-04-13T00:00:00Z","date_created":"2018-12-11T11:54:16Z","has_accepted_license":"1","year":"2015","day":"13","publication":"ASN Neuro","quality_controlled":"1","publisher":"SAGE Publications","oa":1,"author":[{"first_name":"Chong","id":"3DFD581A-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","full_name":"Chen, Chong"},{"full_name":"Wang, Chao","last_name":"Wang","first_name":"Chao"},{"first_name":"Xuan","full_name":"Zhao, Xuan","last_name":"Zhao"},{"first_name":"Tao","last_name":"Zhou","full_name":"Zhou, Tao"},{"full_name":"Xu, Dao","last_name":"Xu","first_name":"Dao"},{"first_name":"Zhi","full_name":"Wang, Zhi","last_name":"Wang"},{"full_name":"Wang, Ying","last_name":"Wang","first_name":"Ying"}],"publist_id":"5269","article_processing_charge":"No","title":"Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats","citation":{"ama":"Chen C, Wang C, Zhao X, et al. Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. 2015;7(2). doi:10.1177/1759091415575845","apa":"Chen, C., Wang, C., Zhao, X., Zhou, T., Xu, D., Wang, Z., & Wang, Y. (2015). Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. SAGE Publications. https://doi.org/10.1177/1759091415575845","short":"C. Chen, C. Wang, X. Zhao, T. Zhou, D. Xu, Z. Wang, Y. Wang, ASN Neuro 7 (2015).","ieee":"C. Chen et al., “Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats,” ASN Neuro, vol. 7, no. 2. SAGE Publications, 2015.","mla":"Chen, Chong, et al. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis and Facilitates the Development of Dentate Gyrus-Dependent Learning in Neonatal Rats.” ASN Neuro, vol. 7, no. 2, SAGE Publications, 2015, doi:10.1177/1759091415575845.","ista":"Chen C, Wang C, Zhao X, Zhou T, Xu D, Wang Z, Wang Y. 2015. Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. 7(2).","chicago":"Chen, Chong, Chao Wang, Xuan Zhao, Tao Zhou, Dao Xu, Zhi Wang, and Ying Wang. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis and Facilitates the Development of Dentate Gyrus-Dependent Learning in Neonatal Rats.” ASN Neuro. SAGE Publications, 2015. https://doi.org/10.1177/1759091415575845."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":7,"issue":"2","license":"https://creativecommons.org/licenses/by/3.0/","publication_status":"published","file":[{"date_created":"2018-12-12T10:14:08Z","file_name":"IST-2016-456-v1+1_ASN_Neuro-2015-Chen-.pdf","date_updated":"2020-07-14T12:45:18Z","file_size":1146814,"creator":"system","checksum":"53e16bd3fc2ae2c0d7de9164626c37aa","file_id":"5057","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"04","intvolume":" 7","abstract":[{"lang":"eng","text":"Huge body of evidences demonstrated that volatile anesthetics affect the hippocampal neurogenesis and neurocognitive functions, and most of them showed impairment at anesthetic dose. Here, we investigated the effect of low dose (1.8%) sevoflurane on hippocampal neurogenesis and dentate gyrus-dependent learning. Neonatal rats at postnatal day 4 to 6 (P4-6) were treated with 1.8% sevoflurane for 6 hours. Neurogenesis was quantified by bromodeoxyuridine labeling and electrophysiology recording. Four and seven weeks after treatment, the Morris water maze and contextual-fear discrimination learning tests were performed to determine the influence on spatial learning and pattern separation. A 6-hour treatment with 1.8% sevoflurane promoted hippocampal neurogenesis and increased the survival of newborn cells and the proportion of immature granular cells in the dentate gyrus of neonatal rats. Sevoflurane-treated rats performed better during the training days of the Morris water maze test and in contextual-fear discrimination learning test. These results suggest that a subanesthetic dose of sevoflurane promotes hippocampal neurogenesis in neonatal rats and facilitates their performance in dentate gyrus-dependent learning tasks."}],"oa_version":"Published Version","department":[{"_id":"PeJo"}],"file_date_updated":"2020-07-14T12:45:18Z","date_updated":"2023-10-18T06:47:30Z","ddc":["570"],"article_type":"original","type":"journal_article","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"status":"public","pubrep_id":"456","_id":"1834"},{"year":"2015","publication":"Annales de la faculté des sciences de Toulouse","day":"01","page":"781 - 800","date_created":"2018-12-11T11:53:10Z","date_published":"2015-01-01T00:00:00Z","doi":"10.5802/afst.1464","oa":1,"quality_controlled":"1","publisher":"Faculté des sciences de Toulouse","citation":{"ieee":"M. Erbar, J. Maas, and P. Tetali, “Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models,” Annales de la faculté des sciences de Toulouse, vol. 24, no. 4. Faculté des sciences de Toulouse, pp. 781–800, 2015.","short":"M. Erbar, J. Maas, P. Tetali, Annales de La Faculté Des Sciences de Toulouse 24 (2015) 781–800.","apa":"Erbar, M., Maas, J., & Tetali, P. (2015). Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. Annales de La Faculté Des Sciences de Toulouse. Faculté des sciences de Toulouse. https://doi.org/10.5802/afst.1464","ama":"Erbar M, Maas J, Tetali P. Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. Annales de la faculté des sciences de Toulouse. 2015;24(4):781-800. doi:10.5802/afst.1464","mla":"Erbar, Matthias, et al. “Discrete Ricci Curvature Bounds for Bernoulli-Laplace and Random Transposition Models.” Annales de La Faculté Des Sciences de Toulouse, vol. 24, no. 4, Faculté des sciences de Toulouse, 2015, pp. 781–800, doi:10.5802/afst.1464.","ista":"Erbar M, Maas J, Tetali P. 2015. Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. Annales de la faculté des sciences de Toulouse. 24(4), 781–800.","chicago":"Erbar, Matthias, Jan Maas, and Prasad Tetali. “Discrete Ricci Curvature Bounds for Bernoulli-Laplace and Random Transposition Models.” Annales de La Faculté Des Sciences de Toulouse. Faculté des sciences de Toulouse, 2015. https://doi.org/10.5802/afst.1464."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1409.8605"]},"article_processing_charge":"No","publist_id":"5520","author":[{"first_name":"Matthias","full_name":"Erbar, Matthias","last_name":"Erbar"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338"},{"last_name":"Tetali","full_name":"Tetali, Prasad","first_name":"Prasad"}],"title":"Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models","publication_status":"published","language":[{"iso":"eng"}],"issue":"4","volume":24,"abstract":[{"lang":"eng","text":"We calculate a Ricci curvature lower bound for some classical examples of random walks, namely, a chain on a slice of the n-dimensional discrete cube (the so-called Bernoulli-Laplace model) and the random transposition shuffle of the symmetric group of permutations on n letters."}],"oa_version":"Preprint","main_file_link":[{"url":"http://arxiv.org/abs/1409.8605","open_access":"1"}],"intvolume":" 24","month":"01","date_updated":"2023-10-18T07:48:28Z","department":[{"_id":"JaMa"}],"_id":"1635","article_type":"original","type":"journal_article","status":"public"},{"title":"Efficient production of single-stranded phage DNA as scaffolds for DNA origami","article_processing_charge":"No","external_id":{"pmid":["26028443"]},"author":[{"first_name":"B","last_name":"Kick","full_name":"Kick, B"},{"full_name":"Praetorius, Florian M","last_name":"Praetorius","id":"dfec9381-4341-11ee-8fd8-faa02bba7d62","first_name":"Florian M"},{"last_name":"Dietz","full_name":"Dietz, H","first_name":"H"},{"first_name":"D","last_name":"Weuster-Botz","full_name":"Weuster-Botz, D"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Kick B, Praetorius FM, Dietz H, Weuster-Botz D. 2015. Efficient production of single-stranded phage DNA as scaffolds for DNA origami. Nano Letters. 15(7), 4672–4676.","chicago":"Kick, B, Florian M Praetorius, H Dietz, and D Weuster-Botz. “Efficient Production of Single-Stranded Phage DNA as Scaffolds for DNA Origami.” Nano Letters. ACS Publications, 2015. https://doi.org/10.1021/acs.nanolett.5b01461.","apa":"Kick, B., Praetorius, F. M., Dietz, H., & Weuster-Botz, D. (2015). Efficient production of single-stranded phage DNA as scaffolds for DNA origami. Nano Letters. ACS Publications. https://doi.org/10.1021/acs.nanolett.5b01461","ama":"Kick B, Praetorius FM, Dietz H, Weuster-Botz D. Efficient production of single-stranded phage DNA as scaffolds for DNA origami. Nano Letters. 2015;15(7):4672-4676. doi:10.1021/acs.nanolett.5b01461","short":"B. Kick, F.M. Praetorius, H. Dietz, D. Weuster-Botz, Nano Letters 15 (2015) 4672–4676.","ieee":"B. Kick, F. M. Praetorius, H. Dietz, and D. Weuster-Botz, “Efficient production of single-stranded phage DNA as scaffolds for DNA origami,” Nano Letters, vol. 15, no. 7. ACS Publications, pp. 4672–4676, 2015.","mla":"Kick, B., et al. “Efficient Production of Single-Stranded Phage DNA as Scaffolds for DNA Origami.” Nano Letters, vol. 15, no. 7, ACS Publications, 2015, pp. 4672–76, doi:10.1021/acs.nanolett.5b01461."},"oa":1,"publisher":"ACS Publications","quality_controlled":"1","date_created":"2023-09-06T12:52:47Z","date_published":"2015-06-01T00:00:00Z","doi":"10.1021/acs.nanolett.5b01461","page":"4672-4676","publication":"Nano Letters","day":"01","year":"2015","status":"public","type":"journal_article","article_type":"letter_note","_id":"14303","extern":"1","date_updated":"2023-11-07T11:56:32Z","intvolume":" 15","month":"06","main_file_link":[{"url":"https://doi.org/10.1021/acs.nanolett.5b01461","open_access":"1"}],"oa_version":"Published Version","pmid":1,"abstract":[{"text":"Scaffolded DNA origami enables the fabrication of a variety of complex nanostructures that promise utility in diverse fields of application, ranging from biosensing over advanced therapeutics to metamaterials. The broad applicability of DNA origami as a material beyond the level of proof-of-concept studies critically depends, among other factors, on the availability of large amounts of pure single-stranded scaffold DNA. Here, we present a method for the efficient production of M13 bacteriophage-derived genomic DNA using high-cell-density fermentation of Escherichia coli in stirred-tank bioreactors. We achieve phage titers of up to 1.6 × 1014 plaque-forming units per mL. Downstream processing yields up to 410 mg of high-quality single-stranded DNA per one liter reaction volume, thus upgrading DNA origami-based nanotechnology from the milligram to the gram scale.","lang":"eng"}],"issue":"7","volume":15,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]}},{"oa":1,"publisher":"Springer","quality_controlled":"1","acknowledgement":"This research was funded in part by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE) and Z211-N23 (Wittgenstein Award), European Research Council (ERC) Grant No 279307 (Graph Games), ERC Grant No 267989 (QUAREM), the Czech Science Foundation Grant No P202/12/G061, and People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) REA Grant No 291734.","page":"158 - 177","date_created":"2018-12-11T11:52:58Z","doi":"10.1007/978-3-319-21690-4_10","date_published":"2015-07-16T00:00:00Z","year":"2015","day":"16","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"author":[{"first_name":"Tomáš","full_name":"Brázdil, Tomáš","last_name":"Brázdil"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Fellner, Andreas","last_name":"Fellner"},{"full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"publist_id":"5564","title":"Counterexample explanation by learning small strategies in Markov decision processes","citation":{"short":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer, 2015, pp. 158–177.","ieee":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.","ama":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. Counterexample explanation by learning small strategies in Markov decision processes. In: Vol 9206. Springer; 2015:158-177. doi:10.1007/978-3-319-21690-4_10","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21690-4_10","mla":"Brázdil, Tomáš, et al. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Vol. 9206, Springer, 2015, pp. 158–77, doi:10.1007/978-3-319-21690-4_10.","ista":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample explanation by learning small strategies in Markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 9206, 158–177.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,” 9206:158–77. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_10."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1502.02834"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 9206","month":"07","abstract":[{"text":"For deterministic systems, a counterexample to a property can simply be an error trace, whereas counterexamples in probabilistic systems are necessarily more complex. For instance, a set of erroneous traces with a sufficient cumulative probability mass can be used. Since these are too large objects to understand and manipulate, compact representations such as subchains have been considered. In the case of probabilistic systems with non-determinism, the situation is even more complex. While a subchain for a given strategy (or scheduler, resolving non-determinism) is a straightforward choice, we take a different approach. Instead, we focus on the strategy itself, and extract the most important decisions it makes, and present its succinct representation.\r\nThe key tools we employ to achieve this are (1) introducing a concept of importance of a state w.r.t. the strategy, and (2) learning using decision trees. There are three main consequent advantages of our approach. Firstly, it exploits the quantitative information on states, stressing the more important decisions. Secondly, it leads to a greater variability and degree of freedom in representing the strategies. Thirdly, the representation uses a self-explanatory data structure. In summary, our approach produces more succinct and more explainable strategies, as opposed to e.g. binary decision diagrams. Finally, our experimental results show that we can extract several rules describing the strategy even for very large systems that do not fit in memory, and based on the rules explain the erroneous behaviour.","lang":"eng"}],"oa_version":"Preprint","ec_funded":1,"volume":9206,"related_material":{"record":[{"relation":"research_paper","status":"public","id":"5549"}]},"publication_status":"published","publication_identifier":{"eisbn":["978-3-319-21690-4"]},"language":[{"iso":"eng"}],"conference":{"start_date":"2015-07-18","end_date":"2015-07-24","location":"San Francisco, CA, United States","name":"CAV: Computer Aided Verification"},"type":"conference","status":"public","_id":"1603","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2024-02-21T13:52:07Z"},{"project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"title":"Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes","article_processing_charge":"No","publist_id":"5564","author":[{"last_name":"Fellner","full_name":"Fellner, Andreas","first_name":"Andreas","id":"42BABFB4-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, Institute of Science and Technology Austria, 10.15479/AT:ISTA:28.","chicago":"Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015. https://doi.org/10.15479/AT:ISTA:28.","apa":"Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:28","ama":"Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. 2015. doi:10.15479/AT:ISTA:28","short":"A. Fellner, (2015).","ieee":"A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.","mla":"Fellner, Andreas. Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria, 2015, doi:10.15479/AT:ISTA:28."},"oa":1,"publisher":"Institute of Science and Technology Austria","date_created":"2018-12-12T12:31:29Z","date_published":"2015-08-13T00:00:00Z","doi":"10.15479/AT:ISTA:28","day":"13","year":"2015","has_accepted_license":"1","keyword":["Markov Decision Process","Decision Tree","Probabilistic Verification","Counterexample Explanation"],"status":"public","tmp":{"image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"type":"research_data","_id":"5549","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:00Z","ddc":["004"],"date_updated":"2024-02-21T13:52:07Z","month":"08","oa_version":"Published Version","abstract":[{"lang":"eng","text":"This repository contains the experimental part of the CAV 2015 publication Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe extended the probabilistic model checker PRISM to represent strategies of Markov Decision Processes as Decision Trees.\r\nThe archive contains a java executable version of the extended tool (prism_dectree.jar) together with a few examples of the PRISM benchmark library.\r\nTo execute the program, please have a look at the README.txt, which provides instructions and further information on the archive.\r\nThe archive contains scripts that (if run often enough) reproduces the data presented in the publication."}],"license":"https://creativecommons.org/publicdomain/zero/1.0/","contributor":[{"last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"related_material":{"record":[{"relation":"popular_science","id":"1603","status":"public"}]},"file":[{"checksum":"b8bcb43c0893023cda66c1b69c16ac62","file_id":"5597","access_level":"open_access","relation":"main_file","content_type":"application/zip","date_created":"2018-12-12T13:02:31Z","file_name":"IST-2015-28-v1+2_Fellner_DataRep.zip","creator":"system","date_updated":"2020-07-14T12:47:00Z","file_size":49557109}],"datarep_id":"28"},{"pubrep_id":"501","status":"public","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2015-06-22","end_date":"2015-06-25","location":"Eindhoven, Netherlands"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","_id":"1512","file_date_updated":"2020-07-14T12:45:00Z","department":[{"_id":"UlWa"}],"ddc":["510"],"date_updated":"2024-02-28T12:59:37Z","intvolume":" 34","month":"01","scopus_import":"1","alternative_title":["LIPIcs"],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b,d) such that the following holds. If F is a finite family of subsets of R^d such that the ith reduced Betti number (with Z_2 coefficients in singular homology) of the intersection of any proper subfamily G of F is at most b for every non-negative integer i less or equal to (d-1)/2, then F has Helly number at most h(b,d). These topological conditions are sharp: not controlling any of these first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex K, some well-behaved chain map from C_*(K) to C_*(R^d). Both techniques are of independent interest."}],"related_material":{"record":[{"id":"424","status":"public","relation":"later_version"}]},"volume":34,"language":[{"iso":"eng"}],"file":[{"file_size":633712,"date_updated":"2020-07-14T12:45:00Z","creator":"system","file_name":"IST-2016-501-v1+1_46.pdf","date_created":"2018-12-12T10:10:09Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"4794","checksum":"e6881df44d87fe0c2529c9f7b2724614"}],"publication_status":"published","title":"Bounding Helly numbers via Betti numbers","article_processing_charge":"No","author":[{"first_name":"Xavier","full_name":"Goaoc, Xavier","last_name":"Goaoc"},{"first_name":"Pavel","last_name":"Paták","full_name":"Paták, Pavel"},{"orcid":"0000-0002-3975-1683","full_name":"Patakova, Zuzana","last_name":"Patakova","first_name":"Zuzana"},{"last_name":"Tancer","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714","first_name":"Martin"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"publist_id":"5665","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2015. Bounding Helly numbers via Betti numbers. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 507–521.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Bounding Helly Numbers via Betti Numbers,” 34:507–21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.SOCG.2015.507.","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2015). Bounding Helly numbers via Betti numbers (Vol. 34, pp. 507–521). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SOCG.2015.507","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding Helly numbers via Betti numbers. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:507-521. doi:10.4230/LIPIcs.SOCG.2015.507","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–521.","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding Helly numbers via Betti numbers,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 507–521.","mla":"Goaoc, Xavier, et al. Bounding Helly Numbers via Betti Numbers. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–21, doi:10.4230/LIPIcs.SOCG.2015.507."},"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":"PP, ZP and MT were partially supported by the Charles University Grant GAUK 421511. ZP was\r\npartially supported by the Charles University Grant SVV-2014-260103. ZP and MT were partially\r\nsupported by the ERC Advanced Grant No. 267165 and by the project CE-ITI (GACR P202/12/G061)\r\nof the Czech Science Foundation. UW was partially supported by the Swiss National Science Foundation\r\n(grants SNSF-200020-138230 and SNSF-PP00P2-138948). Part of this work was done when XG was affiliated with INRIA Nancy Grand-Est and when MT was affiliated with Institutionen för matematik, Kungliga Tekniska Högskolan, then IST Austria.","date_created":"2018-12-11T11:52:27Z","doi":"10.4230/LIPIcs.SOCG.2015.507","date_published":"2015-01-01T00:00:00Z","page":"507 - 521","day":"01","year":"2015","has_accepted_license":"1"},{"title":"Improvements in Birch's theorem on forms in many variables","external_id":{"arxiv":["1402.4489"]},"article_processing_charge":"No","publist_id":"7631","author":[{"first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177"},{"last_name":"Prendiville","full_name":"Prendiville, Sean","first_name":"Sean"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Browning, Timothy D., and Sean Prendiville. “Improvements in Birch’s Theorem on Forms in Many Variables.” Journal Fur Die Reine Und Angewandte Mathematik, vol. 2017, no. 731, Walter de Gruyter, pp. 203–34, doi:10.1515/crelle-2014-0122.","ama":"Browning TD, Prendiville S. Improvements in Birch’s theorem on forms in many variables. Journal fur die Reine und Angewandte Mathematik. 2017(731):203-234. doi:10.1515/crelle-2014-0122","apa":"Browning, T. D., & Prendiville, S. (n.d.). Improvements in Birch’s theorem on forms in many variables. Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter. https://doi.org/10.1515/crelle-2014-0122","ieee":"T. D. Browning and S. Prendiville, “Improvements in Birch’s theorem on forms in many variables,” Journal fur die Reine und Angewandte Mathematik, vol. 2017, no. 731. Walter de Gruyter, pp. 203–234.","short":"T.D. Browning, S. Prendiville, Journal Fur Die Reine Und Angewandte Mathematik 2017 (n.d.) 203–234.","chicago":"Browning, Timothy D, and Sean Prendiville. “Improvements in Birch’s Theorem on Forms in Many Variables.” Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter, n.d. https://doi.org/10.1515/crelle-2014-0122.","ista":"Browning TD, Prendiville S. Improvements in Birch’s theorem on forms in many variables. Journal fur die Reine und Angewandte Mathematik. 2017(731), 203–234."},"date_created":"2018-12-11T11:45:32Z","doi":"10.1515/crelle-2014-0122","date_published":"2015-02-20T00:00:00Z","page":"203 - 234","publication":"Journal fur die Reine und Angewandte Mathematik","day":"20","year":"2015","oa":1,"quality_controlled":"1","publisher":"Walter de Gruyter","acknowledgement":"While working on this paper the authors were supported by the Leverhulme Trust and ERC grant 306457.","extern":"1","date_updated":"2024-03-05T12:09:22Z","status":"public","type":"journal_article","article_type":"original","_id":"271","related_material":{"record":[{"id":"256","status":"public","relation":"later_version"}]},"volume":2017,"issue":"731","language":[{"iso":"eng"}],"publication_status":"submitted","publication_identifier":{"issn":["0075-4102"]},"intvolume":" 2017","month":"02","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1402.4489"}],"oa_version":"Preprint","abstract":[{"text":"We show that a non-singular integral form of degree d is soluble non-trivially over the integers if and only if it is soluble non-trivially over the reals and the p-adic numbers, provided that the form has at least (d-\\sqrt{d}/2)2^d variables. This improves on a longstanding result of Birch.","lang":"eng"}]},{"type":"conference","conference":{"end_date":"2015-08-20","location":"Santa Barbara, CA, United States","start_date":"2015-08-16","name":"CRYPTO: International Cryptology Conference"},"status":"public","pubrep_id":"671","_id":"1675","department":[{"_id":"VlKo"},{"_id":"KrPi"}],"date_updated":"2024-03-20T08:31:49Z","alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2013/796.pdf","open_access":"1"}],"month":"08","intvolume":" 9216","abstract":[{"lang":"eng","text":"Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto’92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of computational work to every request. The original applications included prevention of spam and protection against denial of service attacks. More recently, PoWs have been used to prevent double spending in the Bitcoin digital currency system. In this work, we put forward an alternative concept for PoWs - so-called proofs of space (PoS), where a service requestor must dedicate a significant amount of disk space as opposed to computation. We construct secure PoS schemes in the random oracle model (with one additional mild assumption required for the proof to go through), using graphs with high “pebbling complexity” and Merkle hash-trees. We discuss some applications, including follow-up work where a decentralized digital currency scheme called Spacecoin is constructed that uses PoS (instead of wasteful PoW like in Bitcoin) to prevent double spending. The main technical contribution of this work is the construction of (directed, loop-free) graphs on N vertices with in-degree O(log logN) such that even if one places Θ(N) pebbles on the nodes of the graph, there’s a constant fraction of nodes that needs Θ(N) steps to be pebbled (where in every step one can put a pebble on a node if all its parents have a pebble)."}],"oa_version":"Preprint","related_material":{"record":[{"relation":"earlier_version","id":"2274","status":"public"}]},"volume":9216,"ec_funded":1,"publication_identifier":{"isbn":["9783662479995"],"issn":["0302-9743"]},"publication_status":"published","language":[{"iso":"eng"}],"project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"},{"grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"publist_id":"5474","author":[{"last_name":"Dziembowski","full_name":"Dziembowski, Stefan","first_name":"Stefan"},{"last_name":"Faust","full_name":"Faust, Sebastian","first_name":"Sebastian"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"article_processing_charge":"No","title":"Proofs of space","citation":{"mla":"Dziembowski, Stefan, et al. “Proofs of Space.” 35th Annual Cryptology Conference, vol. 9216, Springer, 2015, pp. 585–605, doi:10.1007/978-3-662-48000-7_29.","ieee":"S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” in 35th Annual Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 585–605.","short":"S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, in:, 35th Annual Cryptology Conference, Springer, 2015, pp. 585–605.","ama":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. Proofs of space. In: 35th Annual Cryptology Conference. Vol 9216. Springer; 2015:585-605. doi:10.1007/978-3-662-48000-7_29","apa":"Dziembowski, S., Faust, S., Kolmogorov, V., & Pietrzak, K. Z. (2015). Proofs of space. In 35th Annual Cryptology Conference (Vol. 9216, pp. 585–605). Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_29","chicago":"Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. “Proofs of Space.” In 35th Annual Cryptology Conference, 9216:585–605. Springer, 2015. https://doi.org/10.1007/978-3-662-48000-7_29.","ista":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2015. Proofs of space. 35th Annual Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 9216, 585–605."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Springer","oa":1,"page":"585 - 605","date_published":"2015-08-01T00:00:00Z","doi":"10.1007/978-3-662-48000-7_29","date_created":"2018-12-11T11:53:24Z","year":"2015","day":"01","publication":"35th Annual Cryptology Conference"}]