ds.algorithms

  1. Is there any time efficient way of achieving the result of FKS hashing lemma?

  2. Minimizing SubModular Function: Cardinality

  3. Efficient algorithm for generating data dependency DAG from lists of memory ranges and access modes
  4. What is the fastest gradient based algorithm to get to criticality of a "nice" non-convex function?
  5. Knapsack with dependent profits (pairs of items)
  6. Optimal scheduling of Air Conditioning Units
  7. What is the fastest known algorithm for finding conjugacy classes?
  8. Minimum cost topological ordering

  9. Find a pair of nodes with maximum sum of distances in k given trees

  10. On complexity of ILP

  11. Diff Algorithms
  12. Check the match of the maximum of each subset
  13. Graph-related applications of the fast Fourier transform (and other algebraic algorithms)
  14. Algorithm to compute distance between powers

  15. Beating naive dynamic programming: examples similar to integer partitions?

  16. Is abelian group isomorphism in $\mathsf{AC^0}$?
  17. Minimal Cost of Eulerian Path
  18. Checking formulas with two quantifiers ($\forall \exists$) - 2QBF

  19. How to compute GCD efficiently?

  20. Is sorting $n$ real numbers in time $O(n \sqrt{\log n})$ and linear space possible?
  21. Polynomial-time algorithms with huge exponent/constant

  22. Is Normal centralizer problem in P?

  23. What is the maximum number of stable marriages for an instance of the Stable Marriage Problem?

  24. Complexity of Finding the Eigendecomposition of a Matrix

  25. Extended version of the paper "Consistent Hashing and Random Trees" with proofs

  26. What is the difference between PRAM and multi threading?
  27. OR-circuit complexity of a dense linear operator
  28. Cases of Linear programming known to be in $NC$?
  29. Is there some research about infinitely many-armed bandit with non-stationary assumption?

  30. Complexity of the simplex algorithm

  31. Finding the largest set of points of limited diameter (2)

  32. Can neural networks be used to devise algorithms?

  33. Continous work distribution algorithm with failover

  34. Difference between weak duality and strong duality?
  35. Frequency-Count List Accessing Algo - Why free transpositions?

  36. Convention for RAM machine models

  37. Number of maximally different DAG's in a digraph?

  38. Computing size of permutation group from generators
  39. Does the following problem have a classical name (e.g. max flow, stable matching, etc) and if so is there an efficient solution?
  40. Does there exist an ontology for algorithms?
  41. Time complexity for solving linear congruences?

  42. Suffix automata on a queue
  43. Data structures for subset and superset queries over a set of multisets

  44. What are some techniques for "balancing" a tree beside heavy-light and centroid decomposition?

  45. Amortized analysis of red-black trees

  46. Complexity of the mandelbrot set on rationals

  47. Minimum path edge-cover or minimum flow with unit capacities and DAGs
  48. \alpha-path on Euclidean graphs

  49. Have fixed parameter integer program algorithms ever been implemented for research use?

  50. What is wrong with this procedure to convert quadratic programming to convex quadratic programming?

  51. given a set of $n$ points in $d$-dimensional space and the basis vectors of some subspace, how to find all the points on that space?

  52. Finding a sub rectangle with maximum sum
  53. Preference based group generator

  54. How to continue this algorithm?

  55. Ant colony optimization for traveling salesman problem with changing graph-nodes/vertices

  56. Equal degree factoring of homogeneous polynomials over $\Bbb Q[x_1,\dots,x_n]$?

  57. Understanding performance of QFBV SMT solvers

  58. Algorithms to generate consecutive primes
  59. Is there a fast algorithm to quickly evaluate $a^{b^c}$ mod $n$?

  60. Using Pearson Correlation Coefficient in computing user/item similarity

  61. Permutation phrases with LR parsing

  62. Optimizing Maximum Weighted Matching (Edmonds Blossom)

  63. Practical/heuristic algorithm for multi set-cover
  64. How to find largest supergroup in polynomial time?
  65. Different algorithms for longest increasing subsequence

  66. What exactly did Lenstra prove on mixed integer linear program?

  67. What is known about computing distinct count range queries?

  68. Factoring with LLL when the form of the factors is given
  69. Finding k shortest Paths with Eppstein's Algorithm

  70. Complexity of Finding Optimal Synergistic Set Packings
  71. Difference between PRAM and machine model in dynamic multithreading
  72. On permanent mod $3^t$ computation
  73. Is it possible to approximate Maximum Independent Set in $O(2^k\text{poly}(n))$ time?
  74. Complexity of very sparse determinant

  75. Big gaps between RAM and Turing machine complexity
  76. Modifying Edmonds' Blossom Algorithm

  77. Is it possible to prove that, for a given problem, no optimal greedy algorithms exist?

  78. Graph factors of maximum weight

  79. What is known about counting bipartite perfect matching with average degree in $[2,3]$ and max degree $3$?

  80. Max-weight connected & co-connected subgraph problem
  81. Data Structure to calculate which interval a point lies in?
  82. Theoretical explanations for practical success of SAT solvers?

  83. What is known about learning a maximal independent set in a (very) sparse graph?

  84. Efficiently computing the union of all minimal unsatisfiable constraint sets in a first-order unification problem

  85. Is there a randomized algorithm for set-cover?

  86. How to construct an $(n,m,k)$ ``separating set''?
  87. How to calculate this string-dissimilarity function efficiently?
  88. Complexity of Homogenizing a String
  89. Complexity of $\{0,\pm1\}$ determinant in sparse cases?

  90. Finding an answer key given tests and scores

  91. Is it possible to unambiguously read back λ terms from interaction nets without node types?

  92. Algorithm for finding heavy hitters in a weighted stream
  93. Why is HyperLogLog (near-)optimal?
  94. Is berklemap-massey works on extention field

  95. Counting multiplicative closures

  96. Differences with Penalty

  97. Iterative algorithms and Lyapunov functions

  98. Complexity status of restricted k-clique

  99. Restricted k-set cover is in NL or L

  100. Off-policy Monte Carlo Control