AAAAAA

   
Results: 1-7 |
Results: 7
APPROXIMATING THE UNSATISFIABILITY THRESHOLD OF RANDOM FORMULAS
Authors: KIROUSIS LM KRANAKIS E KRIZANC D STAMATIOU YC
Citation: Lm. Kirousis et al., APPROXIMATING THE UNSATISFIABILITY THRESHOLD OF RANDOM FORMULAS, Random structures & algorithms, 12(3), 1998, pp. 253-269
FUGITIVE-SEARCH GAMES ON GRAPHS AND RELATED PARAMETERS
Authors: DENDRIS ND KIROUSIS LM THILIKOS DM
Citation: Nd. Dendris et al., FUGITIVE-SEARCH GAMES ON GRAPHS AND RELATED PARAMETERS, Theoretical computer science, 172(1-2), 1997, pp. 233-254
EFFICIENT ALGORITHMS FOR CHECKING THE ATOMICITY OF A RUN OF READ AND WRITE OPERATIONS
Authors: KIROUSIS LM VENERIS AG
Citation: Lm. Kirousis et Ag. Veneris, EFFICIENT ALGORITHMS FOR CHECKING THE ATOMICITY OF A RUN OF READ AND WRITE OPERATIONS, Acta informatica, 32(2), 1995, pp. 155-170
READING MANY VARIABLES IN ONE ATOMIC OPERATION - SOLUTIONS WITH LINEAR OR SUBLINEAR COMPLEXITY
Authors: KIROUSIS LM SPIRAKIS P TSIGAS P
Citation: Lm. Kirousis et al., READING MANY VARIABLES IN ONE ATOMIC OPERATION - SOLUTIONS WITH LINEAR OR SUBLINEAR COMPLEXITY, IEEE transactions on parallel and distributed systems, 5(7), 1994, pp. 688-696
LOWER BOUNDS AND EFFICIENT ALGORITHMS FOR MULTIPROCESSOR SCHEDULING OF DIRECTED ACYCLIC GRAPHS WITH COMMUNICATION DELAYS
Authors: JUNG H KIROUSIS LM SPIRAKIS P
Citation: H. Jung et al., LOWER BOUNDS AND EFFICIENT ALGORITHMS FOR MULTIPROCESSOR SCHEDULING OF DIRECTED ACYCLIC GRAPHS WITH COMMUNICATION DELAYS, Information and computation, 105(1), 1993, pp. 94-104
PARALLEL COMPLEXITY OF THE CONNECTED SUBGRAPH PROBLEM
Authors: KIROUSIS LM SERNA M SPIRAKIS P
Citation: Lm. Kirousis et al., PARALLEL COMPLEXITY OF THE CONNECTED SUBGRAPH PROBLEM, SIAM journal on computing, 22(3), 1993, pp. 573-586
FAST PARALLEL CONSTRAINT SATISFACTION
Authors: KIROUSIS LM
Citation: Lm. Kirousis, FAST PARALLEL CONSTRAINT SATISFACTION, Artificial intelligence, 64(1), 1993, pp. 147-160
Risultati: 1-7 |