Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer-Verlag

354050110x

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Recognizable sets with multiplicities in the tropical semiring

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988 ◽

10.1007/bfb0017135 ◽

2005 ◽

pp. 107-120 ◽

Cited By ~ 53

Author(s):

Imre Simon

Keyword(s):

Tropical Semiring

Download Full-text

The steiner tree problem and homogeneous sets

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988 ◽

10.1007/bfb0017148 ◽

2005 ◽

pp. 249-261 ◽

Cited By ~ 3

Author(s):

A. D'Atri ◽

M. Moscarini ◽

A. Sassano

Keyword(s):

Steiner Tree ◽

Steiner Tree Problem

Download Full-text

Functional programming and combinatory algebras

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988 ◽

10.1007/bfb0017128 ◽

2005 ◽

pp. 14-26 ◽

Cited By ~ 4

Author(s):

Corrado Böhm

Keyword(s):

Functional Programming

Download Full-text

Comparing interconnection networks

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988 ◽

10.1007/bfb0017137 ◽

2005 ◽

pp. 138-153 ◽

Cited By ~ 10

Author(s):

Burkhard Monien ◽

Hal Sudborough

Keyword(s):

Interconnection Networks

Download Full-text

Δ 2 p -complete lexicographically first maximal subgraph problems

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988 ◽

10.1007/bfb0017168 ◽

2005 ◽

pp. 454-462 ◽

Cited By ~ 1

Author(s):

Satoru Miyano

Download Full-text

Testing isomorphism of outerplanar graphs in parallel

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988 ◽

10.1007/bfb0017145 ◽

2005 ◽

pp. 220-230 ◽

Cited By ~ 3

Author(s):

Bogdan S. Chlebus ◽

Krzysztof Diks ◽

Tomasz Radzik

Keyword(s):

Outerplanar Graphs

Download Full-text

On efficiency of interval routing algorithms

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988 ◽

10.1007/bfb0017172 ◽

2005 ◽

pp. 492-500 ◽

Cited By ~ 11

Author(s):

Peter Ružička

Keyword(s):

Routing Algorithms ◽

Interval Routing

Download Full-text

Proof system for weakest prespecification and its applications

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988 ◽

10.1007/bfb0017169 ◽

2005 ◽

pp. 463-471

Author(s):

Ewa Orlowska

Keyword(s):

Proof System

Download Full-text

Robust oracle machines

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988 ◽

10.1007/bfb0017134 ◽

2005 ◽

pp. 93-106 ◽

Cited By ~ 4

Author(s):

Uwe Schöning

Download Full-text

Infinite behaviour of deterministic petri nets

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988 ◽

10.1007/bfb0017144 ◽

2005 ◽

pp. 210-219 ◽

Cited By ~ 2

Author(s):

Heino Carstensen

Keyword(s):

Petri Nets

Download Full-text

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer-Verlag

Recognizable sets with multiplicities in the tropical semiring

The steiner tree problem and homogeneous sets

Functional programming and combinatory algebras

Comparing interconnection networks

Δ 2 p -complete lexicographically first maximal subgraph problems

Testing isomorphism of outerplanar graphs in parallel

On efficiency of interval routing algorithms

Proof system for weakest prespecification and its applications

Robust oracle machines

Infinite behaviour of deterministic petri nets

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1988
Latest Publications