SPRINGER-VERLAG, LONDON

Discrete Mathematics and Theoretical Computer Science Series

Springer London Series "Discrete Mathematics and Theoretical Computer Science" is produced in cooperation with the Centre for Discrete Mathematics and Theoretical Computer Science of the University of Auckland, New Zealand. This Series will bring to the research community information about the latest developments on the interface between mathematics and computing, especially in the areas of artificial intelligence, combinatorial optimization, computability and complexity, constructive algorithmics, quantum and molecular computation. It will focus on research monographs and proceedings of workshops and conferences, aimed at graduate students and professional researchers, and on textbooks, primarily at the senior undergraduate or beginning graduate level.

Springer-Verlag is one of the world's largest privately owned scientific publishing houses with main offices located in Berlin and Heidelberg in Germany and other major offices in New York, London, Paris, Tokyo, Hong Kong, Barcelona, Budapest, Vienna and Singapore.

Springer London has had its own publishing programme since 1987. The focus is on Computing, Medicine, Engineering, Mathematics, Astronomy and Food Science. Springer London currently publishes around 150 new books per year and 20 journals from its picturesque offices in Godalming, Surrey.

If you are interested in writing a book please contact the Series editors Douglas Bridges, Cristian S. Calude, or one of Springer London computer science team, Beverley Ford , Rebecca Mowat. Various instructions for authors can be dowloaded from here.

Sweetapple House -- Springer London's office

• D. S. Bridges, C. Calude, J. Gibbons, S. Reeves, I. Witten (eds.). Combinatorics, Complexity, Logic, Proceedings of DMTCS'96,
• L. Groves and S. Reeves (eds.) Formal Methods Pacific '97 ,
• G. J. Chaitin. The Limits of Mathematics. A course on information theory & the limits of formal reasoning
• C.S. Calude, J. Casti, M.J. Dinneen (eds.). Unconventional Models of Computation,
• K. Svozil. Quantum Logic,
• J. Grundy, M. Schwenke, T. Vickers (ed.). Proceedings of the International Refinement Workshop and Formal Methods Pacific'98,
• G. Paun (ed.). Computing with Biomolecules. Theory and Experiments,
• C. S. Calude (ed.). People and Ideas in Theoretical Computer Science,
• C. S. Calude, M. J. Dinneen (eds.). Combinatorics, Computation and Logic. Proceedings of DMTCS'99 and CATS'99,
• M. Mignotte, D. Stefanescu. Polynomials. An Algorithmic Approach,
• G.J. Chaitin. The Unknowable,
• C. Ding, T. Helleseth, H. Niederreiter (eds.). Sequences and Their Applications. Proceedings of SETA '98,
• C. S. Calude, G. Paun (eds.). Finite vs Infinite, Contributions to an Eternal Dilemma,
• Gh. Stefanescu. Network Algebra.
• I. Antoniou, C.S. Calude, M.J. Dinneen (eds.). Unconventional Models of Computation, UMC'2K
• G.J. Chaitin Exploring Randomness,
• C.S. Calude, M.J. Dinneen, S. Sburlan (eds.). Combinatorics, Computability, Logic, Proceedings of DMTCS'01.
• S. Rudeanu. Lattice Functions and Equations.
• C. Teuscher. Turing's Connectionism. An Investigation of Neural Network Architectures.
• T. Helleseth, P.V. Norway Kumar, K. Yang, (eds.). Sequences and their Applications, Proceedings of SETA'01.
• J. Kohlas. Information Algebras. Generic Structures for Inference.