Results: 1-25/151

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

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