Latest Research in Information Theory

Top Research Topics in Information Theory

• Computability, Logic, AI Algorithms — 36 papers
• Information Theory — 11 papers
• Cellular Automata and Applications — 5 papers
• Complexity and Algorithms in Graphs — 5 papers
• Data Structures and Algorithms — 4 papers
• Computer Science and Game Theory — 4 papers
• Probability — 4 papers
• DNA and Biological Computing — 3 papers
• Optimization and Control — 3 papers
• Advanced Bandit Algorithms Research — 3 papers

Highest-Cited Papers

1. Gödel's Limits: Unprovable Truths and the Ordinal Strength of Formal Systems — E8 Intelligence Research
2. Generalized bipolar fuzzy GK-subalgebras and ideals in GK-algebras
3. An $\tilde Ω(\log n \log m)$ Information-Theoretic Lower Bound for Randomized Online Set Cover
4. Positive Evidence and Calibrated Mediation in Relational Spatial Reconstruction
5. Induxion
6. NP-Hardness and a Fixed-Parameter Algorithm for Translocation Distance
7. Provable Guarantees for Spectral Structured Prediction
8. Auxiliary Codes and the Generalized Packing-Covering Conjecture
9. Strategyproof Aggregation in Euclidean Spaces: Rigidity and Median Optimality
10. On Sequence Reconstruction Problem for q-ary Deletion Channels
11. The Undecidability of Halting: A Diagonal Proof of Computable Limits — E8 Intelligence Research
12. The Undecidability of Halting: A Diagonal Proof of Computable Limits — E8 Intelligence Research
13. Conservation of Quantitative Information under Change of Representation: Universal Carry Rigidity of Optimal Lossless Finite Quantity Codes
14. Static output-feedback stabilization is NP-hard
15. The price of anarchy in the max-distance network creation game is not constant
16. Structural Complexity of One-Factor Sparse Portfolio Selection: Exact Algorithms, Parameterized Hardness, and Restricted Circuit Lower Bounds
17. Structural Complexity of One-Factor Sparse Portfolio Selection: Exact Algorithms, Parameterized Hardness, and Restricted Circuit Lower Bounds
18. The Support-Set Calculus and the Algebra of Dyadic Blocks
19. The Support-Set Calculus and the Algebra of Dyadic Blocks
20. Structural Complexity of One-Factor Sparse Portfolio Selection: Exact Algorithms, Parameterized Hardness, and Restricted Circuit Lower Bounds