Search dblp for Publications

export results for "toc:db/conf/dagstuhl/P6391.bht:"

 download as .bib file

@proceedings{DBLP:conf/dagstuhl/2006P6391,
  editor       = {Stephan Dahlke and
                  Klaus Ritter and
                  Ian H. Sloan and
                  Joseph F. Traub},
  title        = {Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {06391},
  publisher    = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
                  (IBFI), Schloss Dagstuhl, Germany},
  year         = {2007},
  url          = {http://drops.dagstuhl.de/portals/06391/},
  timestamp    = {Thu, 10 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/2006P6391.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dagstuhl/Barnum06,
  author       = {Howard Barnum},
  editor       = {Stephan Dahlke and
                  Klaus Ritter and
                  Ian H. Sloan and
                  Joseph F. Traub},
  title        = {Semidefinite programming characterization and spectral adversary method
                  for quantum complexity with noncommuting unitary queries},
  booktitle    = {Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {06391},
  publisher    = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
                  (IBFI), Schloss Dagstuhl, Germany},
  year         = {2006},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2007/876},
  timestamp    = {Thu, 10 Jun 2021 13:02:06 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/Barnum06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dagstuhl/DahlkeRST06,
  author       = {Stephan Dahlke and
                  Klaus Ritter and
                  Ian H. Sloan and
                  Joseph F. Traub},
  editor       = {Stephan Dahlke and
                  Klaus Ritter and
                  Ian H. Sloan and
                  Joseph F. Traub},
  title        = {06391 Abstracts Collection -- Algorithms and Complexity for Continuous
                  Problems},
  booktitle    = {Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {06391},
  publisher    = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
                  (IBFI), Schloss Dagstuhl, Germany},
  year         = {2006},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2007/878},
  timestamp    = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/DahlkeRST06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dagstuhl/MeerZ06,
  author       = {Klaus Meer and
                  Martin Ziegler},
  editor       = {Stephan Dahlke and
                  Klaus Ritter and
                  Ian H. Sloan and
                  Joseph F. Traub},
  title        = {Real Computational Universality: The Word Problem for a class of groups
                  with infinite presentation},
  booktitle    = {Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {06391},
  publisher    = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
                  (IBFI), Schloss Dagstuhl, Germany},
  year         = {2006},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2007/877},
  timestamp    = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/MeerZ06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.