Publications

Found 1144 results
Author Title [ Type(Desc)] Year
Filters: First Letter Of Last Name is K  [Clear All Filters]
RFC
Floyd, S., Kohler E., & Padhye J. (2006).  RFC 4342: Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 3: TCP-Friendly Rate Control (TFRC).
Floyd, S., & Kohler E. (2007).  RFC 4828: TCP Friendly Rate Control (TFRC): the Small-Packet (SP) Variant.
Kuzmanovic, A.., Floyd S., & Ramakrishnan K.. K. (2009).  RFC 5562: Adding Explicit Congestion Notification (ECN) Capability to TCP's SYN/ACK Packets.
Floyd, S., & Kohler E. (2009).  RFC 5622: Profile for DCCP Congestion Control ID 4: TCP-Friendly Rate Control for Small Packets (TFRC-SP).
Stewart, R.., Xie Q.., Morneault K.., Sharp C.., Schwarzbauer H.., Taylor T.., et al. (2000).  Stream Control Transmission Protocol.
Technical Report
Karpinski, M., & Zelikovsky A. (1995).  1.757 and 1.267-Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems.
Renals, S., Morgan N., Bourlard H., Cohen M., Franco H., Wooters C., et al. (1991).  Advances in Connectionist Speech Recognition.
Bshouty, N. H., Hancock T. R., Hellerstein L., & Karpinski M. (1993).  An Algorithm to Learn Read-Once Threshold Formulas, and Some Generic Transformations Between Learning Models (Revised Version).
Grigoriev, D. Yu., & Karpinski M. (1991).  Algorithms for Sparse Rational Interpolation.
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multi-Protein Modularity Conserved During Evolution.
Karpinski, M., & Rytter W. (1993).  An Alphabet-Independent Optimal Parallel Search for Three Dimensional Patterns.
Eklund, R., Bates R., Kuyper C., Willingham E., & Shriberg E. (2006).  The Annotation and Analysis of Importance in Meetings.
Kushilevitz, E., Micali S., & Ostrovsky R. (1993).  Any Non-Private Boolean Function Is Complete For Private Multi-Party Computations.
Kaiser, M. (1993).  An Application of a Neural Net for Fuzzy Abductive Reasoning.
Berman, P., Fößmeier U., Karpinski M., Kaufmann M., & Zelikovsky A. (1994).  Approaching the 5/4-Approximation for Rectilinear Steiner Trees.
Berman, P., Fößmeier U., Karpinski M., Kaufmann M., & Zelikovsky A. (1994).  Approaching the 5/4-Approximation for Rectilinear Steiner Trees.
Karpinski, M., & Zelikovsky A. (1996).  Approximating Dense Cases of Covering Problems.
Karpinski, M., & Luby M. (1990).  Approximating the Number of Solutions of a GF[2] Polynomial.
Karpinski, M., Wirtgen J., & Zelikovsky A. (1997).  An Approximation Algorithm for the Bandwidth Problem on Dense Graphs.
Grigoriev, D. Yu., & Karpinski M. (1991).  An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q].
Karpinski, M., & Wirtgen J. (1997).  On Approximation Hardness of the Bandwidth Problem.
Vallina-Rodriguez, N., Sundaresan S., Kreibich C., Weaver N., & Paxson V. (2014).  Beyond the Radio: Illuminating the Higher Layers of Mobile Networks.
Karpinski, M. (1989).  Boolean Circuit Complexity of Algebraic Interpolation Problems.
Althaus, E., Kohlbacher O., Lenhof H-P., & Müller P. (2000).  A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem.
Bell, O., Allman M., & Kuperman B. (2012).  On Browser-Level Event Logging.

Pages