Díaz, Josep
Díaz, J. (Josep), 1950-
Díaz, Josep, 1950-....
Díaz, Josep Díaz Cort
Díaz, J. 1950-
Jose Maria Diaz Cort Investigador ORCID:0000-0003-4422-0067
VIAF ID: 32071049 ( Personal )
Permalink: http://viaf.org/viaf/32071049
Preferred Forms
-
-
-
- 100 1 _ ‡a Díaz, J. ‡q (Josep), ‡d 1950-
-
-
-
- 100 1 _ ‡a Díaz, Josep ‡d 1950-
- 100 1 _ ‡a Díaz, Josep, ‡d 1950-....
- 100 1 _ ‡a Díaz, J. ‡d 1950-
-
-
-
- 100 1 _ ‡a Díaz, Josep
- 100 1 0 ‡a Díaz, Josep ‡q Díaz Cort
- 100 0 _ ‡a Jose Maria Diaz Cort ‡c Investigador ORCID:0000-0003-4422-0067
4xx's: Alternate Name Forms (30)
5xx's: Related Names (4)
- 510 2 _ ‡a Facultat d'Informàtica de Barcelona
- 510 2 _ ‡a Universitat Politècnica de Catalunya ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Universitat Politècnica de Catalunya
- 510 2 _ ‡a Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
Works
Title | Sources |
---|---|
Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages (CCIPL) | |
Adversarial models for priority-based networks | |
Algorithms - ESA '96 : fourth annual European symposium, Barcelona, Spain, September 25-27, 1996 : proceedings | |
Algorithms for learning finite automata from queries : a unified view | |
Algorítmica per a paral·lelisme massiu : introducció | |
Algunos resultados nuevos en complejidad algorítmica | |
APPROX 2006 | |
Approximating the permanent is in RNC | |
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006, and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006 : proceedings | |
Aspects of random graphs : colourings, walkers and Hamiltonian cycles | |
Automata, languages and programming : 31 st international colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004 : proceedings | |
Average case analysis of Robinson's unification algorithm with two different variables | |
Average-case analysis on simple families of trees using a balanced probabilistic model | |
Bounds on the bisection width for random d-regular graphs | |
Chromatic number in random scaled sector graphs | |
Classes of bounded nondeterminism | |
Complejidad concreta y complejidad abstracta de algoritmos : un panorama actual | |
The complexity of restrictive H-coloring | |
Comptatge de boscos enllaçats compatibles | |
Computer science review. | |
Counting H-colorings of partial K-trees | |
Counting list H-colorings and variants | |
Declamación fúnebre encomiástica la dulce y respetable memoria del Ilmo. señor Don Manuel de Muñóz y Guil, obispo de Vich, y del Consejo de su Majestad (...) : dixola en el dia de su entierro Joseph Díaz... | |
ESA'96 | |
Examples of CF-BI-inmune and CF-levelable sets in logspace | |
Extended abstracts Summer 2015 : strategic behavior in combinatorial structures : quantitative finance | |
Formalization of programming concepts : proceedings | |
Funciones de complejidad y su relación con las familias abstractas de lenguajes | |
H-colorings of large degree graphs | |
The Hanoi's lectures | |
The Hardness of intervalizing four colored caterpillars | |
Heuristics for the MinLA problem : some theoretical and empirical considerations | |
ICALP-83 | |
Informática I | |
Linear and non-linear systems : a survey | |
Linear orderings of random geometric graphs : extended abstract | |
The Logic of partial information | |
The MINSUMCUT problem | |
On characterizations of the class PSPACE/Poly | |
On counting becs | |
On nonuniform polynomial space | |
On the expected depth of boolean circuits | |
Paradigms for fast parallel approximability | |
RANDOM 2006 | |
Random geometric problems on [0,1]2 | |
Recent results on parameterized H-coloring | |
Sampling matchings in parallel | |
Simulation of complicated queries by membership queries | |
A Solution of the Sperner-Erdös problem | |
Some remarks on the approximability of graph layout problems | |
Structural complexity | |
TAPSOFT '89 : Proceedings of the International Joint Conference on Theory and Practice of Software Development Barcelona, Spain, March 13–17, 1989 | |
Theoretical Computer Science : 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings | |
En torno a oráculos que ciertas máquinas consultan y a las espantables consecuencias a que ello da lugar | |
Uniform characterization of non-uniform complexity measures | |
Walkers on the cycle and the grid |