@article{compref662,
   author = {Young,P and Parkinson,S and Lees,M},
   year = {1996},
   title = {Simplicty out of complexity in environmental modelling: Occam's razor revisited},
   journal = {Journal of Applied Statistics},
   volume = {23},
   pages = {165-210}
}

@article{compref639,
   author = {Meer,K},
   year = {1995},
   title = {On the Relations Between Discrete and Continuous Complexity Theory},
   journal = {Mathematical Logic Quarterly},
   volume = {41},
   pages = {281-286}
}

@article{compref82,
   author = {Chaitin,GJ},
   year = {1994},
   title = {Randomness and Complexity in Pure Mathematics},
   journal = {International Journal of Bifurcation and Chaos},
   volume = {4},
   pages = {3-15}
}

@article{compref59,
   author = {Bowden,K},
   year = {1994},
   title = {Hierarchical tearing: an efficient holographic algorithm for system decomposition},
   journal = {International Journal of General Systems},
   volume = {23},
   pages = {23-37}
}

@article{compref88,
   author = {Cohen,DE and Madlener,K and Otto,F},
   year = {1993},
   title = {Seperating the Intrinsic Complexity and the Derivational Complexity of the Word Problem for Finitely Presented Groups},
   journal = {Mathematical Logic Quarterly},
   volume = {39},
   pages = {143-157}
}

@article{compref126,
   author = {Gallo,G and Longo,G and Pallottino,S and Sang Nguyen},
   year = {1993},
   title = {Directed Hypergraphs and Applications},
   journal = {Discrete Applied Mathematics},
   volume = {42},
   pages = {177-201}
}

@book{compref71,
   author = {Casti,JL},
   year = {1992},
   title = {Reality Rules: II. picturing the world in Mathematics: The frontier},
   publisher = {John-Wiley},
   address = {New York}
}

@book{compref70,
   author = {Casti,JL},
   year = {1992},
   title = {Reality Rules: I. picturing the world in Mathematics: The fundermentals},
   publisher = {John Wiley},
   address = {New York}
}

@article{compref326,
   author = {Traub,JF and Wozniakowski,H},
   year = {1991},
   title = {Information-Based Complexity: New Questions for Mathematicians},
   journal = {Mathematical Intelligencer},
   volume = {13},
   pages = {34-43}
}

@article{compref318,
   author = {Sumners,DW},
   year = {1990},
   title = {Complexity Measures for Random Knots},
   journal = {Computers & Chemistry},
   volume = {14},
   pages = {275-279}
}

@book{compref56,
   author = {B”rger,E},
   year = {1989},
   title = {Computability, Complexity, Logic},
   publisher = {North Holland},
   address = {Amsterdam}
}

@article{compref336,
   author = {Vyugin,VV},
   year = {1988},
   title = {On the Defect of Randomness of a Finite Object with respect to Measures with given Complexity Bounds},
   journal = {Theory of Probability and its Applications},
   volume = {32},
   pages = {508-512}
}

@article{compref226,
   author = {Makinen,E},
   year = {1988},
   title = {2 Complexity Measures for Context-free Languages},
   journal = {International Journal of Computer Mathematics},
   volume = {1},
   pages = {29-34}
}

@article{compref100,
   author = {Cuhrov,IP},
   year = {1987},
   title = {On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity},
   journal = {Lecture Notes in Computer Science},
   volume = {278},
   pages = {92-94}
}

@incollection{compref51,
   author = {Berlinski,D},
   year = {1986},
   title = {The Language of Life},
   booktitle = {Complexity Language and Life: Mathematical Approaches},
   editor = {Casti,JL and Karlquist,A},
   publisher = {Springer-Verlag},
   address = {Berlin},
   pages = {231-267}
}

@book{compref285,
   author = {Rosen,R},
   year = {1985},
   title = {Anticipatory Systems},
   publisher = {Pergamon},
   address = {New York}
}

@book{compref73,
   author = {Casti,JL and Karquist,A (Eds.)},
   year = {1985},
   title = {Complexity, Language and Life: Mathematical Models},
   publisher = {Springer-Verlag},
   address = {Berlin}
}

@misc{compref221,
   author = {Lov sz,L},
   year = {1985},
   title = {The Mathematical Notion of Complexity},
   howpublished = {Inst.fur Okonometrie u. Operations Research preprint, Univerity of Bonn}
}

@book{compref324,
   author = {Traub,JF and Wasilkowski,GW and Wozniakowski,H},
   year = {1983},
   title = {Information, Uncertainty, Complexity},
   publisher = {Addison-Wesley},
   address = {Reading, MA}
}

@article{compref2,
   author = {Aaderaa,SO and B”rger,E},
   year = {1981},
   title = {The equivalence of Horn and network complexity of Boolean functions},
   journal = {Acta Informatica},
   volume = {15},
   pages = {303-307}
}

@article{compref227,
   author = {Maklad,MS and Nichols,ST},
   year = {1980},
   title = {A New Approach to Model Structure Discrimination},
   journal = {IEEE Transactions on Systems, Man and Cybernetics},
   volume = {10},
   pages = {78-84}
}

@article{compref112,
   author = {Ebeling,W and Jimenez-Montano,MA},
   year = {1980},
   title = {On Grammars, Complexity and Information Measures of Biologoical Macromolecules},
   journal = {Mathematical Bioscience},
   volume = {52},
   pages = {53-71}
}

@book{compref296,
   author = {Savage,JE},
   year = {1976},
   title = {Complexity of Computing},
   publisher = {},
   address = {}
}

@article{compref184,
   author = {Kelmans,AK},
   year = {1976},
   title = {A Comparison of Graphs by their number of spanning trees},
   journal = {Discrete Mathematics},
   volume = {16},
   pages = {241-261}
}

@article{compref54,
   author = {Blum,L and Blum,M},
   year = {1975},
   title = {Toward a Mathematical Theory of Inductive Inference},
   journal = {Information and Control},
   volume = {35},
   pages = {125-155}
}

@misc{compref697,
   author = {Van Emden,MH},
   year = {1971},
   title = {An Analysis of Complexity},
   howpublished = {Mathematical Centre Tracts, Mathematisch Centrum Amsterdam, Amsterdam, 1971}
}

@article{compref26,
   author = {Ausiello,G},
   year = {1971},
   title = {Abstract Computational Complexity and Cycling Computations},
   journal = {Journal of Computer and System Sciences},
   volume = {5},
   pages = {118-128}
}

@incollection{compref236,
   author = {Meyer,AR and Ritchie,DM},
   year = {1967},
   title = {The Complexity of Loop Programs},
   booktitle = {Proceedings of the 22nd National Conference},
   editor = {   publisher = {Thompson Book Company},
   address = {Washington DC},
   pages = {465-469}
}

@article{compref272,
   author = {Ramamoorthy,CV},
   year = {1966},
   title = {An analysis of graphs by connectivity considerations},
   journal = {Journal of the Association of Computing Machinery},
   volume = {13},
   pages = {211-222}
}

@article{compref79,
   author = {Chaitin,GJ},
   year = {1966},
   title = {On the Length of Programs for Computing Finite Binary Sequences},
   journal = {Journal of the Association of Computing Machinery},
   volume = {13},
   pages = {547-569}
}

@book{compref299,
   author = {Shannon,CE and Weaver,W},
   year = {1949},
   title = {The Mathematical Theory of Communication},
   publisher = {University of Illinois Press},
   address = {Urbana, Illinois}
}

@article{compref135,
   author = {G”del,K},
   year = {1936},
   title = {On the length of proofs},
   journal = {Ergebnisse eines mathematischen Kolloquiums},
   volume = {7},
   pages = {23-24}
}