Facet browsing currently unavailable
Page 4 of 3758 results
Sort by: relevance publication year
b-Matchings in Trees JOURNAL ARTICLE published March 1976 in SIAM Journal on Computing |
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback JOURNAL ARTICLE published January 2017 in SIAM Journal on Computing Research funded by Seventh Framework Programme (306638) | Israel Science Foundation (425/13) | Instituto Nazionale di Fisica Nucleare (2010N5K7EB_003) |
Preface JOURNAL ARTICLE published March 1972 in SIAM Journal on Computing |
Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013) JOURNAL ARTICLE published January 2016 in SIAM Journal on Computing |
Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017) JOURNAL ARTICLE published April 2022 in SIAM Journal on Computing |
An Associative Block Design ABD(8,5) JOURNAL ARTICLE published January 1999 in SIAM Journal on Computing |
Approximating Boolean Functions with Depth-2 Circuits JOURNAL ARTICLE published January 2015 in SIAM Journal on Computing |
On the Power of Logic Resynthesis JOURNAL ARTICLE published January 2000 in SIAM Journal on Computing |
An Analysis of Backtracking with Search Rearrangement JOURNAL ARTICLE published November 1983 in SIAM Journal on Computing |
Maximal Rank of $mtimes ntimes(mn-k)$ Tensors JOURNAL ARTICLE published June 1990 in SIAM Journal on Computing |
On the Complexity of Composition and Generalized Composition of Power Series JOURNAL ARTICLE published February 1980 in SIAM Journal on Computing |
The Spectra of Infinite Hypertrees JOURNAL ARTICLE published October 1991 in SIAM Journal on Computing |
Computing the Order of a Locally Testable Automaton JOURNAL ARTICLE published December 1994 in SIAM Journal on Computing |
A Theorem on Sensitivity and Applications in Private Computation JOURNAL ARTICLE published January 2002 in SIAM Journal on Computing |
The Compactness of Interval Routing for Almost All Graphs JOURNAL ARTICLE published January 2001 in SIAM Journal on Computing |
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model JOURNAL ARTICLE published April 2022 in SIAM Journal on Computing |
Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs JOURNAL ARTICLE published January 2014 in SIAM Journal on Computing |
Additive Complexity and Zeros of Real Polynomials JOURNAL ARTICLE published February 1985 in SIAM Journal on Computing |
On the Power of Real Turing Machines over Binary Inputs JOURNAL ARTICLE published February 1997 in SIAM Journal on Computing |
Local Randomness in Polynomial Random Number and Random Function Generators JOURNAL ARTICLE published August 1993 in SIAM Journal on Computing |