Latest Research in Data Structures and Algorithms

Top Research Topics in Data Structures and Algorithms

• Data Structures and Algorithms — 90 papers
• Computational Complexity — 52 papers
• Logic in Computer Science — 50 papers
• Logic — 39 papers
• Information Theory — 25 papers
• Computability, Logic, AI Algorithms — 24 papers
• Logic, programming, and type systems — 19 papers
• Formal Languages and Automata Theory — 18 papers
• Combinatorics — 18 papers
• Computer Science and Game Theory — 16 papers

Highest-Cited Papers

1. Strong Equivalence in Answer Set Programming with Constraints (1 citations)
2. On the Bit Size of Sum-of-Squares Proofs for Symmetric Formulations (1 citations)
3. The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages (1 citations)
4. Where Formal Libraries Spend Their Axioms: A Cross-Foundation Measurement, and an Avoidable Classical Dependency in Lean's omega
5. Beyond Kernel Verification: The Missing Engineering Layer of Mathematics
6. Where Formal Libraries Spend Their Axioms: A Cross-Foundation Measurement, and an Avoidable Classical Dependency in Lean's omega
7. Addendum to the Article "Formula of the Universe"
8. Minimal Non-Units, Prime-Support Boundaries, and Batch Unit Testing: A Structural Reformulation and Open Decision Problem for Deterministic Integer Factorization
9. Beyond Kernel Verification: The Missing Engineering Layer of Mathematics
10. Computable Bayesian Epistemology
11. Minimal Non-Units, Prime-Support Boundaries, and Batch Unit Testing: A Structural Reformulation and Open Decision Problem for Deterministic Integer Factorization
12. Addendum to the Article "Formula of the Universe"
13. Beyond Kernel Verification: The Missing Engineering Layer of Mathematics
14. Beyond Kernel Verification: The Missing Engineering Layer of Mathematics
15. Intuitionistic Linear Logic with Subexponentials: Type Theory, Categorical Models and Realisability
16. The Greedy Binary Search Tree is Non-trivially Competitive
17. String Representation Based on Substring Equation Systems
18. Improved Rate-versus-Distance Upper Bounds for LDPC Codes
19. Reachability in 3-VAS
20. Cluster Deletion is as Hard to Approximate as Vertex Cover