From: bangerth Date: Mon, 9 Jan 2012 04:33:21 +0000 (+0000) Subject: Update ACM article. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=ef0c42f3e0d41411a8a7751c66a1b004486dca94;p=dealii-svn.git Update ACM article. git-svn-id: https://svn.dealii.org/trunk@24893 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/doc/doxygen/headers/glossary.h b/deal.II/doc/doxygen/headers/glossary.h index 3ab82c87d6..be447fff23 100644 --- a/deal.II/doc/doxygen/headers/glossary.h +++ b/deal.II/doc/doxygen/headers/glossary.h @@ -2,7 +2,7 @@ // $Id$ // Version: $Name$ // -// Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011 by the deal.II authors +// Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 by the deal.II authors // // This file is subject to QPL and may not be distributed // without copyright and license information. Please refer @@ -538,22 +538,21 @@ * DoFHandler objects. In essence, it is a guide to the parallel::distributed * namespace and the techniques used in step-40. * - * The paper is accepted for publication in the ACM Transactions on - * Mathematical Software (ACM TOMS). It is also available as - * IAMCS - * preprint 2011-187. Its current BiBTex entry is + * The full reference for the paper is as follows: * @code -TechReport{BBHK11, +@Article{BBHK11, author = {Wolfgang Bangerth and Carsten Burstedde and Timo Heister and Martin Kronbichler}, title = {Algorithms and data structures for massively parallel generic - adaptive finite element codes}, - institution = {Institute for Applied Mathematics and Computational Science, - Texas A&M University}, - year = 2010, - number = {2011-187, accepted for publication in ACM Trans. Math. Softw.} -} + adaptive finite element codes}, + journal = {ACM Trans. Math. Softw.}, + year = 2011, + volume = 38, + pages = {14/1--28}} * @endcode + * It is also available as + * IAMCS + * preprint 2011-187. * * For massively %parallel * computations, deal.II builds on the