Search Results - "40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)"

Cache-oblivious algorithms by Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.

“…This paper presents asymptotically optimal algorithms for rectangular matrix transpose, FFT, and sorting on computers with multiple levels of caching. Unlike…”
Get full text

Improved combinatorial algorithms for the facility location and k-median problems by Charikar, M., Guha, S.

“…We present improved combinatorial approximation algorithms for the uncapacitated facility location and k-median problems. Two central ideas in most of our…”
Get full text

Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security by Sahai, A.

“…We introduce the notion of non-malleable non-interactive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one…”
Get full text

Learning mixtures of Gaussians by Dasgupta, S.

“…Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local…”
Get full text

Optimal lower bounds for quantum automata and random access codes by Nayak, A.

“…Consider the finite regular language L/sub n/={w0|w/spl isin/{0,1}*,|w|/spl les/n}. A. Ambainis et al. (1999) showed that while this language is accepted by a…”
Get full text

A probabilistic algorithm for k-SAT and constraint satisfaction problems by Schoning, T.

“…We present a simple probabilistic algorithm for solving k-SAT and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a…”
Get full text

Approximation schemes for minimizing average weighted completion time with release dates by Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.

“…We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first…”
Get full text

Verifiable random functions by Micali, S., Rabin, M., Vadhan, S.

“…We efficiently combine unpredictability and verifiability by extending the Goldreich-Goldwasser-Micali (1986) construction of pseudorandom functions f/sub s/…”
Get full text

Primal-dual approximation algorithms for metric facility location and k-median problems by Jain, K., Vazirani, V.V.

“…We present approximation algorithms for the metric uncapacitated facility location problem and the metric k-median problem achieving guarantees of 3 and 6…”
Get full text

Algorithmic aspects of protein structure similarity by Goldman, D., Istrail, S., Papadimitriou, C.H.

“…We show that calculating contact map overlap (a measure of similarity of protein structures) is NP-hard, but can be solved in polynomial time for several…”
Get full text

Fairness in routing and load balancing by Kleinberg, J., Rabani, Y., Tardos, E.

“…We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria interacts in a complex fashion with the…”
Get full text

All pairs shortest paths in undirected graphs with integer weights by Shoshan, A., Zwick, U.

“…We show that the all pairs shortest paths (APSP) problem for undirected graphs with integer edge weights taken from the range {1, 2, ..., M} can be solved…”
Get full text

Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields by Kleinberg, J., Tardos, E.

“…In a traditional classification problem, we wish to assign one of k labels (or classes) to each of n objects, in a way that is consistent with some observed…”
Get full text

Stochastic load balancing and related problems by Goel, A., Indyk, P.

“…We study the problems of makespan minimization (load balancing), knapsack, and bin packing when the jobs have stochastic processing requirements or sizes. If…”
Get full text

A non-linear time lower bound for Boolean branching programs by Ajtai, M.

“…We prove that for all positive integer k and for all sufficiently small /spl epsiv/>0 if n is sufficiently large then there is no Boolean (or 2-way) branching…”
Get full text

Limits on the efficiency of one-way permutation-based hash functions by Jeong Han Kim, Simon, D.R., Tetali, P.

“…Naor and Yung (1989) show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This…”
Get full text

Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics by Borgs, C., Chayes, J.T., Frieze, A., Jeong Han Kim, Tetali, P., Vigoda, E., Van Ha Vu

“…Studies two widely used algorithms, Glauber dynamics and the Swendsen-Wang (1987) algorithm, on rectangular subsets of the hypercubic lattice Z/sup d/. We…”
Get full text

Bounds for small-error and zero-error quantum algorithms by Buhrman, H., Cleve, R., De Wolf, R., Zalka, C.

“…We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight…”
Get full text

How asymmetry helps load balancing by Vocking, B.

“…This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation and hashing. Suppose n balls have to be…”
Get full text

Noncryptographic selection protocols by Feige, U.

“…Selection tasks generalize some well studied problems, such as collective coin flipping and leader election. We present new selection protocols in the full…”
Get full text