Sciweavers

    220 search results - page 20 / 44
    » tcs 2008
    Sort
    View
    TCS
    2008
    99views Theoretical Computer Science» more  TCS 2008»
    A relation between trinucleotide comma-free codes and trinucleotide circular codes
    13 years 9 months ago
    A relation between trinucleotide comma-free codes and trinucleotide circular codes
    Download  dpt-info.u-strasbg.fr
    The comma-free codes and circular codes are two important classes of codes in code theory and in genetics. Fifty years ago before the discovery of the genetic code, a trinucleotid...
    Christian J. Michel, Giuseppe Pirillo, Mario A. Pi...
    claim paper
    Read More »
    TCS
    2008
    88views Theoretical Computer Science» more  TCS 2008»
    On the structure of graphs in the Caucal hierarchy
    13 years 9 months ago
    On the structure of graphs in the Caucal hierarchy
    Download  www.mathematik.tu-darmstadt.de
    We investigate the structure of graphs in the Caucal hierarchy. We provide criteria concerning the degree of vertices or the length of paths which can be used to show that a given ...
    Achim Blumensath
    claim paper
    Read More »
    TCS
    2008
    148views Theoretical Computer Science» more  TCS 2008»
    The moving curve ideal and the Rees algebra
    13 years 9 months ago
    The moving curve ideal and the Rees algebra
    Download  math.ohiou.edu
    These are notes for a lecture given at Ohio University on June 3, 2006. An important topic in commutative algebra is the Rees algebra of an ideal in a commutative ring. The Rees al...
    David A. Cox
    claim paper
    Read More »
    TCS
    2008
    84views Theoretical Computer Science» more  TCS 2008»
    Election and rendezvous with incomparable labels
    13 years 9 months ago
    Election and rendezvous with incomparable labels
    Download  www.lif.univ-mrs.fr
    In "Can we elect if we cannot compare" (SPAA'03), Barri`ere, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the label...
    Jérémie Chalopin
    claim paper
    Read More »
    TCS
    2008
    122views Theoretical Computer Science» more  TCS 2008»
    On the decidability and complexity of the structural congruence for beta-binders
    13 years 9 months ago
    On the decidability and complexity of the structural congruence for beta-binders
    Download  disi.unitn.it
    Beta-binders is a recent process calculus developed for modelling and simulating biological systems. As usual for process calculi, the semantic definition heavily relies on a stru...
    Alessandro Romanel, Corrado Priami
    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.