@article{17981,
author = {Ziegler, Martin},
issn = {1432-4350},
journal = {Theory of Computing Systems},
pages = {177--206},
title = {{Real Hypercomputation and Continuity}},
doi = {10.1007/s00224-006-1343-6},
year = {2007},
}
@book{17448,
abstract = {Rezension: Neue Zürcher Zeitung v. 6. Juni 2007 (G. Szpiro); Ralf Bülow, “Hundert Jahre moderne Mathematik”, heise online v. 13.02.2008 (http://www.heise.de/newsticker/Hundert-Jahre-moderne-Mathematik–/meldung/103411); Mathematical Reviews 2007m:01024 (J.M. Plotkin); MAA Online 5. Juli 2007 (M. Berg); Philip J. Davis, “The Z of ZF and ZFC and ZF¬C”, SIAM News 41.1, January/February 2008; SIAM Review 50.1 (2008), 167–169; (J.W. Dawson); European Mathematical Society Newsletter June 2008, 54; The Mathematical Intelligencer 31 (2009), 79–81 (Henry E. Heatherly); Notices of the AMS 56 (2009), 823–827 (G.H. Moore); Zbl. Math. 1176.01001 (H.K. Sørensen).},
author = {Ebbinghaus, Heinz-Dieter and Peckhaus, Volker},
pages = {xiv + 356 [insbesondere Abschnitte 1.2, 2.3.1, 2.4, 2.8.4, 2.10, 2.11.4, 3.1, 3.2]},
publisher = {Springer},
title = {{Ernst Zermelo. An Approach to His Life and Work}},
year = {2007},
}
@article{18143,
author = {Le Roux, Stéphane and Ziegler, Martin},
issn = {1571-0661},
journal = {Electronic Notes in Theoretical Computer Science},
pages = {73--88},
title = {{Singular Coverings and Non-Uniform Notions of Closed Set Computability}},
doi = {10.1016/j.entcs.2008.03.009},
year = {2007},
}
@misc{18643,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1111.68301; Wiederabdruck von MR 2003d:68002]},
title = {{Vollmar, Roland, „Von Zielen und Grenzen der Informatik“, Abh. Braunschw. Wiss. Ges. 51 (2002), 9–24}},
year = {2007},
}
@inproceedings{18655,
abstract = {We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It is believed that almost all, even very simple graph properties require a large complexity to be tested for arbitrary (bounded degree) graphs. Therefore in this paper we focus our attention on testing graph properties for special classes of graphs. We call a graph family non-expanding if every graph in this family is not a weak expander (its expansion is O(1/log2 n), where n is the graph size). A graph family is hereditary if it is closed under vertex removal. Similarly, a graph property is hereditary if it is closed under vertex removal. Next, we call a graph property Π to be testable for a graph family F if for every graph G ε F, in time independent of the size of G we can distinguish between the case when G satisfies property Π and when it is far from every graph satisfying property Π. In this paper we prove thatIn the bounded degree graph model, any hereditary property is testable if the input graph belongs to a hereditary and non-expanding family of graphs.As an application, our result implies that, for example, any hereditary property (e.g., k-colorability, H-freeness, etc.) is testable in the bounded degree graph model for planar graphs, graphs with bounded genus, interval graphs, etc. No such results have been known before and prior to our work, in the bounded degree graph model very few graph properties have been known to be testable for any graph classes.},
author = {Sohler, Christian and Czumaj, Artur},
booktitle = {Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA'07)},
isbn = {9780898716245},
pages = {494--501},
title = {{On Testable Properties in Bounded Degree Graphs}},
year = {2007},
}
@misc{18650,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1123.01019]},
title = {{Bolzano, Bernard, Briefe an Josef Sommer und andere (1812–1848), hg. v. Jan Berg, Frommann-Holzboog: Stuttgart-Bad Cannstatt 2005 (Bernard Bolzano-Gesamtausgabe, III.5.1)}},
year = {2007},
}
@inproceedings{18662,
author = {Sohler, Christian and Czumaj, Artur},
booktitle = {Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07)},
pages = {536--548},
title = {{Small Space Representations for Metric Min-Sum k-Clustering and their Applications}},
year = {2007},
}
@misc{18821,
author = {Peckhaus, Volker},
booktitle = {Mathematical Reviews [MR 2007a:03002]},
title = {{De Mol, Liesbeth, “Closing the Circle: An Analysis of Emil Post’s Early Work”, Bulletin of Symbolic Logic 12 (2006), 267–289}},
year = {2007},
}
@book{19007,
author = {Eke, Norbert Otto},
pages = {296},
publisher = {Erich Schmidt},
title = {{Wort/Spiele. Drama – Film – Literatur}},
year = {2007},
}
@phdthesis{18927,
author = {Dynia, Miroslaw},
isbn = {978-3-942647-03-8},
title = {{Collective graph exploration}},
year = {2007},
}