Lecture Notes in Computer Science - ISA'91 Algorithms
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540549451, 9783540466000

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Historical searching and sorting

Lecture Notes in Computer Science - ISA'91 Algorithms ◽

10.1007/3-540-54945-5_70 ◽

1991 ◽

pp. 263-272 ◽

Cited By ~ 1

Author(s):

Alistair Moffat ◽

Ola Petersson

Download Full-text

Distributed k-mutual exclusion problem and k-coteries

Lecture Notes in Computer Science - ISA'91 Algorithms ◽

10.1007/3-540-54945-5_45 ◽

1991 ◽

pp. 22-31 ◽

Cited By ~ 12

Author(s):

Satoshi Fujita ◽

Masafumi Yamashita ◽

Tadashi Ae

Keyword(s):

Mutual Exclusion ◽

Exclusion Problem

Download Full-text

Decision-making with incomplete information

Lecture Notes in Computer Science - ISA'91 Algorithms ◽

10.1007/3-540-54945-5_42 ◽

1991 ◽

pp. 1-1

Author(s):

Christos H. Papadimitriou

Keyword(s):

Decision Making ◽

Incomplete Information

Download Full-text

A faster algorithm for edge-disjoint paths in planar graphs

Lecture Notes in Computer Science - ISA'91 Algorithms ◽

10.1007/3-540-54945-5_78 ◽

1991 ◽

pp. 336-348 ◽

Cited By ~ 4

Author(s):

Michael Kaufmann ◽

Gerhard Klär

Keyword(s):

Planar Graphs ◽

Disjoint Paths ◽

Edge Disjoint

Download Full-text

Mixed-searching and proper-path-width

Lecture Notes in Computer Science - ISA'91 Algorithms ◽

10.1007/3-540-54945-5_50 ◽

1991 ◽

pp. 61-71 ◽

Cited By ~ 2

Author(s):

Atsushi Takahashi ◽

Shuichi Ueno ◽

Yoji Kajitani

Download Full-text

On finding a smallest augmentation to biconnect a graph (Extended abstract)

Lecture Notes in Computer Science - ISA'91 Algorithms ◽

10.1007/3-540-54945-5_77 ◽

1991 ◽

pp. 326-335 ◽

Cited By ~ 4

Author(s):

Tsan-sheng Hsu ◽

Vijaya Ramachandran

Download Full-text

An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm

Lecture Notes in Computer Science - ISA'91 Algorithms ◽

10.1007/3-540-54945-5_55 ◽

1991 ◽

pp. 116-126 ◽

Cited By ~ 1

Author(s):

T. H. Hu ◽

C. Y. Tang ◽

R. C. T. Lee

Keyword(s):

Theorem Proving ◽

Case Analysis ◽

Mechanical Theorem Proving ◽

Average Case Analysis ◽

Average Case ◽

Mechanical Theorem

Download Full-text

Comparison-efficient and write-optimal searching and sorting

Lecture Notes in Computer Science - ISA'91 Algorithms ◽

10.1007/3-540-54945-5_71 ◽

1991 ◽

pp. 273-282 ◽

Cited By ~ 5

Author(s):

Arne Andersson ◽

Tony W. Lai

Download Full-text

A tight lower bound for the worst case of Bottom-Up-Heapsort

Lecture Notes in Computer Science - ISA'91 Algorithms ◽

10.1007/3-540-54945-5_69 ◽

1991 ◽

pp. 251-262

Author(s):

Rudolf Fleischer

Keyword(s):

Lower Bound ◽

Worst Case ◽

Bottom Up

Download Full-text

Parallel algorithms for some dominance problems based on a CREW PRAM

Lecture Notes in Computer Science - ISA'91 Algorithms ◽

10.1007/3-540-54945-5_81 ◽

1991 ◽

pp. 375-384

Author(s):

Ip-Wang Chan ◽

Donald K. Friesen

Keyword(s):

Parallel Algorithms ◽

Crew Pram

Download Full-text

Lecture Notes in Computer Science - ISA'91 AlgorithmsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Historical searching and sorting

Distributed k-mutual exclusion problem and k-coteries

Decision-making with incomplete information

A faster algorithm for edge-disjoint paths in planar graphs

Mixed-searching and proper-path-width

On finding a smallest augmentation to biconnect a graph (Extended abstract)

An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm

Comparison-efficient and write-optimal searching and sorting

A tight lower bound for the worst case of Bottom-Up-Heapsort

Parallel algorithms for some dominance problems based on a CREW PRAM

Lecture Notes in Computer Science - ISA'91 Algorithms
Latest Publications