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

Table of contents of journal: *SIAM journal on computing

Results: 26-50/773

Authors: Cucker, F Grigoriev, D
Citation: F. Cucker et D. Grigoriev, There are no sparse NPW-hard sets, SIAM J COMP, 31(1), 2001, pp. 193-198

Authors: Kucera, A Slaman, TA
Citation: A. Kucera et Ta. Slaman, Randomness and recursive enumerability, SIAM J COMP, 31(1), 2001, pp. 199-211

Authors: Bouchitte, V Todinca, I
Citation: V. Bouchitte et I. Todinca, Treewidth and minimum fill-in: Grouping the minimal separators, SIAM J COMP, 31(1), 2001, pp. 212-232

Authors: Boyar, J Larsen, KS Nielsen, MN
Citation: J. Boyar et al., The accommodating function: A generalization of the competitive ratio, SIAM J COMP, 31(1), 2001, pp. 233-258

Authors: Sawada, J
Citation: J. Sawada, Generating bracelets in constant amortized time, SIAM J COMP, 31(1), 2001, pp. 259-268

Authors: Eiter, T Ibaraki, T Makino, K
Citation: T. Eiter et al., Disjunctions of Horn theories and their cores, SIAM J COMP, 31(1), 2001, pp. 269-288

Authors: Hell, P Shamir, R Sharan, R
Citation: P. Hell et al., A fully dynamic algorithm for recognizing and representing proper intervalgraphs, SIAM J COMP, 31(1), 2001, pp. 289-305

Authors: Csuros, M Kao, MY
Citation: M. Csuros et My. Kao, Provably fast and accurate recovery of evolutionary trees through harmonicgreedy triplets, SIAM J COMP, 31(1), 2001, pp. 306-322

Authors: Chen, JC
Citation: Jc. Chen, Proportion extend sort, SIAM J COMP, 31(1), 2001, pp. 323-330

Authors: Agarwal, PK Wang, HY
Citation: Pk. Agarwal et Hy. Wang, Approximation algorithms for curvature-constrained shortest paths, SIAM J COMP, 30(6), 2000, pp. 1739-1772

Authors: Shahrokhi, F Sykora, O Szekely, LA Vrto, I
Citation: F. Shahrokhi et al., On bipartite drawings and the linear arrangement problem, SIAM J COMP, 30(6), 2000, pp. 1773-1789

Authors: Frieze, AM
Citation: Am. Frieze, Edge-disjoint paths in expander graphs, SIAM J COMP, 30(6), 2000, pp. 1790-1801

Authors: Berkman, O Parnas, M Sgall, J
Citation: O. Berkman et al., Efficient dynamic traitor tracing, SIAM J COMP, 30(6), 2000, pp. 1802-1828

Authors: Buhrman, H Cleve, R Van Dam, W
Citation: H. Buhrman et al., Quantum entanglement and communication complexity, SIAM J COMP, 30(6), 2000, pp. 1829-1841

Authors: Alon, N Krivelevich, M Newman, I Szegedy, M
Citation: N. Alon et al., Regular languages are testable with a constant number of queries, SIAM J COMP, 30(6), 2000, pp. 1842-1862

Authors: Khanna, S Sudan, M Trevisan, L Williamson, DP
Citation: S. Khanna et al., The approximability of constraint satisfaction problems, SIAM J COMP, 30(6), 2000, pp. 1863-1920

Authors: Meleis, WM
Citation: Wm. Meleis, Dual-issue scheduling or binary trees with spills and pipelined loads, SIAM J COMP, 30(6), 2000, pp. 1921-1941

Authors: Jiang, T Kearney, P Li, M
Citation: T. Jiang et al., A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application, SIAM J COMP, 30(6), 2000, pp. 1942-1961

Authors: Dyer, M Goldberg, LA Greenhill, C Jerrum, M Mitzenmacher, M
Citation: M. Dyer et al., An extension of path coupling and its application to the Glauber dynamics for graph colorings, SIAM J COMP, 30(6), 2000, pp. 1962-1975

Authors: Mereghetti, C Pighizzini, G
Citation: C. Mereghetti et G. Pighizzini, Optimal simulations between unary automata, SIAM J COMP, 30(6), 2000, pp. 1976-1992

Authors: Cai, MC Deng, XT Zang, WN
Citation: Mc. Cai et al., An approximation algorithm or feedback vertex sets in tournaments, SIAM J COMP, 30(6), 2000, pp. 1993-2007

Authors: Micciancio, D
Citation: D. Micciancio, The shortest vector in a lattice is hard to approximate to within some constant, SIAM J COMP, 30(6), 2000, pp. 2008-2035

Authors: Rutcor, B Gurvich, V Khachiyan, L Makino, K
Citation: B. Rutcor et al., Dual-bounded generating problems: Partial and multiple transversals of a hypergraph, SIAM J COMP, 30(6), 2000, pp. 2036-2050

Authors: Srinivasan, A Teo, CP
Citation: A. Srinivasan et Cp. Teo, A constant-factor approximation algorithm for packet routing and balancinglocal vs. global criteria, SIAM J COMP, 30(6), 2000, pp. 2051-2068

Authors: Chu, CB La, R
Citation: Cb. Chu et R. La, Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms, SIAM J COMP, 30(6), 2000, pp. 2069-2083
Risultati: 1-25 | 26-50 | 51-75 | 76-100 | >>