AAAAAA

   
Results: 1-15 |
Results: 15
INCREMENTAL RECOMPILATION OF KNOWLEDGE
Authors: GOGIC G PAPADIMITRIOU CH SIDERI M
Citation: G. Gogic et al., INCREMENTAL RECOMPILATION OF KNOWLEDGE, The journal of artificial intelligence research, 8, 1998, pp. 23-37
REFLECTIVE RELATIONAL MACHINES
Authors: ABITEBOUL S PAPADIMITRIOU CH VIANU V
Citation: S. Abiteboul et al., REFLECTIVE RELATIONAL MACHINES, Information and computation, 143(2), 1998, pp. 110-136
ON KERNELS, DEFAULTS AND EVEN GRAPHS
Authors: DIMOPOULOS Y MAGIROU V PAPADIMITRIOU CH
Citation: Y. Dimopoulos et al., ON KERNELS, DEFAULTS AND EVEN GRAPHS, Annals of mathematics and artificial intelligence, 20(1-4), 1997, pp. 1-12
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
COMPETITIVE DISTRIBUTED DECISION-MAKING
Authors: DENG XT PAPADIMITRIOU CH
Citation: Xt. Deng et Ch. Papadimitriou, COMPETITIVE DISTRIBUTED DECISION-MAKING, Algorithmica, 16(2), 1996, pp. 133-150
THE BISECTION WIDTH OF GRID GRAPHS
Authors: PAPADIMITRIOU CH SIDERI M
Citation: Ch. Papadimitriou et M. Sideri, THE BISECTION WIDTH OF GRID GRAPHS, Mathematical systems theory, 29(2), 1996, pp. 97-110
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
REVERSIBLE SIMULATION OF SPACE-BOUNDED COMPUTATIONS
Authors: CRESCENZI P PAPADIMITRIOU CH
Citation: P. Crescenzi et Ch. Papadimitriou, REVERSIBLE SIMULATION OF SPACE-BOUNDED COMPUTATIONS, Theoretical computer science, 143(1), 1995, pp. 159-165
ON THE K-SERVER CONJECTURE
Authors: KOUTSOUPIAS E PAPADIMITRIOU CH
Citation: E. Koutsoupias et Ch. Papadimitriou, ON THE K-SERVER CONJECTURE, Journal of the Association for Computing Machinery, 42(5), 1995, pp. 971-983
ON THE COMPLEXITY OF COOPERATIVE SOLUTION CONCEPTS
Authors: DENG XT PAPADIMITRIOU CH
Citation: Xt. Deng et Ch. Papadimitriou, ON THE COMPLEXITY OF COOPERATIVE SOLUTION CONCEPTS, Mathematics of operations research, 19(2), 1994, pp. 257-266
DESIGNING SECURE COMMUNICATION PROTOCOLS FROM TRUST SPECIFICATIONS
Authors: PAPADIMITRIOU CH RANGAN V SIDERI M
Citation: Ch. Papadimitriou et al., DESIGNING SECURE COMMUNICATION PROTOCOLS FROM TRUST SPECIFICATIONS, Algorithmica, 11(5), 1994, pp. 485-499
ON THE COMPLEXITY OF THE PARITY ARGUMENT AND OTHER INEFFICIENT PROOFSOF EXISTENCE
Authors: PAPADIMITRIOU CH
Citation: Ch. Papadimitriou, ON THE COMPLEXITY OF THE PARITY ARGUMENT AND OTHER INEFFICIENT PROOFSOF EXISTENCE, Journal of computer and system sciences, 48(3), 1994, pp. 498-532
DEFAULT THEORIES THAT ALWAYS HAVE EXTENSIONS
Authors: PAPADIMITRIOU CH SIDERI M
Citation: Ch. Papadimitriou et M. Sideri, DEFAULT THEORIES THAT ALWAYS HAVE EXTENSIONS, Artificial intelligence, 69(1-2), 1994, pp. 347-357
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
THE PARALLEL COMPLEXITY OF SIMPLE LOGIC PROGRAMS
Authors: AFRATI F PAPADIMITRIOU CH
Citation: F. Afrati et Ch. Papadimitriou, THE PARALLEL COMPLEXITY OF SIMPLE LOGIC PROGRAMS, Journal of the Association for Computing Machinery, 40(4), 1993, pp. 891-916
Risultati: 1-15 |