Result 101 to 120 of 123 total
Tight approximations for resource constrained scheduling and bin packing. (English)
Discrete Appl. Math. 79, No.1-3, 223-245 (1997).
101
Improved parallel approximation of a class of integer programming problems. (English)
Algorithmica 17, No.4, 449-462 (1997).
102
On counting pairs of intersecting segments and off-line triangle range searching. (English)
Algorithmica 17, No.4, 380-398 (1997).
103
Maintaining dynamic sequences under equality tests in polylogarithmic time. (English)
Algorithmica 17, No.2, 183-198 (1997).
104
On greedy algorithms in coding theory. (English)
IEEE Trans. Inf. Theory 42, No.6, Pt. 1, 2053-2057 (1996).
105
A simple analysis of the error probability of two-point based sampling. (English)
Inf. Process. Lett. 60, No.2, 91-96 (1996).
106
A fast derandomization scheme and its applications. (English)
SIAM J. Comput. 25, No.1, 52-82 (1996).
107
Algorithmic Chernoff-Hoeffding inequalities in integer programming. (English)
Random Struct. Algorithms 8, No.1, 27-58 (1996).
108
The fourth moment in Luby’s distribution. (English)
Theor. Comput. Sci. 148, No.1, 133-140 (1995).
109
Probabilistic methods in combinatorics. (English)
Chatterji, S. D. (ed.), Proceedings of the international congress of mathematicians, ICM ’94, August 3-11, 1994, Zürich, Switzerland. Vol. II. Basel: Birkhäuser. 1375-1383 (1995).
110
Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant. (English)
Comput. Math. Appl. 30, No.2, 71-94 (1995).
111
Chernoff-Hoeffding bounds for applications with limited independence. (English)
SIAM J. Discrete Math. 8, No.2, 223-250 (1995).
112
Derandomized graph products. (English)
Comput. Complexity 5, No.1, 60-75 (1995).
113
Weighted fractional and integral $k$-matching in hypergraphs. (English)
Discrete Appl. Math. 57, No.2-3, 255-269 (1995).
114
Generating low-degree 2-spanners. (English)
Proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms, Arlington, VA, USA, January 23-25, 1994. New York, NY: ACM, 556-563 (1994).
115
Intersecting codes and independent families. (English)
IEEE Trans. Inf. Theory 40, No.6, 1872-1881 (1994).
116
Constructing small sample spaces satisfying given constraints. (English)
SIAM J. Discrete Math. 7, No.2, 260-274 (1994).
117
On quadratic lattice approximations. (English)
Ng, Kam W. (ed.) et al., Algorithms and computation. 4th international symposium, ISAAC ’93, Hong Kong, December 15-17, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 762, 176-184 (1993).
118
Primality testing with fewer random bits. (English)
Comput. Complexity 3, No.4, 355-367 (1993).
119
On linear-time deterministic algorithms for optimization problems in fixed dimension. (English)
Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 281-290 (1993).
120
Result 101 to 120 of 123 total
Start
Contact
Print
General Help
