Published in: LIPIcs, Volume 100, 9th International Conference on Fun with Algorithms (FUN 2018)
Guangqi Cui, John Dickerson, Naveen Durvasula, William Gasarch, Erik Metz, Jacob Prinz, Naveen Raman, Daniel Smolyak, and Sung Hyun Yoo. A Muffin-Theorem Generator. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 15:1-15:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{cui_et_al:LIPIcs.FUN.2018.15, author = {Cui, Guangqi and Dickerson, John and Durvasula, Naveen and Gasarch, William and Metz, Erik and Prinz, Jacob and Raman, Naveen and Smolyak, Daniel and Yoo, Sung Hyun}, title = {{A Muffin-Theorem Generator}}, booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)}, pages = {15:1--15:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-067-5}, ISSN = {1868-8969}, year = {2018}, volume = {100}, editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.15}, URN = {urn:nbn:de:0030-drops-88062}, doi = {10.4230/LIPIcs.FUN.2018.15}, annote = {Keywords: Fair Division, Theorem Generation} }
Published in: Dagstuhl Seminar Proceedings, Volume 4421, Algebraic Methods in Computational Complexity (2005)
William Gasarch and Frank Stephan. Finding Isolated Cliques by Queries – An Approach to Fault Diagnosis with Many Faults. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 4421, pp. 1-16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2005)
@InProceedings{gasarch_et_al:DagSemProc.04421.3, author = {Gasarch, William and Stephan, Frank}, title = {{Finding Isolated Cliques by Queries – An Approach to Fault Diagnosis with Many Faults}}, booktitle = {Algebraic Methods in Computational Complexity}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4421}, editor = {Harry Buhrman and Lance Fortnow and Thomas Thierauf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04421.3}, URN = {urn:nbn:de:0030-drops-1066}, doi = {10.4230/DagSemProc.04421.3}, annote = {Keywords: Isolated Cliques , Query-Complexity , Fault Diagnosis} }
Published in: Dagstuhl Seminar Proceedings, Volume 4421, Algebraic Methods in Computational Complexity (2005)
William Gasarch, James Glenn, and Andre Utis. The communication complexity of the Exact-N Problem revisited. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 4421, pp. 1-14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2005)
@InProceedings{gasarch_et_al:DagSemProc.04421.6, author = {Gasarch, William and Glenn, James and Utis, Andre}, title = {{The communication complexity of the Exact-N Problem revisited}}, booktitle = {Algebraic Methods in Computational Complexity}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4421}, editor = {Harry Buhrman and Lance Fortnow and Thomas Thierauf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04421.6}, URN = {urn:nbn:de:0030-drops-1026}, doi = {10.4230/DagSemProc.04421.6}, annote = {Keywords: Communication Complexity , Exact-N problem , Arithmetic Sequences} }
Feedback for Dagstuhl Publishing