暂无分享,去创建一个
[1] Mahdi Cheraghchi,et al. Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties , 2009, STACS.
[2] Ran Raz,et al. Deterministic extractors for affine sources over large fields , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[3] Ola Svensson,et al. Approximating Linear Threshold Predicates , 2010, APPROX-RANDOM.
[4] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[5] Rudolf Ahlswede,et al. General Theory of Information Transfer and Combinatorics , 2006, GTIT-C.
[6] Yevgeniy Dodis,et al. Exposure-resilient cryptography , 2000 .
[7] Jon Feldman,et al. On the Capacity of Secure Network Coding , 2004 .
[8] Graham Cormode,et al. What's hot and what's not: tracking most frequent items dynamically , 2003, PODS '03.
[9] Alexander Russell,et al. Perfect Information Leader Election in log* n+O (1) Rounds , 2001, J. Comput. Syst. Sci..
[10] Annalisa De Bonis,et al. Optimal Two-Stage Algorithms for Group Testing Problems , 2005, SIAM J. Comput..
[11] M. Rabin. Probabilistic algorithm for testing primality , 1980 .
[12] A. Macula. Probabilistic nonadaptive group testing in the presence of errors and DNA library screening , 1999 .
[13] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[14] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[15] T. Ho,et al. On Linear Network Coding , 2010 .
[16] Alexander Vardy,et al. Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[17] P. Erdös. Some remarks on the theory of graphs , 1947 .
[18] László Lovász,et al. Random Walks on Graphs: A Survey , 1993 .
[19] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[20] Hung-Lin Fu,et al. Nonadaptive algorithms for threshold group testing , 2009, Discret. Appl. Math..
[21] Umesh V. Vazirani. Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources , 1985, STOC '85.
[22] Yevgeniy Dodis,et al. Entropic Security and the Encryption of High Entropy Messages , 2005, TCC.
[23] Venkatesan Guruswami,et al. Hardness amplification within NP against deterministic algorithms , 2011, J. Comput. Syst. Sci..
[24] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[25] Weili Wu,et al. On error-tolerant DNA screening , 2006, Discret. Appl. Math..
[26] Mahdi Cheraghchi. On Matrix Rigidity and the Complexity of Linear Forms , 2005, Electron. Colloquium Comput. Complex..
[27] Rüdiger L. Urbanke,et al. Modern Coding Theory , 2008 .
[28] Peter Bro Miltersen,et al. Are bitvectors optimal? , 2000, STOC '00.
[29] Eyal Kushilevitz,et al. Exposure-Resilient Functions and All-or-Nothing Transforms , 2000, EUROCRYPT.
[30] Amin Karbasi,et al. Graph-Constrained Group Testing , 2010, IEEE Transactions on Information Theory.
[31] Piotr Indyk. Explicit constructions for compressed sensing of sparse signals , 2008, SODA '08.
[32] Mahdi Cheraghchi,et al. Invertible extractors and wiretap protocols , 2009, 2009 IEEE International Symposium on Information Theory.
[33] R. Impagliazzo,et al. P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma , 2002 .
[34] Alexander Schliep,et al. Group testing with DNA chips: generating designs and decoding experiments , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.
[35] David Zuckerman,et al. On Unapproximable Versions of NP-Complete Problems , 1996, SIAM J. Comput..
[36] Sampath Kannan,et al. Group testing problems with sequences in experimental molecular biology , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).
[37] R. Yeung,et al. Network coding theory , 2006 .
[38] Matt DeVos,et al. Simple Affine Extractors Using Dimension Expansion , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.
[39] Omer Reingold,et al. Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier , 2001 .
[40] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[41] Erdal Arikan,et al. Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.
[42] Amnon Ta-Shma,et al. Extractors from Reed-Muller Codes , 2001, Electron. Colloquium Comput. Complex..
[43] Umesh V. Vazirani,et al. Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources , 1987, Comb..
[44] Emanuel Knill,et al. Lower bounds for identifying subset members with subset queries , 1994, SODA '95.
[45] Kaoru Kurosawa,et al. Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications , 2001, Journal of Cryptology.
[46] Enkatesan G Uruswami. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .
[47] Mahdi Cheraghchi. Capacity achieving codes From randomness conductors , 2009, 2009 IEEE International Symposium on Information Theory.
[48] Hung-Lin Fu,et al. An upper bound of the number of tests in pooling designs for the error-tolerant complex model , 2008, Optim. Lett..
[49] Lie Zhu,et al. Some New Bounds for Cover-Free Families , 2000, J. Comb. Theory, Ser. A.
[50] Noam Nisan,et al. Hardness vs Randomness , 1994, J. Comput. Syst. Sci..
[51] Lawrence H. Ozarow,et al. Wire-tap channel II , 1984, AT&T Bell Lab. Tech. J..
[52] Amnon Ta-Shma,et al. Storing information with extractors , 2002, Inf. Process. Lett..
[53] Ding-Zhu Du,et al. A survey on combinatorial group testing algorithms with applications to DNA Library Screening , 1999, Discrete Mathematical Problems with Medical Applications.
[54] D. Balding,et al. Efficient pooling designs for library screening. , 1994, Genomics.
[55] Ronen Shaltiel,et al. How to Get More Mileage from Randomness Extractors , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[56] Richard C. Singleton,et al. Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.
[57] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[58] Avi Wigderson,et al. 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction , 2006, STOC '06.
[59] Gary L. Miller,et al. Riemann's Hypothesis and tests for primality , 1975, STOC.
[60] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[61] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[62] Moshe Morgenstern,et al. Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q , 1994, J. Comb. Theory, Ser. B.
[63] Ding-Zhu Du,et al. New Constructions of One- and Two-Stage Pooling Designs , 2008, J. Comput. Biol..
[64] Mahdi Cheraghchi,et al. Noise-resilient group testing: Limitations and constructions , 2008, Discret. Appl. Math..
[65] Amnon Ta-Shma,et al. Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.
[66] Venkatesan Guruswami,et al. Concatenated codes can achieve list-decoding capacity , 2008, SODA '08.
[67] Oded Goldreich,et al. The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[68] Ning Cai,et al. Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory) , 2006 .
[69] Jack K. Wolf,et al. Born again group testing: Multiaccess communications , 1985, IEEE Trans. Inf. Theory.
[70] Adi Shamir,et al. On the generation of cryptographically strong pseudorandom sequences , 1981, TOCS.
[71] Amnon Ta-Shma,et al. Lossless Condensers, Unbalanced Expanders, And Extractors , 2007, Comb..
[72] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.
[73] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[74] Ronen Shaltiel,et al. Weak Derandomization of Weak Algorithms: Explicit Versions of Yao’s Lemma , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[75] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[76] Mahdi Cheraghchi. Improved Constructions for Non-adaptive Threshold Group Testing , 2010, ICALP.
[77] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[78] Zoltán Füredi. On r-Cover-free Families , 1996, J. Comb. Theory, Ser. A.
[79] D. Du,et al. Combinatorial Group Testing and Its Applications , 1993 .
[80] Dieter van Melkebeek,et al. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses , 1999, STOC '99.
[81] Jean-Marc Robert,et al. How to reduce your enemy's information , 1986, CRYPTO 1986.
[82] Weili Wu,et al. Construction of d(H)-disjunct matrix for group testing in hypergraphs , 2006, J. Comb. Optim..
[83] Guy Kindler,et al. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[84] Vladimir S. Lebedev,et al. On optimal superimposed codes , 2004 .
[85] Shi-Chun Tsai,et al. Two Results on the Bit Extraction Problem , 2000, Discret. Appl. Math..
[86] V. D. Goppa. Codes on Algebraic Curves , 1981 .
[87] Mahdi Cheraghchi,et al. Bit precision analysis for compressed sensing , 2009, 2009 IEEE International Symposium on Information Theory.
[88] A. Sterrett. On the Detection of Defective Members of Large Populations , 1957 .
[89] Ding-Zhu Du,et al. Molecular Biology and Pooling Design , 2007 .
[90] D. Du,et al. Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing , 2006 .
[91] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[92] Venkatesan Guruswami,et al. List decoding of error correcting codes , 2001 .
[93] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[94] Amir Yehudayoff,et al. Affine extractors over prime fields , 2011, Comb..
[95] David Zuckerman,et al. Random Selection with an Adversarial Majority , 2006, CRYPTO.
[96] Noga Alon,et al. On the second eigenvalue of a graph , 1991, Discret. Math..
[97] David Zuckerman,et al. DETERMINISTIC EXTRACTORS FOR BIT-FIXING SOURCES AND EXPOSURE-RESILIENT CRYPTOGRAPHY , 2003 .
[98] Amnon Ta-Shma,et al. Extractor codes , 2001, IEEE Transactions on Information Theory.
[99] Miklós Ruszinkó,et al. On the Upper Bound of the Size of the R-Cover-Free Families , 1993, Proceedings. IEEE International Symposium on Information Theory.
[100] Douglas R. Stinson,et al. Generalized cover-free families , 2004, Discret. Math..
[101] Luca Trevisan,et al. Extracting randomness from samplable distributions , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[102] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[103] Arkadii G. D'yachkov,et al. Families of Finite Sets in which No Intersection of Sets Is Covered by the Union of s Others , 2002, J. Comb. Theory, Ser. A.
[104] Oded Goldreich,et al. Another proof that bpp?ph (and more) , 1997 .
[105] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[106] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[107] Yevgeniy Dodis. On extractors, error-correction and hiding all partial information , 2005, IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005..
[108] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[109] Frank R. Kschischang,et al. Security for wiretap networks via rank-metric codes , 2008, 2008 IEEE International Symposium on Information Theory.
[110] M. Tsfasman,et al. Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound , 1982 .
[111] Joel Friedman,et al. On the bit extraction problem , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[112] Avi Wigderson,et al. Computational Hardness and Explicit Constructions of Error Correcting Codes , 2006 .
[113] Ramesh Hariharan,et al. Derandomizing semidefinite programming based approximation algorithms , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[114] V. Rich. Personal communication , 1989, Nature.
[115] Salil P. Vadhan,et al. The unified theory of pseudorandomness , 2010 .
[116] Amin Karbasi,et al. Compressed sensing with probabilistic measurements: A group testing solution , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[117] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.
[118] Elchanan Mossel,et al. On the complexity of approximating the VC dimension , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[119] Henning Stichtenoth,et al. Algebraic function fields and codes , 1993, Universitext.
[120] Venkatesan Guruswami,et al. Linear-Time List Decoding in Error-Free Settings: (Extended Abstract) , 2004, ICALP.
[121] Amnon Ta-Shma,et al. Constructing Small-Bias Sets from Algebraic-Geometric Codes , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[122] Bruce M. Maggs,et al. Protocols for Asymmetric Communication Channels , 2001, J. Comput. Syst. Sci..
[123] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[124] G. David Forney,et al. Concatenated codes , 2009, Scholarpedia.
[125] R. Yeung,et al. Secure network coding , 2002, Proceedings IEEE International Symposium on Information Theory,.
[126] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..
[127] Victor Shoup,et al. New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[128] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[129] Kristin E. Lauter,et al. Cryptographic Hash Functions from Expander Graphs , 2008, Journal of Cryptology.
[130] Mahdi Cheraghchi,et al. Improved Constructions for Non-adaptive Threshold Group Testing , 2010, Algorithmica.
[131] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[132] Ely Porat,et al. k -Mismatch with Don't Cares , 2007, ESA.
[133] Ding-Zhu Du,et al. An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution , 2007, J. Comb. Optim..
[134] Imre Csiszár,et al. Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.
[135] J.L. Massey,et al. Theory and practice of error control codes , 1986, Proceedings of the IEEE.
[136] Hung-Lin Fu,et al. Reconstruction of hidden graphs and threshold group testing , 2011, J. Comb. Optim..
[137] I. Yu.,et al. What is the maximum number of points on a curve over $F_2$? , 1982 .
[138] Rahul Santhanam,et al. Uniform Hardness Amplification in NP via Monotone Codes , 2006, Electron. Colloquium Comput. Complex..
[139] Gilles Zémor,et al. Collisions for the LPS Expander Graph Hash Function , 2008, EUROCRYPT.
[140] D. Stinson,et al. Resilient functions and large sets of orthogonal arrays , 2022 .
[141] H. Stichtenoth,et al. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound , 1995 .
[142] Ely Porat,et al. Search Methodologies , 2022 .
[143] Richard E. Ladner,et al. Group testing for image compression , 2000, Proceedings DCC 2000. Data Compression Conference.
[144] Jean Bourgain,et al. On the Construction of Affine Extractors , 2007 .
[145] Emina Soljanin,et al. On Wiretap Networks II , 2007, 2007 IEEE International Symposium on Information Theory.
[146] Amit Sahai,et al. On Perfect and Adaptive Security in Exposure-Resilient Cryptography , 2001, EUROCRYPT.
[147] Ronald L. Rivest,et al. All-or-Nothing Encryption and the Package Transform , 1997, FSE.
[148] Madhu Sudan,et al. Hardness of approximating the minimum distance of a linear code , 1999, IEEE Trans. Inf. Theory.
[149] M. Murty. Ramanujan Graphs , 1965 .
[150] Luca Trevisan,et al. Extractors and pseudorandom generators , 2001, JACM.
[151] E. Gilbert. A comparison of signalling alphabets , 1952 .
[152] A. Pizer. Ramanujan graphs and Hecke operators , 1990 .
[153] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[154] Muriel Médard,et al. An algebraic approach to network coding , 2003, TNET.
[155] Jaikumar Radhakrishnan,et al. Tight bounds for depth-two superconcentrators , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[156] Faith Ellen,et al. New Protocols for Asymmetric Communication Channels , 2001, SIROCCO.
[157] Alexander Vardy,et al. The intractability of computing the minimum distance of a code , 1997, IEEE Trans. Inf. Theory.
[158] Oded Goldreich,et al. Computational complexity: a conceptual perspective , 2008, SIGA.
[159] Venkatesan Guruswami,et al. Hardness Amplification within NP against Deterministic Algorithms , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[160] David Eppstein,et al. Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes , 2005, SIAM J. Comput..
[161] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[162] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[163] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.
[164] Jacobus H. van Lint,et al. Introduction to Coding Theory , 1982 .
[165] Yuan Zhou. Introduction to Coding Theory , 2010 .
[166] Ran Raz,et al. Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[167] Erik D. Demaine,et al. Lower bounds for asymmetric communication channels and distributed source coding , 2006, SODA '06.
[168] Mahdi Cheraghchi. Noise-resilient group testing: Limitations and constructions , 2013, Discret. Appl. Math..
[169] Avi Wigderson,et al. Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1993, Comb..