Latest Research in Data Structures and Algorithms
62 research papers · 0.1 average citations · 2026 median publication year
Top Research Topics in Data Structures and Algorithms
- Logic in Computer Science — 11 papers
- Data Structures and Algorithms — 9 papers
- Logic — 7 papers
- Databases — 5 papers
- Logic, Reasoning, and Knowledge — 4 papers
- Philosophy and Theoretical Science — 3 papers
- Formal Languages and Automata Theory — 3 papers
- Quantum and Classical Electrodynamics — 3 papers
- Logic, programming, and type systems — 2 papers
- Advanced Algebra and Logic — 2 papers
Highest-Cited Papers
- THE PROOF IS IN THE CHECKING
- History-Deterministic Büchi Automata are Succinct
- Certified Panic Mode: Repair-Invariant Error Recovery for Maximal-Munch Lexing
- Mathematical Explanations and Axioms as Rules
- Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set
- Explorable Parity Automata
- Universal Properties of Petri Net Unfoldings
- Fuzzy directed simulations for fuzzy modal logics over residuated lattices
- Answering Conjunctive Queries with Aggregations under Updates
- Certified Elimination of Source Candidates Under Capacity, Transit-Time, and Deadline Constraints
- Expressive Power of Property Graph Constraint Languages
- Exact Complexity of the Satisfiability Problem for Strategy Logic
- Deciding Amalgamation Beyond Arity Two: The Semantic Horn Case
- The Verification Boundary: Exact Limits of Verification by Bounded Systems: Identification, Generation, Computation, Implementation, Correspondence — and the Forced Routing at Each Limit
- Significance of the General Self-Reference Calculus Explanatory Note for Paper 26 of the NEMS Suite
- A Formal Theory of Transputation Closure, Internal Adjudication, and Non-Algorithmic Continuation Selection
- Significance of the General Self-Reference Calculus Explanatory Note for Paper 26 of the NEMS Suite
- Significance of the General Self-Reference Calculus Explanatory Note for Paper 26 of the NEMS Suite
- Getting to the Root: A Combined Complexity Perspective on Consistent Query Answering
- Intuitionistic logic of a binary modality