Results: 1-25 | 26-50

Table of contents of journal: *SIAM journal on computing

Results: 1-25/50

Authors: JIANG T RAVIKUMAR B
Citation: T. Jiang et B. Ravikumar, MINIMAL NFA PROBLEMS ARE HARD, SIAM journal on computing, 22(6), 1993, pp. 1117-1141

Authors: CAI JZ HAN XF TARJAN RE
Citation: Jz. Cai et al., AN O(M LOG N)-TIME ALGORITHM FOR THE MAXIMAL PLANAR SUBGRAPH PROBLEM, SIAM journal on computing, 22(6), 1993, pp. 1142-1162

Authors: GOLDREICH O KRAWCZYK H LUBY M
Citation: O. Goldreich et al., ON THE EXISTENCE OF PSEUDORANDOM GENERATORS, SIAM journal on computing, 22(6), 1993, pp. 1163-1175

Authors: SZPANKOWSKI W
Citation: W. Szpankowski, A GENERALIZED SUFFIX TREE AND ITS (UN)EXPECTED ASYMPTOTIC BEHAVIORS, SIAM journal on computing, 22(6), 1993, pp. 1176-1198

Authors: KARGER DR KOLLER D PHILLIPS SJ
Citation: Dr. Karger et al., FINDING THE HIDDEN PATH - TIME-BOUNDS FOR ALL-PAIRS SHORTEST PATHS, SIAM journal on computing, 22(6), 1993, pp. 1199-1217

Authors: HE X
Citation: X. He, ON FINDING THE RECTANGULAR DUALS OF PLANAR TRIANGULAR GRAPHS, SIAM journal on computing, 22(6), 1993, pp. 1218-1226

Authors: PAN V REIF J
Citation: V. Pan et J. Reif, FAST AND EFFICIENT PARALLEL SOLUTION OF SPARSE LINEAR-SYSTEMS, SIAM journal on computing, 22(6), 1993, pp. 1227-1250

Authors: RHEE WT TALAGRAND M
Citation: Wt. Rhee et M. Talagrand, ONLINE BIN PACKING OF ITEMS OF RANDOM SIZES .2., SIAM journal on computing, 22(6), 1993, pp. 1251-1256

Authors: GAVALDA R WATANABE O
Citation: R. Gavalda et O. Watanabe, ON THE COMPUTATIONAL-COMPLEXITY OF SMALL DESCRIPTIONS, SIAM journal on computing, 22(6), 1993, pp. 1257-1275

Authors: KARPINSKI M WERTHER T
Citation: M. Karpinski et T. Werther, VC DIMENSION AND UNIFORM LEARNABILITY OF SPARSE POLYNOMIALS AND RATIONAL FUNCTIONS, SIAM journal on computing, 22(6), 1993, pp. 1276-1285

Authors: CHAZELLE B EDELSBRUNNER H GUIBAS L SHARIR M SNOEYINK J
Citation: B. Chazelle et al., COMPUTING A FACE IN AN ARRANGEMENT OF LINE SEGMENTS AND RELATED PROBLEMS, SIAM journal on computing, 22(6), 1993, pp. 1286-1302

Authors: CHEN B
Citation: B. Chen, A BETTER HEURISTIC FOR PREEMPTIVE PARALLEL MACHINE SCHEDULING WITH BATCH SETUP TIMES, SIAM journal on computing, 22(6), 1993, pp. 1303-1318

Authors: CHU JH KNOTT GD
Citation: Jh. Chu et Gd. Knott, A NEW METHOD FOR COMPUTING PAGE-FAULT RATES, SIAM journal on computing, 22(6), 1993, pp. 1319-1330

Authors: KUSHILEVITZ E MANSOUR Y
Citation: E. Kushilevitz et Y. Mansour, LEARNING DECISION TREES USING THE FOURIER SPECTRUM, SIAM journal on computing, 22(6), 1993, pp. 1331-1348

Authors: COLE R
Citation: R. Cole, PARALLEL MERGE SORT (VOL 4, PG 770, 1988), SIAM journal on computing, 22(6), 1993, pp. 1349-1349

Authors: HSU TS RAMACHANDRAN V
Citation: Ts. Hsu et V. Ramachandran, FINDING A SMALLEST AUGMENTATION TO BICONNECT A GRAPH, SIAM journal on computing, 22(5), 1993, pp. 889-912

Authors: HALSTENBERG B REISCHUK R
Citation: B. Halstenberg et R. Reischuk, DIFFERENT MODES OF COMMUNICATION, SIAM journal on computing, 22(5), 1993, pp. 913-934

Authors: MANBER U MYERS G
Citation: U. Manber et G. Myers, SUFFIX ARRAYS - A NEW METHOD FOR ONLINE STRING SEARCHES, SIAM journal on computing, 22(5), 1993, pp. 935-948

Authors: BLASS A GUREVICH Y
Citation: A. Blass et Y. Gurevich, RANDOMIZING REDUCTIONS OF SEARCH PROBLEMS, SIAM journal on computing, 22(5), 1993, pp. 949-975

Authors: LOU RD SARRAFZADEH M
Citation: Rd. Lou et M. Sarrafzadeh, AN OPTIMAL ALGORITHM FOR THE MAXIMUM 3-CHAIN PROBLEM, SIAM journal on computing, 22(5), 1993, pp. 976-993

Authors: FEIGENBAUM J FORTNOW L
Citation: J. Feigenbaum et L. Fortnow, RANDOM-SELF-REDUCIBILITY OF COMPLETE-SETS, SIAM journal on computing, 22(5), 1993, pp. 994-1005

Authors: GOLDMAN SA RIVEST RL SCHAPIRE RE
Citation: Sa. Goldman et al., LEARNING BINARY RELATIONS AND TOTAL ORDERS, SIAM journal on computing, 22(5), 1993, pp. 1006-1034

Authors: FORMANN M HAGERUP T HARALAMBIDES J KAUFMANN M LEIGHTON FT SYMVONIS A WELZL E WOEGINGER G
Citation: M. Formann et al., DRAWING GRAPHS IN THE PLANE WITH HIGH-RESOLUTION, SIAM journal on computing, 22(5), 1993, pp. 1035-1052

Authors: BOLLOBAS B SIMON I
Citation: B. Bollobas et I. Simon, PROBABILISTIC ANALYSIS OF DISJOINT SET UNION ALGORITHMS, SIAM journal on computing, 22(5), 1993, pp. 1053-1074

Authors: LUTZ JH
Citation: Jh. Lutz, A PSEUDORANDOM ORACLE CHARACTERIZATION OF BPP, SIAM journal on computing, 22(5), 1993, pp. 1075-1086
Risultati: 1-25 | 26-50