AAAAAA
Results:
1-13
|
Results: 13
Authors:
AGARWAL S
CONDON A
Citation: S. Agarwal et A. Condon, ON APPROXIMATION ALGORITHMS FOR HIERARCHICAL MAX-SAT, Journal of algorithms, 26(1), 1998, pp. 141-165
Authors:
CONDON A
NARAYANAN L
Citation: A. Condon et L. Narayanan, UPPER AND LOWER BOUNDS FOR SELECTION ON THE MESH, Algorithmica, 20(1), 1998, pp. 1-30
Authors:
CONDON A
HELLERSTEIN L
POTTLE S
WIGDERSON A
Citation: A. Condon et al., ON THE POWER OF FINITE AUTOMATA WITH BOTH NONDETERMINISTIC AND PROBABILISTIC STATES, SIAM journal on computing, 27(3), 1998, pp. 739-762
Authors:
BACH E
CONDON A
GLASER E
TANGUAY C
Citation: E. Bach et al., DNA MODELS AND ALGORITHMS FOR NP-COMPLETE PROBLEMS, Journal of computer and system sciences (Print), 57(2), 1998, pp. 172-186
Authors:
CONDON A
FEIGENBAUM J
LUND C
SHOR P
Citation: A. Condon et al., RANDOM DEBATERS AND THE HARDNESS OF APPROXIMATING STOCHASTIC FUNCTIONS, SIAM journal on computing, 26(2), 1997, pp. 369-400
Authors:
LEWANDOWSKI G
CONDON A
BACH E
Citation: G. Lewandowski et al., ASYNCHRONOUS ANALYSIS OF PARALLEL DYNAMIC-PROGRAMMING ALGORITHMS, IEEE transactions on parallel and distributed systems, 7(4), 1996, pp. 425-438
Authors:
LOUI MC
CONDON A
FICH F
FREDERICKSON GN
GOLDBERG AV
JOHNSON DS
MAHANEY S
RAGHAVAN P
SAVAGE J
SELMAN AL
SHMOYS DB
Citation: Mc. Loui et al., STRATEGIC DIRECTIONS IN RESEARCH IN THEORY OF COMPUTING, ACM computing surveys, 28(4), 1996, pp. 575-590
Authors:
CONDON A
FEIGENBAUM J
LUND C
SHOR PW
Citation: A. Condon et al., PROBABILISTICALLY CHECKABLE DEBATE SYSTEMS AND NONAPPROXIMABILITY OF PSPACE-HARD FUNCTIONS, Chicago journal of theoretical computer science, 1(4), 1995, pp. 1-35
Authors:
CONDON A
LADNER R
Citation: A. Condon et R. Ladner, INTERACTIVE PROOF SYSTEMS WITH POLYNOMIALLY BOUNDED STRATEGIES, Journal of computer and system sciences, 50(3), 1995, pp. 506-518
Authors:
CONDON A
HERNEK D
Citation: A. Condon et D. Hernek, RANDOM-WALKS ON COLORED GRAPHS, Random structures & algorithms, 5(2), 1994, pp. 285-303
Authors:
CAI JY
CONDON A
LIPTON RJ
Citation: Jy. Cai et al., PSPACE IS PROVABLE BY 2 PROVERS IN ONE ROUND, Journal of computer and system sciences, 48(1), 1994, pp. 183-193
Authors:
TANGNEY B
CONDON A
CAHILL V
HARRIS N
Citation: B. Tangney et al., REQUIREMENTS FOR PARALLEL PROGRAMMING IN OBJECT-ORIENTED DISTRIBUTED SYSTEMS, Computer journal, 37(6), 1994, pp. 499-508
Authors:
CONDON A
Citation: A. Condon, THE SYPHILITIC LADY REVISITED, A 2ND OPINION + SWIFT THE 'LADYS DRESSING ROOM', The Scriblerian, 25(2), 1993, pp. 221-221
Risultati:
1-13
|