✦ LIBER ✦

[Lecture Notes in Computer Science] WALCOM: Algorithms and Computation Volume 6552 || De Bruijn Sequences for the Binary Strings with Maximum Density

✍ Scribed by Katoh, Naoki; Kumar, Amit

Book ID: 120491992
Publisher: Springer Berlin Heidelberg
Year: 2011
Weight: 183 KB
Category: Article
ISBN: 3642190944
DOI: 10.1007/978-3-642-19094-0_19

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Fun

[Lecture Notes in Computer Science] Fun with Algorithms Volume 4475 || Tablatures for Stringed Instruments and Generating Functions

✍ Crescenzi, Pierluigi; Prencipe, Giuseppe; Pucci, Geppino 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 225 KB

[Lecture Notes in Computer Science] WALC

[Lecture Notes in Computer Science] WALCOM: Algorithms and Computation Volume 7157 || Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff?

✍ Rahman, Md. Saidur; Nakano, Shin-ichi 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 43 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 650 || The longest common subsequence problem for small alphabet size between many strings

✍ Ibaraki, Toshihide; Inagaki, Yasuyoshi; Iwama, Kazuo; Nishizeki, Takao; Yamashit 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 541 KB

[Lecture Notes in Computer Science] Para

[Lecture Notes in Computer Science] Parameterized and Exact Computation Volume 5917 || An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

✍ Chen, Jianer; Fomin, Fedor V. 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 220 KB

[Lecture Notes in Computer Science] SOFS

[Lecture Notes in Computer Science] SOFSEM 2010: Theory and Practice of Computer Science Volume 5901 || Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem

✍ van Leeuwen, Jan; Muscholl, Anca; Peleg, David; Pokorný, Jaroslav; Rumpe, Bernha 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 229 KB

This Book Constitutes The Refereed Proceedings Of The 36th Conference On Current Trends In Theory And Practice Of Computer Science, Sofsem 2010, Held In Špindleruv Mlýn, Czech Republic, In January 2009. The 53 Revised Full Papers, Presented Together With 11 Invited Contributions, Were Carefully Revi

[Lecture Notes in Computer Science] Sequ

[Lecture Notes in Computer Science] Sequences, Subsequences, and Consequences Volume 4893 || The Perfect Binary Sequence of Period 4 for Low Periodic and Aperiodic Autocorrelations

✍ Golomb, Solomon W.; Gong, Guang; Helleseth, Tor; Song, Hong-Yeop 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 472 KB

Solomon W. Golomb ... [et Al.] (eds.). Includes Bibliographical References And Index. Also Issued Online.