Results: 1-25 | 26-50 | 51-75 | 76-100 | >>

Table of contents of journal: *SIAM journal on computing

Results: 51-75/773

Authors: Mirkowska, Z Salwicki, A Srebrny, M Tarlecki, A
Citation: Z. Mirkowska et al., First-order specifications of programmable data types, SIAM J COMP, 30(6), 2000, pp. 2084-2096

Authors: Cole, R Colton, MF Hariharan, R Przytycka, T Thorup, M
Citation: R. Cole et al., An O(n log n) algorithm for the maximum agreement subtree problem for binary trees, SIAM J COMP, 30(5), 2000, pp. 1385-1404

Authors: Milidiu, RL Laber, ES
Citation: Rl. Milidiu et Es. Laber, The warm-up algorithm: A lagrangian construction of length restricted Huffman codes, SIAM J COMP, 30(5), 2000, pp. 1405-1426

Authors: Peleg, D Rubinovich, V
Citation: D. Peleg et V. Rubinovich, A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction, SIAM J COMP, 30(5), 2000, pp. 1427-1442

Authors: Dyer, ME Sen, S
Citation: Me. Dyer et S. Sen, Fast and optimal parallel multidimensional search in prams with applications to linear programming and related problems, SIAM J COMP, 30(5), 2000, pp. 1443-1461

Authors: Bonet, ML Esteban, JL Galesi, N Johannsen, J
Citation: Ml. Bonet et al., On the relative complexity of resolution refinements and cutting planes proof systems, SIAM J COMP, 30(5), 2000, pp. 1462-1484

Authors: Buhrman, H Torenvliet, L
Citation: H. Buhrman et L. Torenvliet, Randomness is hard, SIAM J COMP, 30(5), 2000, pp. 1485-1501

Authors: Buchsbaum, AL Giancarlo, R Westbrook, JR
Citation: Al. Buchsbaum et al., On the determinization of weighted finite automata, SIAM J COMP, 30(5), 2000, pp. 1502-1531

Authors: Gambosi, G Postiglione, A Talamo, M
Citation: G. Gambosi et al., Algorithms for the relaxed online bin-packing model, SIAM J COMP, 30(5), 2000, pp. 1532-1551

Authors: Andersson, A Hagerup, T Hastad, J Petersson, O
Citation: A. Andersson et al., Tight bounds for searching a sorted array of strings, SIAM J COMP, 30(5), 2000, pp. 1552-1578

Authors: Brazil, M Thomas, DA Weng, JF
Citation: M. Brazil et al., Minimum networks in uniform orientation metrics, SIAM J COMP, 30(5), 2000, pp. 1579-1593

Authors: Andrews, M Fernandez, A Harchol-Balter, M Leighton, T Zhang, L
Citation: M. Andrews et al., General dynamic routing with per-packet delay guarantees of O(distance+1/session rate), SIAM J COMP, 30(5), 2000, pp. 1594-1623

Authors: Blum, A Karloff, H Rabani, Y Saks, M
Citation: A. Blum et al., A decomposition theorem for task systems and bounds for randomized server problems, SIAM J COMP, 30(5), 2000, pp. 1624-1661

Authors: Brandstadt, A Dragan, FF Kohler, E
Citation: A. Brandstadt et al., Linear time algorithms or hamiltonian problems on (claw, net)-free graphs, SIAM J COMP, 30(5), 2000, pp. 1662-1677

Authors: Devroye, L Jabbour, J Zamora-Cura, C
Citation: L. Devroye et al., Squarish k-d trees, SIAM J COMP, 30(5), 2000, pp. 1678-1700

Authors: Gaujal, B Jean-Marie, A Mairesse, J
Citation: B. Gaujal et al., Computations of uniform recurrence equations using minimal memory size, SIAM J COMP, 30(5), 2000, pp. 1701-1738

Authors: Czygrinow, A Rodl, V
Citation: A. Czygrinow et V. Rodl, An algorithmic regularity lemma for hypergraphs, SIAM J COMP, 30(4), 2000, pp. 1041-1066

Authors: Natanzon, A Shamir, R Sharan, R
Citation: A. Natanzon et al., A polynomial approximation algorithm for the minimum fill-in problem, SIAM J COMP, 30(4), 2000, pp. 1067-1079

Authors: Pan, VY
Citation: Vy. Pan, Parallel complexity of computations with general and Toeplitz-like matrices filled with integers and extensions, SIAM J COMP, 30(4), 2000, pp. 1080-1125

Authors: Scheideler, C Vocking, B
Citation: C. Scheideler et B. Vocking, From static to dynamic routing: Efficient transformations of store-and-forward protocols, SIAM J COMP, 30(4), 2000, pp. 1126-1155

Authors: Ruppert, E
Citation: E. Ruppert, Determining consensus numbers, SIAM J COMP, 30(4), 2000, pp. 1156-1168

Authors: Herzberg, A Kutten, S
Citation: A. Herzberg et S. Kutten, Early detection of message forwarding faults, SIAM J COMP, 30(4), 2000, pp. 1169-1196

Authors: Lutz, JH Zhao, Y
Citation: Jh. Lutz et Y. Zhao, The density of weakly complete problems under adaptive reductions, SIAM J COMP, 30(4), 2000, pp. 1197-1210

Authors: Bassino, F Beal, MP Perrin, D
Citation: F. Bassino et al., A finite state version of the Kraft-McMillan theorem, SIAM J COMP, 30(4), 2000, pp. 1211-1230

Authors: Even, G Naor, JS Zosin, L
Citation: G. Even et al., An 8-approximation algorithm for the subset feedback vertex set problem, SIAM J COMP, 30(4), 2000, pp. 1231-1252
Risultati: 1-25 | 26-50 | 51-75 | 76-100 | >>