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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540406716, 9783540451389

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Scheduling and Traffic Allocation for Tasks with Bounded Splittability

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

10.1007/978-3-540-45138-9_44 ◽

2003 ◽

pp. 500-510 ◽

Cited By ~ 8

Author(s):

Piotr Krysta ◽

Peter Sanders ◽

Berthold Vöcking

Keyword(s):

Traffic Allocation

Download Full-text

A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves

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

10.1007/978-3-540-45138-9_20 ◽

2003 ◽

pp. 259-268 ◽

Cited By ~ 17

Author(s):

Paul S. Bonsma ◽

Tobias Brueggemann ◽

Gerhard J. Woeginger

Keyword(s):

Spanning Trees ◽

Fpt Algorithm

Download Full-text

On the Complexity of Some Problems in Interval Arithmetic

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

10.1007/978-3-540-45138-9_52 ◽

2003 ◽

pp. 582-591

Author(s):

K. Meer

Keyword(s):

Interval Arithmetic

Download Full-text

A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes

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

10.1007/978-3-540-45138-9_46 ◽

2003 ◽

pp. 521-530 ◽

Cited By ~ 4

Author(s):

Sławomir Lasota

Keyword(s):

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

True Concurrency ◽

Parallel Processes

Download Full-text

On Matroid Properties Definable in the MSO Logic

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

10.1007/978-3-540-45138-9_41 ◽

2003 ◽

pp. 470-479 ◽

Cited By ~ 9

Author(s):

Petr Hliněný

Keyword(s):

Mso Logic

Download Full-text

Relating Hierarchy of Temporal Properties to Model Checking

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

10.1007/978-3-540-45138-9_26 ◽

2003 ◽

pp. 318-327 ◽

Cited By ~ 25

Author(s):

Ivana Černá ◽

Radek Pelánek

Keyword(s):

Model Checking ◽

Temporal Properties

Download Full-text

Denotational Testing Semantics in Coinductive Form

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

10.1007/978-3-540-45138-9_22 ◽

2003 ◽

pp. 279-289 ◽

Cited By ~ 4

Author(s):

Michele Boreale ◽

Fabio Gadducci

Keyword(s):

Testing Semantics

Download Full-text

Match-Bounded String Rewriting Systems

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

10.1007/978-3-540-45138-9_39 ◽

2003 ◽

pp. 449-459 ◽

Cited By ~ 7

Author(s):

Alfons Geser ◽

Dieter Hofbauer ◽

Johannes Waldmann

Keyword(s):

Rewriting Systems ◽

String Rewriting

Download Full-text

A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory

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

10.1007/978-3-540-45138-9_50 ◽

2003 ◽

pp. 562-571 ◽

Cited By ~ 3

Author(s):

Bas Luttik

Keyword(s):

Decomposition Theorem ◽

Process Theory ◽

Unique Decomposition

Download Full-text

Inferring Strings from Graphs and Arrays

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

10.1007/978-3-540-45138-9_15 ◽

2003 ◽

pp. 208-217 ◽

Cited By ~ 17

Author(s):

Hideo Bannai ◽

Shunsuke Inenaga ◽

Ayumi Shinohara ◽

Masayuki Takeda

Download Full-text

Mathematical Foundations of Computer Science 2003 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Scheduling and Traffic Allocation for Tasks with Bounded Splittability

A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves

On the Complexity of Some Problems in Interval Arithmetic

A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes

On Matroid Properties Definable in the MSO Logic

Relating Hierarchy of Temporal Properties to Model Checking

Denotational Testing Semantics in Coinductive Form

Match-Bounded String Rewriting Systems

A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory

Inferring Strings from Graphs and Arrays

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