other persons with the same name:
| 2008 | ||
|---|---|---|
| 22 | EE | Thomas Neumann, Sebastian Michel: Smooth Interpolating Histograms with Error Guarantees. BNCOD 2008: 126-138 |
| 21 | EE | Guido Moerkotte, Thomas Neumann: Faster Join Enumeration for Complex Queries. ICDE 2008: 1430-1432 |
| 20 | EE | Matthias Bender, Tom Crecelius, Mouna Kacimi, Sebastian Michel, Thomas Neumann, Josiane Xavier Parreira, Ralf Schenkel, Gerhard Weikum: Exploiting social relations for query expansion and result ranking. ICDE Workshops 2008: 501-506 |
| 19 | EE | Mauro Sozio, Thomas Neumann, Gerhard Weikum: Near-optimal dynamic replication in unstructured peer-to-peer networks. PODS 2008: 281-290 |
| 18 | EE | Guido Moerkotte, Thomas Neumann: Dynamic programming strikes back. SIGMOD Conference 2008: 539-552 |
| 17 | EE | Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Thomas Neumann, Josiane Xavier Parreira, Marc Spaniol, Gerhard Weikum: Social Wisdom for Search and Recommendation. IEEE Data Eng. Bull. 31(2): 40-49 (2008) |
| 2007 | ||
| 16 | EE | Thomas Neumann, Sebastian Michel: Algebraic Query Optimization for Distributed Top-k Queries. BTW 2007: 324-343 |
| 15 | EE | Serge Autexier, Armin Fiedler, Thomas Neumann, Marc Wagner: Supporting User-Defined Notations When Integrating Scientific Text-Editors with Proof Assistance Systems. Calculemus/MKM 2007: 176-190 |
| 14 | EE | Thomas Neumann: Optimizing Ranked Retrieval. DEXA 2007: 329-338 |
| 13 | EE | Sven Helmer, Robin Aly, Thomas Neumann, Guido Moerkotte: Indexing Set-Valued Attributes with a Multi-level Extendible Hashing Scheme. DEXA 2007: 98-108 |
| 12 | EE | Klaus Berberich, Srikanta J. Bedathur, Thomas Neumann, Gerhard Weikum: A time machine for text search. SIGIR 2007: 519-526 |
| 11 | EE | Klaus Berberich, Srikanta J. Bedathur, Thomas Neumann, Gerhard Weikum: FluxCapacitor: Efficient Time-Travel Text Search. VLDB 2007: 1414-1417 |
| 10 | EE | Sebastian Michel, Thomas Neumann: Search for the Best but Expect the Worst - Distributed Top-k Queries over Decreasing Aggregated Scores. WebDB 2007 |
| 9 | EE | Thomas Neumann, Sebastian Michel: Algebraic query optimization for distributed top-k queries. Inform., Forsch. Entwickl. 21(3-4): 197-211 (2007) |
| 2006 | ||
| 8 | EE | Thomas Neumann, Sven Helmer, Guido Moerkotte: On the Optimal Ordering of Maps, Selections, and Joins Under Factorization. BNCOD 2006: 115-126 |
| 7 | EE | Thomas Neumann, Matthias Bender, Sebastian Michel, Gerhard Weikum: A Reproducible Benchmark for P2P Retrieval. ExpDB 2006: 1-8 |
| 6 | EE | Guido Moerkotte, Thomas Neumann: Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products. VLDB 2006: 930-941 |
| 2005 | ||
| 5 | EE | Thomas Neumann, Sven Helmer, Guido Moerkotte: On the Optimal Ordering of Maps and Selections under Factorization. ICDE 2005: 490-501 |
| 2004 | ||
| 4 | EE | Thomas Neumann, Guido Moerkotte: An Efficient Framework for Order Optimization. ICDE 2004: 461-472 |
| 3 | EE | Thomas Neumann, Guido Moerkotte: A Combined Framework for Grouping and Order Optimization. VLDB 2004: 960-971 |
| 2003 | ||
| 2 | EE | Sven Helmer, Thomas Neumann, Guido Moerkotte: A Robust Scheme for Multilevel Extendible Hashing. ISCIS 2003: 220-227 |
| 1 | EE | Sven Helmer, Thomas Neumann, Guido Moerkotte: Estimating the Output Cardinality of Partial Preaggregation with a Measure of Clusteredness. VLDB 2003: 656-667 |
| 1 | Robin Aly | [13] |
| 2 | Serge Autexier | [15] |
| 3 | Srikanta J. Bedathur | [11] [12] |
| 4 | Matthias Bender | [7] [20] |
| 5 | Klaus Berberich | [11] [12] |
| 6 | Tom Crecelius | [17] [20] |
| 7 | Armin Fiedler | [15] |
| 8 | Sven Helmer | [1] [2] [5] [8] [13] |
| 9 | Mouna Kacimi | [17] [20] |
| 10 | Sebastian Michel | [7] [9] [10] [16] [20] [22] |
| 11 | Guido Moerkotte | [1] [2] [3] [4] [5] [6] [8] [13] [18] [21] |
| 12 | Josiane Xavier Parreira | [17] [20] |
| 13 | Ralf Schenkel | [17] [20] |
| 14 | Mauro Sozio | [19] |
| 15 | Marc Spaniol | [17] |
| 16 | Marc Wagner | [15] |
| 17 | Gerhard Weikum | [7] [11] [12] [17] [19] [20] |