Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Samuel Kutin

dblp:34/1908 · also Samuel A. Kutin · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2Artificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational complexity · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity › query complexity
block sensitivity
0.012004
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions · Inf. Comput. 2004
Computational complexity
boolean function complexity
0.012004
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions · Inf. Comput. 2004
YearPublicationVenuePosition
2004 Sensitivity, block sensitivity, and l-block sensitivity of boolean functions
Claire Mathieu, Samuel Kutin
Inf. Comput.2
2002 Almost-everywhere Algorithmic Stability and Generalization Error
Samuel Kutin, Partha Niyogi
UAI1
2002 The Quantum Black-Box Complexity of Majority
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebeek
Algorithmica2