default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid W. Krumme
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2010
[j12]Ambrose Kofi Laing, David W. Krumme:
Optimal permutation routing for low-dimensional hypercubes. Networks 55(2): 149-167 (2010)- 2008
- [j11]David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth:
Tight Bounds for Connecting Sites Across Barriers. Discret. Comput. Geom. 40(3): 377-394 (2008) - 2001
- [j10]David W. Krumme, Paraskevi Fragopoulou:
Minimum Eccentricity Multicast Trees. Discret. Math. Theor. Comput. Sci. 4(2): 157-172 (2001) - 2000
- [j9]Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards:
Multi-Source Spanning Tree Problems. J. Interconnect. Networks 1(1): 61-71 (2000) - 1998
- [j8]Jean-Claude König, David W. Krumme, Emmanuel Lazard:
Diameter-preserving orientations of the torus. Networks 32(1): 1-11 (1998) - [j7]David W. Krumme:
An Optimal Disjoint Pair of Additive Spanners for the 3D Grid. Parallel Process. Lett. 8(2): 251-258 (1998) - 1996
- [j6]David W. Krumme:
Reordered gossip schemes. Discret. Math. 156(1-3): 113-140 (1996) - 1992
- [j5]David W. Krumme, George Cybenko, K. N. Venkataraman:
Gossiping in Minimal Time. SIAM J. Comput. 21(1): 111-139 (1992) - [j4]David W. Krumme:
Fast Gossiping for the Hypercube. SIAM J. Comput. 21(2): 365-380 (1992) - 1991
- [j3]Maria D. Maggio, David W. Krumme:
A Flexible System Call Interface for Interprocessor Communication in a Distributed Memory Multicomputer. ACM SIGOPS Oper. Syst. Rev. 25(2): 4-21 (1991) - 1987
- [j2]George Cybenko, David W. Krumme, K. N. Venkataraman:
Fixed Hypercube Embedding. Inf. Process. Lett. 25(1): 35-39 (1987) - [j1]David W. Krumme:
Comments on an Example for Procedure Parameters. ACM SIGPLAN Notices 22(6): 109-111 (1987)
Conference and Workshop Papers
- 2006
- [c10]David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth:
Tight bounds for connecting sites across barriers. SCG 2006: 439-448 - 1999
- [c9]Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards:
Multi-Source Spanning Tree Problems. SIROCCO 1999: 126-136 - 1994
- [c8]David W. Krumme:
Representations of Gossip Schemes. Canada-France Conference on Parallel and Distributed Computing 1994: 251-265 - 1993
- [c7]David W. Krumme:
Algorithms and Complexity - Introduction. ICCI 1993: 2 - [c6]David W. Krumme:
Distributed Computing - Introduction. ICCI 1993: 110 - 1991
- [c5]David W. Krumme, Alva L. Couch:
Integrated debugging and performance monitoring for parallel programs. COMPSAC 1991: 317-318 - 1988
- [c4]David W. Krumme:
The SIMPLEX operating system. C³P 1988: 381-383 - 1987
- [c3]David W. Krumme, George Cybenko, Alva L. Couch:
Instrumentation for distributed computing systems. FJCC 1987: 344 - 1986
- [c2]George Cybenko, David W. Krumme, K. N. Venkataraman:
Simultaneous Broadcasting in Multiprocessor Networks. ICPP 1986: 555-558 - 1982
- [c1]David W. Krumme, David H. Ackley:
A Practical Method for Code Generation Based on Exhaustive Search. SIGPLAN Symposium on Compiler Construction 1982: 185-196
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
