Sciweavers

    37 search results - page 3 / 8
    » fsttcs 2007
    Sort
    View
    FSTTCS
    2007
    Springer
    103views Software Engineering» more  FSTTCS 2007»
    Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
    13 years 9 months ago
    Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
    Download  203.208.166.84
    Therese C. Biedl, Masud Hasan, Alejandro Ló...
    claim paper
    Read More »
    FSTTCS
    2007
    Springer
    123views Software Engineering» more  FSTTCS 2007»
    Satisfiability of Algebraic Circuits over Sets of Natural Numbers
    13 years 11 months ago
    Satisfiability of Algebraic Circuits over Sets of Natural Numbers
    Download  haegar.informatik.uni-wuerzburg.de
    Christian Glaßer, Christian Reitwießne...
    claim paper
    Read More »
    FSTTCS
    2007
    Springer
    74views Software Engineering» more  FSTTCS 2007»
    Probabilistic and Topological Semantics for Timed Automata
    13 years 11 months ago
    Probabilistic and Topological Semantics for Timed Automata
    Download  www.lsv.ens-cachan.fr
    Christel Baier, Nathalie Bertrand, Patricia Bouyer...
    claim paper
    Read More »
    FSTTCS
    2007
    Springer
    83views Software Engineering» more  FSTTCS 2007»
    Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
    13 years 11 months ago
    Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
    Download  www.lsv.ens-cachan.fr
    We introduce PEP, the Post Embedding Problem, a variant of PCP where one compares strings with the subword relation, and PEPreg , a further variant where solutions are constrained ...
    Pierre Chambart, Ph. Schnoebelen
    claim paper
    Read More »
    FSTTCS
    2007
    Springer
    74views Software Engineering» more  FSTTCS 2007»
    Synthesis of Safe Message-Passing Systems
    13 years 11 months ago
    Synthesis of Safe Message-Passing Systems
    Download  nicolas.baudru.perso.esil.univmed.fr
    We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states ind...
    Nicolas Baudru, Rémi Morin
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.