Catch them if you can
type: Item
instance of: scholarly article
title: Catch them if you can
zbMATH Open document ID: 1362.68296
DOI: 10.1145/2422436.2422489
author: Marek Cygan
author: Matthias Englert
author: Anupam Gupta
author: Marcin Mucha
author: Piotr Sankowski
published in: Proceedings of the 4th conference on Innovations in Theoretical Computer Science
publication date: 2017-05-16T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6718211
zbMATH Keywords: bipartite matching
zbMATH Keywords: impatience
zbMATH Keywords: online algorithms
zbMATH Keywords: stochastic models
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1145/2422436.2422489
OpenAlex ID: W2082701787
cites work: Learning from different teachers
cites work: On specifying Boolean functions by labelled examples
cites work: Measuring teachability using variants of the teaching dimension
cites work: Algorithmic Learning Theory
cites work: Teaching Randomized Learners
cites work: Recent Developments in Algorithmic Teaching
cites work: Occam's razor
cites work: Q4013552
cites work: On the power of inductive inference from good examples
cites work: Q3272460
cites work: On the complexity of teaching
cites work: Teaching a smarter learner.
cites work: A theory of goal-oriented communication
cites work: In search of an easy witness: Exponential time vs. probabilistic polynomial time.
cites work: Q4526985
cites work: Derandomizing polynomial identity tests means proving circuit lower bounds
cites work: Q4013545
cites work: A model of interactive teaching
cites work: Pseudorandom generators for space-bounded computation
cites work: On the limits of efficient teachability
cites work: Teachability in computational learning
cites work: A theory of the learnable
cites work: Models of cooperative teaching and learning
Recommended article: To satisfy impatient web surfers is hard
Recommended article: Q3328223
Recommended article: On Queueing with Customer Impatience Until the End of Service
Recommended article: On queueing with customer impatience until the beginning of service
Recommended article: A single server queue with impatient and feedback customers
Recommended article: Routing and staffing in customer service chat systems with impatient customers
Recommended article: The slow server problem for uninformed customers
Recommended article: Queues with slow servers and impatient customers
description: scientific article; zbMATH DE number 6718211