AAAAAA
Results: 1-25/210
Authors:
SERNADAS A
SERNADAS C
CALEIRO C
Citation: A. Sernadas et al., DENOTATIONAL SEMANTICS OF OBJECT SPECIFICATION, Acta informatica, 35(9), 1998, pp. 729-773
Authors:
MOFFAT A
PETERSSON O
WORMALD NC
Citation: A. Moffat et al., A TREE-BASED MERGESORT, Acta informatica, 35(9), 1998, pp. 775-793
Authors:
SANLAVILLE E
SCHMIDT G
Citation: E. Sanlaville et G. Schmidt, MACHINE SCHEDULING WITH AVAILABILITY CONSTRAINTS, Acta informatica, 35(9), 1998, pp. 795-811
Authors:
VANDENBUSSCHE J
CABIBBO L
Citation: J. Vandenbussche et L. Cabibbo, CONVERTING UNTYPED FORMULAS TO TYPED ONES, Acta informatica, 35(8), 1998, pp. 637-643
Authors:
BEAUQUIER D
SLISSENKO A
Citation: D. Beauquier et A. Slissenko, POLYTIME MODEL CHECKING FOR TIMED PROBABILISTIC COMPUTATION TREE LOGIC, Acta informatica, 35(8), 1998, pp. 645-664
Authors:
CAPORASO S
ZITO M
Citation: S. Caporaso et M. Zito, ON A RELATION BETWEEN UNIFORM CODING AND PROBLEMS OF THE FORM DTIMEF(F) = DSPACEF(F), Acta informatica, 35(8), 1998, pp. 665-672
Authors:
YEN HC
Citation: Hc. Yen, PRIORITY CONFLICT-FREE PETRI NETS, Acta informatica, 35(8), 1998, pp. 673-688
Authors:
SHYR HJ
YU SS
Citation: Hj. Shyr et Ss. Yu, BI-CATENATION AND SHUFFLE PRODUCT OF LANGUAGES, Acta informatica, 35(8), 1998, pp. 689-707
Authors:
FAN CM
SHYR HJ
YU SS
Citation: Cm. Fan et al., D-WORDS AND D-LANGUAGES, Acta informatica, 35(8), 1998, pp. 709-727
Authors:
SIBEYN JF
Citation: Jf. Sibeyn, LIST RANKING ON MESHES, Acta informatica, 35(7), 1998, pp. 543-566
Authors:
DIEKERT V
GASTIN P
Citation: V. Diekert et P. Gastin, APPROXIMATING TRACES, Acta informatica, 35(7), 1998, pp. 567-593
Authors:
LEUNG H
Citation: H. Leung, ON FINITE AUTOMATA WITH LIMITED NONDETERMINISM, Acta informatica, 35(7), 1998, pp. 595-624
Authors:
HONKALA J
Citation: J. Honkala, DECISION-PROBLEMS CONCERNING THINNESS AND SLENDERNESS OF FORMAL LANGUAGES, Acta informatica, 35(7), 1998, pp. 625-636
Authors:
BALDONI R
HELARY JM
RAYNAL M
Citation: R. Baldoni et al., CONSISTENT RECORDS IN ASYNCHRONOUS COMPUTATIONS, Acta informatica, 35(6), 1998, pp. 441-455
Authors:
SAGIV M
FRANCEZ N
RODEH M
WILHELM R
Citation: M. Sagiv et al., A LOGIC-BASED APPROACH TO PROGRAM FLOW-ANALYSIS, Acta informatica, 35(6), 1998, pp. 457-504
Authors:
ESIK Z
BERTOL M
Citation: Z. Esik et M. Bertol, NONFINITE AXIOMATIZABILITY OF THE EQUATIONAL THEORY OF SHUFFLE, Acta informatica, 35(6), 1998, pp. 505-539
Authors:
LAURENT D
LUONG VP
SPYRATOS N
Citation: D. Laurent et al., THE USE OF DELETED TUPLES IN DATABASE QUERYING AND UPDATING (VOL 34, PG 905, 1997), Acta informatica, 35(6), 1998, pp. 541-541
Authors:
BOREALE M
SANGIORGI D
Citation: M. Boreale et D. Sangiorgi, A FULLY ABSTRACT SEMANTICS FOR CAUSALITY IN THE PI-CALCULUS, Acta informatica, 35(5), 1998, pp. 353-400
Authors:
KARI L
PAUN G
ROZENBERG G
SALOMAA A
YU S
Citation: L. Kari et al., DNA COMPUTING, STICKER SYSTEMS, AND UNIVERSALITY, Acta informatica, 35(5), 1998, pp. 401-420
Authors:
BARYEHUDA R
FOGEL S
Citation: R. Baryehuda et S. Fogel, PARTITIONING A SEQUENCE INTO FEW MONOTONE SUBSEQUENCES, Acta informatica, 35(5), 1998, pp. 421-440
Authors:
KOURIE DG
OOSTHUIZEN GD
Citation: Dg. Kourie et Gd. Oosthuizen, LATTICES IN MACHINE LEARNING - COMPLEXITY ISSUES, Acta informatica, 35(4), 1998, pp. 269-292
Authors:
RABINOVICH A
Citation: A. Rabinovich, MODULARITY AND EXPRESSIBILITY FOR NETS OF RELATIONS, Acta informatica, 35(4), 1998, pp. 293-327
Authors:
BUCHHOLZ T
KUTRIB M
Citation: T. Buchholz et M. Kutrib, ON TIME COMPUTABILITY OF FUNCTIONS IN ONE-WAY CELLULAR-AUTOMATA, Acta informatica, 35(4), 1998, pp. 329-352
Authors:
LOCURATOLO E
RABITTI F
Citation: E. Locuratolo et F. Rabitti, CONCEPTUAL CLASSES AND SYSTEM CLASSES IN OBJECT DATABASES, Acta informatica, 35(3), 1998, pp. 181-210
Authors:
DELAVEGA WF
PASCHOS VT
STAFYLOPATIS AN
Citation: Wf. Delavega et al., AVERAGE-CASE COMPLEXITY FOR THE EXECUTION OF RECURSIVE DEFINITIONS ONRELATIONAL DATABASES, Acta informatica, 35(3), 1998, pp. 211-243