AAAAAA

   
Results: 1-18 |
Results: 18
On weighted vs unweighted versions of combinatorial optimization problems
Authors: Crescenzi, P Silvestri, R Trevisan, L
Citation: P. Crescenzi et al., On weighted vs unweighted versions of combinatorial optimization problems, INF COMPUT, 167(1), 2001, pp. 10-26
Effect of tryptophan depletion on alcohol cue-induced craving in abstinentalcoholic patients
Authors: Petrakis, IL Trevisan, L Boutros, NN Limoncelli, D Cooney, NL Krystal, JH
Citation: Il. Petrakis et al., Effect of tryptophan depletion on alcohol cue-induced craving in abstinentalcoholic patients, ALC CLIN EX, 25(8), 2001, pp. 1151-1155
Pseudorandom generators without the XOR Lemma
Authors: Sudan, M Trevisan, L Vadhan, S
Citation: M. Sudan et al., Pseudorandom generators without the XOR Lemma, J COMPUT SY, 62(2), 2001, pp. 236-266
Contingency management interventions: From research to practice
Authors: Petry, NM Petrakis, I Trevisan, L Wiredu, G Boutros, NN Martin, B Kosten, TR
Citation: Nm. Petry et al., Contingency management interventions: From research to practice, AM J PSYCHI, 158(5), 2001, pp. 694-702
On approximation scheme preserving reducibility and its applications
Authors: Crescenzi, P Trevisan, L
Citation: P. Crescenzi et L. Trevisan, On approximation scheme preserving reducibility and its applications, THEOR C SYS, 33(1), 2000, pp. 1-16
A complexity analysis of bisimilarity for value-passing processes
Authors: Boreale, M Trevisan, L
Citation: M. Boreale et L. Trevisan, A complexity analysis of bisimilarity for value-passing processes, THEOR COMP, 238(1-2), 2000, pp. 313-345
Approximating satisfiable satisfiability problems
Authors: Trevisan, L
Citation: L. Trevisan, Approximating satisfiable satisfiability problems, ALGORITHMIC, 28(1), 2000, pp. 145-172
Parallel approximation algorithms by positive linear programming (vol 21, pg 72, 1998)
Authors: Trevisan, L
Citation: L. Trevisan, Parallel approximation algorithms by positive linear programming (vol 21, pg 72, 1998), ALGORITHMIC, 27(2), 2000, pp. 115-119
Interactive and probabilistic proof-checking
Authors: Trevisan, L
Citation: L. Trevisan, Interactive and probabilistic proof-checking, ANN PUR APP, 104(1-3), 2000, pp. 325-342
The approximability of constraint satisfaction problems
Authors: Khanna, S Sudan, M Trevisan, L Williamson, DP
Citation: S. Khanna et al., The approximability of constraint satisfaction problems, SIAM J COMP, 30(6), 2000, pp. 1863-1920
When Hamming meets Euclid: The approximability of geometric TSP and Steiner tree
Authors: Trevisan, L
Citation: L. Trevisan, When Hamming meets Euclid: The approximability of geometric TSP and Steiner tree, SIAM J COMP, 30(2), 2000, pp. 475-485
Gadgets, approximation, and linear programming
Authors: Trevisan, L Sorkin, GB Sudan, M Williamson, DP
Citation: L. Trevisan et al., Gadgets, approximation, and linear programming, SIAM J COMP, 29(6), 2000, pp. 2074-2097
Max NP-completeness made easy
Authors: Crescenzi, P Trevisan, L
Citation: P. Crescenzi et L. Trevisan, Max NP-completeness made easy, THEOR COMP, 225(1-2), 1999, pp. 65-79
Improved non-approximability results for minimum vertex cover with densityconstraints
Authors: Clementi, AEF Trevisan, L
Citation: Aef. Clementi et L. Trevisan, Improved non-approximability results for minimum vertex cover with densityconstraints, THEOR COMP, 225(1-2), 1999, pp. 113-128
CSF monoamine metabolite and beta endorphin levels in recently detoxified alcoholics and healthy controls: Prediction of alcohol cue-induced craving?
Authors: Petrakis, IL Trevisan, L D'Souza, C Gil, R Krasnicki, S Webb, E Heninger, G Cooney, N Krystal, JH
Citation: Il. Petrakis et al., CSF monoamine metabolite and beta endorphin levels in recently detoxified alcoholics and healthy controls: Prediction of alcohol cue-induced craving?, ALC CLIN EX, 23(8), 1999, pp. 1336-1341
Weak random sources, hitting sets, and BPP simulations
Authors: Andreev, AE Clementi, AEF Rolim, JDP Trevisan, L
Citation: Ae. Andreev et al., Weak random sources, hitting sets, and BPP simulations, SIAM J COMP, 28(6), 1999, pp. 2103-2116
Structure in approximation classes
Authors: Crescenzi, P Kann, V Silvestri, R Trevisan, L
Citation: P. Crescenzi et al., Structure in approximation classes, SIAM J COMP, 28(5), 1999, pp. 1759-1782
A case study of de-randomization methods for combinatorial approximation algorithms
Authors: Rolim, JDP Trevisan, L
Citation: Jdp. Rolim et L. Trevisan, A case study of de-randomization methods for combinatorial approximation algorithms, J COMB OPTI, 2(3), 1998, pp. 219-236
Risultati: 1-18 |