@article{670,
  abstract     = {We propose an efficient method to model paper tearing in the context of interactive modeling. The method uses geometrical information to automatically detect potential starting points of tears. We further introduce a new hybrid geometrical and physical-based method to compute the trajectory of tears while procedurally synthesizing high resolution details of the tearing path using a texture based approach. The results obtained are compared with real paper and with previous studies on the expected geometric paths of paper that tears.},
  author       = {Schreck, Camille and Rohmer, Damien and Hahmann, Stefanie},
  issn         = {01677055},
  journal      = {Computer Graphics Forum},
  number       = {2},
  pages        = {95 -- 106},
  publisher    = {Wiley},
  title        = {{Interactive paper tearing}},
  doi          = {10.1111/cgf.13110},
  volume       = {36},
  year         = {2017},
}

@article{671,
  abstract     = {Humans routinely use conditionally cooperative strategies when interacting in repeated social dilemmas. They are more likely to cooperate if others cooperated before, and are ready to retaliate if others defected. To capture the emergence of reciprocity, most previous models consider subjects who can only choose from a restricted set of representative strategies, or who react to the outcome of the very last round only. As players memorize more rounds, the dimension of the strategy space increases exponentially. This increasing computational complexity renders simulations for individuals with higher cognitive abilities infeasible, especially if multiplayer interactions are taken into account. Here, we take an axiomatic approach instead. We propose several properties that a robust cooperative strategy for a repeated multiplayer dilemma should have. These properties naturally lead to a unique class of cooperative strategies, which contains the classical Win-Stay Lose-Shift rule as a special case. A comprehensive numerical analysis for the prisoner's dilemma and for the public goods game suggests that strategies of this class readily evolve across various memory-n spaces. Our results reveal that successful strategies depend not only on how cooperative others were in the past but also on the respective context of cooperation.},
  author       = {Hilbe, Christian and Martinez, Vaquero and Chatterjee, Krishnendu and Nowak, Martin},
  issn         = {0027-8424},
  journal      = {PNAS},
  number       = {18},
  pages        = {4715 -- 4720},
  publisher    = {National Academy of Sciences},
  title        = {{Memory-n strategies of direct reciprocity}},
  doi          = {10.1073/pnas.1621239114},
  volume       = {114},
  year         = {2017},
}

@article{672,
  abstract     = {Trafficking cells frequently transmigrate through epithelial and endothelial monolayers. How monolayers cooperate with the penetrating cells to support their transit is poorly understood. We studied dendritic cell (DC) entry into lymphatic capillaries as a model system for transendothelial migration. We find that the chemokine CCL21, which is the decisive guidance cue for intravasation, mainly localizes in the trans-Golgi network and intracellular vesicles of lymphatic endothelial cells. Upon DC transmigration, these Golgi deposits disperse and CCL21 becomes extracellularly enriched at the sites of endothelial cell-cell junctions. When we reconstitute the transmigration process in vitro, we find that secretion of CCL21-positive vesicles is triggered by a DC contact-induced calcium signal, and selective calcium chelation in lymphatic endothelium attenuates transmigration. Altogether, our data demonstrate a chemokine-mediated feedback between DCs and lymphatic endothelium, which facilitates transendothelial migration.},
  author       = {Vaahtomeri, Kari and Brown, Markus and Hauschild, Robert and De Vries, Ingrid and Leithner, Alexander F and Mehling, Matthias and Kaufmann, Walter and Sixt, Michael K},
  issn         = {2211-1247},
  journal      = {Cell Reports},
  number       = {5},
  pages        = {902 -- 909},
  publisher    = {Cell Press},
  title        = {{Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia}},
  doi          = {10.1016/j.celrep.2017.04.027},
  volume       = {19},
  year         = {2017},
}

@article{673,
  abstract     = {We present a numerical study of wavy supercritical cylindrical Couette flow between counter-rotating cylinders in which the wavy pattern propagates either prograde with the inner cylinder or retrograde opposite the rotation of the inner cylinder. The wave propagation reversals from prograde to retrograde and vice versa occur at distinct values of the inner cylinder Reynolds number when the associated frequency of the wavy instability vanishes. The reversal occurs for both twofold and threefold symmetric wavy vortices. Moreover, the wave propagation reversal only occurs for sufficiently strong counter-rotation. The flow pattern reversal appears to be intrinsic in the system as either periodic boundary conditions or fixed end wall boundary conditions for different system sizes always result in the wave propagation reversal. We present a detailed bifurcation sequence and parameter space diagram with respect to retrograde behavior of wavy flows. The retrograde propagation of the instability occurs when the inner Reynolds number is about two times the outer Reynolds number. The mechanism for the retrograde propagation is associated with the inviscidly unstable region near the inner cylinder and the direction of the global average azimuthal velocity. Flow dynamics, spatio-temporal behavior, global mean angular velocity, and torque of the flow with the wavy pattern are explored.},
  author       = {Altmeyer, Sebastian and Lueptow, Richard},
  issn         = {2470-0045},
  journal      = {Physical Review E},
  number       = {5},
  publisher    = {American Physical Society},
  title        = {{Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow}},
  doi          = {10.1103/PhysRevE.95.053103},
  volume       = {95},
  year         = {2017},
}

@article{674,
  abstract     = {Navigation of cells along gradients of guidance cues is a determining step in many developmental and immunological processes. Gradients can either be soluble or immobilized to tissues as demonstrated for the haptotactic migration of dendritic cells (DCs) toward higher concentrations of immobilized chemokine CCL21. To elucidate how gradient characteristics govern cellular response patterns, we here introduce an in vitro system allowing to track migratory responses of DCs to precisely controlled immobilized gradients of CCL21. We find that haptotactic sensing depends on the absolute CCL21 concentration and local steepness of the gradient, consistent with a scenario where DC directionality is governed by the signal-to-noise ratio of CCL21 binding to the receptor CCR7. We find that the conditions for optimal DC guidance are perfectly provided by the CCL21 gradients we measure in vivo. Furthermore, we find that CCR7 signal termination by the G-protein-coupled receptor kinase 6 (GRK6) is crucial for haptotactic but dispensable for chemotactic CCL21 gradient sensing in vitro and confirm those observations in vivo. These findings suggest that stable, tissue-bound CCL21 gradients as sustainable “roads” ensure optimal guidance in vivo.},
  author       = {Schwarz, Jan and Bierbaum, Veronika and Vaahtomeri, Kari and Hauschild, Robert and Brown, Markus and De Vries, Ingrid and Leithner, Alexander F and Reversat, Anne and Merrin, Jack and Tarrant, Teresa and Bollenbach, Tobias and Sixt, Michael K},
  issn         = {09609822},
  journal      = {Current Biology},
  number       = {9},
  pages        = {1314 -- 1325},
  publisher    = {Cell Press},
  title        = {{Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6}},
  doi          = {10.1016/j.cub.2017.04.004},
  volume       = {27},
  year         = {2017},
}

@article{677,
  abstract     = {The INO80 complex (INO80-C) is an evolutionarily conserved nucleosome remodeler that acts in transcription, replication, and genome stability. It is required for resistance against genotoxic agents and is involved in the repair of DNA double-strand breaks (DSBs) by homologous recombination (HR). However, the causes of the HR defect in INO80-C mutant cells are controversial. Here, we unite previous findings using a system to study HR with high spatial resolution in budding yeast. We find that INO80-C has at least two distinct functions during HR—DNA end resection and presynaptic filament formation. Importantly, the second function is linked to the histone variant H2A.Z. In the absence of H2A.Z, presynaptic filament formation and HR are restored in INO80-C-deficient mutants, suggesting that presynaptic filament formation is the crucial INO80-C function during HR.},
  author       = {Lademann, Claudio and Renkawitz, Jörg and Pfander, Boris and Jentsch, Stefan},
  issn         = {2211-1247},
  journal      = {Cell Reports},
  number       = {7},
  pages        = {1294 -- 1303},
  publisher    = {Cell Press},
  title        = {{The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination}},
  doi          = {10.1016/j.celrep.2017.04.051},
  volume       = {19},
  year         = {2017},
}

@article{678,
  abstract     = {The seminal observation that mechanical signals can elicit changes in biochemical signalling within cells, a process commonly termed mechanosensation and mechanotransduction, has revolutionized our understanding of the role of cell mechanics in various fundamental biological processes, such as cell motility, adhesion, proliferation and differentiation. In this Review, we will discuss how the interplay and feedback between mechanical and biochemical signals control tissue morphogenesis and cell fate specification in embryonic development.},
  author       = {Petridou, Nicoletta and Spiro, Zoltan P and Heisenberg, Carl-Philipp J},
  issn         = {1465-7392},
  journal      = {Nature Cell Biology},
  number       = {6},
  pages        = {581 -- 588},
  publisher    = {Nature Publishing Group},
  title        = {{Multiscale force sensing in development}},
  doi          = {10.1038/ncb3524},
  volume       = {19},
  year         = {2017},
}

@article{680,
  abstract     = {In order to respond reliably to specific features of their environment, sensory neurons need to integrate multiple incoming noisy signals. Crucially, they also need to compete for the interpretation of those signals with other neurons representing similar features. The form that this competition should take depends critically on the noise corrupting these signals. In this study we show that for the type of noise commonly observed in sensory systems, whose variance scales with the mean signal, sensory neurons should selectively divide their input signals by their predictions, suppressing ambiguous cues while amplifying others. Any change in the stimulus context alters which inputs are suppressed, leading to a deep dynamic reshaping of neural receptive fields going far beyond simple surround suppression. Paradoxically, these highly variable receptive fields go alongside and are in fact required for an invariant representation of external sensory features. In addition to offering a normative account of context-dependent changes in sensory responses, perceptual inference in the presence of signal-dependent noise accounts for ubiquitous features of sensory neurons such as divisive normalization, gain control and contrast dependent temporal dynamics.},
  author       = {Chalk, Matthew J and Masset, Paul and Gutkin, Boris and Denève, Sophie},
  issn         = {1553-734X},
  journal      = {PLoS Computational Biology},
  number       = {6},
  publisher    = {Public Library of Science},
  title        = {{Sensory noise predicts divisive reshaping of receptive fields}},
  doi          = {10.1371/journal.pcbi.1005582},
  volume       = {13},
  year         = {2017},
}

@article{681,
  abstract     = {Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information. In this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile where all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players' objective, then the objective of every player is violated. We present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games. We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games.},
  author       = {Chatterjee, Krishnendu and Doyen, Laurent and Filiot, Emmanuel and Raskin, Jean},
  issn         = {0890-5401},
  journal      = {Information and Computation},
  pages        = {296 -- 315},
  publisher    = {Elsevier},
  title        = {{Doomsday equilibria for omega-regular games}},
  doi          = {10.1016/j.ic.2016.10.012},
  volume       = {254},
  year         = {2017},
}

@inproceedings{683,
  abstract     = {Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the first triangulation and edge f has label l in the second triangulation, then there must be some sequence of flips that moves label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot formulated the Orbit Conjecture, which states that this necessary condition is also sufficient, i.e. that all labels can be simultaneously mapped to their destination if and only if each label individually can be mapped to its destination. We prove this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence of flips to reconfigure one labelled triangulation to another, if such a sequence exists, and we prove an upper bound of O(n7) on the length of the flip sequence. Our proof uses the topological result that the sets of pairwise non-crossing edges on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional ball (this follows from a result of Orden and Santos; we give a different proof based on a shelling argument). The dual cell complex of this simplicial ball, called the flip complex, has the usual flip graph as its 1-skeleton. We use properties of the 2-skeleton of the flip complex to prove the Orbit Conjecture.},
  author       = {Lubiw, Anna and Masárová, Zuzana and Wagner, Uli},
  location     = {Brisbane, Australia},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{A proof of the orbit conjecture for flipping edge labelled triangulations}},
  doi          = {10.4230/LIPIcs.SoCG.2017.49},
  volume       = {77},
  year         = {2017},
}

@article{684,
  abstract     = {We generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP∩co-NP. We also show that obligation games provide a game framework for reasoning about p-automata. © 2017 The Association for Symbolic Logic.},
  author       = {Chatterjee, Krishnendu and Piterman, Nir},
  issn         = {1943-5886},
  journal      = {Journal of Symbolic Logic},
  number       = {2},
  pages        = {420 -- 452},
  publisher    = {Cambridge University Press},
  title        = {{Obligation blackwell games and p-automata}},
  doi          = {10.1017/jsl.2016.71},
  volume       = {82},
  year         = {2017},
}

@inproceedings{6841,
  abstract     = {In classical machine learning, regression is treated as a black box process of identifying a suitable function from a hypothesis set without attempting to gain insight into the mechanism connecting inputs and outputs. In the natural sciences, however, finding an interpretable function for a phenomenon is the prime goal as it allows to understand and generalize results. This paper proposes a novel type of function learning network, called equation learner (EQL), that can learn analytical expressions and is able to extrapolate to unseen domains. It is implemented as an end-to-end differentiable feed-forward network and allows for efficient gradient based training. Due to sparsity regularization concise interpretable expressions can be obtained. Often the true underlying source expression is identified.},
  author       = {Martius, Georg S and Lampert, Christoph},
  booktitle    = {5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings},
  location     = {Toulon, France},
  publisher    = {International Conference on Learning Representations},
  title        = {{Extrapolation and learning equations}},
  year         = {2017},
}

@article{685,
  abstract     = {By applying methods and principles from the physical sciences to biological problems, D'Arcy Thompson's On Growth and Form demonstrated how mathematical reasoning reveals elegant, simple explanations for seemingly complex processes. This has had a profound influence on subsequent generations of developmental biologists. We discuss how this influence can be traced through twentieth century morphologists, embryologists and theoreticians to current research that explores the molecular and cellular mechanisms of tissue growth and patterning, including our own studies of the vertebrate neural tube.},
  author       = {Briscoe, James and Kicheva, Anna},
  issn         = {0925-4773},
  journal      = {Mechanisms of Development},
  pages        = {26 -- 31},
  publisher    = {Elsevier},
  title        = {{The physics of development 100 years after D'Arcy Thompson's “on growth and form”}},
  doi          = {10.1016/j.mod.2017.03.005},
  volume       = {145},
  year         = {2017},
}

@article{686,
  abstract     = {Tissues are thought to behave like fluids with a given surface tension. Differences in tissue surface tension (TST) have been proposed to trigger cell sorting and tissue envelopment. D'Arcy Thompson in his seminal book ‘On Growth and Form’ has introduced this concept of differential TST as a key physical mechanism dictating tissue formation and organization within the developing organism. Over the past century, many studies have picked up the concept of differential TST and analyzed the role and cell biological basis of TST in development, underlining the importance and influence of this concept in developmental biology.},
  author       = {Heisenberg, Carl-Philipp J},
  issn         = {0925-4773},
  journal      = {Mechanisms of Development},
  pages        = {32 -- 37},
  publisher    = {Elsevier},
  title        = {{D'Arcy Thompson's ‘on growth and form’: From soap bubbles to tissue self organization}},
  doi          = {10.1016/j.mod.2017.03.006},
  volume       = {145},
  year         = {2017},
}

@article{687,
  abstract     = {Pursuing the similarity between the Kontsevich-Soibelman construction of the cohomological Hall algebra (CoHA) of BPS states and Lusztig's construction of canonical bases for quantum enveloping algebras, and the similarity between the integrality conjecture for motivic Donaldson-Thomas invariants and the PBW theorem for quantum enveloping algebras, we build a coproduct on the CoHA associated to a quiver with potential. We also prove a cohomological dimensional reduction theorem, further linking a special class of CoHAs with Yangians, and explaining how to connect the study of character varieties with the study of CoHAs.},
  author       = {Davison, Ben},
  issn         = {0033-5606},
  journal      = {Quarterly Journal of Mathematics},
  number       = {2},
  pages        = {635 -- 703},
  publisher    = {Oxford University Press},
  title        = {{The critical CoHA of a quiver with potential}},
  doi          = {10.1093/qmath/haw053},
  volume       = {68},
  year         = {2017},
}

@inproceedings{688,
  abstract     = {We show that the framework of topological data analysis can be extended from metrics to general Bregman divergences, widening the scope of possible applications. Examples are the Kullback - Leibler divergence, which is commonly used for comparing text and images, and the Itakura - Saito divergence, popular for speech and sound. In particular, we prove that appropriately generalized čech and Delaunay (alpha) complexes capture the correct homotopy type, namely that of the corresponding union of Bregman balls. Consequently, their filtrations give the correct persistence diagram, namely the one generated by the uniformly growing Bregman balls. Moreover, we show that unlike the metric setting, the filtration of Vietoris-Rips complexes may fail to approximate the persistence diagram. We propose algorithms to compute the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally test their efficiency. Lastly, we explain their surprisingly good performance by making a connection with discrete Morse theory. },
  author       = {Edelsbrunner, Herbert and Wagner, Hubert},
  issn         = {1868-8969},
  location     = {Brisbane, Australia},
  pages        = {391--3916},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Topological data analysis with Bregman divergences}},
  doi          = {10.4230/LIPIcs.SoCG.2017.39},
  volume       = {77},
  year         = {2017},
}

@article{689,
  abstract     = {Rett syndrome modeling in monkey mirrors the human disorder.},
  author       = {Novarino, Gaia},
  issn         = {1946-6234},
  journal      = {Science Translational Medicine},
  number       = {393},
  publisher    = {American Association for the Advancement of Science},
  title        = {{Rett syndrome modeling goes simian}},
  doi          = {10.1126/scitranslmed.aan8196},
  volume       = {9},
  year         = {2017},
}

@article{693,
  abstract     = {Many central synapses contain a single presynaptic active zone and a single postsynaptic density. Vesicular release statistics at such “simple synapses” indicate that they contain a small complement of docking sites where vesicles repetitively dock and fuse. In this work, we investigate functional and morphological aspects of docking sites at simple synapses made between cerebellar parallel fibers and molecular layer interneurons. Using immunogold labeling of SDS-treated freeze-fracture replicas, we find that Cav2.1 channels form several clusters per active zone with about nine channels per cluster. The mean value and range of intersynaptic variation are similar for Cav2.1 cluster numbers and for functional estimates of docking-site numbers obtained from the maximum numbers of released vesicles per action potential. Both numbers grow in relation with synaptic size and decrease by a similar extent with age between 2 wk and 4 wk postnatal. Thus, the mean docking-site numbers were 3.15 at 2 wk (range: 1–10) and 2.03 at 4 wk (range: 1–4), whereas the mean numbers of Cav2.1 clusters were 2.84 at 2 wk (range: 1–8) and 2.37 at 4 wk (range: 1–5). These changes were accompanied by decreases of miniature current amplitude (from 93 pA to 56 pA), active-zone surface area (from 0.0427 μm2 to 0.0234 μm2), and initial success rate (from 0.609 to 0.353), indicating a tightening of synaptic transmission with development. Altogether, these results suggest a close correspondence between the number of functionally defined vesicular docking sites and that of clusters of voltage-gated calcium channels. },
  author       = {Miki, Takafumi and Kaufmann, Walter and Malagon, Gerardo and Gomez, Laura and Tabuchi, Katsuhiko and Watanabe, Masahiko and Shigemoto, Ryuichi and Marty, Alain},
  issn         = {0027-8424},
  journal      = {PNAS},
  number       = {26},
  pages        = {E5246 -- E5255},
  publisher    = {National Academy of Sciences},
  title        = {{Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses}},
  doi          = {10.1073/pnas.1704470114},
  volume       = {114},
  year         = {2017},
}

@article{694,
  abstract     = {A change regarding the extent of adhesion - hereafter referred to as adhesion plasticity - between adhesive and less-adhesive states of mammalian cells is important for their behavior. To investigate adhesion plasticity, we have selected a stable isogenic subpopulation of human MDA-MB-468 breast carcinoma cells growing in suspension. These suspension cells are unable to re-adhere to various matrices or to contract three-dimensional collagen lattices. By using transcriptome analysis, we identified the focal adhesion protein tensin3 (Tns3) as a determinant of adhesion plasticity. Tns3 is strongly reduced at mRNA and protein levels in suspension cells. Furthermore, by transiently challenging breast cancer cells to grow under non-adherent conditions markedly reduces Tns3 protein expression, which is regained upon re-adhesion. Stable knockdown of Tns3 in parental MDA-MB-468 cells results in defective adhesion, spreading and migration. Tns3-knockdown cells display impaired structure and dynamics of focal adhesion complexes as determined by immunostaining. Restoration of Tns3 protein expression in suspension cells partially rescues adhesion and focal contact composition. Our work identifies Tns3 as a crucial focal adhesion component regulated by, and functionally contributing to, the switch between adhesive and non-adhesive states in MDA-MB-468 cancer cells.},
  author       = {Veß, Astrid and Blache, Ulrich and Leitner, Laura and Kurz, Angela and Ehrenpfordt, Anja and Sixt, Michael K and Posern, Guido},
  issn         = {0021-9533},
  journal      = {Journal of Cell Science},
  number       = {13},
  pages        = {2172 -- 2184},
  publisher    = {Company of Biologists},
  title        = {{A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity}},
  doi          = {10.1242/jcs.200899},
  volume       = {130},
  year         = {2017},
}

@inproceedings{697,
  abstract     = {De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over n-bit strings which has constant statistical distance to uniform (e.g., the output of a pseudorandom generator mapping n-1 to n bit strings), can be distinguished from the uniform distribution with advantage epsilon by a circuit of size O( 2^n epsilon^2). We generalize this result, showing that a distribution which has less than k bits of min-entropy, can be distinguished from any distribution with k bits of delta-smooth min-entropy with advantage epsilon by a circuit of size O(2^k epsilon^2/delta^2). As a special case, this implies that any distribution with support at most 2^k (e.g., the output of a pseudoentropy generator mapping k to n bit strings) can be distinguished from any given distribution with min-entropy k+1 with advantage epsilon by a circuit of size O(2^k epsilon^2). Our result thus shows that pseudoentropy distributions face basically the same non-uniform attacks as pseudorandom distributions. },
  author       = {Pietrzak, Krzysztof Z and Skórski, Maciej},
  issn         = {1868-8969},
  location     = {Warsaw, Poland},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Non uniform attacks against pseudoentropy}},
  doi          = {10.4230/LIPIcs.ICALP.2017.39},
  volume       = {80},
  year         = {2017},
}

