Search the dblp DataBase
David W. Krumme :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
David W. Krumme Representations of Gossip Schemes. [Citation Graph (0, 0)][DBLP ] Canada-France Conference on Parallel and Distributed Computing, 1994, pp:251-265 [Conf ] David W. Krumme , Eynat Rafalin , Diane L. Souvaine , Csaba D. Tóth Tight bounds for connecting sites across barriers. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:439-448 [Conf ] David W. Krumme Algorithms and Complexity - Introduction. [Citation Graph (0, 0)][DBLP ] ICCI, 1993, pp:2- [Conf ] David W. Krumme Distributed Computing - Introduction. [Citation Graph (0, 0)][DBLP ] ICCI, 1993, pp:110- [Conf ] George Cybenko , David W. Krumme , K. N. Venkataraman Simultaneous Broadcasting in Multiprocessor Networks. [Citation Graph (0, 0)][DBLP ] ICPP, 1986, pp:555-558 [Conf ] David W. Krumme , David H. Ackley A Practical Method for Code Generation Based on Exhaustive Search. [Citation Graph (0, 0)][DBLP ] SIGPLAN Symposium on Compiler Construction, 1982, pp:185-196 [Conf ] Arthur M. Farley , Paraskevi Fragopoulou , David W. Krumme , Andrzej Proskurowski , Dana Richards Multi-Source Spanning Tree Problems. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1999, pp:126-136 [Conf ] David W. Krumme , Paraskevi Fragopoulou Minimum Eccentricity Multicast Trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:157-172 [Journal ] George Cybenko , David W. Krumme , K. N. Venkataraman Fixed Hypercube Embedding. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:35-39 [Journal ] Arthur M. Farley , Paraskevi Fragopoulou , David W. Krumme , Andrzej Proskurowski , Dana Richards Multi-Source Spanning Tree Problems. [Citation Graph (0, 0)][DBLP ] Journal of Interconnection Networks, 2000, v:1, n:1, pp:61-71 [Journal ] Jean-Claude König , David W. Krumme , Emmanuel Lazard Diameter-preserving orientations of the torus. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:32, n:1, pp:1-11 [Journal ] David W. Krumme An Optimal Disjoint Pair of Additive Spanners for the 3D Grid. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1998, v:8, n:2, pp:251-258 [Journal ] David W. Krumme Fast Gossiping for the Hypercube. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1992, v:21, n:2, pp:365-380 [Journal ] David W. Krumme , George Cybenko , K. N. Venkataraman Gossiping in Minimal Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1992, v:21, n:1, pp:111-139 [Journal ] Maria D. Maggio , David W. Krumme A Flexible System Call Interface for Interprocessor Communication in a Distributed Memory Multicomputer. [Citation Graph (0, 0)][DBLP ] Operating Systems Review, 1991, v:25, n:2, pp:4-21 [Journal ] David W. Krumme Comments on an Example for Procedure Parameters. [Citation Graph (0, 0)][DBLP ] SIGPLAN Notices, 1987, v:22, n:6, pp:109-111 [Journal ] David W. Krumme Reordered gossip schemes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:156, n:1-3, pp:113-140 [Journal ] Tight Bounds for Connecting Sites Across Barriers. [Citation Graph (, )][DBLP ] Search in 0.030secs, Finished in 0.031secs