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

TOTAL DOCUMENTS

54

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540583387, 9783540486633

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A fully abstract semantics for termination in Petri nets

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

10.1007/3-540-58338-6_84 ◽

1994 ◽

pp. 373-382

Author(s):

Robert Gold

Keyword(s):

Abstract Semantics

Download Full-text

On parallel complexity of maximum f-matching and the degree sequence problem

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

10.1007/3-540-58338-6_78 ◽

1994 ◽

pp. 316-325 ◽

Author(s):

Anders Dessmark ◽

Andrzej Lingas ◽

Oscar Garrido

Keyword(s):

Degree Sequence ◽

Parallel Complexity

Download Full-text

On languages accepted with simultaneous complexity bounds and their ranking problem

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

10.1007/3-540-58338-6_71 ◽

1994 ◽

pp. 245-255 ◽

Author(s):

Alberto Bertoni ◽

Carlo Mereghetti ◽

Giovanni Pighizzini

Keyword(s):

Ranking Problem ◽

Complexity Bounds

Download Full-text

Stable bistructure models of PCF

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

10.1007/3-540-58338-6_66 ◽

1994 ◽

pp. 177-197 ◽

Author(s):

Glynn Winskel

Download Full-text

E-complete sets do not have optimal polynomial time approximations

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

10.1007/3-540-58338-6_57 ◽

1994 ◽

pp. 38-51 ◽

Author(s):

Pavol Ďuriš ◽

José D. P. Rolim

Keyword(s):

Polynomial Time ◽

Optimal Polynomial ◽

Download Full-text

Shorter queues for permutation routing on meshes

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

10.1007/3-540-58338-6_106 ◽

1994 ◽

pp. 597-607 ◽

Author(s):

Jop F. Sibeyn ◽

Bogdan S. Chlebus ◽

Michael Kaufmann

Keyword(s):

Permutation Routing

Download Full-text

Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable

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

10.1007/3-540-58338-6_104 ◽

1994 ◽

pp. 577-586 ◽

Author(s):

Gwénaël Richomme

Keyword(s):

Power Property ◽

Download Full-text

How a rainbow coloring function can simulate wait-free handshaking

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

10.1007/3-540-58338-6_101 ◽

1994 ◽

pp. 546-555

Author(s):

Marina Papatriantafilou ◽

Philippas Tsigas

Keyword(s):

Rainbow Coloring

Download Full-text

Genericity and measure for exponential time

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

10.1007/3-540-58338-6_69 ◽

1994 ◽

pp. 221-232 ◽

Author(s):

Klaus Ambos-Spies ◽

Hans-Christian Neis ◽

Sebastiaan A. Terwijn

Keyword(s):

Exponential Time

Download Full-text

Full abstraction for the second order subset of an ALGOL-like language

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

10.1007/3-540-58338-6_107 ◽

1994 ◽

pp. 608-617 ◽

Author(s):

Kurt Sieber

Keyword(s):

Second Order ◽

Full Abstraction

Download Full-text