Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
Latest Publications

TOTAL DOCUMENTS

113

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By ACM Press

9781450355599

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A friendly smoothed analysis of the simplex method

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188826 ◽

2018 ◽

Author(s):

Daniel Dadush ◽

Sophie Huiberts

Keyword(s):

Simplex Method ◽

Smoothed Analysis

Download Full-text

Extensor-coding

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188902 ◽

2018 ◽

Author(s):

Cornelius Brand ◽

Holger Dell ◽

Thore Husfeldt

Download Full-text

Discovering the roots: uniform closure results for algebraic classes under factoring

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188760 ◽

2018 ◽

Author(s):

Pranjal Dutta ◽

Nitin Saxena ◽

Amit Sinhababu

Download Full-text

Fast fencing

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188878 ◽

2018 ◽

Author(s):

Mikkel Abrahamsen ◽

Anna Adamaszek ◽

Karl Bringmann ◽

Vincent Cohen-Addad ◽

Mehran Mehr ◽

...

Download Full-text

Shape of diffusion and size of monochromatic region of a two-dimensional spin system

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188836 ◽

2018 ◽

Author(s):

Hamed Omidvar ◽

Massimo Franceschetti

Keyword(s):

Spin System ◽

Two Dimensional

Download Full-text

A matrix expander Chernoff bound

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188890 ◽

2018 ◽

Author(s):

Ankit Garg ◽

Yin Tat Lee ◽

Zhao Song ◽

Nikhil Srivastava

Keyword(s):

Download Full-text

A simply exponential upper bound on the maximum number of stable matchings

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188848 ◽

2018 ◽

Author(s):

Anna R. Karlin ◽

Shayan Oveis Gharan ◽

Robbie Weber

Keyword(s):

Upper Bound ◽

Stable Matchings

Download Full-text

Non-malleable secret sharing

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188872 ◽

2018 ◽

Author(s):

Vipul Goyal ◽

Ashutosh Kumar

Keyword(s):

Download Full-text

A constant-factor approximation algorithm for the asymmetric traveling salesman problem

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188824 ◽

2018 ◽

Author(s):

Ola Svensson ◽

Jakub Tarnawski ◽

László A. Végh

Keyword(s):

Approximation Algorithm ◽

Traveling Salesman Problem ◽

Constant Factor ◽

Traveling Salesman ◽

Asymmetric Traveling Salesman Problem

Download Full-text

Towards tight approximation bounds for graph diameter and eccentricities

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188950 ◽

2018 ◽

Author(s):

Arturs Backurs ◽

Liam Roditty ◽

Gilad Segal ◽

Virginia Vassilevska Williams ◽

Nicole Wein

Keyword(s):

Download Full-text