@article{6240,
  abstract     = {For a general class of large non-Hermitian random block matrices X we prove that there are no eigenvalues away from a deterministic set with very high probability. This set is obtained from the Dyson equation of the Hermitization of X as the self-consistent approximation of the pseudospectrum. We demonstrate that the analysis of the matrix Dyson equation from (Probab. Theory Related Fields (2018)) offers a unified treatment of many structured matrix ensembles.},
  author       = {Alt, Johannes and Erdös, László and Krüger, Torben H and Nemish, Yuriy},
  issn         = {0246-0203},
  journal      = {Annales de l'Institut Henri Poincaré, Probabilités et Statistiques},
  number       = {2},
  pages        = {661--696},
  publisher    = {Institut Henri Poincaré},
  title        = {{Location of the spectrum of Kronecker random matrices}},
  doi          = {10.1214/18-AIHP894},
  volume       = {55},
  year         = {2019},
}

@article{6756,
  abstract     = {We study the topology generated by the temperature fluctuations of the cosmic microwave background (CMB) radiation, as quantified by the number of components and holes, formally given by the Betti numbers, in the growing excursion sets. We compare CMB maps observed by the Planck satellite with a thousand simulated maps generated according to the ΛCDM paradigm with Gaussian distributed fluctuations. The comparison is multi-scale, being performed on a sequence of degraded maps with mean pixel separation ranging from 0.05 to 7.33°. The survey of the CMB over 𝕊2 is incomplete due to obfuscation effects by bright point sources and other extended foreground objects like our own galaxy. To deal with such situations, where analysis in the presence of “masks” is of importance, we introduce the concept of relative homology. The parametric χ2-test shows differences between observations and simulations, yielding p-values at percent to less than permil levels roughly between 2 and 7°, with the difference in the number of components and holes peaking at more than 3σ sporadically at these scales. The highest observed deviation between the observations and simulations for b0 and b1 is approximately between 3σ and 4σ at scales of 3–7°. There are reports of mildly unusual behaviour of the Euler characteristic at 3.66° in the literature, computed from independent measurements of the CMB temperature fluctuations by Planck’s predecessor, the Wilkinson Microwave Anisotropy Probe (WMAP) satellite. The mildly anomalous behaviour of the Euler characteristic is phenomenologically related to the strongly anomalous behaviour of components and holes, or the zeroth and first Betti numbers, respectively. Further, since these topological descriptors show consistent anomalous behaviour over independent measurements of Planck and WMAP, instrumental and systematic errors may be an unlikely source. These are also the scales at which the observed maps exhibit low variance compared to the simulations, and approximately the range of scales at which the power spectrum exhibits a dip with respect to the theoretical model. Non-parametric tests show even stronger differences at almost all scales. Crucially, Gaussian simulations based on power-spectrum matching the characteristics of the observed dipped power spectrum are not able to resolve the anomaly. Understanding the origin of the anomalies in the CMB, whether cosmological in nature or arising due to late-time effects, is an extremely challenging task. Regardless, beyond the trivial possibility that this may still be a manifestation of an extreme Gaussian case, these observations, along with the super-horizon scales involved, may motivate the study of primordial non-Gaussianity. Alternative scenarios worth exploring may be models with non-trivial topology, including topological defect models.},
  author       = {Pranav, Pratyush and Adler, Robert J. and Buchert, Thomas and Edelsbrunner, Herbert and Jones, Bernard J.T. and Schwartzman, Armin and Wagner, Hubert and Van De Weygaert, Rien},
  issn         = {1432-0746},
  journal      = {Astronomy & Astrophysics},
  publisher    = {EDP Sciences},
  title        = {{Unexpected topology of the temperature fluctuations in the cosmic microwave background}},
  doi          = {10.1051/0004-6361/201834916},
  volume       = {627},
  year         = {2019},
}

@unpublished{8305,
  abstract     = {In this paper, we present the first fully asynchronous distributed key generation (ADKG) algorithm as well as the first distributed key generation algorithm that can create keys with a dual (f,2f+1)−threshold that are necessary for scalable consensus (which so far needs a trusted dealer assumption). In order to create a DKG with a dual (f,2f+1)− threshold we first answer in the affirmative the open question posed by Cachin et al. how to create an AVSS protocol with recovery thresholds f+1<k≤2f+1, which is of independent interest. Our High-threshold-AVSS (HAVSS) uses an asymmetric bi-variate polynomial, where the secret shared is hidden from any set of k nodes but an honest node that did not participate in the sharing phase can still recover his share with only n−2f shares, hence be able to contribute in the secret reconstruction. Another building block for ADKG is a novel Eventually Perfect Common Coin (EPCC) abstraction and protocol that enables the participants to create a common coin that might fail to agree at most f+1 times (even if invoked a polynomial number of times). Using EPCC we implement an Eventually Efficient Asynchronous Binary Agreement (EEABA) in which each instance takes O(n2) bits and O(1) rounds in expectation, except for at most f+1 instances which may take O(n4) bits and O(n) rounds in total. Using EEABA we construct the first fully Asynchronous Distributed Key Generation (ADKG) which has the same overhead and expected runtime as the best partially-synchronous DKG (O(n4) words, O(n) rounds). As a corollary of our ADKG we can also create the first Validated Asynchronous Byzantine Agreement (VABA) in the authenticated setting that does not need a trusted dealer to setup threshold signatures of degree n−f. Our VABA has an overhead of expected O(n2) words and O(1) time per instance after an initial O(n4) words and O(n) time bootstrap via ADKG.},
  author       = {KOKORIS KOGIAS, Eleftherios and Spiegelman, Alexander and Malkhi, Dahlia and Abraham, Ittai},
  booktitle    = {Cryptology ePrint Archive},
  title        = {{Bootstrapping consensus without trusted setup: Fully asynchronous distributed key generation}},
  year         = {2019},
}

@article{6856,
  abstract     = {Plant mating systems play a key role in structuring genetic variation both within and between species. In hybrid zones, the outcomes and dynamics of hybridization are usually interpreted as the balance between gene flow and selection against hybrids. Yet, mating systems can introduce selective forces that alter these expectations; with diverse outcomes for the level and direction of gene flow depending on variation in outcrossing and whether the mating systems of the species pair are the same or divergent. We present a survey of hybridization in 133 species pairs from 41 plant families and examine how patterns of hybridization vary with mating system. We examine if hybrid zone mode, level of gene flow, asymmetries in gene flow and the frequency of reproductive isolating barriers vary in relation to mating system/s of the species pair. We combine these results with a simulation model and examples from the literature to address two general themes: (i) the two‐way interaction between introgression and the evolution of reproductive systems, and (ii) how mating system can facilitate or restrict interspecific gene flow. We conclude that examining mating system with hybridization provides unique opportunities to understand divergence and the processes underlying reproductive isolation.},
  author       = {Pickup, Melinda and Barton, Nicholas H and Brandvain, Yaniv and Fraisse, Christelle and Yakimowski, Sarah and Dixit, Tanmay and Lexer, Christian and Cereghetti, Eva and Field, David},
  issn         = {1469-8137},
  journal      = {New Phytologist},
  number       = {3},
  pages        = {1035--1047},
  publisher    = {Wiley},
  title        = {{Mating system variation in hybrid zones: Facilitation, barriers and asymmetries to gene flow}},
  doi          = {10.1111/nph.16180},
  volume       = {224},
  year         = {2019},
}

@article{6788,
  abstract     = {We consider the Nelson model with ultraviolet cutoff, which describes the interaction between non-relativistic particles and a positive or zero mass quantized scalar field. We take the non-relativistic particles to obey Fermi statistics and discuss the time evolution in a mean-field limit of many fermions. In this case, the limit is known to be also a semiclassical limit. We prove convergence in terms of reduced density matrices of the many-body state to a tensor product of a Slater determinant with semiclassical structure and a coherent state, which evolve according to a fermionic version of the Schrödinger–Klein–Gordon equations.},
  author       = {Leopold, Nikolai K and Petrat, Sören P},
  issn         = {1424-0661},
  journal      = {Annales Henri Poincare},
  number       = {10},
  pages        = {3471–3508},
  publisher    = {Springer Nature},
  title        = {{Mean-field dynamics for the Nelson model with fermions}},
  doi          = {10.1007/s00023-019-00828-w},
  volume       = {20},
  year         = {2019},
}

@article{7100,
  abstract     = {We present microscopic derivations of the defocusing two-dimensional cubic nonlinear Schrödinger equation and the Gross–Pitaevskii equation starting froman interacting N-particle system of bosons. We consider the interaction potential to be given either by Wβ(x)=N−1+2βW(Nβx), for any β>0, or to be given by VN(x)=e2NV(eNx), for some spherical symmetric, nonnegative and compactly supported W,V∈L∞(R2,R). In both cases we prove the convergence of the reduced density corresponding to the exact time evolution to the projector onto the solution of the corresponding nonlinear Schrödinger equation in trace norm. For the latter potential VN we show that it is crucial to take the microscopic structure of the condensate into account in order to obtain the correct dynamics.},
  author       = {Jeblick, Maximilian and Leopold, Nikolai K and Pickl, Peter},
  issn         = {1432-0916},
  journal      = {Communications in Mathematical Physics},
  number       = {1},
  pages        = {1--69},
  publisher    = {Springer Nature},
  title        = {{Derivation of the time dependent Gross–Pitaevskii equation in two dimensions}},
  doi          = {10.1007/s00220-019-03599-x},
  volume       = {372},
  year         = {2019},
}

@inbook{6890,
  abstract     = {Describing the protein interactions that form pleomorphic and asymmetric viruses represents a considerable challenge to most structural biology techniques, including X-ray crystallography and single particle cryo-electron microscopy. Obtaining a detailed understanding of these interactions is nevertheless important, considering the number of relevant human pathogens that do not follow strict icosahedral or helical symmetry. Cryo-electron tomography and subtomogram averaging methods provide structural insights into complex biological environments and are well suited to go beyond structures of perfectly symmetric viruses. This chapter discusses recent developments showing that cryo-ET and subtomogram averaging can provide high-resolution insights into hitherto unknown structural features of pleomorphic and asymmetric virus particles. It also describes how these methods have significantly added to our understanding of retrovirus capsid assemblies in immature and mature viruses. Additional examples of irregular viruses and their associated proteins, whose structures have been studied via cryo-ET and subtomogram averaging, further support the versatility of these methods.},
  author       = {Obr, Martin and Schur, Florian KM},
  booktitle    = {Complementary Strategies to Study Virus Structure and Function},
  editor       = {Rey, Félix A.},
  isbn         = {9780128184561},
  issn         = {0065-3527},
  pages        = {117--159},
  publisher    = {Elsevier},
  title        = {{Structural analysis of pleomorphic and asymmetric viruses using cryo-electron tomography and subtomogram averaging}},
  doi          = {10.1016/bs.aivir.2019.07.008},
  volume       = {105},
  year         = {2019},
}

@inproceedings{6989,
  abstract     = {When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with hole(s) to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special simple holes guarantee foldability. },
  author       = {Aichholzer, Oswin and Akitaya, Hugo A and Cheung, Kenneth C and Demaine, Erik D and Demaine, Martin L and Fekete, Sandor P and Kleist, Linda and Kostitsyna, Irina and Löffler, Maarten and Masárová, Zuzana and Mundilova, Klara and Schmidt, Christiane},
  booktitle    = {Proceedings of the 31st Canadian Conference on Computational Geometry},
  location     = {Edmonton, Canada},
  pages        = {164--170},
  publisher    = {Canadian Conference on Computational Geometry},
  title        = {{Folding polyominoes with holes into a cube}},
  year         = {2019},
}

@article{6419,
  abstract     = {Characterizing the fitness landscape, a representation of fitness for a large set of genotypes, is key to understanding how genetic information is interpreted to create functional organisms. Here we determined the evolutionarily-relevant segment of the fitness landscape of His3, a gene coding for an enzyme in the histidine synthesis pathway, focusing on combinations of amino acid states found at orthologous sites of extant species. Just 15% of amino acids found in yeast His3 orthologues were always neutral while the impact on fitness of the remaining 85% depended on the genetic background. Furthermore, at 67% of sites, amino acid replacements were under sign epistasis, having both strongly positive and negative effect in different genetic backgrounds. 46% of sites were under reciprocal sign epistasis. The fitness impact of amino acid replacements was influenced by only a few genetic backgrounds but involved interaction of multiple sites, shaping a rugged fitness landscape in which many of the shortest paths between highly fit genotypes are inaccessible.},
  author       = {Pokusaeva, Victoria and Usmanova, Dinara R. and Putintseva, Ekaterina and Espinar, Lorena and Sarkisyan, Karen and Mishin, Alexander S. and Bogatyreva, Natalya S. and Ivankov, Dmitry and Akopyan, Arseniy and Avvakumov, Sergey and Povolotskaya, Inna S. and Filion, Guillaume J. and Carey, Lucas B. and Kondrashov, Fyodor},
  issn         = {1553-7404},
  journal      = {PLoS Genetics},
  number       = {4},
  publisher    = {Public Library of Science},
  title        = {{An experimental assay of the interactions of amino acids from orthologous sequences shaping a complex fitness landscape}},
  doi          = {10.1371/journal.pgen.1008079},
  volume       = {15},
  year         = {2019},
}

@article{5678,
  abstract     = {The order-k Voronoi tessellation of a locally finite set 𝑋⊆ℝ𝑛 decomposes ℝ𝑛 into convex domains whose points have the same k nearest neighbors in X. Assuming X is a stationary Poisson point process, we give explicit formulas for the expected number and total area of faces of a given dimension per unit volume of space. We also develop a relaxed version of discrete Morse theory and generalize by counting only faces, for which the k nearest points in X are within a given distance threshold.},
  author       = {Edelsbrunner, Herbert and Nikitenko, Anton},
  issn         = {14320444},
  journal      = {Discrete and Computational Geometry},
  number       = {4},
  pages        = {865–878},
  publisher    = {Springer},
  title        = {{Poisson–Delaunay Mosaics of Order k}},
  doi          = {10.1007/s00454-018-0049-2},
  volume       = {62},
  year         = {2019},
}

@inproceedings{5947,
  abstract     = {Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications - addition and removal of vertices and/or edges - in the graph. This paper presents a novel concurrent non-blocking algorithm to implement a dynamic unbounded directed graph in a shared-memory machine. The addition and removal operations of vertices and edges are lock-free. For a finite sized graph, the lookup operations are wait-free. Most significant component of the presented algorithm is the reachability query in a concurrent graph. The reachability queries in our algorithm are obstruction-free and thus impose minimal additional synchronization cost over other operations. We prove that each of the data structure operations are linearizable. We extensively evaluate a sample C/C++ implementation of the algorithm through a number of micro-benchmarks. The experimental results show that the proposed algorithm scales well with the number of threads and on an average provides 5 to 7x performance improvement over a concurrent graph implementation using coarse-grained locking.},
  author       = {Chatterjee, Bapi and Peri, Sathya and Sa, Muktikanta and Singhal, Nandini},
  booktitle    = {ACM International Conference Proceeding Series},
  isbn         = {978-1-4503-6094-4 },
  location     = {Bangalore, India},
  pages        = {168--177},
  publisher    = {ACM},
  title        = {{A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries}},
  doi          = {10.1145/3288599.3288617},
  year         = {2019},
}

@article{5906,
  abstract     = {We introduce a simple, exactly solvable strong-randomness renormalization group (RG) model for the many-body localization (MBL) transition in one dimension. Our approach relies on a family of RG flows parametrized by the asymmetry between thermal and localized phases. We identify the physical MBL transition in the limit of maximal asymmetry, reflecting the instability of MBL against rare thermal inclusions. We find a critical point that is localized with power-law distributed thermal inclusions. The typical size of critical inclusions remains finite at the transition, while the average size is logarithmically diverging. We propose a two-parameter scaling theory for the many-body localization transition that falls into the Kosterlitz-Thouless universality class, with the MBL phase corresponding to a stable line of fixed points with multifractal behavior.},
  author       = {Goremykina, Anya and Vasseur, Romain and Serbyn, Maksym},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  number       = {4},
  publisher    = {American Physical Society},
  title        = {{Analytically solvable renormalization group for the many-body localization transition}},
  doi          = {10.1103/physrevlett.122.040601},
  volume       = {122},
  year         = {2019},
}

@misc{9790,
  author       = {Pokusaeva, Victoria and Usmanova, Dinara R. and Putintseva, Ekaterina V. and Espinar, Lorena and Sarkisyan, Karen and Mishin, Alexander S. and Bogatyreva, Natalya S. and Ivankov, Dmitry and Akopyan, Arseniy and Avvakumov, Sergey and Povolotskaya, Inna S. and Filion, Guillaume J. and Carey, Lucas B. and Kondrashov, Fyodor},
  publisher    = {Public Library of Science},
  title        = {{A statistical summary of segment libraries and sequencing results}},
  doi          = {10.1371/journal.pgen.1008079.s011},
  year         = {2019},
}

@misc{9797,
  author       = {Pokusaeva, Victoria and Usmanova, Dinara R. and Putintseva, Ekaterina V. and Espinar, Lorena and Sarkisyan, Karen and Mishin, Alexander S. and Bogatyreva, Natalya S. and Ivankov, Dmitry and Akopyan, Arseniy and Povolotskaya, Inna S. and Filion, Guillaume J. and Carey, Lucas B. and Kondrashov, Fyodor},
  publisher    = {Public Library of Science},
  title        = {{A statistical summary of segment libraries and sequencing results}},
  doi          = {10.1371/journal.pgen.1008079.s011},
  year         = {2019},
}

@misc{9789,
  author       = {Pokusaeva, Victoria and Usmanova, Dinara R. and Putintseva, Ekaterina V. and Espinar, Lorena and Sarkisyan, Karen and Mishin, Alexander S. and Bogatyreva, Natalya S. and Ivankov, Dmitry and Akopyan, Arseniy and Avvakumov, Sergey and Povolotskaya, Inna S. and Filion, Guillaume J. and Carey, Lucas B. and Kondrashov, Fyodor},
  publisher    = {Public Library of Science},
  title        = {{Multiple alignment of His3 orthologues}},
  doi          = {10.1371/journal.pgen.1008079.s010},
  year         = {2019},
}

@phdthesis{6179,
  abstract     = {In the first part of this thesis we consider large random matrices with arbitrary expectation and a general slowly decaying correlation among its entries. We prove universality of the local eigenvalue statistics and optimal local laws for the resolvent in the bulk and edge regime. The main novel tool is a systematic diagrammatic control of a multivariate cumulant expansion.
In the second part we consider Wigner-type matrices and show that at any cusp singularity of the limiting eigenvalue distribution the local eigenvalue statistics are uni- versal and form a Pearcey process. Since the density of states typically exhibits only square root or cubic root cusp singularities, our work complements previous results on the bulk and edge universality and it thus completes the resolution of the Wigner- Dyson-Mehta universality conjecture for the last remaining universality type. Our analysis holds not only for exact cusps, but approximate cusps as well, where an ex- tended Pearcey process emerges. As a main technical ingredient we prove an optimal local law at the cusp, and extend the fast relaxation to equilibrium of the Dyson Brow- nian motion to the cusp regime.
In the third and final part we explore the entrywise linear statistics of Wigner ma- trices and identify the fluctuations for a large class of test functions with little regularity. This enables us to study the rectangular Young diagram obtained from the interlacing eigenvalues of the random matrix and its minor, and we find that, despite having the same limit, the fluctuations differ from those of the algebraic Young tableaux equipped with the Plancharel measure.},
  author       = {Schröder, Dominik J},
  issn         = {2663-337X},
  pages        = {375},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{From Dyson to Pearcey: Universal statistics in random matrix theory}},
  doi          = {10.15479/AT:ISTA:th6179},
  year         = {2019},
}

@article{6182,
  abstract     = {We consider large random matrices with a general slowly decaying correlation among its entries. We prove universality of the local eigenvalue statistics and optimal local laws for the resolvent away from the spectral edges, generalizing the recent result of Ajanki et al. [‘Stability of the matrix Dyson equation and random matrices with correlations’, Probab. Theory Related Fields 173(1–2) (2019), 293–373] to allow slow correlation decay and arbitrary expectation. The main novel tool is
a systematic diagrammatic control of a multivariate cumulant expansion.},
  author       = {Erdös, László and Krüger, Torben H and Schröder, Dominik J},
  issn         = {2050-5094},
  journal      = {Forum of Mathematics, Sigma},
  publisher    = {Cambridge University Press},
  title        = {{Random matrices with slow correlation decay}},
  doi          = {10.1017/fms.2019.2},
  volume       = {7},
  year         = {2019},
}

@article{6186,
  abstract     = {We prove that the local eigenvalue statistics of real symmetric Wigner-type
matrices near the cusp points of the eigenvalue density are universal. Together
with the companion paper [arXiv:1809.03971], which proves the same result for
the complex Hermitian symmetry class, this completes the last remaining case of
the Wigner-Dyson-Mehta universality conjecture after bulk and edge
universalities have been established in the last years. We extend the recent
Dyson Brownian motion analysis at the edge [arXiv:1712.03881] to the cusp
regime using the optimal local law from [arXiv:1809.03971] and the accurate
local shape analysis of the density from [arXiv:1506.05095, arXiv:1804.07752].
We also present a PDE-based method to improve the estimate on eigenvalue
rigidity via the maximum principle of the heat flow related to the Dyson
Brownian motion.},
  author       = {Cipolloni, Giorgio and Erdös, László and Krüger, Torben H and Schröder, Dominik J},
  issn         = {2578-5885},
  journal      = {Pure and Applied Analysis },
  number       = {4},
  pages        = {615–707},
  publisher    = {MSP},
  title        = {{Cusp universality for random matrices, II: The real symmetric case}},
  doi          = {10.2140/paa.2019.1.615},
  volume       = {1},
  year         = {2019},
}

@inproceedings{7479,
  abstract     = {Multi-exit architectures, in which a stack of processing layers is interleaved with early output layers, allow the processing of a test example to stop early and thus save computation time and/or energy.  In this work, we propose a new training procedure for multi-exit architectures based on the principle of knowledge distillation. The method encourage searly exits to mimic later, more accurate exits, by matching their output probabilities.
Experiments  on  CIFAR100  and  ImageNet  show  that distillation-based training significantly improves the accuracy of early exits while maintaining state-of-the-art accuracy  for  late  ones.   The  method  is  particularly  beneficial when  training  data  is  limited  and  it  allows  a  straightforward extension to semi-supervised learning,i.e. making use of unlabeled data at training time. Moreover, it takes only afew lines to implement and incurs almost no computational overhead at training time, and none at all at test time.},
  author       = {Bui Thi Mai, Phuong and Lampert, Christoph},
  booktitle    = {IEEE International Conference on Computer Vision},
  isbn         = {9781728148038},
  issn         = {1550-5499},
  location     = {Seoul, Korea},
  pages        = {1355--1364},
  publisher    = {IEEE},
  title        = {{Distillation-based training for multi-exit architectures}},
  doi          = {10.1109/ICCV.2019.00144},
  volume       = {2019-October},
  year         = {2019},
}

@inproceedings{6677,
  abstract     = {The Fiat-Shamir heuristic transforms a public-coin interactive proof into a non-interactive argument, by replacing the verifier with a cryptographic hash function that is applied to the protocol’s transcript. Constructing hash functions for which this transformation is sound is a central and long-standing open question in cryptography.

We show that solving the END−OF−METERED−LINE problem is no easier than breaking the soundness of the Fiat-Shamir transformation when applied to the sumcheck protocol. In particular, if the transformed protocol is sound, then any hard problem in #P gives rise to a hard distribution in the class CLS, which is contained in PPAD. Our result opens up the possibility of sampling moderately-sized games for which it is hard to find a Nash equilibrium, by reducing the inversion of appropriately chosen one-way functions to #SAT.

Our main technical contribution is a stateful incrementally verifiable procedure that, given a SAT instance over n variables, counts the number of satisfying assignments. This is accomplished via an exponential sequence of small steps, each computable in time poly(n). Incremental verifiability means that each intermediate state includes a sumcheck-based proof of its correctness, and the proof can be updated and verified in time poly(n).},
  author       = {Choudhuri, Arka Rai and Hubáček, Pavel and Kamath Hosdurg, Chethan and Pietrzak, Krzysztof Z and Rosen, Alon and Rothblum, Guy N.},
  booktitle    = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019},
  isbn         = {9781450367059},
  location     = {Phoenix, AZ, United States},
  pages        = {1103--1114},
  publisher    = {ACM},
  title        = {{Finding a Nash equilibrium is no easier than breaking Fiat-Shamir}},
  doi          = {10.1145/3313276.3316400},
  year         = {2019},
}