AAAAAA
Results:
1-10
|
Results: 10
Authors:
FERNANDEZBACA D
SLUTZKI G
Citation: D. Fernandezbaca et G. Slutzki, LINEAR-TIME ALGORITHMS FOR PARAMETRIC MINIMUM SPANNING TREE PROBLEMS ON PLANAR GRAPHS, Theoretical computer science, 181(1), 1997, pp. 57-74
Authors:
MOBASHER B
PIGOZZI D
SLUTZKI G
Citation: B. Mobasher et al., MULTIVALUED LOGIC PROGRAMMING-SEMANTICS - AN ALGEBRAIC APPROACH, Theoretical computer science, 171(1-2), 1997, pp. 77-109
Authors:
FERNANDEZBACA D
SLUTZKI G
Citation: D. Fernandezbaca et G. Slutzki, OPTIMAL PARAMETRIC SEARCH ON GRAPHS OF BOUNDED TREE-WIDTH, Journal of algorithms, 22(2), 1997, pp. 212-240
Authors:
SLUTZKI G
VAGVOLGYI S
Citation: G. Slutzki et S. Vagvolgyi, A HIERARCHY OF DETERMINISTIC TOP-DOWN TREE-TRANSFORMATIONS, Mathematical systems theory, 29(2), 1996, pp. 169-188
Authors:
SLUTZKI G
VAGVOLGYI S
Citation: G. Slutzki et S. Vagvolgyi, DETERMINISTIC TOP-DOWN TREE-TRANSDUCERS WITH ITERATED LOOK-AHEAD, Theoretical computer science, 143(2), 1995, pp. 285-308
Authors:
JHA PK
SLUTZKI G
Citation: Pk. Jha et G. Slutzki, A SCHEME TO CONSTRUCT DISTANCE-3 CODES USING LATIN SQUARES, WITH APPLICATIONS TO THE N-CUBE, Information processing letters, 55(3), 1995, pp. 123-127
Authors:
JHA PK
SLUTZKI G
Citation: Pk. Jha et G. Slutzki, INDEPENDENCE NUMBERS OF PRODUCT GRAPHS, Applied mathematics letters, 7(4), 1994, pp. 91-94
Authors:
RICH CA
SLUTZKI G
Citation: Ca. Rich et G. Slutzki, THE COMPLEXITY OF OPTIMIZING FINITE-STATE TRANSDUCERS, Theoretical computer science, 129(2), 1994, pp. 323-336
Authors:
FERNANDEZBACA D
SLUTZKI G
Citation: D. Fernandezbaca et G. Slutzki, PARAMETRIC PROBLEMS ON GRAPHS OF BOUNDED TREE-WIDTH, Journal of algorithms, 16(3), 1994, pp. 408-430
Authors:
LEUCHNER JH
MILLER L
SLUTZKI G
Citation: Jh. Leuchner et al., A NOTE ON THE EQUIVALENCE OF A SET OF EGDS TO A SET OF FDS, Information processing letters, 49(4), 1994, pp. 185-188
Risultati:
1-10
|