| RFC 5681: TCP Congestion Control | M. Allman, V. Paxson, and E. Blanton | Request for Comments 5681, Proposed Standard | September 2009 | Networking | [PDF]
|
| RFC 5690: Adding Acknowledgement Congestion Control to TCP | S. Floyd, A. Arcia, D. Ros, and J. Iyengar | Request for Comments 5690, Informational | February 2010 | Networking | [PDF]
|
| RFC 5827: Early Retransmit for TCP and SCTP | M. Allman, K. Avrachenkov, U. Ayesta, J. Blanton, and P. Hurtig | Request for Comments 5827, Experimental | April 2010 | Networking | [PDF]
|
| Enhancing TCP Over Satellite Channels Using Standard Mechanisms. | M. Allman, D. Glover, and L. Sanchez | Request forComments 2488, BCP 28, January 1999. | January 1999 | Networking | |
| Brains and Robots, Two Weak Attempts at the Grand Synthesis | J.A. Feldman | Review for Cognition and Brain Theory | 1984 | AI | |
| Discussing Frame Semantics: The State of the Art. An Interview with Charles J. Fillmore | J. Andor | Review of Cognitive Linguistics, Vol. 8, No. 1, pp. 157-176 | August 2010 | AI | [PDF]
|
| Machine Intelligence | J.A. Feldman | Review of Numbers I, III of the Machine Intelligence Series, in Information and Control, Vol. 14, pp. 490-492 | 1969 | AI | |
| RFC 2018: TCP Selective Acknowledgment Options | M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow | RFC 2018, Proposed Standard | April 1996 | Networking | |
| Framework for IP Performance Metrics | V. Paxson, G. Almes, J. Mahdavi, and M. Mathis. | RFC 2330, Informational | May 1998 | Networking | |
| IETF Criteria for Evaluating Reliable Multicast Transport and Application Protocols | A. Mankin, A. Romanow, S. Bradner, and V. Paxson | RFC 2357, Informational | June 1998 | Networking | |
| FTP Extensions for IPv6 and NATs | M. Allman, S. Ostermann and C. Metz | RFC 2428 | September 1998 | Networking | |
| RFC 2914: Congestion Control Principles | S. Floyd | RFC 2914, Best Current Practice | September 2000 | Networking | [PDF]
|
| RFC 3042: Enhancing TCP's Loss Recovery Using Limited Transmit | M. Allman, H. Balakrishnan, and S. Floyd | RFC 3042, Proposed Standard, January 2001 | January 2001 | Networking | |
| A Framework for Defining Empirical Bulk Transfer Capacity Metrics | M. Mathis and M. Allman | RFC 3148. July 2001. | July 2001 | Networking | |
| RFC 3168: The Addition of Explicit Congestion Notification (ECN) to IP | K.K. Ramakrishnan, S. Floyd, and D. Black | RFC 3168, Proposed Standard, September 2001. | September 2001 | Networking | |
| RFC 3238: IAB Architectural and Policy Considerations for Open Pluggable Edge Services | S. Floyd and L. Daigle, editors | RFC 3238, Informational, January 2002. Also an excerpt, the ISOC Member Briefing #5 on OPES. | January 2002 | Networking | [PDF]
|
| RFC 3390: Increasing TCP's Initial Window | M. Allman, S. Floyd, and C. Partridge | RFC 3390, October 2002. Proposed Standard. Obsoletes RFC 2414 (Experimental). | October 2002 | Networking | [PDF]
|
| RFC 3448: TCP Friendly Rate Control (TFRC): Protocol Specification | M. Handley, S. Floyd, J. Pahdye, and J. Widmer | RFC 3448, Proposed Standard | January 2003 | Networking | [PDF]
|
| TCP Congestion Control with Appropriate Byte Counting (ABC) | M. Allman | RFC 3465 | February 2003 | Networking | |
| A Conservative Selective Acknowledgment (SACK)-Based Loss Recovery Algorithm for TCP | E. Blanton, M. Allman, K. Fall, and L. Wang | RFC 3517 | April 2003 | Networking | |
| RFC 3869: IAB Concerns & Recommendations Regarding Internet Research & Evolution | R. Atkinson and S. Floyd | RFC 3869 | August 2004 | Networking | [PDF]
|
| RFC 4336: Problem Statement for the Datagram Congestion Control Protocol (DCCP) | S. Floyd, M. Handley, and E. Kohler | RFC 4336, Informational | March 2006 | Networking | [PDF]
|
| RFC 4828: TCP Friendly Rate Control (TFRC): the Small-Packet (SP) Variant | S. Floyd and E. Kohler | RFC 4828, Experimental | April 2007 | Networking | [PDF]
|
| RFC 5166: Metrics for the Evaluation of Congestion Control Mechanisms | S. Floyd | RFC 5166, Information, March 2008 | March 2008 | Networking | [PDF]
|
| Computing TCP's Retransmission Timer | V. Paxson, M. Allman, J. Chu, and M. Sargent | RFC 6298 | June 2011 | Networking | [PDF]
|
| ONS Security | B. Fabian, O. Günther, and S. Spiekermann | RFID Handbook: Applications, Technology, Security, and Privacy, S. Ahson and M. Ilyas, eds., CRC Press | 2008 | Other | |
| Recovering Coherent Interpretations Using Semantic Integration of Partial Parses | J. Bryant | ROMAND: Robust Methods in Analysis of Natural language Data (Coling 2004), Geneva, Switzerland | August 2004 | AI | |
| The ICSI/SRI/UW RT04 Structural Metadata Extraction System | Y. Liu, E. Shriberg, A. Stolcke, B. Peskin, and M. Harper | RT-04 EARS Workshop | January 2004 | Speech | |
| The Manycore Revolution: Will HPC Lead or Follow? | J. Shalf, K. Asanović, D. Patterson, K. Keutzer, T. Mattson, and K. Yelick | SciDAC Review, No. 14, pp. 40-49, Fall 2009 | 2009 | Architecture | [PDF]
|
| Cognition as Search: review of Unified Theories of Cognition, (by Allen Newell, Harvard University Press, Cambridge, MA, 1990) | J.A. Feldman | Science, Vol. 251, No. 2, p. 575 | February 1991 | AI | |
| Infants learning algebraic rules | L. Shastri | Science, Vol. 285, Issue 5434, pp. 1673 | September 1999 | AI | |
| Whole-Genome Patterns of Common DNA Variation in Three Human Populations | D. A. Hinds, L. L. Stuve, G. B. Nilsen, E. Halperin, E. Eskin, D. G. Ballinger, K. A. Frazer, and D. R. Cox | Science, Vol. 307, No. 5712, pp. 1072-1079. DOI:10.1126/science.1105436 | February 2005 | Algorithms | [PDF]
|
| Identifying Personal Genomes by Surname Inference | M. Gymrek, A. L. McGuire, D. Golan, E. Halperin, and Y. Erlich | Science, Vol. 339, No. 6117, pp. 321-324 | January 2013 | Algorithms | |
| Programming Languages | J.A. Feldman | Scientific American, Vol. 241, No. 6 | December 1979 | AI | |
| Load Balancing in Structured P2P Systems | A. Rao, K. Lakshminarayanan, S. Surana, R.M. Karp, and I. Stoica | Second International Workshop on Peer-to-Peer Systems | 2003 | Algorithms | |
| Structured Connectionist Models and Language Learning | J.A. Feldman | Selected Readings of the Swedish Conference on Connectionism, Ellis Horwood Ltd. Publishers. Also published in AI Review: Special Issue on the Swedish Conference on Connectionism, 1992 | 1992 | AI | |
| TSP-Based Curve Reconstruction in Polynomial Time | E. Althaus and K. Melhorn | SIAM Journal of Computing 31(1), 2001. | 2001 | Algorithms | |
| Parallel Sorting with Limited Bandwidth | M. Adler, J. Byers, and R. M. Karp | SIAM Journal of Computing Vol. 29, No. 6, pp. 1997-2015 | 2000 | Networking | |
| An Optimal Algorithm for Monte-Carlo Estimation | P. Dagum, R. M. Karp, M. Luby, and S. Ross | SIAM Journal of Computing, Vol. 29, No. 5, pp. 1484-1496 | 2000 | Networking | |
| The Efficiency of Resolution and Davis-Putnamn Procedures | P. Beame, R. M. Karp, T. Pitassi, and M. Saks | SIAM Journal of Computing, Vol. 31, No. 4, pp. 1048-1075 | 2002 | Algorithms | |
| A Model and Proof Technique for Message-Based Systems | J.A. Feldman and A. Nigam | SIAM Journal of Computing, Vol. 9, Issue 4, pp. 768-784 | 1980 | AI | |
| On the Optimality of Huffman Trees | R. M. Karp and C.R. Glassey | SIAM Journal on Applied Mathematics, Vol. 31, No. 2, pp. 368-78 | September 1976 | Algorithms | |
| Incomplete Directed Perfect Phylogeny | I. Pe'er, T. Pupko, R. Shamir, and R. Sharan | SIAM Journal on Computing 33(3), pp. 590-607 | January 05 2004 | Algorithms | |
| An Optimal Algorithm for Monte Carlo Estimation | P. Dagum, R.M. Karp, M. Luby, and S. Ross | SIAM Journal on Computing, SIAM J. Comput. (USA), vol.29, (no.5), SIAM, 2000. p.1484-96. | 2000 | Algorithms | |
| On linear characterizations of combinatorial optimization problems | R. M. Karp, C.H. Papadimitriou | SIAM Journal on Computing, Vol. 11, No. 4, pp. 620-32 | November 1982 | Algorithms | |
| Deferred Data Structuring | R. M. Karp, R. Motwani, and P. Raghaven | SIAM Journal on Computing, Vol. 17, No. 5, pp. 883-902 | October 1988 | Algorithms | |
| An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs | R. M. Karp and J.E. Hopcroft | SIAM Journal on Computing, Vol. 2, No. 4, pp. 225-31 | December 1973 | Algorithms | |
| A Monte-Carlo algorithm for estimating the permanent | N. Karmarkar, R. M. Karp, R. Lipton, L. Lovasz, and M. Luby | SIAM Journal on Computing, Vol. 22, No. 2, pp. 284-93 | April 1993 | Algorithms | |
| A graph-theoretic game and its application to the k-server problem | N. Alon, R. M. Karp, D Peleg, and D. West | SIAM Journal on Computing, Vol. 24, No. 1, pp. 78-100 | February 1995 | Algorithms | |
| When is the assignment bound tight for the asymmetric traveling-salesman problem? | A. Frieze, R. M. Karp, and B. Reed | SIAM Journal on Computing, Vol. 24, No. 3, pp. 484-93 | June 1995 | Algorithms | |
