The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

SIAM Journal on Computing
( Vol.28 NO.2 / 1999 )
home The Queue-Read Queue-Write Pram Model: Accounting for Contention in Parallel Algorithms
Pages 733-769
Phillip B. Gibbons, Yossi Matias, Vijaya Ramchandran,
home Asymptotically Optimal Election on Weighted Rings
Pages 720-732
Lisa Higham, Teresa Przytycka,
home Stochastic Contention Resolution with Short Delays
Pages 709-719
Prabhakar Raghavan, Eli Upfal,
home Exact Learning of Discretized Geometric Concepts
Pages 674-699
Nader H. Bshouth, Paul W. Goldberg, Sally A. Goldman, H. David Mathias,
home A Polynomial Time Complexity Bound for Computations on Curves
Pages 704-708
P. G. Walsh,
home Fast Exponentiation Using Data Compression
Pages 700-703
Yacov Yacobi,
home Finding the $k$ Shortest Paths
Pages 652-673
David Eppstein,
home Dynamic Trees and Dynamic Point Location
Pages 612-636
Michael T. Goodrich, Roberto Tamassia,
home Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
Pages 574-611
Zoran Ivkovic, Errol L. Lloyd,
home Optimal Construction of Edge-Disjoint Paths in Random Graphs
Pages 541-573
Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal,
home Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
Pages 525-540
Sridhar Rajagopalan, Vijay V. Vazirani,
home Optimal Broadcast with Partial Knowledge
Pages 511-524
Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg,
home Reconstructing Algebraic Functions Form Mixed Data
Pages 487-510
Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan,
home Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
Pages 471-486
Francis Chin, Cao An Wang,
home On Multirate Rearrangeable Clos Networks
Pages 463-470
D.Z. Du, B. Gao, F.K. Hwang, J.H. Kim,
home Competitive Algorithms for Layered Graph Traversal
Pages 447-462
Amos Fiat, Dean P. Foster, Howard Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan,
home Query Order
Pages 637-651
Lane A. Hemaspaandra, Harald Hempel, Gred Wechsung,
home Average-case Lower Bounds for Noisy Boolean Decision Trees
Pages 433-446
William Evans, Nicholas Pippenger,
home Genericity, Randomness, and Polynomial-Time Approximations
Pages 394-408
Yongge Wang,
home Universal Limit Laws for Depths in Random Trees
Pages 409-432
Luc Devroye,