[{"_id":"6228","publisher":"Cambridge University Press","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.05357"}],"date_created":"2019-04-07T21:59:14Z","author":[{"last_name":"Scarselli","first_name":"Davide","orcid":"0000-0001-5227-4271","full_name":"Scarselli, Davide","id":"40315C30-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4312-0179","full_name":"Kühnen, Jakob","id":"3A47AE32-F248-11E8-B48F-1D18A9856A87","last_name":"Kühnen","first_name":"Jakob"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","first_name":"Björn","last_name":"Hof"}],"project":[{"call_identifier":"FP7","name":"Decoding the complexity of turbulence at its origin","_id":"25152F3A-B435-11E9-9278-68D0E5697425","grant_number":"306589"},{"name":"Eliminating turbulence in oil pipelines","call_identifier":"H2020","_id":"25104D44-B435-11E9-9278-68D0E5697425","grant_number":"737549"}],"doi":"10.1017/jfm.2019.191","type":"journal_article","intvolume":"       867","external_id":{"isi":["000462606100001"],"arxiv":["1807.05357"]},"ec_funded":1,"oa_version":"Preprint","day":"25","month":"05","arxiv":1,"oa":1,"year":"2019","date_published":"2019-05-25T00:00:00Z","volume":867,"related_material":{"link":[{"url":"https://doi.org/10.1017/jfm.2019.191","relation":"supplementary_material"}],"record":[{"relation":"dissertation_contains","status":"public","id":"7258"}]},"publication_status":"published","abstract":[{"text":"Following  the  recent  observation  that  turbulent  pipe  flow  can  be  relaminarised  bya  relatively  simple  modification  of  the  mean  velocity  profile,  we  here  carry  out  aquantitative  experimental  investigation  of  this  phenomenon.  Our  study  confirms  thata  flat  velocity  profile  leads  to  a  collapse  of  turbulence  and  in  order  to  achieve  theblunted  profile  shape,  we  employ  a  moving  pipe  segment  that  is  briefly  and  rapidlyshifted  in  the  streamwise  direction.  The  relaminarisation  threshold  and  the  minimumshift  length  and  speeds  are  determined  as  a  function  of  Reynolds  number.  Althoughturbulence  is  still  active  after  the  acceleration  phase,  the  modulated  profile  possessesa  severely  decreased  lift-up  potential  as  measured  by  transient  growth.  As  shown,this  results  in  an  exponential  decay  of  fluctuations  and  the  flow  relaminarises.  Whilethis  method  can  be  easily  applied  at  low  to  moderate  flow  speeds,  the  minimumstreamwise  length  over  which  the  acceleration  needs  to  act  increases  linearly  with  theReynolds  number.","lang":"eng"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","title":"Relaminarising pipe flow by wall movement","publication_identifier":{"eissn":["1469-7645"],"issn":["0022-1120"]},"date_updated":"2026-08-27T22:30:30Z","article_processing_charge":"No","department":[{"_id":"BjHo"}],"status":"public","publication":"Journal of Fluid Mechanics","citation":{"ieee":"D. Scarselli, J. Kühnen, and B. Hof, “Relaminarising pipe flow by wall movement,” <i>Journal of Fluid Mechanics</i>, vol. 867. Cambridge University Press, pp. 934–948, 2019.","ama":"Scarselli D, Kühnen J, Hof B. Relaminarising pipe flow by wall movement. <i>Journal of Fluid Mechanics</i>. 2019;867:934-948. doi:<a href=\"https://doi.org/10.1017/jfm.2019.191\">10.1017/jfm.2019.191</a>","apa":"Scarselli, D., Kühnen, J., &#38; Hof, B. (2019). Relaminarising pipe flow by wall movement. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2019.191\">https://doi.org/10.1017/jfm.2019.191</a>","short":"D. Scarselli, J. Kühnen, B. Hof, Journal of Fluid Mechanics 867 (2019) 934–948.","mla":"Scarselli, Davide, et al. “Relaminarising Pipe Flow by Wall Movement.” <i>Journal of Fluid Mechanics</i>, vol. 867, Cambridge University Press, 2019, pp. 934–48, doi:<a href=\"https://doi.org/10.1017/jfm.2019.191\">10.1017/jfm.2019.191</a>.","ista":"Scarselli D, Kühnen J, Hof B. 2019. Relaminarising pipe flow by wall movement. Journal of Fluid Mechanics. 867, 934–948.","chicago":"Scarselli, Davide, Jakob Kühnen, and Björn Hof. “Relaminarising Pipe Flow by Wall Movement.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2019. <a href=\"https://doi.org/10.1017/jfm.2019.191\">https://doi.org/10.1017/jfm.2019.191</a>."},"page":"934-948","scopus_import":"1","isi":1},{"article_processing_charge":"No","date_updated":"2026-08-27T22:30:31Z","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"title":"The entorhinal cognitive map is attracted to goals","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"scopus_import":"1","citation":{"ista":"Boccara CN, Nardin M, Stella F, O’Neill J, Csicsvari JL. 2019. The entorhinal cognitive map is attracted to goals. Science. 363(6434), 1443–1447.","mla":"Boccara, Charlotte N., et al. “The Entorhinal Cognitive Map Is Attracted to Goals.” <i>Science</i>, vol. 363, no. 6434, American Association for the Advancement of Science, 2019, pp. 1443–47, doi:<a href=\"https://doi.org/10.1126/science.aav4837\">10.1126/science.aav4837</a>.","chicago":"Boccara, Charlotte N., Michele Nardin, Federico Stella, Joseph O’Neill, and Jozsef L Csicsvari. “The Entorhinal Cognitive Map Is Attracted to Goals.” <i>Science</i>. American Association for the Advancement of Science, 2019. <a href=\"https://doi.org/10.1126/science.aav4837\">https://doi.org/10.1126/science.aav4837</a>.","short":"C.N. Boccara, M. Nardin, F. Stella, J. O’Neill, J.L. Csicsvari, Science 363 (2019) 1443–1447.","ieee":"C. N. Boccara, M. Nardin, F. Stella, J. O’Neill, and J. L. Csicsvari, “The entorhinal cognitive map is attracted to goals,” <i>Science</i>, vol. 363, no. 6434. American Association for the Advancement of Science, pp. 1443–1447, 2019.","ama":"Boccara CN, Nardin M, Stella F, O’Neill J, Csicsvari JL. The entorhinal cognitive map is attracted to goals. <i>Science</i>. 2019;363(6434):1443-1447. doi:<a href=\"https://doi.org/10.1126/science.aav4837\">10.1126/science.aav4837</a>","apa":"Boccara, C. N., Nardin, M., Stella, F., O’Neill, J., &#38; Csicsvari, J. L. (2019). The entorhinal cognitive map is attracted to goals. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aav4837\">https://doi.org/10.1126/science.aav4837</a>"},"page":"1443-1447","publication":"Science","status":"public","department":[{"_id":"JoCs"}],"ddc":["570"],"issue":"6434","type":"journal_article","intvolume":"       363","doi":"10.1126/science.aav4837","project":[{"call_identifier":"FP7","name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex","_id":"257A4776-B435-11E9-9278-68D0E5697425","grant_number":"281511"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"date_created":"2019-04-04T08:39:30Z","author":[{"orcid":"0000-0001-7237-5109","id":"3FC06552-F248-11E8-B48F-1D18A9856A87","full_name":"Boccara, Charlotte N.","last_name":"Boccara","first_name":"Charlotte N."},{"id":"30BD0376-F248-11E8-B48F-1D18A9856A87","full_name":"Nardin, Michele","orcid":"0000-0001-8849-6570","first_name":"Michele","last_name":"Nardin"},{"last_name":"Stella","first_name":"Federico","orcid":"0000-0001-9439-3148","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","full_name":"Stella, Federico"},{"first_name":"Joseph","last_name":"O'Neill","id":"426376DC-F248-11E8-B48F-1D18A9856A87","full_name":"O'Neill, Joseph"},{"last_name":"Csicsvari","first_name":"Jozsef L","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"}],"publisher":"American Association for the Advancement of Science","_id":"6194","file":[{"date_updated":"2020-07-14T12:47:23Z","creator":"dernst","date_created":"2020-05-14T09:11:10Z","file_name":"2019_Science_Boccara.pdf","content_type":"application/pdf","file_size":9045923,"access_level":"open_access","checksum":"5e6b16742cde10a560cfaf2130764da1","relation":"main_file","file_id":"7826"}],"abstract":[{"lang":"eng","text":"Grid cells with their rigid hexagonal firing fields are thought to provide an invariant metric to the hippocampal cognitive map, yet environmental geometrical features have recently been shown to distort the grid structure. Given that the hippocampal role goes beyond space, we tested the influence of nonspatial information on the grid organization. We trained rats to daily learn three new reward locations on a cheeseboard maze while recording from the medial entorhinal cortex and the hippocampal CA1 region. Many grid fields moved toward goal location, leading to long-lasting deformations of the entorhinal map. Therefore, distortions in the grid structure contribute to goal representation during both learning and recall, which demonstrates that grid cells participate in mnemonic coding and do not merely provide a simple metric of space."}],"article_type":"original","publication_status":"published","related_material":{"record":[{"relation":"popular_science","status":"public","id":"6062"},{"relation":"dissertation_contains","id":"11932","status":"public"}],"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/grid-cells-create-treasure-map-in-rat-brain/"}]},"file_date_updated":"2020-07-14T12:47:23Z","date_published":"2019-03-29T00:00:00Z","volume":363,"year":"2019","oa":1,"has_accepted_license":"1","month":"03","day":"29","oa_version":"Submitted Version","external_id":{"isi":["000462738000034"]},"ec_funded":1},{"_id":"6609","publisher":"Nature Publishing Group","main_file_link":[{"url":"https://arxiv.org/abs/1809.05865","open_access":"1"}],"author":[{"first_name":"Shabir","last_name":"Barzanjeh","full_name":"Barzanjeh, Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0415-1423"},{"first_name":"Elena","last_name":"Redchenko","full_name":"Redchenko, Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Peruzzo","first_name":"Matilda","orcid":"0000-0002-3415-4628","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","full_name":"Peruzzo, Matilda"},{"orcid":"0000-0001-6613-1378","full_name":"Wulf, Matthias","id":"45598606-F248-11E8-B48F-1D18A9856A87","last_name":"Wulf","first_name":"Matthias"},{"last_name":"Lewis","first_name":"Dylan","full_name":"Lewis, Dylan"},{"id":"3770C838-F248-11E8-B48F-1D18A9856A87","full_name":"Arnold, Georg M","orcid":"0000-0003-1397-7876","first_name":"Georg M","last_name":"Arnold"},{"orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","first_name":"Johannes M"}],"date_created":"2019-07-07T21:59:20Z","project":[{"call_identifier":"H2020","name":"Hybrid Optomechanical Technologies","_id":"257EB838-B435-11E9-9278-68D0E5697425","grant_number":"732894"},{"grant_number":"758053","_id":"26336814-B435-11E9-9278-68D0E5697425","name":"A Fiber Optic Transceiver for Superconducting Qubits","call_identifier":"H2020"},{"grant_number":"707438","call_identifier":"H2020","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics","_id":"258047B6-B435-11E9-9278-68D0E5697425"},{"name":"Coherent on-chip conversion of superconducting qubit signals from microwaves to optical frequencies","_id":"2671EB66-B435-11E9-9278-68D0E5697425"}],"doi":"10.1038/s41586-019-1320-2","type":"journal_article","intvolume":"       570","ec_funded":1,"external_id":{"isi":["000472860000042"],"arxiv":["1809.05865"]},"oa_version":"Preprint","day":"27","month":"06","arxiv":1,"oa":1,"year":"2019","date_published":"2019-06-27T00:00:00Z","volume":570,"related_material":{"record":[{"relation":"dissertation_contains","id":"18871","status":"public"}]},"publication_status":"published","acknowledged_ssus":[{"_id":"NanoFab"}],"abstract":[{"lang":"eng","text":"Mechanical systems facilitate the development of a hybrid quantum technology comprising electrical, optical, atomic and acoustic degrees of freedom1, and entanglement is essential to realize quantum-enabled devices. Continuous-variable entangled fields—known as Einstein–Podolsky–Rosen (EPR) states—are spatially separated two-mode squeezed states that can be used for quantum teleportation and quantum communication2. In the optical domain, EPR states are typically generated using nondegenerate optical amplifiers3, and at microwave frequencies Josephson circuits can serve as a nonlinear medium4,5,6. An outstanding goal is to deterministically generate and distribute entangled states with a mechanical oscillator, which requires a carefully arranged balance between excitation, cooling and dissipation in an ultralow noise environment. Here we observe stationary emission of path-entangled microwave radiation from a parametrically driven 30-micrometre-long silicon nanostring oscillator, squeezing the joint field operators of two thermal modes by 3.40 decibels below the vacuum level. The motion of this micromechanical system correlates up to 50 photons per second per hertz, giving rise to a quantum discord that is robust with respect to microwave noise7. Such generalized quantum correlations of separable states are important for quantum-enhanced detection8 and provide direct evidence of the non-classical nature of the mechanical oscillator without directly measuring its state9. This noninvasive measurement scheme allows to infer information about otherwise inaccessible objects, with potential implications for sensing, open-system dynamics and fundamental tests of quantum gravity. In the future, similar on-chip devices could be used to entangle subsystems on very different energy scales, such as microwave and optical photons."}],"language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","title":"Stationary entangled radiation from micromechanical motion","date_updated":"2026-08-27T22:30:39Z","article_processing_charge":"No","department":[{"_id":"JoFi"}],"status":"public","publication":"Nature","citation":{"chicago":"Barzanjeh, Shabir, Elena Redchenko, Matilda Peruzzo, Matthias Wulf, Dylan Lewis, Georg M Arnold, and Johannes M Fink. “Stationary Entangled Radiation from Micromechanical Motion.” <i>Nature</i>. Nature Publishing Group, 2019. <a href=\"https://doi.org/10.1038/s41586-019-1320-2\">https://doi.org/10.1038/s41586-019-1320-2</a>.","mla":"Barzanjeh, Shabir, et al. “Stationary Entangled Radiation from Micromechanical Motion.” <i>Nature</i>, vol. 570, Nature Publishing Group, 2019, pp. 480–83, doi:<a href=\"https://doi.org/10.1038/s41586-019-1320-2\">10.1038/s41586-019-1320-2</a>.","ista":"Barzanjeh S, Redchenko E, Peruzzo M, Wulf M, Lewis D, Arnold GM, Fink JM. 2019. Stationary entangled radiation from micromechanical motion. Nature. 570, 480–483.","short":"S. Barzanjeh, E. Redchenko, M. Peruzzo, M. Wulf, D. Lewis, G.M. Arnold, J.M. Fink, Nature 570 (2019) 480–483.","apa":"Barzanjeh, S., Redchenko, E., Peruzzo, M., Wulf, M., Lewis, D., Arnold, G. M., &#38; Fink, J. M. (2019). Stationary entangled radiation from micromechanical motion. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41586-019-1320-2\">https://doi.org/10.1038/s41586-019-1320-2</a>","ama":"Barzanjeh S, Redchenko E, Peruzzo M, et al. Stationary entangled radiation from micromechanical motion. <i>Nature</i>. 2019;570:480-483. doi:<a href=\"https://doi.org/10.1038/s41586-019-1320-2\">10.1038/s41586-019-1320-2</a>","ieee":"S. Barzanjeh <i>et al.</i>, “Stationary entangled radiation from micromechanical motion,” <i>Nature</i>, vol. 570. Nature Publishing Group, pp. 480–483, 2019."},"page":"480-483","scopus_import":"1","isi":1},{"day":"04","OA_place":"publisher","oa_version":"Published Version","has_accepted_license":"1","month":"02","date_published":"2019-02-04T00:00:00Z","oa":1,"year":"2019","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"Clathrin-Mediated Endocytosis (CME) is an aspect of cellular trafficking that is constantly regulated for mediating developmental and physiological responses. The main aim of my thesis is to decipher the basic mechanisms of CME and post-endocytic trafficking in the whole multicellular organ systems of Arabidopsis. The first chapter of my thesis describes the search for new components involved in CME. Tandem affinity purification was conducted using CLC and its interacting partners were identified. Amongst the identified proteins were the Auxilin-likes1 and 2 (Axl1/2), putative uncoating factors, for which we made a full functional analysis. Over-expression of Axl1/2 causes extreme modifications in the dynamics of the machinery proteins and inhibition of endocytosis altogether. However the loss of function of the axl1/2 did not present any cellular or physiological phenotype, meaning Auxilin-likes do not form the major uncoating machinery. The second chapter of my thesis describes the establishment/utilisation of techniques to capture the dynamicity and the complexity of CME and post-endocytic trafficking. We have studied the development of endocytic pits at the PM – specifically, the mode of membrane remodeling during pit development and the role of actin in it, given plant cells possess high turgor pressure. Utilizing the improved z-resolution of TIRF and VAEM techniques, we captured the time-lapse of the endocytic events at the plasma membrane; and using particle detection software, we quantitatively analysed all the endocytic trajectories in an unbiased way to obtain the endocytic rate of the system. This together with the direct analysis of cargo internalisation from the PM provided an estimate on the endocytic potential of the cell. We also developed a methodology for ultrastructural analysis of different populations of Clathrin-Coated Structures (CCSs) in both PM and endomembranes in unroofed protoplasts. Structural analysis, together with the intensity profile of CCSs at the PM show that the mode of CCP development at the PM follows ‘Constant curvature model’; meaning that clathrin polymerisation energy is a major contributing factor of membrane remodeling. In addition, other analyses clearly show that actin is not required for membrane remodeling during invagination or any other step of CCP development, despite the prevalent high turgor pressure. However, actin is essential in orchestrating the post-endocytic trafficking of CCVs facilitating the EE formation. We also observed that the uncoating process post-endocytosis is not immediate; an alternative mechanism of uncoating – Sequential multi-step process – functions in the cell. Finally we also looked at one of the important physiological stimuli modulating the process – hormone, auxin. auxin has been known to influence CME before. We have made a detailed study on the concentration-time based effect of auxin on the machinery proteins, CCP development, and the specificity of cargoes endocytosed. To this end, we saw no general effect of auxin on CME at earlier time points. However, very low concentration of IAA, such as 50nM, accelerates endocytosis of specifically PIN2 through CME. Such a tight regulatory control with high specificity to PIN2 could be essential in modulating its polarity. "}],"publication_status":"published","acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"}],"related_material":{"record":[{"id":"412","status":"public","relation":"part_of_dissertation"}]},"file_date_updated":"2021-02-11T23:30:15Z","file":[{"content_type":"video/x-msvideo","access_level":"open_access","file_size":5402078,"relation":"main_file","checksum":"c958f27dd752712886e7e2638b847a3c","file_id":"6270","date_updated":"2021-02-11T23:30:15Z","creator":"dernst","date_created":"2019-04-09T14:35:18Z","file_name":"Supplementary_movie_1.avi","embargo":"2020-02-11"},{"content_type":"video/x-msvideo","access_level":"open_access","file_size":5927736,"checksum":"8786fdc29c62987c0aad3c866a4d3691","relation":"main_file","file_id":"6271","date_updated":"2021-02-11T23:30:15Z","date_created":"2019-04-09T14:35:18Z","embargo":"2020-02-11","file_name":"3.7_supplementary_movie_10.avi","creator":"dernst"},{"checksum":"25f784c5159d6f4d966b2f9b371ebaf6","relation":"main_file","file_id":"6272","content_type":"video/x-msvideo","access_level":"open_access","file_size":9570210,"date_updated":"2021-02-11T23:30:15Z","creator":"dernst","file_name":"3.7_supplementary_movie_9.avi","date_created":"2019-04-09T14:35:18Z","embargo":"2020-02-11"},{"checksum":"917069272a7a08d1f38224d5e12765d6","relation":"main_file","file_id":"6273","content_type":"video/x-msvideo","file_size":2827360,"access_level":"open_access","date_updated":"2021-02-11T23:30:15Z","creator":"dernst","file_name":"3.7_supplementary_movie_8.avi","embargo":"2020-02-11","date_created":"2019-04-09T14:35:18Z"},{"creator":"dernst","date_created":"2019-04-09T14:35:18Z","file_name":"3.7_supplementary_movie_7.avi","embargo":"2020-02-11","date_updated":"2021-02-11T23:30:15Z","access_level":"open_access","file_size":5771410,"content_type":"video/x-msvideo","file_id":"6274","relation":"main_file","checksum":"81e74f5ca0ad70050504f18192236dc0"},{"checksum":"47eb37b27a2930252713924307ea8c6f","relation":"main_file","file_id":"6275","content_type":"video/x-msvideo","access_level":"open_access","file_size":1113486,"date_updated":"2021-02-11T23:30:15Z","embargo":"2020-02-11","date_created":"2019-04-09T14:35:18Z","file_name":"3.7_supplementary_movie_6.avi","creator":"dernst"},{"date_updated":"2021-02-11T23:30:15Z","creator":"dernst","date_created":"2019-04-09T14:35:18Z","embargo":"2020-02-11","file_name":"3.7_supplementary_movie_5.avi","checksum":"f68f66721041ce84e331959c9a5779c3","relation":"main_file","file_id":"6276","content_type":"video/x-msvideo","access_level":"open_access","file_size":1057232},{"date_updated":"2021-02-11T23:30:15Z","creator":"dernst","file_name":"3.7_supplementary_movie_3.avi","date_created":"2019-04-09T14:35:23Z","embargo":"2020-02-11","checksum":"67c01cefab51b363c5e214fe4cd671f3","relation":"main_file","file_id":"6277","content_type":"video/x-msvideo","file_size":127472916,"access_level":"open_access"},{"access_level":"open_access","file_size":3181238,"content_type":"video/x-msvideo","file_id":"6278","relation":"main_file","checksum":"e5a397edbee05b8821e2b19b3c1a9260","creator":"dernst","file_name":"3.7_supplementary_movie_4.avi","embargo":"2020-02-11","date_created":"2019-04-09T14:35:19Z","date_updated":"2021-02-11T23:30:15Z"},{"file_size":5970952,"access_level":"open_access","content_type":"video/x-msvideo","file_id":"6279","relation":"main_file","checksum":"32d92b2a9277f956fdb0b42351d07c0b","creator":"dernst","embargo":"2020-02-11","file_name":"3.7_supplementary_movie_2.avi","date_created":"2019-04-09T14:35:19Z","date_updated":"2021-02-11T23:30:15Z"},{"content_type":"video/x-msvideo","file_size":39835236,"access_level":"open_access","checksum":"efe7001f5d9a8c61e631e12d5f324ade","relation":"main_file","file_id":"6280","date_updated":"2021-02-11T23:30:15Z","creator":"dernst","file_name":"3.7_Supplementary_movie_1.avi","embargo":"2020-02-11","date_created":"2019-04-09T14:35:21Z"},{"relation":"main_file","checksum":"eeb0a5603c6449c5f34eacd5ff0b3a16","file_id":"6281","content_type":"video/x-msvideo","access_level":"open_access","file_size":3696740,"date_updated":"2021-02-11T23:30:15Z","creator":"dernst","file_name":"2.5_Suppl_Movie_4_AP2A1_TagRFP.avi","embargo":"2020-02-11","date_created":"2019-04-09T14:35:21Z"},{"date_updated":"2021-02-11T23:30:15Z","creator":"dernst","date_created":"2019-04-09T14:35:21Z","embargo":"2020-02-11","file_name":"2.5_Suppl_Movie_3_TPLATE_GFP.avi","relation":"main_file","checksum":"8e7c00ef6223bf0e177deb168338af13","file_id":"6282","content_type":"video/x-msvideo","file_size":6741232,"access_level":"open_access"},{"file_id":"6283","checksum":"3636006a7cb709a7543d6581e359b28d","relation":"main_file","access_level":"open_access","file_size":2445946,"content_type":"video/x-msvideo","file_name":"2.5_Suppl_Movie_2_CLC_GFP.avi","date_created":"2019-04-09T14:35:22Z","embargo":"2020-02-11","creator":"dernst","date_updated":"2021-02-11T23:30:15Z"},{"relation":"main_file","checksum":"39ca5519a6e9a38356e7b3704004fea7","file_id":"6284","content_type":"video/x-msvideo","access_level":"open_access","file_size":58594,"date_updated":"2021-02-11T23:30:15Z","creator":"dernst","file_name":"2.5_Suppl_Movie_1_CLC_GFPxAxl1_mcherry.avi","date_created":"2019-04-09T14:35:22Z","embargo":"2020-02-11"},{"checksum":"4fcdaa3a6c645514a3b3205f0f69dc76","relation":"main_file","file_id":"6285","content_type":"application/pdf","access_level":"open_access","file_size":10553937,"date_updated":"2021-02-11T11:17:15Z","creator":"dernst","file_name":"2019_Thesis_Narasimhan.pdf","date_created":"2019-04-09T14:35:33Z","embargo":"2020-02-11"},{"date_updated":"2020-07-14T12:47:26Z","file_name":"2019_Thesis_Narasimhan_source.docx","date_created":"2019-04-09T14:35:36Z","creator":"dernst","relation":"source_file","checksum":"268f0b6bad21d5f0d671e5d4b88104a7","file_id":"6286","embargo_to":"open_access","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","file_size":135291990}],"publisher":"Institute of Science and Technology Austria","_id":"6269","supervisor":[{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","first_name":"Jiří","last_name":"Friml"}],"doi":"10.15479/at:ista:th1075","author":[{"last_name":"Narasimhan","first_name":"Madhumitha","orcid":"0000-0002-8600-0671","id":"44BF24D0-F248-11E8-B48F-1D18A9856A87","full_name":"Narasimhan, Madhumitha"}],"date_created":"2019-04-09T14:37:06Z","type":"dissertation","ddc":["575"],"corr_author":"1","department":[{"_id":"JiFr"}],"status":"public","degree_awarded":"PhD","page":"138","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"chicago":"Narasimhan, Madhumitha. “Clathrin-Mediated Endocytosis, Post-Endocytic Trafficking and Their Regulatory Controls in Plants .” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/at:ista:th1075\">https://doi.org/10.15479/at:ista:th1075</a>.","mla":"Narasimhan, Madhumitha. <i>Clathrin-Mediated Endocytosis, Post-Endocytic Trafficking and Their Regulatory Controls in Plants </i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/at:ista:th1075\">10.15479/at:ista:th1075</a>.","ista":"Narasimhan M. 2019. Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory controls in plants . Institute of Science and Technology Austria.","short":"M. Narasimhan, Clathrin-Mediated Endocytosis, Post-Endocytic Trafficking and Their Regulatory Controls in Plants , Institute of Science and Technology Austria, 2019.","apa":"Narasimhan, M. (2019). <i>Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory controls in plants </i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:th1075\">https://doi.org/10.15479/at:ista:th1075</a>","ama":"Narasimhan M. Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory controls in plants . 2019. doi:<a href=\"https://doi.org/10.15479/at:ista:th1075\">10.15479/at:ista:th1075</a>","ieee":"M. Narasimhan, “Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory controls in plants ,” Institute of Science and Technology Austria, 2019."},"language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-08T14:00:24Z","publication_identifier":{"issn":["2663-337X"]},"title":"Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory controls in plants ","article_processing_charge":"No"},{"page":"152","citation":{"ieee":"C. Igler, “On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation,” Institute of Science and Technology Austria, 2019.","apa":"Igler, C. (2019). <i>On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:6371\">https://doi.org/10.15479/AT:ISTA:6371</a>","ama":"Igler C. On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6371\">10.15479/AT:ISTA:6371</a>","mla":"Igler, Claudia. <i>On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6371\">10.15479/AT:ISTA:6371</a>.","ista":"Igler C. 2019. On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation. Institute of Science and Technology Austria.","chicago":"Igler, Claudia. “On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:6371\">https://doi.org/10.15479/AT:ISTA:6371</a>.","short":"C. Igler, On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation, Institute of Science and Technology Austria, 2019."},"degree_awarded":"PhD","status":"public","keyword":["gene regulation","biophysics","transcription factor binding","bacteria"],"department":[{"_id":"CaGu"}],"corr_author":"1","ddc":["576","579"],"article_processing_charge":"No","title":"On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation","date_updated":"2026-04-08T13:56:27Z","publication_identifier":{"issn":["2663-337X"]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"67","relation":"part_of_dissertation"},{"relation":"popular_science","id":"5585","status":"public"}]},"file_date_updated":"2021-02-11T11:17:13Z","abstract":[{"lang":"eng","text":"Decades of studies have revealed the mechanisms of gene regulation in molecular detail. We make use of such well-described regulatory systems to explore how the molecular mechanisms of protein-protein and protein-DNA interactions shape the dynamics and evolution of gene regulation. \r\n\r\ni) We uncover how the biophysics of protein-DNA binding determines the potential of regulatory networks to evolve and adapt, which can be captured using a simple mathematical model. \r\nii) The evolution of regulatory connections can lead to a significant amount of crosstalk between binding proteins. We explore the effect of crosstalk on gene expression from a target promoter, which seems to be modulated through binding competition at non-specific DNA sites. \r\niii) We investigate how the very same biophysical characteristics as in i) can generate significant fitness costs for cells through global crosstalk, meaning non-specific DNA binding across the genomic background. \r\niv) Binding competition between proteins at a target promoter is a prevailing regulatory feature due to the prevalence of co-regulation at bacterial promoters. However, the dynamics of these systems are not always straightforward to determine even if the molecular mechanisms of regulation are known. A detailed model of the biophysical interactions reveals that interference between the regulatory proteins can constitute a new, generic form of system memory that records the history of the input signals at the promoter. \r\n\r\nWe demonstrate how the biophysics of protein-DNA binding can be harnessed to investigate the principles that shape and ultimately limit cellular gene regulation. These results provide a basis for studies of higher-level functionality, which arises from the underlying regulation.   \r\n"}],"publication_status":"published","alternative_title":["ISTA Thesis"],"date_published":"2019-05-03T00:00:00Z","oa":1,"year":"2019","has_accepted_license":"1","month":"05","oa_version":"Published Version","day":"03","OA_place":"publisher","type":"dissertation","author":[{"last_name":"Igler","first_name":"Claudia","orcid":"0000-0001-7777-546X","id":"46613666-F248-11E8-B48F-1D18A9856A87","full_name":"Igler, Claudia"}],"date_created":"2019-05-03T11:55:51Z","doi":"10.15479/AT:ISTA:6371","project":[{"grant_number":"24573","_id":"251EE76E-B435-11E9-9278-68D0E5697425","name":"Design principles underlying genetic switch architecture"}],"supervisor":[{"full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","first_name":"Calin C","last_name":"Guet"}],"_id":"6371","publisher":"Institute of Science and Technology Austria","file":[{"content_type":"application/pdf","file_size":12597663,"access_level":"open_access","checksum":"c0085d47c58c9cbcab1b0a783480f6da","relation":"main_file","file_id":"6373","date_updated":"2021-02-11T11:17:13Z","creator":"cigler","file_name":"IglerClaudia_OntheNatureofGeneRegulatoryDesign.pdf","date_created":"2019-05-03T11:54:52Z","embargo":"2020-05-02"},{"creator":"cigler","file_name":"IglerClaudia_OntheNatureofGeneRegulatoryDesign.docx","date_created":"2019-05-03T11:54:54Z","date_updated":"2020-07-14T12:47:28Z","access_level":"closed","file_size":34644426,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access","file_id":"6374","checksum":"2eac954de1c8bbf7e6fb35ed0221ae8c","relation":"source_file"}]},{"publisher":"Institute of Science and Technology Austria","supervisor":[{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M"}],"_id":"6363","file":[{"file_size":13966891,"access_level":"open_access","content_type":"application/pdf","file_id":"6389","relation":"main_file","checksum":"77c6c05cfe8b58c8abcf1b854375d084","creator":"cespinoza","embargo":"2020-05-09","file_name":"Espinozathesis_all2.pdf","date_created":"2019-05-07T16:00:39Z","date_updated":"2021-02-11T11:17:15Z"},{"checksum":"f6aa819f127691a2b0fc21c76eb09746","relation":"source_file","file_id":"6390","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access","file_size":11159900,"access_level":"closed","date_updated":"2020-07-14T12:47:28Z","creator":"cespinoza","file_name":"Espinoza_Thesis.docx","date_created":"2019-05-07T16:00:48Z"}],"type":"dissertation","doi":"10.15479/AT:ISTA:6363","author":[{"orcid":"0000-0003-4710-2082","full_name":"Espinoza Martinez, Claudia ","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","last_name":"Espinoza Martinez","first_name":"Claudia "}],"date_created":"2019-04-30T11:56:10Z","has_accepted_license":"1","month":"04","day":"30","OA_place":"publisher","oa_version":"Published Version","abstract":[{"text":"Distinguishing  between  similar  experiences  is  achieved  by  the  brain  in  a  process called  pattern  separation.  In  the  hippocampus,  pattern  separation  reduces  the interference of memories and increases the storage capacity by decorrelating similar inputs  patterns  of  neuronal  activity  into  non-overlapping output  firing  patterns. Winners-take-all  (WTA)  mechanism  is  a  theoretical  model  for  pattern  separation  in which  a  \"winner\"  cell  suppresses  the  activity  of  the  neighboring  neurons  through feedback inhibition. However, if the network properties of the dentate gyrus support WTA as a biologically conceivable model remains unknown. Here, we showed that the connectivity rules of PV+interneurons and their synaptic properties are optimizedfor efficient pattern separation. We found using multiple whole-cell in vitrorecordings that PV+interneurons mainly connect to granule cells (GC) through lateral inhibition, a form of  feedback  inhibition  in  which  a  GC  inhibits  other  GCs  but  not  itself  through  the activation of PV+interneurons. Thus, lateral inhibition between GC–PV+interneurons was ~10 times more abundant than recurrent connections. Furthermore, the GC–PV+interneuron  connectivity  was  more  spatially  confined  but  less  abundant  than  PV+interneurons–GC  connectivity,  leading  to  an  asymmetrical  distribution  of  excitatory and inhibitory connectivity. Our network model of the dentate gyrus with incorporated real connectivity rules efficiently decorrelates neuronal activity patterns using WTA as the  primary  mechanism.  This  process  relied  on  lateral  inhibition,  fast-signaling properties  of  PV+interneurons  and  the  asymmetrical  distribution  of  excitatory  and inhibitory connectivity. Finally, we found that silencing the activity of PV+interneurons in  vivoleads  to  acute  deficits  in  discrimination  between  similar  environments, suggesting  that  PV+interneuron  networks  are  necessary  for  behavioral  relevant computations.  Our   results   demonstrate   that   PV+interneurons  possess  unique connectivity  and  fast  signaling  properties  that confer  to  the  dentate  gyrus  network properties that allow the emergence of pattern separation. Thus, our results contribute to the knowledge of how specific forms of network organization underlie sophisticated types of information processing. \r\n","lang":"eng"}],"publication_status":"published","related_material":{"record":[{"id":"21","status":"public","relation":"part_of_dissertation"}]},"file_date_updated":"2021-02-11T11:17:15Z","date_published":"2019-04-30T00:00:00Z","oa":1,"year":"2019","alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","article_processing_charge":"No","date_updated":"2026-04-08T13:57:19Z","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-000-8"]},"title":"Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits","department":[{"_id":"PeJo"}],"ddc":["570"],"corr_author":"1","degree_awarded":"PhD","page":"140","citation":{"ieee":"C. Espinoza Martinez, “Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits,” Institute of Science and Technology Austria, 2019.","apa":"Espinoza Martinez, C. (2019). <i>Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:6363\">https://doi.org/10.15479/AT:ISTA:6363</a>","ama":"Espinoza Martinez C. Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6363\">10.15479/AT:ISTA:6363</a>","short":"C. Espinoza Martinez, Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits, Institute of Science and Technology Austria, 2019.","mla":"Espinoza Martinez, Claudia. <i>Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6363\">10.15479/AT:ISTA:6363</a>.","ista":"Espinoza Martinez C. 2019. Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits. Institute of Science and Technology Austria.","chicago":"Espinoza Martinez, Claudia . “Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:6363\">https://doi.org/10.15479/AT:ISTA:6363</a>."},"status":"public"},{"has_accepted_license":"1","month":"06","day":"27","OA_place":"publisher","oa_version":"Published Version","abstract":[{"lang":"eng","text":"A major challenge in neuroscience research is to dissect the circuits that orchestrate behavior in health and disease. Proteins from a wide range of non-mammalian species, such as microbial opsins, have been successfully transplanted to specific neuronal targets to override their natural communication patterns. The goal of our work is to manipulate synaptic communication in a manner that closely incorporates the functional intricacies of synapses by preserving temporal encoding (i.e. the firing pattern of the presynaptic neuron) and connectivity (i.e. target specific synapses rather than specific neurons). Our strategy to achieve this goal builds on the use of non-mammalian transplants to create a synthetic synapse. The mode of modulation comes from pre-synaptic uptake of a synthetic neurotransmitter (SN) into synaptic vesicles by means of a genetically targeted transporter selective for the SN. Upon natural vesicular release, exposure of the SN to the synaptic cleft will modify the post-synaptic potential through an orthogonal ligand gated ion channel. To achieve this goal we have functionally characterized a mixed cationic methionine-gated ion channel from Arabidopsis thaliana, designed a method to functionally characterize a synthetic transporter in isolated synaptic vesicles without the need for transgenic animals, identified and extracted multiple prokaryotic uptake systems that are substrate specific for methionine (Met), and established a primary/cell line co-culture system that would allow future combinatorial testing of this orthogonal transmitter-transporter-channel trifecta.\r\nSynthetic synapses will provide a unique opportunity to manipulate synaptic communication while maintaining the electrophysiological integrity of the pre-synaptic cell. In this way, information may be preserved that was generated in upstream circuits and that could be essential for concerted function and information processing."}],"publication_status":"published","related_material":{"record":[{"id":"6266","status":"public","relation":"old_edition"}]},"file_date_updated":"2020-07-14T12:47:50Z","date_published":"2019-06-27T00:00:00Z","year":"2019","oa":1,"alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","_id":"7132","supervisor":[{"first_name":"Harald L","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315"}],"file":[{"date_updated":"2020-07-14T12:47:50Z","creator":"dernst","date_created":"2019-11-27T09:06:10Z","file_name":"McKenzie PhD Thesis August 2018 - Corrected Final.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","file_size":5054633,"checksum":"34d0fe0f6e0af97b5937205a3e350423","relation":"source_file","file_id":"7133"},{"date_created":"2019-11-27T09:06:10Z","file_name":"McKenzie PhD Thesis August 2018 - Corrected Final.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:50Z","file_size":3231837,"access_level":"open_access","content_type":"application/pdf","file_id":"7134","checksum":"140dfb5e3df7edca34f4b6fcc55d876f","relation":"main_file"}],"type":"dissertation","doi":"10.15479/at:ista:7132","author":[{"full_name":"Mckenzie, Catherine","id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87","first_name":"Catherine","last_name":"Mckenzie"}],"date_created":"2019-11-27T09:07:14Z","department":[{"_id":"HaJa"}],"ddc":["571","573"],"corr_author":"1","degree_awarded":"PhD","page":"95","citation":{"short":"C. Mckenzie, Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission, Institute of Science and Technology Austria, 2019.","mla":"Mckenzie, Catherine. <i>Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/at:ista:7132\">10.15479/at:ista:7132</a>.","ista":"Mckenzie C. 2019. Design and characterization of methods and biological components to realize synthetic neurotransmission. Institute of Science and Technology Austria.","chicago":"Mckenzie, Catherine. “Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/at:ista:7132\">https://doi.org/10.15479/at:ista:7132</a>.","ieee":"C. Mckenzie, “Design and characterization of methods and biological components to realize synthetic neurotransmission,” Institute of Science and Technology Austria, 2019.","apa":"Mckenzie, C. (2019). <i>Design and characterization of methods and biological components to realize synthetic neurotransmission</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:7132\">https://doi.org/10.15479/at:ista:7132</a>","ama":"Mckenzie C. Design and characterization of methods and biological components to realize synthetic neurotransmission. 2019. doi:<a href=\"https://doi.org/10.15479/at:ista:7132\">10.15479/at:ista:7132</a>"},"status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"article_processing_charge":"No","date_updated":"2026-08-27T22:30:48Z","publication_identifier":{"issn":["2663-337X"]},"title":"Design and characterization of methods and biological components to realize synthetic neurotransmission"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1910.05841"}],"_id":"10065","project":[{"name":"Majorana bound states in Ge/SiGe heterostructures","call_identifier":"H2020","_id":"26A151DA-B435-11E9-9278-68D0E5697425","grant_number":"844511"},{"grant_number":"P30207","name":"Hole spin orbit qubits in Ge quantum wells","call_identifier":"FWF","_id":"2641CE5E-B435-11E9-9278-68D0E5697425"}],"doi":"10.48550/arXiv.1910.05841","date_created":"2021-10-01T12:14:51Z","author":[{"id":"340F461A-F248-11E8-B48F-1D18A9856A87","full_name":"Hofmann, Andrea C","last_name":"Hofmann","first_name":"Andrea C"},{"orcid":"0000-0002-7197-4801","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","full_name":"Jirovec, Daniel","last_name":"Jirovec","first_name":"Daniel"},{"full_name":"Borovkov, Maxim","last_name":"Borovkov","first_name":"Maxim"},{"first_name":"Ivan","last_name":"Prieto Gonzalez","full_name":"Prieto Gonzalez, Ivan","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7370-5357"},{"full_name":"Ballabio, Andrea","first_name":"Andrea","last_name":"Ballabio"},{"full_name":"Frigerio, Jacopo","first_name":"Jacopo","last_name":"Frigerio"},{"full_name":"Chrastina, Daniel","last_name":"Chrastina","first_name":"Daniel"},{"full_name":"Isella, Giovanni","last_name":"Isella","first_name":"Giovanni"},{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","first_name":"Georgios","last_name":"Katsaros"}],"type":"preprint","day":"13","oa_version":"Preprint","external_id":{"arxiv":["1910.05841"]},"ec_funded":1,"month":"10","date_published":"2019-10-13T00:00:00Z","oa":1,"year":"2019","arxiv":1,"abstract":[{"text":"We study double quantum dots in a Ge/SiGe heterostructure and test their maturity towards singlet-triplet ($S-T_0$) qubits. We demonstrate a large range of tunability, from two single quantum dots to a double quantum dot. We measure Pauli spin blockade and study the anisotropy of the $g$-factor. We use an adjacent quantum dot for sensing charge transitions in the double quantum dot at interest. In conclusion, Ge/SiGe possesses all ingredients necessary for building a singlet-triplet qubit.","lang":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"publication_status":"draft","related_material":{"record":[{"relation":"dissertation_contains","id":"10058","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"acknowledgement":"We thank Matthias Brauns for helpful discussions and careful proofreading of the manuscript. This project has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No 844511 and from the FWF project P30207. The research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA machine shop and the nanofabrication\r\nfacility.","date_updated":"2026-08-27T22:30:49Z","title":"Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits","article_number":"1910.05841","article_processing_charge":"No","corr_author":"1","department":[{"_id":"GeKa"}],"status":"public","citation":{"apa":"Hofmann, A. C., Jirovec, D., Borovkov, M., Prieto Gonzalez, I., Ballabio, A., Frigerio, J., … Katsaros, G. (n.d.). Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1910.05841\">https://doi.org/10.48550/arXiv.1910.05841</a>","ama":"Hofmann AC, Jirovec D, Borovkov M, et al. Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1910.05841\">10.48550/arXiv.1910.05841</a>","ieee":"A. C. Hofmann <i>et al.</i>, “Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits,” <i>arXiv</i>. .","short":"A.C. Hofmann, D. Jirovec, M. Borovkov, I. Prieto Gonzalez, A. Ballabio, J. Frigerio, D. Chrastina, G. Isella, G. Katsaros, ArXiv (n.d.).","chicago":"Hofmann, Andrea C, Daniel Jirovec, Maxim Borovkov, Ivan Prieto Gonzalez, Andrea Ballabio, Jacopo Frigerio, Daniel Chrastina, Giovanni Isella, and Georgios Katsaros. “Assessing the Potential of Ge/SiGe Quantum Dots as Hosts for Singlet-Triplet Qubits.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1910.05841\">https://doi.org/10.48550/arXiv.1910.05841</a>.","mla":"Hofmann, Andrea C., et al. “Assessing the Potential of Ge/SiGe Quantum Dots as Hosts for Singlet-Triplet Qubits.” <i>ArXiv</i>, 1910.05841, doi:<a href=\"https://doi.org/10.48550/arXiv.1910.05841\">10.48550/arXiv.1910.05841</a>.","ista":"Hofmann AC, Jirovec D, Borovkov M, Prieto Gonzalez I, Ballabio A, Frigerio J, Chrastina D, Isella G, Katsaros G. Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits. arXiv, 1910.05841."},"publication":"arXiv"},{"department":[{"_id":"JiFr"}],"pmid":1,"issue":"13","corr_author":"1","ddc":["580"],"scopus_import":"1","isi":1,"publication":"International Journal of Molecular Sciences","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"ista":"Adamowski M, Li L, Friml J. 2019. Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. International Journal of Molecular Sciences. 20(13), 3337.","mla":"Adamowski, Maciek, et al. “Reorientation of Cortical Microtubule Arrays in the Hypocotyl of Arabidopsis Thaliana Is Induced by the Cell Growth Process and Independent of Auxin Signaling.” <i>International Journal of Molecular Sciences</i>, vol. 20, no. 13, 3337, MDPI, 2019, doi:<a href=\"https://doi.org/10.3390/ijms20133337\">10.3390/ijms20133337</a>.","chicago":"Adamowski, Maciek, Lanxin Li, and Jiří Friml. “Reorientation of Cortical Microtubule Arrays in the Hypocotyl of Arabidopsis Thaliana Is Induced by the Cell Growth Process and Independent of Auxin Signaling.” <i>International Journal of Molecular Sciences</i>. MDPI, 2019. <a href=\"https://doi.org/10.3390/ijms20133337\">https://doi.org/10.3390/ijms20133337</a>.","short":"M. Adamowski, L. Li, J. Friml, International Journal of Molecular Sciences 20 (2019).","ieee":"M. Adamowski, L. Li, and J. Friml, “Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling,” <i>International Journal of Molecular Sciences</i>, vol. 20, no. 13. MDPI, 2019.","apa":"Adamowski, M., Li, L., &#38; Friml, J. (2019). Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. <i>International Journal of Molecular Sciences</i>. MDPI. <a href=\"https://doi.org/10.3390/ijms20133337\">https://doi.org/10.3390/ijms20133337</a>","ama":"Adamowski M, Li L, Friml J. Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. <i>International Journal of Molecular Sciences</i>. 2019;20(13). doi:<a href=\"https://doi.org/10.3390/ijms20133337\">10.3390/ijms20133337</a>"},"status":"public","quality_controlled":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"article_number":"3337","article_processing_charge":"Yes","publication_identifier":{"eissn":["1422-0067"]},"date_updated":"2026-08-27T22:30:51Z","title":"Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling","month":"07","has_accepted_license":"1","day":"07","external_id":{"pmid":["31284661"],"isi":["000477041100221"]},"ec_funded":1,"oa_version":"Published Version","article_type":"original","publication_status":"published","abstract":[{"lang":"eng","text":"Cortical microtubule arrays in elongating epidermal cells in both the root and stem of plants have the propensity of dynamic reorientations that are correlated with the activation or inhibition of growth. Factors regulating plant growth, among them the hormone auxin, have been recognized as regulators of microtubule array orientations. Some previous work in the field has aimed at elucidating the causal relationship between cell growth, the signaling of auxin or other growth-regulating factors, and microtubule array reorientations, with various conclusions. Here, we revisit this problem of causality with a comprehensive set of experiments in Arabidopsis thaliana, using the now available pharmacological and genetic tools. We use isolated, auxin-depleted hypocotyls, an experimental system allowing for full control of both growth and auxin signaling. We demonstrate that reorientation of microtubules is not directly triggered by an auxin signal during growth activation. Instead, reorientation is triggered by the activation of the growth process itself and is auxin-independent in its nature. We discuss these findings in the context of previous relevant work, including that on the mechanical regulation of microtubule array orientation."}],"file_date_updated":"2020-07-14T12:47:34Z","related_material":{"record":[{"id":"10083","status":"public","relation":"dissertation_contains"}]},"oa":1,"year":"2019","date_published":"2019-07-07T00:00:00Z","volume":20,"publisher":"MDPI","_id":"6627","file":[{"relation":"main_file","checksum":"dd9d1cbb933a72ceb666c9667890ac51","file_id":"6645","content_type":"application/pdf","access_level":"open_access","file_size":3330291,"date_updated":"2020-07-14T12:47:34Z","creator":"dernst","date_created":"2019-07-17T06:17:15Z","file_name":"2019_JournalMolecularScience_Adamowski.pdf"}],"type":"journal_article","intvolume":"        20","doi":"10.3390/ijms20133337","project":[{"grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"},{"grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"author":[{"id":"45F536D2-F248-11E8-B48F-1D18A9856A87","full_name":"Adamowski, Maciek","orcid":"0000-0001-6463-5257","first_name":"Maciek","last_name":"Adamowski"},{"last_name":"Li","first_name":"Lanxin","orcid":"0000-0002-5607-272X","full_name":"Li, Lanxin","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","last_name":"Friml","first_name":"Jiří"}],"date_created":"2019-07-11T12:00:32Z"},{"month":"09","has_accepted_license":"1","ec_funded":1,"external_id":{"pmid":["31462775"],"isi":["000485415400061"]},"oa_version":"Submitted Version","day":"12","file_date_updated":"2020-11-26T16:33:44Z","related_material":{"record":[{"relation":"dissertation_contains","id":"8340","status":"public"}],"link":[{"description":"News on IST Website","relation":"press_release","url":"https://ist.ac.at/en/news/high-end-microscopy-reveals-structure-and-function-of-crucial-metabolic-enzyme/"}]},"publication_status":"published","acknowledged_ssus":[{"_id":"ScienComp"}],"article_type":"letter_note","abstract":[{"text":"Proton-translocating transhydrogenase (also known as nicotinamide nucleotide transhydrogenase (NNT)) is found in the plasma membranes of bacteria and the inner mitochondrial membranes of eukaryotes. NNT catalyses the transfer of a hydride between NADH and NADP+, coupled to the translocation of one proton across the membrane. Its main physiological function is the generation of NADPH, which is a substrate in anabolic reactions and a regulator of oxidative status; however, NNT may also fine-tune the Krebs cycle1,2. NNT deficiency causes familial glucocorticoid deficiency in humans and metabolic abnormalities in mice, similar to those observed in type II diabetes3,4. The catalytic mechanism of NNT has been proposed to involve a rotation of around 180° of the entire NADP(H)-binding domain that alternately participates in hydride transfer and proton-channel gating. However, owing to the lack of high-resolution structures of intact NNT, the details of this process remain unclear5,6. Here we present the cryo-electron microscopy structure of intact mammalian NNT in different conformational states. We show how the NADP(H)-binding domain opens the proton channel to the opposite sides of the membrane, and we provide structures of these two states. We also describe the catalytically important interfaces and linkers between the membrane and the soluble domains and their roles in nucleotide exchange. These structures enable us to propose a revised mechanism for a coupling process in NNT that is consistent with a large body of previous biochemical work. Our results are relevant to the development of currently unavailable NNT inhibitors, which may have therapeutic potential in ischaemia reperfusion injury, metabolic syndrome and some cancers7,8,9.","lang":"eng"}],"year":"2019","oa":1,"volume":573,"date_published":"2019-09-12T00:00:00Z","_id":"6848","publisher":"Springer Nature","file":[{"date_updated":"2020-11-26T16:33:44Z","creator":"lsazanov","file_name":"Manuscript_final_acc_withFigs_SI_opt_red.pdf","date_created":"2020-11-26T16:33:44Z","content_type":"application/pdf","access_level":"open_access","file_size":3066206,"checksum":"52728cda5210a3e9b74cc204e8aed3d5","success":1,"relation":"main_file","file_id":"8821"}],"intvolume":"       573","type":"journal_article","author":[{"last_name":"Kampjut","first_name":"Domen","orcid":"0000-0002-6018-3422","full_name":"Kampjut, Domen","id":"37233050-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","first_name":"Leonid A","last_name":"Sazanov"}],"date_created":"2019-09-04T06:21:41Z","doi":"10.1038/s41586-019-1519-2","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"pmid":1,"department":[{"_id":"LeSa"}],"issue":"7773","ddc":["572"],"publication":"Nature","page":"291–295","citation":{"ieee":"D. Kampjut and L. A. Sazanov, “Structure and mechanism of mitochondrial proton-translocating transhydrogenase,” <i>Nature</i>, vol. 573, no. 7773. Springer Nature, pp. 291–295, 2019.","apa":"Kampjut, D., &#38; Sazanov, L. A. (2019). Structure and mechanism of mitochondrial proton-translocating transhydrogenase. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-019-1519-2\">https://doi.org/10.1038/s41586-019-1519-2</a>","ama":"Kampjut D, Sazanov LA. Structure and mechanism of mitochondrial proton-translocating transhydrogenase. <i>Nature</i>. 2019;573(7773):291–295. doi:<a href=\"https://doi.org/10.1038/s41586-019-1519-2\">10.1038/s41586-019-1519-2</a>","ista":"Kampjut D, Sazanov LA. 2019. Structure and mechanism of mitochondrial proton-translocating transhydrogenase. Nature. 573(7773), 291–295.","mla":"Kampjut, Domen, and Leonid A. Sazanov. “Structure and Mechanism of Mitochondrial Proton-Translocating Transhydrogenase.” <i>Nature</i>, vol. 573, no. 7773, Springer Nature, 2019, pp. 291–295, doi:<a href=\"https://doi.org/10.1038/s41586-019-1519-2\">10.1038/s41586-019-1519-2</a>.","chicago":"Kampjut, Domen, and Leonid A Sazanov. “Structure and Mechanism of Mitochondrial Proton-Translocating Transhydrogenase.” <i>Nature</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41586-019-1519-2\">https://doi.org/10.1038/s41586-019-1519-2</a>.","short":"D. Kampjut, L.A. Sazanov, Nature 573 (2019) 291–295."},"scopus_import":"1","isi":1,"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","title":"Structure and mechanism of mitochondrial proton-translocating transhydrogenase","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"date_updated":"2026-08-27T22:30:59Z","acknowledgement":" We thank R. Thompson, G. Effantin and V.-V. Hodirnau for their assistance with collecting NADP+, NADPH and apo datasets, respectively. Data processing was performed at the IST high-performance computing cluster.\r\nThis project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement no. 665385."},{"volume":180,"date_published":"2019-06-01T00:00:00Z","year":"2019","oa":1,"abstract":[{"lang":"eng","text":"Polar auxin transport plays a pivotal role in plant growth and development. PIN auxin efflux carriers regulate directional auxin movement by establishing local auxin maxima, minima, and gradients that drive multiple developmental processes and responses to environmental signals. Auxin has been proposed to modulate its own transport by regulating subcellular PIN trafficking via processes such as clathrin-mediated PIN endocytosis and constitutive recycling. Here, we further investigated the mechanisms by which auxin affects PIN trafficking by screening auxin analogs and identified pinstatic acid (PISA) as a positive modulator of polar auxin transport in Arabidopsis thaliana. PISA had an auxin-like effect on hypocotyl elongation and adventitious root formation via positive regulation of auxin transport. PISA did not activate SCFTIR1/AFB signaling and yet induced PIN accumulation at the cell surface by inhibiting PIN internalization from the plasma membrane. This work demonstrates PISA to be a promising chemical tool to dissect the regulatory mechanisms behind subcellular PIN trafficking and auxin transport."}],"article_type":"original","publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","id":"11626","status":"public"},{"relation":"dissertation_contains","id":"8822","status":"public"}]},"day":"01","oa_version":"Published Version","external_id":{"pmid":["30936248"],"isi":["000470086100045"]},"ec_funded":1,"month":"06","project":[{"grant_number":"742985","_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020"}],"doi":"10.1104/pp.19.00201","date_created":"2019-04-09T08:38:20Z","author":[{"full_name":"Oochi, A","first_name":"A","last_name":"Oochi"},{"id":"4800CC20-F248-11E8-B48F-1D18A9856A87","full_name":"Hajny, Jakub","orcid":"0000-0003-2140-7195","first_name":"Jakub","last_name":"Hajny"},{"first_name":"K","last_name":"Fukui","full_name":"Fukui, K"},{"last_name":"Nakao","first_name":"Y","full_name":"Nakao, Y"},{"id":"35A03822-F248-11E8-B48F-1D18A9856A87","full_name":"Gallei, Michelle C","orcid":"0000-0003-1286-7368","first_name":"Michelle C","last_name":"Gallei"},{"full_name":"Quareshy, M","first_name":"M","last_name":"Quareshy"},{"full_name":"Takahashi, K","first_name":"K","last_name":"Takahashi"},{"full_name":"Kinoshita, T","first_name":"T","last_name":"Kinoshita"},{"last_name":"Harborough","first_name":"SR","full_name":"Harborough, SR"},{"first_name":"S","last_name":"Kepinski","full_name":"Kepinski, S"},{"last_name":"Kasahara","first_name":"H","full_name":"Kasahara, H"},{"last_name":"Napier","first_name":"RM","full_name":"Napier, RM"},{"first_name":"Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596"},{"last_name":"Hayashi","first_name":"KI","full_name":"Hayashi, KI"}],"intvolume":"       180","type":"journal_article","publisher":"ASPB","main_file_link":[{"url":"https://doi.org/10.1104/pp.19.00201","open_access":"1"}],"_id":"6260","status":"public","isi":1,"scopus_import":"1","page":"1152-1165","citation":{"ieee":"A. Oochi <i>et al.</i>, “Pinstatic acid promotes auxin transport by inhibiting PIN internalization,” <i>Plant Physiology</i>, vol. 180, no. 2. ASPB, pp. 1152–1165, 2019.","apa":"Oochi, A., Hajny, J., Fukui, K., Nakao, Y., Gallei, M. C., Quareshy, M., … Hayashi, K. (2019). Pinstatic acid promotes auxin transport by inhibiting PIN internalization. <i>Plant Physiology</i>. ASPB. <a href=\"https://doi.org/10.1104/pp.19.00201\">https://doi.org/10.1104/pp.19.00201</a>","ama":"Oochi A, Hajny J, Fukui K, et al. Pinstatic acid promotes auxin transport by inhibiting PIN internalization. <i>Plant Physiology</i>. 2019;180(2):1152-1165. doi:<a href=\"https://doi.org/10.1104/pp.19.00201\">10.1104/pp.19.00201</a>","short":"A. Oochi, J. Hajny, K. Fukui, Y. Nakao, M.C. Gallei, M. Quareshy, K. Takahashi, T. Kinoshita, S. Harborough, S. Kepinski, H. Kasahara, R. Napier, J. Friml, K. Hayashi, Plant Physiology 180 (2019) 1152–1165.","ista":"Oochi A, Hajny J, Fukui K, Nakao Y, Gallei MC, Quareshy M, Takahashi K, Kinoshita T, Harborough S, Kepinski S, Kasahara H, Napier R, Friml J, Hayashi K. 2019. Pinstatic acid promotes auxin transport by inhibiting PIN internalization. Plant Physiology. 180(2), 1152–1165.","mla":"Oochi, A., et al. “Pinstatic Acid Promotes Auxin Transport by Inhibiting PIN Internalization.” <i>Plant Physiology</i>, vol. 180, no. 2, ASPB, 2019, pp. 1152–65, doi:<a href=\"https://doi.org/10.1104/pp.19.00201\">10.1104/pp.19.00201</a>.","chicago":"Oochi, A, Jakub Hajny, K Fukui, Y Nakao, Michelle C Gallei, M Quareshy, K Takahashi, et al. “Pinstatic Acid Promotes Auxin Transport by Inhibiting PIN Internalization.” <i>Plant Physiology</i>. ASPB, 2019. <a href=\"https://doi.org/10.1104/pp.19.00201\">https://doi.org/10.1104/pp.19.00201</a>."},"publication":"Plant Physiology","ddc":["580"],"issue":"2","department":[{"_id":"JiFr"}],"pmid":1,"acknowledgement":"We thank Dr. H. Fukaki (University of Kobe), Dr. R. Offringa (Leiden University), Dr. Jianwei Pan (Zhejiang Normal University), and Dr. M. Estelle (University of California at San Diego) for providing mutants and transgenic line seeds.\r\nThis work was supported by the Ministry of Education, Culture, Sports, Science, and Technology (Grant-in-Aid for Scientific Research no. JP25114518 to K.H.), the Biotechnology and Biological Sciences Research Council (award no. BB/L009366/1 to R.N. and S.K.), and the European Union’s Horizon2020 program (European Research Council grant agreement no. 742985 to J.F.).","date_updated":"2026-08-27T22:31:00Z","publication_identifier":{"eissn":["1532-2548"],"issn":["0032-0889"]},"title":"Pinstatic acid promotes auxin transport by inhibiting PIN internalization","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"month":"09","has_accepted_license":"1","OA_place":"publisher","day":"09","oa_version":"Published Version","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"M-Shop"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Brain function is mediated by complex dynamical interactions between excitatory and inhibitory cell types. The Cholecystokinin-expressing inhibitory cells (CCK-interneurons) are one of the least studied types, despite being suspected to play important roles in cognitive processes. We studied the network effects of optogenetic silencing of CCK-interneurons in the CA1 hippocampal area during exploration and sleep states. The cell firing pattern in response to light pulses allowed us to classify the recorded neurons in 5 classes, including disinhibited and non-responsive pyramidal cell and interneurons, and the inhibited interneurons corresponding to the CCK group. The light application, which inhibited the activity of CCK interneurons triggered wider changes in the firing dynamics of cells. We observed rate changes (i.e. remapping) of pyramidal cells during the exploration session in which the light was applied relative to the previous control session that was not restricted neither in time nor space to the light delivery. Also, the disinhibited pyramidal cells had higher increase in bursting than in single spike firing rate as a result of CCK silencing. In addition, the firing activity patterns during exploratory periods were more weakly reactivated in sleep for those periods in which CCK-interneuron were silenced than in the unaffected periods. Furthermore, light pulses during sleep disrupted the reactivation of recent waking patterns. Hence, silencing CCK neurons during exploration suppressed the reactivation of waking firing patterns in sleep and CCK interneuron activity was also required during sleep for the normal reactivation of waking patterns. These findings demonstrate the involvement of CCK cells in reactivation-related memory consolidation. An important part of our analysis was to test the relationship of the identified CCKinterneurons to brain oscillations. Our findings showed that these cells exhibited different oscillatory behaviour during anaesthesia and natural waking and sleep conditions. We showed that: 1) Contrary to the past studies performed under anaesthesia, the identified CCKinterneurons fired on the descending portion of the theta phase in waking exploration. 2) CCKinterneuron preferred phases around the trough of gamma oscillations. 3) Contrary to anaesthesia conditions, the average firing rate of the CCK-interneurons increased around the peak activity of the sharp-wave ripple (SWR) events in natural sleep, which is congruent with new reports about their functional connectivity. We also found that light driven CCK-interneuron silencing altered the dynamics on the CA1 network oscillatory activity: 1) Pyramidal cells negatively shifted their preferred theta phases when the light was applied, while interneurons responses were less consistent. 2) As a population, pyramidal cells negatively shifted their preferred activity during gamma oscillations, albeit we did not find gamma modulation differences related to the light application when pyramidal cells were subdivided into the disinhibited and unaffected groups. 3) During the peak of SWR events, all but the CCK-interneurons had a reduction in their relative firing rate change during the light application as compared to the change observed at SWR initiation. Finally, regarding to the place field activity of the recorded pyramidal neurons, we showed that the disinhibited pyramidal cells had reduced place field similarity, coherence and spatial information, but only during the light application. The mechanisms behind such observed behaviours might involve eCB signalling and plastic changes in CCK-interneuron synapses. In conclusion, the observed changes related to the light-mediated silencing of CCKinterneurons have unravelled characteristics of this interneuron subpopulation that might change the understanding not only of their particular network interactions, but also of the current theories about the emergence of certain cognitive processes such as place coding needed for navigation or hippocampus-dependent memory consolidation. "}],"file_date_updated":"2021-02-10T23:30:09Z","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"5914"}]},"oa":1,"year":"2019","date_published":"2019-09-09T00:00:00Z","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","supervisor":[{"last_name":"Csicsvari","first_name":"Jozsef L","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"}],"_id":"6849","file":[{"embargo_to":"open_access","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","file_size":18253100,"relation":"source_file","checksum":"244dc4f74dbfc94f414156092298831f","file_id":"6865","date_updated":"2021-02-10T23:30:09Z","file_name":"Thesis_Damaris_Rangel_source.docx","date_created":"2019-09-09T13:09:45Z","creator":"drangel"},{"content_type":"application/pdf","request_a_copy":0,"access_level":"open_access","file_size":2160109,"relation":"main_file","checksum":"59c73be40eeaa1c4db24067270151555","file_id":"6866","date_updated":"2020-09-11T22:30:04Z","creator":"drangel","file_name":"Thesis_Damaris_Rangel_pdfa.pdf","embargo":"2020-09-10","date_created":"2019-09-09T13:09:52Z"}],"type":"dissertation","doi":"10.15479/AT:ISTA:6849","date_created":"2019-09-06T06:54:16Z","author":[{"last_name":"Rangel Guerrero","first_name":"Dámaris K","orcid":"0000-0002-8602-4374","full_name":"Rangel Guerrero, Dámaris K","id":"4871BCE6-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"JoCs"}],"corr_author":"1","ddc":["570"],"degree_awarded":"PhD","page":"97","citation":{"ama":"Rangel Guerrero DK. The role of CCK-interneurons in regulating hippocampal network dynamics. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6849\">10.15479/AT:ISTA:6849</a>","apa":"Rangel Guerrero, D. K. (2019). <i>The role of CCK-interneurons in regulating hippocampal network dynamics</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:6849\">https://doi.org/10.15479/AT:ISTA:6849</a>","ieee":"D. K. Rangel Guerrero, “The role of CCK-interneurons in regulating hippocampal network dynamics,” Institute of Science and Technology Austria, 2019.","short":"D.K. Rangel Guerrero, The Role of CCK-Interneurons in Regulating Hippocampal Network Dynamics, Institute of Science and Technology Austria, 2019.","chicago":"Rangel Guerrero, Dámaris K. “The Role of CCK-Interneurons in Regulating Hippocampal Network Dynamics.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:6849\">https://doi.org/10.15479/AT:ISTA:6849</a>.","mla":"Rangel Guerrero, Dámaris K. <i>The Role of CCK-Interneurons in Regulating Hippocampal Network Dynamics</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6849\">10.15479/AT:ISTA:6849</a>.","ista":"Rangel Guerrero DK. 2019. The role of CCK-interneurons in regulating hippocampal network dynamics. Institute of Science and Technology Austria."},"status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"article_processing_charge":"No","publication_identifier":{"isbn":["978-3-99078-003-9"],"issn":["2663-337X"]},"date_updated":"2026-04-08T13:56:53Z","title":"The role of CCK-interneurons in regulating hippocampal network dynamics"},{"date_updated":"2026-08-27T22:31:03Z","title":"Modular verification for almost-sure termination of probabilistic programs","article_number":"129","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"name":"OOPSLA: Object-oriented Programming, Systems, Languages and Applications","end_date":"2019-10-25","location":"Athens, Greece","start_date":"2019-10-23"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","scopus_import":"1","citation":{"ieee":"M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, Athens, Greece, 2019, vol. 3.","ama":"Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. In: <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>. Vol 3. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3360555\">10.1145/3360555</a>","apa":"Huang, M., Fu, H., Chatterjee, K., &#38; Goharshady, A. K. (2019). Modular verification for almost-sure termination of probabilistic programs. In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i> (Vol. 3). Athens, Greece: ACM. <a href=\"https://doi.org/10.1145/3360555\">https://doi.org/10.1145/3360555</a>","short":"M. Huang, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ACM, 2019.","ista":"Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 129.","mla":"Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, vol. 3, 129, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3360555\">10.1145/3360555</a>.","chicago":"Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, Vol. 3. ACM, 2019. <a href=\"https://doi.org/10.1145/3360555\">https://doi.org/10.1145/3360555</a>."},"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png"},"publication":"Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications ","ddc":["000"],"license":"https://creativecommons.org/licenses/by-nc/4.0/","department":[{"_id":"KrCh"}],"project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"doi":"10.1145/3360555","author":[{"first_name":"Mingzhang","last_name":"Huang","full_name":"Huang, Mingzhang"},{"full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Goharshady","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar"}],"date_created":"2019-08-09T09:54:20Z","type":"conference","intvolume":"         3","file":[{"file_size":1024643,"access_level":"open_access","content_type":"application/pdf","file_id":"6807","checksum":"3482d8ace6fb4991eb7810e3b70f1b9f","relation":"main_file","creator":"akafshda","file_name":"oopsla-2019.pdf","date_created":"2019-08-12T15:40:57Z","date_updated":"2020-07-14T12:47:40Z"},{"creator":"dernst","date_created":"2020-05-12T15:15:14Z","file_name":"2019_ACM_Huang.pdf","date_updated":"2020-07-14T12:47:40Z","file_size":538579,"access_level":"open_access","content_type":"application/pdf","file_id":"7821","checksum":"4e5a6fb2b59a75222a4e8335a5a60eac","relation":"main_file"}],"publisher":"ACM","_id":"6780","volume":3,"date_published":"2019-10-01T00:00:00Z","oa":1,"year":"2019","arxiv":1,"abstract":[{"lang":"eng","text":"In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a\r\ngiven probabilistic program terminates with probability 1. Scalable approaches for program analysis often\r\nrely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule)\r\nof Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure\r\ntermination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [16]. While the\r\nproposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed\r\nmodular rule is still not sound for almost-sure termination of probabilistic programs.\r\nBesides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a\r\nsound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel\r\nnotion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales\r\nthat are linear and show that they can be synthesized in polynomial time. Finally, we present experimental\r\nresults on a variety of benchmarks and several natural examples that model various types of nested while\r\nloops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure\r\ntermination property"}],"publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"file_date_updated":"2020-07-14T12:47:40Z","day":"01","oa_version":"Published Version","ec_funded":1,"external_id":{"arxiv":["1901.06087"]},"has_accepted_license":"1","month":"10"},{"type":"conference","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","last_name":"Goharshady"},{"first_name":"Ehsan Kafshdar","last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar"}],"date_created":"2019-05-26T21:59:15Z","doi":"10.1145/3297280.3297322","_id":"6490","publisher":"ACM","file":[{"access_level":"open_access","file_size":6937138,"content_type":"application/pdf","file_id":"7827","relation":"main_file","checksum":"dddc20f6d9881f23b8755eb720ec9d6f","creator":"dernst","date_created":"2020-05-14T09:50:11Z","file_name":"2019_ACM_Chatterjee.pdf","date_updated":"2020-07-14T12:47:32Z"}],"file_date_updated":"2020-07-14T12:47:32Z","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"publication_status":"published","abstract":[{"text":"Smart contracts are programs that are stored and executed on the Blockchain and can receive, manage and transfer money (cryptocurrency units). Two important problems regarding smart contracts are formal analysis and compiler optimization. Formal analysis is extremely important, because smart contracts hold funds worth billions of dollars and their code is immutable after deployment. Hence, an undetected bug can cause significant financial losses. Compiler optimization is also crucial, because every action of a smart contract has to be executed by every node in the Blockchain network. Therefore, optimizations in compiling smart contracts can lead to significant savings in computation, time and energy.\r\n\r\nTwo classical approaches in program analysis and compiler optimization are intraprocedural and interprocedural analysis. In intraprocedural analysis, each function is analyzed separately, while interprocedural analysis considers the entire program. In both cases, the analyses are usually reduced to graph problems over the control flow graph (CFG) of the program. These graph problems are often computationally expensive. Hence, there has been ample research on exploiting structural properties of CFGs for efficient algorithms. One such well-studied property is the treewidth, which is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs of structured programs have treewidth at most 6, whereas the interprocedural treewidth cannot be bounded. This result has been used as a basis for many efficient intraprocedural analyses.\r\n\r\nIn this paper, we explore the idea of exploiting the treewidth of smart contracts for formal analysis and compiler optimization. First, similar to classical programs, we show that the intraprocedural treewidth of structured Solidity and Vyper smart contracts is at most 9. Second, for global analysis, we prove that the interprocedural treewidth of structured smart contracts is bounded by 10 and, in sharp contrast with classical programs, treewidth-based algorithms can be easily applied for interprocedural analysis. Finally, we supplement our theoretical results with experiments using a tool we implemented for computing treewidth of smart contracts and show that the treewidth is much lower in practice. We use 36,764 real-world Ethereum smart contracts as benchmarks and find that they have an average treewidth of at most 3.35 for the intraprocedural case and 3.65 for the interprocedural case.\r\n","lang":"eng"}],"year":"2019","oa":1,"date_published":"2019-04-01T00:00:00Z","volume":"Part F147772","month":"04","has_accepted_license":"1","external_id":{"isi":["000474685800052"]},"oa_version":"Submitted Version","day":"01","article_processing_charge":"No","title":"The treewidth of smart contracts","publication_identifier":{"isbn":["9781450359337"]},"date_updated":"2026-08-27T22:31:03Z","conference":{"start_date":"2019-04-08","name":"SAC: Symposium on Applied Computing","end_date":"2019-04-12","location":"Limassol, Cyprus"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","publication":"Proceedings of the 34th ACM Symposium on Applied Computing","citation":{"short":"K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 400–408.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.” In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Part F147772:400–408. ACM, 2019. <a href=\"https://doi.org/10.1145/3297280.3297322\">https://doi.org/10.1145/3297280.3297322</a>.","ista":"Chatterjee K, Goharshady AK, Goharshady EK. 2019. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772, 400–408.","mla":"Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.” <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, vol. Part F147772, ACM, 2019, pp. 400–08, doi:<a href=\"https://doi.org/10.1145/3297280.3297322\">10.1145/3297280.3297322</a>.","ama":"Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. In: <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>. Vol Part F147772. ACM; 2019:400-408. doi:<a href=\"https://doi.org/10.1145/3297280.3297322\">10.1145/3297280.3297322</a>","apa":"Chatterjee, K., Goharshady, A. K., &#38; Goharshady, E. K. (2019). The treewidth of smart contracts. In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i> (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. <a href=\"https://doi.org/10.1145/3297280.3297322\">https://doi.org/10.1145/3297280.3297322</a>","ieee":"K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Limassol, Cyprus, 2019, vol. Part F147772, pp. 400–408."},"page":"400-408","scopus_import":"1","isi":1,"status":"public","pubrep_id":"1070","department":[{"_id":"KrCh"}],"ddc":["000"],"corr_author":"1"},{"scopus_import":"1","isi":1,"publication":"ACM Transactions on Programming Languages and Systems","citation":{"short":"K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019).","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4, 23, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3363525\">10.1145/3363525</a>.","ista":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3363525\">https://doi.org/10.1145/3363525</a>.","ieee":"K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4. ACM, 2019.","apa":"Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/3363525\">https://doi.org/10.1145/3363525</a>","ama":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. <i>ACM Transactions on Programming Languages and Systems</i>. 2019;41(4). doi:<a href=\"https://doi.org/10.1145/3363525\">10.1145/3363525</a>"},"status":"public","department":[{"_id":"KrCh"}],"issue":"4","ddc":["000"],"article_number":"23","article_processing_charge":"No","publication_identifier":{"issn":["0164-0925"]},"date_updated":"2026-08-27T22:31:03Z","title":"Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","article_type":"original","abstract":[{"text":"Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, and so on. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in an important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect we consider is that the control flow graphs for most programs have constant treewidth.\r\n\r\nOur main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing but can answer subsequent queries significantly faster as compared to the current algorithmic solutions for interprocedural dataflow analysis. We have also implemented our algorithms and evaluated their performance for performing on-demand interprocedural dataflow analysis on various domains, such as for live variable analysis and reaching definitions, on a standard benchmark set. Our experimental results align with our theoretical statements and show that after a lightweight preprocessing, on-demand queries are answered much faster than the standard existing algorithmic approaches.\r\n","lang":"eng"}],"file_date_updated":"2020-10-08T12:58:10Z","related_material":{"record":[{"status":"public","id":"8934","relation":"dissertation_contains"}]},"year":"2019","oa":1,"date_published":"2019-11-01T00:00:00Z","volume":41,"month":"11","has_accepted_license":"1","day":"01","ec_funded":1,"external_id":{"isi":["000564108400004"]},"oa_version":"Submitted Version","intvolume":"        41","type":"journal_article","doi":"10.1145/3363525","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"date_created":"2019-12-09T08:33:33Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","last_name":"Goharshady"},{"last_name":"Goyal","first_name":"Prateesh","full_name":"Goyal, Prateesh"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"publisher":"ACM","_id":"7158","file":[{"date_created":"2020-10-08T12:58:10Z","file_name":"2019_ACMTransactions_Chatterjee.pdf","creator":"dernst","date_updated":"2020-10-08T12:58:10Z","file_id":"8632","checksum":"291cc86a07bd010d4815e177dac57b70","success":1,"relation":"main_file","access_level":"open_access","file_size":667357,"content_type":"application/pdf"}]},{"publication":"Proceedings of the 34th ACM Symposium on Applied Computing","citation":{"ieee":"K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Limassol, Cyprus, 2019, vol. Part F147772, pp. 374–381.","apa":"Chatterjee, K., Goharshady, A. K., &#38; Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i> (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. <a href=\"https://doi.org/10.1145/3297280.3297319\">https://doi.org/10.1145/3297280.3297319</a>","ama":"Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In: <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>. Vol Part F147772. ACM; 2019:374-381. doi:<a href=\"https://doi.org/10.1145/3297280.3297319\">10.1145/3297280.3297319</a>","short":"K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381.","mla":"Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, vol. Part F147772, ACM, 2019, pp. 374–81, doi:<a href=\"https://doi.org/10.1145/3297280.3297319\">10.1145/3297280.3297319</a>.","ista":"Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772, 374–381.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Part F147772:374–81. ACM, 2019. <a href=\"https://doi.org/10.1145/3297280.3297319\">https://doi.org/10.1145/3297280.3297319</a>."},"page":"374-381","scopus_import":"1","isi":1,"pubrep_id":"1069","status":"public","department":[{"_id":"KrCh"}],"ddc":["004"],"article_processing_charge":"No","title":"Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving","publication_identifier":{"isbn":["9781450359337"]},"date_updated":"2026-08-27T22:31:03Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","conference":{"start_date":"2019-04-08","end_date":"2019-04-12","location":"Limassol, Cyprus","name":"ACM Symposium on Applied Computing"},"language":[{"iso":"eng"}],"quality_controlled":"1","file_date_updated":"2020-07-14T12:47:29Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"publication_status":"published","abstract":[{"text":"In today's cryptocurrencies, Hashcash proof of work is the most commonly-adopted approach to mining. In Hashcash, when a miner decides to add a block to the chain, she has to solve the difficult computational puzzle of inverting a hash function. While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it has attracted significant and harsh criticism due to its massive waste of electricity, its carbon footprint and environmental effects, and the inherent lack of usefulness in inverting a hash function. Various other mining protocols have been suggested, including proof of stake, in which a miner's chance of adding the next block is proportional to her current balance. However, such protocols lead to a higher entry cost for new miners who might not still have any stake in the cryptocurrency, and can in the worst case lead to an oligopoly, where the rich have complete control over mining. In this paper, we propose Hybrid Mining: a new mining protocol that combines solving real-world useful problems with Hashcash. Our protocol allows new miners to join the network by taking part in Hashcash mining without having to own an initial stake. It also allows nodes of the network to submit hard computational problems whose solutions are of interest in the real world, e.g.~protein folding problems. Then, miners can choose to compete in solving these problems, in lieu of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners to solve useful problems, such as hard computational problems arising in biology, in a distributed manner. It also gives researchers in other areas an easy-to-use tool to outsource their hard computations to the blockchain network, which has enormous computational power, by paying a reward to the miner who solves the problem for them. Moreover, our protocol provides strong security guarantees and is at least as resilient to double spending as Bitcoin.","lang":"eng"}],"year":"2019","oa":1,"date_published":"2019-04-01T00:00:00Z","volume":"Part F147772","month":"04","has_accepted_license":"1","external_id":{"isi":["000474685800049"]},"ec_funded":1,"oa_version":"Submitted Version","day":"01","type":"conference","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"},{"first_name":"Arash","last_name":"Pourdamghani","full_name":"Pourdamghani, Arash"}],"date_created":"2019-05-06T12:11:36Z","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"doi":"10.1145/3297280.3297319","_id":"6378","publisher":"ACM","file":[{"creator":"dernst","file_name":"2019_ACM_Chatterjee.pdf","date_created":"2019-05-06T12:09:27Z","date_updated":"2020-07-14T12:47:29Z","file_size":1023934,"access_level":"open_access","content_type":"application/pdf","file_id":"6379","checksum":"fbfbcd5a0c7a743862bfc3045539a614","relation":"main_file"}]},{"has_accepted_license":"1","month":"06","oa_version":"Submitted Version","ec_funded":1,"external_id":{"isi":["000523190300014"],"arxiv":["1902.04659"]},"day":"08","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5457"},{"relation":"dissertation_contains","id":"8934","status":"public"}]},"file_date_updated":"2020-07-14T12:47:20Z","abstract":[{"text":"We consider the problem of expected cost analysis over nondeterministic probabilistic programs,\r\nwhich aims at automated methods for analyzing the resource-usage of such programs.\r\nPrevious approaches for this problem could only handle nonnegative bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols,\r\nboth positive and negative costs are necessary and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient approach to obtain polynomial bounds on the\r\nexpected accumulated cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a) general positive and negative costs with bounded updates in\r\nvariables; and (b) nonnegative costs with general updates to variables.\r\nWe show that several natural examples which could not be\r\nhandled by previous approaches are captured in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds.","lang":"eng"}],"publication_status":"published","arxiv":1,"date_published":"2019-06-08T00:00:00Z","oa":1,"year":"2019","_id":"6175","publisher":"Association for Computing Machinery","file":[{"file_size":4051066,"access_level":"open_access","content_type":"application/pdf","file_id":"6176","relation":"main_file","checksum":"703a5e9b8c8587f2a44085ffd9a4db64","creator":"akafshda","date_created":"2019-03-25T10:11:22Z","file_name":"paper.pdf","date_updated":"2020-07-14T12:47:20Z"}],"type":"conference","author":[{"first_name":"Peixin","last_name":"Wang","full_name":"Wang, Peixin"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei","first_name":"Hongfei","last_name":"Fu"},{"full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","last_name":"Goharshady"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Qin","first_name":"Xudong","full_name":"Qin, Xudong"},{"full_name":"Shi, Wenjun","first_name":"Wenjun","last_name":"Shi"}],"date_created":"2019-03-25T10:13:25Z","doi":"10.1145/3314221.3314581","project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"department":[{"_id":"KrCh"}],"ddc":["000"],"page":"204-220","citation":{"ista":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.","mla":"Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2019, pp. 204–20, doi:<a href=\"https://doi.org/10.1145/3314221.3314581\">10.1145/3314221.3314581</a>.","chicago":"Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, 204–20. Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3314221.3314581\">https://doi.org/10.1145/3314221.3314581</a>.","short":"P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–220.","ieee":"P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Phoenix, AZ, United States, 2019, pp. 204–220.","ama":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2019:204-220. doi:<a href=\"https://doi.org/10.1145/3314221.3314581\">10.1145/3314221.3314581</a>","apa":"Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., &#38; Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3314221.3314581\">https://doi.org/10.1145/3314221.3314581</a>"},"publication":"PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","isi":1,"scopus_import":"1","status":"public","keyword":["Program Cost Analysis","Program Termination","Probabilistic Programs","Martingales"],"conference":{"start_date":"2019-06-22","location":"Phoenix, AZ, United States","end_date":"2019-06-26","name":"PLDI: Conference on Programming Language Design and Implementation"},"language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","article_processing_charge":"No","title":"Cost analysis of nondeterministic probabilistic programs","date_updated":"2026-08-27T22:31:03Z"},{"issue":"4","department":[{"_id":"KrCh"}],"status":"public","publication":"ACM Transactions on Programming Languages and Systems","citation":{"short":"K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages and Systems 41 (2019).","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3339984\">https://doi.org/10.1145/3339984</a>.","mla":"Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4, 20, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3339984\">10.1145/3339984</a>.","ista":"Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 41(4), 20.","ama":"Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive programs. <i>ACM Transactions on Programming Languages and Systems</i>. 2019;41(4). doi:<a href=\"https://doi.org/10.1145/3339984\">10.1145/3339984</a>","apa":"Chatterjee, K., Fu, H., &#38; Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/3339984\">https://doi.org/10.1145/3339984</a>","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4. ACM, 2019."},"scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","title":"Non-polynomial worst-case analysis of recursive programs","date_updated":"2026-08-27T22:31:03Z","article_processing_charge":"No","article_number":"20","ec_funded":1,"external_id":{"arxiv":["1705.00317"],"isi":["000564108400001"]},"oa_version":"Preprint","day":"01","month":"10","arxiv":1,"year":"2019","oa":1,"volume":41,"date_published":"2019-10-01T00:00:00Z","related_material":{"record":[{"status":"public","id":"639","relation":"earlier_version"},{"relation":"dissertation_contains","id":"8934","status":"public"}]},"article_type":"original","publication_status":"published","abstract":[{"lang":"eng","text":"We study the problem of developing efficient approaches for proving\r\nworst-case bounds of non-deterministic recursive programs. Ranking functions\r\nare sound and complete for proving termination and worst-case bounds of\r\nnonrecursive programs. First, we apply ranking functions to recursion,\r\nresulting in measure functions. We show that measure functions provide a sound\r\nand complete approach to prove worst-case bounds of non-deterministic recursive\r\nprograms. Our second contribution is the synthesis of measure functions in\r\nnonpolynomial forms. We show that non-polynomial measure functions with\r\nlogarithm and exponentiation can be synthesized through abstraction of\r\nlogarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem\r\nusing linear programming. While previous methods obtain worst-case polynomial\r\nbounds, our approach can synthesize bounds of the form $\\mathcal{O}(n\\log n)$\r\nas well as $\\mathcal{O}(n^r)$ where $r$ is not an integer. We present\r\nexperimental results to demonstrate that our approach can obtain efficiently\r\nworst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the\r\ndivide-and-conquer algorithm for the Closest-Pair problem, where we obtain\r\n$\\mathcal{O}(n \\log n)$ worst-case bound, and (ii) Karatsuba's algorithm for\r\npolynomial multiplication and Strassen's algorithm for matrix multiplication,\r\nwhere we obtain $\\mathcal{O}(n^r)$ bound such that $r$ is not an integer and\r\nclose to the best-known bounds for the respective algorithms."}],"_id":"7014","publisher":"ACM","main_file_link":[{"url":"https://arxiv.org/abs/1705.00317","open_access":"1"}],"date_created":"2019-11-13T08:33:43Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"last_name":"Goharshady","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar"}],"project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"doi":"10.1145/3339984","intvolume":"        41","type":"journal_article"},{"month":"01","has_accepted_license":"1","ec_funded":1,"oa_version":"Published Version","OA_place":"publisher","day":"01","file_date_updated":"2020-07-14T12:47:29Z","related_material":{"record":[{"status":"public","id":"8934","relation":"dissertation_contains"}]},"publication_status":"published","article_type":"original","abstract":[{"text":"There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in programs. The predominant technique to address this issue has been Data Packing: data elements that are frequently accessed within time proximity are packed into the same cache block, thereby minimizing accesses to the main memory. We consider the algorithmic problem of Data Packing on a two-level memory system. Given a reference sequence R of accesses to data elements, the task is to partition the elements into cache blocks such that the number of cache misses on R is minimized. The problem is notoriously difficult: it is NP-hard even when the cache has size 1, and is hard to approximate for any cache size larger than 4. Therefore, all existing techniques for Data Packing are based on heuristics and lack theoretical guarantees. In this work, we present the first positive theoretical results for Data Packing, along with new and stronger negative results. We consider the problem under the lens of the underlying access hypergraphs, which are hypergraphs of affinities between the data elements, where the order of an access hypergraph corresponds to the size of the affinity group. We study the problem parameterized by the treewidth of access hypergraphs, which is a standard notion in graph theory to measure the closeness of a graph to a tree. Our main results are as follows: We show there is a number q* depending on the cache parameters such that (a) if the access hypergraph of order q* has constant treewidth, then there is a linear-time algorithm for Data Packing; (b)the Data Packing problem remains NP-hard even if the access hypergraph of order q*-1 has constant treewidth. Thus, we establish a fine-grained dichotomy depending on a single parameter, namely, the highest order among access hypegraphs that have constant treewidth; and establish the optimal value q* of this parameter. Finally, we present an experimental evaluation of a prototype implementation of our algorithm. Our results demonstrate that, in practice, access hypergraphs of many commonly-used algorithms have small treewidth. We compare our approach with several state-of-the-art heuristic-based algorithms and show that our algorithm leads to significantly fewer cache-misses. ","lang":"eng"}],"oa":1,"year":"2019","date_published":"2019-01-01T00:00:00Z","volume":3,"_id":"6380","publisher":"ACM","file":[{"relation":"main_file","checksum":"c157752f96877b36685ad7063ada4524","file_id":"6381","content_type":"application/pdf","file_size":1294962,"access_level":"open_access","date_updated":"2020-07-14T12:47:29Z","file_name":"2019_ACM_POPL_Chatterjee.pdf","date_created":"2019-05-06T12:23:11Z","creator":"dernst"}],"intvolume":"         3","type":"journal_article","date_created":"2019-05-06T12:18:17Z","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"},{"full_name":"Okati, Nastaran","last_name":"Okati","first_name":"Nastaran"},{"first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"}],"project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"doi":"10.1145/3290366","department":[{"_id":"KrCh"}],"issue":"POPL","ddc":["004"],"publication":"Proceedings of the ACM on Programming Languages","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"ista":"Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53.","mla":"Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 3, no. POPL, 53, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3290366\">10.1145/3290366</a>.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” <i>Proceedings of the ACM on Programming Languages</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3290366\">https://doi.org/10.1145/3290366</a>.","short":"K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 3 (2019).","ieee":"K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 3, no. POPL. ACM, 2019.","apa":"Chatterjee, K., Goharshady, A. K., Okati, N., &#38; Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. <i>Proceedings of the ACM on Programming Languages</i>. ACM. <a href=\"https://doi.org/10.1145/3290366\">https://doi.org/10.1145/3290366</a>","ama":"Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. Efficient parameterized algorithms for data packing. <i>Proceedings of the ACM on Programming Languages</i>. 2019;3(POPL). doi:<a href=\"https://doi.org/10.1145/3290366\">10.1145/3290366</a>"},"scopus_import":"1","pubrep_id":"1056","status":"public","OA_type":"hybrid","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"Yes (in subscription journal)","article_number":"53","title":"Efficient parameterized algorithms for data packing","publication_identifier":{"issn":["2475-1421"]},"date_updated":"2026-08-27T22:31:04Z","acknowledgement":"The research was partially supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC\r\nStarting Grant (279307: Graph Games), and the IBM PhD Fellowship program."},{"quality_controlled":"1","conference":{"start_date":"2019-05-14","name":"IEEE International Conference on Blockchain and Cryptocurrency","end_date":"2019-05-17","location":"Seoul, Korea"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"date_updated":"2026-08-27T22:31:04Z","title":"Probabilistic smart contracts: Secure randomness on the blockchain","article_number":"8751326","article_processing_charge":"No","department":[{"_id":"KrCh"}],"status":"public","scopus_import":"1","isi":1,"publication":"IEEE International Conference on Blockchain and Cryptocurrency","citation":{"ista":"Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency, 8751326.","mla":"Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” <i>IEEE International Conference on Blockchain and Cryptocurrency</i>, 8751326, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">10.1109/BLOC.2019.8751326</a>.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In <i>IEEE International Conference on Blockchain and Cryptocurrency</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">https://doi.org/10.1109/BLOC.2019.8751326</a>.","short":"K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International Conference on Blockchain and Cryptocurrency, IEEE, 2019.","ieee":"K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in <i>IEEE International Conference on Blockchain and Cryptocurrency</i>, Seoul, Korea, 2019.","ama":"Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts: Secure randomness on the blockchain. In: <i>IEEE International Conference on Blockchain and Cryptocurrency</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">10.1109/BLOC.2019.8751326</a>","apa":"Chatterjee, K., Goharshady, A. K., &#38; Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In <i>IEEE International Conference on Blockchain and Cryptocurrency</i>. Seoul, Korea: IEEE. <a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">https://doi.org/10.1109/BLOC.2019.8751326</a>"},"publisher":"IEEE","main_file_link":[{"url":"https://arxiv.org/abs/1902.07986","open_access":"1"}],"_id":"6056","project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"}],"doi":"10.1109/BLOC.2019.8751326","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","last_name":"Goharshady"},{"full_name":"Pourdamghani, Arash","first_name":"Arash","last_name":"Pourdamghani"}],"date_created":"2019-02-26T09:03:15Z","type":"conference","day":"01","external_id":{"isi":["000491257000076"],"arxiv":["1902.07986"]},"ec_funded":1,"oa_version":"Preprint","month":"05","oa":1,"year":"2019","date_published":"2019-05-01T00:00:00Z","arxiv":1,"publication_status":"published","abstract":[{"lang":"eng","text":"In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games and lotteries, depend entirely on randomness. As a result, several ad-hoc random number generation approaches have been developed to be used in smart contracts. These include ideas such as using an oracle or relying on the block hash. However, these approaches are manipulatable, i.e. their output can be tampered with by parties who might not be neutral, such as the owner of the oracle or the miners.We propose a novel game-theoretic approach for generating provably unmanipulatable pseudorandom numbers on the blockchain. Our approach allows smart contracts to access a trustworthy source of randomness that does not rely on potentially compromised miners or oracles, hence enabling the creation of a new generation of smart contracts that are not limited to being non-probabilistic and can be drawn from the much more general class of probabilistic programs."}],"related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]}}]