Edwin Soedarmadji 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 keys2008
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdwin Soedarmadji: The Chinese Generals Problem. CISS 2008: 1042-1047
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdwin Soedarmadji: Finding the Best QoS Path in a Gilbert Channel Network. VTC Spring 2008: 2646-2650
2007
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdwin Soedarmadji, Robert J. McEliece: Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network. ICC 2007: 153-157
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdwin Soedarmadji: Worst-Case Routing Performance Metrics for Sensor Networks. PerCom Workshops 2007: 313-317
2006
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert J. McEliece, Edwin Soedarmadji: On Generalized Parity Checks. AAECC 2006: 29-34
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdwin Soedarmadji: Decentralized Decision Making in the Game of Tic-tac-toe. CIG 2006: 34-38
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdwin Soedarmadji: Optimal Routing in the Worst-Case-Error Metric. GLOBECOM 2006
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdwin Soedarmadji, Robert J. McEliece: A Dynamic Graph Algorithm for the Highly Dynamic Network Problem. PerCom Workshops 2006: 101-105
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdwin Soedarmadji: Latin hypercubes and MDS codes. Discrete Mathematics 306(12): 1232-1239 (2006)

Coauthor Index

1Robert J. McEliece [2] [5] [7]

Copyright © Wed Dec 23 18:45:02 2009 by Michael Ley (ley@uni-trier.de)