Journals in DBLP
Guy W. Cherry Integration in Finite Terms with Special Functions: The Logarithmic Integral. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:1-21 [Journal ] Kurt Mehlhorn , Athanasios K. Tsakalidis An Amortized Analysis of Insertions into AVL-Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:22-33 [Journal ] Joseph O'Rourke The Signature of a Plane Curve. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:34-51 [Journal ] Daniel Dominic Sleator , Robert Endre Tarjan Self-Adjusting Heaps. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:52-69 [Journal ] Joost Engelfriet The complexity of Languages Generated by Attribute Grammars. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:70-86 [Journal ] Stephen Cook , Cynthia Dwork , Rüdiger Reischuk Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:87-97 [Journal ] Alberto Apostolico , Raffaele Giancarlo The Boyer-Moore-Galil String Searching Strategies Revisited. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:98-105 [Journal ] Friedhelm Meyer auf der Heide Efficient Simulations Among Several Models of Parallel Computers. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:106-119 [Journal ] Zvi Galil , Silvio Micali , Harold N. Gabow An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:120-130 [Journal ] Francis Y. L. Chin , K. V. S. Ramarao Optimal Termination Protocols for Network Partitioning. [Citation Graph (2, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:131-144 [Journal ] Mike Shub , Steve Smale Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:145-161 [Journal ] Brenda S. Baker A Provably Good Algorithm for the Two Module Routing Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:162-188 [Journal ] Don Coppersmith , Maria M. Klawe , Nicholas Pippenger Alphabetic Minimax Trees of Degree at Most t. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:189-192 [Journal ] Micha Sharir , Amir Schorr On Shortest Paths in Polyhedral Spaces. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:193-215 [Journal ] Tuvi Etzion , Abraham Lempel An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:216-221 [Journal ] Donald K. Friesen , Michael A. Langston Variable Sized Bin Packing. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:222-230 [Journal ] John H. Reif Logarithmic Depth Circuits for Algebraic Functions. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:231-242 [Journal ] Stanley Cabay , Dong-Koo Choi Algebraic Computations of Scaled Padé Fractions. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:243-270 [Journal ] Herbert Edelsbrunner , Emo Welzl Constructing Belts in Two-Dimensional Arrangements with Applications. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:271-284 [Journal ] Leonid A. Levin Average Case Complete Problems. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:285-286 [Journal ] David G. Kirkpatrick , Raimund Seidel The Ultimate Planar Convex Hull Algorithm? [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:287-299 [Journal ] Bernard Chazelle , Robert L. (Scot) Drysdale III , D. T. Lee Computing the Largest Empty Rectangle. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:300-315 [Journal ]