Sciweavers

    MFCS
    1999
    Springer
    105views Theoretical Computer Science» more  MFCS 1999»
    A New Space Bound for the Modal Logics K4, KD4 and S4
    15 years 7 months ago
    A New Space Bound for the Modal Logics K4, KD4 and S4
    Download  www.mimuw.edu.pl
    We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more efficient decision procedures than those hitherto kno...
    Linh Anh Nguyen
    claim paper
    Read More »
    MFCS
    1999
    Springer
    79views Theoretical Computer Science» more  MFCS 1999»
    Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
    15 years 7 months ago
    Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
    Download  www.labri.fr
    Anca Muscholl, Doron Peled
    claim paper
    Read More »
    MFCS
    1999
    Springer
    130views Theoretical Computer Science» more  MFCS 1999»
    Foundations of Modular SOS
    15 years 7 months ago
    Foundations of Modular SOS
    Download  www.brics.dk
    Peter D. Mosses
    claim paper
    Read More »
    MFCS
    1999
    Springer
    96views Theoretical Computer Science» more  MFCS 1999»
    Language-Based Security
    15 years 7 months ago
    Language-Based Security
    Download  www.stanford.edu
    Dexter Kozen
    claim paper
    Read More »
    MFCS
    1999
    Springer
    99views Theoretical Computer Science» more  MFCS 1999»
    The Complexity of the Extended GCD Problem
    15 years 7 months ago
    The Complexity of the Extended GCD Problem
    Download  dimacs.rutgers.edu
    George Havas, Jean-Pierre Seifert
    claim paper
    Read More »
    MFCS
    1999
    Springer
    82views Theoretical Computer Science» more  MFCS 1999»
    On Plain and Hereditary History-Preserving Bisimulation
    15 years 7 months ago
    On Plain and Hereditary History-Preserving Bisimulation
    Download  www.brics.dk
    Sibylle B. Fröschle, Thomas T. Hildebrandt
    claim paper
    Read More »
    MFCS
    1999
    Springer
    71views Theoretical Computer Science» more  MFCS 1999»
    An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
    15 years 7 months ago
    An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
    Download  theinf1.informatik.uni-jena.de
    Henning Fernau, Rolf Niedermeier
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.