[{"year":"2019","alternative_title":["ISTA Thesis"],"date_published":"2019-08-24T00:00:00Z","oa":1,"date_created":"2019-08-21T15:00:57Z","abstract":[{"text":"The solving of complex tasks requires the functions of more than one brain area and their interaction. Whilst spatial navigation and memory is dependent on the hippocampus, flexible behavior relies on the medial prefrontal cortex (mPFC). To further examine the roles of the hippocampus and mPFC, we recorded their neural activity during a task that depends on both of these brain regions.\r\nWith tetrodes, we recorded the extracellular activity of dorsal hippocampal CA1 (HPC) and mPFC neurons in Long-Evans rats performing a rule-switching task on the plus-maze. The plus-maze task had a spatial component since it required navigation along one of the two start arms and at the maze center a choice between one of the two goal arms. Which goal contained a reward depended on the rule currently in place. After an uncued rule change the animal had to abandon the old strategy and switch to the new rule, testing cognitive flexibility. Investigating the coordination of activity between the HPC and mPFC allows determination during which task stages their interaction is required. Additionally, comparing neural activity patterns in these two brain regions allows delineation of the specialized functions of the HPC and mPFC in this task. We analyzed neural activity in the HPC and mPFC in terms of oscillatory interactions, rule coding and replay.\r\nWe found that theta coherence between the HPC and mPFC is increased at the center and goals of the maze, both when the rule was stable or has changed. Similar results were found for locking of HPC and mPFC neurons to HPC theta oscillations. However, no differences in HPC-mPFC theta coordination were observed between the spatially- and cue-guided rule. Phase locking of HPC and mPFC neurons to HPC gamma oscillations was not modulated by\r\nmaze position or rule type. We found that the HPC coded for the two different rules with cofiring relationships between\r\ncell pairs. However, we could not find conclusive evidence for rule coding in the mPFC. Spatially-selective firing in the mPFC generalized between the two start and two goal arms. With Bayesian positional decoding, we found that the mPFC reactivated non-local positions during awake immobility periods. Replay of these non-local positions could represent entire behavioral trajectories resembling trajectory replay of the HPC. Furthermore, mPFC\r\ntrajectory-replay at the goal positively correlated with rule-switching performance. \r\nFinally, HPC and mPFC trajectory replay occurred independently of each other. These results show that the mPFC can replay ordered patterns of activity during awake immobility, possibly underlying its role in flexible behavior. ","lang":"eng"}],"degree_awarded":"PhD","title":"The hippocampus and medial prefrontal cortex during flexible behavior","OA_place":"publisher","supervisor":[{"first_name":"Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L","last_name":"Csicsvari"}],"publisher":"Institute of Science and Technology Austria","day":"24","_id":"6825","ddc":["570"],"department":[{"_id":"JoCs"},{"_id":"GradSch"}],"date_updated":"2026-04-08T13:56:14Z","author":[{"id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","first_name":"Karola","last_name":"Käfer","full_name":"Käfer, Karola"}],"article_processing_charge":"No","type":"dissertation","oa_version":"Published Version","publication_status":"published","doi":"10.15479/AT:ISTA:6825","status":"public","publication_identifier":{"issn":["2663-337X"]},"page":"89","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"5949"}]},"file":[{"creator":"kkaefer","content_type":"application/pdf","request_a_copy":0,"file_id":"6846","access_level":"open_access","date_created":"2019-09-03T08:07:13Z","relation":"main_file","embargo":"2020-09-05","checksum":"2664420e332a33338568f4f3bfc59287","file_size":3205202,"date_updated":"2020-09-06T22:30:03Z","file_name":"Thesis_Kaefer_PDFA.pdf"},{"content_type":"application/zip","creator":"kkaefer","file_id":"6847","access_level":"closed","date_created":"2019-09-03T08:07:17Z","relation":"source_file","checksum":"9a154eab6f07aa590a3d2651dc0d926a","embargo_to":"open_access","file_size":2506835,"file_name":"Thesis_Kaefer.zip","date_updated":"2024-04-10T22:30:48Z"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"08","corr_author":"1","file_date_updated":"2024-04-10T22:30:48Z","language":[{"iso":"eng"}],"citation":{"apa":"Käfer, K. (2019). <i>The hippocampus and medial prefrontal cortex during flexible behavior</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:6825\">https://doi.org/10.15479/AT:ISTA:6825</a>","chicago":"Käfer, Karola. “The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:6825\">https://doi.org/10.15479/AT:ISTA:6825</a>.","ama":"Käfer K. The hippocampus and medial prefrontal cortex during flexible behavior. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6825\">10.15479/AT:ISTA:6825</a>","short":"K. Käfer, The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior, Institute of Science and Technology Austria, 2019.","ieee":"K. Käfer, “The hippocampus and medial prefrontal cortex during flexible behavior,” Institute of Science and Technology Austria, 2019.","ista":"Käfer K. 2019. The hippocampus and medial prefrontal cortex during flexible behavior. Institute of Science and Technology Austria.","mla":"Käfer, Karola. <i>The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6825\">10.15479/AT:ISTA:6825</a>."},"has_accepted_license":"1"},{"status":"public","publication_status":"published","doi":"10.15479/AT:ISTA:6371","type":"dissertation","oa_version":"Published Version","article_processing_charge":"No","author":[{"first_name":"Claudia","orcid":"0000-0001-7777-546X","id":"46613666-F248-11E8-B48F-1D18A9856A87","full_name":"Igler, Claudia","last_name":"Igler"}],"date_updated":"2026-04-08T13:56:27Z","department":[{"_id":"CaGu"}],"citation":{"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.","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.","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.","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>.","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>","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>","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>."},"has_accepted_license":"1","language":[{"iso":"eng"}],"corr_author":"1","project":[{"name":"Design principles underlying genetic switch architecture","_id":"251EE76E-B435-11E9-9278-68D0E5697425","grant_number":"24573"}],"file_date_updated":"2021-02-11T11:17:13Z","month":"05","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"152","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"67"},{"id":"5585","status":"public","relation":"popular_science"}]},"file":[{"content_type":"application/pdf","creator":"cigler","access_level":"open_access","date_created":"2019-05-03T11:54:52Z","file_id":"6373","file_size":12597663,"embargo":"2020-05-02","relation":"main_file","checksum":"c0085d47c58c9cbcab1b0a783480f6da","file_name":"IglerClaudia_OntheNatureofGeneRegulatoryDesign.pdf","date_updated":"2021-02-11T11:17:13Z"},{"relation":"source_file","checksum":"2eac954de1c8bbf7e6fb35ed0221ae8c","embargo_to":"open_access","file_size":34644426,"date_updated":"2020-07-14T12:47:28Z","file_name":"IglerClaudia_OntheNatureofGeneRegulatoryDesign.docx","creator":"cigler","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"6374","access_level":"closed","date_created":"2019-05-03T11:54:54Z"}],"publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","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"}],"date_created":"2019-05-03T11:55:51Z","oa":1,"date_published":"2019-05-03T00:00:00Z","year":"2019","alternative_title":["ISTA Thesis"],"ddc":["576","579"],"_id":"6371","publisher":"Institute of Science and Technology Austria","supervisor":[{"full_name":"Guet, Calin C","last_name":"Guet","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052"}],"day":"03","OA_place":"publisher","title":"On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation","keyword":["gene regulation","biophysics","transcription factor binding","bacteria"]},{"has_accepted_license":"1","citation":{"short":"K. Käfer, H. Malagon-Vina, D. Dickerson, J. O’Neill, S.V. Trossbach, C. Korth, J.L. Csicsvari, Hippocampus 29 (2019) 802–816.","ista":"Käfer K, Malagon-Vina H, Dickerson D, O’Neill J, Trossbach SV, Korth C, Csicsvari JL. 2019. Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization. Hippocampus. 29(9), 802–816.","ieee":"K. Käfer <i>et al.</i>, “Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization,” <i>Hippocampus</i>, vol. 29, no. 9. Wiley, pp. 802–816, 2019.","mla":"Käfer, Karola, et al. “Disrupted-in-Schizophrenia 1 Overexpression Disrupts Hippocampal Coding and Oscillatory Synchronization.” <i>Hippocampus</i>, vol. 29, no. 9, Wiley, 2019, pp. 802–16, doi:<a href=\"https://doi.org/10.1002/hipo.23076\">10.1002/hipo.23076</a>.","ama":"Käfer K, Malagon-Vina H, Dickerson D, et al. Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization. <i>Hippocampus</i>. 2019;29(9):802-816. doi:<a href=\"https://doi.org/10.1002/hipo.23076\">10.1002/hipo.23076</a>","apa":"Käfer, K., Malagon-Vina, H., Dickerson, D., O’Neill, J., Trossbach, S. V., Korth, C., &#38; Csicsvari, J. L. (2019). Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization. <i>Hippocampus</i>. Wiley. <a href=\"https://doi.org/10.1002/hipo.23076\">https://doi.org/10.1002/hipo.23076</a>","chicago":"Käfer, Karola, Hugo Malagon-Vina, Desiree Dickerson, Joseph O’Neill, Svenja V. Trossbach, Carsten Korth, and Jozsef L Csicsvari. “Disrupted-in-Schizophrenia 1 Overexpression Disrupts Hippocampal Coding and Oscillatory Synchronization.” <i>Hippocampus</i>. Wiley, 2019. <a href=\"https://doi.org/10.1002/hipo.23076\">https://doi.org/10.1002/hipo.23076</a>."},"language":[{"iso":"eng"}],"scopus_import":"1","project":[{"grant_number":"607616","_id":"257BBB4C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"inter-and intracellular signalling in schizophrenia"}],"file_date_updated":"2020-07-14T12:47:13Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"09","external_id":{"isi":["000480635400003"]},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6825"}]},"file":[{"date_created":"2019-02-11T10:42:51Z","access_level":"open_access","file_id":"5950","creator":"dernst","content_type":"application/pdf","file_name":"2019_Hippocampus_Kaefer.pdf","date_updated":"2020-07-14T12:47:13Z","file_size":2132893,"checksum":"5e8de271ca04aef92a5de42d6aac4404","relation":"main_file"}],"page":"802-816","isi":1,"status":"public","doi":"10.1002/hipo.23076","publication_status":"published","oa_version":"Published Version","type":"journal_article","author":[{"first_name":"Karola","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","last_name":"Käfer","full_name":"Käfer, Karola"},{"first_name":"Hugo","full_name":"Malagon-Vina, Hugo","last_name":"Malagon-Vina"},{"id":"444EB89E-F248-11E8-B48F-1D18A9856A87","first_name":"Desiree","full_name":"Dickerson, Desiree","last_name":"Dickerson"},{"last_name":"O'Neill","full_name":"O'Neill, Joseph","first_name":"Joseph"},{"first_name":"Svenja V.","full_name":"Trossbach, Svenja V.","last_name":"Trossbach"},{"first_name":"Carsten","full_name":"Korth, Carsten","last_name":"Korth"},{"full_name":"Csicsvari, Jozsef L","last_name":"Csicsvari","first_name":"Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"Yes (via OA deal)","date_updated":"2026-05-13T22:30:59Z","department":[{"_id":"JoCs"}],"ddc":["570"],"_id":"5949","day":"01","publisher":"Wiley","volume":29,"title":"Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization","article_type":"original","ec_funded":1,"publication":"Hippocampus","abstract":[{"lang":"eng","text":"Aberrant proteostasis of protein aggregation may lead to behavior disorders including chronic mental illnesses (CMI). Furthermore, the neuronal activity alterations that underlie CMI are not well understood. We recorded the local field potential and single-unit activity of the hippocampal CA1 region in vivo in rats transgenically overexpressing the Disrupted-in-Schizophrenia 1 (DISC1) gene (tgDISC1), modeling sporadic CMI. These tgDISC1 rats have previously been shown to exhibit DISC1 protein aggregation, disturbances in the dopaminergic system and attention-related deficits. Recordings were performed during exploration of familiar and novel open field environments and during sleep, allowing investigation of neuronal abnormalities in unconstrained behavior. Compared to controls, tgDISC1 place cells exhibited smaller place fields and decreased speed-modulation of their firing rates, demonstrating altered spatial coding and deficits in encoding location-independent sensory inputs. Oscillation analyses showed that tgDISC1 pyramidal neurons had higher theta phase locking strength during novelty, limiting their phase coding ability. However, their mean theta phases were more variable at the population level, reducing oscillatory network synchronization. Finally, tgDISC1 pyramidal neurons showed a lack of novelty-induced shift in their preferred theta and gamma firing phases, indicating deficits in coding of novel environments with oscillatory firing. By combining single cell and neuronal population analyses, we link DISC1 protein pathology with abnormal hippocampal neural coding and network synchrony, and thereby gain a more comprehensive understanding of CMI mechanisms."}],"date_created":"2019-02-10T22:59:18Z","intvolume":"        29","quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"oa":1,"date_published":"2019-09-01T00:00:00Z","issue":"9","year":"2019"},{"degree_awarded":"PhD","abstract":[{"lang":"eng","text":"Lymph nodes  are es s ential organs  of the immune  s ys tem where adaptive immune responses originate, and consist of various leukocyte populations and a stromal backbone. Fibroblastic reticular  cells (FRCs) are  the  main  stromal  cells and  form  a sponge-like extracellular matrix network,   called  conduits ,  which  they   thems elves   enwrap   and  contract.  Lymph,  containing  s oluble  antigens ,  arrive in  lymph  nodes  via afferent lymphatic  vessels that  connect  to  the  s ubcaps ular  s inus   and  conduit  network.  According  to  the  current  paradigm,  the  conduit  network   dis tributes   afferent  lymph  through   lymph  nodes   and  thus   provides   acces s   for  immune  cells to lymph-borne  antigens. An  elas tic  caps ule  s urrounds   the  organ  and  confines   the immune  cells and  FRC  network.   Lymph   nodes   are  completely  packed  with  lymphocytes   and  lymphocyte  numbers  directly  dictates  the size  of  the  organ.  Although  lymphocytes   cons tantly  enter  and  leave  the  lymph  node,  its   s ize  remains   remarkedly   s table  under  homeostatic conditions. It is only partly known  how the cellularity and s ize of the lymph node is regulated and  how  the  lymph  node  is able to swell in inflammation.  The role of the FRC network   in  lymph  node   s welling  and  trans fer  of  fluids   are  inves tigated in  this   thes is.  Furthermore,   we  s tudied  what  trafficking  routes   are  us ed  by  cancer  cells   in  lymph  nodes   to  form  distal metastases.We examined the role of a mechanical feedback in regulation of lymph  node swelling. Using parallel plate compression  and UV-las er  cutting  experiments   we  dis s ected  the  mechanical  force dynamics  of the whole lymph  node, and individually for FRCs  and the  caps ule. Physical forces   generated  by  packed  lymphocytes   directly  affect  the  tens ion  on  the  FRC  network  and  capsule,  which  increases  its  resistance  to   swelling.  This  implies  a  feedback  mechanism  between   tis s ue   pres s ure   and   ability   of   lymphocytes    to   enter   the   organ.   Following   inflammation,  the  lymph  node  swells ∼10 fold in two weeks . Yet, what  is  the role  for tens ion on  the  FRC  network   and  caps ule,  and  how  are  lymphocytes   able  to  enter  in  conditions  that resist swelling remain open ques tions . We s how that tens ion on the FRC network is  important to  limit  the  swelling  rate  of  the  organ  so  that  the  FRC  network  can  grow  in  a  coordinated  fashion. This is illustrated by interfering with FRC contractility, which leads to faster swelling rates  and a dis organized FRC network  in the inflamed lymph  node. Growth  of the FRC network  in  turn  is   expected  to  releas e  tens ion  on  thes e  s tructures   and  lowers   the  res is tance  to  swelling, thereby allowing more lymphocytes to enter the organ and drive more swelling. Halt of  swelling coincides   with  a  thickening  of  the  caps ule,  which  forms   a  thick  res is tant  band  around  the organ and lowers  tens ion on the FRC network  to form a new force equilibrium.The  FRC  and  conduit   network   are  further   believed  to  be  a  privileged  s ite  of  s oluble  information  within  the  lymph  node,  although  many  details   remain  uns olved.  We  s how  by  3D  ultra-recons truction   that  FRCs   and  antigen  pres enting  cells   cover  the  s urface  of  conduit  s ys tem for more  than 99% and we dis cus s  the implications  for s oluble information  exchangeat the conduit level.Finally, there  is an ongoing debate in the cancer field whether and how cancer cells  in lymph nodes   s eed  dis tal  metas tas es .  We  s how  that  cancer  cells   infus ed  into  the  lymph  node  can  utilize trafficking routes of immune  cells and  rapidly  migrate  to  blood  vessels. Once  in  the  blood circulation,  these cells are able to form  metastases in distal tissues."}],"date_created":"2019-10-14T16:54:52Z","oa":1,"date_published":"2019-10-09T00:00:00Z","year":"2019","alternative_title":["ISTA Thesis"],"ddc":["570"],"_id":"6947","supervisor":[{"first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","full_name":"Sixt, Michael K"}],"publisher":"Institute of Science and Technology Austria","day":"09","OA_place":"publisher","title":"Lymph node mechanics: Deciphering the interplay between stroma contractility, morphology and lymphocyte trafficking","status":"public","publication_status":"published","doi":"10.15479/AT:ISTA:6947","type":"dissertation","oa_version":"Published Version","article_processing_charge":"No","author":[{"first_name":"Frank P","orcid":"0000-0003-3470-6119","id":"3A8E7F24-F248-11E8-B48F-1D18A9856A87","full_name":"Assen, Frank P","last_name":"Assen"}],"date_updated":"2026-04-08T14:01:50Z","department":[{"_id":"MiSi"}],"citation":{"mla":"Assen, Frank P. <i>Lymph Node Mechanics: Deciphering the Interplay between Stroma Contractility, Morphology and Lymphocyte Trafficking</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6947\">10.15479/AT:ISTA:6947</a>.","short":"F.P. Assen, Lymph Node Mechanics: Deciphering the Interplay between Stroma Contractility, Morphology and Lymphocyte Trafficking, Institute of Science and Technology Austria, 2019.","ista":"Assen FP. 2019. Lymph node mechanics: Deciphering the interplay between stroma contractility, morphology and lymphocyte trafficking. Institute of Science and Technology Austria.","ieee":"F. P. Assen, “Lymph node mechanics: Deciphering the interplay between stroma contractility, morphology and lymphocyte trafficking,” Institute of Science and Technology Austria, 2019.","ama":"Assen FP. Lymph node mechanics: Deciphering the interplay between stroma contractility, morphology and lymphocyte trafficking. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6947\">10.15479/AT:ISTA:6947</a>","chicago":"Assen, Frank P. “Lymph Node Mechanics: Deciphering the Interplay between Stroma Contractility, Morphology and Lymphocyte Trafficking.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:6947\">https://doi.org/10.15479/AT:ISTA:6947</a>.","apa":"Assen, F. P. (2019). <i>Lymph node mechanics: Deciphering the interplay between stroma contractility, morphology and lymphocyte trafficking</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:6947\">https://doi.org/10.15479/AT:ISTA:6947</a>"},"has_accepted_license":"1","language":[{"iso":"eng"}],"corr_author":"1","file_date_updated":"2020-11-07T23:30:03Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"10","related_material":{"record":[{"id":"402","status":"public","relation":"part_of_dissertation"},{"id":"664","relation":"part_of_dissertation","status":"public"}]},"file":[{"relation":"source_file","checksum":"53a739752a500f84d0f8ec953cbbd0b6","embargo_to":"open_access","file_size":214172667,"file_name":"PhDthesis_FrankAssen_revised2.docx","date_updated":"2020-11-07T23:30:03Z","creator":"fassen","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"6990","access_level":"closed","date_created":"2019-11-06T12:30:02Z"},{"content_type":"application/pdf","creator":"fassen","file_id":"6991","access_level":"open_access","date_created":"2019-11-06T12:30:57Z","embargo":"2020-11-06","relation":"main_file","checksum":"8c156b65d9347bb599623a4b09f15d15","file_size":83637532,"date_updated":"2020-11-07T23:30:03Z","file_name":"PhDthesis_FrankAssen_revised2.pdf"}],"page":"142","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"publication_identifier":{"issn":["2663-337X"]}},{"isi":1,"status":"public","publication_status":"published","doi":"10.7554/elife.41801","type":"journal_article","oa_version":"Published Version","author":[{"full_name":"Valosková, Katarina","last_name":"Valosková","orcid":"0000-0002-7926-0221","id":"46F146FC-F248-11E8-B48F-1D18A9856A87","first_name":"Katarina"},{"first_name":"Julia","id":"3CCBB46E-F248-11E8-B48F-1D18A9856A87","full_name":"Biebl, Julia","last_name":"Biebl"},{"first_name":"Marko","id":"3047D808-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9588-1389","last_name":"Roblek","full_name":"Roblek, Marko"},{"first_name":"Shamsi","orcid":"0000-0001-6981-6938","id":"49D32318-F248-11E8-B48F-1D18A9856A87","full_name":"Emtenani, Shamsi","last_name":"Emtenani"},{"orcid":"0000-0002-1819-198X","id":"3BCEDBE0-F248-11E8-B48F-1D18A9856A87","first_name":"Attila","last_name":"György","full_name":"György, Attila"},{"id":"495A3C32-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2427-6856","first_name":"Michaela","last_name":"Misova","full_name":"Misova, Michaela"},{"first_name":"Aparna","id":"2F064CFE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7190-0776","full_name":"Ratheesh, Aparna","last_name":"Ratheesh"},{"last_name":"Dos Reis Rodrigues","full_name":"Dos Reis Rodrigues, Patricia","first_name":"Patricia","id":"26E95904-5160-11E9-9C0B-C5B0DC97E90F","orcid":"0000-0003-1681-508X"},{"full_name":"Shkarina, Katerina","last_name":"Shkarina","first_name":"Katerina"},{"last_name":"Larsen","full_name":"Larsen, Ida Signe Bohse","first_name":"Ida Signe Bohse"},{"first_name":"Sergey Y","last_name":"Vakhrushev","full_name":"Vakhrushev, Sergey Y"},{"last_name":"Clausen","full_name":"Clausen, Henrik","first_name":"Henrik"},{"first_name":"Daria E","orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","last_name":"Siekhaus","full_name":"Siekhaus, Daria E"}],"article_processing_charge":"No","date_updated":"2026-05-13T22:31:01Z","department":[{"_id":"DaSi"}],"citation":{"chicago":"Valosková, Katarina, Julia Bicher, Marko Roblek, Shamsi Emtenani, Attila György, Michaela Misova, Aparna Ratheesh, et al. “A Conserved Major Facilitator Superfamily Member Orchestrates a Subset of O-Glycosylation to Aid Macrophage Tissue Invasion.” <i>ELife</i>. eLife Sciences Publications, 2019. <a href=\"https://doi.org/10.7554/elife.41801\">https://doi.org/10.7554/elife.41801</a>.","apa":"Valosková, K., Bicher, J., Roblek, M., Emtenani, S., György, A., Misova, M., … Siekhaus, D. E. (2019). A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.41801\">https://doi.org/10.7554/elife.41801</a>","ama":"Valosková K, Bicher J, Roblek M, et al. A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion. <i>eLife</i>. 2019;8. doi:<a href=\"https://doi.org/10.7554/elife.41801\">10.7554/elife.41801</a>","mla":"Valosková, Katarina, et al. “A Conserved Major Facilitator Superfamily Member Orchestrates a Subset of O-Glycosylation to Aid Macrophage Tissue Invasion.” <i>ELife</i>, vol. 8, e41801, eLife Sciences Publications, 2019, doi:<a href=\"https://doi.org/10.7554/elife.41801\">10.7554/elife.41801</a>.","ieee":"K. Valosková <i>et al.</i>, “A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion,” <i>eLife</i>, vol. 8. eLife Sciences Publications, 2019.","short":"K. Valosková, J. Bicher, M. Roblek, S. Emtenani, A. György, M. Misova, A. Ratheesh, P. Dos Reis Rodrigues, K. Shkarina, I.S.B. Larsen, S.Y. Vakhrushev, H. Clausen, D.E. Siekhaus, ELife 8 (2019).","ista":"Valosková K, Bicher J, Roblek M, Emtenani S, György A, Misova M, Ratheesh A, Dos Reis Rodrigues P, Shkarina K, Larsen ISB, Vakhrushev SY, Clausen H, Siekhaus DE. 2019. A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion. eLife. 8, e41801."},"has_accepted_license":"1","article_number":"e41801","language":[{"iso":"eng"}],"scopus_import":"1","project":[{"grant_number":"24283","name":"Examination of the role of a MFS transporter in the migration of Drosophila immune cells","_id":"253CDE40-B435-11E9-9278-68D0E5697425"},{"grant_number":"P29638","call_identifier":"FWF","_id":"253B6E48-B435-11E9-9278-68D0E5697425","name":"The role of Drosophila TNF alpha in immune cell invasion"},{"grant_number":"334077","call_identifier":"FP7","_id":"2536F660-B435-11E9-9278-68D0E5697425","name":"Investigating the role of transporters in invasive migration through junctions"},{"grant_number":"329540","call_identifier":"FP7","_id":"25388084-B435-11E9-9278-68D0E5697425","name":"Breaking barriers: Investigating the junctional and mechanobiological changes underlying the ability of Drosophila immune cells to invade an epithelium"},{"grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2020-07-14T12:47:23Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"03","related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/new-gene-potentially-involved-in-metastasis-identified/","description":"News on IST Homepage"}],"record":[{"id":"6530","relation":"dissertation_contains"},{"id":"8983","status":"public","relation":"dissertation_contains"},{"status":"public","relation":"dissertation_contains","id":"6546"}]},"file":[{"relation":"main_file","checksum":"cc0d1a512559d52e7e7cb0e9b9854b40","file_size":4496017,"date_updated":"2020-07-14T12:47:23Z","file_name":"2019_eLife_Valoskova.pdf","creator":"dernst","content_type":"application/pdf","file_id":"6188","access_level":"open_access","date_created":"2019-03-28T14:00:41Z"}],"external_id":{"isi":["000462530200001"]},"acknowledged_ssus":[{"_id":"LifeSc"}],"publication_identifier":{"issn":["2050-084X"]},"intvolume":"         8","date_created":"2019-03-28T13:37:45Z","abstract":[{"text":"Aberrant display of the truncated core1 O-glycan T-antigen is a common feature of human cancer cells that correlates with metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages is involved in their developmentally programmed tissue invasion. Higher macrophage T-antigen levels require an atypical major facilitator superfamily (MFS) member that we named Minerva which enables macrophage dissemination and invasion. We characterize for the first time the T and Tn glycoform O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva increases the presence of T-antigen on proteins in pathways previously linked to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration and T-antigen glycosylation defects. We thus identify a key conserved regulator that orchestrates O-glycosylation on a protein subset to activate a program governing migration steps important for both development and cancer metastasis.","lang":"eng"}],"quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"oa":1,"date_published":"2019-03-26T00:00:00Z","year":"2019","ddc":["570"],"_id":"6187","publisher":"eLife Sciences Publications","day":"26","volume":8,"ec_funded":1,"title":"A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion","publication":"eLife"},{"status":"public","publication_status":"published","doi":"10.15479/AT:ISTA:6546","type":"dissertation","oa_version":"Published Version","author":[{"last_name":"Valosková","full_name":"Valosková, Katarina","id":"46F146FC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7926-0221","first_name":"Katarina"}],"article_processing_charge":"No","date_updated":"2026-04-08T13:58:36Z","department":[{"_id":"DaSi"}],"citation":{"short":"K. Valosková, The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration, Institute of Science and Technology Austria, 2019.","ista":"Valosková K. 2019. The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration. Institute of Science and Technology Austria.","ieee":"K. Valosková, “The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration,” Institute of Science and Technology Austria, 2019.","mla":"Valosková, Katarina. <i>The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6546\">10.15479/AT:ISTA:6546</a>.","apa":"Valosková, K. (2019). <i>The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:6546\">https://doi.org/10.15479/AT:ISTA:6546</a>","chicago":"Valosková, Katarina. “The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:6546\">https://doi.org/10.15479/AT:ISTA:6546</a>.","ama":"Valosková K. The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6546\">10.15479/AT:ISTA:6546</a>"},"has_accepted_license":"1","language":[{"iso":"eng"}],"corr_author":"1","project":[{"grant_number":"24283","name":"Examination of the role of a MFS transporter in the migration of Drosophila immune cells","_id":"253CDE40-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2021-02-11T11:17:14Z","month":"06","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"141","file":[{"file_name":"Katarina Valoskova_PhD thesis_final version.docx","date_updated":"2020-07-14T12:47:33Z","relation":"source_file","embargo_to":"open_access","checksum":"68949c2d96210b45b981a23e9c9cd93c","file_size":14110626,"file_id":"6549","access_level":"closed","date_created":"2019-06-07T13:00:04Z","creator":"khribikova","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document"},{"file_size":10054156,"embargo":"2020-06-07","relation":"main_file","checksum":"555329cd76e196c96f5278c480ee2e6e","date_updated":"2021-02-11T11:17:14Z","file_name":"Katarina Valoskova_PhD thesis_final version.pdf","creator":"khribikova","content_type":"application/pdf","access_level":"open_access","date_created":"2019-06-07T13:00:08Z","file_id":"6550"}],"related_material":{"record":[{"id":"544","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"6187"}]},"acknowledged_ssus":[{"_id":"Bio"}],"publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","abstract":[{"lang":"eng","text":"Invasive migration plays a crucial role not only during development and homeostasis but also in pathological states, such as tumor metastasis. Drosophila macrophage migration into the extended germband is an interesting system to study invasive migration. It carries similarities to immune cell transmigration and cancer cell invasion, therefore studying this process could also bring new understanding of invasion in higher organisms. In our work, we uncover a highly conserved member of the major facilitator family that plays a role in tissue invasion through regulation of glycosylation on a subgroup of proteins and/or by aiding the precise timing of DN-Cadherin downregulation. \r\n\r\nAberrant display of the truncated core1 O-glycan T-antigen is a common feature of human cancer cells that correlates with metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages is involved in their developmentally programmed tissue invasion. Higher macrophage T-antigen levels require an atypical major facilitator superfamily (MFS) member that we named Minerva which enables macrophage dissemination and invasion. We characterize for the first time the T and Tn glycoform O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva increases the presence of T-antigen on proteins in pathways previously linked to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration and T-antigen glycosylation defects. We thus identify \r\na key conserved regulator that orchestrates O-glycosylation on a protein subset to activate \r\na program governing migration steps important for both development and cancer metastasis. \r\n"}],"date_created":"2019-06-07T12:49:19Z","oa":1,"date_published":"2019-06-07T00:00:00Z","year":"2019","alternative_title":["ISTA Thesis"],"ddc":["570"],"_id":"6546","supervisor":[{"full_name":"Siekhaus, Daria E","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353","first_name":"Daria E"}],"publisher":"Institute of Science and Technology Austria","day":"07","OA_place":"publisher","title":"The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration"},{"ddc":["570"],"supervisor":[{"last_name":"Jonas","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","first_name":"Peter M"}],"publisher":"Institute of Science and Technology Austria","day":"30","_id":"6363","title":"Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits","OA_place":"publisher","degree_awarded":"PhD","date_created":"2019-04-30T11:56:10Z","abstract":[{"lang":"eng","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"}],"oa":1,"year":"2019","alternative_title":["ISTA Thesis"],"date_published":"2019-04-30T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ista":"Espinoza Martinez C. 2019. Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits. Institute of Science and Technology Austria.","ieee":"C. Espinoza Martinez, “Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits,” Institute of Science and Technology Austria, 2019.","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>.","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>","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>","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>."},"has_accepted_license":"1","corr_author":"1","file_date_updated":"2021-02-11T11:17:15Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"04","publication_identifier":{"isbn":["978-3-99078-000-8"],"issn":["2663-337X"]},"file":[{"file_size":13966891,"relation":"main_file","embargo":"2020-05-09","checksum":"77c6c05cfe8b58c8abcf1b854375d084","date_updated":"2021-02-11T11:17:15Z","file_name":"Espinozathesis_all2.pdf","content_type":"application/pdf","creator":"cespinoza","access_level":"open_access","date_created":"2019-05-07T16:00:39Z","file_id":"6389"},{"date_updated":"2020-07-14T12:47:28Z","file_name":"Espinoza_Thesis.docx","file_size":11159900,"embargo_to":"open_access","checksum":"f6aa819f127691a2b0fc21c76eb09746","relation":"source_file","date_created":"2019-05-07T16:00:48Z","access_level":"closed","file_id":"6390","creator":"cespinoza","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"21"}]},"page":"140","status":"public","type":"dissertation","oa_version":"Published Version","publication_status":"published","doi":"10.15479/AT:ISTA:6363","article_processing_charge":"No","author":[{"orcid":"0000-0003-4710-2082","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia ","last_name":"Espinoza Martinez","full_name":"Espinoza Martinez, Claudia "}],"department":[{"_id":"PeJo"}],"date_updated":"2026-04-08T13:57:19Z"},{"OA_place":"publisher","title":"Design and characterization of methods and biological components to realize synthetic neurotransmission","ddc":["571","573"],"_id":"7132","supervisor":[{"first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","last_name":"Janovjak","full_name":"Janovjak, Harald L"}],"publisher":"Institute of Science and Technology Austria","day":"27","oa":1,"date_published":"2019-06-27T00:00:00Z","year":"2019","alternative_title":["ISTA Thesis"],"degree_awarded":"PhD","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."}],"date_created":"2019-11-27T09:07:14Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"06","page":"95","file":[{"relation":"source_file","checksum":"34d0fe0f6e0af97b5937205a3e350423","file_size":5054633,"file_name":"McKenzie PhD Thesis August 2018 - Corrected Final.docx","date_updated":"2020-07-14T12:47:50Z","creator":"dernst","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"7133","access_level":"closed","date_created":"2019-11-27T09:06:10Z"},{"file_size":3231837,"relation":"main_file","checksum":"140dfb5e3df7edca34f4b6fcc55d876f","date_updated":"2020-07-14T12:47:50Z","file_name":"McKenzie PhD Thesis August 2018 - Corrected Final.pdf","content_type":"application/pdf","creator":"dernst","access_level":"open_access","date_created":"2019-11-27T09:06:10Z","file_id":"7134"}],"related_material":{"record":[{"id":"6266","status":"public","relation":"old_edition"}]},"publication_identifier":{"issn":["2663-337X"]},"citation":{"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>.","ieee":"C. Mckenzie, “Design and characterization of methods and biological components to realize synthetic neurotransmission,” Institute of Science and Technology Austria, 2019.","ista":"Mckenzie C. 2019. Design and characterization of methods and biological components to realize synthetic neurotransmission. Institute of Science and Technology Austria.","short":"C. Mckenzie, Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission, Institute of Science and Technology Austria, 2019.","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>.","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>"},"has_accepted_license":"1","language":[{"iso":"eng"}],"corr_author":"1","file_date_updated":"2020-07-14T12:47:50Z","article_processing_charge":"No","author":[{"id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87","first_name":"Catherine","last_name":"Mckenzie","full_name":"Mckenzie, Catherine"}],"date_updated":"2026-05-13T22:31:06Z","department":[{"_id":"HaJa"}],"status":"public","publication_status":"published","doi":"10.15479/at:ista:7132","type":"dissertation","oa_version":"Published Version"},{"pmid":1,"_id":"6189","day":"22","publisher":"American Physical Society","arxiv":1,"volume":122,"title":"Transition to turbulence in particle laden flows","publication":"Physical Review Letters","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.06358"}],"intvolume":"       122","date_created":"2019-03-31T21:59:12Z","abstract":[{"lang":"eng","text":"Suspended particles can alter the properties of fluids and in particular also affect the transition fromlaminar to turbulent flow. An earlier study [Mataset al.,Phys. Rev. Lett.90, 014501 (2003)] reported howthe subcritical (i.e., hysteretic) transition to turbulent puffs is affected by the addition of particles. Here weshow that in addition to this known transition, with increasing concentration a supercritical (i.e.,continuous) transition to a globally fluctuating state is found. At the same time the Newtonian-typetransition to puffs is delayed to larger Reynolds numbers. At even higher concentration only the globallyfluctuating state is found. The dynamics of particle laden flows are hence determined by two competinginstabilities that give rise to three flow regimes: Newtonian-type turbulence at low, a particle inducedglobally fluctuating state at high, and a coexistence state at intermediate concentrations."}],"quality_controlled":"1","oa":1,"date_published":"2019-03-22T00:00:00Z","issue":"11","year":"2019","article_number":"114502","citation":{"ama":"Agrawal N, Choueiri GH, Hof B. Transition to turbulence in particle laden flows. <i>Physical Review Letters</i>. 2019;122(11). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.122.114502\">10.1103/PhysRevLett.122.114502</a>","chicago":"Agrawal, Nishchal, George H Choueiri, and Björn Hof. “Transition to Turbulence in Particle Laden Flows.” <i>Physical Review Letters</i>. American Physical Society, 2019. <a href=\"https://doi.org/10.1103/PhysRevLett.122.114502\">https://doi.org/10.1103/PhysRevLett.122.114502</a>.","apa":"Agrawal, N., Choueiri, G. H., &#38; Hof, B. (2019). Transition to turbulence in particle laden flows. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.122.114502\">https://doi.org/10.1103/PhysRevLett.122.114502</a>","mla":"Agrawal, Nishchal, et al. “Transition to Turbulence in Particle Laden Flows.” <i>Physical Review Letters</i>, vol. 122, no. 11, 114502, American Physical Society, 2019, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.122.114502\">10.1103/PhysRevLett.122.114502</a>.","ieee":"N. Agrawal, G. H. Choueiri, and B. Hof, “Transition to turbulence in particle laden flows,” <i>Physical Review Letters</i>, vol. 122, no. 11. American Physical Society, 2019.","ista":"Agrawal N, Choueiri GH, Hof B. 2019. Transition to turbulence in particle laden flows. Physical Review Letters. 122(11), 114502.","short":"N. Agrawal, G.H. Choueiri, B. Hof, Physical Review Letters 122 (2019)."},"language":[{"iso":"eng"}],"scopus_import":"1","month":"03","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","external_id":{"arxiv":["1809.06358"],"pmid":["30951357"],"isi":["000461922000006"]},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"9728"}]},"publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"isi":1,"status":"public","doi":"10.1103/PhysRevLett.122.114502","publication_status":"published","oa_version":"Preprint","type":"journal_article","article_processing_charge":"No","author":[{"full_name":"Agrawal, Nishchal","last_name":"Agrawal","first_name":"Nishchal","id":"469E6004-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Choueiri, George H","last_name":"Choueiri","id":"448BD5BC-F248-11E8-B48F-1D18A9856A87","first_name":"George H"},{"first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","last_name":"Hof","full_name":"Hof, Björn"}],"date_updated":"2026-05-13T22:31:10Z","department":[{"_id":"BjHo"}]},{"year":"2019","issue":"5","date_published":"2019-09-04T00:00:00Z","oa":1,"quality_controlled":"1","date_created":"2019-08-25T22:00:50Z","intvolume":"       103","main_file_link":[{"url":"https://doi.org/10.1016/j.neuron.2019.08.021","open_access":"1"}],"publication":"Neuron","title":"Memo1 tiles the radial glial cell grid","article_type":"letter_note","volume":103,"publisher":"Elsevier","day":"04","_id":"6830","pmid":1,"department":[{"_id":"SiHi"}],"date_updated":"2026-05-13T22:31:12Z","article_processing_charge":"No","author":[{"full_name":"Contreras, Ximena","last_name":"Contreras","id":"475990FE-F248-11E8-B48F-1D18A9856A87","first_name":"Ximena"},{"first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon"}],"type":"journal_article","oa_version":"Published Version","publication_status":"published","doi":"10.1016/j.neuron.2019.08.021","status":"public","isi":1,"publication_identifier":{"eissn":["1097-4199"],"issn":["0896-6273"]},"related_material":{"record":[{"id":"7902","relation":"part_of_dissertation","status":"public"}]},"page":"750-752","external_id":{"pmid":["31487522"],"isi":["000484400200002"]},"month":"09","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"ama":"Contreras X, Hippenmeyer S. Memo1 tiles the radial glial cell grid. <i>Neuron</i>. 2019;103(5):750-752. doi:<a href=\"https://doi.org/10.1016/j.neuron.2019.08.021\">10.1016/j.neuron.2019.08.021</a>","chicago":"Contreras, Ximena, and Simon Hippenmeyer. “Memo1 Tiles the Radial Glial Cell Grid.” <i>Neuron</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.neuron.2019.08.021\">https://doi.org/10.1016/j.neuron.2019.08.021</a>.","apa":"Contreras, X., &#38; Hippenmeyer, S. (2019). Memo1 tiles the radial glial cell grid. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2019.08.021\">https://doi.org/10.1016/j.neuron.2019.08.021</a>","mla":"Contreras, Ximena, and Simon Hippenmeyer. “Memo1 Tiles the Radial Glial Cell Grid.” <i>Neuron</i>, vol. 103, no. 5, Elsevier, 2019, pp. 750–52, doi:<a href=\"https://doi.org/10.1016/j.neuron.2019.08.021\">10.1016/j.neuron.2019.08.021</a>.","ieee":"X. Contreras and S. Hippenmeyer, “Memo1 tiles the radial glial cell grid,” <i>Neuron</i>, vol. 103, no. 5. Elsevier, pp. 750–752, 2019.","ista":"Contreras X, Hippenmeyer S. 2019. Memo1 tiles the radial glial cell grid. Neuron. 103(5), 750–752.","short":"X. Contreras, S. Hippenmeyer, Neuron 103 (2019) 750–752."}},{"tmp":{"short":"CC BY-NC (4.0)","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","image":"/images/cc_by_nc.png"},"oa":1,"date_published":"2019-10-01T00:00:00Z","year":"2019","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"}],"intvolume":"         3","date_created":"2019-08-09T09:54:20Z","quality_controlled":"1","volume":3,"title":"Modular verification for almost-sure termination of probabilistic programs","ec_funded":1,"publication":"Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications ","ddc":["000"],"_id":"6780","day":"01","publisher":"ACM","arxiv":1,"article_processing_charge":"No","author":[{"first_name":"Mingzhang","last_name":"Huang","full_name":"Huang, Mingzhang"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady"}],"date_updated":"2026-05-13T22:31:16Z","department":[{"_id":"KrCh"}],"status":"public","doi":"10.1145/3360555","publication_status":"published","oa_version":"Published Version","type":"conference","conference":{"end_date":"2019-10-25","name":"OOPSLA: Object-oriented Programming, Systems, Languages and Applications","start_date":"2019-10-23","location":"Athens, Greece"},"month":"10","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"arxiv":["1901.06087"]},"file":[{"file_size":1024643,"checksum":"3482d8ace6fb4991eb7810e3b70f1b9f","relation":"main_file","file_name":"oopsla-2019.pdf","date_updated":"2020-07-14T12:47:40Z","creator":"akafshda","content_type":"application/pdf","date_created":"2019-08-12T15:40:57Z","access_level":"open_access","file_id":"6807"},{"file_size":538579,"relation":"main_file","checksum":"4e5a6fb2b59a75222a4e8335a5a60eac","date_updated":"2020-07-14T12:47:40Z","file_name":"2019_ACM_Huang.pdf","content_type":"application/pdf","creator":"dernst","access_level":"open_access","date_created":"2020-05-12T15:15:14Z","file_id":"7821"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"has_accepted_license":"1","article_number":"129","citation":{"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>","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>.","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>","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.","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>."},"language":[{"iso":"eng"}],"scopus_import":"1","file_date_updated":"2020-07-14T12:47:40Z","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","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"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/"},{"publication":"Proceedings of the 34th ACM Symposium on Applied Computing","title":"The treewidth of smart contracts","volume":"Part F147772","publisher":"ACM","day":"01","_id":"6490","ddc":["000"],"year":"2019","date_published":"2019-04-01T00:00:00Z","oa":1,"quality_controlled":"1","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"}],"date_created":"2019-05-26T21:59:15Z","publication_identifier":{"isbn":["9781450359337"]},"file":[{"access_level":"open_access","date_created":"2020-05-14T09:50:11Z","file_id":"7827","creator":"dernst","content_type":"application/pdf","file_name":"2019_ACM_Chatterjee.pdf","date_updated":"2020-07-14T12:47:32Z","file_size":6937138,"relation":"main_file","checksum":"dddc20f6d9881f23b8755eb720ec9d6f"}],"page":"400-408","related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"external_id":{"isi":["000474685800052"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","conference":{"name":"SAC: Symposium on Applied Computing","start_date":"2019-04-08","location":"Limassol, Cyprus","end_date":"2019-04-12"},"corr_author":"1","file_date_updated":"2020-07-14T12:47:32Z","scopus_import":"1","language":[{"iso":"eng"}],"pubrep_id":"1070","citation":{"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>","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.","short":"K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 400–408.","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.","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>."},"has_accepted_license":"1","department":[{"_id":"KrCh"}],"date_updated":"2026-05-13T22:31:16Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar"},{"last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar","first_name":"Ehsan Kafshdar"}],"article_processing_charge":"No","type":"conference","oa_version":"Submitted Version","publication_status":"published","doi":"10.1145/3297280.3297322","status":"public","isi":1},{"has_accepted_license":"1","citation":{"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>","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>","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>.","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.","short":"K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381.","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.","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>."},"pubrep_id":"1069","language":[{"iso":"eng"}],"scopus_import":"1","file_date_updated":"2020-07-14T12:47:29Z","project":[{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"conference":{"end_date":"2019-04-12","start_date":"2019-04-08","location":"Limassol, Cyprus","name":"ACM Symposium on Applied Computing"},"month":"04","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000474685800049"]},"page":"374-381","file":[{"date_updated":"2020-07-14T12:47:29Z","file_name":"2019_ACM_Chatterjee.pdf","checksum":"fbfbcd5a0c7a743862bfc3045539a614","relation":"main_file","file_size":1023934,"file_id":"6379","date_created":"2019-05-06T12:09:27Z","access_level":"open_access","creator":"dernst","content_type":"application/pdf"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"publication_identifier":{"isbn":["9781450359337"]},"isi":1,"status":"public","doi":"10.1145/3297280.3297319","publication_status":"published","oa_version":"Submitted Version","type":"conference","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"},{"last_name":"Pourdamghani","full_name":"Pourdamghani, Arash","first_name":"Arash"}],"article_processing_charge":"No","date_updated":"2026-05-13T22:31:16Z","department":[{"_id":"KrCh"}],"ddc":["004"],"_id":"6378","day":"01","publisher":"ACM","volume":"Part F147772","title":"Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving","ec_funded":1,"publication":"Proceedings of the 34th ACM Symposium on Applied Computing","date_created":"2019-05-06T12:11:36Z","abstract":[{"lang":"eng","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."}],"quality_controlled":"1","oa":1,"date_published":"2019-04-01T00:00:00Z","year":"2019"},{"ec_funded":1,"title":"Cost analysis of nondeterministic probabilistic programs","publication":"PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","keyword":["Program Cost Analysis","Program Termination","Probabilistic Programs","Martingales"],"ddc":["000"],"_id":"6175","publisher":"Association for Computing Machinery","arxiv":1,"day":"08","oa":1,"date_published":"2019-06-08T00:00:00Z","year":"2019","abstract":[{"lang":"eng","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."}],"date_created":"2019-03-25T10:13:25Z","quality_controlled":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"06","conference":{"end_date":"2019-06-26","name":"PLDI: Conference on Programming Language Design and Implementation","location":"Phoenix, AZ, United States","start_date":"2019-06-22"},"file":[{"creator":"akafshda","content_type":"application/pdf","file_id":"6176","date_created":"2019-03-25T10:11:22Z","access_level":"open_access","checksum":"703a5e9b8c8587f2a44085ffd9a4db64","relation":"main_file","file_size":4051066,"date_updated":"2020-07-14T12:47:20Z","file_name":"paper.pdf"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5457"},{"relation":"dissertation_contains","status":"public","id":"8934"}]},"page":"204-220","external_id":{"isi":["000523190300014"],"arxiv":["1902.04659"]},"citation":{"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>.","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.","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.","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.","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>","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>.","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>"},"has_accepted_license":"1","language":[{"iso":"eng"}],"scopus_import":"1","file_date_updated":"2020-07-14T12:47:20Z","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","author":[{"last_name":"Wang","full_name":"Wang, Peixin","first_name":"Peixin"},{"first_name":"Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei","last_name":"Fu"},{"full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Xudong","full_name":"Qin, Xudong","last_name":"Qin"},{"first_name":"Wenjun","last_name":"Shi","full_name":"Shi, Wenjun"}],"date_updated":"2026-05-13T22:31:16Z","department":[{"_id":"KrCh"}],"isi":1,"status":"public","publication_status":"published","doi":"10.1145/3314221.3314581","type":"conference","oa_version":"Submitted Version"},{"ec_funded":1,"title":"Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth","article_type":"original","volume":41,"publication":"ACM Transactions on Programming Languages and Systems","ddc":["000"],"publisher":"ACM","day":"01","_id":"7158","oa":1,"year":"2019","issue":"4","date_published":"2019-11-01T00:00:00Z","quality_controlled":"1","intvolume":"        41","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"}],"date_created":"2019-12-09T08:33:33Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"11","publication_identifier":{"issn":["0164-0925"]},"related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"file":[{"date_updated":"2020-10-08T12:58:10Z","file_name":"2019_ACMTransactions_Chatterjee.pdf","relation":"main_file","checksum":"291cc86a07bd010d4815e177dac57b70","file_size":667357,"file_id":"8632","access_level":"open_access","success":1,"date_created":"2020-10-08T12:58:10Z","creator":"dernst","content_type":"application/pdf"}],"external_id":{"isi":["000564108400004"]},"language":[{"iso":"eng"}],"citation":{"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.","short":"K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019).","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.","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>.","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>","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>","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>."},"article_number":"23","has_accepted_license":"1","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2020-10-08T12:58:10Z","scopus_import":"1","article_processing_charge":"No","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar"},{"first_name":"Prateesh","full_name":"Goyal, Prateesh","last_name":"Goyal"},{"first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","first_name":"Andreas"}],"department":[{"_id":"KrCh"}],"date_updated":"2026-05-13T22:31:16Z","status":"public","isi":1,"type":"journal_article","oa_version":"Submitted Version","publication_status":"published","doi":"10.1145/3363525"},{"project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","language":[{"iso":"eng"}],"article_number":"20","citation":{"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>","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>.","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>","short":"K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages and Systems 41 (2019).","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.","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.","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>."},"external_id":{"arxiv":["1705.00317"],"isi":["000564108400001"]},"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"639"},{"id":"8934","status":"public","relation":"dissertation_contains"}]},"month":"10","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","type":"journal_article","doi":"10.1145/3339984","publication_status":"published","status":"public","isi":1,"department":[{"_id":"KrCh"}],"date_updated":"2026-05-13T22:31:16Z","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","day":"01","arxiv":1,"publisher":"ACM","_id":"7014","publication":"ACM Transactions on Programming Languages and Systems","article_type":"original","title":"Non-polynomial worst-case analysis of recursive programs","ec_funded":1,"volume":41,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.00317"}],"abstract":[{"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.","lang":"eng"}],"intvolume":"        41","date_created":"2019-11-13T08:33:43Z","issue":"4","year":"2019","date_published":"2019-10-01T00:00:00Z","oa":1},{"day":"01","publisher":"ACM","_id":"6380","ddc":["004"],"publication":"Proceedings of the ACM on Programming Languages","article_type":"original","title":"Efficient parameterized algorithms for data packing","ec_funded":1,"volume":3,"OA_place":"publisher","quality_controlled":"1","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"}],"intvolume":"         3","date_created":"2019-05-06T12:18:17Z","issue":"POPL","year":"2019","date_published":"2019-01-01T00:00:00Z","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"file_date_updated":"2020-07-14T12:47:29Z","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"scopus_import":"1","language":[{"iso":"eng"}],"pubrep_id":"1056","has_accepted_license":"1","article_number":"53","citation":{"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>.","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>","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>.","short":"K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 3 (2019).","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.","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."},"publication_identifier":{"issn":["2475-1421"]},"OA_type":"hybrid","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.","file":[{"date_updated":"2020-07-14T12:47:29Z","file_name":"2019_ACM_POPL_Chatterjee.pdf","file_size":1294962,"checksum":"c157752f96877b36685ad7063ada4524","relation":"main_file","date_created":"2019-05-06T12:23:11Z","access_level":"open_access","file_id":"6381","creator":"dernst","content_type":"application/pdf"}],"related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","oa_version":"Published Version","type":"journal_article","doi":"10.1145/3290366","publication_status":"published","status":"public","department":[{"_id":"KrCh"}],"date_updated":"2026-05-13T22:31:16Z","article_processing_charge":"Yes (in subscription journal)","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar"},{"first_name":"Nastaran","full_name":"Okati, Nastaran","last_name":"Okati"},{"full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87"}]},{"status":"public","isi":1,"type":"conference","oa_version":"Preprint","publication_status":"published","doi":"10.1109/BLOC.2019.8751326","article_processing_charge":"No","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar"},{"first_name":"Arash","last_name":"Pourdamghani","full_name":"Pourdamghani, Arash"}],"department":[{"_id":"KrCh"}],"date_updated":"2026-05-13T22:31:17Z","language":[{"iso":"eng"}],"citation":{"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>","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>.","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>","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>.","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.","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."},"article_number":"8751326","project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_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"}],"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"05","conference":{"location":"Seoul, Korea","start_date":"2019-05-14","name":"IEEE International Conference on Blockchain and Cryptocurrency","end_date":"2019-05-17"},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"external_id":{"arxiv":["1902.07986"],"isi":["000491257000076"]},"quality_controlled":"1","abstract":[{"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.","lang":"eng"}],"date_created":"2019-02-26T09:03:15Z","main_file_link":[{"url":"https://arxiv.org/abs/1902.07986","open_access":"1"}],"oa":1,"year":"2019","date_published":"2019-05-01T00:00:00Z","publisher":"IEEE","arxiv":1,"day":"01","_id":"6056","ec_funded":1,"title":"Probabilistic smart contracts: Secure randomness on the blockchain","publication":"IEEE International Conference on Blockchain and Cryptocurrency"},{"day":"07","publisher":"MDPI","_id":"6627","pmid":1,"ddc":["580"],"publication":"International Journal of Molecular Sciences","article_type":"original","title":"Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling","ec_funded":1,"volume":20,"quality_controlled":"1","abstract":[{"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.","lang":"eng"}],"intvolume":"        20","date_created":"2019-07-11T12:00:32Z","issue":"13","year":"2019","date_published":"2019-07-07T00:00:00Z","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"file_date_updated":"2020-07-14T12:47:34Z","project":[{"grant_number":"282300","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"corr_author":"1","scopus_import":"1","language":[{"iso":"eng"}],"article_number":"3337","has_accepted_license":"1","citation":{"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>.","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>","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>.","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.","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."},"publication_identifier":{"eissn":["1422-0067"]},"external_id":{"pmid":["31284661"],"isi":["000477041100221"]},"file":[{"file_name":"2019_JournalMolecularScience_Adamowski.pdf","date_updated":"2020-07-14T12:47:34Z","file_size":3330291,"relation":"main_file","checksum":"dd9d1cbb933a72ceb666c9667890ac51","access_level":"open_access","date_created":"2019-07-17T06:17:15Z","file_id":"6645","creator":"dernst","content_type":"application/pdf"}],"related_material":{"record":[{"id":"10083","status":"public","relation":"dissertation_contains"}]},"month":"07","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","type":"journal_article","doi":"10.3390/ijms20133337","publication_status":"published","status":"public","isi":1,"department":[{"_id":"JiFr"}],"date_updated":"2026-05-13T22:31:18Z","article_processing_charge":"Yes","author":[{"full_name":"Adamowski, Maciek","last_name":"Adamowski","orcid":"0000-0001-6463-5257","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","first_name":"Maciek"},{"full_name":"Li, Lanxin","last_name":"Li","orcid":"0000-0002-5607-272X","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","first_name":"Lanxin"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jiří","full_name":"Friml, Jiří","last_name":"Friml"}]},{"main_file_link":[{"url":"https://arxiv.org/abs/1809.05865","open_access":"1"}],"date_created":"2019-07-07T21:59:20Z","abstract":[{"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.","lang":"eng"}],"intvolume":"       570","quality_controlled":"1","oa":1,"date_published":"2019-06-27T00:00:00Z","year":"2019","_id":"6609","day":"27","publisher":"Nature Publishing Group","arxiv":1,"volume":570,"title":"Stationary entangled radiation from micromechanical motion","ec_funded":1,"publication":"Nature","isi":1,"status":"public","doi":"10.1038/s41586-019-1320-2","publication_status":"published","oa_version":"Preprint","type":"journal_article","article_processing_charge":"No","author":[{"orcid":"0000-0003-0415-1423","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","first_name":"Shabir","full_name":"Barzanjeh, Shabir","last_name":"Barzanjeh"},{"full_name":"Redchenko, Elena","last_name":"Redchenko","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","first_name":"Elena"},{"full_name":"Peruzzo, Matilda","last_name":"Peruzzo","first_name":"Matilda","orcid":"0000-0002-3415-4628","id":"3F920B30-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wulf, Matthias","last_name":"Wulf","first_name":"Matthias","orcid":"0000-0001-6613-1378","id":"45598606-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dylan","full_name":"Lewis, Dylan","last_name":"Lewis"},{"full_name":"Arnold, Georg M","last_name":"Arnold","orcid":"0000-0003-1397-7876","id":"3770C838-F248-11E8-B48F-1D18A9856A87","first_name":"Georg M"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","first_name":"Johannes M","full_name":"Fink, Johannes M","last_name":"Fink"}],"date_updated":"2026-05-13T22:31:21Z","department":[{"_id":"JoFi"}],"citation":{"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>","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>.","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>","short":"S. Barzanjeh, E. Redchenko, M. Peruzzo, M. Wulf, D. Lewis, G.M. Arnold, J.M. Fink, Nature 570 (2019) 480–483.","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.","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.","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>."},"language":[{"iso":"eng"}],"scopus_import":"1","project":[{"grant_number":"732894","_id":"257EB838-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Hybrid Optomechanical Technologies"},{"grant_number":"758053","_id":"26336814-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"A Fiber Optic Transceiver for Superconducting Qubits"},{"call_identifier":"H2020","_id":"258047B6-B435-11E9-9278-68D0E5697425","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics","grant_number":"707438"},{"_id":"2671EB66-B435-11E9-9278-68D0E5697425","name":"Coherent on-chip conversion of superconducting qubit signals from microwaves to optical frequencies"}],"month":"06","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledged_ssus":[{"_id":"NanoFab"}],"external_id":{"isi":["000472860000042"],"arxiv":["1809.05865"]},"page":"480-483","related_material":{"record":[{"id":"18871","status":"public","relation":"dissertation_contains"}]}}]