The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

SIAM Journal on Computing
( Vol.28 NO.4 / 1999 )
home Stack and Queue Layouts of Directed Acyclic Graph:Part I
Pages 1510-1539
Lenwood S. Heath, Sriram V. Pemmaraju, Ann. N Trenk,
home Lower Bounds in a Parallel Model Without Bit Operations
Pages 1460-1509
Ketan Mulmuley,
home Computing with Very Weak Random Sources
Pages 1433-1459
Aravind Srinivasan, David Zuckerman,
home Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method
Pages 1414-1432
Harry Buhrman, Jaap-Henk Hoepman, Paul Vitanyi,
home Local Labeling and Resource Allocation Using Preprocessing
Pages 1397-1413
Hagit Attiya, Hadas Shachnai, Tami Tamir,
home A Pseudorandom Generator from Any One-Way Function
Pages 1364-1396
Johan Hastad, Russell Impagliazzo, Leonid A. Levin, Michael Luby,
home Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
Pages 1347-1363
Ichiro Suzuki, Masafumi Yamashita,
home Buckets, Heaps, Lists, and Monotone Priority Queues
Pages 1326-1346
Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein,
home Fine Separation of Average-Time Complexity Classes
Pages 1310-1325
Jin-Yi Cai, Alan L. Selman,
home Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, $k$-MST, and Related Problems
Pages 1298-1309
Joseph S. B. Mitchell,
home Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-Free Graphs
Pages 1284-1297
Derek G. Corneil, Stephan Olariu, Lorna Stewart,
home Distributional Word Problem for Groups
Pages 1264-1283
Jie Wang,
home Efficient Generation of Minimal Length Addition Chains
Pages 1247-1263
Edward G. Thurber,
home Design of On-Line Algorithms Using Hitting Times
Pages 1232-1246
Prasad Tetali,
home On Rearrangeability of Multirate Clos Networks
Pages 1225-1231
Guo-Hui Lin, Ding-Zhu Du, Xiao-Dong Hu, Guoliang Xue,
home The Height and Size of Random Hash Trees and Random Pebbled Hash Trees
Pages 1215-1224
Luc Devroye,
home New Lower Bounds for Convex Hull Problems in Odd Dimensions
Pages 1198-1214
Jeff Erickson,
home Constructing Approximate Shortest Path Maps in Three Dimensions
Pages 1182-1197
Sariel Har-Peled,
home Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
Pages 1167-1181
D. Aingworth, C. Chekuri, P. Indyk, R. Motwani,
home Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
Pages 1155-1166
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger,