Titre (en)
Checkpoint
Istex
Racine
Checkpoint
Istex
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (Istex)

Index « Titre (en) » - 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.
complexities < complexity < compliance  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 42.
[0-20] [0 - 20][0 - 42][20-40]
Ident.Authors (with country if any)Title
000084 (2013) Emmanuel Hainry [France] ; Jean-Yves Marion [France] ; Romain Péchoux [France]Type-Based Complexity Analysis for Fork Processes
000212 (2013) Daniel Leivant [États-Unis] ; Jean-Yves Marion [France]Evolving Graph-Structures and Their Implicit Computational Complexity
000232 (2013) Philippe Balbiani [France] ; Szabolcs Mikulás [Royaume-Uni]Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders
000382 (2012) Vincent Boudet [France] ; Johanne Cohen [France] ; Rodolphe Giroudeau [France] ; Jean-Claude König [France]Scheduling in the presence of processor networks : complexity and approximation
000396 (2012) Marc Glisse [France] ; Sylvain Lazard [France]On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions
000826 (2010) Hugo Férée [France] ; Emmanuel Hainry [France] ; Mathieu Hoyrup [France] ; Romain Péchoux [France]Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
000864 (2010) Guillaume Bonfante [France] ; Florian Deloup [France]Complexity Invariance of Real Interpretations
000872 (2010) Guillaume Bonfante [France] ; Georg Moser [Autriche]Characterising Space Complexity Classes via Knuth-Bendix Orders
000D52 (2008) René Schott [France] ; G. Stacey Staples [États-Unis]Reductions in Computational Complexity Using Clifford Algebras
000E37 (2008) Nao Hirokawa [Japon] ; Georg Moser [Autriche]Complexity, Graphs, and the Dependency Pair Method
001050 (2007) Mohamed Ali Aloulou [France] ; Mikhail Y. Kovalyov [Biélorussie] ; Marie-Claude Portmann [France]Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
001218 (2006) Peter Bürgisser [Allemagne] ; Felipe Cucker [Hong Kong] ; Paulin Jacobé De Naurois [France]The complexity of semilinear problems in succinct representation
001495 (2005) Peter Bürgisser [Allemagne] ; Felipe Cucker [République populaire de Chine, Hong Kong] ; Paulin Jacobé De Naurois [France]The Complexity of Semilinear Problems in Succinct Representation
001564 (2005) Olivier Bournez ; Felipe Cucker ; Paulin Jacobe De Naurois ; Jean-Yves MarionImplicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
001725 (2004) Manfred Schmidt-Schau [Allemagne] ; Jürgen Stuber [France]The Complexity of Linear and Stratified Context Matching Problems
001807 (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
001A07 (2003) Sylvain Salvati [France] ; Philippe De Groote [France]On the Complexity of Higher-Order Matching in the Linear λ-Calculus
001A85 (2003) Andres Posada [France] ; Etienne Hugues [France] ; Nicolas Franck [France] ; Pascal Vianin [Suisse] ; James Kilner [France, Royaume-Uni]Augmentation of induced visual gamma activity by increased task complexity
001C27 (2002) Michel Cosnard [France]Introduction to the Complexity of Parallel Algorithms
001D95 (2001) Georg Gottlob [Autriche] ; Reinhard Pichler [Autriche]Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
001E12 (2001) Dieter Hofbauer [États-Unis]Termination Proofs for Ground Rewrite Systems – Interpretations and Derivational Complexity

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Title.i -k "complexity" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Title.i  \
                -Sk "complexity" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Checkpoint
   |type=    indexItem
   |index=    Title.i
   |clé=    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