Latest Research in Data Structures and Algorithms

Top Research Topics in Data Structures and Algorithms

• Computability, Logic, AI Algorithms — 14 papers
• Data Structures and Algorithms — 6 papers
• Logic in Computer Science — 4 papers
• Complexity and Algorithms in Graphs — 4 papers
• Advanced Mathematical Theories and Applications — 4 papers
• Computational Geometry — 4 papers
• Combinatorics — 3 papers
• Formal Methods in Verification — 3 papers
• Computer Science and Game Theory — 3 papers
• Polynomial and algebraic computation — 2 papers

Highest-Cited Papers

1. The Bottom of the Shub–Smale Tau Conjecture: an Exact Census of Integer Roots for Constant-Free Straight-Line Programs of Length at Most Eight
2. What Is a Syntax? Intrinsic Generation and the Finitary Generation Thesis
3. The Bottom of the Shub–Smale Tau Conjecture: an Exact Census of Integer Roots for Constant-Free Straight-Line Programs of Length at Most Eight
4. NEXP-Completeness of Existential Presburger Arithmetic with Divisibility
5. COMPUTABLE SCOTT SENTENCES AND THE FRIEDMAN–STANLEY EMBEDDING
6. The set-theoretic Kaufmann–Clote question
7. A polyhedral characterization of worker-quasi-stable matchings
8. Metric Weighted Edit Distance: $(3+\varepsilon)$-Approximation in $\widetilde O_\varepsilon(N^{1.6})$ Time
9. Affine modal propositional logic
10. Fixed-Anchor Euclidean TOPSIS for Prefix-Pruning Label Search under a Global Lower-Envelope Condition
11. Context-Free Fixed Points and Complete Classification of Orbits in Picard Iteration for Guarded Power Language Operators
12. Almost-Everywhere Near-Cubic Wire Lower Bounds for SYM ◦THR and THR ◦THR
13. Almost-Everywhere Near-Cubic Wire Lower Bounds for SYM ◦THR and THR ◦THR
14. A Recurrence Converse for Identity Persistence: The Verdict Channel and the Storage–Persistence Capacity Gap
15. The Hardest Math Problems Are Defined by One Structural Insight, Not Complexity — E8 Intelligence Research
16. A Recurrence Converse for Identity Persistence: The Verdict Channel and the Storage–Persistence Capacity Gap
17. Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231
18. Dense Weak Hiding: Closing Complexity Gaps in Nonconvex and PL Finite-Sum Optimization under Individual Smoothness
19. Computational Directional Asymmetry: A Distribu- tional Reformulation of P vs NP
20. Computational Directional Asymmetry: A Distribu- tional Reformulation of P vs NP