AAAAAA

   
Results: 1-14 |
Results: 14
MAPPING CLONES WITH A GIVEN ORDERING OR INTERLEAVING
Authors: JIANG T KARP RM
Citation: T. Jiang et Rm. Karp, MAPPING CLONES WITH A GIVEN ORDERING OR INTERLEAVING, Algorithmica, 21(3), 1998, pp. 262-284
NEARLY OPTIMAL COMPETITIVE ONLINE REPLACEMENT POLICIES
Authors: ELYANIV R KARP RM
Citation: R. Elyaniv et Rm. Karp, NEARLY OPTIMAL COMPETITIVE ONLINE REPLACEMENT POLICIES, Mathematics of operations research, 22(4), 1997, pp. 814-839
EFFICIENT PRAM SIMULATION ON A DISTRIBUTED-MEMORY MACHINE
Authors: KARP RM LUBY M HEIDE FMAD
Citation: Rm. Karp et al., EFFICIENT PRAM SIMULATION ON A DISTRIBUTED-MEMORY MACHINE, Algorithmica, 16(4-5), 1996, pp. 517-542
LOGP - A PRACTICE MODEL OF PARALLEL COMPUTATION
Authors: CULLER DE KARP RM PATTERSON D SAHAY A SANTOS EE SCHAUSER KE SUBRAMONIAN R VONEICKEN T
Citation: De. Culler et al., LOGP - A PRACTICE MODEL OF PARALLEL COMPUTATION, Communications of the ACM, 39(11), 1996, pp. 78-85
BOUNDED BRANCHING-PROCESS AND AND OR TREE EVALUATION/
Authors: KARP RM ZHANG YJ
Citation: Rm. Karp et Yj. Zhang, BOUNDED BRANCHING-PROCESS AND AND OR TREE EVALUATION/, Random structures & algorithms, 7(2), 1995, pp. 97-116
AN ALGORITHM FOR ANALYZING PROBED PARTIAL DIGESTION EXPERIMENTS
Authors: KARP RM NEWBERG LA
Citation: Rm. Karp et La. Newberg, AN ALGORITHM FOR ANALYZING PROBED PARTIAL DIGESTION EXPERIMENTS, Computer applications in the biosciences, 11(3), 1995, pp. 229-235
PHYSICAL MAPPING OF CHROMOSOMES - A COMBINATORIAL PROBLEM IN MOLECULAR-BIOLOGY
Authors: ALIZADEH F KARP RM NEWBERG LA WEISSER DK
Citation: F. Alizadeh et al., PHYSICAL MAPPING OF CHROMOSOMES - A COMBINATORIAL PROBLEM IN MOLECULAR-BIOLOGY, Algorithmica, 13(1-2), 1995, pp. 52-76
WHEN IS THE ASSIGNMENT BOUND TIGHT FOR THE ASYMMETRIC TRAVELING-SALESMAN PROBLEM
Authors: FRIEZE A KARP RM REED B
Citation: A. Frieze et al., WHEN IS THE ASSIGNMENT BOUND TIGHT FOR THE ASYMMETRIC TRAVELING-SALESMAN PROBLEM, SIAM journal on computing, 24(3), 1995, pp. 484-493
A GRAPH-THEORETIC GAME, AND ITS APPLICATION TO THE K-SERVER PROBLEM
Authors: ALON N KARP RM PELEG D WEST D
Citation: N. Alon et al., A GRAPH-THEORETIC GAME, AND ITS APPLICATION TO THE K-SERVER PROBLEM, SIAM journal on computing, 24(1), 1995, pp. 78-100
AVERAGE-CASE ANALYSIS OF A HEURISTIC FOR THE ASSIGNMENT PROBLEM
Authors: KARP RM KAN AHGR VOHRA RV
Citation: Rm. Karp et al., AVERAGE-CASE ANALYSIS OF A HEURISTIC FOR THE ASSIGNMENT PROBLEM, Mathematics of operations research, 19(3), 1994, pp. 513-522
CODING TECHNIQUES FOR HANDLING FAILURES IN LARGE DISK ARRAYS
Authors: HELLERSTEIN L GIBSON GA KARP RM KATZ RH PATTERSON DA
Citation: L. Hellerstein et al., CODING TECHNIQUES FOR HANDLING FAILURES IN LARGE DISK ARRAYS, Algorithmica, 12(2-3), 1994, pp. 182-208
PROBABILISTIC RECURRENCE RELATIONS
Authors: KARP RM
Citation: Rm. Karp, PROBABILISTIC RECURRENCE RELATIONS, Journal of the Association for Computing Machinery, 41(6), 1994, pp. 1136-1150
ONLINE ALGORITHMS VERSUS OFF-LINE ALGORITHMS - HOW MUCH IS IT WORTH TO KNOW THE FUTURE
Authors: KARP RM
Citation: Rm. Karp, ONLINE ALGORITHMS VERSUS OFF-LINE ALGORITHMS - HOW MUCH IS IT WORTH TO KNOW THE FUTURE, Mathematical social sciences, 25(3), 1993, pp. 307-307
RANDOMIZED PARALLEL ALGORITHMS FOR BACKTRACK SEARCH AND BRANCH-AND-BOUND COMPUTATION
Authors: KARP RM ZHANG YJ
Citation: Rm. Karp et Yj. Zhang, RANDOMIZED PARALLEL ALGORITHMS FOR BACKTRACK SEARCH AND BRANCH-AND-BOUND COMPUTATION, Journal of the Association for Computing Machinery, 40(3), 1993, pp. 765-789
Risultati: 1-14 |