JCSS 2008 - PDF Preprint Papers

JCSS 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JCSS-2008 Paper

click to vote

JCSS
2008

193views more JCSS 2008»

Convex recolorings of strings and trees: Definitions, hardness results and algorithms

14 years 12 days ago

Download www.phylo.org

Shlomo Moran, Sagi Snir

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	193	Convex recolorings of strings and trees: Definitions, hardness results and algorithms	claim
2	159	Analysing distributed Internet worm attacks using continuous state-space approximation of process algebra models	claim
3	138	Reducing mechanism design to algorithm design via machine learning	claim
4	120	Quantum certificate complexity	claim
5	107	A unified theory of structural tractability for constraint satisfaction problems	claim
6	96	Stateless data concealment for distributed systems	claim
7	96	A combinatorial characterization of resolution width	claim
8	96	Precedence constrained scheduling in (2 - 7/(3p+1)) optimal	claim
9	90	Fault tolerance in cellular automata at high fault rates	claim
10	87	Finding large 3-free sets I: The small n case	claim
11	84	Computational complexity of auditing finite attributes in statistical databases	claim
12	81	A simulator for adaptive parallel applications	claim
13	80	Improved bounds on sorting by length-weighted reversals	claim
14	73	Structure identification of Boolean relations and plain bases for co-clones	claim
15	70	The complexity of properly learning simple concept classes	claim
16	65	The gap in circumventing the impossibility of consensus	claim
17	65	Efficient algorithms for counting parameterized list H-colorings	claim
18	64	Tight approximation algorithm for connectivity augmentation problems	claim
19	63	Approximation of satisfactory bisection problems	claim
20	62	Maximal repetitions in strings	claim
21	44	Online linear optimization and adaptive routing	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers