The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

SIAM Journal on Computing
( Vol.23 NO.3 / 1994 )
home Communication-Space Tradeoffs for Unrestricted Protocols
Pages 652-661
Paul Beame, Martin Tompa, Peiyuan Yan,
home Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
Pages 633-651
John H. Reif, Sandeep Sen,
home Improved Approximation Algorithms for Shop Scheduling Problems
Pages 617-632
David B. Shmoys, Clifford Stein, Joel Wein,
home Digital Search Trees Again Revisited: The Internal Path Length Perspective
Pages 598-616
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski,
home Linear Time Algorithms and NP-Complete Problems
Pages 573-597
Etienne Grandjean,
home Packet Transmission in a Noisy-Channel Ring Network
Pages 553-562
Victor Pestien, S. Ramakrishnan, Dilip Sarkar,
home Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
Pages 520-552
Jitender S. Deogun, George Steiner,
home Complexity of Network Reliability and Optimal Resource Placement Problems
Pages 510-519
Donald B. Johnson, Larry Raab,
home The Extended Low Hierarchy is an Infinite Hierarchy
Pages 488-509
Ming-Jye Sheu, Timothy J. Long,
home Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
Pages 466-487
Philip Klein, Serge Plotkin, Clifford Stein, Eva Tardos,
home Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima
Pages 449-465
Omer Berkman, Joseph Jaja, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin,
home A New Insight into the Coffman-Graham Algorithm
Pages 662-669
Bertrand Braschi, Denis Trystram,
home Subquadratic Simulations of Balanced Formulae by Branching Programs
Pages 563-572
Jin-Yi Cai, Richard J. Lipton,
home A New Insight into the Coffman-Graham Algorithm
Pages 662-669
Bertrand Braschi, Denis Trystram,
home Communication-Space Tradeoffs for UnrestrictedProtocols
Pages 652-661
Paul Beame, Martin Tompa, Peiyuan Yan,
home Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
Pages 633-651
John H. Reif, Sandeep Sen,
home Improved Approximation Algorithms for Shop Scheduling Problems
Pages 617-632
David B. Shmoys, Clifford Stein, Joel Wein,
home Digital Search Trees Again Revisited: The Internal Path Length Perspective
Pages 598-616
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski,
home Linear Time Algorithms and NP-Complete Problems
Pages 573-597
Etienne Grandjean,
home Packet Transmission in a Noisy-channel Ring Network
Pages 553-562
Victor Pestien, S. Ramakrishnan, Dilip Sarkar,