Ricard Gavaldà

Available identifiers

zbMath Open gavalda.ricardWikidataQ77863728 ScholiaQ77863728MaRDI QIDQ479462

List of research outcomes

Publication	Date of Publication	Type
Learning ordered binary decision diagrams	2023-12-08	Paper
A new method of moments for latent variable models	2018-12-07	Paper
An efficient closed frequent itemset miner for the MOA stream mining system	2017-11-07	Paper
Learning Probability Distributions Generated by Finite-State Machines	2017-02-15	Paper
Learning read-constant polynomials of constant degree modulo composites	2015-02-05	Paper
Adaptively learning probabilistic deterministic automata from data streams	2014-12-05	Paper
Learning probabilistic automata: a study in state distinguishability	2013-03-04	Paper
Learning Read-Constant Polynomials of Constant Degree Modulo Composites	2011-06-17	Paper
A Lower Bound for Learning Distributions Generated by Probabilistic Automata	2010-10-01	Paper
Learning PDFA with Asynchronous Transitions	2010-09-10	Paper
An Algebraic Perspective on Boolean Function Learning	2009-12-01	Paper
Self-adaptive utility-based web session management	2009-10-26	Paper
Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata	2008-10-16	Paper
Tractable Clones of Polynomials over Semigroups	2008-09-09	Paper
Learning expressions and programs over monoids	2006-04-28	Paper
New Computational Paradigms	2006-01-11	Paper
Non-automatizability of bounded-depth Frege proofs	2005-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q4739610	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4418661	2003-08-11	Paper
Monotone proofs of the pigeon hole principle	2002-06-16	Paper
Adaptive sampling methods for scaling up knowledge discovery algorithms	2002-05-30	Paper
https://portal.mardi4nfdi.de/entity/Q2762512	2002-01-09	Paper
https://portal.mardi4nfdi.de/entity/Q2754140	2001-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q4942035	2001-03-12	Paper
https://portal.mardi4nfdi.de/entity/Q4520312	2001-02-26	Paper
Bounding the expected length of longest common subsequences and forests	1999-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q4348124	1997-09-22	Paper
Computational power of neural networks: a characterization in terms of Kolmogorov complexity	1997-07-23	Paper
https://portal.mardi4nfdi.de/entity/Q4336266	1997-06-12	Paper
https://portal.mardi4nfdi.de/entity/Q4336267	1997-06-12	Paper
Oracles and queries that are sufficient for exact learning	1996-11-26	Paper
Bounding the complexity of advice functions	1995-07-24	Paper
Structural analysis of polynomial-time query learnability	1995-03-20	Paper
The query complexity of learning DFA	1994-11-20	Paper
On the Computational Complexity of Small Descriptions	1994-11-13	Paper
A positive relativization of polynomial time versus polylog space	1993-10-03	Paper
Strong and robustly strong polynomial-time reducibilities to sparse sets	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3976035	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3812229	1988-01-01	Paper

Research outcomes over time

This page was built for person: Ricard Gavaldà