AAAAAA
Results:
1-8
|
Results: 8
Authors:
REPS T
Citation: T. Reps, MAXIMAL-MUNCH TOKENIZATION IN LINEAR-TIME, ACM transactions on programming languages and systems, 20(2), 1998, pp. 259-273
Authors:
SAGIV M
REPS T
WILHELM R
Citation: M. Sagiv et al., SOLVING SHAPE-ANALYSIS PROBLEMS IN LANGUAGES WITH DESTRUCTIVE UPDATING, ACM transactions on programming languages and systems, 20(1), 1998, pp. 1-50
Authors:
MELSKI D
REPS T
Citation: D. Melski et T. Reps, INTERCONVERTIBILITY OF SET CONSTRAINTS AND CONTEXT-FREE LANGUAGE REACHABILITY, ACM SIGPLAN NOTICES, 32(12), 1997, pp. 74-89
Authors:
SAGIV M
REPS T
HORWITZ S
Citation: M. Sagiv et al., PRECISE INTERPROCEDURAL DATA-FLOW ANALYSIS WITH APPLICATIONS TO CONSTANT PROPAGATION, Theoretical computer science, 167(1-2), 1996, pp. 131-170
Authors:
RAMALINGAM G
REPS T
Citation: G. Ramalingam et T. Reps, ON THE COMPUTATIONAL-COMPLEXITY OF DYNAMIC GRAPH PROBLEMS, Theoretical computer science, 158(1-2), 1996, pp. 233-277
Authors:
RAMALINGAM G
REPS T
Citation: G. Ramalingam et T. Reps, AN INCREMENTAL ALGORITHM FOR A GENERALIZATION OF THE SHORTEST-PATH PROBLEM, Journal of algorithms, 21(2), 1996, pp. 267-305
Authors:
REPS T
Citation: T. Reps, ON THE SEQUENTIAL NATURE OF INTERPROCEDURAL PROGRAM-ANALYSIS PROBLEMS, Acta informatica, 33(8), 1996, pp. 739-757
Authors:
RAMALINGAM G
REPS T
Citation: G. Ramalingam et T. Reps, ON COMPETITIVE ONLINE ALGORITHMS FOR THE DYNAMIC PRIORITY-ORDERING PROBLEM, Information processing letters, 51(3), 1994, pp. 155-161
Risultati:
1-8
|