SIAM Journal on Computing
Collection
Collection
- ISSN: 0097-5397
Published by SIAM
-
Finding $k$ disjoint paths in a directed planar graph Article
SIAM Journal on Computing, 23(4), 780-788.January 1994
-
A new approach to formal language theory by Kolmogorov complexity Article
SIAM Journal on Computing, 24(2), 398-410.January 1995 -
Sparse reduces conjunctively to tally Article
SIAM Journal on Computing, 24(4), 673-681.January 1995 -
Splittings, robustness, and structure of complete sets Article
SIAM Journal on Computing, 27(3), 637-653.January 1998 -
Space-efficient routing tables for almost all networks and the incompressibility method Article
SIAM Journal on Computing, 28(4), 1414-1432.H.M. Buhrman (Harry), J.H. Hoepman (Jaap-Henk) and P.M.B. Vitányi (Paul)
January 1999 -
Kolmogorov random graphs and the incompressibility method Article
SIAM Journal on Computing, 29(2), 590-599.H.M. Buhrman (Harry), M. Li (Ming), J.T. Tromp (John) and P.M.B. Vitányi (Paul)
January 1999 -
Bipartite edge-colouring in O(Delta m) time Article
SIAM Journal on Computing, 841-846.January 1999
-
Separating complexity classes using autoreducibility Article
SIAM Journal on Computing, 29(5), 1497-1520.H.M. Buhrman (Harry), L. Fortnow (Lance), D. van Melkebeek and L. Torenvliet (Leen)
January 2000