AAAAAA
Results: 1-25/73
Authors:
BOZAPALIDIS S
Citation: S. Bozapalidis, EQUATIONAL ELEMENTS IN ADDITIVE ALGEBRAS, theory of computing systems, 32(1), 1999, pp. 1-33
Authors:
BOURNEZ O
Citation: O. Bournez, SOME BOUNDS ON THE COMPUTATIONAL POWER OF PIECEWISE-CONSTANT DERIVATIVE SYSTEMS, theory of computing systems, 32(1), 1999, pp. 35-67
Authors:
FREUND R
KARI L
PAUN G
Citation: R. Freund et al., DNA COMPUTING BASED ON SPLICING - THE EXISTENCE OF UNIVERSAL COMPUTERS, theory of computing systems, 32(1), 1999, pp. 69-112
Authors:
HEATH LS
VERGARA JPC
Citation: Ls. Heath et Jpc. Vergara, EDGE-PACKING IN PLANAR GRAPHS, theory of computing systems, 31(6), 1998, pp. 629-662
Authors:
FAGNANI F
MARGARA L
Citation: F. Fagnani et L. Margara, EXPANSIVITY, PERMUTIVITY, AND CHAOS FOR CELLULAR-AUTOMATA, theory of computing systems, 31(6), 1998, pp. 663-677
Authors:
BORCHERT B
RANJAN D
STEPHAN F
Citation: B. Borchert et al., ON THE COMPUTATIONAL-COMPLEXITY OF SOME CLASSICAL EQUIVALENCE-RELATIONS ON BOOLEAN FUNCTIONS, theory of computing systems, 31(6), 1998, pp. 679-693
Authors:
ASANO T
MIYANO S
SURI S
WATANABE O
Citation: T. Asano et al., SPECIAL ISSUE - 7TH INTERNATIONAL-SYMPOSIUM ON ALGORITHMS AND COMPUTATION - FOREWORD, theory of computing systems, 31(5), 1998, pp. 489-489
Authors:
YEH TH
KUO CM
LEI CL
YEN HC
Citation: Th. Yeh et al., COMPETITIVE ANALYSIS OF ONLINE DISK SCHEDULING, theory of computing systems, 31(5), 1998, pp. 491-506
Authors:
LINGAS A
SOLTAN V
Citation: A. Lingas et V. Soltan, MINIMUM CONVEX PARTITION OF A POLYGON WITH HOLES BY CUTS IN GIVEN DIRECTIONS, theory of computing systems, 31(5), 1998, pp. 507-538
Authors:
ALLENDER E
LANGE KJ
Citation: E. Allender et Kj. Lange, RUSPACE(LOG N) SUBSET-OF DSPACE(LOG(2)-N-LOG-LOG-N), theory of computing systems, 31(5), 1998, pp. 539-550
Authors:
KUTYLOWSKI M
LORYS K
OESTERDIEKHOFF B
Citation: M. Kutylowski et al., PERIODIC MERGING NETWORKS, theory of computing systems, 31(5), 1998, pp. 551-578
Authors:
HAYASE K
IMAI H
Citation: K. Hayase et H. Imai, OBDDS OF A MONOTONE FUNCTION AND ITS PRIME IMPLICANTS, theory of computing systems, 31(5), 1998, pp. 579-591
Authors:
HAYASHI T
NAKANO K
OLARIU S
Citation: T. Hayashi et al., EFFICIENT LIST RANKING ON THE RECONFIGURABLE MESH, WITH APPLICATIONS, theory of computing systems, 31(5), 1998, pp. 593-611
Authors:
DEBERG M
CHEONG O
DEVILLERS O
VANKREVELD M
TEILLAUD M
Citation: M. Deberg et al., COMPUTING THE MAXIMUM OVERLAP OF 2 CONVEX POLYGONS UNDER TRANSLATIONS, theory of computing systems, 31(5), 1998, pp. 613-628
Authors:
CYPHER R
GIBBONS PB
HEIDE FMAD
Citation: R. Cypher et al., SPECIAL ISSUE - ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES - EDITORS FOREWORD, theory of computing systems, 31(4), 1998, pp. 329-329
Authors:
MUTHUKRISHNAN S
GHOSH B
SCHULTZ MH
Citation: S. Muthukrishnan et al., FIRST-ORDER AND 2ND-ORDER DIFFUSIVE METHODS FOR RAPID, COARSE, DISTRIBUTED LOAD BALANCING, theory of computing systems, 31(4), 1998, pp. 331-354
Authors:
PARK S
DILL DL
Citation: S. Park et Dl. Dill, VERIFICATION OF CACHE COHERENCE PROTOCOLS BY AGGREGATION OF DISTRIBUTED TRANSACTIONS, theory of computing systems, 31(4), 1998, pp. 355-376
Authors:
ADLER M
Citation: M. Adler, ASYNCHRONOUS SHARED-MEMORY SEARCH STRUCTURES, theory of computing systems, 31(4), 1998, pp. 377-401
Authors:
SHAVIT N
UPFAL E
ZEMACH A
Citation: N. Shavit et al., A STEADY-STATE ANALYSIS OF DIFFRACTING TREES, theory of computing systems, 31(4), 1998, pp. 403-423
Authors:
SCHEIDELER C
VOCKING B
Citation: C. Scheideler et B. Vocking, UNIVERSAL CONTINUOUS ROUTING STRATEGIES, theory of computing systems, 31(4), 1998, pp. 425-449
Authors:
IFTODE L
SINGH JP
LI K
Citation: L. Iftode et al., SCOPE CONSISTENCY - A BRIDGE BETWEEN RELEASE CONSISTENCY AND ENTRY CONSISTENCY, theory of computing systems, 31(4), 1998, pp. 451-473
Authors:
AVIOR A
CALAMONERI T
EVEN S
LITMAN A
ROSENBERG AL
Citation: A. Avior et al., A TIGHT LAYOUT OF THE BUTTERFLY NETWORK, theory of computing systems, 31(4), 1998, pp. 475-487
Authors:
STAIGER L
Citation: L. Staiger, A TIGHT UPPER BOUND ON KOLMOGOROV COMPLEXITY AND UNIFORMLY OPTIMAL PREDICTION, theory of computing systems, 31(3), 1998, pp. 215-229
Authors:
GEMIS M
PAREDAENS J
PEELMAN P
VANDENBUSSCHE J
Citation: M. Gemis et al., EXPRESSIVENESS AND COMPLEXITY OF GENERIC GRAPH MACHINES, theory of computing systems, 31(3), 1998, pp. 231-249
Authors:
CORMEN TH
BRUHL K
Citation: Th. Cormen et K. Bruhl, DONT BE TOO CLEVER - ROUTING BMMC PERMUTATIONS ON THE MASPAR MP-2, theory of computing systems, 31(3), 1998, pp. 251-278