|
|
|
Kontakt
Contact
Adresse:
Address
|
Johann Wolfgang Goethe-Universität
Institut für Informatik
Postfach 11 19 32
60054 Frankfurt (Main)
Germany
|
Telefon:
Phone
|
+49-69-798 28175
+49-69-798 28119 (Sekretariat Secretary)
|
|
Fax:
|
+49-69-798 28334
|
|
E-Mail:
|
hernich@informatik.uni-frankfurt.de
|
|
|
Büro:
Office
|
Raum 113 (1. Stock)
Room 113 (1st floor)
Robert-Mayer-Straße 11-15
60325 Frankfurt (Main)
Lageplan
Map
|
Sprechzeiten:
Office hours
|
Donnerstag 15-16 Uhr und immer, wenn ich da bin
Thursday 3pm-4pm, and whenever I am in my office
|
|
|
Forschungsinteressen
Fields of interest
Datenbanktheorie, Logik, deskriptive und strukturelle Komplexitätstheorie
database theory, logic, descriptive and structural complexity theory
Publikationen
Publications
| 2010 |
Answering Non-Monotonic Queries in Relational Data Exchange.
Akzeptiert für/accepted for ICDT 2010: 13th International Conference on Database Theory.
|
| 2009 |
Logic and Data Exchange: Which Solutions are "Good" Solutions?
mit/with
Nicole Schweikardt.
To appear in
G. Bonanno, B. Löwe, and W. van der Hoek, editors,
Logic and the Foundations of Game and Decision Theory (LOFT 8).
Texts in Logic and Games, Amsterdam University Press.
|
|
Lower Bounds for Processing Data with Few Random Accesses to External Memory.
mit/with
Martin Grohe,
Nicole Schweikardt.
Journal of the ACM, vol. 56(3), article 12, p. 1-58.
Special issue for selected papers from PODS 2006.
|
| 2008 |
Reversal Complexity Revisited.
mit/with
Nicole Schweikardt.
Theoretical Computer Science, vol. 401(1-3), p. 191-205.
|
| 2007 |
CWA-Solutions for Data Exchange Settings with Target Dependencies.
mit/with
Nicole Schweikardt.
PODS 2007: 26th ACM Symposium on Principles of Database Systems, p. 113-122.
|
| 2006 |
Reversal Complexity Revisited.
mit/with
Nicole Schweikardt.
ArXiV (CoRR). Superseded by article version.
arXiv:cs.CC/0608036
|
|
Randomized Computations on Large Data Sets: Tight Lower Bounds.
mit/with
Martin Grohe,
Nicole Schweikardt.
PODS 2006: 25th ACM Symposium on Principles of Database Systems, p. 243-252.
|
| 2005 |
Combining Self-Reducibility and Partial Information Algorithms.
mit/with
Arfst Nickelsen.
MFCS 2005: 30th International Symposium on Mathematical Foundations of Computer Science,
vol. 3618 of Lecture Notes in Computer Science, p. 422-434. © Springer-Verlag
|
|
Combining Self-Reducibility with Partial Information Algorithms.
Diplomarbeit/Diploma Thesis,
Technische Universität Berlin.
|
Lehre
Teaching
Links
|
