Online computation and competitive analysis
Online computation and competitive analysis
On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
A mathematical theory of communication
ACM SIGMOBILE Mobile Computing and Communications Review
Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
On the Advice Complexity of Online Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
How much information about the future is needed?
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On the advice complexity of the k-server problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On online algorithms with advice for the k-server problem
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Advice complexity of online coloring for paths
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the advice complexity of the knapsack problem
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Online graph exploration with advice
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Hi-index | 0.00 |
What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is the concept of entropy by Shannon, and the concept of information content of binary strings by Chaitin and Kolmogorov. While these are doubtlessly great research instruments, they are hardly helpful in measuring the amount of information contained in particular objects. In a pursuit to overcome these limitations, we propose the notion of information content of algorithmic problems. We discuss our approaches and their possible usefulness in understanding the basic concepts of informatics, namely the concept of algorithms and the concept of computational complexity.