Keywords
Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Keywords » - entrée « Algorithm complexity »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
Algorithm and object oriented modelling < Algorithm complexity < Algorithm performance  Facettes :

List of bibliographic references indexed by Algorithm complexity

Number of relevant bibliographic references: 15.
Ident.Authors (with country if any)Title
003178 (2010) Romain Cosset [France]FACTORIZATION WITH GENUS 2 CURVES
004452 (2008) Elias P. Tsigaridas [France] ; Ioannis Z. Emiris [Grèce]On the complexity of real root isolation using continued fractions
006B75 (2004) Phong Q. Nguyen [France] ; Damien Stehlé [France]Low-Dimensional Lattice Basis Reduction Revisited
006B98 (2004) Dominique Barth [France] ; Johanne Cohen [France] ; Lynda Gastal [France] ; Thierry Mautor [France] ; Stéphane Rousseau [France]Fixed Size and Variable Size Packet Models in an Optical Ring Network: Complexity and Simulations
006D04 (2004) Jean-Pierre Duval [France] ; Roman Kolpakov [Royaume-Uni] ; Gregory Kucherov [France] ; Thierry Lecroq [France] ; Arnaud Lefebvre [France]Linear-time computation of local periods
008796 (2002) David Déharbe [Brésil] ; Anamaria Martins Moreira [Brésil] ; Christophe Ringeissen [France]Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae
009E45 (2000) Cyril Banderier [France] ; Philippe Flajolet [France] ; Gilles Schaeffer [France] ; Michéle Soria [France]Planar Maps and Airy Phenomena
009E88 (2000) Assefaw Hadish Gebremedhin [Norvège] ; Isabelle Guérin Lassous [France] ; Jens Gustedt [France] ; Jan Arne Telle [Norvège]Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract)
00AA23 (1999) Therese C. Biedl [Canada] ; Erik D. Demaine [Canada] ; Sylvain Lazard [France] ; Steven M. Robbins [Canada] ; Michael A. Soss [Canada]Convexifying Monotone Polygons
00B427 (1998) N. Lachichel [France] ; P. Marquis [France]Scope classification : An instance-based learning algorithm with a rule-based characterisation
00BD25 (1997) G. Louchard [Belgique] ; C. Kenyon [France] ; R. Schott [France]Data structures' maxima
00BF81 (1996) Laurent Alonso [France] ; René Schott [France]A parallel algorithm for the generation of a permutation and applications
00C004 (1996) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Unification algorithms cannot be combined in polynomial time
00C111 (1996) Pedro Fonseca [France, Portugal] ; Zoubir Mammeri [France]A framework for the analysis of non-deterministic clock synchronisation algorithms
00C140 (1996) S. Merzouk [France] ; C. Winkler [France] ; J. C. Paul [France]Partitioning and parallel radiosity

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i -k "Algorithm complexity" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i  \
                -Sk "Algorithm complexity" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    KwdEn.i
   |clé=    Algorithm complexity
}}
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022