AAAAAA

   
Results: 1-18 |
Results: 18

Authors: KHANNA S MOTWANI R SUDAN M VAZIRANI U
Citation: S. Khanna et al., ON SYNTACTIC VERSUS COMPUTATIONAL VIEWS OF APPROXIMABILITY, SIAM journal on computing (Print), 28(1), 1999, pp. 164-191

Authors: SILVERSTEIN C BRIN S MOTWANI R
Citation: C. Silverstein et al., BEYOND MARKET BASKETS - GENERALIZING ASSOCIATION RULES TO DEPENDENCE RULES, DATA MINING AND KNOWLEDGE DISCOVERY, 2(1), 1998, pp. 39-68

Authors: MOTWANI R RAMAKRISHNAN KR
Citation: R. Motwani et Kr. Ramakrishnan, DESIGN OF 2-CHANNEL LINEAR-PHASE ORTHOGONAL CYCLIC FILTERBANKS, IEEE signal processing letters, 5(5), 1998, pp. 121-123

Authors: ARORA S LUND C MOTWANI R SUDAN M SZEGEDY M
Citation: S. Arora et al., PROOF VERIFICATION AND THE HARDNESS OF APPROXIMATION-PROBLEMS, JOURNAL OF THE ACM, 45(3), 1998, pp. 501-555

Authors: KARGER D MOTWANI R SUDAN M
Citation: D. Karger et al., APPROXIMATE GRAPH-COLORING BY SEMIDEFINITE PROGRAMMING, JOURNAL OF THE ACM, 45(2), 1998, pp. 246-265

Authors: MOTWANI R
Citation: R. Motwani, REALIZATION OF MATRICES AND DIRECTED-GRAPHS, Journal of algorithms, 27(1), 1998, pp. 61-74

Authors: KHANNA S MOTWANI R WILSON RH
Citation: S. Khanna et al., ON CERTIFICATES AND LOOKAHEAD IN DYNAMIC GRAPH PROBLEMS, Algorithmica, 21(4), 1998, pp. 377-394

Authors: KAVRAKI LE LATOMBE JC MOTWANI R RAGHAVAN P
Citation: Le. Kavraki et al., RANDOMIZED QUERY-PROCESSING IN ROBOT PATH PLANNING, Journal of computer and system sciences (Print), 57(1), 1998, pp. 50-60

Authors: BARRAQUAND J KAVRAKI L LATOMBE JC MOTWANI R LI TY RAGHAVAN P
Citation: J. Barraquand et al., A RANDOM SAMPLING SCHEME FOR PATH PLANNING, The International journal of robotics research, 16(6), 1997, pp. 759-774

Authors: KARGER D MOTWANI R RAMKUMAR GDS
Citation: D. Karger et al., ON APPROXIMATING THE LONGEST PATH IN A GRAPH, Algorithmica, 18(1), 1997, pp. 82-98

Authors: GUIBAS LJ MOTWANI R RAGHAVAN P
Citation: Lj. Guibas et al., THE ROBOT LOCALIZATION PROBLEM, SIAM journal on computing, 26(4), 1997, pp. 1120-1138

Authors: KARGER DR MOTWANI R
Citation: Dr. Karger et R. Motwani, AN NC ALGORITHM FOR MINIMUM CUTS, SIAM journal on computing, 26(1), 1997, pp. 255-272

Authors: KAMATH A MOTWANI R PALEM K SPIRAKIS P
Citation: A. Kamath et al., TAIL BOUNDS FOR OCCUPANCY AND THE SATISFIABILITY THRESHOLD CONJECTURE, Random structures & algorithms, 7(1), 1995, pp. 59-80

Authors: FEDER T MOTWANI R
Citation: T. Feder et R. Motwani, CLIQUE PARTITIONS, GRAPH COMPRESSION AND SPEEDING-UP ALGORITHMS, Journal of computer and system sciences, 51(2), 1995, pp. 261-272

Authors: MOTWANI R SUDAN M
Citation: R. Motwani et M. Sudan, COMPUTING ROOTS OF GRAPHS IS HARD, Discrete applied mathematics, 54(1), 1994, pp. 81-88

Authors: MOTWANI R PHILLIPS S TORNG E
Citation: R. Motwani et al., NONCLAIRVOYANT SCHEDULING, Theoretical computer science, 130(1), 1994, pp. 17-47

Authors: MOTWANI R NAOR JS NAOR M
Citation: R. Motwani et al., THE PROBABILISTIC METHOD YIELDS DETERMINISTIC PARALLEL ALGORITHMS, Journal of computer and system sciences, 49(3), 1994, pp. 478-516

Authors: MOTWANI R
Citation: R. Motwani, AVERAGE-CASE ANALYSIS OF ALGORITHMS FOR MATCHINGS AND RELATED PROBLEMS, Journal of the Association for Computing Machinery, 41(6), 1994, pp. 1329-1356
Risultati: 1-18 |