Algorithms and Data Structures
From MaRDI portal
Publication:5394269
DOI10.1007/11534273zbMath1161.68859OpenAlexW3010016474MaRDI QIDQ5394269
Mihai Pǎtraşcu, Ilya Baran, Erik D. Demaine
Publication date: 25 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11534273
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20)
Related Items
Fast algorithms for finding disjoint subsequences with extremal densities ⋮ It's all a matter of degree. Using degree information to optimize multiway joins ⋮ Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\) ⋮ Exact Weight Subgraphs and the k-Sum Conjecture ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Amplification and Derandomization without Slowdown ⋮ On Faster Integer Calculations Using Non-arithmetic Primitives ⋮ A subquadratic algorithm for 3XOR