AAAAAA

   
Results: 1-18 |
Results: 18
ON THE COMPLEXITY OF PROTEIN-FOLDING
Authors: CRESCENZI P GOLDMAN D PAPADIMITRIOU C PICCOLBONI A YANNAKAKIS M
Citation: P. Crescenzi et al., ON THE COMPLEXITY OF PROTEIN-FOLDING, Journal of computational biology, 5(3), 1998, pp. 423-465
MARKOV DECISION-PROCESSES AND REGULAR EVENTS
Authors: COURCOUBETIS C YANNAKAKIS M
Citation: C. Courcoubetis et M. Yannakakis, MARKOV DECISION-PROCESSES AND REGULAR EVENTS, IEEE transactions on automatic control, 43(10), 1998, pp. 1399-1418
PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR INTEGRAL FLOW AND MULTICUT IN TREES
Authors: GARG N VAZIRANI VV YANNAKAKIS M
Citation: N. Garg et al., PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR INTEGRAL FLOW AND MULTICUT IN TREES, Algorithmica, 18(1), 1997, pp. 3-20
TIE-BREAKING SEMANTICS AND STRUCTURAL TOTALITY
Authors: PAPADIMITRIOU CH YANNAKAKIS M
Citation: Ch. Papadimitriou et M. Yannakakis, TIE-BREAKING SEMANTICS AND STRUCTURAL TOTALITY, Journal of computer and system sciences, 54(1), 1997, pp. 48-60
APPROXIMATE MAX-FLOW MIN-(MULTI)CUT THEOREMS AND THEIR APPLICATIONS
Authors: GARG N VAZIRANI VV YANNAKAKIS M
Citation: N. Garg et al., APPROXIMATE MAX-FLOW MIN-(MULTI)CUT THEOREMS AND THEIR APPLICATIONS, SIAM journal on computing, 25(2), 1996, pp. 235-251
ON LIMITED NONDETERMINISM AND THE COMPLEXITY OF THE V-C DIMENSION
Authors: PAPADIMITRIOU CH YANNAKAKIS M
Citation: Ch. Papadimitriou et M. Yannakakis, ON LIMITED NONDETERMINISM AND THE COMPLEXITY OF THE V-C DIMENSION, Journal of computer and system sciences, 53(2), 1996, pp. 161-170
PRINCIPLES AND METHODS OF TESTING FINITE-STATE MACHINES - A SURVEY
Authors: LEE D YANNAKAKIS M
Citation: D. Lee et M. Yannakakis, PRINCIPLES AND METHODS OF TESTING FINITE-STATE MACHINES - A SURVEY, Proceedings of the IEEE, 84(8), 1996, pp. 1090-1123
TIMING VERIFICATION BY SUCCESSIVE APPROXIMATION
Authors: ALUR R ITAI A KURSHAN RP YANNAKAKIS M
Citation: R. Alur et al., TIMING VERIFICATION BY SUCCESSIVE APPROXIMATION, Information and computation, 118(1), 1995, pp. 142-157
ON DATALOG VS POLYNOMIAL-TIME
Authors: AFRATI F COSMADAKIS SS YANNAKAKIS M
Citation: F. Afrati et al., ON DATALOG VS POLYNOMIAL-TIME, Journal of computer and system sciences, 51(2), 1995, pp. 177-196
TESTING FINITE-STATE MACHINES - FAULT-DETECTION
Authors: YANNAKAKIS M LEE D
Citation: M. Yannakakis et D. Lee, TESTING FINITE-STATE MACHINES - FAULT-DETECTION, Journal of computer and system sciences, 50(2), 1995, pp. 209-227
THE COMPLEXITY OF PROBABILISTIC VERIFICATION
Authors: COURCOUBETIS C YANNAKAKIS M
Citation: C. Courcoubetis et M. Yannakakis, THE COMPLEXITY OF PROBABILISTIC VERIFICATION, Journal of the Association for Computing Machinery, 42(4), 1995, pp. 857-907
ON THE APPROXIMATION OF MAXIMUM SATISFIABILITY
Authors: YANNAKAKIS M
Citation: M. Yannakakis, ON THE APPROXIMATION OF MAXIMUM SATISFIABILITY, Journal of algorithms, 17(3), 1994, pp. 475-502
THE COMPLEXITY OF MULTITERMINAL CUTS
Authors: DAHLHAUS E JOHNSON DS PAPADIMITRIOOU CH SEYMOUR PD YANNAKAKIS M
Citation: E. Dahlhaus et al., THE COMPLEXITY OF MULTITERMINAL CUTS, SIAM journal on computing, 23(4), 1994, pp. 864-894
UNTITLED
Authors: YANNAKAKIS M
Citation: M. Yannakakis, UNTITLED, Journal of computer and system sciences, 48(3), 1994, pp. 383-383
TESTING FINITE-STATE MACHINES - STATE IDENTIFICATION AND VERIFICATION
Authors: LEE D YANNAKAKIS M
Citation: D. Lee et M. Yannakakis, TESTING FINITE-STATE MACHINES - STATE IDENTIFICATION AND VERIFICATION, I.E.E.E. transactions on computers, 43(3), 1994, pp. 306-320
ON THE HARDNESS OF APPROXIMATING MINIMIZATION PROBLEMS
Authors: LUND C YANNAKAKIS M
Citation: C. Lund et M. Yannakakis, ON THE HARDNESS OF APPROXIMATING MINIMIZATION PROBLEMS, Journal of the Association for Computing Machinery, 41(5), 1994, pp. 960-981
LINEAR-APPROXIMATION OF SHORTEST SUPERSTRINGS
Authors: BLUM A JIANG T LI M TROMP J YANNAKAKIS M
Citation: A. Blum et al., LINEAR-APPROXIMATION OF SHORTEST SUPERSTRINGS, Journal of the Association for Computing Machinery, 41(4), 1994, pp. 630-647
COMPUTING THE THROUGHPUT OF A NETWORK WITH DEDICATED LINES
Authors: PAPADIMITRIOU CH SERAFINI P YANNAKAKIS M
Citation: Ch. Papadimitriou et al., COMPUTING THE THROUGHPUT OF A NETWORK WITH DEDICATED LINES, Discrete applied mathematics, 42(2-3), 1993, pp. 271-278
Risultati: 1-18 |