Publications
Search

Publications :: Search

Show venue

On this page you see the details of the selected venue.

    Conference
    Name: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017
    URL: http://doi.acm.org/10.1145/3055399
    DBLP: db/conf/stoc/stoc2017.html
    Bookmark:

    Below you find the publications assigned to this venue.

    Show item 1 to 10 of 110  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod.
    Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Fabrizio Grandoni, Bundit Laekhanukit.
    Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Michael A. Forbes, Amir Shpilka, Ben lee Volk.
    Succinct hitting sets and barriers to proving algebraic circuits lower bounds.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Xi Chen, Igor Carboni Oliveira, Rocco A. Servedio.
    Addition is exponentially harder than counting for shallow monotone circuits.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Andris Ambainis, Martins Kokainis.
    Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Damian Straszak, Nisheeth K. Vishnoi.
    Real stable polynomials and matroids: optimization and counting.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Amnon Ta-Shma.
    Explicit, almost optimal, epsilon-balanced codes.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Yannai A. Gonczarowski, Noam Nisan.
    Efficient empirical revenue maximization in single-parameter auction environments.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Assaf Naor, Robert Young.
    The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of log n.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Mohsen Ghaffari, Fabian Kuhn, Yannic Maus.
    On the complexity of local distributed graph problems.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Show item 1 to 10 of 110  

    Your query returned 110 matches in the database.