✦ LIBER ✦

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 6198 || Improved Constructions for Non-adaptive Threshold Group Testing

✍ Scribed by Abramsky, Samson; Gavoille, Cyril; Kirchner, Claude; Meyer auf der Heide, Friedhelm; Spirakis, Paul G.

Book ID: 118171681
Publisher: Springer Berlin Heidelberg
Year: 2010
Weight: 248 KB
Category: Article
ISBN: 364214165X
DOI: 10.1007/978-3-642-14165-2_47

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 6198 || Cycle Detection and Correction

✍ Abramsky, Samson; Gavoille, Cyril; Kirchner, Claude; Meyer auf der Heide, Friedh 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 221 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 3580 || Congruences for Visibly Pushdown Languages

✍ Caires, Luís; Italiano, Giuseppe F.; Monteiro, Luís; Palamidessi, Catuscia; Yung 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 175 KB

The 32nd International Colloquium On Automata, Languages And Programming (icalp 2005) Was Held In Lisbon, Portugal From July 11 To July 15, 2005. These Proceedings Contain All Contributed Papers Presented At Icalp 2005, - Getherwiththepapersbytheinvitedspeakersgiuseppecastagna(ens),leonid Libkin (to

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 154 || Rewrite methods for clausal and non-clausal theorem proving

✍ Diaz, Josep 📂 Article 📅 1983 🏛 Springer-Verlag ⚖ 783 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 2719 || Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem

✍ Baeten, Jos C. M.; Lenstra, Jan Karel; Parrow, Joachim; Woeginger, Gerhard J. 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg ⚖ 240 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 1256 || Randomization and nondeterminism are comparable for ordered read-once branching programs

✍ Degano, Pierpaolo; Gorrieri, Roberto; Marchetti-Spaccamela, Alberto 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg ⚖ 562 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 85 || The complexity of the inequivalence problem for regular expressions with intersection

✍ Bakker, Jaco; Leeuwen, Jan 📂 Article 📅 1980 🏛 Springer Berlin Heidelberg ⚖ 681 KB