Results: 1-25 | 26-50 | 51-75 | 76-79

Table of contents of journal: *SIAM journal on computing

Results: 1-25/79

Authors: DEVROYE L ROBSON JM
Citation: L. Devroye et Jm. Robson, ON THE GENERATION OF RANDOM BINARY SEARCH-TREES, SIAM journal on computing, 24(6), 1995, pp. 1141-1156

Authors: DEVROYE L REED B
Citation: L. Devroye et B. Reed, ON THE VARIANCE OF THE HEIGHT OF RANDOM BINARY SEARCH-TREES, SIAM journal on computing, 24(6), 1995, pp. 1157-1162

Authors: LARMORE LL PRZYTYCKA TM
Citation: Ll. Larmore et Tm. Przytycka, CONSTRUCTING HUFFMAN TREES IN PARALLEL, SIAM journal on computing, 24(6), 1995, pp. 1163-1169

Authors: LUTZ JH
Citation: Jh. Lutz, WEAKLY HARD PROBLEMS, SIAM journal on computing, 24(6), 1995, pp. 1170-1189

Authors: BUCHSBAUM AL SUNDAR R TARJAN RE
Citation: Al. Buchsbaum et al., DATA-STRUCTURAL BOOTSTRAPPING, LINEAR PATH COMPRESSION, AND CATENABLEHEAP-ORDERED DOUBLE-ENDED QUEUES, SIAM journal on computing, 24(6), 1995, pp. 1190-1206

Authors: SEKAR RC RAMESH R RAMAKRISHNAN IV
Citation: Rc. Sekar et al., ADAPTIVE PATTERN-MATCHING, SIAM journal on computing, 24(6), 1995, pp. 1207-1234

Authors: MENDELZON AO WOOD PT
Citation: Ao. Mendelzon et Pt. Wood, FINDING REGULAR SIMPLE PATHS IN GRAPH DATABASES, SIAM journal on computing, 24(6), 1995, pp. 1235-1258

Authors: NAOR M STOCKMEYER L
Citation: M. Naor et L. Stockmeyer, WHAT CAN BE COMPUTED LOCALLY, SIAM journal on computing, 24(6), 1995, pp. 1259-1277

Authors: EITER T GOTTLOB G
Citation: T. Eiter et G. Gottlob, IDENTIFYING THE MINIMAL TRANSVERSALS OF A HYPERGRAPH AND RELATED PROBLEMS, SIAM journal on computing, 24(6), 1995, pp. 1278-1304

Authors: KALORKOTI K
Citation: K. Kalorkoti, ON THE REUSE OF ADDITIONS IN MATRIX MULTIPLICATION, SIAM journal on computing, 24(6), 1995, pp. 1305-1312

Authors: SHMOYS DB WEIN J WILLIAMSON DP
Citation: Db. Shmoys et al., SCHEDULING PARALLEL MACHINES ONLINE, SIAM journal on computing, 24(6), 1995, pp. 1313-1331

Authors: HAN XF KELSEN P RAMACHANDRAN V TARJAN R
Citation: Xf. Han et al., COMPUTING MINIMAL SPANNING SUBGRAPHS IN LINEAR-TIME, SIAM journal on computing, 24(6), 1995, pp. 1332-1358

Authors: CHOU AW KO KI
Citation: Aw. Chou et Ki. Ko, COMPUTATIONAL-COMPLEXITY OF 2-DIMENSIONAL REGIONS, SIAM journal on computing, 24(5), 1995, pp. 923-947

Authors: GIESBRECHT M
Citation: M. Giesbrecht, NEARLY OPTIMAL-ALGORITHMS FOR CANONICAL MATRIX-FORMS, SIAM journal on computing, 24(5), 1995, pp. 948-969

Authors: COHEN RF DIBATTISTA G TAMASSIA R TOLLIS IG
Citation: Rf. Cohen et al., DYNAMIC GRAPH DRAWINGS - TREES, SERIES-PARALLEL DIGRAPHS, AND PLANAR ST-DIGRAPHS, SIAM journal on computing, 24(5), 1995, pp. 970-1001

Authors: MILLER GL NAOR JS
Citation: Gl. Miller et Js. Naor, FLOW IN PLANAR GRAPHS WITH MULTIPLE SOURCES AND SINKS, SIAM journal on computing, 24(5), 1995, pp. 1002-1017

Authors: GARTNER B
Citation: B. Gartner, A SUBEXPONENTIAL ALGORITHM FOR ABSTRACT OPTIMIZATION PROBLEMS, SIAM journal on computing, 24(5), 1995, pp. 1018-1035

Authors: CHARI S ROHATGI P SRINIVASAN A
Citation: S. Chari et al., RANDOMNESS-OPTIMAL UNIQUE ELEMENT ISOLATION WITH APPLICATIONS TO PERFECT MATCHING AND RELATED PROBLEMS, SIAM journal on computing, 24(5), 1995, pp. 1036-1050

Authors: HOFTING F WANKE E
Citation: F. Hofting et E. Wanke, MINIMUM-COST PATHS IN PERIODIC GRAPHS, SIAM journal on computing, 24(5), 1995, pp. 1051-1067

Authors: OGIHARA M
Citation: M. Ogihara, POLYNOMIAL-TIME MEMBERSHIP COMPARABLE SETS, SIAM journal on computing, 24(5), 1995, pp. 1068-1081

Authors: FU B
Citation: B. Fu, WITH QUASI-LINEAR QUERIES EXP IS NOT POLYNOMIAL-TIME TURING REDUCIBLETO SPARSE SETS, SIAM journal on computing, 24(5), 1995, pp. 1082-1090

Authors: ANDERSSON A OTTMANN T
Citation: A. Andersson et T. Ottmann, NEW TIGHT BOUNDS ON UNIQUELY REPRESENTED DICTIONARIES, SIAM journal on computing, 24(5), 1995, pp. 1091-1103

Authors: HAN CC LIN KJ LIU JWS
Citation: Cc. Han et al., SCHEDULING JOBS WITH TEMPORAL DISTANCE CONSTRAINTS, SIAM journal on computing, 24(5), 1995, pp. 1104-1121

Authors: JIANG T LI M
Citation: T. Jiang et M. Li, ON THE APPROXIMATION OF SHORTEST COMMON SUPERSEQUENCES AND LONGEST COMMON SUBSEQUENCES, SIAM journal on computing, 24(5), 1995, pp. 1122-1139

Authors: BUHRMAN H HEMASPAANDRA E LONGPRE L
Citation: H. Buhrman et al., SPARSE REDUCES CONJUNCTIVELY TO TALLY, SIAM journal on computing, 24(4), 1995, pp. 673-681
Risultati: 1-25 | 26-50 | 51-75 | 76-79