Facet browsing currently unavailable
Page 3 of 3759 results
Sort by: relevance publication year
Tight Bounds for Testing Bipartiteness in General Graphs JOURNAL ARTICLE published January 2004 in SIAM Journal on Computing |
Solving Undirected Graph Problems on VLSI JOURNAL ARTICLE published August 1985 in SIAM Journal on Computing |
Work-Preserving Speed-Up of Parallel Matrix Computations JOURNAL ARTICLE published August 1995 in SIAM Journal on Computing |
Computing $k$-Atomicity in Polynomial Time JOURNAL ARTICLE published January 2018 in SIAM Journal on Computing |
An Asymptotically Optimal Algorithm for the Dutch National Flag Problem JOURNAL ARTICLE published May 1982 in SIAM Journal on Computing |
Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems JOURNAL ARTICLE published February 1981 in SIAM Journal on Computing |
Metric Embeddings with Relaxed Guarantees JOURNAL ARTICLE published January 2009 in SIAM Journal on Computing |
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments JOURNAL ARTICLE published January 2008 in SIAM Journal on Computing |
Nearly Optimal NP-Hardness of Unique Coverage JOURNAL ARTICLE published January 2017 in SIAM Journal on Computing Research funded by National Science Foundation (CCF-1115525) |
Nonindependent Randomized Rounding and an Application to Digital Halftoning JOURNAL ARTICLE published January 2005 in SIAM Journal on Computing |
A Correctness Condition for High-Performance Multiprocessors JOURNAL ARTICLE published December 1998 in SIAM Journal on Computing |
Mitotic Classes in Inductive Inference JOURNAL ARTICLE published January 2008 in SIAM Journal on Computing |
Single Machine Job Sequencing with Precedence Constraints JOURNAL ARTICLE published March 1977 in SIAM Journal on Computing |
Sums of Divisors, Perfect Numbers and Factoring JOURNAL ARTICLE published November 1986 in SIAM Journal on Computing |
A Simple Unpredictable Pseudo-Random Number Generator JOURNAL ARTICLE published May 1986 in SIAM Journal on Computing |
Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer JOURNAL ARTICLE published January 2010 in SIAM Journal on Computing |
Completion of a Set of Rules Modulo a Set of Equations JOURNAL ARTICLE published November 1986 in SIAM Journal on Computing |
Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$ JOURNAL ARTICLE published June 1975 in SIAM Journal on Computing |
Data Types as Lattices JOURNAL ARTICLE published September 1976 in SIAM Journal on Computing |
Preface JOURNAL ARTICLE published March 1972 in SIAM Journal on Computing |