Published in: LIPIcs, Volume 67, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017)
Jon Schneider, Ariel Schvartzman, and S. Matthew Weinberg. Condorcet-Consistent and Approximately Strategyproof Tournament Rules. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 67, pp. 35:1-35:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{schneider_et_al:LIPIcs.ITCS.2017.35, author = {Schneider, Jon and Schvartzman, Ariel and Weinberg, S. Matthew}, title = {{Condorcet-Consistent and Approximately Strategyproof Tournament Rules}}, booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)}, pages = {35:1--35:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-029-3}, ISSN = {1868-8969}, year = {2017}, volume = {67}, editor = {Papadimitriou, Christos H.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.35}, URN = {urn:nbn:de:0030-drops-81605}, doi = {10.4230/LIPIcs.ITCS.2017.35}, annote = {Keywords: Tournament design, Non-manipulability, Condorcet-consistent, Strategyproofness} }
Published in: LIPIcs, Volume 79, 32nd Computational Complexity Conference (CCC 2017)
Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, and Troy Lee. Separating Quantum Communication and Approximate Rank. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 24:1-24:33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{anshu_et_al:LIPIcs.CCC.2017.24, author = {Anshu, Anurag and Ben-David, Shalev and Garg, Ankit and Jain, Rahul and Kothari, Robin and Lee, Troy}, title = {{Separating Quantum Communication and Approximate Rank}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {24:1--24:33}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.24}, URN = {urn:nbn:de:0030-drops-75303}, doi = {10.4230/LIPIcs.CCC.2017.24}, annote = {Keywords: Communication Complexity, Quantum Computing, Lower Bounds, logrank, Quantum Information} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Ben-David Shalev and Robin Kothari. Randomized Query Complexity of Sabotaged and Composed Functions. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 60:1-60:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{shalev_et_al:LIPIcs.ICALP.2016.60, author = {Shalev, Ben-David and Kothari, Robin}, title = {{Randomized Query Complexity of Sabotaged and Composed Functions}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {60:1--60:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.60}, URN = {urn:nbn:de:0030-drops-62233}, doi = {10.4230/LIPIcs.ICALP.2016.60}, annote = {Keywords: Randomized query complexity, decision tree complexity, composition theorem, partition bound, lifting theorem} }
Published in: Dagstuhl Seminar Proceedings, Volume 7081, End-User Software Engineering (2007)
Robin Abraham and Martin Erwig. Exploiting Domain-Specific Structures For End-User Programming Support Tools. In End-User Software Engineering. Dagstuhl Seminar Proceedings, Volume 7081, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{abraham_et_al:DagSemProc.07081.16, author = {Abraham, Robin and Erwig, Martin}, title = {{Exploiting Domain-Specific Structures For End-User Programming Support Tools}}, booktitle = {End-User Software Engineering}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7081}, editor = {Margaret H. Burnett and Gregor Engels and Brad A. Myers and Gregg Rothermel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07081.16}, URN = {urn:nbn:de:0030-drops-10862}, doi = {10.4230/DagSemProc.07081.16}, annote = {Keywords: Spreadsheet, program analysis} }
Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)
Heinz Mühlenbein and Robin Höns. The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{muhlenbein_et_al:DagSemProc.06061.9, author = {M\"{u}hlenbein, Heinz and H\"{o}ns, Robin}, title = {{The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--27}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6061}, editor = {Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.9}, URN = {urn:nbn:de:0030-drops-5973}, doi = {10.4230/DagSemProc.06061.9}, annote = {Keywords: Junction tree, minimum relative entropy, maximum likelihood, Bethe-Kikuchi approximation} }
Published in: Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
Chris God, Achim Jung, Robin Knight, and Ralph Kopperman. Auxiliary relations and sandwich theorems. In Spatial Representation: Discrete vs. Continuous Computational Models. Dagstuhl Seminar Proceedings, Volume 4351, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{god_et_al:DagSemProc.04351.8, author = {God, Chris and Jung, Achim and Knight, Robin and Kopperman, Ralph}, title = {{Auxiliary relations and sandwich theorems}}, booktitle = {Spatial Representation: Discrete vs. Continuous Computational Models}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4351}, editor = {Ralph Kopperman and Michael B. Smyth and Dieter Spreen and Julian Webster}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.8}, URN = {urn:nbn:de:0030-drops-1348}, doi = {10.4230/DagSemProc.04351.8}, annote = {Keywords: Adjoint , auxiliary relation , continuous poset , pairwise completely regular (and pairwise normal) bitopological space , upper (lower) semicontinuous Urysohn relation} }
Feedback for Dagstuhl Publishing