AAAAAA
Results:
1-9
|
Results: 9
Authors:
AUSIELLO G
MARCHETTISPACCAMELA A
Citation: G. Ausiello et A. Marchettispaccamela, GRAPH-THEORETIC CONCEPTS IN COMPUTER-SCIENCE - FOREWORD, Theoretical computer science, 203(1), 1998, pp. 1-1
Authors:
FRIGIONI D
MARCHETTISPACCAMELA A
NANNI U
Citation: D. Frigioni et al., SEMIDYNAMIC ALGORITHMS FOR MAINTAINING SINGLE-SOURCE SHORTEST-PATH TREES, Algorithmica, 22(3), 1998, pp. 250-274
Authors:
FEUERSTEIN E
LEONARDI S
MARCHETTISPACCAMELA A
SANTORO N
Citation: E. Feuerstein et al., EFFICIENT TOKEN-BASED CONTROL IN RINGS, Information processing letters, 66(4), 1998, pp. 175-180
Authors:
FLAMMINI M
VANLEEUWEN J
MARCHETTISPACCAMELA A
Citation: M. Flammini et al., THE COMPLEXITY OF INTERVAL ROUTING ON RANDOM GRAPHS, Computer journal (Print), 41(1), 1998, pp. 16-25
Authors:
ALIMONTI P
LEONARDI S
MARCHETTISPACCAMELA A
Citation: P. Alimonti et al., AVERAGE-CASE ANALYSIS OF FULLY DYNAMIC REACHABILITY FOR DIRECTED-GRAPHS, Informatique theorique et applications, 30(4), 1996, pp. 305-318
Authors:
MARCHETTISPACCAMELA A
NANNI U
ROHNERT H
Citation: A. Marchettispaccamela et al., MAINTAINING A TOPOLOGICAL ORDER UNDER EDGE INSERTIONS, Information processing letters, 59(1), 1996, pp. 53-58
Authors:
MARCHETTISPACCAMELA A
VERCELLIS C
Citation: A. Marchettispaccamela et C. Vercellis, STOCHASTIC ONLINE KNAPSACK-PROBLEMS, Mathematical programming, 68(1), 1995, pp. 73-104
Authors:
KUCERA L
MARCHETTISPACCAMELA A
PROTASI M
Citation: L. Kucera et al., ON LEARNING MONOTONE DNF FORMULAS UNDER UNIFORM DISTRIBUTIONS, Information and computation, 110(1), 1994, pp. 84-95
Authors:
FEUERSTEIN E
MARCHETTISPACCAMELA A
Citation: E. Feuerstein et A. Marchettispaccamela, DYNAMIC ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS, Theoretical computer science, 116(2), 1993, pp. 359-371
Risultati:
1-9
|