 | 2012 |
| 14 |  | Georg Gottlob,
André Hernich,
Clemens Kupke,
Thomas Lukasiewicz:
Equality-Friendly Well-Founded Semantics and Applications to Description Logics.
Description Logics 2012 |
| 2011 |
| 13 |  | Martin Grohe,
Berit Grußien,
André Hernich,
Bastian Laubner:
L-Recursion and a new Logic for Logarithmic Space.
CSL 2011: 277-291 |
| 12 |  | André Hernich,
Leonid Libkin,
Nicole Schweikardt:
Closed world data exchange.
ACM Trans. Database Syst. 36(2): 14 (2011) |
| 11 |  | André Hernich:
Answering Non-Monotonic Queries in Relational Data Exchange
Logical Methods in Computer Science 7(3): (2011) |
| 2010 |
| 10 |  | André Hernich:
Answering non-monotonic queries in relational data exchange.
ICDT 2010: 143-154 |
| 9 |  | André Hernich:
Foundations of query answering in relational data exchange.
Goethe University Frankfurt am Main 2010: 1-217 |
| 2009 |
| 8 |  | Martin Grohe,
André Hernich,
Nicole Schweikardt:
Lower bounds for processing data with few random accesses to external memory.
J. ACM 56(3): (2009) |
| 2008 |
| 7 |  | André Hernich,
Nicole Schweikardt:
Logic and Data Exchange: Which Solutions Are "Good" Solutions?
LOFT 2008: 61-85 |
| 6 |  | André Hernich,
Nicole Schweikardt:
Reversal complexity revisited.
Theor. Comput. Sci. 401(1-3): 191-205 (2008) |
| 2007 |
| 5 |  | André Hernich,
Nicole Schweikardt:
CWA-solutions for data exchange settings with target dependencies.
PODS 2007: 113-122 |
| 4 |  | Martin Grohe,
André Hernich,
Nicole Schweikardt:
Randomized Computations on Large Data Sets: Tight Lower Bounds
CoRR abs/cs/0703081: (2007) |
| 2006 |
| 3 |  | Martin Grohe,
André Hernich,
Nicole Schweikardt:
Randomized computations on large data sets: tight lower bounds.
PODS 2006: 243-252 |
| 2 |  | André Hernich,
Nicole Schweikardt:
Reversal Complexity Revisited
CoRR abs/cs/0608036: (2006) |
| 2005 |
| 1 |  | André Hernich,
Arfst Nickelsen:
Combining Self-reducibility and Partial Information Algorithms.
MFCS 2005: 483-494 |