Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540540298, 9783540473596

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On semantics, syntactics and fixpoints of general programs

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science ◽

10.1007/3-540-54029-6_220 ◽

1991 ◽

pp. 709-720

Author(s):

Li Yan Yuan

Download Full-text

Kernel knowledge versus belt knowledge in default reasoning: A logical approach

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science ◽

10.1007/3-540-54029-6_217 ◽

1991 ◽

pp. 675-686 ◽

Cited By ~ 1

Author(s):

M. A. Nati Abdallah

Keyword(s):

Default Reasoning ◽

Logical Approach

Download Full-text

On the fault-tolerance of quasi-minimal cayley networks

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science ◽

10.1007/3-540-54029-6_192 ◽

1991 ◽

pp. 431-442 ◽

Cited By ~ 1

Author(s):

Marc Baumslag

Keyword(s):

Fault Tolerance

Download Full-text

Programming a parallel sort using distributed procedure calls

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science ◽

10.1007/3-540-54029-6_189 ◽

1991 ◽

pp. 415-417

Author(s):

Daniel Herman ◽

Laurent Trilling

Download Full-text

Logarithmic time NC algorithms for comparability graphs and circle graphs

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science ◽

10.1007/3-540-54029-6_186 ◽

1991 ◽

pp. 383-394 ◽

Cited By ~ 6

Author(s):

Lin Chen

Keyword(s):

Circle Graphs ◽

Nc Algorithms

Download Full-text

On the power of query-independent compilation

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science ◽

10.1007/3-540-54029-6_168 ◽

1991 ◽

pp. 185-196

Author(s):

Jiawei Han

Download Full-text

An improved join dependency for efficient constraint checking

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science ◽

10.1007/3-540-54029-6_167 ◽

1991 ◽

pp. 181-184

Author(s):

K. P. Tan ◽

T. C. Tan

Keyword(s):

Constraint Checking

Download Full-text

How costly can red-black trees be?

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science ◽

10.1007/3-540-54029-6_160 ◽

1991 ◽

pp. 117-126

Author(s):

Helen Cameron ◽

Derick Wood

Download Full-text

The Interpolation-Based Bintree and its application to graphics

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science ◽

10.1007/3-540-54029-6_156 ◽

1991 ◽

pp. 78-89 ◽

Cited By ~ 1

Author(s):

M. Aris Ouksel ◽

Anan Yaagoub

Download Full-text

On the quickest path problem

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science ◽

10.1007/3-540-54029-6_152 ◽

1991 ◽

pp. 43-46 ◽

Cited By ~ 7

Author(s):

Yung-Chen Hung ◽

Gen-Huey Chen

Keyword(s):

Quickest Path

Download Full-text

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On semantics, syntactics and fixpoints of general programs

Kernel knowledge versus belt knowledge in default reasoning: A logical approach

On the fault-tolerance of quasi-minimal cayley networks

Programming a parallel sort using distributed procedure calls

Logarithmic time NC algorithms for comparability graphs and circle graphs

On the power of query-independent compilation

An improved join dependency for efficient constraint checking

How costly can red-black trees be?

The Interpolation-Based Bintree and its application to graphics

On the quickest path problem

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science
Latest Publications