Manoussakis, Yannis, 1957-....
Manoussakis, Ioannis, 1957-
Manoussakis, Ioannis
Manoussakis, Y.
VIAF ID: 56145304387778570253 ( Personal )
Permalink: http://viaf.org/viaf/56145304387778570253
Preferred Forms
- 200 _ | ‡a Manoussakis ‡b Yannis ‡f 1957-....
- 100 1 _ ‡a Manoussakis, Ioannis
-
-
- 100 1 _ ‡a Manoussakis, Ioannis ‡d 1957-
-
-
- 100 1 0 ‡a Manoussakis, Ioannis, ‡d 1957-
-
- 100 1 _ ‡a Manoussakis, Yannis, ‡d 1957-....
4xx's: Alternate Name Forms (10)
Works
Title | Sources |
---|---|
Algorithmes pour voyager sur un graphe contenant des blocages | |
Amélioration des protocoles de journalisation des messages vers des systèmes HPC extrême-échelle. | |
Approches découplées aux problèmes d'allocations de registres et de mémoires locales. | |
Automatic and Semi-Automatic Adaptation of Program Optimizations. | |
Calculate invariants of permutation groups by Fourier Transform. | |
Caractérisation analytique et optimisation de codes source-canal conjoints | |
Chaînes alternées dans les graphes arête-coloriés : k-linkage et arbres couvrants | |
Combinatorics and computer science 8th Franco-Japanese and 4th Franco-Chinese conference, Brest, France, July 3-5, 1995 : selected papers | |
Common-preference paths in dense relational systems | |
Complementary cycles containing a fixed arc in diregular bipartite tournaments | |
Complexity of games dynamics. | |
Une contribution à la théorie des graphes (signés) borne d’homomorphisme et hamiltonicité. | |
Contributions aux bandits manchots : gestion du risque et sous-échantillonnage pour les bandits contextuels linéaires. | |
Contributions to Multi-Armed Bandits : Risk-Awareness and Sub-Sampling for Linear Contextual Bandits | |
Covering by cycles the vertices the of 3-connected | |
Cycles of given color patterns | |
Decoupled approaches to register and software controlled memory allocations | |
Defense games and tropical sets. | |
Dense matrix computations : communication cost and numerical stability | |
Detection de l'independance entre requête XML et mise à jour XML : une approche basée sur le typage. | |
Efficient self-stabilizing algorithms for graphs. | |
Ensembles indépendants et au-delà, à travers le prisme des systèmes distribués et des graphes colorés. | |
Études sur les structures colorées optimales dans les graphes sommet-colorés. | |
Existence of cycles and chains in oriented or non oriented graphs in relation to graph parameters (connectivity, stability, degree,...). | |
Exploration of edge-colored graphs : topology , algorithms, complexity and (no)-approximability. | |
Extremal problems in directed graphs. | |
A Few Problems of Algorithm and Complexity in Graph Theory. | |
The forwarding index of directed networks | |
From Cyclo-Static Process Networks to Code Generation for Multidimensional Software Pipelining. | |
Further results on degree sets for graphs | |
Graphes et couleurs : graphes arêtes-coloriés, coloration d'arêtes et connexité propre | |
Hautes Performances en Exploitant la Localité de l'Information via le Calcul Réversible.. | |
High Performance by Exploiting Information Locality through Reverse Computing | |
Hypercubes Latins maximin pour l'echantillonage de systèmes complexes | |
Improving message logging protocols towards extreme-scale HPC systems | |
Independent sets and beyond, through the prism of distributed systems and colored graphs | |
Jeux de défense et ensembles tropicaux | |
k-linked and k-cyclic digraphs | |
Maximin Latin hypercubes for experimental design. | |
Méthodes et algorithmes pour la résolution des systèmes d'équations linéaires sur les ordinateurs massivement parallèles. | |
Minimal colorings for properly colored subgraphs | |
Minimum (2,r)-metrics, graph partitions and multiflows | |
NC algorithms for antidirected Hamiltonian paths and cycles in tournaments | |
Number of arcs, cycles and paths in bipartite digraphs | |
The Number of bipartite tournaments with an unique given factor | |
On degree sets and the minium orders in bipartite graphs | |
On packing, colouring and identification problems. | |
On the complexity of finding alternating paths in edge-coloured complete graphs | |
Preconditioning methods for solving linear systems on massively parallel machines. | |
Présentation de travaux de Mr Yannis Manoussakis à l'occasion de son diplôme d'habilitation | |
Probabilistic methods in combinatorics and graph theory. | |
PROBLEMES D'ORDONNANCEMENT AVEC COMMUNICATIONS DANS LES SYSTEMES MULTIPROCESSEURS | |
Problèmes extrémaux dans les graphes orientés | |
Proper paths in edge-colored graphs : k-linkage and spanning trees. | |
Quelques problèmes de coloration du graphe | |
Ramsey numbers for tournaments | |
Reconstruction 3D à partir d'images tomodensitométriques appliquée en paléontologie et en orthodontie | |
RNA structure-sequence alignment algorithmic : a general and parameterized approach. | |
Scheduling problems with communication delays in multiprocessor systems. | |
Some coloring problems of graphs. | |
Stratégies exploratoires efficaces pour la compilation polyédrique : algorithmes et expérience dans un compilateur de production. | |
Studies on Optimal Colorful Structures in Vertex-Colored Graphs | |
Type-based detection of XML query-update independence | |
Virtual spaces for scientific exploration and education : contribution to the apprehension of the Theory of Special Relativity through virtual reality. |