The MathNet Korea
Information Center for Mathematical Science

### 논문검색

Information Center for Mathematical Science

SIAM Journal on Computing
( Vol.27 NO.4 / 1998 )
 A Chernoff Bound for Random Walks on Expander Graphs Pages 1203-1220 Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models Pages 1190-1202 Guaranteeing Fair Service to Persistent Dependent Tasks Pages 1168-1189 The Complexity of Planar Counting Problems Pages 1142-1167 Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real Pages 1099-1115 An $\Omega(\sqrt{log \log n})$ Lower Bound for Routing in Optical Networks Pages 1083-1098 Randomized Data Structures for the Dynamic Closest-Pair Problem Pages 1036-1072 Surface Approximation and Geometric Partitions Pages 1016-1035 Bounding the Power of Preemption in Randomized Scheduling Pages 993-1015 All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings Pages 972-992 Planar Integer Linear Programming is NC Equivalent to Euclidean GCD Pages 960-971 Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference Pages 942-959 Fast Gossiping by Short Messages Pages 917-941 Computational Complexity and Knowledge Complexity Pages 1116-1141 Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata Pages 1073-1082