| 2008 |
|---|
| 49 | EE | Douglas Comer,
Maxim Martynov:
Design and Analysis of Hybrid Packet Schedulers.
INFOCOM 2008: 897-905 |
| 2006 |
|---|
| 48 | | Douglas Comer,
Maxim Martynov:
Building experimental virtual routers with network processors.
TRIDENTCOM 2006 |
| 2000 |
|---|
| 47 | | Douglas Comer:
Internetworking with TCP/IP - Principles, Protocols, and Architectures, Fourth Edition
Prentice-Hall 2000 |
| 46 | | Douglas Comer:
Keeping up with the pace of rapid change - Editorial.
Software Focus 1(1): 5 (2000) |
| 1998 |
|---|
| 45 | | Mikhail J. Atallah,
Douglas Comer:
Algorithms for Variable Length Subnet Address Assignment.
IEEE Trans. Computers 47(6): 693-699 (1998) |
| 1994 |
|---|
| 44 | | Douglas Comer,
John C. Lin:
Probing TCP Implementations.
USENIX Summer 1994: 245-255 |
| 1990 |
|---|
| 43 | | Douglas Comer,
Rajendra Yavatkar:
A Rate-Based Congestion Avoidance and Control Scheme for Packet Switched Networks.
ICDCS 1990: 390-397 |
| 42 | EE | Douglas Comer,
Ralph E. Droms:
Uniform Access to Internet Directory Services.
SIGCOMM 1990: 50-59 |
| 41 | EE | Douglas Comer,
Rajendra Yavatkar:
High-speed propagation of link status routing control information.
SPDP 1990: 190-194 |
| 40 | | Douglas Comer,
Jim Griffioen:
A New Design for Distributed Systems: The Remote Memory Model.
USENIX Summer 1990: 127-136 |
| 39 | | Douglas Comer,
Ralph E. Droms,
Thomas P. Murtagh:
An Experimental Implementation of the Tilde Naming System.
Computing Systems 3(4): 487-515 (1990) |
| 1989 |
|---|
| 38 | | Douglas Comer,
Rajendra Yavatkar:
FLOWS: Performance Guarantees in Best Effort Delivery Systems.
INFOCOM 1989: 100-109 |
| 37 | | Peter J. Denning,
Douglas Comer,
David Gries,
Michael C. Mulder,
Allen B. Tucker,
A. Joe Turner,
Paul R. Young:
Computing as a Discipline.
Commun. ACM 32(1): 9-23 (1989) |
| 36 | | Douglas Comer,
Larry L. Peterson:
Understanding Naming in Distributed Systems.
Distributed Computing 3(2): 51-60 (1989) |
| 35 | | Peter J. Denning,
Douglas Comer,
David Gries,
Michael C. Mulder,
Allen B. Tucker,
A. Joe Turner,
Paul R. Young:
Computing as a Discipline.
IEEE Computer 22(2): 63-70 (1989) |
| 1988 |
|---|
| 34 | | Douglas Comer,
Jim Griffioen,
Rajendra Yavatkar:
Shadow Editing: A Distributed Service for Supercomputer Access.
ICDCS 1988: 215-221 |
| 33 | EE | Peter J. Denning,
Douglas Comer,
David Gries,
Michael C. Mulder,
Allen B. Tucker,
A. Joe Turner,
Paul R. Young:
Computing as a discipline: preliminary report of the ACM task force on the core of computer science.
SIGCSE 1988: 41 |
| 32 | | Douglas Comer,
Thomas Narten:
UNIX Systems as Cypress Implets.
USENIX Winter 1988: 55-62 |
| 1987 |
|---|
| 31 | | Douglas Comer,
Thomas Narten,
Rajendra Yavatkar:
The Cypress Coaxial Backbone Packet Switch.
Computer Networks 14: 383-388 (1987) |
| 30 | | James D. Arthur,
Douglas Comer:
An Interactive Environment for Tool Selection, Specification and Composition.
International Journal of Man-Machine Studies 26(5): 581-595 (1987) |
| 1986 |
|---|
| 29 | EE | Richard D. Edmiston,
Douglas Comer,
Deborah Estrin:
CSNET (panel session): using inter-organization networks to support research and advanced development in computer science.
ACM Conference on Computer Science 1986: 391-392 |
| 28 | EE | Douglas Comer,
Ralph E. Droms:
The TILDE naming system: an experiment in relative naming.
ACM SIGOPS European Workshop 1986 |
| 27 | | Douglas Comer,
Thomas P. Murtagh:
The Tilde File Naming Scheme.
ICDCS 1986: 509-514 |
| 26 | | Douglas Comer,
Larry L. Peterson:
A Model of Name Resolution in Distributed Systems.
ICDCS 1986: 523-530 |
| 25 | EE | Douglas Comer,
Larry L. Peterson:
Conversation-Based Mail.
ACM Trans. Comput. Syst. 4(4): 299-319 (1986) |
| 1985 |
|---|
| 24 | EE | Douglas Comer,
Larry L. Peterson:
Issues in using DARPA domain names for computer mail.
SIGCOMM 1985: 158-164 |
| 23 | EE | Vinton G. Cerf,
D. Clark,
Douglas Comer,
Larry L. Peterson,
Douglas B. Terry:
DARPA interdomain addressing (panel session, title only).
SIGCOMM 1985: 71 |
| 22 | EE | Douglas Comer:
Domain names: hierarchy in need of organization (panel session, abstract only).
SIGCOMM 1985: 72 |
| 21 | | Douglas Comer,
Narain H. Gehani:
Flex: A High-Level Language for Specifying Customized Microprocessors.
IEEE Trans. Software Eng. 11(4): 387-396 (1985) |
| 1983 |
|---|
| 20 | | Douglas Comer:
The Computer Science Research Network CSNET: A History and Status Report.
Commun. ACM 26(10): 747-753 (1983) |
| 19 | | Douglas Comer:
Effects of Updates on Optimality in Tries.
J. Comput. Syst. Sci. 26(1): 1-13 (1983) |
| 18 | | Douglas Comer:
The Costs an Benefits of Lazy Interactive Input in Pascal.
Softw., Pract. Exper. 13(3): 287-293 (1983) |
| 1982 |
|---|
| 17 | | Douglas Comer,
Michael J. O'Donnell:
Geometric Problems with Application to Hashing.
SIAM J. Comput. 11(2): 217-226 (1982) |
| 16 | | Douglas Comer:
The Flat File System FFG: A Database System Consisting of Primitives.
Softw., Pract. Exper. 12(10): 1069-1079 (1982) |
| 15 | | Douglas Comer,
Keith Williamson:
An Alternative to Young's Module Facility for Pascal.
Softw., Pract. Exper. 12(10): 907-913 (1982) |
| 14 | | Douglas Comer,
Vincent Yun Shen:
Hash-Bucket Search: A Fast Technique for Searching an English Spelling Dictionary.
Softw., Pract. Exper. 12(7): 669-682 (1982) |
| 1981 |
|---|
| 13 | EE | Douglas Comer:
Analysis of a Heuristic for Trie Minimization.
ACM Trans. Database Syst. 6(3): 513-537 (1981) |
| 12 | | Douglas Comer:
Principles of Program Design Induced from Experience with Small Public Programs.
IEEE Trans. Software Eng. 7(2): 169-174 (1981) |
| 1980 |
|---|
| 11 | EE | Douglas Comer:
Extracting unique rows of a bounded degree array using tries.
AFIPS National Computer Conference 1980: 807-809 |
| 10 | EE | Douglas Comer:
A Note on Median Split Trees.
ACM Trans. Program. Lang. Syst. 2(1): 129-133 (1980) |
| 1979 |
|---|
| 9 | EE | Douglas Comer:
The Ubiquitous B-Tree.
ACM Comput. Surv. 11(2): 121-137 (1979) |
| 8 | EE | Douglas Comer:
Surveyor's Forum: The Tree Branches.
ACM Comput. Surv. 11(4): 412 (1979) |
| 7 | EE | Douglas Comer:
Heuristics for Trie Index Minimization.
ACM Trans. Database Syst. 4(3): 383-395 (1979) |
| 6 | | Douglas Comer,
Maurice H. Halstead:
A Simple Experiment in Top-Down Design.
IEEE Trans. Software Eng. 5(2): 105-109 (1979) |
| 5 | | Douglas Comer:
MAP: A Pascal Macro Preprocessor for Large Program Development.
Softw., Pract. Exper. 9(3): 203-209 (1979) |
| 1978 |
|---|
| 4 | EE | Douglas Comer:
The Difficulty of Optimum Index Selection.
ACM Trans. Database Syst. 3(4): 440-445 (1978) |
| 3 | | Douglas Comer:
MOUSE4: An Improved Implementation of the RATFOR Preprocessor.
Softw., Pract. Exper. 8(1): 35-40 (1978) |
| 1977 |
|---|
| 2 | EE | Douglas Comer,
Ravi Sethi:
The Complexity of Trie Index Construction.
J. ACM 24(3): 428-440 (1977) |
| 1976 |
|---|
| 1 | | Douglas Comer,
Ravi Sethi:
Complexity of Trie Index Construction (Extended Abstract)
FOCS 1976: 197-207 |
