TY - JOUR
AB - In this article the notion of metabolic turnover is revisited in the light of recent results of out-of-equilibrium thermodynamics. By means of Monte Carlo methods we perform an exact sampling of the enzymatic fluxes in a genome scale metabolic network of E. Coli in stationary growth conditions from which we infer the metabolites turnover times. However the latter are inferred from net fluxes, and we argue that this approximation is not valid for enzymes working nearby thermodynamic equilibrium. We recalculate turnover times from total fluxes by performing an energy balance analysis of the network and recurring to the fluctuation theorem. We find in many cases values one of order of magnitude lower, implying a faster picture of intermediate metabolism.
AU - De Martino, Daniele
ID - 1485
IS - 1
JF - Physical Biology
TI - Genome-scale estimate of the metabolic turnover of E. Coli from the energy balance analysis
VL - 13
ER -
TY - JOUR
AB - We review recent results concerning the mathematical properties of the Bardeen-Cooper-Schrieffer (BCS) functional of superconductivity, which were obtained in a series of papers, partly in collaboration with R. Frank, E. Hamza, S. Naboko, and J. P. Solovej. Our discussion includes, in particular, an investigation of the critical temperature for a general class of interaction potentials, as well as a study of its dependence on external fields. We shall explain how the Ginzburg-Landau model can be derived from the BCS theory in a suitable parameter regime.
AU - Hainzl, Christian
AU - Seiringer, Robert
ID - 1486
IS - 2
JF - Journal of Mathematical Physics
TI - The Bardeen–Cooper–Schrieffer functional of superconductivity and its mathematical properties
VL - 57
ER -
TY - JOUR
AB - Rhythms with time scales of multiple cycles per second permeate the mammalian brain, yet neuroscientists are not certain of their functional roles. One leading idea is that coherent oscillation between two brain regions facilitates the exchange of information between them. In rats, the hippocampus and the vibrissal sensorimotor system both are characterized by rhythmic oscillation in the theta range, 5–12 Hz. Previous work has been divided as to whether the two rhythms are independent or coherent. To resolve this question, we acquired three measures from rats—whisker motion, hippocampal local field potential (LFP), and barrel cortex unit firing—during a whisker-mediated texture discrimination task and during control conditions (not engaged in a whisker-mediated memory task). Compared to control conditions, the theta band of hippocampal LFP showed a marked increase in power as the rats approached and then palpated the texture. Phase synchronization between whisking and hippocampal LFP increased by almost 50% during approach and texture palpation. In addition, a greater proportion of barrel cortex neurons showed firing that was phase-locked to hippocampal theta while rats were engaged in the discrimination task. Consistent with a behavioral consequence of phase synchronization, the rats identified the texture more rapidly and with lower error likelihood on trials in which there was an increase in theta-whisking coherence at the moment of texture palpation. These results suggest that coherence between the whisking rhythm, barrel cortex firing, and hippocampal LFP is augmented selectively during epochs in which the rat collects sensory information and that such coherence enhances the efficiency of integration of stimulus information into memory and decision-making centers.
AU - Grion, Natalia
AU - Akrami, Athena
AU - Zuo, Yangfang
AU - Stella, Federico
AU - Diamond, Mathew
ID - 1487
IS - 2
JF - PLoS Biology
TI - Coherence between rat sensorimotor system and hippocampus is enhanced during tactile discrimination
VL - 14
ER -
TY - JOUR
AB - 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.
AU - Riccio, Paul
AU - Cebrián, Cristina
AU - Zong, Hui
AU - Hippenmeyer, Simon
AU - Costantini, Frank
ID - 1488
IS - 2
JF - PLoS Biology
TI - Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis
VL - 14
ER -
TY - JOUR
AB - We prove optimal local law, bulk universality and non-trivial decay for the off-diagonal elements of the resolvent for a class of translation invariant Gaussian random matrix ensembles with correlated entries.
AU - Ajanki, Oskari H
AU - Erdös, László
AU - Krüger, Torben H
ID - 1489
IS - 2
JF - Journal of Statistical Physics
TI - Local spectral statistics of Gaussian matrices with correlated entries
VL - 163
ER -
TY - JOUR
AB - To induce adaptive immunity, dendritic cells (DCs) migrate through afferent lymphatic vessels (LVs) to draining lymph nodes (dLNs). This process occurs in several consecutive steps. Upon entry into lymphatic capillaries, DCs first actively crawl into downstream collecting vessels. From there, they are next passively and rapidly transported to the dLN by lymph flow. Here, we describe a role for the chemokine CCL21 in intralymphatic DC crawling. Performing time-lapse imaging in murine skin, we found that blockade of CCL21-but not the absence of lymph flow-completely abolished DC migration from capillaries toward collecting vessels and reduced the ability of intralymphatic DCs to emigrate from skin. Moreover, we found that in vitro low laminar flow established a CCL21 gradient along lymphatic endothelial monolayers, thereby inducing downstream-directed DC migration. These findings reveal a role for intralymphatic CCL21 in promoting DC trafficking to dLNs, through the formation of a flow-induced gradient.
AU - Russo, Erica
AU - Teijeira, Alvaro
AU - Vaahtomeri, Kari
AU - Willrodt, Ann
AU - Bloch, Joël
AU - Nitschké, Maximilian
AU - Santambrogio, Laura
AU - Kerjaschki, Dontscho
AU - Sixt, Michael K
AU - Halin, Cornelia
ID - 1490
IS - 7
JF - Cell Reports
TI - Intralymphatic CCL21 promotes tissue egress of dendritic cells through afferent lymphatic vessels
VL - 14
ER -
TY - JOUR
AB - We study the ground state of a trapped Bose gas, starting from the full many-body Schrödinger Hamiltonian, and derive the non-linear Schrödinger energy functional in the limit of a large particle number, when the interaction potential converges slowly to a Dirac delta function. Our method is based on quantitative estimates on the discrepancy between the full many-body energy and its mean-field approximation using Hartree states. These are proved using finite dimensional localization and a quantitative version of the quantum de Finetti theorem. Our approach covers the case of attractive interactions in the regime of stability. In particular, our main new result is a derivation of the 2D attractive non-linear Schrödinger ground state.
AU - Lewin, Mathieu
AU - Nam, Phan
AU - Rougerie, Nicolas
ID - 1491
IS - 9
JF - Transactions of the American Mathematical Society
TI - The mean-field approximation and the non-linear Schrödinger functional for trapped Bose gases
VL - 368
ER -
TY - JOUR
AB - To sustain a lifelong ability to initiate organs, plants retain pools of undifferentiated cells with a preserved prolif eration capacity. The root pericycle represents a unique tissue with conditional meristematic activity, and its tight control determines initiation of lateral organs. Here we show that the meristematic activity of the pericycle is constrained by the interaction with the adjacent endodermis. Release of these restraints by elimination of endo dermal cells by single-cell ablation triggers the pericycle to re-enter the cell cycle. We found that endodermis removal substitutes for the phytohormone auxin-dependent initiation of the pericycle meristematic activity. However, auxin is indispensable to steer the cell division plane orientation of new organ-defining divisions. We propose a dual, spatiotemporally distinct role for auxin during lateral root initiation. In the endodermis, auxin releases constraints arising from cell-to-cell interactions that compromise the pericycle meristematic activity, whereas, in the pericycle, auxin defines the orientation of the cell division plane to initiate lateral roots.
AU - Marhavy, Peter
AU - Montesinos López, Juan C
AU - Abuzeineh, Anas
AU - Van Damme, Daniël
AU - Vermeer, Joop
AU - Duclercq, Jérôme
AU - Rakusova, Hana
AU - Marhavá, Petra
AU - Friml, Jirí
AU - Geldner, Niko
AU - Benková, Eva
ID - 1492
IS - 4
JF - Genes and Development
TI - Targeted cell elimination reveals an auxin-guided biphasic mode of lateral root initiation
VL - 30
ER -
TY - JOUR
AB - We introduce a new method for deriving the time-dependent Hartree or Hartree-Fock equations as an effective mean-field dynamics from the microscopic Schrödinger equation for fermionic many-particle systems in quantum mechanics. The method is an adaption of the method used in Pickl (Lett. Math. Phys. 97 (2) 151–164 2011) for bosonic systems to fermionic systems. It is based on a Gronwall type estimate for a suitable measure of distance between the microscopic solution and an antisymmetrized product state. We use this method to treat a new mean-field limit for fermions with long-range interactions in a large volume. Some of our results hold for singular attractive or repulsive interactions. We can also treat Coulomb interaction assuming either a mild singularity cutoff or certain regularity conditions on the solutions to the Hartree(-Fock) equations. In the considered limit, the kinetic and interaction energy are of the same order, while the average force is subleading. For some interactions, we prove that the Hartree(-Fock) dynamics is a more accurate approximation than a simpler dynamics that one would expect from the subleading force. With our method we also treat the mean-field limit coupled to a semiclassical limit, which was discussed in the literature before, and we recover some of the previous results. All results hold for initial data close (but not necessarily equal) to antisymmetrized product states and we always provide explicit rates of convergence.
AU - Petrat, Sören P
AU - Pickl, Peter
ID - 1493
IS - 1
JF - Mathematical Physics, Analysis and Geometry
TI - A new method and a new scaling for deriving fermionic mean-field dynamics
VL - 19
ER -
TY - JOUR
AB - The two-photon 1s2 2s 2p 3P0 1s22s2 1S0 transition in berylliumlike ions is theoretically investigated within a fully relativistic framework and a second-order perturbation theory. We focus our analysis on how electron correlation, as well as the negative-energy spectrum, can affect the forbidden E1M1 decay rate. For this purpose, we include the electronic correlation via an effective local potential and within a single configuration-state model. Due to its experimental interest, evaluations of decay rates are performed for berylliumlike xenon and uranium. We find that the negative-energy contribution can be neglected at the present level of accuracy in the evaluation of the decay rate. On the other hand, if contributions of electronic correlation are not carefully taken into account, it may change the lifetime of the metastable state by up to 20%. By performing a full-relativistic jj-coupling calculation, we found a decrease of the decay rate by two orders of magnitude compared to non-relativistic LS-coupling calculations, for the selected heavy ions.
AU - Amaro, Pedro
AU - Fratini, Filippo
AU - Safari, Laleh
AU - Machado, Jorge
AU - Guerra, Mauro
AU - Indelicato, Paul
AU - Santos, José
ID - 1496
IS - 3
JF - Physical Review A - Atomic, Molecular, and Optical Physics
TI - Relativistic evaluation of the two-photon decay of the metastable 1s22s2p3P0 state in berylliumlike ions with an effective-potential model
VL - 93
ER -
TY - JOUR
AB - The inference of demographic history from genome data is hindered by a lack of efficient computational approaches. In particular, it has proved difficult to exploit the information contained in the distribution of genealogies across the genome. We have previously shown that the generating function (GF) of genealogies can be used to analytically compute likelihoods of demographic models from configurations of mutations in short sequence blocks (Lohse et al. 2011). Although the GF has a simple, recursive form, the size of such likelihood calculations explodes quickly with the number of individuals and applications of this framework have so far been mainly limited to small samples (pairs and triplets) for which the GF can be written by hand. Here we investigate several strategies for exploiting the inherent symmetries of the coalescent. In particular, we show that the GF of genealogies can be decomposed into a set of equivalence classes that allows likelihood calculations from nontrivial samples. Using this strategy, we automated blockwise likelihood calculations for a general set of demographic scenarios in Mathematica. These histories may involve population size changes, continuous migration, discrete divergence, and admixture between multiple populations. To give a concrete example, we calculate the likelihood for a model of isolation with migration (IM), assuming two diploid samples without phase and outgroup information. We demonstrate the new inference scheme with an analysis of two individual butterfly genomes from the sister species Heliconius melpomene rosina and H. cydno.
AU - Lohse, Konrad
AU - Chmelik, Martin
AU - Martin, Simon
AU - Barton, Nicholas H
ID - 1518
IS - 2
JF - Genetics
TI - Efficient strategies for calculating blockwise likelihoods under the coalescent
VL - 202
ER -
TY - JOUR
AB - We classify smooth Brunnian (i.e., unknotted on both components) embeddings (S2 × S1) ⊔ S3 → ℝ6. Any Brunnian embedding (S2 × S1) ⊔ S3 → ℝ6 is isotopic to an explicitly constructed embedding fk,m,n for some integers k, m, n such that m ≡ n (mod 2). Two embeddings fk,m,n and fk′ ,m′,n′ are isotopic if and only if k = k′, m ≡ m′ (mod 2k) and n ≡ n′ (mod 2k). We use Haefliger’s classification of embeddings S3 ⊔ S3 → ℝ6 in our proof. The relation between the embeddings (S2 × S1) ⊔ S3 → ℝ6 and S3 ⊔ S3 → ℝ6 is not trivial, however. For example, we show that there exist embeddings f: (S2 ×S1) ⊔ S3 → ℝ6 and g, g′ : S3 ⊔ S3 → ℝ6 such that the componentwise embedded connected sum f # g is isotopic to f # g′ but g is not isotopic to g′.
AU - Avvakumov, Serhii
ID - 1522
IS - 1
JF - Moscow Mathematical Journal
TI - The classification of certain linked 3-manifolds in 6-space
VL - 16
ER -
TY - JOUR
AB - For random graphs, the containment problem considers the probability that a binomial random graph G(n, p) contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the given graph, it is well known that the (sharp) threshold is at p = 1/n. We consider a natural analogue of this question for higher-dimensional random complexes Xk(n, p), first studied by Cohen, Costa, Farber and Kappeler for k = 2. Improving previous results, we show that p = Θ(1/ √n) is the (coarse) threshold for containing a subdivision of any fixed complete 2-complex. For higher dimensions k > 2, we get that p = O(n−1/k) is an upper bound for the threshold probability of containing a subdivision of a fixed k-dimensional complex.
AU - Gundert, Anna
AU - Wagner, Uli
ID - 1523
IS - 4
JF - Proceedings of the American Mathematical Society
TI - On topological minors in random simplicial complexes
VL - 144
ER -
TY - CONF
AB - When designing genetic circuits, the typical primitives used in major existing modelling formalisms are gene interaction graphs, where edges between genes denote either an activation or inhibition relation. However, when designing experiments, it is important to be precise about the low-level mechanistic details as to how each such relation is implemented. The rule-based modelling language Kappa allows to unambiguously specify mechanistic details such as DNA binding sites, dimerisation of transcription factors, or co-operative interactions. Such a detailed description comes with complexity and computationally costly executions. We propose a general method for automatically transforming a rule-based program, by eliminating intermediate species and adjusting the rate constants accordingly. To the best of our knowledge, we show the first automated reduction of rule-based models based on equilibrium approximations.
Our algorithm is an adaptation of an existing algorithm, which was designed for reducing reaction-based programs; our version of the algorithm scans the rule-based Kappa model in search for those interaction patterns known to be amenable to equilibrium approximations (e.g. Michaelis-Menten scheme). Additional checks are then performed in order to verify if the reduction is meaningful in the context of the full model. The reduced model is efficiently obtained by static inspection over the rule-set. The tool is tested on a detailed rule-based model of a λ-phage switch, which lists 92 rules and 13 agents. The reduced model has 11 rules and 5 agents, and provides a dramatic reduction in simulation time of several orders of magnitude.
AU - Beica, Andreea
AU - Guet, Calin C
AU - Petrov, Tatjana
ID - 1524
TI - Efficient reduction of kappa models by static inspection of the rule-set
VL - 9271
ER -
TY - CONF
AB - We present the first study of robustness of systems that are both timed as well as reactive (I/O). We study the behavior of such timed I/O systems in the presence of uncertain inputs and formalize their robustness using the analytic notion of Lipschitz continuity: a timed I/O system is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions over timed words such as the timed version of the Manhattan distance and the Skorokhod distance. We consider two models of timed I/O systems — timed transducers and asynchronous sequential circuits. We show that K-robustness of timed transducers can be decided in polynomial space under certain conditions. For asynchronous sequential circuits, we reduce K-robustness w.r.t. timed Manhattan distances to K-robustness of discrete letter-to-letter transducers and show PSpace-completeness of the problem.
AU - Henzinger, Thomas A
AU - Otop, Jan
AU - Samanta, Roopsha
ID - 1526
TI - Lipschitz robustness of timed I/O systems
VL - 9583
ER -
TY - JOUR
AB - We consider partially observable Markov decision processes (POMDPs) with a set of target states and an integer cost associated with every transition. The optimization objective we study asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest.
AU - Chatterjee, Krishnendu
AU - Chmelik, Martin
AU - Gupta, Raghav
AU - Kanodia, Ayush
ID - 1529
JF - Artificial Intelligence
TI - Optimal cost almost-sure reachability in POMDPs
VL - 234
ER -
TY - JOUR
AB - We introduce a scheme for preparation, manipulation, and read out of Majorana zero modes in semiconducting wires with mesoscopic superconducting islands. Our approach synthesizes recent advances in materials growth with tools commonly used in quantum-dot experiments, including gate control of tunnel barriers and Coulomb effects, charge sensing, and charge pumping. We outline a sequence of milestones interpolating between zero-mode detection and quantum computing that includes (1) detection of fusion rules for non-Abelian anyons using either proximal charge sensors or pumped current, (2) validation of a prototype topological qubit, and (3) demonstration of non-Abelian statistics by braiding in a branched geometry. The first two milestones require only a single wire with two islands, and additionally enable sensitive measurements of the system\'s excitation gap, quasiparticle poisoning rates, residual Majorana zero-mode splittings, and topological-qubit coherence times. These pre-braiding experiments can be adapted to other manipulation and read out schemes as well.
AU - Aasen, David
AU - Hell, Michael
AU - Mishmash, Ryan
AU - Higginbotham, Andrew P
AU - Danon, Jeroen
AU - Leijnse, Martin
AU - Jespersen, Thomas
AU - Folk, Joshua
AU - Marcs, Charles
AU - Flensberg, Karsten
AU - Alicea, Jason
ID - 100
IS - 3
JF - Physical Review X
TI - Milestones toward Majorana-based quantum computing
VL - 6
ER -
TY - JOUR
AB - Majorana zero modes are quasiparticle excitations in condensed matter systems that have been proposed as building blocks of fault-tolerant quantum computers. They are expected to exhibit non-Abelian particle statistics, in contrast to the usual statistics of fermions and bosons, enabling quantum operations to be performed by braiding isolated modes around one another. Quantum braiding operations are topologically protected insofar as these modes are pinned near zero energy, with the departure from zero expected to be exponentially small as the modes become spatially separated. Following theoretical proposals, several experiments have identified signatures of Majorana modes in nanowires with proximity-induced superconductivity and atomic chains, with small amounts of mode splitting potentially explained by hybridization of Majorana modes. Here, we use Coulomb-blockade spectroscopy in an InAs nanowire segment with epitaxial aluminium, which forms a proximity-induced superconducting Coulomb island (a â ∼ Majorana islandâ (tm)) that is isolated from normal-metal leads by tunnel barriers, to measure the splitting of near-zero-energy Majorana modes. We observe exponential suppression of energy splitting with increasing wire length. For short devices of a few hundred nanometres, sub-gap state energies oscillate as the magnetic field is varied, as is expected for hybridized Majorana modes. Splitting decreases by a factor of about ten for each half a micrometre of increased wire length. For devices longer than about one micrometre, transport in strong magnetic fields occurs through a zero-energy state that is energetically isolated from a continuum, yielding uniformly spaced Coulomb-blockade conductance peaks, consistent with teleportation via Majorana modes. Our results help to explain the trivial-to-topological transition in finite systems and to quantify the scaling of topological protection with end-mode separation.
AU - Albrecht, S M
AU - Higginbotham, Andrew P
AU - Jespersen, Thomas
AU - Madsen, Morten
AU - Kuemmeth, Ferdinand
AU - Nygård, Jesper
AU - Krogstrup, Peter
AU - Marcus, Charles
ID - 101
IS - 7593
JF - Nature
TI - Exponential protection of zero modes in Majorana islands
VL - 531
ER -
TY - JOUR
AB - Recent experiments have produced mounting evidence of Majorana zero modes in nanowire-superconductor hybrids. Signatures of an expected topological phase transition accompanying the onset of these modes nevertheless remain elusive. We investigate a fundamental question concerning this issue: Do well-formed Majorana modes necessarily entail a sharp phase transition in these setups? Assuming reasonable parameters, we argue that finite-size effects can dramatically smooth this putative transition into a crossover, even in systems large enough to support well-localized Majorana modes. We propose overcoming such finite-size effects by examining the behavior of low-lying excited states through tunneling spectroscopy. In particular, the excited-state energies exhibit characteristic field and density dependence, and scaling with system size, that expose an approaching topological phase transition. We suggest several experiments for extracting the predicted behavior. As a useful byproduct, the protocols also allow one to measure the wire's spin-orbit coupling directly in its superconducting environment.
AU - Mishmash, Ryan
AU - Aasen, David
AU - Higginbotham, Andrew P
AU - Alicea, Jason
ID - 102
IS - 24
JF - Physical Review B
TI - Approaching a topological phase transition in Majorana nanowires
VL - 93
ER -
TY - CONF
AB - Games on graphs provide the appropriate framework to study several central problems in computer science, such as verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or Büchi) objective that given a target set of vertices requires that some vertex in the target set is visited infinitely often. We study generalized Büchi objectives (i.e., conjunction of liveness objectives), and implications between two generalized Büchi objectives (known as GR(1) objectives), that arise in numerous applications in computer-aided verification. We present improved algorithms and conditional super-linear lower bounds based on widely believed assumptions about the complexity of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider graph games with n vertices, m edges, and generalized Büchi objectives with k conjunctions. First, we present an algorithm with running time O(k*n^2), improving the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm is optimal for dense graphs under (A1). Second, we show that the basic algorithm for the problem is optimal for sparse graphs when the target sets have constant size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1 k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time algorithm for m > n^{1.5}.
AU - Chatterjee, Krishnendu
AU - Dvorák, Wolfgang
AU - Henzinger, Monika
AU - Loitzenbauer, Veronika
ID - 1068
TI - Conditionally optimal algorithms for generalized Büchi Games
VL - 58
ER -