61. MathInfo2002 Colloquium on Mathematics and Computer Science Algorithms, Trees, combinatorics and Probabilities. Universit© de Versailles, France; 1619 September 2002. http://www.prism.uvsq.fr/MathInfo2002/

Colloquium on Mathematics and Computer Science : Algorithms, Trees, Combinatorics and Probabilities September 16-19, 2002 45, avenue des Etats-Unis 78035 Versailles cedex - France The third Colloquium on Mathematics and Computer Science will take place in Vienna (Austria) on September 13-17, 2004. Welcome to the home page of the Second International Colloquium on Mathematics and Computer Science. On this site you will find the following informations : Photo album of the colloquium Problems presented at the open problems session ( postscript file here) Scientific program How to get there Social program Learn here about the town of Versailles , including its history and famous castle Scientific committee Scope Organizing committee ... Invited speakers email : mathinfo@prism.uvsq.fr Registration Some hotels in Paris and Versailles Sponsors

62. Index Symposium at the University of Durham, UK; 1626 July 2001. http://www.ma.ic.ac.uk/~ivanov/index.htl

Groups, Geometry and Combinatorics University of Durham, Durham, UK July 16-26, 2001 Sponsored by: London Mathematical Society (LMS) The Engineering and Physical Sciences Research Council (EPSRC) Organizers: Sasha Ivanov (Imperial College, London, UK) Martin Liebeck (Imperial College, London, UK) ... Map ABSTRACTS (final) dabstrac.tex dabstrac.dvi This page was created by Denis Ivanov

63. Siaw-Lynn Ng Royal Holloway, University of London information security, finite geometry and combinatorics. http://www.isg.rhul.ac.uk/~slng/

Siaw-Lynn Ng Contents Contact details Research interest and publications CV Footnotes ... Back to ISG Home Page Contact details I am currently a lecturer at Royal Holloway, University of London. My contact address is Dr Siaw-Lynn Ng Maths Department Royal Holloway University of London Egham Surrey TW20 0EX UK Tel: 01784 414397 Fax: 01784 430766 Email to S.Ng@rhul.ac.uk Back to contents list Research interest and publications My main research interests are information security, finite geometry and combinatorics. My PhD thesis My PhD thesis is entitled ``On covers of point sets in finite geometries'' ( postscript version or pdf version ). The work includes constructions of minimal sets of points covering a line in finite projective planes, as well as a study on a family of extended generalised quadrangles and a construction of a new example. The abstract is available in postscript and pdf formats. Papers and potential papers ... A characterization of posets that are nearly antichains. S.-L. Ng. To appear in Order.

64. TestLothaire The 1983 edition of M. Lothaire s combinatorics on Words , Encyclopedia of Mathematics, Vol. 17, AddisonWesley has been reprinted in 1997 at Cambridge http://www-igm.univ-mlv.fr/~berstel/Lothaire/

Lothaire's Books This is the third book in the Lothaire's series, following the volumes ``Combinatorics on Words'' and ``Algebraic Combinatorics on Words'' already published. Available at Cambridge University Press since july, 2005 Its objective is to present in a unified manner the various applications of combinatorics on words. The application areas include core algorithms for text processing, natural language processing, speech processing, bioinformatics, and several areas of applied mathematics such as combinatorial enumeration and fractal analysis. The intended audience is the general scientific community. No special knowledge is needed, and familiarity with the application areas or with the material covered by the previous volumes is not required. In particular, the content, including problems and algorithms, is accessible to anyone working in the area of computer science. As with the previous volumes, this book is written in collaboration by a group of authors, under the guidance of the editors. Content Implementation of algorithms Solutions to problems This book covers developments on new topics in the domain of Combinatorics on Words.

65. Johann Radon Institute For Computational And Applied Mathematics Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences (–AW). Finite Fields, Number Theory, Coding Theory, Pseudorandom Numbers, Cryptology, combinatorics. http://www.ricam.oeaw.ac.at/people/page/winterhof/personal.html

Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy of Sciences (ÖAW) Home People Research Groups and Topics ... Location/Contact Search Personal Links My bibliography MathSciNet Zentralblatt Math My lecture notes: Zahlentheoretische Methoden in der Kryptographie I Zahlentheoretische Methoden in der Kyptographie II Codierungstheorie ... Pseudozufallszahlen Number theory: Number theory web Random number generation: pLab Conferences: (March 1-4, Singapore) (June 7-10, Juan-les-Pins, Côte d'Azur, France Numbertheoretic Algorithms and Related Topics (September 27 - October 1, Strobl, Austria) (October 24-28, Seoul, Korea) Finite Fields: Theory and Applications December 5-11, Oberwolfach, Germany) WCC 2005 (March 14-18, 2005, Bergen, Norway) 16. ÖMG Kongress (September 18-23, Klagenfurt, Austria) Finite Fields and Applicatons (15-21 December 2005, Puerto Rico) Mathematical Societies DMV ÖMG This page is still under construction. The Institute is named after the famous Austrian mathematician Johann Radon View our server usage statistics This page was made with 100% valid HTML CSS - Send comments to Webmaster Today's date and time is 02/06/04 - 15:03 CET and this file ( /people/page/winterhof/personal.html ) was last modified on 02/06/04 - 15:03 CET

66. Combinatorics '04 Capomulini, Catania, Sicily, Italy; 1218 September 2004. http://www.dmi.unict.it/combinatorics04/

Combinatorics '04 The international conference Combinatorics '04 will be organized by Catania Combinatorics in Capomulini (Catania, Italy) from the 12th to 18th of September 2004. Sponsored by University of Catania Comune di Acireale APT di Catania Deadlines Registration : July 31, 2004 Submission of Abstract : July 31, 2004 Arrival September 12, 2004 Home Objective and Main Topics Committees Invited Speakers List of participants ... Pictures

67. Pure Math, Applied Math, And C&O Club Home Page Pure Math, Applied Math, and combinatorics and Optimization Club. Books, events and links. http://www.student.math.uwaterloo.ca/~pmclub/

Events Executive Library Welcome to the homepage of the at the University of Waterloo Introduction The Pure Math/Applied Math/Combinatorics and Optimization Club offers its members many services. There is an office (MC 3033) where members can meet to discuss various mathematical problems and of course to socialize. There are many reference books, texts, and course notes available for use ( a listing of our books is available here Regardless of your background or particular interests in mathematics, you are sure to find a talk that will interest you. The club even provides free pop and snacks at the talks. Mathematical Association of America The Constitution of the PMC Mathematics Endowment Fund Mathematics Society Email: pmclub@student.math.uwaterloo.ca Telephone: (519) 888-4567 x6139 Office: MC 3033

68. Journal Of Automata, Languages And Combinatorics The Journal of Automata, Languages and combinatorics (formerly Journal of Information Processing and Cybernetics) in mainly concerned with grammatical http://fuzzy.cs.uni-magdeburg.de/theo/jalc/

Journal of Automata, Languages and Combinatorics formerly: Journal of Information Processing and Cybernetics / Elektronische Informationsverarbeitung und Kybernetik Contents Edited by Advisory Board Technical Editor Aims and Scope ... Contents of forthcoming numbers Edited by at Advisory Board M. Droste (Leipzig, Germany) P. Gastin (Paris, France) D.T. Huynh (Richardson, U.S.A.) M. Ito (Kyoto, Japan) H.-J. Kreowski (Bremen, Germany) W. Kuich (Vienna, Austria) M. Latteux (Lille, France) M. Mohri (Florham Park, USA) P. Prusinkiewicz (Calgary, Canada) A. Restivo (Palermo, Italy) G. Rozenberg (Leiden, The Netherlands) H.J. Shyr (Taichung, Taiwan) l. Staiger (Halle/Saale, Germany) D. Wood (Hongkong, China) Technical Editor B. Reichel (Magdeburg) Aims and Scope "Journal of Automata, Languages and Combinatorics" is a forum for research in all areas of the field, from theory to applications and relations to other subjects. Particular attention is given to grammatical methods for generation of sets of words, graphs, arrays, pictures, higher dimensional and infinite objects, etc. (including the classical grammars of the Chomsky hierarchy, Lindenmayer systems and their variations, graph grammars, etc.); automata as acceptors of languages of words, graphs, etc.; decision problems; efficient algorithms for solving problems concerning languages, grammars and automata; algebraic properties of automata and languages; combinatorial properties of words, sequences of words, sets of words, etc.; codes as languages; estimations of parameters of codes; relations of languages and automata to complexity theory, logics, etc.; trace languages; Petri net languages; formal models for concurrent processes; applications of formal languages and automata to programming languages, natural languages, biology, etc.; combinatorics, graph theory, discrete mathematics in relation with problems of theoretical computer science.

69. SpringerLink - Publication Philippe Flajolet s research papers on analytic combinatorics, analysis of algorithms, asymptotics, computer algebra, computational and discrete http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0911-0119

70. BUBL LINK: Combinatorics Subjects combinatorics, complex systems, computational mathematics, Subjects algebra, combinatorics, geometry, mathematics research, topology http://bubl.ac.uk/link/c/combinatorics.htm

BUBL LINK Catalogue of Internet Resources Home Search Subject Menus Countries ... Z Combinatorics Titles Descriptions Computational Complexity Electronic Journal of Combinatorics and World Combinatorics Exchange Mathematics Preprint Archive Mathematics Preprints and Reports ... SIAM Journals Online Comments: bubl@bubl.ac.uk Computational Complexity Journal which presents research at the interface between mathematics and theoretical computer science, with a clear mathematical profile and strictly mathematical format. Specific areas of concentration include structure of complexity classes, algebraic complexity, cryptography, interactive proofs, complexity issues in: computational geometry, robotics, and motion planning, learning theory, number theory, logic, combinatorial optimisation and approximate solutions, and distributed computing. Author: Springer Subjects: combinatorics, complex systems, computational mathematics, cryptography, number theory, optimisation DeweyClass: Resource type: journal Electronic Journal of Combinatorics and World Combinatorics Exchange A refereed all-electronic journal that welcomes papers in all branches of discrete mathematics. Author: Subjects: combinatorics DeweyClass: Resource type: index, journal

71. The First Workshop On Analytic Algorithmics And Combinatorics The First Workshop on Analytic Algorithmics and combinatorics. Held in conjunction with ALENEX04 and SODA04. New Orleans, LA, USA; 10 January 2004. http://www.siam.org/meetings/analco04/

The First Workshop on Analytic Algorithmics and Combinatorics (ANALCO04) PlaceMenu("mainmenu") T he First Workshop on Analytic Algorithmics and Combinatorics (ANALCO04) will be held in New Orleans on January 10, 2004, at the Astor Crowne Plaza Hotel. The aim of the ANALCO workshop is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures. We invite both papers that study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and papers that address the precise analysis of algorithms for processing such structures, including: average-case analysis; analysis of moments, extrema, and distributions; and probabilistic analysis of randomized algorithms. Submissions that present significant new information about classic algorithms are welcome, as are analyses of new algorithms that present unique analytic challenges. We also invite submissions that address tools and techniques for the analysis of algorithms and combinatorial structures, both mathematical and computational. The scientific program will include ample time for discussion and debate of topics in this area.

72. Advanced Process Combinatorics Advanced Process combinatorics provides software tools for advanced planning and scheduling, Advanced Process combinatorics has extensive experience in http://www.combination.com/

Your browser does not support script Quick Links Resources Site Map Contact Info Latest News is now available Advanced Process Combinatorics will be exhibiting at DIA's Project Management "Establishing Competitive Advantage in Today's Pharmaceutical and Biotech Industries" conference, Feb 20-22. Advanced Process Combinatorics, Inc. Vision Competitive Advantage Products and Services Advanced Process Combinatorics provides software tools for advanced planning and scheduling, pharmaceutical pipeline management, project management, capacity analysis, batch process design, and planning of research and development to maximize return. Our services include outstanding installation and support for its tools, algorithm engineering, and short courses in strategic process management. Advanced Process Combinatorics has extensive experience in pharmaceutical, consumer products, healthcare, specialty chemical, and other process oriented industries. We bring world-class breakthrough technologies in scheduling and optimization to bear on challenges with significant business value. HOME COMPANY SOLUTIONS RESOURCES ... SITEMAP © 2005 Advanced Process Combinatorics

73. Peter M Neumann The Queen's College, University of Oxford. Varieties of groups; finite permutation groups; infinite permutation groups; design of grouptheoretic algorithms; soluble groups; quantitative topics in group theory; matrices over finite fields; miscellaneous questions in combinatorics, geometry and general group theory; history of group theory. Chairman of the UK Mathematics Trust. http://www.maths.ox.ac.uk/~neumann/

Dr Peter M Neumann Tel: 01865 279178 Fax: 01865 790819 Email: peter.neumann@queens.ox.ac.uk Personal details Research Recent publications Personal Fellow and Praelector in Mathematics at The Queen's College , since 1966 and Lecturer (CUF) in the University of Oxford since 1967; visiting lecturer or visiting professor at various times at various universities in many parts of the world. In Queen's I teach all branches of pure mathematics to undergraduates. For the University I lecture to undergraduates and graduate students on anything of interest to myself and, I hope, to them; I also supervise MSc and DPhil students in any area related to my own research. So far 30 students have completed doctorates under my supervision. For the three academic years October 1995 to September 1998 I was seconded half-time to Staff Development to help with University Teacher Training within Oxford. Other positions include: Chairman of the United Kingdom Mathematics Trust (UKMT) ; Vice-President of the British Society for History of Mathematics (BSHM) ; Editor of London Mathematical Society Monographs (published for the Society by OUP); editor of

74. Carnielli, Walter A. State University of Campinas, Brazil Foundations of non-classical logics, many-valued logics, paraconsistent logics, finite and infinite combinatorics. http://www.unicamp.br/cle/carniell.htm

75. European Graduate Program ``Combinatorics, Geometry, And Computation'', Berlin - A European graduate programme. http://www.cgc.ethz.ch/

76. The Book "A=B" combinatorics text by Marko Petkovsek, Herbert Wilf and Doron Zeilberger. Published by A. K. Peters. PDF. http://www.cis.upenn.edu/~wilf/AeqB.html

Home Page for the Book "A=B" by Marko Petkovsek Herbert Wilf and Doron Zeilberger with a Foreword by Donald E. Knuth (read it below) YOU CAN NOW DOWNLOAD THE ENTIRE BOOK About the Book "A=B" is about identities in general, and hypergeometric identities in particular, with emphasis on computer methods of discovery and proof. The book describes a number of algorithms for doing these tasks, and we intend to maintain the latest versions of the programs that carry out these algorithms on this page. So be sure to consult this page from time to time, and help yourself to the latest versions of the programs. In addition to programs, we will post here other items of interest relating to the book, such as the current errata sheet (see below). The other side of the coin is that we invite your comments about the content of the book, the programs, any errors that you may discover, or whatever. You can send us your comments by e-mail if you wish. The book is a selection of the Library of Science. A Japanese translation of A=B, by Toppan Co., Ltd., appeared in November of 1997.

77. COCOON 2005 Homepage The Eleventh International Computing and combinatorics Conference. August 1619, 2005, Kunming, Yunnan. Sponsored by Academy of Mathematics and System http://www.cs.cityu.edu.hk/~lwang/COCOON2005/

COCOON 2005 The Eleventh International Computing and Combinatorics Conference August 16-19, 2005, Kunming, Yunnan Sponsored by Academy of Mathematics and System Sciences, Chinese Academy of Sciences Important Dates: Camera ready date: May 9, 2005 Program Sketch Preliminary Program Preparation of Slides Some Tips for Attending CoCoom'05 ... Invited Speakers Altitude of Kunming: the center of the city is meters above sea level. Landscapes of Kunming Submission: (click here) Special issues: Some papers will be invited for special issues in Algorithmica and Journal of Combinatorial Optimization Pre-program: ISORA'05 Other Conferences: Workshop on Internet and Network Economics ISAAC 2005:

78. Algebra And Discrete Mathematics A Euresco conference on the interplay between model theory, infinite combinatorics and various subfields of algebra. Hattingen, Germany; 18 23 August 2001. http://www.esf.org/euresco/01/pc01101a.htm

79. Display Journal combinatorics, Probability Computing. Editor(s); Béla Bollobás, Published bimonthly, combinatorics, Probability Computing is devoted to the three http://journals.cambridge.org/jid_CPC

80. Jon McCammond's Homepage UC Santa Barbara. Geometric Group Theory and LowDimensional Topology, as well as the neighboring fields of combinatorics, Graph theory, Computational Geometry and certain types of Riemannian Geometry. Courses, seminars, publications, preprints; resources on Geometric Group Theory. http://www.math.ucsb.edu/~mccammon/

To: Daily Links Jon McCammond Associate Professor Mathematics Department UC Santa Barbara Santa Barbara, CA 93106 (no machine) Email jon.mccammond(at)math.ucsb.edu (or mccammon(at)math.ucsb.edu) Courses and Seminars Publications and Preprints Curriculum Vitae UCSB Math Faculty ... Associahedra and Noncrossing Partitions (The convex hull of 1000 randomly selected points on a unit sphere.) Author Title Review Text Journal Institution Series Classification MR Number Reviewer Anywhere Last Modified on 13/May/05 by jon.mccammond(at)math.ucsb.edu

Page 4     61-80 of 167    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20