Serna, Maria, 1959-....
![Sudoc [ABES], France](/viaf/images/flags/SUDOC.png "Sudoc [ABES], France")
Serna, Maria
Serna, Maria José
Maria Serna
VIAF ID: 115375861 (Personal)
Permalink: http://viaf.org/viaf/115375861
Preferred Forms
-
100 0 _
‡a
Maria Serna
-
100 1 0
‡a
Serna, Maria
-
100 1 _ ‡a Serna, Maria
-
100 1 _ ‡a Serna, Maria
-
100 1 _
‡a
Serna, Maria
-
100 1 _ ‡a Serna, Maria José
-
100 1 _
‡a
Serna, Maria José
-
100 1 _ ‡a Serna, Maria ‡d (1959- ).
-
100 1 _ ‡a Serna, Maria, ‡d 1959-
-
100 1 _ ‡a Serna, Maria, ‡d 1959-
-
100 1 0
‡a
Serna, Maria,
‡d
1959-
-
100 1 _ ‡a Serna, Maria, ‡d 1959-
-
100 1 _ ‡a Serna, Maria, ‡d 1959-
-
100 1 _
‡a
Serna, Maria,
‡d
1959-....
4xx's: Alternate Name Forms (19)
Works
| Title | Sources |
|---|---|
| Accesos concurrentes a una base de datos y lenguajes de trazas |
|
| Algorismes parametritzats per al problema de recobriment d'imatges |
|
| Algorithmic game theory : 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012 : proceedings |
|
| Algorithms - ESA '96 : Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996 : proceedings |
|
| Algorítmica per a paral·lelisme massiu : introducció |
|
| Appelez-moi Nathan. |
|
| APPROX 2010 |
|
| The approximability of non-Boolean satisfiability problems and restricted integer programming |
|
| Approximation algorithms for combinatorial optimization problems |
|
| Bounds on the bisection width for random d-regular graphs |
|
| The complexity of restrictive H-coloring |
|
| Counting H-colorings of partial K-trees |
|
| Counting list H-colorings and variants |
|
| Cutwidth I: A linear time fixed parameter algorithm |
|
| Cutwidth II: Algorithms for partial w-trees of bounded degree |
|
| Diseño e implementación de una Intranet de ayuda a programadores |
|
| Els límits de la computació : indecidibilitat i NP-completesa |
|
| Experimental algorithms : 5th international workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006 : proceedings |
|
| Extended abstracts Summer 2015 : strategic behavior in combinatorial structures : quantitative finance |
|
| Fihocavalidator |
|
| Finite memory devices in CSP |
|
| Frames composer tool |
|
| Gestió del registre d'interrupcions voluntàries de l'embaràs |
|
| (H,C,K)-coloring : fast, easy, and hard cases |
|
| H-colorings of large degree graphs |
|
| The Hardness of intervalizing four colored caterpillars |
|
| Informàtica 1. |
|
| Una Introducción al cálculo numérico |
|
| Linear and non-linear systems : a survey |
|
| Llamadme Nathan |
|
| Lupanov Hierarchy |
|
| Mobile remote management designjet |
|
| Monitorización de un cluster Wan con MPI |
|
| On parallel versus sequential approximability : complexity and approximation results |
|
| On RNC approximate counting |
|
| On the average complexity of some P-complete problems |
|
| Paral·lelització d'un esquelet per al Simulated Annealing |
|
| The Parallel approximability of the false and true gates problems for nor circuits |
|
| Parallel approximation schemes for problems on planar graphs |
|
| Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming |
|
| The Proper interval colered graph problem for caterpillar trees |
|
| Random geometric problems on [0,1]2 |
|
| A Random graph model for optical networks of sensors |
|
| RANDOM'98 |
|
| Randomization and approximation techniques in computer science : second international workshop, RANDOM '98, Barcelona, Spain, October 8-10, 1998 : proceedings |
|
| Recent results on parameterized H-coloring |
|
| SAGT 2012 |
|
| Some remarks on the approximability of graph layout problems |
|
| Stability in communication networks under adversarial models |
|
| Towards refining BSP programs into loosely coupled distributed systems |
|
| Universal stability of undirected graphs in the adversial queueing model |
|
| Walkers on the Cycle and the Grid |
|
| WEA 2006 |
|
