The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Josep Díaz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe
    A Note on the Query Complexity of Learning DFA (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ALT, 1992, pp:53-62 [Conf]
  2. José L. Balcázar, Josep Díaz, Ricard Gavaldà
    Algorithms for Learning Finite Automata from Queries: A Unified View. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:53-72 [Conf]
  3. José L. Balcázar, Josep Díaz, Joaquim Gabarró
    On Non- uniform Polynomial Space. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:35-50 [Conf]
  4. Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán
    Efficient Parallel Algorithms for some Tree Layout Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:313-323 [Conf]
  5. Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna
    Layout Problems on Lattice Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:103-112 [Conf]
  6. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Counting H-Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:298-307 [Conf]
  7. José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe
    An Optimal Parallel Algorithm for Learning DFA. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:208-217 [Conf]
  8. J. Díaz, G. Grammatikopoulos, Alexis C. Kaporis, Lefteris M. Kirousis, X. Pérez, Dionisios G. Sotiropoulos
    5-Regular Graphs are 3-Colorable with Positive Probability. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:215-225 [Conf]
  9. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:275-286 [Conf]
  10. Josep Díaz, Maria J. Serna, Jacobo Torán
    Parallel Approximation Schemes for problems on planar graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:145-156 [Conf]
  11. Josep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos
    H-Colorings of Large Degree Graphs. [Citation Graph (0, 0)][DBLP]
    EurAsia-ICT, 2002, pp:850-857 [Conf]
  12. Carme Àlvarez, Josep Díaz, Jacobo Torán
    Complexity Classes with Complete Problems Between P and NP-C. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:13-24 [Conf]
  13. José L. Balcázar, Josep Díaz, Joaquim Gabarró
    On some "non-uniform" complexity measures. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:18-27 [Conf]
  14. Carme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, Maria J. Serna
    Routing Tree Problems on Random Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:99-110 [Conf]
  15. Rafael Casas, Josep Díaz, Conrado Martinez
    Static on Random Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:186-203 [Conf]
  16. Josep Diaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela
    Balanced Cut Approximation in Random Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:527-536 [Conf]
  17. Josep Díaz, Jordi Petit, Panagiotis Psycharis, Maria J. Serna
    A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:457-466 [Conf]
  18. Josep Díaz, Maria J. Serna, Nicholas C. Wormald
    Computation of the Bisection Width for Random d-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:49-58 [Conf]
  19. Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna
    Adversarial Models for Priority-Based Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:142-151 [Conf]
  20. Josep Díaz
    Graph Layout Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:14-23 [Conf]
  21. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    (H, C, K)-Coloring: Fast, Easy, and Hard Cases. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:304-315 [Conf]
  22. Carme Àlvarez, Josep Díaz, Jordi Petit, José D. P. Rolim, Maria J. Serna
    Efficient and reliable high level communication in randomly deployed wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    Mobility Management & Wireless Access Protocols, 2004, pp:106-110 [Conf]
  23. Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald
    Bisection of Random Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:114-125 [Conf]
  24. Josep Díaz, Jordi Petit, Maria J. Serna
    Random Geometric Problems on [0, 1]². [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:294-306 [Conf]
  25. Josep Díaz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos
    Stability and non-stability of the FIFO protocol. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:48-52 [Conf]
  26. Josep Díaz, Dimitrios M. Thilikos
    Fast FPT-Algorithms for Cleaning Grids. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:361-371 [Conf]
  27. Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán
    The MINSUMCUT Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:65-89 [Conf]
  28. Josep Díaz, Jordi Petit, Maria J. Serna
    Evaluation of Basic Protocols for Optical Smart Dust Networks. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:97-106 [Conf]
  29. Josep Díaz, Jordi Petit, Dimitrios M. Thilikos
    Kernels for the Vertex Cover Problem on the Preferred Attachment Model. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:231-240 [Conf]
  30. Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna
    Linear Orderings of Random Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:291-302 [Conf]
  31. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    The Complexity of Restrictive H-Coloring. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:126-137 [Conf]
  32. Josep Díaz, Maria J. Serna, Jacobo Torán
    Parallel Approximation Schemes for Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:4, pp:387-408 [Journal]
  33. Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna
    Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:6, pp:- [Journal]
  34. Josep Díaz, Jordi Petit, Maria J. Serna
    A survey of graph layout problems. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2002, v:34, n:3, pp:313-356 [Journal]
  35. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    The restrictive H-coloring problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:297-305 [Journal]
  36. Jan Kratochvíl, Josep Díaz, Jirí Fiala
    Editorial. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:79-80 [Journal]
  37. Carme Àlvarez, Josep Díaz, Maria J. Serna
    The hardness of intervalizing four colored caterpillars. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:19-27 [Journal]
  38. Josep Díaz, Jordi Petit, Maria J. Serna, Luca Trevisan
    Approximating layout problems on random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:245-253 [Journal]
  39. José L. Balcázar, Josep Díaz, Joaquim Gabarró
    Some results about Logspace complexity measures. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:22, n:, pp:8- [Journal]
  40. José L. Balcázar, Josep Díaz, Joaquim Gabarró
    Examples of CFI-BI-immune and CF-levelable sets in logspace. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:25, n:, pp:11-13 [Journal]
  41. Josep Díaz
    H-Colorings of Graphs. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2001, v:75, n:, pp:82-96 [Journal]
  42. Josep Díaz
    Primes in P (Without Assumptions). [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:78, n:, pp:67-71 [Journal]
  43. Josep Díaz
    Analysis of Algorithms (AofA): Part I: 1993 -- 1998. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:77, n:, pp:42-62 [Journal]
  44. José L. Balcázar, Josep Díaz, Joaquim Gabarró
    Uniform Characterizations of Non-Uniform Complexity Measures [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:67, n:1-3, pp:53-69 [Journal]
  45. Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna
    The complexity of deciding stability under FFS in the Adversarial Queueing model. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:5, pp:261-266 [Journal]
  46. José L. Balcázar, Josep Díaz
    A Note on a Theorem by Ladner. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:2, pp:84-86 [Journal]
  47. Rafael Casas, Josep Díaz, Jean-Marc Steyaert
    Average-Case Analysis of Robinson's Unification Algorithm with Two Different Variables. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:5, pp:227-232 [Journal]
  48. Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna
    Approximating Layout Problems on Random Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:1, pp:78-116 [Journal]
  49. José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe
    An Optimal Parallel Algorithm for Learning DFA. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1996, v:2, n:3, pp:97-112 [Journal]
  50. Josep Díaz, Jacobo Torán
    Classes of Bounded Nondeterminism. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1990, v:23, n:1, pp:21-32 [Journal]
  51. Carme Àlvarez, Maria J. Blesa, Josep Díaz, Maria J. Serna, Antonio Fernández
    Adversarial models for priority-based networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:1, pp:23-35 [Journal]
  52. José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe
    The Query Complexity of Learning DFA. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1994, v:12, n:4, pp:337-358 [Journal]
  53. Josep Díaz, Jordi Petit, Maria J. Serna
    Faulty Random Geometric Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2000, v:10, n:4, pp:343-358 [Journal]
  54. Ricardo A. Baeza-Yates, Rafael Casas, Josep Díaz, Conrado Martinez
    On the Average Size of the Intersection of Binary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:24-32 [Journal]
  55. José L. Balcázar, Josep Díaz, Joaquim Gabarró
    On Characterizations of the Class PSPACE/POLY. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:251-267 [Journal]
  56. Rafael Casas, Josep Díaz, Conrado Martinez
    Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:117, n:1&2, pp:99-112 [Journal]
  57. Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald
    Bounds on the max and min bisection of random cubic and random 4-regular graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:3, pp:531-547 [Journal]
  58. Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán
    Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:2, pp:267-287 [Journal]
  59. Josep Díaz, Juhani Karhumäki
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:129- [Journal]
  60. Josep Díaz, Maria J. Serna, Paul G. Spirakis
    On the Random Generation and Counting of Matchings in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:201, n:1-2, pp:281-290 [Journal]
  61. Josep Díaz, Vishal Sanwalani, Maria J. Serna, Paul G. Spirakis
    The chromatic and clique numbers of random scaled sector graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:40-51 [Journal]
  62. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Counting H-colorings of partial k-trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:291-309 [Journal]
  63. Josep Díaz, Marcin Kaminski
    MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:377, n:1-3, pp:271-276 [Journal]
  64. Josep Díaz, Jordi Petit, Maria J. Serna
    A Random Graph Model for Optical Networks of Sensors. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Mob. Comput., 2003, v:2, n:3, pp:186-196 [Journal]
  65. Josep Díaz, Marcin Kaminski
    Max-Cut and Max-Bisection are NP-hard on unit disk graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  66. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Complexity issues on bounded restrictive H-coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2082-2093 [Journal]
  67. Carme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, Maria J. Serna
    Communication tree problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:197-217 [Journal]
  68. Josep Díaz, Maria J. Serna, Nicholas C. Wormald
    Bounds on the bisection width for random d -regular graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:120-130 [Journal]

  69. A new upper bound for 3-SAT. [Citation Graph (, )][DBLP]


  70. On the connectivity of dynamic random geometric graphs. [Citation Graph (, )][DBLP]


  71. On the Power of Mediators. [Citation Graph (, )][DBLP]


  72. On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs [Citation Graph (, )][DBLP]


  73. A new upper bound for 3-SAT [Citation Graph (, )][DBLP]


  74. Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks [Citation Graph (, )][DBLP]


  75. A note on the subgraphs of the (2× INFINITY )-grid. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.459secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002