@inproceedings{11850,
  abstract     = {Modern networked systems are increasingly reconfigurable, enabling demand-aware infrastructures whose resources can be adjusted according to the workload they currently serve. Such dynamic adjustments can be exploited to improve network utilization and hence performance, by moving frequently interacting communication partners closer, e.g., collocating them in the same server or datacenter. However, dynamically changing the embedding of workloads is algorithmically challenging: communication patterns are often not known ahead of time, but must be learned. During the learning process, overheads related to unnecessary moves (i.e., re-embeddings) should be minimized. This paper studies a fundamental model which captures the tradeoff between the benefits and costs of dynamically collocating communication partners on l servers, in an online manner. Our main contribution is a distributed online algorithm which is asymptotically almost optimal, i.e., almost matches the lower bound (also derived in this paper) on the competitive ratio of any (distributed or centralized) online algorithm.},
  author       = {Henzinger, Monika H and Neumann, Stefan and Schmid, Stefan},
  booktitle    = {SIGMETRICS'19: International Conference on Measurement and Modeling of Computer Systems},
  isbn         = {978-1-4503-6678-6},
  location     = {Phoenix, AZ, United States},
  pages        = {43–44},
  publisher    = {Association for Computing Machinery},
  title        = {{Efficient distributed workload (re-)embedding}},
  doi          = {10.1145/3309697.3331503},
  year         = {2019},
}

@inproceedings{11853,
  abstract     = {We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f)) -approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log (Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15]. In contrast, the only result that guaranteed O(f) -approximation was obtained very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with (1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta~et~al.'s results, the Abboud~et~al.~algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed.},
  author       = {Bhattacharya, Sayan and Henzinger, Monika H and Nanongkai, Danupon},
  booktitle    = {60th Annual Symposium on Foundations of Computer Science},
  isbn         = {978-1-7281-4953-0},
  issn         = {2575-8454},
  location     = {Baltimore, MD, United States},
  pages        = {406--423},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{A new deterministic algorithm for dynamic set cover}},
  doi          = {10.1109/focs.2019.00033},
  year         = {2019},
}

@inproceedings{11865,
  abstract     = {We present the first sublinear-time algorithm that can compute the edge connectivity λ of a network exactly on distributed message-passing networks (the CONGEST model), as long as the network contains no multi-edge. We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ with high probability, where n and D are the number of nodes and the diameter of the network, respectively, and Õ hides polylogarithmic factors. This running time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14] or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve this we develop and combine several new techniques. First, we design the first distributed algorithm that can compute a k-edge connectivity certificate for any k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the first parallel algorithm with polylogarithmic depth and near-linear work. Previous near-linear work algorithms are essentially sequential and previous polylogarithmic-depth algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]). Second, we show that by combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15], we can decompose the network into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the “trivial” ones). This leads to a simplification of the Kawarabayashi-Thorup framework (except that we are randomized while they are deterministic). This might make this framework more useful in other models of computation. Finally, by extending the tree packing technique from [Karger STOC’96], we can find the minimum cut in time proportional to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time algorithm for computing exact minimum cut for weighted graphs.},
  author       = {Daga, Mohit and Henzinger, Monika H and Nanongkai, Danupon and Saranurak, Thatchaphol},
  booktitle    = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing},
  isbn         = {978-1-4503-6705-9},
  issn         = {0737-8017},
  location     = {Phoenix, AZ, United States},
  pages        = {343–354},
  publisher    = {Association for Computing Machinery},
  title        = {{Distributed edge connectivity in sublinear time}},
  doi          = {10.1145/3313276.3316346},
  year         = {2019},
}

@inproceedings{11871,
  abstract     = {Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim to provide a guarantee stronger than amortized expected. The strongest possible guarantee for a randomized algorithm is that it is always correct (Las Vegas), and has high-probability worst-case update time, which gives a bound on the time for each individual operation that holds with high probability.

In this paper we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem.

1.	
For dynamic spanner, the only known o(n) worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining a 3-spanner, and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3(n) high-probability worst-case time bound for maintaining a (2k – 1)-spanner, which yields the first worst-case polylog update time for all constant k. (All the results above maintain the optimal tradeoff of stretch 2k – 1 and Õ(n1+1/k) edges.)

2.	
For dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm with o(n) worst-case time bound was known and we present an algorithm with O(log5 (n)) high-probability worst-case time; similar worst-case bounds existed only for maintaining a matching that was (2 + ∊)-approximate, and hence not maximal.

Our results are achieved using a new approach for converting amortized guarantees to worst-case ones for randomized data structures by going through a third type of guarantee, which is a middle ground between the two above: an algorithm is said to have worst-case expected update time α if for every update σ, the expected time to process σ is at most α. Although stronger than amortized expected, the worst-case expected guarantee does not resolve the fundamental problem of amortization: a worst-case expected update time of O(1) still allows for the possibility that every 1/f(n) updates requires Θ(f(n)) time to process, for arbitrarily high f(n). In this paper we present a black-box reduction that converts any data structure with worst-case expected update time into one with a high-probability worst-case update time: the query time remains the same, while the update time increases by a factor of O(log2(n)).

Thus we achieve our results in two steps: (1) First we show how to convert existing dynamic graph algorithms with amortized expected polylogarithmic running times into algorithms with worst-case expected polylogarithmic running times. (2) Then we use our black-box reduction to achieve the polylogarithmic high-probability worst-case time bound. All our algorithms are Las-Vegas-type algorithms.},
  author       = {Bernstein, Aaron and Forster, Sebastian and Henzinger, Monika H},
  booktitle    = {30th Annual ACM-SIAM Symposium on Discrete Algorithms},
  location     = {San Diego, CA, United States},
  pages        = {1899--1918},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{A deamortization approach for dynamic spanner and dynamic maximal matching}},
  doi          = {10.1137/1.9781611975482.115},
  year         = {2019},
}

@article{11898,
  abstract     = {We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12), and Clifford et al. (FOCS'15) to present a general framework that gives amortized lower bounds on the update and query times of dynamic data structures. Using our framework, we present two concrete results.
(1) For the dynamic polynomial evaluation problem, where the polynomial is defined over a finite field of size n1+Ω(1) and has degree n, any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω((lgn/lglgn)2).
(2) For the dynamic online matrix vector multiplication problem, where we get an n×n matrix whose entires are drawn from a finite field of size nΘ(1), any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω(n⋅(lgn/lglgn)2).
For these two problems, the previous works by Larsen (FOCS'12) and Clifford et al. (FOCS'15) gave the same lower bounds, but only for worst case update and query times. Our bounds match the highest unconditional lower bounds known till date for any dynamic problem in the cell-probe model.},
  author       = {Bhattacharya, Sayan and Henzinger, Monika H and Neumann, Stefan},
  issn         = {0304-3975},
  journal      = {Theoretical Computer Science},
  pages        = {72--87},
  publisher    = {Elsevier},
  title        = {{New amortized cell-probe lower bounds for dynamic problems}},
  doi          = {10.1016/j.tcs.2019.01.043},
  volume       = {779},
  year         = {2019},
}

@article{11982,
  abstract     = {A carbon nitride material can be combined with homogeneous nickel catalysts for light-mediated cross-couplings of aryl bromides with alcohols under mild conditions. The metal-free heterogeneous semiconductor is fully recyclable and couples a broad range of electron-poor aryl bromides with primary and secondary alcohols as well as water. The application for intramolecular reactions and the synthesis of active pharmaceutical ingredients was demonstrated. The catalytic protocol is applicable for the coupling of aryl iodides with thiols as well.},
  author       = {Cavedon, Cristian and Madani, Amiera and Seeberger, Peter H. and Pieber, Bartholomäus},
  issn         = {1523-7052},
  journal      = {Organic Letters},
  number       = {13},
  pages        = {5331--5334},
  publisher    = {American Chemical Society},
  title        = {{Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides}},
  doi          = {10.1021/acs.orglett.9b01957},
  volume       = {21},
  year         = {2019},
}

@article{11984,
  abstract     = {Differentially protected galactosamine building blocks are key components for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding 2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead to the formation of potentially explosive and toxic species limit the scalability of this reaction and render it a bottleneck for carbohydrate synthesis. Here, we present a method for the safe, efficient, and reliable azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry. Careful analysis of the transformation resulted in reaction conditions that produce minimal side products while the reaction time was reduced drastically when compared to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal in 3 h, producing 1.2 mmol/h of product.},
  author       = {Guberman, Mónica and Pieber, Bartholomäus and Seeberger, Peter H.},
  issn         = {1520-586X},
  journal      = {Organic Process Research and Development},
  number       = {12},
  pages        = {2764--2770},
  publisher    = {American Chemical Society},
  title        = {{Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks}},
  doi          = {10.1021/acs.oprd.9b00456},
  volume       = {23},
  year         = {2019},
}

@article{1215,
  abstract     = {Two generalizations of Itô formula to infinite-dimensional spaces are given.
The first one, in Hilbert spaces, extends the classical one by taking advantage of
cancellations when they occur in examples and it is applied to the case of a group
generator. The second one, based on the previous one and a limit procedure, is an Itô
formula in a special class of Banach spaces having a product structure with the noise
in a Hilbert component; again the key point is the extension due to a cancellation. This
extension to Banach spaces and in particular the specific cancellation are motivated
by path-dependent Itô calculus.},
  author       = {Flandoli, Franco and Russo, Francesco and Zanco, Giovanni A},
  journal      = {Journal of Theoretical Probability},
  number       = {2},
  pages        = {789--826},
  publisher    = {Springer},
  title        = {{Infinite-dimensional calculus under weak spatial regularity of the processes}},
  doi          = {10.1007/s10959-016-0724-2},
  volume       = {31},
  year         = {2018},
}

@article{12603,
  abstract     = {We present a field-data rich modelling analysis to reconstruct the climatic forcing, glacier response, and runoff generation from a high-elevation catchment in central Chile over the period 2000–2015 to provide insights into the differing contributions of debris-covered and debris-free glaciers under current and future changing climatic conditions. Model simulations with the physically based glacio-hydrological model TOPKAPI-ETH reveal a period of neutral or slightly positive mass balance between 2000 and 2010, followed by a transition to increasingly large annual mass losses, associated with a recent mega drought. Mass losses commence earlier, and are more severe, for a heavily debris-covered glacier, most likely due to its strong dependence on snow avalanche accumulation, which has declined in recent years. Catchment runoff shows a marked decreasing trend over the study period, but with high interannual variability directly linked to winter snow accumulation, and high contribution from ice melt in dry periods and drought conditions. The study demonstrates the importance of incorporating local-scale processes such as snow avalanche accumulation and spatially variable debris thickness, in understanding the responses of different glacier types to climate change. We highlight the increased dependency of runoff from high Andean catchments on the diminishing resource of glacier ice during dry years.},
  author       = {Burger, Flavia and Ayala, Alvaro and Farias, David and Shaw, Thomas E. and MacDonell, Shelley and Brock, Ben and McPhee, James and Pellicciotti, Francesca},
  issn         = {1099-1085},
  journal      = {Hydrological Processes},
  keywords     = {Water Science and Technology},
  number       = {2},
  pages        = {214--229},
  publisher    = {Wiley},
  title        = {{Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology}},
  doi          = {10.1002/hyp.13354},
  volume       = {33},
  year         = {2018},
}

@article{12604,
  abstract     = {Glaciers in the high mountains of Asia provide an important water resource for millions of people. Many of these glaciers are partially covered by rocky debris, which protects the ice from solar radiation and warm air. However, studies have found that the surface of these debris-covered glaciers is actually lowering as fast as glaciers without debris. Water ponded on the surface of the glaciers may be partially responsible, as water can absorb atmospheric energy very efficiently. However, the overall effect of these ponds has not been thoroughly assessed yet. We study a valley in Nepal for which we have extensive weather measurements, and we use a numerical model to calculate the energy absorbed by ponds on the surface of the glaciers over 6 months. As we have not observed each individual pond thoroughly, we run the model 5,000 times with different setups. We find that ponds are extremely important for glacier melt and absorb energy 14 times as quickly as the debris-covered ice. Although the ponds account for 1% of the glacier area covered by rocks, and only 0.3% of the total glacier area, they absorb enough energy to account for one eighth of the whole valley's ice loss.},
  author       = {Miles, Evan S. and Willis, Ian and Buri, Pascal and Steiner, Jakob F. and Arnold, Neil S. and Pellicciotti, Francesca},
  issn         = {1944-8007},
  journal      = {Geophysical Research Letters},
  keywords     = {General Earth and Planetary Sciences, Geophysics},
  number       = {19},
  pages        = {10464--10473},
  publisher    = {American Geophysical Union},
  title        = {{Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total catchment ice loss}},
  doi          = {10.1029/2018gl079678},
  volume       = {45},
  year         = {2018},
}

@article{12605,
  abstract     = {Snow depth patterns over glaciers are controlled by precipitation, snow redistribution due to wind and avalanches, and the exchange of energy with the atmosphere that determines snow ablation. While many studies have advanced the understanding of ablation processes, less is known about winter snow patterns and their variability over glaciers. We analyze snow depth on Haut Glacier d'Arolla, Switzerland, in the two winter seasons 2006–2007 and 2010–2011 to (1) understand whether snow depth over an alpine glacier at the end of the accumulation season exhibits a behavior similar to the one observed on single slopes and vegetated areas; and (2) investigate the snow pattern consistency over the two accumulation seasons. We perform this analysis on a data set of high-resolution lidar-derived snow depth using variograms and fractal parameters. Our first main result is that snow depth patterns on the glacier exhibit a multiscale behavior, with a scale break around 20 m after which the fractal dimension increases, indicating more autocorrelated structure before the scale break than after. Second, this behavior is consistent over the two years, with fractal parameters and their spatial variability almost constant in the two seasons. We also show that snow depth patterns exhibit a distinct behavior in the glacier tongue and the upper catchment, with longer correlation distances on the tongue in the direction of the main winds, suggesting spatial distinctions that are likely induced by different processes and that should be taken into account when extrapolating snow depth from limited samples.},
  author       = {Clemenzi, I. and Pellicciotti, Francesca and Burlando, P.},
  issn         = {1944-7973},
  journal      = {Water Resources Research},
  keywords     = {Water Science and Technology},
  number       = {10},
  pages        = {7929--7945},
  publisher    = {American Geophysical Union},
  title        = {{Snow depth structure, fractal behavior, and interannual consistency over Haut Glacier d'Arolla, Switzerland}},
  doi          = {10.1029/2017wr021606},
  volume       = {54},
  year         = {2018},
}

@article{12606,
  abstract     = {Ice cliffs within a supraglacial debris cover have been identified as a source for high ablation relative to the surrounding debris-covered area. Due to their small relative size and steep orientation, ice cliffs are difficult to detect using nadir-looking space borne sensors. The method presented here uses surface slopes calculated from digital elevation model (DEM) data to map ice cliff geometry and produce an ice cliff probability map. Surface slope thresholds, which can be sensitive to geographic location and/or data quality, are selected automatically. The method also attempts to include area at the (often narrowing) ends of ice cliffs which could otherwise be neglected due to signal saturation in surface slope data. The method was calibrated in the eastern Alaska Range, Alaska, USA, against a control ice cliff dataset derived from high-resolution visible and thermal data. Using the same input parameter set that performed best in Alaska, the method was tested against ice cliffs manually mapped in the Khumbu Himal, Nepal. Our results suggest the method can accommodate different glaciological settings and different DEM data sources without a data intensive (high-resolution, multi-data source) recalibration.},
  author       = {Herreid, Sam and Pellicciotti, Francesca},
  issn         = {1994-0424},
  journal      = {The Cryosphere},
  keywords     = {Earth-Surface Processes, Water Science and Technology},
  number       = {5},
  pages        = {1811--1829},
  publisher    = {Copernicus Publications},
  title        = {{Automated detection of ice cliffs within supraglacial debris cover}},
  doi          = {10.5194/tc-12-1811-2018},
  volume       = {12},
  year         = {2018},
}

@article{12607,
  abstract     = {Supraglacial ice cliffs exist on debris-covered glaciers worldwide, but despite their importance as melt hot spots, their life cycle is little understood. Early field observations had advanced a hypothesis of survival of north-facing and disappearance of south-facing cliffs, which is central for predicting the contribution of cliffs to total glacier mass losses. Their role as windows of energy transfer suggests they may explain the anomalously high mass losses of debris-covered glaciers in High Mountain Asia (HMA) despite the insulating debris, currently at the center of a debated controversy. We use a 3D model of cliff evolution coupled to very high-resolution topographic data to demonstrate that ice cliffs facing south (in the Northern Hemisphere) disappear within a few months due to enhanced solar radiation receipts and that aspect is the key control on cliffs evolution. We reproduce continuous flattening of south-facing cliffs, a result of their vertical gradient of incoming solar radiation and sky view factor. Our results establish that only north-facing cliffs are recurrent features and thus stable contributors to the melting of debris-covered glaciers. Satellite observations and mass balance modeling confirms that few south-facing cliffs of small size exist on the glaciers of Langtang, and their contribution to the glacier volume losses is very small (∼1%). This has major implications for the mass balance of HMA debris-covered glaciers as it provides the basis for new parameterizations of cliff evolution and distribution to constrain volume losses in a region where glaciers are highly relevant as water sources for millions of people.},
  author       = {Buri, Pascal and Pellicciotti, Francesca},
  issn         = {1091-6490},
  journal      = {PNAS},
  number       = {17},
  pages        = {4369--4374},
  publisher    = {Proceedings of the National Academy of Sciences},
  title        = {{Aspect controls the survival of ice cliffs on debris-covered glaciers}},
  doi          = {10.1073/pnas.1713892115},
  volume       = {115},
  year         = {2018},
}

@article{13,
  abstract     = {We propose a new method for fabricating digital objects through reusable silicone molds. Molds are generated by casting liquid silicone into custom 3D printed containers called metamolds. Metamolds automatically define the cuts that are needed to extract the cast object from the silicone mold. The shape of metamolds is designed through a novel segmentation technique, which takes into account both geometric and topological constraints involved in the process of mold casting. Our technique is simple, does not require changing the shape or topology of the input objects, and only requires off-the- shelf materials and technologies. We successfully tested our method on a set of challenging examples with complex shapes and rich geometric detail. © 2018 Association for Computing Machinery.},
  author       = {Alderighi, Thomas and Malomo, Luigi and Giorgi, Daniela and Pietroni, Nico and Bickel, Bernd and Cignoni, Paolo},
  journal      = {ACM Trans. Graph.},
  number       = {4},
  publisher    = {ACM},
  title        = {{Metamolds: Computational design of silicone molds}},
  doi          = {10.1145/3197517.3201381},
  volume       = {37},
  year         = {2018},
}

@misc{13055,
  abstract     = {Dataset for manuscript 'Social network plasticity decreases disease transmission in a eusocial insect'
Compared to previous versions: - raw image files added
                                                     - correction of URLs within README.txt file
},
  author       = {Stroeymeyt, Nathalie and Grasse, Anna V and Crespi, Alessandro and Mersch, Danielle and Cremer, Sylvia and Keller, Laurent},
  publisher    = {Zenodo},
  title        = {{Social network plasticity decreases disease transmission in a eusocial insect}},
  doi          = {10.5281/ZENODO.1322669},
  year         = {2018},
}

@misc{13059,
  abstract     = {This dataset contains a GitHub repository containing all the data, analysis, Nextflow workflows and Jupyter notebooks to replicate the manuscript titled "Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method".
It also contains the Multiple Sequence Alignments (MSAs) generated and well as the main figures and tables from the manuscript.
The repository is also available at GitHub (https://github.com/cbcrg/dpa-analysis) release `v1.2`.
For details on how to use the regressive alignment algorithm, see the T-Coffee software suite (https://github.com/cbcrg/tcoffee).},
  author       = {Garriga, Edgar and di Tommaso, Paolo and Magis, Cedrik and Erb, Ionas and Mansouri, Leila and Baltzis, Athanasios and Laayouni, Hafid and Kondrashov, Fyodor and Floden, Evan and Notredame, Cedric},
  publisher    = {Zenodo},
  title        = {{Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method}},
  doi          = {10.5281/ZENODO.2025846},
  year         = {2018},
}

@article{131,
  abstract     = {XY systems usually show chromosome-wide compensation of X-linked genes, while in many ZW systems, compensation is restricted to a minority of dosage-sensitive genes. Why such differences arose is still unclear. Here, we combine comparative genomics, transcriptomics and proteomics to obtain a complete overview of the evolution of gene dosage on the Z-chromosome of Schistosoma parasites. We compare the Z-chromosome gene content of African (Schistosoma mansoni and S. haematobium) and Asian (S. japonicum) schistosomes and describe lineage-specific evolutionary strata. We use these to assess gene expression evolution following sex-linkage. The resulting patterns suggest a reduction in expression of Z-linked genes in females, combined with upregulation of the Z in both sexes, in line with the first step of Ohno’s classic model of dosage compensation evolution. Quantitative proteomics suggest that post-transcriptional mechanisms do not play a major role in balancing the expression of Z-linked genes. },
  author       = {Picard, Marion A and Cosseau, Celine and Ferré, Sabrina and Quack, Thomas and Grevelding, Christoph and Couté, Yohann and Vicoso, Beatriz},
  journal      = {eLife},
  publisher    = {eLife Sciences Publications},
  title        = {{Evolution of gene dosage on the Z-chromosome of schistosome parasites}},
  doi          = {10.7554/eLife.35684},
  volume       = {7},
  year         = {2018},
}

@article{132,
  abstract     = {Pancreas development involves a coordinated process in which an early phase of cell segregation is followed by a longer phase of lineage restriction, expansion, and tissue remodeling. By combining clonal tracing and whole-mount reconstruction with proliferation kinetics and single-cell transcriptional profiling, we define the functional basis of pancreas morphogenesis. We show that the large-scale organization of mouse pancreas can be traced to the activity of self-renewing precursors positioned at the termini of growing ducts, which act collectively to drive serial rounds of stochastic ductal bifurcation balanced by termination. During this phase of branching morphogenesis, multipotent precursors become progressively fate-restricted, giving rise to self-renewing acinar-committed precursors that are conveyed with growing ducts, as well as ductal progenitors that expand the trailing ducts and give rise to delaminating endocrine cells. These findings define quantitatively how the functional behavior and lineage progression of precursor pools determine the large-scale patterning of pancreatic sub-compartments.},
  author       = {Sznurkowska, Magdalena and Hannezo, Edouard B and Azzarelli, Roberta and Rulands, Steffen and Nestorowa, Sonia and Hindley, Christopher and Nichols, Jennifer and Göttgens, Berthold and Huch, Meritxell and Philpott, Anna and Simons, Benjamin},
  journal      = {Developmental Cell},
  number       = {3},
  pages        = {360 -- 375},
  publisher    = {Cell Press},
  title        = {{Defining lineage potential and fate behavior of precursors during pancreas development}},
  doi          = {10.1016/j.devcel.2018.06.028},
  volume       = {46},
  year         = {2018},
}

@inproceedings{133,
  abstract     = {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 computation threads. We present synchronization, a new proof rule that simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Modular verification is enabled via pending asynchronous calls in atomic summaries, and a complementary proof rule that eliminates pending asynchronous calls when components and their specifications are composed. We evaluate synchronization in the context of a multi-layer refinement verification methodology on a collection of benchmark programs.},
  author       = {Kragl, Bernhard and Qadeer, Shaz and Henzinger, Thomas A},
  issn         = {18688969},
  location     = {Beijing, China},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Synchronizing the asynchronous}},
  doi          = {10.4230/LIPIcs.CONCUR.2018.21},
  volume       = {118},
  year         = {2018},
}

@article{82,
  abstract     = {In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage, bacterial cells resistant to the phage commonly emerge and become the dominant population of bacteria. Following the ascent of resistant mutants, the densities of bacteria in these simple communities become limited by resources rather than the phage. Despite the evolution of resistant hosts, upon which the phage cannot replicate, the lytic phage population is most commonly maintained in an apparently stable state with the resistant bacteria. Several mechanisms have been put forward to account for this result. Here we report the results of population dynamic/evolution experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli in serial transfer cultures. We show that, following the ascent of λVIR-resistant bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal media and in all cases in nutrient-rich broth. Using mathematical models and experiments, we show that the dominant mechanism responsible for maintenance of λVIRin these resource-limited populations dominated by resistant E. coli is a high rate of either phenotypic or genetic transition from resistance to susceptibility—a hitherto undemonstrated mechanism we term "leaky resistance." We discuss the implications of leaky resistance to our understanding of the conditions for the maintenance of phage in populations of bacteria—their “existence conditions.”.},
  author       = {Chaudhry, Waqas and Pleska, Maros and Shah, Nilang and Weiss, Howard and Mccall, Ingrid and Meyer, Justin and Gupta, Animesh and Guet, Calin C and Levin, Bruce},
  journal      = {PLoS Biology},
  number       = {8},
  publisher    = {Public Library of Science},
  title        = {{Leaky resistance and the conditions for the existence of lytic bacteriophage}},
  doi          = {10.1371/journal.pbio.2005971},
  volume       = {16},
  year         = {2018},
}