Keywords
Exploration
Accueil
Racine
Exploration
Accueil
Racine

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

Index « Keywords » - entrée « 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.
complexite < complexity < complexity analysis  Facettes :

List of bibliographic references indexed by complexity

Number of relevant bibliographic references: 91.
[0-50] [0 - 20][0 - 50][50-70]**** probable Xml problem ****
Ident.Authors (with country if any)Title
000076 (2016-01-27) Svyatoslav Covanov [France] ; Emmanuel Thomé [France]Fast integer multiplication using generalized Fermat primes
000839 (2014-12-10) Hugo Férée [France]Higher order complexity and computable analysis
000A57 (2014-07-01) Karën Fort [France] ; Bruno Guillaume [France] ; Valentin Stern [France]ZOMBILINGO : manger des têtes pour annoter en syntaxe de dépendances
000C05 (2014-04-13) Karën Fort [France] ; Bruno Guillaume [France] ; Hadrien Chastant [France]Creating Zombilingo, a Game With A Purpose for dependency syntax annotation
001282 (2013-03-08) Emmanuel Jeandel [France] ; Pascal Vanier [France]Characterizations of periods of multidimensional shifts
001F65 (2011-12-09) Guillaume Bonfante [France]Implicit computational complexity : program interpretations
002400 (2011-04) Jean-Charles Faugère [France] ; Mohab Safey El Din [France] ; Pierre-Jean Spaenlehauer [France]Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity
003074 (2010) Marco Gaboardi [Italie] ; Romain Péchoux [France]Global and Local Space Properties of Stream Programs
004731 (2007-09-22) Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Romain Péchoux [France]Quasi-interpretation Synthesis by Decomposition : An application to higher-order programs
004886 (2007-06-06) Julien Demouth [France] ; Olivier Devillers [France] ; Hazel Everett [France] ; Marc Glisse [France] ; Sylvain Lazard [France] ; Raimund Seidel [Allemagne]Between umbra and penumbra
004A70 (2007) Sunayana Ghosh [Pays-Bas] ; Sylvain Petitjean [France] ; Gert Vegter [Pays-Bas]Approximation by conic splines
004E52 (2007) Dimitrios Diochnos [Grèce] ; Ioannis Z. Emiris [Grèce] ; Elias Tsigaridas [France]On the complexity of real solving bivariate systems
005080 (2006-07) Guillaume Bonfante [France]Some programming languages for LOGSPACE and PTIME
005858 (2005-11-10) Julien Fondrevelle [France]Exact solution to permutation flowshop problems with time lag constraints between operations
005A24 (2005-05-16) Julien Fondrevelle [France] ; Ammar Oulamara [France] ; Marie-Claude Portmann [France]Minimizing the weighted sum of machine completion times in flowshop with time lags
005C56 (2005) Guillaume Bonfante ; Jean-Yves Marion ; Jean-Yves Moyen ; Romain PéchouxSynthesis of Quasi-interpretations
005C86 (2005) Julien Fondrevelle ; Ammar Oulamara ; Marie-Claude PortmannMinimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach
005E56 (2005) Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves MarionImplicit Complexity Over an Arbitrary Structure : Sequential and Parallel Polynomial Time
006656 (2004-04-14) Olivier Bournez [France] ; Felipe Cucker ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France]Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures
006829 (2004) Dominique Barth ; Johanne Cohen ; Lynda Gastal ; Thierry Mautor ; Stéphane RousseauFixed Size and Variable Size Packet Models in an Optical Ring Network : Complexity and Simulations
006872 (2004) Olivier Bournez ; Emmanuel HainryAn analog Characterization of Elementarily Computable Functions Over the Real Numbers
006873 (2004) Olivier Bournez ; Emmanuel HainryAn analog Characterization of Elementarily Computable Functions Over the Real Numbers
006A11 (2004) Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves MarionTailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures
006A24 (2004) Olivier Bournez ; Emmanuel HainryReal Recursive Functions and Real Extensions of Recursive Functions
006B10 (2004) Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]Unification Modulo ACUI Plus Distributivity Axioms
006C16 (2004) Agostino Dovier [Italie] ; Carla Piazza [Italie] ; Enrico Pontelli [États-Unis]Disunification in ACI 1 Theories
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
006F43 (2004) Ammar Oulamara [France]No-wait flow shop problem with two mixed batching machines
007309 (2003) Karell Bertet ; Jens Gustedt ; Michel MorvanWeak-order extensions of an order
007351 (2003) Mathieu TuruaniSécurité des protocoles cryptographiques : décidabilité et complexité
007398 (2003) Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves MarionSafe Recursion Over an Arbitrary Structure : PAR, PH and DPH
007492 (2003) Mohab Safey El Din ; Eric SchostPolar varieties and computation of one point in each connected component of a smooth real algebraic set
007510 (2003) Jean-Yves MoyenAnalyse de la complexité et transformation de programmes
007551 (2003) Dominique Barth ; Johanne Cohen ; Lynda Gastal ; Thierry Mautor ; Stephane RousseauComparison of fixed size and variable size packet models in an optical ring network : Algorithms and performances
007637 (2003) Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves MarionComputability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
007643 (2003) Dominique Barth ; Cohen Johanne ; Faik TaoufikComplexity of Determining the b-continuity Property of Graphs
007710 (2003) Roman Kolpakov ; Gregory KucherovFinding approximate repetitions under Hamming distance
007752 (2003) Patrick Blackburn ; Bertrand Gaiffe ; Marteen MarxVariable-free reasoning on finite trees
007759 (2003) Jean-Pierre Duval ; Roman Kolpakov ; Gregory Kucherov ; Thierry Lecroq ; Arnaud LefebvreLinear-Time Computation of Local Periods
007761 (2003) Ali Basiri ; Jean-Charles FaugereChanging the ordering of Grobner Bases with LLL : Case of Two Variables
007788 (2003) Carsten Lutz Lutz ; Carlos Areces ; Ian Horrocks ; Ulrike SattlerKeys, Nominals, and Concrete Domains
007813 (2003) Yannick ChevalierRésolution de problèmes d'accessibilité pour la compilation et la validation de protocoles cryptographiques
007B38 (2003) Karell Bertet [France] ; Jens Gustedt [France] ; Michel Morvan [France]Weak-order extensions of an order
007D29 (2003) Siva Anantharaman [France] ; Paliath Narendran [France] ; Michaël Rusinowitch [France]Unification modulo ACUI plus Homomorphisms/Distributivity
007E02 (2003) Lyès Benyoucef [France] ; Bernard PenzJust-in-time changeover cost minimization problem : Dynamic programming approach and complexity results
007E54 (2003) Ali Basiri [France] ; Jean-Charles Faugère [France]Changing the ordering of Grobner Bases with LLL: Case of Two Variables
008011 (2002-07) Manfred Schmidt-Schauss ; Jürgen Stuber [France]On the complexity of linear and stratified context matching problems
008151 (2002) Olivier Bournez ; Paulin De Naurois ; Jean-Yves MarionSafe Recursion and Calculus over an Arbitrary Structure
008378