Showing 1 - 20 results of 62 for search '"Symposium on Discrete Algorithms"', query time: 1.41s Refine Results
  1. 1
    Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Knows"
    “...Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms...”
    Get fulltext
    Article
  2. 2
    Where computer vision needs help from computer science
    by Freeman, William T.
    Published 2011
    Get fulltext
    Article
  3. 3
    A near-linear time algorithm for constructing a cactus representation of minimum cuts
    Get fulltext
    Article
  4. 4
    An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
    Get fulltext
    Article
  5. 5
    On the complexity of approximating a nash equilibrium
    by Daskalakis, Constantinos
    Published 2012
    Get fulltext
    Article
  6. 6
    Better approximations for Tree Sparsity in Nearly-Linear Time
    Get fulltext
    Article
  7. 7
    Polynomiality for Bin Packing with a Constant Number of Item Types
    Get fulltext
    Article
  8. 8
    Random contractions and sampling for hypergraph and hedge connectivity
    Get fulltext
    Article
  9. 9
    Lower bounds for sparse recovery
    Get fulltext
    Article
  10. 10
    Beyond locality-sensitive hashing
    Get fulltext
    Article
  11. 11
    Belief Propagation for Min-Cost Network Flow: Convergence & Correctness
    Get fulltext
    Article
  12. 12
    Testing Poisson Binomial Distributions
    Get fulltext
    Article
  13. 13
    (Nearly) sample-optimal sparse fourier transform
    Get fulltext
    Article
  14. 14
    Continuous local search
    Get fulltext
    Article
  15. 15
    Testing ising models
    by Daskalakis, C, Dikkala, N, Kamath, G
    Published 2022
    Get fulltext
    Article
  16. 16
    Embedding Stacked Polytopes on a Polynomial-Size Grid
    by Demaine, Erik D., Schulz, Andre
    Published 2011
    Get fulltext
    Article
  17. 17
    Simple and practical algorithm for sparse fourier transform
    Get fulltext
    Article
  18. 18
    Composable core-sets for determinant maximization problems via spectral spanners
    by Indyk, Piotr
    Published 2021
    Get fulltext
    Article
  19. 19
    A simple combinatorial algorithm for submodular function minimization
    by Iwata, Satoru, Orlin, James B.
    Published 2011
    Get fulltext
    Article
  20. 20
    Lower Bounds for Randomized Consensus under a Weak Adversary
    by Attiya, Hagit, Censor-Hillel, Keren
    Published 2011
    Get fulltext
    Article
Search Tools: Get RSS Feed — Email this Search