| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| 7 |      | Kord Eickmeyer: Non-Definability Results for Randomised First-Order Logic. CSL 2011: 218-232 |
| 6 | | Kord Eickmeyer, Martin Grohe: Randomisation and Derandomisation in Descriptive Complexity Theory Logical Methods in Computer Science 7(3): (2011) |
| 2010 | ||
| 5 | | Kord Eickmeyer, Martin Grohe: Randomisation and Derandomisation in Descriptive Complexity Theory. CSL 2010: 275-289 |
| 4 | | Kord Eickmeyer, Martin Grohe: Randomisation and Derandomisation in Descriptive Complexity Theory. Electronic Colloquium on Computational Complexity (ECCC) 17: 56 (2010) |
| 2008 | ||
| 3 | | Kord Eickmeyer, Ruriko Yoshida: The Geometry of the Neighbor-Joining Algorithm for Small Trees. AB 2008: 81-95 |
| 2 | | Kord Eickmeyer, Martin Grohe, Magdalena Grüber: Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. IEEE Conference on Computational Complexity 2008: 8-18 |
| 1 | | Kord Eickmeyer, Peter Huggins, Lior Pachter, Ruriko Yoshida: On the optimality of the neighbor-joining algorithm. Algorithms for Molecular Biology 3: (2008) |
| 1 | Martin Grohe | [2] [4] [5] [6] |
| 2 | Magdalena Grüber | [2] |
| 3 | Peter Huggins | [1] |
| 4 | Lior Pachter | [1] |
| 5 | Ruriko Yoshida | [1] [3] |
Colors in the list of coauthors
Last update Sun Feb 12 22:50:56 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page