Publications

Found 4070 results
Author [ Title(Desc)] 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
Tavakoli, A., Casado M., Koponen T., & Shenker S. (2009).  Applying NOX to the Datacenter.
Hößler, T., Scheuvens L., Franchi N., Simsek M., & Fettweis G. (2017).  Applying Reliability Theory for Future Wireless Communication Networks. Proceedings of the IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC) 17.
Feldman, J., Ballard D. Harry, & Brown C. M. (1977).  An Approach to Knowledge-Directed Image Analysis.
Feldman, J., Ballard D. Harry, & Brown C. M. (1978).  An Approach to Knowledge-Directed Image Analysis.
Feldman, J., Ballard D. Harry, & Brown C. M. (1977).  An Approach to Knowledge-Directed Image Analysis.
Berman, P., Fößmeier U., Karpinski M., Kaufmann M., & Zelikovsky A. (1994).  Approaching the 5/4-Approximation for Rectilinear Steiner Trees.
Pan, V. (1992).  Approximate Evaluation of a Polynomial on a Set of Real Points.
Pan, R., Prabhakar B., Breslau L., & Shenker S. (2003).  Approximate Fair Allocation of Link Bandwidth. 36-43.
Pan, R., Breslau L., Prabhakar B., & Shenker S. (2003).  Approximate Fairness Through Differential Dropping. ACM SIGCOMM Computer Communication Review. 33(2), 23-39.
Heun, V. (1998).  Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices.
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.
Karpinski, M., & Zelikovsky A. (1996).  Approximating Dense Cases of Covering Problems.
Henzinger, M. Rauch (1994).  Approximating Minimum Cuts Under Insertion.
Ronen, A.. (2001).  On Approximating Optimal Auctions.
Bringmann, K., & Friedrich T. (2009).  Approximating the Least Hypervolume Contributor : NP-Hard in General, but Fast in Practice. 6-20.
Karpinski, M., & Luby M. (1990).  Approximating the Number of Solutions of a GF[2] Polynomial.
Dagum, P., & Luby M. (1989).  Approximating the Permanent of Graphs with Large Factors.
Mahoney, M. W., Rao S., Wang D., & Zhang P. (2016).  Approximating the Solution to Mixed Packing and Covering LPs in parallel time.
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.
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].
Krick, C., Räcke H., & Westermann M. (2001).  Approximation Algorithms for Data Management in Networks.
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.
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.

Pages