From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from weis@localhost) by pauillac.inria.fr (8.6.10/8.6.6) id JAA13284 for caml-redistribution; Mon, 15 Apr 1996 09:39:12 +0200 Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.6.10/8.6.6) with ESMTP id RAA07724 for ; Sun, 14 Apr 1996 17:31:39 +0200 Received: from margaux.inria.fr (margaux.inria.fr [128.93.8.2]) by concorde.inria.fr (8.7.1/8.7.1) with ESMTP id RAA07179 for ; Sun, 14 Apr 1996 17:30:42 +0200 (MET DST) Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by margaux.inria.fr (8.6.10/8.6.6) with ESMTP id RAA00548 for ; Sun, 14 Apr 1996 17:31:38 +0200 Received: from logatome.micronet.fr (root@logatome.micronet.fr [194.51.75.1]) by concorde.inria.fr (8.7.1/8.7.1) with ESMTP id RAA07175 for ; Sun, 14 Apr 1996 17:30:41 +0200 (MET DST) Received: from [193.149.100.47] (pppA141.micronet.fr [193.149.100.47]) by logatome.micronet.fr (8.6.9/8.6.9) with SMTP id RAA10358 for ; Sun, 14 Apr 1996 17:31:47 +0200 X-Sender: cheno@mail.micronet.fr Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable X-Mailer: Eudora F1.5.3 Date: Sun, 14 Apr 1996 17:32:32 +0200 To: caml-list@margaux.inria.fr From: cheno@micronet.fr (Laurent =?iso-8859-1?Q?Ch=E9no?= ) Subject: announce for Lettre de Caml 3 Sender: weis I am happy to announce the availability for the "Caml letter, number 3" (written in French as << La lettre de Caml no 3>>), to be found at: http://pauillac.inria.fr/caml/lettre_de_caml/index.html Summary : - Conjunctive and disjonctive normal forms. - Rational arithmetic, with emphasis about the rational approximations of pi. - Inverse of a permutation (functional aspect). - An algorithm by Johnson about permutations. Any contribution to "The Caml letter" is welcome (cheno@micronet.fr) You will also find at: http://pauillac.inria.fr/caml/polycopies/cheno/index-eng.html a course in computer theory, at upper undergraduate level (PostScript), Caml being used to discuss and implement the algorithms. Summary: Part I: Data structures; stacks, queues, circular lists, priority queues, set partitions. Part II: Graph algorithms. Part III: Computational geometry, convex hull (Graham-Andrew, Shamos, Preparata-Hong), nearest neighbor search problem, Voronoi diagram (Tsai algorithm). =3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-= =3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D-=3D- =3D-=3D-=3D-=3D-=3D-=3D- J'ai le plaisir de vous annoncer la disponibilit=E9 du num=E9ro 3 de la Lett= re de Caml =E0 l'URL: http://pauillac.inria.fr/caml/lettre_de_caml/index.html Au sommaire de ce num=E9ro : Formes normales conjonctives et disjonctives Arithm=E9tique exacte en Caml, approximations rationnelles de pi Inverse d'une permutation Algorithme de Johnson Associativit=E9 des op=E9rations arithm=E9tiques Toute contribution sera la bienvenue : cheno@micronet.fr Vous trouverez aussi =E0 l'URL: http://pauillac.inria.fr/caml/polycopies/cheno/index-eng.html un poly r=E9dig=E9 =E0 l'attention des enseignants de l'option informatique = en classes pr=E9paratoires aux grandes =E9coles. Au sommaire : Partie 1 : structures de donn=E9es piles ; files d'attente ; listes circulaires ; files de priorit=E9 ; partitions Partie 2 : algorithmes sur les graphes Floyd ; Warshall ; Dijkstra ; Prim ; Kruskal Partie 3 : g=E9om=E9trie combinatoire enveloppe convexe (Graham-Andrew, Shamos, Preparata-Hong) paire de points les plus proches diagrammes de Voronoi (algorithme de Tsai) ------------------------------------------------------------------- Laurent Ch=E9no teaching at / enseignant au Lyc=E9e Louis-le-Grand - 123 rue Saint-Jacques 75231 PARIS CEDEX 05 - FRANCE -------------------------------------------------------------------