Andre Osterloh Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndre Osterloh: A Lower Bound for Oblivious Dimensional Routing. Euro-Par 2009: 1003-1010
2008
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndre Osterloh: Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus. TAMC 2008: 223-233
2007
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBernhard Fechner, Andre Osterloh: Transient Fault Detection in State-Automata. DepCoS-RELCOMEX 2007: 99-106
2006
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander Stuckenholz, Andre Osterloh: Safe component updates. GPCE 2006: 39-48
2005
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndre Osterloh: Optimal oblivious routing on d-dimensional meshes. Theor. Comput. Sci. 333(3): 331-346 (2005)
2003
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndre Osterloh: Optimal Oblivious Routing On D-Dimensional Meshes. SIROCCO 2003: 275-290
2001
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndre Osterloh: Oblivious Routing on d-Dimensional Meshes. SIROCCO 2001: 305-320
2000
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndre Osterloh: Sorting on the OTIS-Mesh. IPDPS 2000: 269-274
1997
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlfons Avermiddig, Manfred Kunde, Andre Osterloh: k-k Sorting on the Multi-Mesh. FCT 1997: 93-104

Coauthor Index

1Alfons Avermiddig [1]
2Bernhard Fechner [7]
3Manfred Kunde [1]
4Alexander Stuckenholz [6]

Colors in the list of coauthors

Copyright © Sat Nov 28 20:06:51 2009 by Michael Ley (ley@uni-trier.de)