LEADER 00836nam a2200253 i 4500 001 991001168729707536 005 20020507184516.0 008 970604s1953 fr ||| | fre 035 $ab10810286-39ule_inst 035 $aLE01308122$9ExL 040 $aDip.to Matematica$beng 082 0 $a512.72 084 $aAMS 11A41 100 1 $aBorel, Emile$0335330 245 14$aLes nombres premiers /$cpar Emile Borel 260 $aParis :$bPresses Univ. France,$c1953 300 $a133 p. ;$c17 cm. 650 4$aPrime numbers 907 $a.b10810286$b21-09-06$c28-06-02 912 $a991001168729707536 945 $aLE013 11A BOR11 (1953)$g1$i2013000085494$lle013$o-$pE0.00$q-$rl$s- $t0$u3$v1$w3$x0$y.i10915588$z28-06-02 996 $aNombres premiers$9924960 997 $aUNISALENTO 998 $ale013$b01-01-97$cm$da $e-$ffre$gfr $h4$i1 LEADER 01258nam0 22003011i 450 001 UON00070517 005 20231205102348.904 100 $a20020107d1975 |0itac50 ba 101 $afre 102 $aFR 105 $a|||| ||||| 200 1 $aDjouder$eLa fin de l'Empire Songhay$fIbrahima Baba Kake$gAvec la collaboration de Bernard Rouzet 210 $aParis$cABC$dc 1975 215 $a108 p.$d18 cm 410 1$1001UON00066073$12001 $aGrandes figures africaines$fDirection historique: Ibrahima Baba Kake$gDirection litteraire: Francois Poli 606 $aAfrica occidentale$xStoria$3UONC019406$2FI 606 $aImpero Songhay$3UONC019460$2FI 620 $aFR$dParis$3UONL002984 676 $a966.2018$cSTORIA DEL MALI, BURKINA FASO, NIGER - 1400-1500 / IMPERO SONGHAY$v21 700 1$aKAKE$bIbrahima Baba$3UONV045018$0408869 701 1$aROUZET$bBernard$3UONV045019$0658087 712 $aABC$3UONV257166$4650 801 $aIT$bSOL$c20250926$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00070517 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI ST 289 $eSI AA 9811 5 289 996 $aDjouder$91161421 997 $aUNIOR LEADER 07678nam 22008175 450 001 9910484653303321 005 20251226203506.0 010 $a3-642-13193-X 024 7 $a10.1007/978-3-642-13193-6 035 $a(CKB)2670000000017279 035 $a(SSID)ssj0000446460 035 $a(PQKBManifestationID)11249935 035 $a(PQKBTitleCode)TC0000446460 035 $a(PQKBWorkID)10496101 035 $a(PQKB)10302963 035 $a(DE-He213)978-3-642-13193-6 035 $a(MiAaPQ)EBC3065241 035 $a(PPN)149073046 035 $a(BIP)30400761 035 $a(EXLCZ)992670000000017279 100 $a20100427d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aExperimental Algorithms $e9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings /$fedited by Paola Festa 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XII, 514 p. 126 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6049 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-13192-1 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Experimental Study of Resilient Algorithms and Data Structures -- Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs -- Contributed Regular Papers -- Alternative Routes in Road Networks -- Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks -- Space-Efficient SHARC-Routing -- A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation -- Contraction of Timetable Networks with Realistic Transfers -- Distributed Time-Dependent Contraction Hierarchies -- Practical Compressed Suffix Trees -- Maximum Cliques in Protein Structure Comparison -- Exact Bipartite Crossing Minimization under Tree Constraints -- Bit-Parallel Search Algorithms for Long Patterns -- Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments -- Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars -- Time-Dependent Contraction Hierarchies and Approximation -- A New Combinational Logic Minimization Technique with Applications to Cryptology -- Randomized Rounding for Routing and Covering Problems: Experiments and Improvements -- The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm -- An Approximate ?-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem -- A Branch-and-Price Algorithm for Multi-mode Resource Leveling -- Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs -- Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem -- Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation -- New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup andDelivery -- A Metaheuristic for a Two Echelon Location-Routing Problem -- New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint -- An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem -- An Analysis of Heuristics for Vertex Colouring -- Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm -- Experiments with a Feasibility Pump Approach for Nonconvex MINLPs -- Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems -- Realtime Classification for Encrypted Traffic -- Data Propagation with Guaranteed Delivery for Mobile Networks -- Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries -- Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure -- Policy-Based Benchmarking of Weak Heaps and Their Relatives, -- Modularity-Driven Clustering of Dynamic Graphs -- Gateway Decompositions for Constrained Reachability Problems -- Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere -- Fault Recovery in Wireless Networks: The Geometric Recolouring Approach -- Geometric Minimum Spanning Trees with GeoFilterKruskal -- Practical Nearest Neighbor Search in the Plane. 330 $aThis proceedings volume contains the invited papers and the contributed papers th accepted for presentation at the 9 International Symposium on Experimental Algorithms (SEA 2010), that was held at the Continental Terme Hotel, Ischia (Naples), Italy, during May 20-22, 2010. PrevioussymposiaoftheserieswereheldinRiga(2001),MonteVerita(2003), RiodeJaneiro(2004),Santorini(2005),Menorca(2006),Rome(2007),CapeCod (2008), and Dortmund (2009). Seventy-three papers were submitted by researchers from 19 countries. Each paper was reviewed by three experts among the Program Committee members and some trusted external referees. At least two reviewers were from the same or closely related discipline as the authors. The reviewers generally provided a high-quality assessment of the papers and often gave extensive comments to the authors for the possible improvement of the presentation. The submission and review process was supported by the ConfTool conference management software and we are thankful to Harald Weinreich for letting us use it. The Program Committee selected 40 regular papers for presentation at the conference. In addition to the 40 contributed papers, this volume includes two invitedpapersrelatedtocorrespondingkeynotetalks:GiuseppeF.Italiano(U- versity of Rome "Tor Vergata,"Italy)spoke on "ExperimentalStudy of Resilient Algorithms and Data Structures" and PanosM. Pardalos(University of Florida, USA) spoke on "Computational Challenges with Cliques, Quasi-Cliques and Clique Partitions in Graphs." Many people and organizations contributed to SEA 2010. We are parti- larlygrateful for the patronageand ?nancial support of the University of Naples "FedericoII"andtheDepartmentofMathematicsandApplications"R.Cacci- poli,"and for the ?nancial support of GNCS (Gruppo Nazionale per il Calcolo Scienti'co) - INdAM (Istituto Nazionale di Alta Matematica). 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6049 606 $aComputer programming 606 $aAlgorithms 606 $aArtificial intelligence 606 $aApplication software 606 $aComputer networks 606 $aInformation storage and retrieval systems 606 $aProgramming Techniques 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aComputer and Information Systems Applications 606 $aComputer Communication Networks 606 $aInformation Storage and Retrieval 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aApplication software. 615 0$aComputer networks. 615 0$aInformation storage and retrieval systems. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aArtificial Intelligence. 615 24$aComputer and Information Systems Applications. 615 24$aComputer Communication Networks. 615 24$aInformation Storage and Retrieval. 676 $a005.1 701 $aFesta$b Paola$0749574 712 12$aSEA 2010 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484653303321 996 $aExperimental algorithms$94184680 997 $aUNINA