Ricard Gavaldà

From MaRDI portal
Person:479462

Available identifiers

zbMath Open gavalda.ricardWikidataQ77863728 ScholiaQ77863728MaRDI QIDQ479462

List of research outcomes





PublicationDate of PublicationType
Learning ordered binary decision diagrams2023-12-08Paper
A new method of moments for latent variable models2018-12-07Paper
An efficient closed frequent itemset miner for the MOA stream mining system2017-11-07Paper
Learning Probability Distributions Generated by Finite-State Machines2017-02-15Paper
Learning read-constant polynomials of constant degree modulo composites2015-02-05Paper
Adaptively learning probabilistic deterministic automata from data streams2014-12-05Paper
Learning probabilistic automata: a study in state distinguishability2013-03-04Paper
Learning Read-Constant Polynomials of Constant Degree Modulo Composites2011-06-17Paper
A Lower Bound for Learning Distributions Generated by Probabilistic Automata2010-10-01Paper
Learning PDFA with Asynchronous Transitions2010-09-10Paper
An Algebraic Perspective on Boolean Function Learning2009-12-01Paper
Self-adaptive utility-based web session management2009-10-26Paper
Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata2008-10-16Paper
Tractable Clones of Polynomials over Semigroups2008-09-09Paper
Learning expressions and programs over monoids2006-04-28Paper
New Computational Paradigms2006-01-11Paper
Non-automatizability of bounded-depth Frege proofs2005-02-23Paper
https://portal.mardi4nfdi.de/entity/Q47396102004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44186612003-08-11Paper
Monotone proofs of the pigeon hole principle2002-06-16Paper
Adaptive sampling methods for scaling up knowledge discovery algorithms2002-05-30Paper
https://portal.mardi4nfdi.de/entity/Q27625122002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27541402001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q49420352001-03-12Paper
https://portal.mardi4nfdi.de/entity/Q45203122001-02-26Paper
Bounding the expected length of longest common subsequences and forests1999-06-28Paper
https://portal.mardi4nfdi.de/entity/Q43481241997-09-22Paper
Computational power of neural networks: a characterization in terms of Kolmogorov complexity1997-07-23Paper
https://portal.mardi4nfdi.de/entity/Q43362661997-06-12Paper
https://portal.mardi4nfdi.de/entity/Q43362671997-06-12Paper
Oracles and queries that are sufficient for exact learning1996-11-26Paper
Bounding the complexity of advice functions1995-07-24Paper
Structural analysis of polynomial-time query learnability1995-03-20Paper
The query complexity of learning DFA1994-11-20Paper
On the Computational Complexity of Small Descriptions1994-11-13Paper
A positive relativization of polynomial time versus polylog space1993-10-03Paper
Strong and robustly strong polynomial-time reducibilities to sparse sets1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39760351992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q38122291988-01-01Paper

Research outcomes over time

This page was built for person: Ricard Gavaldà