Published in: LIPIcs, Volume 143, 19th International Workshop on Algorithms in Bioinformatics (WABI 2019)
Nathan L. Clement. Quantified Uncertainty of Flexible Protein-Protein Docking Algorithms. In 19th International Workshop on Algorithms in Bioinformatics (WABI 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 143, pp. 3:1-3:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{clement:LIPIcs.WABI.2019.3, author = {Clement, Nathan L.}, title = {{Quantified Uncertainty of Flexible Protein-Protein Docking Algorithms}}, booktitle = {19th International Workshop on Algorithms in Bioinformatics (WABI 2019)}, pages = {3:1--3:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-123-8}, ISSN = {1868-8969}, year = {2019}, volume = {143}, editor = {Huber, Katharina T. and Gusfield, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2019.3}, URN = {urn:nbn:de:0030-drops-110335}, doi = {10.4230/LIPIcs.WABI.2019.3}, annote = {Keywords: protein-protein docking, uncertainty quantification, protein flexibility, low-discrepancy sampling, high-dimensional sampling} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Venkatesan Guruswami and Carol Wang. Deletion Codes in the High-noise and High-rate Regimes. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 867-880, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{guruswami_et_al:LIPIcs.APPROX-RANDOM.2015.867, author = {Guruswami, Venkatesan and Wang, Carol}, title = {{Deletion Codes in the High-noise and High-rate Regimes}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {867--880}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.867}, URN = {urn:nbn:de:0030-drops-53417}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.867}, annote = {Keywords: algorithmic coding theory, deletion codes, list decoding, probabilistic method, explicit constructions} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Michael A. Forbes and Venkatesan Guruswami. Dimension Expanders via Rank Condensers. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 800-814, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{forbes_et_al:LIPIcs.APPROX-RANDOM.2015.800, author = {Forbes, Michael A. and Guruswami, Venkatesan}, title = {{Dimension Expanders via Rank Condensers}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {800--814}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.800}, URN = {urn:nbn:de:0030-drops-53379}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.800}, annote = {Keywords: dimension expanders, rank condensers, rank-metric codes, subspace designs, Wronskians} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Alan Guo and Madhu Sudan. List Decoding Group Homomorphisms Between Supersolvable Groups. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 737-747, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{guo_et_al:LIPIcs.APPROX-RANDOM.2014.737, author = {Guo, Alan and Sudan, Madhu}, title = {{List Decoding Group Homomorphisms Between Supersolvable Groups}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {737--747}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.737}, URN = {urn:nbn:de:0030-drops-47359}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.737}, annote = {Keywords: Group theory, error-correcting codes, locally decodable codes} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Venkatesan Guruswami and Carol Wang. Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 748-761, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{guruswami_et_al:LIPIcs.APPROX-RANDOM.2014.748, author = {Guruswami, Venkatesan and Wang, Carol}, title = {{Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {748--761}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.748}, URN = {urn:nbn:de:0030-drops-47361}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.748}, annote = {Keywords: list-decoding, pseudorandomness, algebraic coding, explicit constructions} }
Feedback for Dagstuhl Publishing