Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/dagstuhl/P8381.bht:"
download as .bib file
@proceedings{DBLP:conf/dagstuhl/2008P8381,
editor = {Peter Bro Miltersen and
R{\"{u}}diger Reischuk and
Georg Schnitger and
Dieter van Melkebeek},
title = {Computational Complexity of Discrete Problems, 14.09. - 19.09.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08381},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/portals/08381/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2008P8381.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Ben-SassonN08,
author = {Eli Ben{-}Sasson and
Jakob Nordstr{\"{o}}m},
editor = {Peter Bro Miltersen and
R{\"{u}}diger Reischuk and
Georg Schnitger and
Dieter van Melkebeek},
title = {Understanding space in resolution: optimal lower bounds and exponential
trade-offs},
booktitle = {Computational Complexity of Discrete Problems, 14.09. - 19.09.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08381},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1781/},
timestamp = {Thu, 10 Jun 2021 13:02:05 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Ben-SassonN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Hansen08,
author = {Kristoffer Arnsfelt Hansen},
editor = {Peter Bro Miltersen and
R{\"{u}}diger Reischuk and
Georg Schnitger and
Dieter van Melkebeek},
title = {Depth Reduction for Circuits with a Single Layer of Modular Counting
Gates},
booktitle = {Computational Complexity of Discrete Problems, 14.09. - 19.09.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08381},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1782/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Hansen08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/KedlayaU08,
author = {Kiran S. Kedlaya and
Christopher Umans},
editor = {Peter Bro Miltersen and
R{\"{u}}diger Reischuk and
Georg Schnitger and
Dieter van Melkebeek},
title = {Fast polynomial factorization and modular composition},
booktitle = {Computational Complexity of Discrete Problems, 14.09. - 19.09.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08381},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1777/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/KedlayaU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/LeeS08,
author = {Troy Lee and
Adi Shraibman},
editor = {Peter Bro Miltersen and
R{\"{u}}diger Reischuk and
Georg Schnitger and
Dieter van Melkebeek},
title = {Approximation norms and duality for communication complexity lower
bounds},
booktitle = {Computational Complexity of Discrete Problems, 14.09. - 19.09.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08381},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1776/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/LeeS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/MiltersenRSM08,
author = {Peter Bro Miltersen and
R{\"{u}}diger Reischuk and
Georg Schnitger and
Dieter van Melkebeek},
editor = {Peter Bro Miltersen and
R{\"{u}}diger Reischuk and
Georg Schnitger and
Dieter van Melkebeek},
title = {08381 Abstracts Collection - Computational Complexity of Discrete
Problems},
booktitle = {Computational Complexity of Discrete Problems, 14.09. - 19.09.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08381},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1779/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/MiltersenRSM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/MiltersenRSM08a,
author = {Peter Bro Miltersen and
R{\"{u}}diger Reischuk and
Georg Schnitger and
Dieter van Melkebeek},
editor = {Peter Bro Miltersen and
R{\"{u}}diger Reischuk and
Georg Schnitger and
Dieter van Melkebeek},
title = {08381 Executive Summary - Computational Complexity of Discrete Problems},
booktitle = {Computational Complexity of Discrete Problems, 14.09. - 19.09.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08381},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1778/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/MiltersenRSM08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-08-28 07:23 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
