Sandra Zilles

From MaRDI portal
Person:249060

Available identifiers

zbMath Open zilles.sandraDBLPz/SandraZillesWikidataQ29447368 ScholiaQ29447368MaRDI QIDQ249060

List of research outcomes





PublicationDate of PublicationType
The zero-visibility cops and robber game on graph products2024-06-28Paper
Inferring symbolic automata2024-04-10Paper
New results on the zero-visibility cops and robber game2024-02-23Paper
Inferring Symbolic Automata2023-08-26Paper
Fast searching on \(k\)-combinable graphs2023-07-07Paper
Fast searching on cactus graphs2023-04-17Paper
Aggregating preferences represented by conditional preference networks2023-03-31Paper
A simple method for proving lower bounds in the zero-visibility cops and robber game2022-07-18Paper
A partition approach to lower bounds for zero-visibility cops and robber2020-02-25Paper
Finitely distinguishable erasing pattern languages2020-01-29Paper
The complexity of exact learning of acyclic conditional preference networks from swap examples2020-01-20Paper
Erasing pattern languages distinguishable by a finite number of strings2019-01-10Paper
Preference-based teaching of unions of geometric objects2019-01-10Paper
The fast search number of a complete \(k\)-partite graph2018-10-18Paper
On the teaching complexity of linear sets2018-03-12Paper
Distinguishing pattern languages with membership examples2017-09-28Paper
Preference-based teaching2017-09-27Paper
A survey on recent results on partial learning2017-06-09Paper
Fast searching on complete \(k\)-partite graphs2017-02-01Paper
On the Teaching Complexity of Linear Sets2016-11-30Paper
Combining models of approximation with partial learning2016-11-30Paper
Classifying the arithmetical complexity of teaching models2016-11-09Paper
Order compression schemes2016-02-26Paper
Partial learning of recursively enumerable languages2016-02-26Paper
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces2015-12-23Paper
A polynomial-time algorithm for computing the resilience of arrangements of ray sensors2015-04-22Paper
Predicting optimal solution cost with conditional probabilities2015-02-05Paper
Generalizing labeled and unlabeled sample compression to multi-label concept classes2015-01-14Paper
Recursive teaching dimension, VC-dimension and sample compression2014-12-08Paper
Algebraic methods proving Sauer's bound for teaching complexity2014-10-31Paper
Distinguishing pattern languages with membership examples2014-03-31Paper
Models of cooperative teaching and learning2014-02-03Paper
Order compression schemes2013-11-06Paper
Partial learning of recursively enumerable languages2013-11-06Paper
Predicting the size of IDA\(^*\)'s search tree2013-08-23Paper
Learning without coding2013-03-04Paper
Sauer's bound for a notion of teaching complexity2012-10-16Paper
Polynomial-time algorithms for learning typed pattern languages2012-06-08Paper
Learning heuristic functions for large state spaces2012-05-23Paper
Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach2011-10-28Paper
Learning relational patterns2011-10-19Paper
Erratum: ``Learning without coding2011-10-19Paper
Competitive search in symmetric trees2011-08-12Paper
The computational complexity of avoiding spurious states in state space abstraction2011-01-31Paper
Recursive teaching dimension, learning complexity, and maximum classes2010-10-01Paper
Learning without Coding2010-10-01Paper
Incremental learning with temporary memory2010-07-07Paper
Models of active learning in group-structured state spaces2010-04-08Paper
Intrinsic complexity of uniform learning2010-02-23Paper
Algorithmic Learning Theory2010-02-23Paper
Formal language identification: query learning vs. gold-style learning2009-07-21Paper
Learning with Temporary Memory2008-10-14Paper
Active Learning of Group-Structured Environments2008-10-14Paper
Towards a Better Understanding of Incremental Learning2008-09-04Paper
Learning indexed families of recursive languages from positive data: A survey2008-05-28Paper
Learning recursive functions: A survey2008-05-28Paper
A general comparison of language learning from examples and from queries2007-12-19Paper
Some natural conditions on incremental learning2007-11-21Paper
An approach to intrinsic complexity of uniform learning2007-01-09Paper
Algorithmic Learning Theory2006-11-01Paper
Relations between Gold-style learning and query learning2006-01-10Paper
Algorithmic Learning Theory2005-08-18Paper
Learning Theory2005-06-13Paper
Increasing the power of uniform inductive learners2005-06-13Paper
https://portal.mardi4nfdi.de/entity/Q30467072004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44735582004-08-04Paper
Separation of uniform learning classes.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q31488042002-09-22Paper

Research outcomes over time

This page was built for person: Sandra Zilles