rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Beyond worst-case analysis of algorithms
  name:
    name part: Roughgarden, Tim
    role:
      role term: editor.
  name:
    name part: Cambridge University Press
  type of resource: text
  genre: bibliography
  genre: Electronic books.
  origin info:
    place:
      place term: enk
    date issued: 2021
    copyright date: 2021
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource.
  table of contents: Machine generated contents note: Forward Dan Spielman; Preface; 1. Introduction Tim Roughgarden; Part I. Refinements of Worst-Case Analysis: 2. Parameterized algorithms Fedor Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi; 3. From adaptive analysis to instance optimality Jérémy Barbay; 4. Resource augmentation Tim Roughgarden; Part II. Deterministic Models of Data: 5. Perturbation resilience Konstantin Makarychev and Yury Makarychev; 6. Approximation stability and proxy objectives Avrim Blum; 7. Sparse recovery Eric Price; Part III. Semi-Random Models: 8. Distributional analysis Tim Roughgarden; 9. Introduction to semi-random models Uriel Feige; 10. Semi-random stochastic block models Ankur Moitra; 11. Random-order models Anupam Gupta and Sahil Singla; 12. Self-improving algorithms C. Seshadhri; Part IV. Smoothed Analysis: 13. Smoothed analysis of local search Bodo Manthey; 14. Smoothed analysis of the simplex method Daniel Dadush and Sophie Huiberts; 15. Smoothed analysis of Pareto curves in multiobjective optimization Heiko Röglin; Part V. Applications in Machine Learning and Statistics: 16. Noise in classification Maria-Florina Balcan and Nika Haghtalab; 17. Robust high-dimensional statistics Ilias Diakonikolas and Daniel Kane; 18. Nearest-neighbor classification and search Sanjoy Dasgupta and Samory Kpotufe; 19. Efficient tensor decomposition Aravindan Vijayaraghavan; 20. Topic models and nonnegative matrix factorization Rong Ge and Ankur Moitra; 21. Why do local methods solve nonconvex problems? Tengyu Ma; 22. Generalization in overparameterized models Moritz Hardt; 23. Instance-optimal distribution testing and learning Gregory Valiant and Paul Valiant; Part VI. Further Applications: 24. Beyond competitive analysis Anna R. Karlin and Elias Koutsoupias; 25. On the unreasonable effectiveness of satisfiability solvers Vijay Ganesh and Moshe Vardi; 26. When simple hash functions suffice Kai-Min Chung, Michael Mitzenmacher and Salil Vadhan; 27. Prior-ind…
  note: edited by Tim Roughgarden.
  note: Electronic resource.
  note: Includes bibliographical references and index.
  subject:
    topic: Computer algorithms
  subject:
    topic: Computer programming
  classification: QA76.9.A43 B48 2021
  classification: 005.13
  classification: COM051300 COM051300
  related item:
    title info:
      title: Beyond worst-case analysis of algorithms
    origin info:
      publisher: New York : Cambridge University Press, 2021.
    identifier: (DLC) 2020049362
  identifier: 9781108637435
  identifier: 1108637434
  identifier: 9781108494311
  identifier: 2020049363
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: NhCcYBP
    record creation date: 201109
    record change date: 20210422112535.0
    record identifier: in00004408643