FA11s1.i
Merge
PascalFrancis
Racine
Merge
Checkpoint
PascalFrancis
Racine
PascalFrancis
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur l'Université de Trèves - Merge (PascalFrancis)

Index « FA11s1.i » - entrée « JANSEN (K.) »
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.
JANSEN (Andreas) < JANSEN (K.) < JANSEN (Lars)  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 19.
Ident.Authors (with country if any)Title
001341 (1992) K. JansenAn approximation algorithm for the general routing problem
001382 (1992) K. JansenProcessor optimization for flow graphs
001385 (1993) K. JansenScheduling with constrained processor allocation for interval orders
001386 (1993) K. JansenBounds for the general capacitated routing problem
001390 (1993) K. JansenThe interconnection problem
001451 (1993) K. JansenTransfer flow graphs
001454 (1993) K. JansenThe allocation problem in hardware design
001471 (1994) K. JansenAn approximation algorithm for the license and shift class design problem
001487 (1994) K. JansenOn the complexity of allocation problems in high-level synthesis
001516 (1995) K. Jansen ; G. J. Woeginger ; ZHONGLIANG YUUET-scheduling with chain-type precedence constraints
001519 (1995) K. Jansen ; H. MüllerThe minimum broadcast time problem for several processor networks
001595 (1997) K. Jansen ; S. ÖhringApproximation algorithms for time constrained scheduling
001607 (1997) K. Jansen ; P. SchefflerGeneralized coloring for tree-like graphs
001610 (1997) K. JansenThe optimum cost chromatic partition problem
001624 (1997) K. Jansen ; J. ReiterA new approximation algorithm for the register allocation problem
001626 (1997) C. Kaklamanis ; P. Persiano ; T. Erlebach ; K. JansenConstrained bipartite edge coloring with applications to wavelength routing
001627 (1997) K. JansenApproximation results for the optimum cost chromatic partition problem
001651 (1997) T. Erlebach ; K. JansenOff-line and on-line call-scheduling in stars and trees
001736 (1998) K. Jansen ; J. ReiterAn approximation algorithm for the register allocation problem

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Merge

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Merge/FA11s1.i -k "JANSEN (K.)" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Merge/FA11s1.i  \
                -Sk "JANSEN (K.)" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Merge/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    PascalFrancis
   |étape=   Merge
   |type=    indexItem
   |index=    FA11s1.i
   |clé=    JANSEN (K.)
}}
Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024