Moni Naor, Leonard J. Schulman, Aravind Srinivasan  Home/Search
Context Related
| caltech.edu/~schulman/Pa...splitters.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: caltech.edu/~schulman/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a fairly general method for finding deterministic constructions obeying what we call k- restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n; k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2 configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very... (Update)
Context of citations to this paper: More
...and no membership queries are used otherwise. The size of the smallest deterministic construction of an (n; t) universal set known to date [25] is 2 t t O(log t) log n, and the smallest known randomized construction has size O(t 2 t log n) With our implementation of...
...union of these sets does not cover N . Partitions with the above properties can be constructed deterministically in polynomial time [AGHP92,NSS95]. Let P i ; P i respectively denote the first and second sets in the ith partition. We describe the construction of SC next. Using...
Cited by: More
Algorithmic Construction of Sets for k-Restrictions.. - Alon, Moshkovitz, Safra (Correct)
Splitters and Near-Optimal Derandomization - Naor, Schulman, Srinivasan (1995) (Correct)
Efficient Algorithms for Generation of Combinatorial Covering.. - Dumitrescu (Correct)
Active bibliography (related documents): More All
0.5: Dispersing Hash Functions - Pagh (Correct)
0.5: Derandomization, witnesses for Boolean matrix multiplication.. - Alon, Naor (1994) (Correct)
0.5: Local Computations on Static and Dynamic Graphs - Mayer, Naor, Stockmeyer (1995) (Correct)
Similar documents based on text: More All
0.2: Fairness in Scheduling - Ajtai, Aspnes, Naor, Rabani.. (1998) (Correct)
0.2: Fairness in Scheduling (Extended Abstract) - Ajtai, Aspnes, Naor, Rabani.. (1995) (Correct)
0.2: On the Carpool Problem - Long-Term Behaviour Of a.. - Ajtai, Aspnes.. (Correct)
Related documents from co-citation: More All
9: the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1993
7: Johnson D.: Approximation algorithms for combinatorial problems. Jour. of Computer and Syst. Sci., 1974, 9, 256-278.
7: for approximating set cover (context) - Feige, of - 1996
BibTeX entry: (Update)
M. Naor, L. J. Schulman, and A. Srinivasan. Splitters and near-optimal derandomization. In Proc. 36th Annu. IEEE Symp. Foundations of Computer Science, pages 182--191, 1995. http://citeseer.ist.psu.edu/naor95splitters.html More
@inproceedings{ naor95splitters,
author = "Moni Naor and Leonard J. Schulman and Aravind Srinivasan",
title = "Splitters and Near-Optimal Derandomization",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "182-191",
year = "1995",
url = "citeseer.ist.psu.edu/naor95splitters.html" }
Citations (may not include all citations):957 The probabilistic method (context) - Alon, Spencer - 1991
837 Cambridge University Press (context) - Motwani, Raghavan et al. - 1995
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
226 for approximating set cover (context) - Feige, of - 1995
218 Probabilistic construction of deterministic algorithms: appr.. (context) - Raghavan - 1988
199 A simple parallel algorithm for the maximal independent set .. (context) - Luby - 1986
148 Storing a Sparse Table with O (context) - Fredman, Koml'os et al. - 1984
139 Ten Lectures on the Probabilistic Method (context) - Spencer - 1987
138 Small-bias probability spaces: efficient constructions and a.. - Naor, Naor - 1993
128 Simple constructions of almost k-wise independent random var.. - Alon, Goldreich et al. - 1993
126 Efficient probabilistically checkable proofs and application.. - Bellare, Goldwasser et al. - 1993
102 A fast and simple randomized parallel algorithm for the maxi.. (context) - Alon, Babai et al. - 1986
91 Data Structures and Algorithms 1: Sorting and Searching (context) - Mehlhorn - 1984
81 The Bit Extraction Problem or t-Resilient Functions - Chor, Goldreich et al. - 1985
71 A Fast Parallel Algorithm for the Maximal Independent Set Pr.. (context) - Karp, Wigderson - 1985
53 The probabilistic method yields deterministic parallel algor.. - Motwani, Naor et al. - 1994
42 wise independence in NC (context) - Berger, Rompel et al. - 1991
42 term DNF formulas with queries (context) - Blum, Rudich et al. - 1992
41 Removing randomness in parallel computation without a proces.. - Luby - 1993
30 the size of separating systems and families of perfect hash .. (context) - Fredman, Koml'os - 1984
26 witnesses for Boolean matrix multiplication and construction.. (context) - Alon, Naor
23 Worst-case interactive communication I: two messages are alm.. - Orlitsky - 1990
20 The Spatial Complexity of oblivious k-probe hash functions (context) - Schmidt, Siegel - 1990
20 Efficient NC Algorithms for Set Cover with Applications to L.. (context) - Berger, Rompel et al. - 1994
19 Explicit constructions of exponential sized families of k-in.. (context) - Alon - 1986
16 Splitters and near-optimal derandomization - Naor, Schulman et al.
15 low-rate error-correcting codes through pseudorandom graphs (context) - Alon, Bruck et al. - 1992
14 A remark on Stirling's formula (context) - Robbins - 1955
12 Local computations on static and dynamic graphs - Mayer, Naor et al. - 1995
10 How robust is the n-cube (context) - Becker, Simon - 1988
9 independent sets (context) - Kleitman, Spencer et al. - 1973
8 Fredman-Koml'os bounds and information theory (context) - Korner - 1986
7 Color-coding: a new method for finding simple paths (context) - Alon, Yuster et al. - 1994
6 Vector sets for exhaustive testing of logic circuits (context) - Seroussi, Bshouty - 1988
4 Probability and Computing (context) - Nilli, hashing et al. - 1994
3 athan, Locality based graph coloring, Proc. 25th ACM Symposi.. (context) - Szegedy, Vishwan - 1993
3 on theorem, Proc. 27th ACM Symposium on Theory of Computing (context) - Raz, repetiti - 1995
2 SigmaPiSigma threshold formula (context) - Pi, formulas et al. - 1994
2 Improved Bounds for Covering Complete Uniform Hypergraphs (context) - Radhakrishnan - 1992
1 a the Monotone Theory Proc. 34th IEEE Symposium on Foundatio.. (context) - Bshouty, vi - 1993
1 partially specified Boolean functions (context) - Krichevsky, razor - 1994
1 th IEEE Symposium on Foundations of Computer Science (context) - Bellare, Rompel et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.caltech.edu/~schulman/): More
Pattern Matching for Spatial Point Sets - David Cardoze Leonard (1998) (Correct)
Majorizing Estimators and the Approximation of #P-complete.. - Schulman, Vazirani (1999) (Correct)
The Vector Partition Problem for Convex Objective Functions - Onn, Schulman (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC