Results 1 
8 of
8
A Theory of Program Size Formally Identical to Information Theory
, 1975
"... A new definition of programsize complexity is made. H(A;B=C;D) is defined to be the size in bits of the shortest selfdelimiting program for calculating strings A and B if one is given a minimalsize selfdelimiting program for calculating strings C and D. This differs from previous definitions: (1) ..."
Abstract

Cited by 333 (16 self)
 Add to MetaCart
A new definition of programsize complexity is made. H(A;B=C;D) is defined to be the size in bits of the shortest selfdelimiting program for calculating strings A and B if one is given a minimalsize selfdelimiting program for calculating strings C and D. This differs from previous definitions: (1) programs are required to be selfdelimiting, i.e. no program is a prefix of another, and (2) instead of being given C and D directly, one is given a program for calculating them that is minimal in size. Unlike previous definitions, this one has precisely the formal 2 G. J. Chaitin properties of the entropy concept of information theory. For example, H(A;B) = H(A) + H(B=A) + O(1). Also, if a program of length k is assigned measure 2 \Gammak , then H(A) = \Gamma log 2 (the probability that the standard universal computer will calculate A) +O(1). Key Words and Phrases: computational complexity, entropy, information theory, instantaneous code, Kraft inequality, minimal program, probab...
Algorithmic information theory
 IBM JOURNAL OF RESEARCH AND DEVELOPMENT
, 1977
"... This paper reviews algorithmic information theory, which is an attempt to apply informationtheoretic and probabilistic ideas to recursive function theory. Typical concerns in this approach are, for example, the number of bits of information required to specify an algorithm, or the probability that ..."
Abstract

Cited by 320 (19 self)
 Add to MetaCart
This paper reviews algorithmic information theory, which is an attempt to apply informationtheoretic and probabilistic ideas to recursive function theory. Typical concerns in this approach are, for example, the number of bits of information required to specify an algorithm, or the probability that a program whose bits are chosen by coin flipping produces a given output. During the past few years the definitions of algorithmic information theory have been reformulated. The basic features of the new formalism are presented here and certain results of R. M. Solovay are reported.
An Improved Algorithm For Finding Tree Decompositions Of Small Width
, 2000
"... We present a modification of Bodlaender's linear time algorithm that, for constant k, determines whether an input graph G has treewidth k and, if so, constructs a tree decomposition of G of width at most k. Our algorithm has the following additional feature: if G has treewidth greater than k then a ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
We present a modification of Bodlaender's linear time algorithm that, for constant k, determines whether an input graph G has treewidth k and, if so, constructs a tree decomposition of G of width at most k. Our algorithm has the following additional feature: if G has treewidth greater than k then a subgraph G^0 of G of treewidth greater than k is returned along with a tree decomposition of G^0 of width at most 2k. A consequence is that the fundamental disjoint rooted paths problem can now be solved in O(n^2) time. This is the primary motivation for this paper.
APPLICATION PLACEMENT ON A CLUSTER OF SERVERS
 INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
"... The Application Placement Problem (APP, for short) arises in hosting platforms: clusters of servers that are used for hosting large, distributed applications such as Internet services. Hosting platforms imply a business relationship between an entity called the platform provider and a number of enti ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
The Application Placement Problem (APP, for short) arises in hosting platforms: clusters of servers that are used for hosting large, distributed applications such as Internet services. Hosting platforms imply a business relationship between an entity called the platform provider and a number of entities called the application providers. The latter pay the former for the resources on the hosting platform, in return for which, the former provides guarantees on resource availability for the applications. This implies that a hosting platform should host only applications for which it has sufficient resources. The objective of the APP is to maximize the number of applications that can be hosted on the platform while satisfying their resource requirements. The complexity of the APP is studied here, with the following results. The general APP is NPhard; indeed, even restricted versions of the APP may not admit polynomialtime approximation schemes. However, several significant variants of the online version of the APP admit efficient approximation algorithms.
Instructions For Typesetting CameraReady Manuscripts Using T E X System
"... t title in 10 pt Times Roman uppercase and boldface. Please indicate a short title to be used as the running head. + Typeset names in 8 pt Times Roman, uppercase and lightface. Use footnotes only to indicate if permanent and present addresses are di#erent. Funding information should go in the Ackno ..."
Abstract
 Add to MetaCart
t title in 10 pt Times Roman uppercase and boldface. Please indicate a short title to be used as the running head. + Typeset names in 8 pt Times Roman, uppercase and lightface. Use footnotes only to indicate if permanent and present addresses are di#erent. Funding information should go in the Acknowledgment section. # Typeset a#liation and mailing addresses in 8 pt Times italic. Instructions for Typesetting Using T E XSystem should be spelt out in full when first used. Integers ten and below are to be spelt out. Italicize foreign language phrases (e.g., et al., apriori,in situ etc.). The text is to be typeset in 10 pt Times Roman, single spaced with baselineskip of 13 pt. Text area (excluding running title) is 6 inches (36 picas) wide and 8.2 inches (49 picas) high. Final pagination and insertion of running titles will be done by the publisher. Number each page of the manuscript lightly a
Journal of Computational Acoustics
"... d mailing addresses in 8 pt Times italic. 2. The Main Text Contributions are to be in English. Authors are encouraged to have their contributions checked for grammar. American spelling should be used. Abbreviations are allowed but should be spelt out in full when first used. Integers ten and below ..."
Abstract
 Add to MetaCart
d mailing addresses in 8 pt Times italic. 2. The Main Text Contributions are to be in English. Authors are encouraged to have their contributions checked for grammar. American spelling should be used. Abbreviations are allowed but should be spelt out in full when first used. Integers ten and below are to be spelt out. Italicize foreign language phrases (e.g., et al., apriori, in situ etc.). The text is to be typeset in 10 pt Times Roman, single spaced with baselineskip of 13 pt. Text area (excluding running title) is 6 inches (36 picas) wide and 8.2 inches (49 picas) high. Final pagination and insertion of running titles will be done by the publisher. Number each page of the manuscript lightly at the bottom with a blue pencil. 3. Major Headings Major headings should be typeset in bold with the first letter of important words capitalized. 3.1. Subheadings Subheadings should be typeset in bold italics, and capitalize the first letter of the first word only. 3.1.1. Subsubheadings
Full affiliations ‡ and mailing addresses
"... Full affiliations and mailing addresses The abstract should summarize the context, content and conclusions of the paper in less than 200 words. It should not contain any references or displayed equations. Typeset the abstract in 8 pt Times Roman with baselineskip of 10 pt, making an indentation of 1 ..."
Abstract
 Add to MetaCart
Full affiliations and mailing addresses The abstract should summarize the context, content and conclusions of the paper in less than 200 words. It should not contain any references or displayed equations. Typeset the abstract in 8 pt Times Roman with baselineskip of 10 pt, making an indentation of 1