![]() | ![]() |
| 2010 | ||
|---|---|---|
| 13 | Michael Specht, Andre Osterloh: Erweiterung des Common Information Model zur Modellierung von dezentralen Energieprodukten an einem regionalen Marktplatz. GI Jahrestagung (1) 2010: 473-478 | |
| 12 | Bernhard Fechner, Andre Osterloh: A meta-level true random number generator. IJCCBS 1(1/2/3): 267-279 (2010) | |
| 2009 | ||
| 11 | Andre Osterloh: A Lower Bound for Oblivious Dimensional Routing. Euro-Par 2009: 1003-1010 | |
| 2008 | ||
| 10 | Bernhard Fechner, Andre Osterloh: A True Random Number Generator with Built-in Attack Detection. DepCoS-RELCOMEX 2008: 111-118 | |
| 9 | Andre Osterloh: Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus. TAMC 2008: 223-233 | |
| 2007 | ||
| 8 | Bernhard Fechner, Andre Osterloh: Transient Fault Detection in State-Automata. DepCoS-RELCOMEX 2007: 99-106 | |
| 2006 | ||
| 7 | Alexander Stuckenholz, Andre Osterloh: Safe component updates. GPCE 2006: 39-48 | |
| 2005 | ||
| 6 | Andre Osterloh: Optimal oblivious routing on d-dimensional meshes. Theor. Comput. Sci. 333(3): 331-346 (2005) | |
| 2003 | ||
| 5 | Andre Osterloh: Optimal Oblivious Routing On D-Dimensional Meshes. SIROCCO 2003: 275-290 | |
| 2002 | ||
| 4 | Andre Osterloh: Aspects of k-k routing in meshes and OTIS networks. Ilmenau University of Technology 2002 | |
| 2001 | ||
| 3 | Andre Osterloh: Oblivious Routing on d-Dimensional Meshes. SIROCCO 2001: 305-320 | |
| 2000 | ||
| 2 | Andre Osterloh: Sorting on the OTIS-Mesh. IPDPS 2000: 269-274 | |
| 1997 | ||
| 1 | Alfons Avermiddig, Manfred Kunde, Andre Osterloh: k-k Sorting on the Multi-Mesh. FCT 1997: 93-104 | |
| 1 | Alfons Avermiddig | [1] |
| 2 | Bernhard Fechner | [8] [10] [12] |
| 3 | Manfred Kunde | [1] |
| 4 | Michael Specht | [13] |
| 5 | Alexander Stuckenholz | [7] |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page