Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
How to construct random functions
Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Explicit expanders and the Ramanujan conjectures
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
NP is as easy as detecting unique solutions
Theoretical Computer Science
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
On the power of two-point based sampling
Journal of Complexity
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximating the number of zeroes of a GF[2] polynomial
Journal of Algorithms
More deterministic simulation in logspace
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Expanders, Randomness, or Time versus Space
Proceedings of the Conference on Structure in Complexity Theory
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Pricing commodities, or how to sell when buyers have restricted valuations
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Theoretical Computer Science
Explicit Dimension Reduction and Its Applications
SIAM Journal on Computing
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
_cf_loadingtexthtml="";_cf_contextpath="";_cf_ajaxscriptsrc="/CFIDE/scripts/ajax";_cf_jsonprefix='//';_cf_clientid='B77158DD8D84F712DD99D285843D4EC1';Pairwise independence and derandomization function settab() { var mytabs = ColdFusion.Layout.getTabLayout('citationdetails'); mytabs.on('tabchange', function(tabpanel,activetab) { document.cookie = 'picked=' + '1166416' + ',' + activetab.id; }) }function letemknow(){ ColdFusion.Window.show('letemknow');}function testthis(){alert('test');}function loadalert(){ alert("I am in the load alert"); }function loadalert2(){ alert("I am in the load alert2"); } google.load('visualization', '1', {packages:['orgchart']}); google.setOnLoadCallback(drawChart); function drawChart() { var data = new google.visualization.DataTable(); data.addColumn('string', 'Name'); data.addColumn('string', 'Manager'); data.addColumn('string', 'ToolTip'); data.addRows([ [{v:'0', f:'CCS for this Article