Publications

Found 4113 results
Author [ Title(Asc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
A
Rejaie, R., Handley M., & Estrin D. (1998).  Architectural Considerations for Playback of Quality Adaptive Video over the Internet.
Mitzel, D. J., Estrin D., Shenker S., & Zhang L. (1994).  An Architectural Comparison of ST-II and RSVP. Proceedings of the 13th IEEE Conference on Networking for Global Communications (INFOCOM '94). 2, 716-725.
Regier, T., & M. Khalidi A. (2009).  The Arab Street: Tracking a Political Metaphor. 63(1), 11-29.
Ruiz, P. M., & Gómez-Skarmeta A. (2005).  Aproximacion de Arboles Multicast Optimos en Redes Ad Hoc Inalambricas. Proceedings of the V Jornadas de Ingenieria Telematica.
Friedland, G., Hensley E., Schumacher J., & Jain R. (2008).  Appscio: A Software Environment for Semantic Multimedia Analysis. 456-459.
Razaghpanah, A., Nithyanand R., Vallina-Rodriguez N., Sundaresan S., Allman M., Kreibich C., et al. (2018).  Apps, Trackers, Privacy and Regulators: A Global Study of the Mobile Tracking Ecosystem. Proceedings of NDSS 2018.
M. Shokrollahi, A., & Stemann V. (1996).  Approximation of Complex Numbers by Cyclotomic Integers.
Karpinski, M., & Wirtgen J. (1997).  On Approximation Hardness of the Bandwidth Problem.
Feigenbaum, J., Krishnamurthy A., Sami R., & Shenker S. (2001).  Approximation and Collusion in Multicast Cost Sharing. Proceedings of the Third ACM Conference on Electronic Commerce (ACM-EE 2001). 253-255.
Feigenbaum, J., Archer A.., Krishnamurthy A., Sami R., & Shenker S. (2004).  Approximation and Collusion in Multicast Cost Sharing. Games and Economic Behavior. 47(1), 36-71.
Krick, C., Räcke H., & Westermann M. (2001).  Approximation Algorithms for Data Management in Networks. Proceedings of the Thirteenth ACM Symposium on Parallel Algorithms and Architectures (SPAA). 237-246.
Krick, C., Räcke H., & Westermann M. (2001).  Approximation Algorithms for Data Management in Networks.
Grigoriev, D. Yu., & Karpinski M. (1991).  An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q].
Karpinski, M., Wirtgen J., & Zelikovsky A. (1997).  An Approximation Algorithm for the Bandwidth Problem on Dense Graphs.
Bringmann, K., & Friedrich T. (2010).  Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. Computational Geometry. 43(6-7), 601-610.
Bringmann, K., & Friedrich T. (2008).  Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. 436-447.
Mahoney, M. W., Rao S., Wang D., & Zhang P. (2016).  Approximating the Solution to Mixed Packing and Covering LPs in parallel time.
Dagum, P., & Luby M. (1989).  Approximating the Permanent of Graphs with Large Factors.
Karpinski, M., & Luby M. (1990).  Approximating the Number of Solutions of a GF[2] Polynomial.
Bringmann, K., & Friedrich T. (2009).  Approximating the Least Hypervolume Contributor : NP-Hard in General, but Fast in Practice. 6-20.
Ronen, A.. (2001).  On Approximating Optimal Auctions.
Henzinger, M. Rauch (1994).  Approximating Minimum Cuts Under Insertion.
Karpinski, M., & Zelikovsky A. (1996).  Approximating Dense Cases of Covering Problems.
Friedrich, T., He J., Hebbinghaus N., Neumann F., & Witt C. (2010).  Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models. Evolutionary Computation. 18(4), 617-633.
Heun, V. (1998).  Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices.

Pages