[{"volume":115,"issue":"32","publication_status":"published","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30026198"}],"scopus_import":"1","intvolume":" 115","month":"08","abstract":[{"lang":"eng","text":"The optic tectum (TeO), or superior colliculus, is a multisensory midbrain center that organizes spatially orienting responses to relevant stimuli. To define the stimulus with the highest priority at each moment, a network of reciprocal connections between the TeO and the isthmi promotes competition between concurrent tectal inputs. In the avian midbrain, the neurons mediating enhancement and suppression of tectal inputs are located in separate isthmic nuclei, facilitating the analysis of the neural processes that mediate competition. A specific subset of radial neurons in the intermediate tectal layers relay retinal inputs to the isthmi, but at present it is unclear whether separate neurons innervate individual nuclei or a single neural type sends a common input to several of them. In this study, we used in vitro neural tracing and cell-filling experiments in chickens to show that single neurons innervate, via axon collaterals, the three nuclei that comprise the isthmotectal network. This demonstrates that the input signals representing the strength of the incoming stimuli are simultaneously relayed to the mechanisms promoting both enhancement and suppression of the input signals. By performing in vivo recordings in anesthetized chicks, we also show that this common input generates synchrony between both antagonistic mechanisms, demonstrating that activity enhancement and suppression are closely coordinated. From a computational point of view, these results suggest that these tectal neurons constitute integrative nodes that combine inputs from different sources to drive in parallel several concurrent neural processes, each performing complementary functions within the network through different firing patterns and connectivity."}],"oa_version":"Submitted Version","pmid":1,"department":[{"_id":"MaJö"}],"date_updated":"2023-09-19T14:35:36Z","type":"journal_article","status":"public","_id":"6010","page":"E7615-E7623","date_created":"2019-02-14T14:33:34Z","date_published":"2018-08-07T00:00:00Z","doi":"10.1073/pnas.1804517115","year":"2018","isi":1,"publication":"Proceedings of the National Academy of Sciences","day":"07","oa":1,"publisher":"National Academy of Sciences","quality_controlled":"1","article_processing_charge":"No","external_id":{"pmid":["30026198"],"isi":["000440982000020"]},"author":[{"last_name":"Garrido-Charad","full_name":"Garrido-Charad, Florencia","first_name":"Florencia"},{"full_name":"Vega Zuniga, Tomas A","last_name":"Vega Zuniga","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87","first_name":"Tomas A"},{"last_name":"Gutiérrez-Ibáñez","full_name":"Gutiérrez-Ibáñez, Cristián","first_name":"Cristián"},{"full_name":"Fernandez, Pedro","last_name":"Fernandez","first_name":"Pedro"},{"last_name":"López-Jury","full_name":"López-Jury, Luciana","first_name":"Luciana"},{"first_name":"Cristian","last_name":"González-Cabrera","full_name":"González-Cabrera, Cristian"},{"first_name":"Harvey J.","full_name":"Karten, Harvey J.","last_name":"Karten"},{"full_name":"Luksch, Harald","last_name":"Luksch","first_name":"Harald"},{"first_name":"Gonzalo J.","full_name":"Marín, Gonzalo J.","last_name":"Marín"}],"title":"“Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network","citation":{"chicago":"Garrido-Charad, Florencia, Tomas A Vega Zuniga, Cristián Gutiérrez-Ibáñez, Pedro Fernandez, Luciana López-Jury, Cristian González-Cabrera, Harvey J. Karten, Harald Luksch, and Gonzalo J. Marín. ““Shepherd’s Crook” Neurons Drive and Synchronize the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1804517115.","ista":"Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, Fernandez P, López-Jury L, González-Cabrera C, Karten HJ, Luksch H, Marín GJ. 2018. “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. Proceedings of the National Academy of Sciences. 115(32), E7615–E7623.","mla":"Garrido-Charad, Florencia, et al. ““Shepherd’s Crook” Neurons Drive and Synchronize the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.” Proceedings of the National Academy of Sciences, vol. 115, no. 32, National Academy of Sciences, 2018, pp. E7615–23, doi:10.1073/pnas.1804517115.","ama":"Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, et al. “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. Proceedings of the National Academy of Sciences. 2018;115(32):E7615-E7623. doi:10.1073/pnas.1804517115","apa":"Garrido-Charad, F., Vega Zuniga, T. A., Gutiérrez-Ibáñez, C., Fernandez, P., López-Jury, L., González-Cabrera, C., … Marín, G. J. (2018). “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1804517115","short":"F. Garrido-Charad, T.A. Vega Zuniga, C. Gutiérrez-Ibáñez, P. Fernandez, L. López-Jury, C. González-Cabrera, H.J. Karten, H. Luksch, G.J. Marín, Proceedings of the National Academy of Sciences 115 (2018) E7615–E7623.","ieee":"F. Garrido-Charad et al., ““Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network,” Proceedings of the National Academy of Sciences, vol. 115, no. 32. National Academy of Sciences, pp. E7615–E7623, 2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"project":[{"grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"title":"State of the art on stylized fabrication","author":[{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"},{"first_name":"Paolo","full_name":"Cignoni, Paolo","last_name":"Cignoni"},{"last_name":"Malomo","full_name":"Malomo, Luigi","first_name":"Luigi"},{"last_name":"Pietroni","full_name":"Pietroni, Nico","first_name":"Nico"}],"external_id":{"isi":["000437272800019"]},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Bickel, Bernd, Paolo Cignoni, Luigi Malomo, and Nico Pietroni. “State of the Art on Stylized Fabrication.” Computer Graphics Forum. Wiley, 2018. https://doi.org/10.1111/cgf.13327.","ista":"Bickel B, Cignoni P, Malomo L, Pietroni N. 2018. State of the art on stylized fabrication. Computer Graphics Forum. 37(6), 325–342.","mla":"Bickel, Bernd, et al. “State of the Art on Stylized Fabrication.” Computer Graphics Forum, vol. 37, no. 6, Wiley, 2018, pp. 325–42, doi:10.1111/cgf.13327.","ama":"Bickel B, Cignoni P, Malomo L, Pietroni N. State of the art on stylized fabrication. Computer Graphics Forum. 2018;37(6):325-342. doi:10.1111/cgf.13327","apa":"Bickel, B., Cignoni, P., Malomo, L., & Pietroni, N. (2018). State of the art on stylized fabrication. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.13327","ieee":"B. Bickel, P. Cignoni, L. Malomo, and N. Pietroni, “State of the art on stylized fabrication,” Computer Graphics Forum, vol. 37, no. 6. Wiley, pp. 325–342, 2018.","short":"B. Bickel, P. Cignoni, L. Malomo, N. Pietroni, Computer Graphics Forum 37 (2018) 325–342."},"publisher":"Wiley","quality_controlled":"1","oa":1,"date_published":"2018-09-01T00:00:00Z","doi":"10.1111/cgf.13327","date_created":"2019-02-14T13:52:25Z","page":"325-342","day":"01","publication":"Computer Graphics Forum","isi":1,"has_accepted_license":"1","year":"2018","status":"public","pubrep_id":"1051","type":"journal_article","_id":"6003","file_date_updated":"2020-07-14T12:47:15Z","department":[{"_id":"BeBi"}],"ddc":["004"],"date_updated":"2023-09-19T14:33:40Z","month":"09","intvolume":" 37","scopus_import":"1","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Digital fabrication devices are powerful tools for creating tangible reproductions of 3D digital models. Most available printing technologies aim at producing an accurate copy of a tridimensional shape. However, fabrication technologies can also be used to create a stylistic representation of a digital shape. We refer to this class of methods as ‘stylized fabrication methods’. These methods abstract geometric and physical features of a given shape to create an unconventional representation, to produce an optical illusion or to devise a particular interaction with the fabricated model. In this state‐of‐the‐art report, we classify and overview this broad and emerging class of approaches and also propose possible directions for future research."}],"issue":"6","volume":37,"ec_funded":1,"file":[{"creator":"kschuh","file_size":6209349,"date_updated":"2020-07-14T12:47:15Z","file_name":"StylizedFabricationSTAR-Personal.pdf","date_created":"2019-02-14T14:09:28Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"6004","checksum":"d2bbe5c658d8159fbe9016a4f5e82b19"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0167-7055"]},"publication_status":"published"},{"project":[{"call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27"}],"title":"The Bogoliubov free energy functional I: Existence of minimizers and phase diagram","author":[{"id":"4197AD04-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin M","last_name":"Napiórkowski","full_name":"Napiórkowski, Marcin M"},{"last_name":"Reuvers","full_name":"Reuvers, Robin","first_name":"Robin"},{"last_name":"Solovej","full_name":"Solovej, Jan Philip","first_name":"Jan Philip"}],"external_id":{"arxiv":["1511.05935"],"isi":["000435367300003"]},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"M. M. Napiórkowski, R. Reuvers, and J. P. Solovej, “The Bogoliubov free energy functional I: Existence of minimizers and phase diagram,” Archive for Rational Mechanics and Analysis, vol. 229, no. 3. Springer Nature, pp. 1037–1090, 2018.","short":"M.M. Napiórkowski, R. Reuvers, J.P. Solovej, Archive for Rational Mechanics and Analysis 229 (2018) 1037–1090.","ama":"Napiórkowski MM, Reuvers R, Solovej JP. The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. Archive for Rational Mechanics and Analysis. 2018;229(3):1037-1090. doi:10.1007/s00205-018-1232-6","apa":"Napiórkowski, M. M., Reuvers, R., & Solovej, J. P. (2018). The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. Archive for Rational Mechanics and Analysis. Springer Nature. https://doi.org/10.1007/s00205-018-1232-6","mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional I: Existence of Minimizers and Phase Diagram.” Archive for Rational Mechanics and Analysis, vol. 229, no. 3, Springer Nature, 2018, pp. 1037–90, doi:10.1007/s00205-018-1232-6.","ista":"Napiórkowski MM, Reuvers R, Solovej JP. 2018. The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. Archive for Rational Mechanics and Analysis. 229(3), 1037–1090.","chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Philip Solovej. “The Bogoliubov Free Energy Functional I: Existence of Minimizers and Phase Diagram.” Archive for Rational Mechanics and Analysis. Springer Nature, 2018. https://doi.org/10.1007/s00205-018-1232-6."},"quality_controlled":"1","publisher":"Springer Nature","oa":1,"doi":"10.1007/s00205-018-1232-6","date_published":"2018-09-01T00:00:00Z","date_created":"2019-02-14T13:40:53Z","page":"1037-1090","day":"01","publication":"Archive for Rational Mechanics and Analysis","isi":1,"year":"2018","status":"public","type":"journal_article","_id":"6002","department":[{"_id":"RoSe"}],"date_updated":"2023-09-19T14:33:12Z","month":"09","intvolume":" 229","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.05935"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"The Bogoliubov free energy functional is analysed. The functional serves as a model of a translation-invariant Bose gas at positive temperature. We prove the existence of minimizers in the case of repulsive interactions given by a sufficiently regular two-body potential. Furthermore, we prove the existence of a phase transition in this model and provide its phase diagram."}],"issue":"3","volume":229,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1432-0673"],"issn":["0003-9527"]},"publication_status":"published"},{"project":[{"call_identifier":"FP7","_id":"25152F3A-B435-11E9-9278-68D0E5697425","name":"Decoding the complexity of turbulence at its origin","grant_number":"306589"}],"external_id":{"arxiv":["1709.06372"],"isi":["000437858300003"]},"article_processing_charge":"No","author":[{"id":"3C5A959A-F248-11E8-B48F-1D18A9856A87","first_name":"Mukund","full_name":"Vasudevan, Mukund","last_name":"Vasudevan"},{"first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","last_name":"Hof"}],"title":"The critical point of the transition to turbulence in pipe flow","citation":{"mla":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” Journal of Fluid Mechanics, vol. 839, Cambridge University Press, 2018, pp. 76–94, doi:10.1017/jfm.2017.923.","ieee":"M. Vasudevan and B. Hof, “The critical point of the transition to turbulence in pipe flow,” Journal of Fluid Mechanics, vol. 839. Cambridge University Press, pp. 76–94, 2018.","short":"M. Vasudevan, B. Hof, Journal of Fluid Mechanics 839 (2018) 76–94.","apa":"Vasudevan, M., & Hof, B. (2018). The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2017.923","ama":"Vasudevan M, Hof B. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 2018;839:76-94. doi:10.1017/jfm.2017.923","chicago":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” Journal of Fluid Mechanics. Cambridge University Press, 2018. https://doi.org/10.1017/jfm.2017.923.","ista":"Vasudevan M, Hof B. 2018. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 839, 76–94."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"publisher":"Cambridge University Press","quality_controlled":"1","acknowledgement":" We also thank Philipp Maier and the IST Austria workshop for theirdedicated technical support","page":"76-94","date_created":"2019-02-14T12:50:50Z","date_published":"2018-03-25T00:00:00Z","doi":"10.1017/jfm.2017.923","year":"2018","isi":1,"publication":"Journal of Fluid Mechanics","day":"25","type":"journal_article","article_type":"original","status":"public","_id":"5996","department":[{"_id":"BjHo"}],"date_updated":"2023-09-19T14:37:49Z","main_file_link":[{"url":"https://arxiv.org/abs/1709.06372","open_access":"1"}],"scopus_import":"1","intvolume":" 839","month":"03","abstract":[{"text":"In pipes, turbulence sets in despite the linear stability of the laminar Hagen–Poiseuille flow. The Reynolds number ( ) for which turbulence first appears in a given experiment – the ‘natural transition point’ – depends on imperfections of the set-up, or, more precisely, on the magnitude of finite amplitude perturbations. At onset, turbulence typically only occupies a certain fraction of the flow, and this fraction equally is found to differ from experiment to experiment. Despite these findings, Reynolds proposed that after sufficiently long times, flows may settle to steady conditions: below a critical velocity, flows should (regardless of initial conditions) always return to laminar, while above this velocity, eddying motion should persist. As will be shown, even in pipes several thousand diameters long, the spatio-temporal intermittent flow patterns observed at the end of the pipe strongly depend on the initial conditions, and there is no indication that different flow patterns would eventually settle to a (statistical) steady state. Exploiting the fact that turbulent puffs do not age (i.e. they are memoryless), we continuously recreate the puff sequence exiting the pipe at the pipe entrance, and in doing so introduce periodic boundary conditions for the puff pattern. This procedure allows us to study the evolution of the flow patterns for arbitrary long times, and we find that after times in excess of advective time units, indeed a statistical steady state is reached. Although the resulting flows remain spatio-temporally intermittent, puff splitting and decay rates eventually reach a balance, so that the turbulent fraction fluctuates around a well-defined level which only depends on . In accordance with Reynolds’ proposition, we find that at lower (here 2020), flows eventually always resume to laminar, while for higher ( ), turbulence persists. The critical point for pipe flow hence falls in the interval of $2020 , which is in very good agreement with the recently proposed value of . The latter estimate was based on single-puff statistics and entirely neglected puff interactions. Unlike in typical contact processes where such interactions strongly affect the percolation threshold, in pipe flow, the critical point is only marginally influenced. Interactions, on the other hand, are responsible for the approach to the statistical steady state. As shown, they strongly affect the resulting flow patterns, where they cause ‘puff clustering’, and these regions of large puff densities are observed to travel across the puff pattern in a wave-like fashion.","lang":"eng"}],"oa_version":"Preprint","ec_funded":1,"volume":839,"publication_status":"published","publication_identifier":{"eissn":["1469-7645"],"issn":["0022-1120"]},"language":[{"iso":"eng"}]},{"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1510.08517","open_access":"1"}],"month":"06","intvolume":" 40","abstract":[{"lang":"eng","text":"In this article, we consider the termination problem of probabilistic programs with real-valued variables. Thequestions concerned are: qualitative ones that ask (i) whether the program terminates with probability 1(almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); andquantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) tocompute a boundBsuch that the probability not to terminate afterBsteps decreases exponentially (con-centration problem). To solve these questions, we utilize the notion of ranking supermartingales, which isa powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmicsynthesis of linear ranking-supermartingales over affine probabilistic programs (Apps) with both angelic anddemonic non-determinism. An important subclass of Apps is LRApp which is defined as the class of all Appsover which a linear ranking-supermartingale exists.Our main contributions are as follows. Firstly, we show that the membership problem of LRApp (i) canbe decided in polynomial time for Apps with at most demonic non-determinism, and (ii) isNP-hard and inPSPACEfor Apps with angelic non-determinism. Moreover, theNP-hardness result holds already for Appswithout probability and demonic non-determinism. Secondly, we show that the concentration problem overLRApp can be solved in the same complexity as for the membership problem of LRApp. Finally, we show thatthe expectation problem over LRApp can be solved in2EXPTIMEand isPSPACE-hard even for Apps withoutprobability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate theeffectiveness of our approach to answer the qualitative and quantitative questions over Apps with at mostdemonic non-determinism."}],"oa_version":"Submitted Version","volume":40,"related_material":{"record":[{"status":"public","id":"1438","relation":"earlier_version"}]},"issue":"2","ec_funded":1,"publication_identifier":{"issn":["0164-0925"]},"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"5993","department":[{"_id":"KrCh"}],"date_updated":"2023-09-19T14:38:42Z","quality_controlled":"1","publisher":"Association for Computing Machinery (ACM)","oa":1,"doi":"10.1145/3174800","date_published":"2018-06-01T00:00:00Z","date_created":"2019-02-14T12:29:10Z","isi":1,"year":"2018","day":"01","publication":"ACM Transactions on Programming Languages and Systems","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"article_number":"7","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Fu","full_name":"Fu, Hongfei","first_name":"Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný","full_name":"Novotný, Petr"},{"full_name":"Hasheminezhad, Rouzbeh","last_name":"Hasheminezhad","first_name":"Rouzbeh"}],"external_id":{"arxiv":["1510.08517"],"isi":["000434634500003"]},"article_processing_charge":"No","title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","citation":{"ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 40(2), 7.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3174800.","apa":"Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3174800","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 2018;40(2). doi:10.1145/3174800","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2. Association for Computing Machinery (ACM), 2018.","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018).","mla":"Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery (ACM), 2018, doi:10.1145/3174800."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"}]