@article{18599,
abstract = {This paper investigates the influence of the basis set on the GW self-energy correction in the full-potential linearized augmented-plane-wave (LAPW) approach and similar linearized all-electron methods. A systematic improvement is achieved by including local orbitals that are defined as second and higher energy derivatives of solutions to the radial scalar-relativistic Dirac equation and thus constitute a natural extension of the LAPW basis set. Within this approach linearization errors can be eliminated, and the basis set becomes complete. While the exchange contribution to the self-energy is little affected by the increased basis-set flexibility, the correlation contribution benefits from the better description of the unoccupied states, as do the quasiparticle energies. The resulting band gaps remain relatively unaffected, however; for Si we find an increase of 0.03 eV.},
author = {Friedrich, Christoph and Schindlmayr, Arno and Blügel, Stefan and Kotani, Takao},
issn = {1550-235X},
journal = {Physical Review B},
number = {4},
title = {{Elimination of the linearization error in GW calculations based on the linearized augmented-plane-wave method}},
doi = {10.1103/physrevb.74.045104},
volume = {74},
year = {2006},
}
@inproceedings{18676,
abstract = {We present random sampling algorithms that with probability at least 1 - δ compute a (1 ± ǫ)- approximation of the clustering coefficient, the transitiv ity coefficient, and of the number of bipartite cliques in a graph given as a stream of edges. Our methods can be extended to approximately count the number of occurences of fixed constant-size subgraphs. Our a lgorithms only require one pass over the input stream and their storage space depends only on structural parameters of the graphs, the approxi- mation guarantee, and the confidence probability. For examp le, the algorithms to compute the clustering and transitivity coefficient depend on that coefficient but n ot on the size of the graph. Since many large social networks have small clustering and transitivity coe fficient, our algorithms use space independent of the size of the input for these graphs. We implemented our algorithms and evaluated their performance on networks from different appli- cation domains. The sizes of the considered input graphs varied from about 8, 000 nodes and 40, 000 edges to about 135 million nodes and more than 1 billion edges. For both algorithms we run experiments with a sample set size varying from 100, 000 to 1, 000, 000 to evaluate running time and approximation guarantee. Our algorithms appear to be time efficient for the se sample sizes.},
author = {Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana},
booktitle = {Proceedings of the European Conference on Complex Systems (ECCS'06)},
title = {{Computing Clustering Coefficients in Data Streams}},
year = {2006},
}
@inproceedings{18746,
abstract = {In this paper, we present a randomized constant factor approximation
algorithm for the metric minimum facility location problem with uniform
costs and demands in a distributed setting, in which every point can
open a facility. In particular, our distributed algorithm uses three
communication rounds with message sizes bounded to O(log n) bits where
n is the number of points. We also extend our algorithm to constant
powers of metric spaces, where we also obtain a randomized constant
factor approximation algorithm.},
author = {Sohler, Christian and Gehweiler, Joachim and Lammersen, Christiane},
booktitle = {Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
title = {{A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem}},
year = {2006},
}
@misc{18816,
author = {Peckhaus, Volker},
booktitle = {Mathematical Reviews [MR 2006b:03008; MathSciNet MR2139368]},
title = {{Martin, Donald A., “Gödel’s Conceptual Realism”, Bulletin of Symbolic Logic 11 (2005), 207–224}},
year = {2006},
}
@inbook{19345,
author = {Eke, Norbert Otto},
booktitle = {Die deutsche Tragödie. Neue Lektüren einer Gattung im europäischen Kontext},
editor = {Dörr, Volker C. and Schneider, Helmut J.},
pages = {235--254},
publisher = {Aisthesis},
title = {{Furcht und Schrecken im Theater der Erinnerung oder „Man sollte Komödien schreiben / Leben in diesem trüben Menschenbrei“. Heiner Müllers Tragödie}},
year = {2006},
}
@article{19340,
author = {Eke, Norbert Otto and Allkemper, Alo},
journal = {Zeitschrift für deutsche Philologie 125, Sonderheft: Das Gedächtnis der Literatur. Konstitutionsformen des Vergangenen in der Literatur des 20. Jahrhunderts},
pages = {2--4},
publisher = {Erich Schmidt, Berlin},
title = {{Das Gedächtnis der Literatur. Zur Einführung}},
year = {2006},
}
@misc{19484,
author = {Eke, Norbert Otto},
booktitle = {Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik},
editor = {Brunner, Horst and Moritz, Rainer},
pages = {74--79},
publisher = {Erich Schmidt},
title = {{DDR-Literatur}},
year = {2006},
}
@article{19698,
author = {Büker, Petra},
journal = {Beiträge Jugendliteratur und Medien },
number = {H. 2},
pages = {104--111},
title = {{Hier kommt Lola! Die unkonventionelle bikulturelle Familie in Isabel Abedis neuer Kinderbuchreihe}},
volume = {58, H. 2},
year = {2006},
}
@misc{19718,
author = {Degener, Bastian},
title = {{Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen}},
year = {2006},
}
@inproceedings{19838,
author = {Rührup, Stefan and Schindelhauer, Christian},
booktitle = {Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)},
isbn = {9783540496946},
issn = {0302-9743},
title = {{Online Multi-path Routing in a Maze}},
doi = {10.1007/11940128_65},
year = {2006},
}