MFCS 1999 | Sciweavers

8

MFCS
1999
Springer

105views Theoretical Computer Science» more MFCS 1999»

A New Space Bound for the Modal Logics K4, KD4 and S4

13 years 8 months ago

We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more eﬃcient decision procedures than those hitherto kno...

Linh Anh Nguyen

claim paper

Read More »

10

click to vote

MFCS
1999
Springer

79views Theoretical Computer Science» more MFCS 1999»

Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces

13 years 8 months ago

Download www.labri.fr

Anca Muscholl, Doron Peled

claim paper

Read More »

18

click to vote

MFCS
1999
Springer

130views Theoretical Computer Science» more MFCS 1999»

Foundations of Modular SOS

13 years 8 months ago

Download www.brics.dk

Peter D. Mosses

claim paper

Read More »

11

click to vote

MFCS
1999
Springer

96views Theoretical Computer Science» more MFCS 1999»

Language-Based Security

13 years 8 months ago

Download www.stanford.edu

Dexter Kozen

claim paper

Read More »

10

click to vote

MFCS
1999
Springer

99views Theoretical Computer Science» more MFCS 1999»

The Complexity of the Extended GCD Problem

13 years 8 months ago

Download dimacs.rutgers.edu

George Havas, Jean-Pierre Seifert

claim paper

Read More »

8

click to vote

MFCS
1999
Springer

82views Theoretical Computer Science» more MFCS 1999»

On Plain and Hereditary History-Preserving Bisimulation

13 years 8 months ago

Download www.brics.dk

Sibylle B. Fröschle, Thomas T. Hildebrandt

claim paper

Read More »

12

click to vote

MFCS
1999
Springer

71views Theoretical Computer Science» more MFCS 1999»

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover

13 years 8 months ago

Download theinf1.informatik.uni-jena.de

Henning Fernau, Rolf Niedermeier

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers