[{"quality_controlled":"1","author":[{"first_name":"Joshua","last_name":"Mitchell","full_name":"Mitchell, Joshua"},{"first_name":"William","full_name":"Zhang, William","last_name":"Zhang"},{"first_name":"Michel","full_name":"Herde, Michel","last_name":"Herde"},{"first_name":"Christian","last_name":"Henneberger","full_name":"Henneberger, Christian"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","full_name":"Janovjak, Harald L","last_name":"Janovjak","first_name":"Harald L"},{"full_name":"O'Mara, Megan","last_name":"O'Mara","first_name":"Megan"},{"full_name":"Jackson, Colin","last_name":"Jackson","first_name":"Colin"}],"editor":[{"first_name":"Viktor","full_name":"Stein, Viktor","last_name":"Stein"}],"date_created":"2018-12-11T11:49:24Z","publist_id":"6450","title":"Method for developing optical sensors using a synthetic dye fluorescent protein FRET pair and computational modeling and assessment","publisher":"Springer","publication":"Synthetic Protein Switches","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"958","type":"book_chapter","volume":1596,"page":"89 - 99","publication_identifier":{"issn":["1064-3745"]},"department":[{"_id":"HaJa"}],"intvolume":"      1596","status":"public","oa_version":"None","scopus_import":"1","date_published":"2017-05-15T00:00:00Z","month":"05","date_updated":"2025-07-10T12:01:54Z","citation":{"ista":"Mitchell J, Zhang W, Herde M, Henneberger C, Janovjak HL, O’Mara M, Jackson C. 2017.Method for developing optical sensors using a synthetic dye fluorescent protein FRET pair and computational modeling and assessment. In: Synthetic Protein Switches. Methods in Molecular Biology, vol. 1596, 89–99.","chicago":"Mitchell, Joshua, William Zhang, Michel Herde, Christian Henneberger, Harald L Janovjak, Megan O’Mara, and Colin Jackson. “Method for Developing Optical Sensors Using a Synthetic Dye Fluorescent Protein FRET Pair and Computational Modeling and Assessment.” In <i>Synthetic Protein Switches</i>, edited by Viktor Stein, 1596:89–99. Synthetic Protein Switches. Springer, 2017. <a href=\"https://doi.org/10.1007/978-1-4939-6940-1_6\">https://doi.org/10.1007/978-1-4939-6940-1_6</a>.","ieee":"J. Mitchell <i>et al.</i>, “Method for developing optical sensors using a synthetic dye fluorescent protein FRET pair and computational modeling and assessment,” in <i>Synthetic Protein Switches</i>, vol. 1596, V. Stein, Ed. Springer, 2017, pp. 89–99.","ama":"Mitchell J, Zhang W, Herde M, et al. Method for developing optical sensors using a synthetic dye fluorescent protein FRET pair and computational modeling and assessment. In: Stein V, ed. <i>Synthetic Protein Switches</i>. Vol 1596. Synthetic Protein Switches. Springer; 2017:89-99. doi:<a href=\"https://doi.org/10.1007/978-1-4939-6940-1_6\">10.1007/978-1-4939-6940-1_6</a>","mla":"Mitchell, Joshua, et al. “Method for Developing Optical Sensors Using a Synthetic Dye Fluorescent Protein FRET Pair and Computational Modeling and Assessment.” <i>Synthetic Protein Switches</i>, edited by Viktor Stein, vol. 1596, Springer, 2017, pp. 89–99, doi:<a href=\"https://doi.org/10.1007/978-1-4939-6940-1_6\">10.1007/978-1-4939-6940-1_6</a>.","apa":"Mitchell, J., Zhang, W., Herde, M., Henneberger, C., Janovjak, H. L., O’Mara, M., &#38; Jackson, C. (2017). Method for developing optical sensors using a synthetic dye fluorescent protein FRET pair and computational modeling and assessment. In V. Stein (Ed.), <i>Synthetic Protein Switches</i> (Vol. 1596, pp. 89–99). Springer. <a href=\"https://doi.org/10.1007/978-1-4939-6940-1_6\">https://doi.org/10.1007/978-1-4939-6940-1_6</a>","short":"J. Mitchell, W. Zhang, M. Herde, C. Henneberger, H.L. Janovjak, M. O’Mara, C. Jackson, in:, V. Stein (Ed.), Synthetic Protein Switches, Springer, 2017, pp. 89–99."},"day":"15","language":[{"iso":"eng"}],"article_processing_charge":"No","year":"2017","alternative_title":["Methods in Molecular Biology"],"abstract":[{"lang":"eng","text":"Biosensors that exploit Forster resonance energy transfer (FRET) can be used to visualize biological and physiological processes and are capable of providing detailed information in both spatial and temporal dimensions. In a FRET-based biosensor, substrate binding is associated with a change in the relative positions of two fluorophores, leading to a change in FRET efficiency that may be observed in the fluorescence spectrum. As a result, their design requires a ligand-binding protein that exhibits a conformational change upon binding. However, not all ligand-binding proteins produce responsive sensors upon conjugation to fluorescent proteins or dyes, and identifying the optimum locations for the fluorophores often involves labor-intensive iterative design or high-throughput screening. Combining the genetic fusion of a fluorescent protein to the ligand-binding protein with site-specific covalent attachment of a fluorescent dye can allow fine control over the positions of the two fluorophores, allowing the construction of very sensitive sensors. This relies upon the accurate prediction of the locations of the two fluorophores in bound and unbound states. In this chapter, we describe a method for computational identification of dye-attachment sites that allows the use of cysteine modification to attach synthetic dyes that can be paired with a fluorescent protein for the purposes of creating FRET sensors."}],"publication_status":"published","series_title":"Synthetic Protein Switches","doi":"10.1007/978-1-4939-6940-1_6"},{"oa":1,"author":[{"last_name":"Bandeira","full_name":"Bandeira, Afonso S.","first_name":"Afonso S."},{"last_name":"Ferber","full_name":"Ferber, Asaf","first_name":"Asaf"},{"orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan","last_name":"Kwan"}],"quality_controlled":"1","date_created":"2021-06-22T11:51:27Z","title":"Resilience for the Littlewood–Offord problem","external_id":{"arxiv":["1609.08136"]},"arxiv":1,"publisher":"Elsevier","publication":"Advances in Mathematics","_id":"9588","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"journal_article","page":"292-312","publication_identifier":{"issn":["0001-8708"]},"volume":319,"intvolume":"       319","oa_version":"Preprint","status":"public","scopus_import":"1","month":"10","date_published":"2017-10-15T00:00:00Z","date_updated":"2023-02-23T14:01:57Z","day":"15","citation":{"apa":"Bandeira, A. S., Ferber, A., &#38; Kwan, M. A. (2017). Resilience for the Littlewood–Offord problem. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2017.08.031\">https://doi.org/10.1016/j.aim.2017.08.031</a>","short":"A.S. Bandeira, A. Ferber, M.A. Kwan, Advances in Mathematics 319 (2017) 292–312.","ieee":"A. S. Bandeira, A. Ferber, and M. A. Kwan, “Resilience for the Littlewood–Offord problem,” <i>Advances in Mathematics</i>, vol. 319. Elsevier, pp. 292–312, 2017.","chicago":"Bandeira, Afonso S., Asaf Ferber, and Matthew Alan Kwan. “Resilience for the Littlewood–Offord Problem.” <i>Advances in Mathematics</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.aim.2017.08.031\">https://doi.org/10.1016/j.aim.2017.08.031</a>.","ista":"Bandeira AS, Ferber A, Kwan MA. 2017. Resilience for the Littlewood–Offord problem. Advances in Mathematics. 319, 292–312.","mla":"Bandeira, Afonso S., et al. “Resilience for the Littlewood–Offord Problem.” <i>Advances in Mathematics</i>, vol. 319, Elsevier, 2017, pp. 292–312, doi:<a href=\"https://doi.org/10.1016/j.aim.2017.08.031\">10.1016/j.aim.2017.08.031</a>.","ama":"Bandeira AS, Ferber A, Kwan MA. Resilience for the Littlewood–Offord problem. <i>Advances in Mathematics</i>. 2017;319:292-312. doi:<a href=\"https://doi.org/10.1016/j.aim.2017.08.031\">10.1016/j.aim.2017.08.031</a>"},"language":[{"iso":"eng"}],"extern":"1","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Consider the sum  X(ξ)=∑ni=1aiξi , where  a=(ai)ni=1  is a sequence of non-zero reals and  ξ=(ξi)ni=1  is a sequence of i.i.d. Rademacher random variables (that is,  Pr[ξi=1]=Pr[ξi=−1]=1/2 ). The classical Littlewood-Offord problem asks for the best possible upper bound on the concentration probabilities  Pr[X=x] . In this paper we study a resilience version of the Littlewood-Offord problem: how many of the  ξi  is an adversary typically allowed to change without being able to force concentration on a particular value? We solve this problem asymptotically, and present a few interesting open problems."}],"year":"2017","publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/1609.08136","open_access":"1"}],"doi":"10.1016/j.aim.2017.08.031","article_type":"original"},{"month":"06","date_published":"2017-06-01T00:00:00Z","date_updated":"2023-02-23T14:02:00Z","day":"01","citation":{"apa":"Greenhill, C., Isaev, M., Kwan, M. A., &#38; McKay, B. D. (2017). The average number of spanning trees in sparse graphs with given degrees. <i>European Journal of Combinatorics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ejc.2017.02.003\">https://doi.org/10.1016/j.ejc.2017.02.003</a>","short":"C. Greenhill, M. Isaev, M.A. Kwan, B.D. McKay, European Journal of Combinatorics 63 (2017) 6–25.","chicago":"Greenhill, Catherine, Mikhail Isaev, Matthew Alan Kwan, and Brendan D. McKay. “The Average Number of Spanning Trees in Sparse Graphs with given Degrees.” <i>European Journal of Combinatorics</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.ejc.2017.02.003\">https://doi.org/10.1016/j.ejc.2017.02.003</a>.","ieee":"C. Greenhill, M. Isaev, M. A. Kwan, and B. D. McKay, “The average number of spanning trees in sparse graphs with given degrees,” <i>European Journal of Combinatorics</i>, vol. 63. Elsevier, pp. 6–25, 2017.","ista":"Greenhill C, Isaev M, Kwan MA, McKay BD. 2017. The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. 63, 6–25.","mla":"Greenhill, Catherine, et al. “The Average Number of Spanning Trees in Sparse Graphs with given Degrees.” <i>European Journal of Combinatorics</i>, vol. 63, Elsevier, 2017, pp. 6–25, doi:<a href=\"https://doi.org/10.1016/j.ejc.2017.02.003\">10.1016/j.ejc.2017.02.003</a>.","ama":"Greenhill C, Isaev M, Kwan MA, McKay BD. The average number of spanning trees in sparse graphs with given degrees. <i>European Journal of Combinatorics</i>. 2017;63:6-25. doi:<a href=\"https://doi.org/10.1016/j.ejc.2017.02.003\">10.1016/j.ejc.2017.02.003</a>"},"extern":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","publication_status":"published","abstract":[{"text":"We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence , provided that the number of edges is at least , where  is the maximum degree. A key part of our argument involves establishing a concentration result for a certain family of functions over random trees with given degrees, using Prüfer codes.","lang":"eng"}],"year":"2017","doi":"10.1016/j.ejc.2017.02.003","article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.ejc.2017.02.003"}],"quality_controlled":"1","author":[{"first_name":"Catherine","last_name":"Greenhill","full_name":"Greenhill, Catherine"},{"last_name":"Isaev","full_name":"Isaev, Mikhail","first_name":"Mikhail"},{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan","last_name":"Kwan"},{"first_name":"Brendan D.","full_name":"McKay, Brendan D.","last_name":"McKay"}],"oa":1,"date_created":"2021-06-22T12:18:59Z","arxiv":1,"external_id":{"arxiv":["1606.01586"]},"title":"The average number of spanning trees in sparse graphs with given degrees","publisher":"Elsevier","_id":"9589","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","publication":"European Journal of Combinatorics","publication_identifier":{"issn":["0195-6698"]},"volume":63,"page":"6-25","type":"journal_article","intvolume":"        63","scopus_import":"1","oa_version":"Published Version","status":"public"},{"date_updated":"2023-02-23T14:02:05Z","month":"01","date_published":"2017-01-12T00:00:00Z","extern":"1","language":[{"iso":"eng"}],"day":"12","citation":{"ista":"Krivelevich M, Kwan MA, Sudakov B. 2017. Bounded-degree spanning trees in randomly perturbed graphs. SIAM Journal on Discrete Mathematics. 31(1), 155–171.","ieee":"M. Krivelevich, M. A. Kwan, and B. Sudakov, “Bounded-degree spanning trees in randomly perturbed graphs,” <i>SIAM Journal on Discrete Mathematics</i>, vol. 31, no. 1. Society for Industrial &#38; Applied Mathematics, pp. 155–171, 2017.","chicago":"Krivelevich, Michael, Matthew Alan Kwan, and Benny Sudakov. “Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.” <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial &#38; Applied Mathematics, 2017. <a href=\"https://doi.org/10.1137/15m1032910\">https://doi.org/10.1137/15m1032910</a>.","ama":"Krivelevich M, Kwan MA, Sudakov B. Bounded-degree spanning trees in randomly perturbed graphs. <i>SIAM Journal on Discrete Mathematics</i>. 2017;31(1):155-171. doi:<a href=\"https://doi.org/10.1137/15m1032910\">10.1137/15m1032910</a>","mla":"Krivelevich, Michael, et al. “Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.” <i>SIAM Journal on Discrete Mathematics</i>, vol. 31, no. 1, Society for Industrial &#38; Applied Mathematics, 2017, pp. 155–71, doi:<a href=\"https://doi.org/10.1137/15m1032910\">10.1137/15m1032910</a>.","apa":"Krivelevich, M., Kwan, M. A., &#38; Sudakov, B. (2017). Bounded-degree spanning trees in randomly perturbed graphs. <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/15m1032910\">https://doi.org/10.1137/15m1032910</a>","short":"M. Krivelevich, M.A. Kwan, B. Sudakov, SIAM Journal on Discrete Mathematics 31 (2017) 155–171."},"publication_status":"published","abstract":[{"lang":"eng","text":"We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding trees into fixed dense graphs and into random graphs, and extends a sizeable body of existing research on randomly perturbed graphs. Specifically, we show that there is c=c(α,Δ) such that if G is an n-vertex graph with minimum degree at least αn, and T is an n-vertex tree with maximum degree at most Δ , then if we add cn uniformly random edges to G, the resulting graph will contain T asymptotically almost surely (as n→∞ ). Our proof uses a lemma concerning the decomposition of a dense graph into super-regular pairs of comparable sizes, which may be of independent interest."}],"year":"2017","article_processing_charge":"No","doi":"10.1137/15m1032910","article_type":"original","main_file_link":[{"url":"https://arxiv.org/abs/1507.07960","open_access":"1"}],"date_created":"2021-06-22T12:26:25Z","author":[{"first_name":"Michael","full_name":"Krivelevich, Michael","last_name":"Krivelevich"},{"first_name":"Matthew Alan","last_name":"Kwan","full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567"},{"first_name":"Benny","full_name":"Sudakov, Benny","last_name":"Sudakov"}],"quality_controlled":"1","oa":1,"publisher":"Society for Industrial & Applied Mathematics","arxiv":1,"external_id":{"arxiv":["1507.07960"]},"title":"Bounded-degree spanning trees in randomly perturbed graphs","issue":"1","page":"155-171","volume":31,"publication_identifier":{"issn":["0895-4801"],"eissn":["1095-7146"]},"type":"journal_article","_id":"9590","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","publication":"SIAM Journal on Discrete Mathematics","scopus_import":"1","oa_version":"Preprint","status":"public","intvolume":"        31"},{"doi":"10.15479/AT:ISTA:th_825","supervisor":[{"id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg"}],"publication_status":"published","year":"2017","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"Cell-cell  contact  formation  constitutes  the  first  step  in  the  emergence  of  multicellularity  in evolution, thereby  allowing  the  differentiation  of  specialized  cell  types.  In  metazoan development, cell-cell contact formation is thought to influence cell fate specification, and cell   fate   specification   has   been   implicated   in   cell-cell  contact formation.   However, remarkably little is yet known about whether and how the interaction and feedback between cell-cell contact formation and cell fate specification affect development. Here we identify a positive  feedback  loop  between  cell-cell  contact  duration,  morphogen  signaling  and mesendoderm  cell  fate  specification  during  zebrafish  gastrulation.  We  show  that  long lasting cell-cell contacts enhance the competence of prechordal plate (ppl) progenitor cells to  respond  to  Nodal  signaling,  required  for  proper  ppl  cell  fate  specification.  We  further show  that  Nodal  signalling  romotes  ppl  cell-cell  contact  duration,  thereby  generating  an effective  positive  feedback  loop  between  ppl  cell-cell  contact  duration  and  cell  fate specification. Finally, by using a combination of theoretical modeling and experimentation, we  show  that  this  feedback  loop  determines  whether  anterior  axial  mesendoderm  cells become  ppl  progenitors  or,  instead,  turn  into  endoderm  progenitors.  Our  findings  reveal that  the  gene  regulatory  networks  leading  to  cell  fate  diversification  within  the  developing embryo  are  controlled  by  the  interdependent  activities  of  cell-cell  signaling  and  contact formation."}],"article_processing_charge":"No","language":[{"iso":"eng"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"short":"V. Barone, Cell Adhesion and Cell Fate: An Effective Feedback Loop during Zebrafish Gastrulation, Institute of Science and Technology Austria, 2017.","apa":"Barone, V. (2017). <i>Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_825\">https://doi.org/10.15479/AT:ISTA:th_825</a>","ama":"Barone V. Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_825\">10.15479/AT:ISTA:th_825</a>","mla":"Barone, Vanessa. <i>Cell Adhesion and Cell Fate: An Effective Feedback Loop during Zebrafish Gastrulation</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_825\">10.15479/AT:ISTA:th_825</a>.","ista":"Barone V. 2017. Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation. Institute of Science and Technology Austria.","chicago":"Barone, Vanessa. “Cell Adhesion and Cell Fate: An Effective Feedback Loop during Zebrafish Gastrulation.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_825\">https://doi.org/10.15479/AT:ISTA:th_825</a>.","ieee":"V. Barone, “Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation,” Institute of Science and Technology Austria, 2017."},"day":"01","date_updated":"2026-06-18T18:12:40Z","file":[{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","file_id":"6205","creator":"dernst","file_size":14497822,"date_updated":"2020-07-14T12:48:16Z","checksum":"242f88c87f2cf267bf05049fa26a687b","date_created":"2019-04-05T08:36:52Z","access_level":"closed","file_name":"2017_Barone_thesis_final.docx"},{"checksum":"ba5b0613ed8bade73a409acdd880fb8a","date_created":"2019-04-05T08:36:52Z","creator":"dernst","file_size":14995941,"date_updated":"2020-07-14T12:48:16Z","file_id":"6206","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2017_Barone_thesis_.pdf"}],"date_published":"2017-03-01T00:00:00Z","month":"03","corr_author":"1","status":"public","related_material":{"record":[{"relation":"part_of_dissertation","id":"735","status":"public"},{"status":"public","id":"1100","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"1537"},{"id":"3246","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"2926"},{"status":"public","id":"676","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"1912"}]},"ddc":["570","590"],"oa_version":"Published Version","department":[{"_id":"CaHe"}],"file_date_updated":"2020-07-14T12:48:16Z","publication_identifier":{"issn":["2663-337X"]},"page":"109","has_accepted_license":"1","degree_awarded":"PhD","type":"dissertation","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","_id":"961","pubrep_id":"825","publisher":"Institute of Science and Technology Austria","license":"https://creativecommons.org/licenses/by/4.0/","title":"Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation","publist_id":"6444","date_created":"2018-12-11T11:49:25Z","acknowledgement":"Many people accompanied me during this trip: I would not have reached my destination nor \r\nenjoyed the travelling without them. First of all, thanks to CP. Thanks for making me part of \r\nyour team, always full of diverse, interesting and incredibly competent people and thanks for \r\nall  the  good  science  I  witnessed  and  participated  in.  It  has  been  a \r\nblast,  an  incredibly \r\nexciting  one!  Thanks  to  JLo,  for  teaching  me  how  to  master  my  pipettes  and  showing  me \r\nthat science is a lot of fun. Many, many thanks to Gabby for teaching me basically everything \r\nabout  zebrafish  and  being  always  there  to  advice,  sugge\r\nst,  support...and  play  fussball! \r\nThank you to Julien, for the critical eye on things, Pedro, for all the invaluable feedback and \r\nthe amazing kicker matches, and Keisuke, for showing me the light, and to the three of them \r\ntogether  for  all  the  good  laughs  we\r\nhad.  My  start  in  Vienna  would  have  been  a  lot  more \r\ndifficult  without  you  guys.  Also  it  would  not  have  been  possible  without  Elena  and  Inês: \r\nthanks  for  helping  setting  up  this  lab  and  for  the  dinners  in  Gugging.  Thanks  to  Martin,  for \r\nhelping  me  understand \r\nthe  physics  behind  biology.  Thanks  to  Philipp,  for  the  interest  and \r\nadvice, and to Michael, for the Viennise take on things. Thanks to Julia, for putting up with \r\nbeing our technician and becoming a friend in the process. And now to the newest members \r\nof th\r\ne lab. Thanks to Daniel for the enthusiasm and the neverending energy and for all your \r\nhelp over the years: thank you! To Jana, for showing me that one doesn’t give up, no matter \r\nwhat.  To  Shayan,  for  being  such  a  motivated  student.  To  Matt,  for  helping  out\r\nwith  coding \r\nand for finding punk solutions to data analysis problems. Thanks to all the members of the \r\nlab, Verena, Hitoshi, Silvia, Conny, Karla, Nicoletta, Zoltan, Peng, Benoit, Roland, Yuuta and \r\nFeyza,  for  the  wonderful  atmosphere  in  the  lab.  Many  than\r\nks  to  Koni  and  Deborah:  doing \r\nexperiments would have been much more difficult without your help. Special thanks to Katjia \r\nfor  setting  up  an  amazing  imaging  facility  and  for  building  the  best  team,  Robert,  Nasser, \r\nAnna and Doreen: thank you for putting up w\r\nith all the late sortings and for helping with all \r\nthe technical problems. Thanks to Eva, Verena and Matthias for keeping the fish happy. Big \r\nthanks to Harald Janovjak for being a present and helpful committee member over the years \r\nand  to  Patrick  Lemaire  f\r\nor  the  helpful  insight  and  extremely  interesting  discussion  we  had \r\nabout  the  project.  Also,  this  journey  would  not  have  been  the  same  without  all  the  friends \r\nthat I met in Dresden and then in Vienna: Daniele, Claire, Kuba, Steffi, Harold, Dejan, Irene, \r\nFab\r\nienne, Hande, Tiago, Marianne, Jon, Srdjan, Branca, Uli, Murat, Alex, Conny, Christoph, \r\nCaro, Simone, Barbara, Felipe, Dama, Jose, Hubert and many others that filled my days with \r\nfun and support. A special thank to my family, always close even if they are \r\nkilometers away. \r\nGrazie  ai  miei  fratelli,  Nunzio  e  William,  e  alla  mia  mamma,  per  essermi  sempre  vicini  pur \r\nvivendo a chilometri di distanza. And, last but not least, thanks to Moritz, for putting up with \r\nthe crazy life of a scientist, the living apart for\r\nso long, never knowing when things are going \r\nto happen. Thanks for being a great partner and my number one fan!","author":[{"last_name":"Barone","full_name":"Barone, Vanessa","first_name":"Vanessa","orcid":"0000-0003-2676-3367","id":"419EECCC-F248-11E8-B48F-1D18A9856A87"}],"OA_place":"publisher","oa":1},{"type":"conference","volume":10427,"page":"399 - 418","publication_identifier":{"issn":["0302-9743"]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","_id":"962","status":"public","oa_version":"None","scopus_import":"1","isi":1,"department":[{"_id":"ToHe"}],"intvolume":"     10427","date_created":"2018-12-11T11:49:26Z","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publist_id":"6443","author":[{"full_name":"Trinh, Minh","last_name":"Trinh","first_name":"Minh"},{"first_name":"Duc Hiep","full_name":"Chu, Duc Hiep","last_name":"Chu","id":"3598E630-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joxan","full_name":"Jaffar, Joxan","last_name":"Jaffar"}],"editor":[{"last_name":"Majumdar","full_name":"Majumdar, Rupak","first_name":"Rupak"},{"last_name":"Kunčak","full_name":"Kunčak, Viktor","first_name":"Viktor"}],"quality_controlled":"1","publisher":"Springer","conference":{"name":"CAV: Computer Aided Verification","end_date":"2017-07-28","start_date":"2017-07-24","location":"Heidelberg, Germany"},"title":"Model counting for recursively-defined strings","external_id":{"isi":["000431900900021"]},"alternative_title":["LNCS"],"year":"2017","abstract":[{"text":"We present a new algorithm for model counting of a class of string constraints. In addition to the classic operation of concatenation, our class includes some recursively defined operations such as Kleene closure, and replacement of substrings. Additionally, our class also includes length constraints on the string expressions, which means, by requiring reasoning about numbers, that we face a multi-sorted logic. In the end, our string constraints are motivated by their use in programming for web applications. Our algorithm comprises two novel features: the ability to use a technique of (1) partial derivatives for constraints that are already in a solved form, i.e. a form where its (string) satisfiability is clearly displayed, and (2) non-progression, where cyclic reasoning in the reduction process may be terminated (thus allowing for the algorithm to look elsewhere). Finally, we experimentally compare our model counter with two recent works on model counting of similar constraints, SMC [18] and ABC [5], to demonstrate its superior performance.","lang":"eng"}],"publication_status":"published","article_processing_charge":"No","doi":"10.1007/978-3-319-63390-9_21","date_updated":"2026-04-16T09:58:05Z","date_published":"2017-01-01T00:00:00Z","month":"01","language":[{"iso":"eng"}],"citation":{"apa":"Trinh, M., Chu, D. H., &#38; Jaffar, J. (2017). Model counting for recursively-defined strings. In R. Majumdar &#38; V. Kunčak (Eds.) (Vol. 10427, pp. 399–418). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63390-9_21\">https://doi.org/10.1007/978-3-319-63390-9_21</a>","short":"M. Trinh, D.H. Chu, J. Jaffar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 399–418.","ista":"Trinh M, Chu DH, Jaffar J. 2017. Model counting for recursively-defined strings. CAV: Computer Aided Verification, LNCS, vol. 10427, 399–418.","ieee":"M. Trinh, D. H. Chu, and J. Jaffar, “Model counting for recursively-defined strings,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 399–418.","chicago":"Trinh, Minh, Duc Hiep Chu, and Joxan Jaffar. “Model Counting for Recursively-Defined Strings.” edited by Rupak Majumdar and Viktor Kunčak, 10427:399–418. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63390-9_21\">https://doi.org/10.1007/978-3-319-63390-9_21</a>.","ama":"Trinh M, Chu DH, Jaffar J. Model counting for recursively-defined strings. In: Majumdar R, Kunčak V, eds. Vol 10427. Springer; 2017:399-418. doi:<a href=\"https://doi.org/10.1007/978-3-319-63390-9_21\">10.1007/978-3-319-63390-9_21</a>","mla":"Trinh, Minh, et al. <i>Model Counting for Recursively-Defined Strings</i>. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10427, Springer, 2017, pp. 399–418, doi:<a href=\"https://doi.org/10.1007/978-3-319-63390-9_21\">10.1007/978-3-319-63390-9_21</a>."},"day":"01"},{"year":"2017","alternative_title":["LIPIcs"],"abstract":[{"text":"Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertex. The cost of traversing an edge depends on the number of players that traverse it. Thus, it abstracts the fact that different users may use a resource at different times and for different durations, which plays an important role in defining the costs of the users in reality. For example, when transmitting packets in a communication network, routing traffic in a road network, or processing a task in a production system, the traversal of the network involves an inherent delay, and so sharing and congestion of resources crucially depends on time. We study timed network games , which add a time component to network games. Each vertex v in the network is associated with a cost function, mapping the load on v to the price that a player pays for staying in v for one time unit with this load. In addition, each edge has a guard, describing time intervals in which the edge can be traversed, forcing the players to spend time on vertices. Unlike earlier work that add a time component to network games, the time in our model is continuous and cannot be discretized. In particular, players have uncountably many strategies, and a game may have uncountably many pure Nash equilibria. We study properties of timed network games with cost-sharing or congestion cost functions: their stability, equilibrium inefficiency, and complexity. In particular, we show that the answer to the question whether we can restrict attention to boundary strategies, namely ones in which edges are traversed only at the boundaries of guards, is mixed. ","lang":"eng"}],"publication_status":"published","article_processing_charge":"No","doi":"10.4230/LIPIcs.MFCS.2017.37","date_updated":"2025-07-10T12:01:59Z","date_published":"2017-06-01T00:00:00Z","month":"06","file":[{"access_level":"open_access","date_created":"2018-12-12T10:14:10Z","checksum":"f55eaf7f3c36ea07801112acfedd17d5","date_updated":"2020-07-14T12:48:18Z","creator":"system","file_size":369730,"relation":"main_file","file_id":"5059","content_type":"application/pdf","file_name":"IST-2017-829-v1+1_mfcs-cr.pdf"}],"language":[{"iso":"eng"}],"citation":{"ama":"Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.37\">10.4230/LIPIcs.MFCS.2017.37</a>","mla":"Avni, Guy, et al. <i>Timed Network Games with Clocks</i>. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.37\">10.4230/LIPIcs.MFCS.2017.37</a>.","ista":"Avni G, Guha S, Kupferman O. 2017. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 83, 37.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,” Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.37\">https://doi.org/10.4230/LIPIcs.MFCS.2017.37</a>.","ieee":"G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science, Aalborg, Denmark, 2017, vol. 83.","short":"G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2017). Timed network games with clocks (Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science, Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.37\">https://doi.org/10.4230/LIPIcs.MFCS.2017.37</a>"},"day":"01","article_number":"37","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","type":"conference","volume":83,"publication_identifier":{"issn":["1868-8969"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"829","_id":"963","related_material":{"record":[{"status":"public","id":"6005","relation":"later_version"}]},"status":"public","ddc":["004"],"oa_version":"Published Version","scopus_import":"1","file_date_updated":"2020-07-14T12:48:18Z","department":[{"_id":"ToHe"}],"intvolume":"        83","date_created":"2018-12-11T11:49:26Z","project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"publist_id":"6438","oa":1,"author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","first_name":"Guy","full_name":"Avni, Guy","last_name":"Avni"},{"last_name":"Guha","full_name":"Guha, Shibashis","first_name":"Shibashis"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","conference":{"location":"Aalborg, Denmark","start_date":"2017-08-21","end_date":"2017-08-25","name":"MFCS: Mathematical Foundations of Computer Science"},"title":"Timed network games with clocks"},{"date_updated":"2023-02-23T14:04:02Z","month":"09","date_published":"2017-09-14T00:00:00Z","language":[{"iso":"eng"}],"extern":"1","day":"14","citation":{"short":"B. Cheng, G.A. Tribello, M. Ceriotti, The Journal of Chemical Physics 147 (2017).","apa":"Cheng, B., Tribello, G. A., &#38; Ceriotti, M. (2017). The Gibbs free energy of homogeneous nucleation: From atomistic nuclei to the planar limit. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.4997180\">https://doi.org/10.1063/1.4997180</a>","ama":"Cheng B, Tribello GA, Ceriotti M. The Gibbs free energy of homogeneous nucleation: From atomistic nuclei to the planar limit. <i>The Journal of Chemical Physics</i>. 2017;147(10). doi:<a href=\"https://doi.org/10.1063/1.4997180\">10.1063/1.4997180</a>","mla":"Cheng, Bingqing, et al. “The Gibbs Free Energy of Homogeneous Nucleation: From Atomistic Nuclei to the Planar Limit.” <i>The Journal of Chemical Physics</i>, vol. 147, no. 10, 104707, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.4997180\">10.1063/1.4997180</a>.","ista":"Cheng B, Tribello GA, Ceriotti M. 2017. The Gibbs free energy of homogeneous nucleation: From atomistic nuclei to the planar limit. The Journal of Chemical Physics. 147(10), 104707.","chicago":"Cheng, Bingqing, Gareth A. Tribello, and Michele Ceriotti. “The Gibbs Free Energy of Homogeneous Nucleation: From Atomistic Nuclei to the Planar Limit.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.4997180\">https://doi.org/10.1063/1.4997180</a>.","ieee":"B. Cheng, G. A. Tribello, and M. Ceriotti, “The Gibbs free energy of homogeneous nucleation: From atomistic nuclei to the planar limit,” <i>The Journal of Chemical Physics</i>, vol. 147, no. 10. AIP Publishing, 2017."},"article_number":"104707","abstract":[{"lang":"eng","text":"In this paper we discuss how the information contained in atomistic simulations of homogeneous nucleation should be used when fitting the parameters in macroscopic nucleation models. We show how the number of solid and liquid atoms in such simulations can be determined unambiguously by using a Gibbs dividing surface and how the free energy as a function of the number of solid atoms in the nucleus can thus be extracted. We then show that the parameters (the chemical potential, the interfacial free energy, and a Tolman correction) of a model based on classical nucleation theory can be fitted using the information contained in these free-energy profiles but that the parameters in such models are highly correlated. This correlation is unfortunate as it ensures that small errors in the computed free energy surface can give rise to large errors in the extrapolated properties of the fitted model. To resolve this problem we thus propose a method for fitting macroscopic nucleation models that uses simulations of planar interfaces and simulations of three-dimensional nuclei in tandem. We show that when the chemical potentials and the interface energy are pinned to their planar-interface values, more precise estimates for the Tolman length are obtained. Extrapolating the free energy profile obtained from small simulation boxes to larger nuclei is thus more reliable."}],"year":"2017","publication_status":"published","article_processing_charge":"No","main_file_link":[{"url":"https://pure.qub.ac.uk/en/publications/the-gibbs-free-energy-of-homogeneous-nucleation-from-atomistic-nuclei-to-the-planar-limit(4599cdb4-dcc4-4522-8763-7b2a165ebf12).html","open_access":"1"}],"doi":"10.1063/1.4997180","article_type":"original","date_created":"2021-07-15T08:13:29Z","oa":1,"pmid":1,"quality_controlled":"1","author":[{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","orcid":"0000-0002-3584-9632","first_name":"Bingqing","full_name":"Cheng, Bingqing","last_name":"Cheng"},{"last_name":"Tribello","full_name":"Tribello, Gareth A.","first_name":"Gareth A."},{"full_name":"Ceriotti, Michele","last_name":"Ceriotti","first_name":"Michele"}],"publisher":"AIP Publishing","title":"The Gibbs free energy of homogeneous nucleation: From atomistic nuclei to the planar limit","issue":"10","external_id":{"arxiv":["1703.06062"],"pmid":["28915742"]},"arxiv":1,"type":"journal_article","publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"volume":147,"publication":"The Journal of Chemical Physics","_id":"9660","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Submitted Version","status":"public","scopus_import":"1","intvolume":"       147"},{"language":[{"iso":"eng"}],"extern":"1","citation":{"chicago":"Cheng, Bingqing, and Michele Ceriotti. “Bridging the Gap between Atomistic and Macroscopic Models of Homogeneous Nucleation.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.4973883\">https://doi.org/10.1063/1.4973883</a>.","ieee":"B. Cheng and M. Ceriotti, “Bridging the gap between atomistic and macroscopic models of homogeneous nucleation,” <i>The Journal of Chemical Physics</i>, vol. 146, no. 3. AIP Publishing, 2017.","ista":"Cheng B, Ceriotti M. 2017. Bridging the gap between atomistic and macroscopic models of homogeneous nucleation. The Journal of Chemical Physics. 146(3), 034106.","mla":"Cheng, Bingqing, and Michele Ceriotti. “Bridging the Gap between Atomistic and Macroscopic Models of Homogeneous Nucleation.” <i>The Journal of Chemical Physics</i>, vol. 146, no. 3, 034106, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.4973883\">10.1063/1.4973883</a>.","ama":"Cheng B, Ceriotti M. Bridging the gap between atomistic and macroscopic models of homogeneous nucleation. <i>The Journal of Chemical Physics</i>. 2017;146(3). doi:<a href=\"https://doi.org/10.1063/1.4973883\">10.1063/1.4973883</a>","apa":"Cheng, B., &#38; Ceriotti, M. (2017). Bridging the gap between atomistic and macroscopic models of homogeneous nucleation. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.4973883\">https://doi.org/10.1063/1.4973883</a>","short":"B. Cheng, M. Ceriotti, The Journal of Chemical Physics 146 (2017)."},"day":"21","article_number":"034106","date_updated":"2021-08-09T12:31:57Z","date_published":"2017-01-21T00:00:00Z","month":"01","main_file_link":[{"url":"https://arxiv.org/abs/1610.01322","open_access":"1"}],"article_type":"original","doi":"10.1063/1.4973883","year":"2017","abstract":[{"text":"Macroscopic theories of nucleation such as classical nucleation theory envision that clusters of the bulk stable phase form inside the bulk metastable phase. Molecular dynamics simulations are often used to elucidate nucleation mechanisms, by capturing the microscopic configurations of all the atoms. In this paper, we introduce a thermodynamic model that links macroscopic theories and atomic-scale simulations and thus provide a simple and elegant framework for testing the limits of classical nucleation theory.","lang":"eng"}],"publication_status":"published","article_processing_charge":"No","publisher":"AIP Publishing","issue":"3","title":"Bridging the gap between atomistic and macroscopic models of homogeneous nucleation","external_id":{"pmid":["28109231"],"arxiv":["1610.01322"]},"arxiv":1,"date_created":"2021-07-15T08:27:31Z","pmid":1,"oa":1,"quality_controlled":"1","author":[{"first_name":"Bingqing","last_name":"Cheng","full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9"},{"first_name":"Michele","last_name":"Ceriotti","full_name":"Ceriotti, Michele"}],"status":"public","oa_version":"Preprint","scopus_import":"1","intvolume":"       146","type":"journal_article","volume":146,"publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"publication":"The Journal of Chemical Physics","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9661"},{"_id":"9707","article_processing_charge":"No","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"research_data_reference","abstract":[{"lang":"eng","text":"Branching morphogenesis of the epithelial ureteric bud forms the renal collecting duct system and is critical for normal nephron number, while low nephron number is implicated in hypertension and renal disease. Ureteric bud growth and branching requires GDNF signaling from the surrounding mesenchyme to cells at the ureteric bud tips, via the Ret receptor tyrosine kinase and coreceptor Gfrα1; Ret signaling up-regulates transcription factors Etv4 and Etv5, which are also critical for branching. Despite extensive knowledge of the genetic control of these events, it is not understood, at the cellular level, how renal branching morphogenesis is achieved or how Ret signaling influences epithelial cell behaviors to promote this process. Analysis of chimeric embryos previously suggested a role for Ret signaling in promoting cell rearrangements in the nephric duct, but this method was unsuited to study individual cell behaviors during ureteric bud branching. Here, we use Mosaic Analysis with Double Markers (MADM), combined with organ culture and time-lapse imaging, to trace the movements and divisions of individual ureteric bud tip cells. We first examine wild-type clones and then Ret or Etv4 mutant/wild-type clones in which the mutant and wild-type sister cells are differentially and heritably marked by green and red fluorescent proteins. We find that, in normal kidneys, most individual tip cells behave as self-renewing progenitors, some of whose progeny remain at the tips while others populate the growing UB trunks. In Ret or Etv4 MADM clones, the wild-type cells generated at a UB tip are much more likely to remain at, or move to, the new tips during branching and elongation, while their Ret−/− or Etv4−/− sister cells tend to lag behind and contribute only to the trunks. By tracking successive mitoses in a cell lineage, we find that Ret signaling has little effect on proliferation, in contrast to its effects on cell movement. Our results show that Ret/Etv4 signaling promotes directed cell movements in the ureteric bud tips, and suggest a model in which these cell movements mediate branching morphogenesis."}],"year":"2017","department":[{"_id":"SiHi"}],"doi":"10.5061/dryad.pk16b","main_file_link":[{"url":"https://doi.org/10.5061/dryad.pk16b","open_access":"1"}],"oa_version":"Published Version","status":"public","related_material":{"record":[{"id":"9702","status":"deleted","relation":"used_in_publication"}]},"author":[{"full_name":"Riccio, Paul","last_name":"Riccio","first_name":"Paul"},{"last_name":"Cebrián","full_name":"Cebrián, Christina","first_name":"Christina"},{"full_name":"Zong, Hui","last_name":"Zong","first_name":"Hui"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","first_name":"Simon","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon"},{"last_name":"Costantini","full_name":"Costantini, Frank","first_name":"Frank"}],"oa":1,"month":"01","date_published":"2017-01-14T00:00:00Z","date_created":"2021-07-23T09:39:34Z","date_updated":"2022-08-25T13:34:55Z","day":"14","title":"Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis","citation":{"apa":"Riccio, P., Cebrián, C., Zong, H., Hippenmeyer, S., &#38; Costantini, F. (2017). Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis. Dryad. <a href=\"https://doi.org/10.5061/dryad.pk16b\">https://doi.org/10.5061/dryad.pk16b</a>","short":"P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, F. Costantini, (2017).","ista":"Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. 2017. Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis, Dryad, <a href=\"https://doi.org/10.5061/dryad.pk16b\">10.5061/dryad.pk16b</a>.","ieee":"P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, and F. Costantini, “Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis.” Dryad, 2017.","chicago":"Riccio, Paul, Christina Cebrián, Hui Zong, Simon Hippenmeyer, and Frank Costantini. “Data from: Ret and Etv4 Promote Directed Movements of Progenitor Cells during Renal Branching Morphogenesis.” Dryad, 2017. <a href=\"https://doi.org/10.5061/dryad.pk16b\">https://doi.org/10.5061/dryad.pk16b</a>.","ama":"Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis. 2017. doi:<a href=\"https://doi.org/10.5061/dryad.pk16b\">10.5061/dryad.pk16b</a>","mla":"Riccio, Paul, et al. <i>Data from: Ret and Etv4 Promote Directed Movements of Progenitor Cells during Renal Branching Morphogenesis</i>. Dryad, 2017, doi:<a href=\"https://doi.org/10.5061/dryad.pk16b\">10.5061/dryad.pk16b</a>."},"publisher":"Dryad"},{"date_updated":"2025-09-22T09:43:12Z","date_created":"2021-07-23T11:34:34Z","author":[{"full_name":"Prentice, Jason","last_name":"Prentice","first_name":"Jason"},{"last_name":"Marre","full_name":"Marre, Olivier","first_name":"Olivier"},{"full_name":"Ioffe, Mark","last_name":"Ioffe","first_name":"Mark"},{"first_name":"Adrianna","last_name":"Loback","full_name":"Loback, Adrianna"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","last_name":"Tkačik","full_name":"Tkačik, Gašper","first_name":"Gašper"},{"full_name":"Berry, Michael","last_name":"Berry","first_name":"Michael"}],"date_published":"2017-10-18T00:00:00Z","oa":1,"month":"10","publisher":"Dryad","citation":{"short":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, M. Berry, (2017).","apa":"Prentice, J., Marre, O., Ioffe, M., Loback, A., Tkačik, G., &#38; Berry, M. (2017). Data from: Error-robust modes of the retinal population code. Dryad. <a href=\"https://doi.org/10.5061/dryad.1f1rc\">https://doi.org/10.5061/dryad.1f1rc</a>","mla":"Prentice, Jason, et al. <i>Data from: Error-Robust Modes of the Retinal Population Code</i>. Dryad, 2017, doi:<a href=\"https://doi.org/10.5061/dryad.1f1rc\">10.5061/dryad.1f1rc</a>.","ama":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. Data from: Error-robust modes of the retinal population code. 2017. doi:<a href=\"https://doi.org/10.5061/dryad.1f1rc\">10.5061/dryad.1f1rc</a>","chicago":"Prentice, Jason, Olivier Marre, Mark Ioffe, Adrianna Loback, Gašper Tkačik, and Michael Berry. “Data from: Error-Robust Modes of the Retinal Population Code.” Dryad, 2017. <a href=\"https://doi.org/10.5061/dryad.1f1rc\">https://doi.org/10.5061/dryad.1f1rc</a>.","ieee":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, and M. Berry, “Data from: Error-robust modes of the retinal population code.” Dryad, 2017.","ista":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. 2017. Data from: Error-robust modes of the retinal population code, Dryad, <a href=\"https://doi.org/10.5061/dryad.1f1rc\">10.5061/dryad.1f1rc</a>."},"day":"18","title":"Data from: Error-robust modes of the retinal population code","year":"2017","abstract":[{"text":"Across the nervous system, certain population spiking patterns are observed far more frequently than others. A hypothesis about this structure is that these collective activity patterns function as population codewords–collective modes–carrying information distinct from that of any single cell. We investigate this phenomenon in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop a novel statistical model that decomposes the population response into modes; it predicts the distribution of spiking activity in the ganglion cell population with high accuracy. We found that the modes represent localized features of the visual stimulus that are distinct from the features represented by single neurons. Modes form clusters of activity states that are readily discriminated from one another. When we repeated the same visual stimulus, we found that the same mode was robustly elicited. These results suggest that retinal ganglion cells’ collective signaling is endowed with a form of error-correcting code–a principle that may hold in brain areas beyond retina.","lang":"eng"}],"type":"research_data_reference","article_processing_charge":"No","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9709","doi":"10.5061/dryad.1f1rc","status":"public","related_material":{"record":[{"status":"public","id":"1197","relation":"used_in_publication"}]},"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.1f1rc"}],"department":[{"_id":"GaTk"}]},{"doi":"10.17632/nw68fxzjpm.1","status":"public","related_material":{"record":[{"relation":"used_in_publication","id":"564","status":"public"}]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.17632/nw68fxzjpm.1"}],"oa_version":"Published Version","department":[{"_id":"NiBa"}],"year":"2017","type":"research_data_reference","abstract":[{"lang":"eng","text":"Mathematica notebooks used to generate figures."}],"article_processing_charge":"No","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9842","publisher":"Mendeley Data","citation":{"short":"A. Etheridge, N.H. Barton, (2017).","apa":"Etheridge, A., &#38; Barton, N. H. (2017). Data for: Establishment in a new habitat by polygenic adaptation. Mendeley Data. <a href=\"https://doi.org/10.17632/nw68fxzjpm.1\">https://doi.org/10.17632/nw68fxzjpm.1</a>","ama":"Etheridge A, Barton NH. Data for: Establishment in a new habitat by polygenic adaptation. 2017. doi:<a href=\"https://doi.org/10.17632/nw68fxzjpm.1\">10.17632/nw68fxzjpm.1</a>","mla":"Etheridge, Alison, and Nicholas H. Barton. <i>Data for: Establishment in a New Habitat by Polygenic Adaptation</i>. Mendeley Data, 2017, doi:<a href=\"https://doi.org/10.17632/nw68fxzjpm.1\">10.17632/nw68fxzjpm.1</a>.","ista":"Etheridge A, Barton NH. 2017. Data for: Establishment in a new habitat by polygenic adaptation, Mendeley Data, <a href=\"https://doi.org/10.17632/nw68fxzjpm.1\">10.17632/nw68fxzjpm.1</a>.","chicago":"Etheridge, Alison, and Nicholas H Barton. “Data for: Establishment in a New Habitat by Polygenic Adaptation.” Mendeley Data, 2017. <a href=\"https://doi.org/10.17632/nw68fxzjpm.1\">https://doi.org/10.17632/nw68fxzjpm.1</a>.","ieee":"A. Etheridge and N. H. Barton, “Data for: Establishment in a new habitat by polygenic adaptation.” Mendeley Data, 2017."},"title":"Data for: Establishment in a new habitat by polygenic adaptation","day":"29","date_updated":"2025-04-15T07:11:04Z","date_created":"2021-08-09T13:18:55Z","author":[{"first_name":"Alison","full_name":"Etheridge, Alison","last_name":"Etheridge"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H"}],"date_published":"2017-12-29T00:00:00Z","month":"12","oa":1},{"publication":"Mathematics of Computation","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"642","type":"journal_article","page":"2373 - 2397","publication_identifier":{"issn":["0025-5718"]},"volume":86,"isi":1,"department":[{"_id":"JaMa"}],"intvolume":"        86","status":"public","corr_author":"1","oa_version":"Submitted Version","scopus_import":"1","oa":1,"quality_controlled":"1","author":[{"id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Gerencser","full_name":"Gerencser, Mate","first_name":"Mate"},{"first_name":"István","last_name":"Gyöngy","full_name":"Gyöngy, István"}],"date_created":"2018-12-11T11:47:40Z","publist_id":"7144","issue":"307","title":"Localization errors in solving stochastic partial differential equations in the whole space","external_id":{"arxiv":["1508.05535"],"isi":["000400929100013"]},"arxiv":1,"publisher":"American Mathematical Society","article_processing_charge":"No","year":"2017","abstract":[{"lang":"eng","text":"Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius R. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretization, and thus is fully implementable."}],"publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/1508.05535","open_access":"1"}],"doi":"10.1090/mcom/3201","date_published":"2017-01-01T00:00:00Z","month":"01","date_updated":"2025-09-11T07:20:20Z","citation":{"short":"M. Gerencser, I. Gyöngy, Mathematics of Computation 86 (2017) 2373–2397.","apa":"Gerencser, M., &#38; Gyöngy, I. (2017). Localization errors in solving stochastic partial differential equations in the whole space. <i>Mathematics of Computation</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/mcom/3201\">https://doi.org/10.1090/mcom/3201</a>","ama":"Gerencser M, Gyöngy I. Localization errors in solving stochastic partial differential equations in the whole space. <i>Mathematics of Computation</i>. 2017;86(307):2373-2397. doi:<a href=\"https://doi.org/10.1090/mcom/3201\">10.1090/mcom/3201</a>","mla":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” <i>Mathematics of Computation</i>, vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:<a href=\"https://doi.org/10.1090/mcom/3201\">10.1090/mcom/3201</a>.","ista":"Gerencser M, Gyöngy I. 2017. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 86(307), 2373–2397.","chicago":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” <i>Mathematics of Computation</i>. American Mathematical Society, 2017. <a href=\"https://doi.org/10.1090/mcom/3201\">https://doi.org/10.1090/mcom/3201</a>.","ieee":"M. Gerencser and I. Gyöngy, “Localization errors in solving stochastic partial differential equations in the whole space,” <i>Mathematics of Computation</i>, vol. 86, no. 307. American Mathematical Society, pp. 2373–2397, 2017."},"day":"01","language":[{"iso":"eng"}]},{"related_material":{"record":[{"relation":"later_version","id":"133","status":"public"}]},"status":"public","ddc":["000"],"oa_version":"Published Version","doi":"10.15479/AT:IST-2018-853-v2-2","file_date_updated":"2020-07-14T12:47:30Z","department":[{"_id":"ToHe"}],"year":"2017","alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","abstract":[{"lang":"eng","text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs."}],"type":"technical_report","publication_status":"published","page":"28","publication_identifier":{"issn":["2664-1690"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6426","language":[{"iso":"eng"}],"publisher":"IST Austria","citation":{"apa":"Henzinger, T. A., Kragl, B., &#38; Qadeer, S. (2017). <i>Synchronizing the asynchronous</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">https://doi.org/10.15479/AT:IST-2018-853-v2-2</a>","short":"T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.","chicago":"Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. <i>Synchronizing the Asynchronous</i>. IST Austria, 2017. <a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">https://doi.org/10.15479/AT:IST-2018-853-v2-2</a>.","ieee":"T. A. Henzinger, B. Kragl, and S. Qadeer, <i>Synchronizing the asynchronous</i>. IST Austria, 2017.","ista":"Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.","mla":"Henzinger, Thomas A., et al. <i>Synchronizing the Asynchronous</i>. IST Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">10.15479/AT:IST-2018-853-v2-2</a>.","ama":"Henzinger TA, Kragl B, Qadeer S. <i>Synchronizing the Asynchronous</i>. IST Austria; 2017. doi:<a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">10.15479/AT:IST-2018-853-v2-2</a>"},"title":"Synchronizing the asynchronous","day":"04","date_updated":"2025-04-15T08:11:53Z","date_created":"2019-05-13T08:15:55Z","date_published":"2017-08-04T00:00:00Z","oa":1,"month":"08","file":[{"access_level":"open_access","file_id":"6431","relation":"main_file","content_type":"application/pdf","checksum":"b48d42725182d7ca10107a118815f4cf","date_created":"2019-05-13T08:14:44Z","creator":"dernst","file_size":971347,"date_updated":"2020-07-14T12:47:30Z","file_name":"main(1).pdf"}],"author":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Bernhard","last_name":"Kragl","full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}]},{"title":"Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats","issue":"4","external_id":{"pmid":["28847140"],"isi":["000409566300002"]},"publisher":"Chinese Physiological Society","pmid":1,"quality_controlled":"1","author":[{"last_name":"Sun","full_name":"Sun, Wuping","first_name":"Wuping"},{"id":"34009CFA-F248-11E8-B48F-1D18A9856A87","full_name":"Zhai, Ming-Zhu","last_name":"Zhai","first_name":"Ming-Zhu"},{"first_name":"Qian","last_name":"Zhou","full_name":"Zhou, Qian"},{"first_name":"Chengrui","last_name":"Qian","full_name":"Qian, Chengrui"},{"first_name":"Changyu","last_name":"Jiang","full_name":"Jiang, Changyu"}],"date_created":"2018-12-11T11:47:40Z","publist_id":"7142","isi":1,"intvolume":"        60","department":[{"_id":"RySh"}],"oa_version":"None","status":"public","ddc":["570"],"scopus_import":"1","publication":"Chinese Journal of Physiology","_id":"643","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","publication_identifier":{"issn":["0304-4920"]},"volume":60,"page":"207 - 214","day":"31","citation":{"ama":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. <i>Chinese Journal of Physiology</i>. 2017;60(4):207-214. doi:<a href=\"https://doi.org/10.4077/CJP.2017.BAF469\">10.4077/CJP.2017.BAF469</a>","mla":"Sun, Wuping, et al. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” <i>Chinese Journal of Physiology</i>, vol. 60, no. 4, Chinese Physiological Society, 2017, pp. 207–14, doi:<a href=\"https://doi.org/10.4077/CJP.2017.BAF469\">10.4077/CJP.2017.BAF469</a>.","ista":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. 2017. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 60(4), 207–214.","ieee":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, and C. Jiang, “Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats,” <i>Chinese Journal of Physiology</i>, vol. 60, no. 4. Chinese Physiological Society, pp. 207–214, 2017.","chicago":"Sun, Wuping, Ming-Zhu Zhai, Qian Zhou, Chengrui Qian, and Changyu Jiang. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” <i>Chinese Journal of Physiology</i>. Chinese Physiological Society, 2017. <a href=\"https://doi.org/10.4077/CJP.2017.BAF469\">https://doi.org/10.4077/CJP.2017.BAF469</a>.","short":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, C. Jiang, Chinese Journal of Physiology 60 (2017) 207–214.","apa":"Sun, W., Zhai, M.-Z., Zhou, Q., Qian, C., &#38; Jiang, C. (2017). Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. <i>Chinese Journal of Physiology</i>. Chinese Physiological Society. <a href=\"https://doi.org/10.4077/CJP.2017.BAF469\">https://doi.org/10.4077/CJP.2017.BAF469</a>"},"language":[{"iso":"eng"}],"month":"08","date_published":"2017-08-31T00:00:00Z","date_updated":"2025-09-11T07:19:13Z","doi":"10.4077/CJP.2017.BAF469","article_type":"original","article_processing_charge":"No","OA_type":"closed access","abstract":[{"lang":"eng","text":"It has been reported that nicotinamide-overload induces oxidative stress associated with insulin resistance, the key feature of type 2 diabetes mellitus (T2DM). This study aimed to investigate the effects of B vitamins in T2DM. Glucose tolerance tests (GTT) were carried out in adult Sprague-Dawley rats treated with or without cumulative doses of B vitamins. More specifically, insulin tolerance tests (ITT) were also carried out in adult Sprague-Dawley rats treated with or without cumulative doses of Vitamin B3. We found that cumulative Vitamin B1 and Vitamin B3 administration significantly increased the plasma H2O2 levels associated with high insulin levels. Only Vitamin B3 reduced muscular and hepatic glycogen contents. Cumulative administration of nicotinic acid, another form of Vitamin B3, also significantly increased plasma insulin level and H2O2 generation. Moreover, cumulative administration of nicotinic acid or nicotinamide impaired glucose metabolism. This study suggested that excess Vitamin B1 and Vitamin B3 caused oxidative stress and insulin resistance."}],"year":"2017","publication_status":"published"},{"citation":{"ista":"Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.","chicago":"Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” <i>SIAM Journal on Computing</i>. SIAM, 2017. <a href=\"https://doi.org/10.1137/16M1091836\">https://doi.org/10.1137/16M1091836</a>.","ieee":"V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” <i>SIAM Journal on Computing</i>, vol. 46, no. 3. SIAM, pp. 1087–1110, 2017.","ama":"Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. <i>SIAM Journal on Computing</i>. 2017;46(3):1087-1110. doi:<a href=\"https://doi.org/10.1137/16M1091836\">10.1137/16M1091836</a>","mla":"Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” <i>SIAM Journal on Computing</i>, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:<a href=\"https://doi.org/10.1137/16M1091836\">10.1137/16M1091836</a>.","apa":"Kolmogorov, V., Krokhin, A., &#38; Rolinek, M. (2017). The complexity of general-valued CSPs. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/16M1091836\">https://doi.org/10.1137/16M1091836</a>","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110."},"day":"29","language":[{"iso":"eng"}],"date_published":"2017-06-29T00:00:00Z","month":"06","ec_funded":1,"date_updated":"2025-09-23T13:45:56Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1502.07327"}],"doi":"10.1137/16M1091836","article_processing_charge":"No","year":"2017","abstract":[{"lang":"eng","text":"An instance of the valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P 6= NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in f0;1g corresponds to ordinary CSPs, where one deals only with the feasibility issue, and there is no optimization. This case is the subject of the algebraic CSP dichotomy conjecture predicting for which constraint languages CSPs are tractable (i.e., solvable in polynomial time) and for which they are NP-hard. The case when all allowed functions take only finite values corresponds to a finitevalued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Živný. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e., the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs."}],"publication_status":"published","issue":"3","title":"The complexity of general-valued CSPs","arxiv":1,"external_id":{"arxiv":["1502.07327"],"isi":["000404774300010"]},"publisher":"SIAM","oa":1,"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"},{"first_name":"Andrei","full_name":"Krokhin, Andrei","last_name":"Krokhin"},{"id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","full_name":"Rolinek, Michal","last_name":"Rolinek"}],"quality_controlled":"1","date_created":"2018-12-11T11:47:40Z","project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"publist_id":"7138","isi":1,"department":[{"_id":"VlKo"}],"intvolume":"        46","status":"public","related_material":{"record":[{"relation":"other","status":"public","id":"1637"}]},"oa_version":"Preprint","scopus_import":"1","publication":"SIAM Journal on Computing","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"644","type":"journal_article","volume":46,"page":"1087 - 1110"},{"date_published":"2017-07-13T00:00:00Z","month":"07","ec_funded":1,"date_updated":"2025-09-11T07:18:04Z","citation":{"chicago":"Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">https://doi.org/10.1007/978-3-319-63387-9_10</a>.","ieee":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.","ista":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.","mla":"Ashok, Pranav, et al. <i>Value Iteration for Long Run Average Reward in Markov Decision Processes</i>. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:<a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">10.1007/978-3-319-63387-9_10</a>.","ama":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi:<a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">10.1007/978-3-319-63387-9_10</a>","apa":"Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., &#38; Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar &#38; V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">https://doi.org/10.1007/978-3-319-63387-9_10</a>","short":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221."},"day":"13","language":[{"iso":"eng"}],"article_processing_charge":"No","alternative_title":["LNCS"],"year":"2017","abstract":[{"text":"Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalism for expressing long term performance. Value iteration (VI) is one of the simplest and most efficient algorithmic approaches to MDPs with other properties, such as reachability objectives. Unfortunately, a naive extension of VI does not work for MDPs with long-run average rewards, as there is no known stopping criterion. In this work our contributions are threefold. (1) We refute a conjecture related to stopping criteria for MDPs with long-run average rewards. (2) We present two practical algorithms for MDPs with long-run average rewards based on VI. First, we show that a combination of applying VI locally for each maximal end-component (MEC) and VI for reachability objectives can provide approximation guarantees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3) Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several benchmarks.","lang":"eng"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02326"}],"doi":"10.1007/978-3-319-63387-9_10","oa":1,"quality_controlled":"1","author":[{"last_name":"Ashok","full_name":"Ashok, Pranav","first_name":"Pranav"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan"},{"last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","first_name":"Tobias"}],"editor":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"first_name":"Viktor","last_name":"Kunčak","full_name":"Kunčak, Viktor"}],"date_created":"2018-12-11T11:47:41Z","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_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"}],"publist_id":"7135","title":"Value iteration for long run average reward in markov decision processes","arxiv":1,"external_id":{"arxiv":["1705.02326"],"isi":["000432196400010"]},"publisher":"Springer","conference":{"location":"Heidelberg, Germany","end_date":"2017-07-28","start_date":"2017-07-24","name":"CAV: Computer Aided Verification"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"645","type":"conference","page":"201 - 221","volume":10426,"publication_identifier":{"isbn":["978-331963386-2"]},"isi":1,"department":[{"_id":"KrCh"}],"intvolume":"     10426","status":"public","oa_version":"Submitted Version","scopus_import":"1"},{"language":[{"iso":"eng"}],"citation":{"apa":"Kuske, J., Swoboda, P., &#38; Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, &#38; A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">https://doi.org/10.1007/978-3-319-58771-4_19</a>","short":"J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.","ista":"Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.","chicago":"Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">https://doi.org/10.1007/978-3-319-58771-4_19</a>.","ieee":"J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.","ama":"Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">10.1007/978-3-319-58771-4_19</a>","mla":"Kuske, Jan, et al. <i>A Novel Convex Relaxation for Non Binary Discrete Tomography</i>. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">10.1007/978-3-319-58771-4_19</a>."},"day":"01","date_updated":"2025-09-11T07:16:00Z","date_published":"2017-06-01T00:00:00Z","month":"06","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.03769"}],"doi":"10.1007/978-3-319-58771-4_19","year":"2017","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations."}],"publication_status":"published","article_processing_charge":"No","publisher":"Springer","conference":{"end_date":"2017-06-08","start_date":"2017-06-04","location":"Kolding, Denmark","name":"SSVM: Scale Space and Variational Methods in Computer Vision"},"title":"A novel convex relaxation for non binary discrete tomography","arxiv":1,"external_id":{"arxiv":["1703.03769"],"isi":["000432210900019"]},"date_created":"2018-12-11T11:47:41Z","publist_id":"7132","project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"oa":1,"editor":[{"first_name":"François","full_name":"Lauze, François","last_name":"Lauze"},{"first_name":"Yiqiu","last_name":"Dong","full_name":"Dong, Yiqiu"},{"first_name":"Anders","full_name":"Bjorholm Dahl, Anders","last_name":"Bjorholm Dahl"}],"quality_controlled":"1","author":[{"first_name":"Jan","last_name":"Kuske","full_name":"Kuske, Jan"},{"id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","last_name":"Swoboda","full_name":"Swoboda, Paul"},{"first_name":"Stefanie","last_name":"Petra","full_name":"Petra, Stefanie"}],"status":"public","oa_version":"Submitted Version","scopus_import":"1","isi":1,"department":[{"_id":"VlKo"}],"intvolume":"     10302","type":"conference","publication_identifier":{"isbn":["978-331958770-7"]},"page":"235 - 246","volume":10302,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"646"},{"doi":"10.1007/978-3-319-65765-3_7","article_processing_charge":"No","alternative_title":["LNCS"],"year":"2017","abstract":[{"lang":"eng","text":"Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for the abstraction. In this paper, we propose an approach to constructing a new kind of abstraction called conic abstraction for affine hybrid systems, and to computing reachable sets based on this abstraction. The essential feature of a conic abstraction is that it partitions the state space of a system into a set of convex polyhedral cones which is derived from a uniform conic partition of the derivative space. Such a set of polyhedral cones is able to cut all trajectories of the system into almost straight segments so that every segment of a reach pipe in a polyhedral cone tends to be straight as well, and hence can be over-approximated tightly by polyhedra using similar techniques as HyTech or PHAVer. In particular, for diagonalizable affine systems, our approach can guarantee to find an invariant for unbounded reachable sets, which is beyond the capability of bounded-time reachability analysis tools. We implemented the approach in a tool and experiments on benchmarks show that our approach is more powerful than SpaceEx and PHAVer in dealing with diagonalizable systems."}],"publication_status":"published","citation":{"chicago":"Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">https://doi.org/10.1007/978-3-319-65765-3_7</a>.","ieee":"S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.","ista":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 116–132.","mla":"Bogomolov, Sergiy, et al. <i>Conic Abstractions for Hybrid Systems</i>. Vol. 10419, Springer, 2017, pp. 116–32, doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">10.1007/978-3-319-65765-3_7</a>.","ama":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid systems. In: Vol 10419. Springer; 2017:116-132. doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">10.1007/978-3-319-65765-3_7</a>","apa":"Bogomolov, S., Giacobbe, M., Henzinger, T. A., &#38; Kong, H. (2017). Conic abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">https://doi.org/10.1007/978-3-319-65765-3_7</a>","short":"S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017, pp. 116–132."},"day":"01","language":[{"iso":"eng"}],"date_published":"2017-09-01T00:00:00Z","month":"09","file":[{"access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"4956","date_updated":"2020-07-14T12:47:31Z","file_size":3806864,"creator":"system","checksum":"faf546914ba29bcf9974ee36b6b16750","date_created":"2018-12-12T10:12:38Z","file_name":"IST-2017-831-v1+1_main.pdf"}],"date_updated":"2026-04-08T07:47:13Z","file_date_updated":"2020-07-14T12:47:31Z","isi":1,"department":[{"_id":"ToHe"}],"ddc":["005"],"related_material":{"record":[{"id":"6894","status":"public","relation":"dissertation_contains"}]},"corr_author":"1","status":"public","oa_version":"Submitted Version","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"647","pubrep_id":"831","has_accepted_license":"1","type":"conference","volume":"10419 ","publication_identifier":{"isbn":["978-331965764-6"]},"page":"116 - 132","title":"Conic abstractions for hybrid systems","external_id":{"isi":["000611678300007"]},"publisher":"Springer","conference":{"location":"Berlin, Germany","end_date":"2017-09-07","start_date":"2017-09-05","name":"FORMATS: Formal Modelling and Analysis of Timed Systems"},"oa":1,"quality_controlled":"1","author":[{"first_name":"Sergiy","full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365"},{"id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","last_name":"Giacobbe","first_name":"Mirco"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3066-6941","last_name":"Kong","full_name":"Kong, Hui","first_name":"Hui"}],"date_created":"2018-12-11T11:47:41Z","project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publist_id":"7129"},{"conference":{"name":"TAMC: Theory and Applications of Models of Computation","start_date":"2017-04-20","end_date":"2017-04-22","location":"Bern, Switzerland"},"publisher":"Springer","title":"On the complexity of breaking pseudoentropy","external_id":{"isi":["000425175500043"]},"date_created":"2018-12-11T11:47:42Z","publist_id":"7125","oa":1,"quality_controlled":"1","author":[{"first_name":"Maciej","last_name":"Skórski","full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD"}],"editor":[{"first_name":"Gerhard","last_name":"Jäger","full_name":"Jäger, Gerhard"},{"last_name":"Steila","full_name":"Steila, Silvia","first_name":"Silvia"}],"oa_version":"Submitted Version","status":"public","corr_author":"1","scopus_import":"1","isi":1,"intvolume":"     10185","department":[{"_id":"KrPi"}],"type":"conference","publication_identifier":{"isbn":["978-331955910-0"]},"volume":10185,"page":"600 - 613","_id":"648","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"day":"01","citation":{"ieee":"M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 600–613.","chicago":"Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.” edited by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">https://doi.org/10.1007/978-3-319-55911-7_43</a>.","ista":"Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 600–613.","mla":"Skórski, Maciej. <i>On the Complexity of Breaking Pseudoentropy</i>. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:<a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">10.1007/978-3-319-55911-7_43</a>.","ama":"Skórski M. On the complexity of breaking pseudoentropy. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:600-613. doi:<a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">10.1007/978-3-319-55911-7_43</a>","apa":"Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger &#38; S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">https://doi.org/10.1007/978-3-319-55911-7_43</a>","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613."},"date_updated":"2025-09-11T07:14:42Z","month":"04","date_published":"2017-04-01T00:00:00Z","main_file_link":[{"url":"https://eprint.iacr.org/2016/1186.pdf","open_access":"1"}],"doi":"10.1007/978-3-319-55911-7_43","abstract":[{"lang":"eng","text":"Pseudoentropy has found a lot of important applications to cryptography and complexity theory. In this paper we focus on the foundational problem that has not been investigated so far, namely by how much pseudoentropy (the amount seen by computationally bounded attackers) differs from its information-theoretic counterpart (seen by unbounded observers), given certain limits on attacker’s computational power? We provide the following answer for HILL pseudoentropy, which exhibits a threshold behavior around the size exponential in the entropy amount:– If the attacker size (s) and advantage () satisfy s (formula presented) where k is the claimed amount of pseudoentropy, then the pseudoentropy boils down to the information-theoretic smooth entropy. – If s (formula presented) then pseudoentropy could be arbitrarily bigger than the information-theoretic smooth entropy. Besides answering the posted question, we show an elegant application of our result to the complexity theory, namely that it implies the clas-sical result on the existence of functions hard to approximate (due to Pippenger). In our approach we utilize non-constructive techniques: the duality of linear programming and the probabilistic method."}],"year":"2017","alternative_title":["LNCS"],"publication_status":"published","article_processing_charge":"No"}]