SubIndex on MATHS (BibTex)

• Young,P; Parkinson,S; Lees,M; 1996, Simplicty out of complexity in environmental modelling: Occam's razor revisited, Journal of Applied Statistics, 23, 165-210
• Meer,K; 1995, On the Relations Between Discrete and Continuous Complexity Theory, Mathematical Logic Quarterly, 41, 281-286
• Chaitin,GJ; 1994, Randomness and Complexity in Pure Mathematics, International Journal of Bifurcation and Chaos, 4, 3-15
• Bowden,K; 1994, Hierarchical tearing: an efficient holographic algorithm for system decomposition, International Journal of General Systems, 23, 23-37
• Cohen,DE; Madlener,K; Otto,F; 1993, Seperating the Intrinsic Complexity and the Derivational Complexity of the Word Problem for Finitely Presented Groups, Mathematical Logic Quarterly, 39, 143-157
• Gallo,G; Longo,G; Pallottino,S; Sang Nguyen; 1993, Directed Hypergraphs and Applications, Discrete Applied Mathematics, 42, 177-201
• Casti,JL; 1992, Reality Rules: II. picturing the world in Mathematics: The frontier, John-Wiley, New York
• Casti,JL; 1992, Reality Rules: I. picturing the world in Mathematics: The fundermentals, John Wiley, New York
• Traub,JF; Wozniakowski,H; 1991, Information-Based Complexity: New Questions for Mathematicians, Mathematical Intelligencer, 13, 34-43
• Sumners,DW; 1990, Complexity Measures for Random Knots, Computers & Chemistry, 14, 275-279
• B”rger,E; 1989, Computability, Complexity, Logic, North Holland, Amsterdam
• Vyugin,VV; 1988, On the Defect of Randomness of a Finite Object with respect to Measures with given Complexity Bounds, Theory of Probability and its Applications, 32, 508-512
• Makinen,E; 1988, 2 Complexity Measures for Context-free Languages, International Journal of Computer Mathematics, 1, 29-34
• Cuhrov,IP; 1987, On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity, Lecture Notes in Computer Science, 278, 92-94
• Berlinski,D; 1986, The Language of Life, in Complexity Language and Life: Mathematical Approaches, Eds.Casti,JL; Karlquist,A; , Springer-Verlag, Berlin, pages 231-267
• Rosen,R; 1985, Anticipatory Systems, Pergamon, New York
• Casti,JL; Karquist,A (Eds.); 1985, Complexity, Language and Life: Mathematical Models, Springer-Verlag, Berlin
• Lov sz,L; 1985, The Mathematical Notion of Complexity, Inst.fur Okonometrie u. Operations Research preprint, Univerity of Bonn
• Traub,JF; Wasilkowski,GW; Wozniakowski,H; 1983, Information, Uncertainty, Complexity, Addison-Wesley, Reading, MA
• Aaderaa,SO; B”rger,E; 1981, The equivalence of Horn and network complexity of Boolean functions, Acta Informatica, 15, 303-307
• Maklad,MS; Nichols,ST; 1980, A New Approach to Model Structure Discrimination, IEEE Transactions on Systems, Man and Cybernetics, 10, 78-84
• Ebeling,W; Jimenez-Montano,MA; 1980, On Grammars, Complexity and Information Measures of Biologoical Macromolecules, Mathematical Bioscience, 52, 53-71
• Savage,JE; 1976, Complexity of Computing, ,
• Kelmans,AK; 1976, A Comparison of Graphs by their number of spanning trees, Discrete Mathematics, 16, 241-261
• Blum,L; Blum,M; 1975, Toward a Mathematical Theory of Inductive Inference, Information and Control, 35, 125-155
• Van Emden,MH; 1971, An Analysis of Complexity, Mathematical Centre Tracts, Mathematisch Centrum Amsterdam, Amsterdam, 1971 (New)
• Ausiello,G; 1971, Abstract Computational Complexity and Cycling Computations, Journal of Computer and System Sciences, 5, 118-128
• Meyer,AR; Ritchie,DM; 1967, The Complexity of Loop Programs, in Proceedings of the 22nd National Conference, Eds., Thompson Book Company, Washington DC, pages 465-469
• Ramamoorthy,CV; 1966, An analysis of graphs by connectivity considerations, Journal of the Association of Computing Machinery, 13, 211-222
• Chaitin,GJ; 1966, On the Length of Programs for Computing Finite Binary Sequences, Journal of the Association of Computing Machinery, 13, 547-569
• Shannon,CE; Weaver,W; 1949, The Mathematical Theory of Communication, University of Illinois Press, Urbana, Illinois
• G”del,K; 1936, On the length of proofs, Ergebnisse eines mathematischen Kolloquiums, 7, 23-24