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

Search the dblp DataBase

Title:
Author:
Ricard Gavaldà: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
    Oracles and Queries That Are Sufficient for Exact Learning. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:3, pp:421-433 [Journal]
  2. 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]
  3. Ricard Gavaldà, David Guijarro
    Learning Ordered Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    ALT, 1995, pp:228-238 [Conf]
  4. 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]
  5. José L. Balcázar, Ricard Gavaldà, Osamu Watanabe
    Coding Complexity: The Computational Complexity of Succinct Descriptions. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:73-91 [Conf]
  6. Ricard Gavaldà
    An Algebraic View on Exact Learning from Queries. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:150-151 [Conf]
  7. Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi
    Non-Automatizability of Bounded-Depth Frege Proofs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:15-23 [Conf]
  8. José L. Balcázar, Ricard Gavaldà, Hava T. Siegelmann, Eduardo D. Sontag
    Some Structural Complexity Aspects of Neural Computation. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:253-265 [Conf]
  9. Ricard Gavaldà
    Bounding the Complexity of Advice Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:249-254 [Conf]
  10. Ricard Gavaldà
    The Complexity of Learning with Queries. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:324-337 [Conf]
  11. Ricard Gavaldà, Osamu Watanabe
    On the Computational Complexity of Small Descriptions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:89-101 [Conf]
  12. 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]
  13. Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
    Tractable Clones of Polynomials over Semigroups. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:196-210 [Conf]
  14. Carlos Domingo, Ricard Gavaldà, Osamu Watanabe
    Practical Algorithms for On-line Sampling. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1998, pp:150-161 [Conf]
  15. Albert Bifet, Ricard Gavaldà
    Kalman Filters and Adaptive Windows for Learning in Data Streams. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2006, pp:29-40 [Conf]
  16. Carlos Domingo, Ricard Gavaldà, Osamu Watanabe
    Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1999, pp:172-183 [Conf]
  17. Ricard Gavaldà, Philipp W. Keller, Joelle Pineau, Doina Precup
    PAC-Learning of Markov Models with Hidden State. [Citation Graph (0, 0)][DBLP]
    ECML, 2006, pp:150-161 [Conf]
  18. Albert Atserias, Nicola Galesi, Ricard Gavaldà
    Monotone Proofs of the Pigeon Hole Principle. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:151-162 [Conf]
  19. Ricard Gavaldà, José L. Balcázar
    Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:300-308 [Conf]
  20. Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar
    Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:269-276 [Conf]
  21. Joaquim Gabarró, Ricard Gavaldà
    Correctness of flat data parallel algorithms: an axiomatic approach and examples. [Citation Graph (0, 0)][DBLP]
    PARLE, 1992, pp:955-956 [Conf]
  22. Ricard Gavaldà, Osamu Watanabe
    Sequential Sampling Algorithms: Unified Analysis and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    SAGA, 2001, pp:173-188 [Conf]
  23. Ricard Gavaldà, Denis Thérien
    Learning Expressions over Monoids. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:283-293 [Conf]
  24. Ricard Gavaldà, Denis Thérien
    Algebraic Characterizations of Small Classes of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:331-342 [Conf]
  25. Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi
    Non-Automatizability of Bounded-Depth Frege Proofs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2004, v:13, n:1-2, pp:47-68 [Journal]
  26. Carlos Domingo, Ricard Gavaldà, Osamu Watanabe
    Practical algorithms for on-line sampling [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  27. Carlos Domingo, Ricard Gavaldà, Osamu Watanabe
    Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms. [Citation Graph (0, 0)][DBLP]
    Data Min. Knowl. Discov., 2002, v:6, n:2, pp:131-152 [Journal]
  28. Albert Atserias, Nicola Galesi, Ricard Gavaldà
    Monotone Proofs of the Pigeon Hole Principle [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:8, pp:- [Journal]
  29. Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
    Tractable Clones of Polynomials over Semigroups [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:059, pp:- [Journal]
  30. Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
    Oracles and Queries That Are Sufficient for Exact Learning [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:15, pp:- [Journal]
  31. Ricard Gavaldà, Pascal Tesson, Denis Thérien
    Learning expressions and programs over monoids. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:2, pp:177-209 [Journal]
  32. Ricard Gavaldà
    A Positive Relativization of Polynomial Time Versus Polylog Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:3, pp:119-123 [Journal]
  33. Ricard Gavaldà
    Bounding the Complexity of Advice Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:468-475 [Journal]
  34. Joaquim Gabarró, Ricard Gavaldà
    An Approach to Correctness of Data Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:22, n:2, pp:185-201 [Journal]
  35. 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]
  36. Albert Atserias, Nicola Galesi, Ricard Gavaldà
    Monotone Proofs of the Pigeon Hole Principle. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:461-474 [Journal]
  37. Ricardo A. Baeza-Yates, Ricard Gavaldà, Gonzalo Navarro, R. Scheihing
    Bounding the Expected Length of Longest Common Subsequences and Forests. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:4, pp:435-452 [Journal]
  38. Osamu Watanabe, Ricard Gavaldà
    Structural Analysis of Polynomial-Time Query Learnability. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:231-256 [Journal]
  39. Ricard Gavaldà, Hava T. Siegelmann
    Discontinuities in Recurrent Neural Networks. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 1999, v:11, n:3, pp:715-745 [Journal]
  40. 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]
  41. Ricard Gavaldà, Osamu Watanabe
    On the Computational Complexity of Small Descriptions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1257-1275 [Journal]
  42. Ricard Gavaldà, José L. Balcázar
    Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:1, pp:1-14 [Journal]
  43. Ricard Gavaldà, Eiji Takimoto
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:364, n:1, pp:1-2 [Journal]
  44. José L. Balcázar, Ricard Gavaldà, Hava T. Siegelmann
    Computational power of neural networks: a characterization in terms of Kolmogorov complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1175-1183 [Journal]
  45. Albert Bifet, Ricard Gavaldà
    Learning from Time-Changing Data with Adaptive Windowing. [Citation Graph (0, 0)][DBLP]
    SDM, 2007, pp:- [Conf]
  46. Nicolas Poggi, Toni Moreno, Josep Lluis Berral, Ricard Gavaldà, Jordi Torres
    Web Customer Modeling for Automated Session Prioritization on High Traffic Sites. [Citation Graph (0, 0)][DBLP]
    User Modeling, 2007, pp:450-454 [Conf]

  47. An Algebraic Perspective on Boolean Function Learning. [Citation Graph (, )][DBLP]


  48. A Lower Bound for Learning Distributions Generated by Probabilistic Automata. [Citation Graph (, )][DBLP]


  49. Adaptive distributed mechanism against flooding network attacks based on machine learning. [Citation Graph (, )][DBLP]


  50. Tailoring Resources: The Energy Efficient Consolidation Strategy Goes Beyond Virtualization. [Citation Graph (, )][DBLP]


  51. Predicting Web Server Crashes: A Case Study in Comparing Prediction Algorithms. [Citation Graph (, )][DBLP]


  52. Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata. [Citation Graph (, )][DBLP]


  53. Learning PDFA with Asynchronous Transitions. [Citation Graph (, )][DBLP]


  54. Adaptive Learning from Evolving Data Streams. [Citation Graph (, )][DBLP]


  55. Reducing wasted resources to help achieve green data centers. [Citation Graph (, )][DBLP]


  56. Mining adaptively frequent closed unlabeled rooted trees in data streams. [Citation Graph (, )][DBLP]


  57. New ensemble methods for evolving data streams. [Citation Graph (, )][DBLP]


  58. Adaptive XML Tree Classification on Evolving Data Streams. [Citation Graph (, )][DBLP]


  59. Improving Adaptive Bagging Methods for Evolving Data Streams. [Citation Graph (, )][DBLP]


  60. Towards energy-aware scheduling in data centers using machine learning. [Citation Graph (, )][DBLP]


  61. Self-adaptive utility-based web session management. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.011secs
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