On-line algorithms for orders

被引：2

作者：

Bouchitte, V ^{[1
]}

Rampon, JX ^{[1
]}

机构：

[1] UNIV NANTES,IRIN,F-44072 NANTES 03,FRANCE

来源：

THEORETICAL COMPUTER SCIENCE | 1997年 / 175卷 / 02期

关键词：

D O I：

10.1016/S0304-3975(97)00200-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Partially ordered sets appear as a basic tool in computer science and are particularly accurate for modeling dynamic behavior of complex systems. Motivated by considerations on the diagnosis of distributed computations a new kind of algorithm on posets has been developed and is now widely considered. In this paper we present this ''on-line'' algorithmics on posets and we survey the main results obtained under this approach.

引用

页码：225 / 238

页数：14

共 30 条

[1]

[Anonymous], 1988, P 11 AUSTR COMP SCI

[2]

AVITABILE F, 1995, THESIS LIP ENS LYON

[3]

BARBUT M, 1965, NOTE ALGEBRE TECHNIQ

[4]

BOGART KP, 1994, LECT NOTES COMPUTER, V831, P13

[5]

BORDAT JP, 1991, RAIRO-RECH OPER, V25, P265

[6]

BOUCHITTE V, 1993, 751 IRISA

[7] A LINEAR RECOGNITION ALGORITHM FOR COGRAPHS [J].

CORNEIL, DG ;

PERL, Y ;

STEWART, LK .

SIAM JOURNAL ON COMPUTING, 1985, 14 (04) :926-934

[8]

DUFFIN RJ, 1965, J MATH ANAL APPL, V10, P149

[9]

FELSNER S, 1992, THESIS TU BERLIN GER

[10]

Fishburn PC., 1985, INTERVAL ORDERS INTE, pxi+215

← 1 2 3 →