The MathNet Korea
Information Center for Mathematical Science

### 논문검색

Information Center for Mathematical Science

SIAM Journal on Computing
( Vol.29 NO.1 / 1999 )
 How Good is the Geomans-Williamson Max Cut Algorithm? Pages 336-350 The Swapping Problem on a Line Pages 327-335 Equivalence of Measures of Complexity Classes Pages 302-326 On Regular Tree Embeddings Pages 288-301 Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\mathcal{NP}$-Complete Pages 274-287 Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults Pages 258-273 Achilles, Turtle, and Undecidable Boundedness Problems for Small Datalog Programs Pages 231-257 The Algorithmic Aspects of Uncrowded Hypergraphs Pages 201-230 Balanced Allocations Pages 180-200 Finding Separator Cuts in Planar Graphs within Twice the Optimal Pages 159-179 The Complexity of Tree Automata and Logics of Programs Pages 132-158 Constructing Evolutionary Trees in the Presence of Polymorphic Characters Pages 103-131 Regular Closure of Deterministic Languages Pages 81-102 An Algorithm for Shortest Paths in Bipartitie Digraphs with Concave Weight Matrices and its Applications Pages 65-80 Tight Analyses of Two Local Load Balancing Algorithms Pages 29-64 Multiple Noninteractive Zero Knowledge Proofs under General Assumptions Pages 1-28