IWOCA 2009 - PDF Preprint Papers

IWOCA 2009 International Workshop on Combinatorial Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IWOCA-2009 Paper

click to vote

IWOCA
2009
Springer

193views Algorithms» more IWOCA 2009»

Gray Code Compression

14 years 7 months ago

Download www.fmf.uni-lj.si

An n-bit (cyclic) Gray code is a (cyclic) sequence of all n-bit strings such that consecutive strings diﬀer in a single bit. We describe an algorithm which for every positive int...

Darko Dimitrov, Tomás Dvorák, Petr G...

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	Gray Code Compression	claim
2	163	Solution of Peter Winkler's Pizza Problem	claim
3	160	Note on Decomposition of Kn, n into (0, j)-prisms	claim
4	157	Forbidden Subgraph Colorings and the Oriented Chromatic Number	claim
5	153	Feedback Vertex Set on Graphs of Low Cliquewidth	claim
6	152	Better Polynomial Algorithms on Graphs of Bounded Rank-Width	claim
7	152	Edge-Simple Circuits through 10 Ordered Vertices in Square Grids	claim
8	149	Randomized Postoptimization of Covering Arrays	claim
9	137	Embedded Trees and the Support of the ISE	claim
10	134	Combinatorial Models for Cooperation Networks	claim
11	133	The Height and Range of Watermelons without Wall	claim
12	132	Fast Convolutions and Their Applications in Approximate String Matching	claim
13	123	Computability of Width of Submodular Partition Functions	claim
14	120	Polynomial Kernels for 3-Leaf Power Graph Modification Problems	claim
15	119	Fully Decomposable Split Graphs	claim
16	119	Minimax Trees in Linear Time with Applications	claim
17	117	Simpler Parameterized Algorithm for OCT	claim
18	117	On the Maximal Number of Cubic Subwords in a String	claim
19	112	The Guarding Problem - Complexity and Approximation	claim
20	104	An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers