@comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{SIAM Journal on Computing} @STRING{siamjc = "SIAM J. Comput."} @STRING{lncs = "Lect. Notes in Comput. Sci."} @STRING{comba = "Combinatorica"} @STRING{ipl = "Inform. Process. Lett."} @STRING{tcs = "Theoret. Comput. Sci."} @STRING{jcss = "J. Comput. System Sci."} @STRING{jams = "J. Amer. Math. Soc."} @STRING{ccomplex = "Comput. Complexity"} @STRING{tams = "Trans. Amer. Math. Soc."} @STRING{oup = "Oxford University Press"} @STRING{cup = "Cambridge University Press"} @STRING{ams = "American Mathematical Society"} @STRING{springer = "Springer"} @comment{Annals of Mathematics.} @string{AnnofMath="Ann. of Math."} @comment{Israel Journal of Mathematics} @string{IsraelJMath="Israel J. Math."} @comment{Proceedings of the American Mathematical Society} @string{ProcAmerMathSoc="Proc. Amer. Math. Soc."} @comment{Advances in Applied Mathematics} @string{AdvinApplMath="Adv. in Appl. Math."} @comment{Combinatorics, Probability and Computing} @string{CombinProbabComput="Combin. Probab. Comput."} @comment{American Journal of Mathematics} @string{AmerJMath="Amer. J. Math."} @comment{Geometric and Functional Analysis} @string{GeomFunctAnal="Geom. Funct. Anal."} @comment{The Annals of Probability} @string{AnnProbab="Ann. Probab."} @INPROCEEDINGS{aak:testingkwise, AUTHOR = "N. Alon and A. Andoni and T. Kaufman and K. Matulef and R. Rubinfeld and N. Xie", TITLE = "Testing k-wise and almost k-wise independence", BOOKTITLE = "Proc. 39th STOC", PUBLISHER = "ACM Press", PAGES = "496--505", YEAR = 2007, eprint="stoc:1250790.1250863" } @ARTICLE{ambainis:aa, AUTHOR = "A. Ambainis", TITLE = "A note on quantum black-box complexity of almost all {B}oolean functions", JOURNAL = ipl, VOLUME = 71, NUMBER = 1, PAGES = "5--7", YEAR = 1999, eprint="ipl:10.1016/S0020-0190(99)00079-4" } @ARTICLE{almss:pcp, AUTHOR = "S. Arora and C. Lund and R. Motwani and M. Sudan and M. Szegedy", TITLE = "Proof Verification and the Hardness of Approximation Problems", JOURNAL = jacm, VOLUME = 45, NUMBER = 3, PAGES = "501--555", YEAR = 1998, NOTE = "Earlier version in FOCS'92", eprint="jacm:278298.278306" } @BOOK{arora&barak:cc, AUTHOR = "S. Arora and B. Barak", TITLE = "Complexity Theory: A Modern Approach", PUBLISHER = cup, YEAR = 2009, NOTE = "To appear. Preliminary version available at \url{http://www.cs.princeton.edu/theory/complexity}", } @ARTICLE{arrow:difficulty, AUTHOR = "K. Arrow", TITLE = "A difficulty in the concept of social welfare", JOURNAL = "J. Political Economy", VOLUME = 58, NUMBER = 4, PAGES = "328--346", YEAR = 1950, doi="10.1086/256963" } @ARTICLE{Bec75, AUTHOR = "W. Beckner", TITLE = "Inequalities in {F}ourier Analysis", JOURNAL = AnnofMath, YEAR = "1975", volume = "102", pages = "159--182", } @INCOLLECTION{benor&linial:coinflippingj, AUTHOR = "M. {Ben-Or} and N. Linial", TITLE = "Collective Coin Flipping", BOOKTITLE = "Randomness and Computation", EDITOR = "S. Micali", PAGES = "91--115", YEAR = 1989, PUBLISHER = "JAI Press", NOTE = "Earlier version in FOCS'85", } @TECHREPORT{bcs:fourier, AUTHOR = "A. Bernasconi and B. Codenotti and J. Simon", TITLE = "On the {Fourier} Analysis of {Boolean} Functions", INSTITUTION = "Istituto di Matematica Computazionale, Pisa", NUMBER = "IMC B4-97-03", YEAR = 1997, } @ARTICLE{Bon70, AUTHOR = "A. Bonami", TITLE = "{\'E}tude des coefficients de {Fourier} des fonctions de {$L^p(G)$}", JOURNAL = "Annales de l'Institut Fourier", volume = "20", number = "2", pages = "335--402", year = "1970", } @ARTICLE{bourgain:fourierdistribution, AUTHOR = "J. Bourgain", TITLE = "On the distribution of the {F}ourier spectrum of {B}oolean functions", JOURNAL = IsraelJMath, VOLUME = 131, NUMBER = 1, PAGES = "269--276", YEAR = 2002, eprint="springer:657221r06x818652" } @ARTICLE{bkkkl:influence, AUTHOR = "J. Bourgain and J. Kahn and G. Kalai and G. Katznelson and N. Linial", TITLE = "The Influence of Variables in Product Spaces", JOURNAL = IsraelJMath, VOLUME = 77, number="1--2", PAGES = "55--64", YEAR = 1992, eprint="springer:456880489w184683" } @ARTICLE{bmos:dnfrandomwalkj, AUTHOR = "N. Bshouty and E. Mossel and R. {O'Donnell} and R. Servedio", TITLE = "Learning {DNF} from Random Walks", JOURNAL = jcss, VOLUME = 71, NUMBER = 3, PAGES = "250--265", YEAR = 2005, NOTE = "Earlier version in FOCS'03", eprint="jcss:10.1016/j.jcss.2004.10.010" } @ARTICLE{buhrman&wolf:dectreesurvey, AUTHOR = "H. Buhrman and Wolf, R. {de}", TITLE = "Complexity Measures and Decision Tree Complexity: A Survey", JOURNAL = tcs, VOLUME = 288, NUMBER = 1, PAGES = "21--43", YEAR = 2002, eprint="tcs:10.1016/S0304-3975(01)00144-X" } @INPROCEEDINGS{bvw:smallbias, AUTHOR = "H. Buhrman and N. Vereshchagin and Wolf, R. {de}", TITLE = "On computation and communication with small bias", BOOKTITLE = "Proc. 22nd Conference on Comput. Complexity", PUBLISHER = "IEEE Computer Society Press", PAGES = "24--32", YEAR = 2007, eprint="ccc:10.1109/CCC.2007.18" } @INPROCEEDINGS{brw:hypercontractive, AUTHOR = "A. {Ben-Aroya} and O. Regev and Wolf, R. {de}", TITLE = "A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing", BOOKTITLE = "Proc. 49th FOCS", PUBLISHER = "IEEE Computer Society Press", YEAR = 2008, } @INPROCEEDINGS{ckkrs:cut, AUTHOR = "S. Chawla and R. Krauthgamer and R. Kumar and Y. Rabani and D. Sivakumar", TITLE = "On the hardness of approximating sparsest cut and multicut", BOOKTITLE = "Proc. 20th Conf. Comput. Complexity", PUBLISHER = "IEEE Computer Society Press", PAGES = "144--153", YEAR = 2005, eprint="ccc:10.1109/CCC.2005.20" } @ARTICLE{dinur:pcp, AUTHOR = "I. Dinur", TITLE = "The {PCP} theorem by gap amplification", JOURNAL = jacm, VOLUME = 54, NUMBER = "3", pages="12", YEAR = 2007, NOTE = "Earlier version in STOC'06", eprint="jacm:10.1145/1236457.1236459" } @ARTICLE{dfko:fouriertails, AUTHOR = "I. Dinur and E. Friedgut and G. Kindler and R. {O'Donnell}", TITLE = "On the {F}ourier tails of bounded functions over the discrete cube", JOURNAL = IsraelJMath, VOLUME = 160, NUMBER = 1, PAGES = "389--412", YEAR = 2007, NOTE = "Earlier version in STOC'06", eprint="springer:43k0r5p3g28k508g,stoc:10.1145/1132516.1132580" } @INPROCEEDINGS{dmr:coloring, AUTHOR = "I. Dinur and E. Mossel and O. Regev", TITLE = "Conditional hardness for approximate coloring", BOOKTITLE = "Proc. 38nd STOC", PUBLISHER = "ACM Press", PAGES = "344--353", YEAR = 2006, eprint="stoc:1132516.1132567" } @ARTICLE{erdos&renyi:randomgraphs, AUTHOR = "P. Erd{\H{o}}s and A. R{\'e}nyi", TITLE = "On random graphs {I}", JOURNAL = "Publicationes Mathematicae", VOLUME = 6, PAGES = "290--297", YEAR = 1959, } @ARTICLE{friedgut:fewcoor, AUTHOR = "E. Friedgut", TITLE = "{Boolean} functions with low average sensitivity depend on few coordinates", JOURNAL = comba, VOLUME = 18, NUMBER = 1, PAGES = "27--35", YEAR = 1998, eprint="springer:fxcj48rnbwv5gjdb" } @ARTICLE{friedgut&kalai:sharp, AUTHOR = "E. Friedgut and G. Kalai", TITLE = "Every monotone graph property has a sharp threshold", JOURNAL = ProcAmerMathSoc, VOLUME = 124, PAGES = "2993--3002", YEAR = 1996, www="http://www.ams.org/proc/1996-124-10/S0002-9939-96-03732-X/home.html" } @ARTICLE{fkn:firsttwolevels, AUTHOR = "E. Friedgut and G. Kalai and A. Naor", TITLE = "{Boolean} functions whose {Fourier} transform is concentrated at the first two levels", JOURNAL = AdvinApplMath, VOLUME = 29, NUMBER = 3, PAGES = "427--437", YEAR = 2002, eprint="elsevier:10.1016/S0196-8858(02)00024-6" } @ARTICLE{friedgut:bkkkl, AUTHOR = "E. Friedgut", TITLE = "Influences in product spaces: {KKL} and {BKKKL} revisited", JOURNAL = CombinProbabComput, VOLUME = 13, number=1, PAGES = "17--29", YEAR = 2004, eprint="cambridge:10.1017/S0963548303005832" } @INPROCEEDINGS{fkn:elections, AUTHOR = "E. Friedgut and G. Kalai and N. Nisan", TITLE = "Elections Can be Manipulated Often", BOOKTITLE = "Proc. 49th FOCS", PUBLISHER = "IEEE Computer Society Press", YEAR = 2008, } @ARTICLE{fkrss:juntas, AUTHOR = "E. Fischer and G. Kindler and D. Ron and S. Safra and A. Samorodnitsky", TITLE = "Testing juntas", JOURNAL = jcss, VOLUME = 68, NUMBER = 4, PAGES = "753--787", YEAR = 2004, NOTE = "Earlier version in FOCS'02", eprint="jcss:10.1016/j.jcss.2003.11.004" } @INPROCEEDINGS{gkkrw:1way, AUTHOR = "D. Gavinsky and J. Kempe and I. Kerenidis and R. Raz and Wolf, R. {de}", TITLE = "Exponential separations for one-way quantum communication complexity, with applications to cryptography", BOOKTITLE = "Proc. 39th STOC", PUBLISHER = "ACM Press", PAGES = "516--525", YEAR = 2007, eprint="stoc:1250790.1250866" } @INPROCEEDINGS{goldreich&levin, AUTHOR = "O. Goldreich and L. Levin", TITLE = "A Hard-Core Predicate for all One-Way Functions", BOOKTITLE = "Proc. 21st STOC", PUBLISHER = "ACM Press", PAGES = "25--32", YEAR = 1989, eprint="stoc:73007.73010" } @ARTICLE{Gross75, AUTHOR = {Gross, L.}, TITLE = {Logarithmic {S}obolev inequalities}, JOURNAL = AmerJMath, FJOURNAL = {American Journal of Mathematics}, VOLUME = {97}, YEAR = {1975}, NUMBER = {4}, PAGES = {1061--1083}, } @BOOK{guruswami:alglistdecoding, AUTHOR = "V. Guruswami", TITLE = "Algorithmic Results in List Decoding", SERIES = "Foundations and Trends in Theoretical Computer Science", VOLUME = "2(2)", PUBLISHER = "Now Publishers", YEAR = 2007, } @ARTICLE{hastad:optimalj, AUTHOR = "J. H{\aa}stad", TITLE = "Some Optimal Inapproximability Results", JOURNAL = jacm, VOLUME = 48, NUMBER = 4, PAGES = "798--859", YEAR = 2001, NOTE = "Earlier version in STOC'97", eprint="jacm:10.1145/502090.502098" } @ARTICLE{jackson:dnf, AUTHOR = "J. Jackson", TITLE = "An Efficient Membership-Query Algorithm for Learning {DNF} with Respect to the Uniform Distribution", JOURNAL = jcss, VOLUME = 55, NUMBER = 3, PAGES = "414--440", YEAR = 1997, NOTE = "Earlier version in FOCS'94", eprint="jcss:10.1006/jcss.1997.1533" } @BOOK{janson:gaussian, AUTHOR = "S. Janson", TITLE = "Gaussian Hilbert Spaces", SERIES = "Cambridge Tracts in Mathematics", VOLUME = 129, PUBLISHER = cup, YEAR = 1997, } @INPROCEEDINGS{kkl:influence, AUTHOR = "J. Kahn and G. Kalai and N. Linial", TITLE = "The Influence of Variables on {B}oolean Functions", BOOKTITLE = "Proc. 29th FOCS", PUBLISHER = "IEEE Computer Society Press", PAGES = "68--80", YEAR = 1988, } @TECHREPORT{kalai:socialchoice, AUTHOR = "G. Kalai", TITLE = "Noise sensitivity and chaos in social choice theory", INSTITUTION = "Discussion Paper Series dp399. Center for rationality and interactive decision theory, Hebrew University", YEAR = 2005, NOTE = "Available at \url{http://www.ma.huji.ac.il/~kalai/CHAOS.pdf}", } @INCOLLECTION{kalai&safra:threshold, AUTHOR = "G. Kalai and S. Safra", TITLE = "Threshold Phenomena and Influence", PAGES = "25--60", CROSSREF = "ccandphysics", } @BOOK{ccandphysics, EDITOR = "A.G. Percus and G. Istrate and C. Moore", TITLE = "Computational Complexity and Statistical Physics", BOOKTITLE = "Computational Complexity and Statistical Physics", PUBLISHER = oup, YEAR = "2006", } @INPROCEEDINGS{khot:ugc, AUTHOR = "S. Khot", TITLE = "On the power of unique 2-Prover 1-Round games", BOOKTITLE = "Proc. 34th STOC", PUBLISHER = "ACM Press", PAGES = "767-–775", YEAR = 2002, eprint="stoc:509907.510017" } @ARTICLE{kkmo:maxcutj, AUTHOR = "S. Khot and G. Kindler and E. Mossel and R. {O'Donnell}", TITLE = "Optimal inapproximability results for {MAX-CUT} and other 2-variable {CSP}s?", JOURNAL = siamjc, VOLUME = 37, NUMBER = 1, PAGES = "319--357", YEAR = 2007, eprint="sicomp:10.1137/S0097539705447372" } @INPROCEEDINGS{khot&vishnoi:cutproblems, AUTHOR = "S. Khot and N. Vishnoi", TITLE = "The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into {$\ell_1$}", BOOKTITLE = "Proc. 46th FOCS", PUBLISHER = "IEEE Computer Society Press", PAGES = "53--62", YEAR = 2005, eprint="focs:10.1109/SFCS.2005.74" } @INPROCEEDINGS{khot&odonnell:maxcutgain, AUTHOR = "S. Khot and R. {O'Donnell}", TITLE = "{SDP} gaps and {UGC}-hardness for {MAXCUTGAIN}", BOOKTITLE = "Proc. 47th FOCS", PUBLISHER = "IEEE Computer Society Press", PAGES = "217--226", YEAR = 2006, eprint="focs:10.1109/FOCS.2006.67" } @ARTICLE{khot®ev:vertexcover, AUTHOR = "S. Khot and O. Regev", TITLE = "Vertex Cover Might be Hard to Approximate to within {$2-\epsilon$}", JOURNAL = jcss, VOLUME = 74, NUMBER = 3, PAGES = "335--349", YEAR = 2008, NOTE = "Earlier version in Complexity'03", eprint="jcss:10.1016/j.jcss.2007.06.019" } @ARTICLE{klauck:qcclowerj, AUTHOR = "H. Klauck", TITLE = "Lower bounds for quantum communication complexity", JOURNAL = siamjc, VOLUME = 37, NUMBER = 1, PAGES = "20--46", YEAR = 2007, NOTE = "Earlier version in FOCS'01", eprint="sicomp:10.1137/S0097539702405620" } @ARTICLE{klivans&servedio:dnf, AUTHOR = "A. Klivans and R. Servedio", TITLE = "Learning {DNF} in time {$2^{\tilde{O}(n^{1/3})}$}", JOURNAL = jcss, VOLUME = 68, NUMBER = 2, PAGES = "303--318", YEAR = 2004, NOTE = "Earlier version in STOC'01", eprint="jcss:10.1016/j.jcss.2003.07.007" } @ARTICLE{kushilevitz&mansour:dectrees, AUTHOR = "E. Kushilevitz and Y. Mansour", TITLE = "Learning Decision Trees Using the {F}ourier Spectrum", JOURNAL = siamjc, VOLUME = 22, NUMBER = 6, PAGES = "1331--1348", YEAR = 1993, NOTE = "Earlier version in STOC'91", eprint="sicomp:10.1137/0222080" } @ARTICLE{LeeNaor04, AUTHOR = {Lee, J. R. and Naor, A.}, TITLE = {Embedding the diamond graph in {$L\sb p$} and dimension reduction in {$L\sb 1$}}, JOURNAL = GeomFunctAnal, VOLUME = {14}, YEAR = {2004}, NUMBER = {4}, PAGES = {745--747}, eprint="springer:r36q4553fwheur9u" } @ARTICLE{lmn:learnability, AUTHOR = "N. Linial and Y. Mansour and N. Nisan", TITLE = "Constant Depth Circuits, {F}ourier Transform, and Learnability", JOURNAL = jacm, VOLUME = 40, NUMBER = 3, PAGES = "607--620", YEAR = 1993, NOTE = "Earlier version in FOCS'89", eprint="jacm:10.1145/502090.502098" } @BOOK{MacWilliamsS77, AUTHOR = "F. MacWilliams and N. Sloane", TITLE = "The Theory of Error-Correcting Codes", PUBLISHER = "North-Holland", YEAR = 1977, } @ARTICLE{mansour:dnfuniform, AUTHOR = "Y. Mansour", TITLE = "An {$O(n^{\log\log n})$} learning algorithm for {DNF} under the uniform distribution", JOURNAL = jcss, VOLUME = 50, NUMBER = 3, PAGES = "543--550", YEAR = 1995, NOTE = "Earlier version in COLT'92", eprint="jcss:10.1006/jcss.1995.1043" } @ARTICLE{mos:learningjuntas, AUTHOR = "E. Mossel and R. {O'Donnell} and R. Servedio", TITLE = "Learning functions of {$k$} relevant variables", JOURNAL = jcss, VOLUME = 69, NUMBER = 3, PAGES = "421--434", YEAR = 2004, NOTE = "Earlier version in STOC'03", eprint="jcss:10.1016/j.jcss.2004.04.002" } @ARTICLE{moo:noisestability, AUTHOR = "E. Mossel and R. {O'Donnell} and K. Oleszkiewicz", TITLE = "Noise stability of functions with low influences: invariance and optimality", JOURNAL = AnnofMath, YEAR = 2008, NOTE = "To appear. Earlier version in FOCS'05", } @INPROCEEDINGS{navon&samorodnitsky:delsarte, AUTHOR = "M. Navon and A. Samorodnitsky", TITLE = "On {D}elsarte's Linear Programming Bounds for Binary Codes", BOOKTITLE = "Proc. 46th FOCS", PUBLISHER = "IEEE Computer Society Press", PAGES = "327--338", YEAR = 2005, eprint="focs:10.1109/SFCS.2005.55" } @ARTICLE{nisan&szegedy:degree, AUTHOR = "N. Nisan and M. Szegedy", TITLE = "On the Degree of {B}oolean functions as Real Polynomials", JOURNAL = ccomplex, VOLUME = 4, NUMBER = 4, PAGES = "301--313", YEAR = 1994, NOTE = "Earlier version in STOC'92", eprint="cc:p1711275700w5264" } @MISC{odonnell:notes, AUTHOR = "R. {O'Donnell}", TITLE = {Lecture notes for a course ``{Analysis} of {Boolean} functions''}, NOTE = "Available at \url{http://www.cs.cmu.edu/~odonnell/boolean-analysis}", YEAR = 2007, } @TECHREPORT{odonnell:survey, AUTHOR = "R. {O'Donnell}", TITLE = "Some Topics in Analysis of {Boolean} Functions", INSTITUTION = "ECCC Report TR08--055", YEAR = 2008, NOTE = "Paper for an invited talk at STOC'08", eprint="eccc:TR08-055" } @INPROCEEDINGS{odonnell&servedio:extremal, AUTHOR = "R. {O'Donnell} and R. Servedio", TITLE = "Extremal properties of polynomial threshold functions", BOOKTITLE = "Proc. 18th Conf. Comput. Complexity", PUBLISHER = "IEEE Computer Society Press", YEAR = 2003, PAGES = "3--12", } @ARTICLE{odonnell&servedio:montrees, AUTHOR = "R. {O'Donnell} and R. Servedio", TITLE = "Learning Monotone Decision Trees in Polynomial Time", JOURNAL = siamjc, VOLUME = 37, NUMBER = 3, PAGES = "827--844", YEAR = 2007, NOTE = "Earlier version in Complexity'06", eprint="sicomp:10.1137/060669309" } @INPROCEEDINGS{dsss:dectreeinfluence, AUTHOR = "R. {O'Donnell} and M. Saks and O. Schramm and R. Servedio", TITLE = "Every decision tree has an influential variable", BOOKTITLE = "Proc. 46th FOCS", PUBLISHER = "IEEE Computer Society Press", PAGES = "31--39", YEAR = 2005, eprint="focs:10.1109/SFCS.2005.34" } @INPROCEEDINGS{raghavendra:csp, AUTHOR = "P. Raghavendra", TITLE = "Optimal algorithms and inapproximability results for every {CSP}?", BOOKTITLE = "Proc. 40th STOC", PUBLISHER = "ACM Press", PAGES = "245--254", YEAR = 2008, eprint="stoc:1374376.1374414" } @ARTICLE{raz:ccfourier, AUTHOR = "R. Raz", TITLE = "{Fourier} Analysis for Probabilistic Communication Complexity", JOURNAL = ccomplex, VOLUME = 5, NUMBER = "3/4", PAGES = "205--221", YEAR = "1995", eprint="cc:p7346675080r85r4" } @MASTERSTHESIS{stefankovic:thesis, AUTHOR = "D. {\v{S}}tefankovi{\v{c}}", TITLE = "{Fourier} transforms in computer science", SCHOOL = "University of Chicago, Department of Computer Science", YEAR = 2000, NOTE = "Available at \url{http://www.cs.rochester.edu/~stefanko/Publications/Fourier.ps}", } @ARTICLE{schwartz:probabilistic, AUTHOR = "J. T. Schwartz", TITLE = "Fast probabilistic algorithms for verification of polynomial identities", JOURNAL = jacm, VOLUME = 27, number=4, PAGES = "701--717", YEAR = 1980, eprint="jacm:10.1145/322217.322225" } @ARTICLE{servedio:lowweightj, AUTHOR = "R. Servedio", TITLE = "Every linear threshold function has a low-weight approximator", JOURNAL = ccomplex, VOLUME = 16, NUMBER = 2, YEAR = 2007, PAGES = "180--209", NOTE = "Earlier version in Complexity'06", eprint="cc:64682257x6344776" } @TECHREPORT{sherstov:dualpoly, AUTHOR = "A. Sherstov", TITLE = "Communication Lower Bounds Using Dual Polynomials", INSTITUTION = "ECCC Report TR08--057", YEAR = 2008, eprint="eccc:TR08-057" } @ARTICLE{shi:lowerbound, AUTHOR = "Y. Shi", TITLE = "Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of {B}oolean variables", JOURNAL = ipl, VOLUME = 75, NUMBER = "1--2", PAGES = "79--83", YEAR = 2000, eprint="ipl:10.1016/S0020-0190(00)00069-7" } @INPROCEEDINGS{sudan:listdecodingsurvey, AUTHOR = "M. Sudan", TITLE = "List decoding: Algorithms and applications", BOOKTITLE = "Proc. Intern. Conf. IFIP TCS", SERIES = lncs, VOLUME = 1872, PUBLISHER = springer, PAGES = "25--41", YEAR = 2000, } @ARTICLE{talagrand:increasingsets, AUTHOR = "M. Talagrand", TITLE = "How much are increasing sets positively correlated?", JOURNAL = comba, VOLUME = 16, NUMBER = 2, PAGES = "243--258", YEAR = 1996, eprint="springer:uvm737238p44xk37" } @ARTICLE{talagrand:russo, AUTHOR = "M. Talagrand", TITLE = "On {R}usso's approximate 0-1 law", JOURNAL = AnnProbab, VOLUME = 22, number=3, PAGES = "1576--1587", YEAR = 1994, note="\url{http://projecteuclid.org/euclid.aop/1176988612}" } @INPROCEEDINGS{zippel:probabilistic, AUTHOR = "R. E. Zippel", TITLE = "Probabilistic algorithms for sparse polynomials", BOOKTITLE = "Proc. EUROSAM 79", SERIES = lncs, PUBLISHER = springer, VOLUME = 72, PAGES = "216--226", YEAR = 1979, } @STRING{PRL = {Phys. Rev. Lett.}} @STRING{QIC = {Quantum Information and Computation}} @STRING{SICOMP = {SIAM J. Computing}} @STRING{JACM = {J. ACM}} @STRING{JCSS = {J. Comput. Sys. Sci.}} @STRING{TCS = {Theoretical Computer Sci.}} @STRING{IPL = {Inform. Proc. Lett.}} @INPROCEEDINGS{aar:col, AUTHOR = {S. Aaronson}, TITLE = {Quantum lower bound for the collision problem}, BOOKTITLE = {Proc. 34th ACM STOC}, PAGES = {635-642}, YEAR = {2002}, EPRINT = {stoc:509907.509999, quant-ph/0111102} } @INPROCEEDINGS{aar:advconf, AUTHOR = {S. Aaronson}, TITLE = {Limitations of quantum advice and one-way communication}, BOOKTITLE = {19th IEEE Conf. Comput. Complexity (CCC)}, PAGES = {320-332}, YEAR = {2004}, EPRINT = {ccc:10.1109/CCC.2004.1313854, quant-ph/0402095} } @UNPUBLISHED{aar:pp, AUTHOR = {S. Aaronson}, TITLE = {Quantum computing, postselection, and probabilistic polynomial-time}, YEAR = {2004}, EPRINT = {quant-ph/0412187}, NOTE = {Submitted} } @ARTICLE{adh, AUTHOR = {L. Adleman and J. DeMarrais and M.-D. Huang}, TITLE = {Quantum computability}, JOURNAL = SICOMP, VOLUME = {26}, NUMBER = {5}, PAGES = {1524-1540}, YEAR = {1997}, eprint = {sicomp:10.1137/S0097539795293639} } @ARTICLE{antv, AUTHOR = {A. Ambainis and A. Nayak and A. Ta-Shma and U. V. Vazirani}, TITLE = {Quantum dense coding and quantum finite automata}, JOURNAL = JACM, VOLUME = {49}, PAGES = {496-511}, YEAR = {2002}, NOTE = {Earlier version in 31st ACM STOC, 1999, pp. 376-383}, EPRINT = {jacm:581771.581773, quant-ph/9804043} } @INPROCEEDINGS{bjk, AUTHOR = {Z. Bar-Yossef and T. S. Jayram and I. Kerenidis}, TITLE = {Exponential separation of quantum and classical one-way communication complexity}, BOOKTITLE = {36th ACM STOC}, PAGES = {128-137}, YEAR = {2004}, eprint = {stoc:1007352.1007379, eccc:TR04-036} } @ARTICLE{bbcmw, AUTHOR = {R. Beals and H. Buhrman and R. Cleve and M. Mosca and Wolf, R. de}, TITLE = {Quantum lower bounds by polynomials}, JOURNAL = JACM, VOLUME = {48}, NUMBER = {4}, PAGES = {778-797}, YEAR = {2001}, NOTE = {Earlier version in 39th IEEE FOCS, 1998, pp. 352-361.}, eprint = {jacm:502090.502097, quant-ph/9802049} } @ARTICLE{bbbv, AUTHOR = {C. Bennett and E. Bernstein and G. Brassard and U. Vazirani}, TITLE = {Strengths and weaknesses of quantum computing}, JOURNAL = SICOMP, VOLUME = {26}, NUMBER = {5}, PAGES = {1510-1523}, YEAR = {1997}, EPRINT = {sicomp:30093, quant-ph/9701001} } @ARTICLE{bbcjpy, AUTHOR = {C. H. Bennett and G. Brassard and C. Cr\'{e}peau and R. Jozsa and A. Peres and W. Wootters}, TITLE = {Teleporting an unknown quantum state by dual classical and {EPR} channels}, JOURNAL = PRL, VOLUME = {70}, PAGES = {1895-1898}, YEAR = {1993}, eprint = {prl:10.1103/PhysRevLett.70.1895} } @ARTICLE{bg, AUTHOR = {C. H. Bennett and J. Gill}, TITLE = {Relative to a random oracle {A}, {$P^{A}\neq NP^{A}\neq coNP^{A}$} with probability 1}, JOURNAL = SICOMP, VOLUME = {10}, NUMBER = {1}, PAGES = {96-113}, YEAR = {1981}, eprint = {sicomp:10/0210008} } @ARTICLE{bernstein, AUTHOR = {S. N. Bernstein}, TITLE = {Sur l'ordre de la meilleure approximation des fonctions continues par les polyn\^{o}mes de degr\'{e} donn\'{e}}, JOURNAL = {Mem. Cl. Sci. Acad. Roy. Belg.}, VOLUME = {4}, PAGES = {1-103}, YEAR = {1912}, NOTE = {French}, URL = {http://www.math.technion.ac.il/hat/fpapers/ber2.pdf} } @ARTICLE{bcww, AUTHOR = {H. Buhrman and R. Cleve and J. Watrous and Wolf, R. de}, TITLE = {Quantum fingerprinting}, JOURNAL = PRL, VOLUME = {87}, NUMBER = {16}, YEAR = {2001}, NOTE = {4 pages.}, eprint = {prl:10.1103/PhysRevLett.87.167902, quant-ph/0102001} } @ARTICLE{bw, AUTHOR = {H. Buhrman and Wolf, R. de}, TITLE = {Complexity measures and decision tree complexity: a survey}, JOURNAL = TCS, VOLUME = {288}, PAGES = {21-43}, eprint= {tcs:10.1016/S0304-3975(01)00144-X}, YEAR = {2002}, URL = {http://homepages.cwi.nl/~rdewolf/publ/qc/dectree.ps} } @INPROCEEDINGS{dhrs, AUTHOR = {P. Duri\v{s} and J. Hromkovi\v{c} and J. D. P. Rolim and G. Schnitger}, TITLE = {Las {V}egas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations}, BOOKTITLE = {14th Symp. Theoret. Aspects of Comp.Sci. (STACS)}, PAGES = {117-128}, YEAR = {1997} } @ARTICLE{ez, AUTHOR = {H. Ehlich and K. Zeller}, TITLE = {Schwankung von {P}olynomen zwischen {G}itterpunkten}, JOURNAL = {Mathematische Zeitschrift}, VOLUME = {86}, PAGES = {41-44}, YEAR = {1964} } @ARTICLE{fr, AUTHOR = {L. Fortnow and J. Rogers}, TITLE = {Complexity limitations on quantum computation}, JOURNAL = JCSS, VOLUME = {59}, NUMBER = {2}, PAGES = {240-252}, YEAR = {1999}, eprint = {jcss:10.1006/jcss.1999.1651, cs.CC/9811023} } @UNPUBLISHED{goldreich:qc, AUTHOR = {O. Goldreich}, TITLE = {On quantum computing}, YEAR = {2004. 1 page}, URL = {http://www.wisdom.weizmann.ac.il/~oded/on-qc.html} } @ARTICLE{hht, AUTHOR = {Y. Han and L. Hemaspaandra and T. Thierauf}, TITLE = {Threshold computation and cryptographic security}, JOURNAL = SICOMP, VOLUME = {26}, NUMBER = {1}, PAGES = {59-78}, YEAR = {1997}, eprint = {sicomp:24046} } @ARTICLE{holevo, AUTHOR = {A. S. Holevo}, TITLE = {Some estimates of the information transmitted by quantum communication channels}, JOURNAL = {Problems of Information Transmission}, VOLUME = {9}, PAGES = {177-183}, YEAR = {1973}, NOTE = {English translation} } @INPROCEEDINGS{klauck:cc, AUTHOR = {H. Klauck}, TITLE = {Quantum communication complexity}, BOOKTITLE = {27th Int'l. Colloq. on Automata, Languages, and Programming (ICALP)}, PAGES = {241-252}, YEAR = {2000}, EPRINT = {quant-ph/0005032} } @INPROCEEDINGS{klauck:ts, AUTHOR = {H. Klauck}, TITLE = {Quantum time-space tradeoffs for sorting}, BOOKTITLE = {35th ACM STOC}, PAGES = {69-76}, YEAR = {2003}, EPRINT = {stoc:780542.780553, quant-ph/0211174} } @INPROCEEDINGS{ksw, AUTHOR = {H. Klauck and R. \v{S}palek and Wolf, R. de}, TITLE = {Quantum and classical strong direct product theorems and optimal time-space tradeoffs}, BOOKTITLE = {45th IEEE FOCS}, PAGES = {12-21}, YEAR = {2004}, EPRINT = {focs:10.1109/FOCS.2004.52, quant-ph/0402123}, } @BOOK{kn, AUTHOR = {E. Kushilevitz and N. Nisan}, TITLE = {Communication Complexity}, PUBLISHER = {Cambridge}, YEAR = {1997} } @ARTICLE{aamarkov, AUTHOR = {A. A. Markov}, TITLE = {On a question by {D}. {I}. {M}endeleev}, JOURNAL = {Zapiski Imperatorskoi Akademii Nauk}, VOLUME = {SP6}, NUMBER = {62}, PAGES = {1-24}, YEAR = {1890}, NOTE = {Russian. English translation at \url{http://www.math.technion.ac.il/hat/fpapers/markov4.pdf}} } @ARTICLE{vamarkov, AUTHOR = {V. A. Markov}, TITLE = {{\"{U}}ber {P}olynome, die in einem gegebenen {I}ntervalle m\"{o}glichst wenig von {N}ull abweichen}, JOURNAL = {Math. Ann.}, VOLUME = {77}, PAGES = {213-258}, YEAR = {1916}, NOTE = {German. Originally written in 1892}, URL = {http://www.math.technion.ac.il/hat/fpapers/vmar.pdf} } @BOOK{mp, AUTHOR = {M. Minsky and S. Papert}, TITLE = {Perceptrons (2nd edition)}, PUBLISHER = {MIT Press}, YEAR = {1988}, NOTE = {First appeared in 1968} } @INPROCEEDINGS{nayak, AUTHOR = {A. Nayak}, TITLE = {Optimal lower bounds for quantum automata and random access codes}, BOOKTITLE = {40th IEEE FOCS}, PAGES = {369-377}, YEAR = {1999}, EPRINT = {focs:10.1109/SFFCS.1999.814608, quant-ph/9904093} } @BOOK{nc, AUTHOR = {M. Nielsen and I. Chuang}, TITLE = {Quantum Computation and Quantum Information}, PUBLISHER = {Cambridge University Press}, YEAR = {2000} } @ARTICLE{ns, AUTHOR = {N. Nisan and M. Szegedy}, TITLE = {On the degree of {B}oolean functions as real polynomials}, JOURNAL = {Computational Complexity}, VOLUME = {4}, NUMBER = {4}, PAGES = {301-313}, YEAR = {1994}, URL = {http://www.cs.huji.ac.il/~noam/degree.ps} } @ARTICLE{ny, AUTHOR = {H. Nishimura and T. Yamakami}, TITLE = {Polynomial time quantum computation with advice}, JOURNAL = IPL, VOLUME = {90}, PAGES = {195-204}, YEAR = {2003}, eprint = {ipl:10.1016/j.ipl.2004.02.005, eccc:TR03-059, quant-ph/0305100} } @UNPUBLISHED{ry, AUTHOR = {M. Rabin and A. C-C. Yao}, YEAR = {1979}, NOTE = {Manuscript, cited in \cite{yao:cc}} } @BOOK{rivlin, AUTHOR = {T. J. Rivlin}, TITLE = {Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory}, PUBLISHER = {Wiley}, YEAR = {1990} } @ARTICLE{rc, AUTHOR = {T. J. Rivlin and E. W. Cheney}, TITLE = {A comparison of uniform approximations on an interval and a finite subset thereof}, JOURNAL = {SIAM J. Numerical Analysis}, VOLUME = {3}, NUMBER = {2}, PAGES = {311-320}, YEAR = {1966}, eprint = {sinum:03/0703024} } @ARTICLE{sauer, AUTHOR = {N. Sauer}, TITLE = {On the density of families of sets}, JOURNAL = {J. Combinatorial Theory Series A}, VOLUME = {13}, PAGES = {145-147}, YEAR = {1972}, eprint = {jcombtha:10.1016/0097-3165(72)90019-2} } @ARTICLE{shi:gate, AUTHOR = {Y. Shi}, TITLE = {Both {T}offoli and controlled-{NOT} need little help to do universal quantum computation}, JOURNAL = QIC, VOLUME = {3}, NUMBER = {1}, PAGES = {84-92}, YEAR = {2002}, EPRINT = {quant-ph/0205115}, url = {http://www.rintonpress.com/journals/qiconline.html#v3n1} } @INPROCEEDINGS{watrous, AUTHOR = {J. Watrous}, TITLE = {Succinct quantum proofs for properties of finite groups}, BOOKTITLE = {41st IEEE FOCS}, PAGES = {537-546}, YEAR = 2000, eprint = {focs:10.1109/SFCS.2000.892141, cs.CC/0009002}, } @INCOLLECTION{winter, AUTHOR = {A. Winter}, TITLE = {Quantum and classical message identification via quantum channels}, BOOKTITLE = {Quantum Information, Statistics, Probability (A. S. Holevo festschrift)}, PUBLISHER = {Rinton}, EDITOR = {O. Hirota}, PAGES = {172-189}, YEAR = {2004}, EPRINT = {quant-ph/0401060} } @INPROCEEDINGS{yao:fing, AUTHOR = {A. C-C. Yao}, TITLE = {On the power of quantum fingerprinting}, BOOKTITLE = {35th ACM STOC}, PAGES = {77-81}, YEAR = {2003}, eprint = {stoc:780542.780554, eccc:TR02-074} } @INPROCEEDINGS{yao:cc, AUTHOR = {A. C-C. Yao}, TITLE = {Some complexity questions related to distributive computing}, BOOKTITLE = {11th ACM STOC}, PAGES = {209-213}, YEAR = {1979}, eprint = {stoc:804414} } @MISC{yao:hw, AUTHOR = {A. C-C. Yao}, TITLE = {{P}rinceton {U}niversity course assignment}, YEAR = {2001}, URL = {http://www.cs.princeton.edu/courses/archive/spr01/cs598a/assignments/hw3.ps} } % ACR 4/12/05 Added ref for Shor with e-print field. @article{AS04, author = {Scott Aaronson and Yaoyun Shi}, title = "Quantum lower bounds for the collision and the element distinctness problems", journal = {Journal of the ACM}, volume = 51, number = 4, pages = "595-605", year = 2004, note = "Based on~\cite{Shi01} and~\cite{Aar02}", eprint = "jacm:1008735", } @article{Amb03-lower, author = {Andris Ambainis}, title = "Quantum lower bounds for collision and element distinctness with small range", journal = "Theory of Computing", year = 2005, volume = 1, number = 3, note = {To appear}, eprint = {toc:v001/a003, arxiv:quant-ph/0305179} } @InProceedings{Amb03-upper, author = {Andris Ambainis}, title = "Quantum walk algorithm for element distinctness", booktitle = "Proc. of the 45th IEEE FOCS", pages = {22--31}, year = 2004, eprint = {focs:10.1109/FOCS.2004.54, quant-ph/0311001}, } @InProceedings{Aar02, author = {Scott Aaronson}, title = {Quantum lower bound for the collision problem}, booktitle = "Proc. of the 34th ACM STOC", year = 2002, pages = "635-642", eprint = {stoc:509907.509999, arxiv:quant-ph/0111102} } @InProceedings{Shi01, author = {Yaoyun Shi}, title = {Quantum lower bounds for the collision and the element distinctness problems}, booktitle = "Proc. of the 43th IEEE FOCS", year = 2002, pages = "513-519", eprint = {focs:10.1109/SFCS.2002.1181975, arxiv:quant-ph/0112086}, } @article{Shor, author = "Peter~W. Shor", title = "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer", journal = sicomp, year = 1997, volume = 26, number = 5, pages = "1484-1509", eprint = {sicomp:29317} } @InProceedings{BBCMdW, author = {Bob Beals and Harry Buhrman and Richard Cleve and Michele Mosca and Ronald de Wolf}, title = "Quantum lower bounds by polynomials", booktitle = "Proc. of the 39th IEEE FOCS", Year = 1998, pages = "352-361", eprint = {focs:10.1109/SFCS.1998.743485, arxiv:quant-ph/9802049} } @InProceedings{Pat92, author = {Ramamohan Paturi}, title = "On the degree of polynomials that approximate symmetric boolean functions", booktitle = "Proc. of the 24th ACM STOC", year = 1992, pages = "468-474", eprint = "stoc:129758" } @article{NS92, author = "Noam Nisan and M{\'a}ri{\'o} Szegedy", title = "On the degree of Boolean functions as real polynomials", journal = "Computational Complexity", volume = 4, pages = "301-313", year = 1994, eprint = {stoc:129757} } @InBook{BHT97, author = "Gilles Brassard and Peter H{\o}yer and Alain Tapp", title = "Quantum Cryptanalysis of Hash and Claw-Free Functions", booktitle = "3rd Latin American Theoretical Informatics Symposium (LATIN '98)", series = "Lecture Notes in CS", volume = 1380, publisher = "Springer-Verlag", pages = "163-169", year = 1998, eprint = {latin:11bhjthw46dxl2qa, arxiv:quant-ph/9805082} } @InProceedings{G96, Author = "Lov~K. Grover", Title = "A fast quantum mechanical algorithm for database search", booktitle = "Proc. of the 28th ACM STOC", Year = 1996, Pages = "212-219", eprint = {stoc:237814.237866, arxiv:quant-ph/9605043} } @InProceedings{Aaronson, author = {S. Aaronson}, title = {Quantum lower bound for the collision problem}, booktitle = {Proceedings of STOC'02}, pages = {635--642}, year = 2002, eprint = {stoc:509907.509999, quant-ph/0111102} } @Article{AS, author = {S. Aaronson and Y. Shi}, title = {Quantum lower bounds for the collision and the element distinctness problems}, journal = {Journal of ACM}, volume = {51}, number = 4, pages = {595--605}, year = {2004}, note = {Earlier versions in \cite{Aaronson} and \cite{Shi}}, eprint = {jacm:1008731.1008735} } @Article{AmbainisAdv, author = {A. Ambainis}, title = {Quantum lower bounds by quantum arguments}, journal = {Journal of Computer and System Sciences}, volume = {64}, pages = {750--767}, year = {2002}, eprint = {jcss:10.1006/jcss.2002.1826, quant-ph/0002066} } @InProceedings{AmbainisPoly, author = {A. Ambainis}, title = {Polynomial degree vs. quantum query complexity}, booktitle = {Proceedings of FOCS'03}, pages = {230--239}, year = 2003, eprint = {focs:10.1109/SFCS.2003.1238197, quant-ph/0305028}, } @InProceedings{Ambainis, author = {A. Ambainis}, title = {Quantum walk algorithm for element distinctness}, booktitle = {Proceedings of FOCS'04}, pages = {22--31}, year = 2004, eprint = {focs:10.1109/FOCS.2004.54,quant-ph/0311001} } @Article{Beals, author = {R. Beals and H. Buhrman and R. Cleve and M. Mosca and R. de Wolf}, title = {Quantum lower bounds by polynomials}, journal = {Journal of ACM}, volume = {48}, pages = {778--797}, year = {2001}, note = {Earlier version at FOCS'98}, eprint = {jacm:502090.502097, quant-ph/9802049} } @InProceedings{BCW, author = {H. Buhrman and R. Cleve and A. Wigderson}, title = {Quantum vs. classical communication and computation}, booktitle = {Proceedings of STOC'98}, pages = {63--68}, year = 1998, eprint = {stoc:276698.276713}, } @InProceedings{BDistinct, author = {H. Buhrman and C. Durr and M. Heiligman and P. H\o yer and F. Magniez and M. Santha and R. de Wolf}, title = {Quantum algorithms for element distinctness}, booktitle = {16th IEEE Annual Conference on Computational Complexity (CCC'01)}, pages = {131--137}, year = 2001, eprint = {ccc:10.1109/CCC.2001.933880, quant-ph/0007016} } @Article{BCollision, author = {G. Brassard and P. H\o yer and A. Tapp}, title = {Quantum algorithm for the collision problem}, journal = {SIGACT News}, volume = 28, pages = {14--19}, year = 1997, eprint = {quant-ph/9705002} } @InProceedings{Counting, author = {G. Brassard and P. H\o yer and A. Tapp}, title = {Quantum counting}, booktitle = {Proceedings of ICALP'98}, pages = {820--831}, year = 1998, eprint = {icalp:ap2mrf08d8gcqppe, quant-ph/9805082} } @UnPublished{BS, author = {H. Buhrman and R. \v{S}palek}, title = {Quantum verification of matrix products}, eprint = {quant-ph/0409035} } @Article{BWSurvey, author = {H. Buhrman and R. de Wolf}, title = {Complexity measures and decision tree complexity: a survey}, journal = {Theoretical Computer Science}, volume = {288}, pages = {21--43}, year = 2002, eprint = {tcs:10.1016/S0304-3975(01)00144-X} } @Book{CLR, author = {T. Cormen and C. Leiserson and R. Rivest and C. Stein}, title = {Introduction to Algorithms, 2nd edition}, publisher = {The MIT Press and McGraw-Hill Book Company}, year = 2001 } @InProceedings{Grover, author = {L. Grover}, title = {A fast quantum mechanical algorithm for database search}, booktitle = {Proceedings of STOC'96}, pages = {212--219}, year = 1996, eprint = {stoc:237814.237866, quant-ph/9605043} } @InProceedings{Grover97, author = {L. Grover}, title = {A framework for fast quantum mechanical algorithms}, booktitle = {Proceedings of STOC'98}, pages = {53--62}, year = 1998, eprint = {stoc:276698.276712, quant-ph/9711043} } @Article{HNS, author = {P. Hoyer and J. Neerbek and Y. Shi}, title = {Quantum lower bounds of ordered searching, sorting and element distinctness}, journal = {Algorithmica}, volume = 34, pages = {429--448}, year = 2002, note = {Earlier version at ICALP'01}, eprint={algorithmica:25gl9elr5rxr3q6a, quant-ph/0102078} } @Article{Kutin, author = {S. Kutin}, title = {Quantum lower bound for the collision problem}, journal = {Theory of Computing}, volume = 1, number = 2, pages = {29--36}, year = 2005, eprint = {toc:v001/a002, quant-ph/0304162} } @InProceedings{MSS, author = {F. Magniez and M. Santha and M. Szegedy}, title = {Quantum algorithms for the triangle problem}, booktitle = {Proceedings of SODA'05}, year = 2005, eprint = {quant-ph/0310134} } @InProceedings{NW, author = {A. Nayak and F. Wu}, title = {The quantum query complexity of approximating the median and related statistics}, booktitle = {Proceedings of STOC'99}, pages = {384--393}, year = 1999, eprint = {stoc:301250.301349, quant-ph/9804066} } @Article{NS, author = {N. Nisan and M. Szegedy}, title = {On the degree of Boolean functions as real polynomials}, journal = {Computational Complexity}, volume = 4, pages = {301--313}, year = 1994, } @InProceedings{Shi, author = {Y. Shi}, title = {Quantum lower bounds for the collision and the element distinctness problems}, booktitle = {Proceedings of FOCS'02}, pages = {513--519}, year = 2002, eprint = {focs:10.1109/SFCS.2002.1181975, quant-ph/0112086} } @Unpublished{Shi1, author = {Y. Shi}, title = {Approximating linear restrictions of Boolean functions}, note = {Manuscript} } @string(stoc="Proc. ACM STOC") @string(focs="Proc. IEEE FOCS") @string(ccc="Proc. IEEE Conference on Computational Complexity") @string(soda="Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA)") @string(stacs="Proc. Intl. Symp. on Theoretical Aspects of Computer Science (STACS)") @string(icalp="Proc. Intl. Colloquium on Automata, Languages, and Programming (ICALP)") @string(prl="Phys. Rev. Lett.") @string(pra="Phys. Rev. A") @string(prd="Phys. Rev. D") @string(qic="Quantum Information and Computation") @string(sicomp="SIAM J. Comput.") @string(jacm="J. ACM") @string(jcss="J. Comput. Sys. Sci.") @string(tcs="Theoretical Comput. Sci.") @string(toc="Theory of Computing") @string(prs="Proc. Roy. Soc. London") @string(pnas="Proc. Nat. Acad. of Sciences (USA)") @string(ipl="Inform. Proc. Lett.") @string(lncs="Lecture Notes in Computer Science") @string(springer="Springer-Verlag") @string(jhep="J. High Energy Phys.") @string(cqg="Classical and Quantum Gravity") @inproceedings{aakv, author = {D. Aharonov and A. Ambainis and J. Kempe and U. Vazirani}, title = {Quantum walks on graphs}, booktitle = stoc, pages = {50-59}, year = {2001}, eprint = {stoc:380752.380758,arxiv:quant-ph/0012090} } @article{ambainis, author = {A. Ambainis}, title = {Quantum lower bounds by quantum arguments}, journal = jcss, volume = 64, pages = {750-767}, year = 2002, eprint = {jcss:10.1006/jcss.2002.1826,stoc:335305.335394,arxiv:quant-ph/0002066}, } @inproceedings{akr, author = {A. Ambainis and J. Kempe and A. Rivosh}, title = {Coins make quantum walks faster}, booktitle = soda, year = {2005}, note = {To appear.}, eprint = {arxiv:quant-ph/0402107} } @article{bbcmw, author = {R. Beals and H. Buhrman and R. Cleve and M. Mosca and Wolf, R. de}, title = {Quantum lower bounds by polynomials}, journal = jacm, volume = 48, number = 4, pages = {778-797}, year = 2001, note = {Earlier version in IEEE FOCS 1998.}, eprint = {jacm:502090.502097,focs:10.1109/SFCS.1998.743485,arxiv:quant-ph/9802049} } @article{bekenstein, author = {J. D. Bekenstein}, title = {A universal upper bound on the entropy to energy ratio for bounded systems}, journal = prd, volume = {23}, number = {2}, pages = {287-298}, year = {1981}, eprint = {prd:10.1103/PhysRevD.23.287} } @incollection{benioff:robot, author = {P. Benioff}, title = {Space searches with a quantum robot}, booktitle = {Quantum Computation and Information}, series = {Contemporary Mathematics Series}, publisher = {AMS}, editor = {S. J. Lomonaco and H. E. Brandt}, year = {2002}, eprint = {arxiv:quant-ph/0003006} } @article{bbbv, author = {C. Bennett and E. Bernstein and G. Brassard and U. Vazirani}, title = {Strengths and weaknesses of quantum computing}, journal = sicomp, volume = {26}, number = {5}, pages = {1510-1523}, year = {1997}, eprint = {sicomp:30093,arxiv:quant-ph/9701001} } @article{bousso:vac, author = {R. Bousso}, title = {Positive vacuum energy and the {N}-bound}, journal = jhep, volume = {0011}, number = {038}, year = {2000}, eprint = {arxiv:hep-th/0010252} } @article{bousso, author = {R. Bousso}, title = {The holographic principle}, journal = {Reviews of Modern Physics}, volume = {74}, number = {3}, year = {2002}, eprint = {arxiv:hep-th/0203101} } @article{bbht, author = {M. Boyer and G. Brassard and P. H{\o}yer and A. Tapp}, title = {Tight bounds on quantum searching}, journal = {Fortschritte Der Physik}, volume = {46}, number = {4-5}, pages = {493-505}, year = {1998}, eprint = {arxiv:quant-ph/9605034} } @incollection{bhmt, author = {G. Brassard and P. H{\o}yer and M. Mosca and A. Tapp}, title = {Quantum amplitude amplification and estimation}, booktitle = {Quantum Computation and Information}, series = {Contemporary Mathematics Series}, publisher = {AMS}, editor = {S. J. Lomonaco and H. E. Brandt}, year = {2002}, eprint = {arxiv:quant-ph/0005055} } @inproceedings{bcw, author = {H. Buhrman and R. Cleve and A. Wigderson}, title = {Quantum vs. classical communication and computation}, booktitle = stoc, pages = {63-68}, year = {1998}, eprint = {stoc:276698.276713,arxiv:quant-ph/9702040} } @inproceedings{ccdfgs, author = {A. M. Childs and R. Cleve and E. Deotto and E. Farhi and S. Gutmann and D. A. Spielman}, title = {Exponential algorithmic speedup by quantum walk}, booktitle = stoc, pages = {59-68}, year = {2003}, eprint = {stoc:780542.780552,arxiv:quant-ph/0209131} } @article{cfg, author = {A. M. Childs and E. Farhi and S. Gutmann}, title = {An example of the difference between quantum and classical random walks}, journal = qic, volume = {1}, number = {1-2}, pages = {35-43}, year = {2002}, eprint = {arxiv:quant-ph/0103020} } @article{cg, author = {A. M. Childs and J. Goldstone}, title = {Spatial search by quantum walk}, journal = pra, volume = {70}, number = {022314}, year = {2004}, eprint = {pra:10.1103/PhysRevA.70.022314,arxiv:quant-ph/0306054} } @article{cg2, author = {A. M. Childs and J. Goldstone}, title = {Spatial search and the {D}irac equation}, journal = pra, volume = {70}, number = {042312}, year = {2004}, eprint = {pra:10.1103/PhysRevA.70.042312,arxiv:quant-ph/0405120} } @inproceedings{grover, author = {L. K. Grover}, title = {A fast quantum mechanical algorithm for database search}, booktitle = stoc, pages = {212-219}, year = {1996}, eprint = {stoc:237814.237866,arxiv:quant-ph/9605043} } @inproceedings{grover:framework, author = {L. K. Grover}, title = {A framework for fast quantum mechanical algorithms}, booktitle = stoc, pages = {53-62}, year = {1998}, eprint = {stoc:276698.276712,arxiv:quant-ph/9711043} } @article{grover:prl, author = {L. K. Grover}, title = {Quantum mechanics helps in searching for a needle in a haystack}, journal = prl, volume = {79}, number = {2}, pages = {325-328}, year = {1997}, eprint = {prl:10.1103/PhysRevLett.79.325,arxiv:quant-ph/9706033} } @inproceedings{hoyerdewolf, author = {P. H{\o}yer and Wolf, R. de}, title = {Improved quantum communication complexity bounds for disjointness and equality}, booktitle = stacs, pages = {299-310}, year = {2002}, eprint = {stacs:c22a2t8cewg784jh,arxiv:quant-ph/0109068} } @article{lloyd, author = {S. Lloyd}, title = {Computational capacity of the universe}, journal = prl, volume = {88}, year = {2002}, eprint = {prl:10.1103/PhysRevLett.88.237901,arxiv:quant-ph/0110141} } @book{nc, author = {M. Nielsen and I. Chuang}, title = {Quantum Computation and Quantum Information}, publisher = {Cambridge University Press}, year = {2000} } @article{perlmutter, author = {{S. Perlmutter and 32 others (Supernova Cosmology Project)}}, title = {Measurements of {$\Omega$} and {$\Lambda$} from 42 high-redshift supernovae}, journal = {Astrophysical Journal}, volume = {517}, number = {2}, pages = {565-586}, year = {1999}, eprint = {arxiv:astro-ph/9812133} } @article{razborov:cc, author = {A. A. Razborov}, title = {Quantum communication complexity of symmetric predicates}, journal = {Izvestiya Math. (English version)}, volume = {67}, number = {1}, pages = {145-159}, year = {2003}, eprint = {arxiv:quant-ph/0204025} } @unpublished{rg, author = {T. Rudolph and L. Grover}, title = {Quantum searching a classical database (or how we learned to stop worrying and love the bomb)}, year = {2002}, eprint = {arxiv:quant-ph/0206066} } @book{ryden, author = {B. S. Ryden}, title = {Introduction to Cosmology}, publisher = {Addison-Wesley}, year = {2002} } @article{sv, author = {A. Sahai and S. Vadhan}, title = {A complete promise problem for statistical zero-knowledge}, journal = jacm, volume = {50}, number = {2}, pages = {196-249}, year = {2003}, note = {Earlier version in IEEE FOCS 1997}, eprint = {jacm:636865.636868,focs:10.1109/SFCS.1997.646133,ECCC:TR00-084} } @article{skw, author = {N. Shenvi and J. Kempe and K. B. Whaley}, title = {A quantum random walk search algorithm}, journal = pra, volume = {67}, number = {5}, year = {2003}, eprint = {pra:10.1103/PhysRevA.67.052307,arxiv:quant-ph/0210064} } @article{shor, author = {P. Shor}, title = {Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer}, journal = sicomp, volume = {26}, number = {5}, pages = {1484-1509}, year = {1997}, note = {Earlier version in IEEE FOCS 1994.}, eprint = {sicomp:29317,focs:10.1109/SFCS.1994.365700,arxiv:quant-ph/9508027} } @article{strassen, author = {V. Strassen}, title = {Gaussian elimination is not optimal}, journal = {Numerische Mathematik}, volume = {14}, number = {13}, pages = {354-356}, year = {1969} } @inproceedings{watrous:ca, author = {J. Watrous}, title = {On one-dimensional quantum cellular automata}, booktitle = focs, pages = {528-537}, year = 1995, eprint = {focs:10.1109/SFCS.1995.492583} } @unpublished{zalka, author = {Ch. Zalka}, title = {Could {G}rover's algorithm help in searching an actual database?}, year = {1999}, eprint = {arxiv:quant-ph/9901068} } @ARTICLE(adh:qcomputability, author = "L. M. Adleman and J. DeMarrais and M. A. Huang", title = "Quantum Computability", journal = "SIAM Journal on Computing", year = "1997", volume = "26", number = "5", pages = "1524--1540", eprint = {sicomp:29363} ) @ARTICLE(bbc:gates, author = "A. Barenco and C. Bennett and R. Cleve and D. P. DiVincenzo and N. Margolus and P. Shor and T. Sleator and J. A. Smolin and H. Weinfurter", title = "Elementary gates for quantum computation", journal = "Physical Review A", year = "1995", volume = "52", pages = "3457--3467", eprint = {pra:10.1103/PhysRevA.52.3457,arxiv:quant-ph/9503016} ) @INPROCEEDINGS(beigel:polmethod, author = "R. Beigel", title = "The polynomial method in circuit complexity", booktitle = "Proc. of 8th IEEE Structure in Complexity Theory Conf.", year = "1993", pages = "82--95", eprint = {SCT:1993.336538} ) @ARTICLE(cz:qc-ion, author = "J. I. Cirac and P. Zoller", title = "Quantum computations with cold trapped ions", journal = "Phys. Rev. Lett.", year = "1995", volume = "74", pages = "4091--4094", eprint = {prl:10.1103/PhysRevLett.74.4091} ) @INPROCEEDINGS(cw:qft, author = "R. Cleve and J. Watrous", title = "Fast parallel circuits for the quantum {Fourier} transform", booktitle = "Proc. of 41st IEEE FOCS", year = "2000", pages = "526--536", eprint = {focs:10.1109/SFCS.2000.892140} ) @UNPUBLISHED{coppersmith:qft, AUTHOR = "D. Coppersmith", TITLE = "An approximate {Fourier} transform useful in quantum factoring", YEAR = 1994, NOTE = "IBM technical report RC19642, quant-ph/0201067", eprint = {arxiv:quant-ph/0201067} } @UNPUBLISHED(ffghz:fanout, author = "M. Fang and S. Fenner and F. Green and S. Homer and Y. Zhang", title = "Quantum Lower Bounds for Fanout", year = "2003", eprint = {arxiv:quant-ph/0312208} ) @UNPUBLISHED(fenner:fanout, author = "S. A. Fenner", title = "Implementing the fanout gate by a {Hamiltonian}", year = "2003", eprint = {arxiv:quant-ph/0309163} ) @ARTICLE(gh:qc-nmr, author = "N. Gershenfeld and I. Chuang", title = "Bulk spin resonance quantum computation", journal = "Science", year = 1997, volume = 275, pages = "350--356", doi = {10.1126/science.275.5298.350}, eprint = {} ) @ARTICLE(ghmp:qacc, author = "F. Green and S. Homer and C. Moore and C. Pollett", title = "Counting, Fanout, and the Complexity of Quantum {ACC}", journal = "Quantum Information and Computation", year = "2002", volume = "2", number = "1", pages = "35--65", eprint = {arxiv:quant-ph/0106017} ) @INPROCEEDINGS(hh:qft, author = "L. Hales and S. Hallgren", title = "Quantum {Fourier} sampling simplified", booktitle = "Proc. of 31st ACM STOC", year = "1999", pages = "330-338", eprint = {stoc:301250.301336} ) @ARTICLE(hoeffding:probineq, author = "W. Hoeffding", title = "Probability inequalities for sums of bounded random variables", journal = "J. Amer. Statist. Assoc.", year = "1963", volume = "58", pages = "13--30" ) @BOOK(hj:matrix-book, author = "R. A. Horn and C. R. Johnson", title = "Matrix Analysis", publisher = "Cambridge University Press", year = "1985", ) @INPROCEEDINGS(spalek:qncwf-stacs, author = "P. H{\o}yer and R. {\v S}palek", title = "Quantum circuits with unbounded fan-out", booktitle = "Proc. of 20th STACS", year = "2003", pages = "234--246", note = "LNCS 2607", eprint = {stacs:80j4ju67n25kcf06} ) @ARTICLE(ms:ions, author = "K. M{\o}lmer and A. S{\o}rensen", title = "Multiparticle entanglement of hot trapped ions", journal = "Phys. Rev. Lett.", year = "1999", volume = "82", pages = "1835--1838", eprint = {prl:10.1103/PhysRevLett.82.1835} ) @UNPUBLISHED(moore:fanout, author = "C. Moore", title = "Quantum Circuits: Fanout, Parity, and Counting", year = "1999", eprint = {arxiv:quant-ph/9903046} ) @ARTICLE(moore:parallel-qc, author = "C. Moore and M. Nilsson", title = "Parallel quantum computation and quantum codes", journal = "SIAM Journal on Computing", year = "2002", volume = "31", number = "3", pages = "799--815", eprint = {sicomp:35505,arxiv:quant-ph/9808027} ) @ARTICLE(razborov:circsize, author = "A. A. Razborov", title = "Lower bounds for the size of circuits of bounded depth with basis $\{ \&, \oplus \}$", journal = "Math. Notes Acad. Sci. USSR", year = "1987", volume = "41", number = "4", pages = "333--338" ) @INPROCEEDINGS(shor:factoring, author = "P. W. Shor", title = "Algorithms for quantum computation: discrete logarithms and factoring", booktitle = "Proc. of 35th IEEE FOCS", year = "1994", comment = "Los Alamitos, CA", pages = "124--134", eprint = {focs:10.1109/SFCS.1994.365700} ) @ARTICLE(sbkh:division-circ, author = "K.-Y. Siu and J. Bruck and T. Kailath and T. Hofmeister", title = "Depth Efficient Neural Networks for Division and Related Problems", journal = "{IEEE} Transactions on Information Theory", year = "1993", volume = "39", number = "3", pages = "946--956", eprint = {TIT:10.1109/18.256501} ) @INPROCEEDINGS(smolensky:algmethods, author = "R. Smolensky", title = "Algebraic methods in the theory of lower bounds for {Boolean} circuit complexity", booktitle = "Proc. of 19th ACM STOC", year = "1987", pages = "77--82", eprint = {stoc:28395.28404} ) @MASTERSTHESIS(spalek:thesis-qncwf-uploaded, author = "R. {\v S}palek", title = "Quantum circuits with unbounded fan-out", school = "Faculty of Sciences, Vrije Universiteit", address = "Amsterdam", year = "2002", url = "http://www.ucw.cz/~robert/qncwf/", note = "Shorter version and improved results in quant-ph/0208043", eprint = {arxiv:quant-ph/0208043} ) @ARTICLE(wz:noclone, author = "W. K. Wootters and W. H. Zurek", title = "A single quantum cannot be cloned", journal = "Nature", year = "1982", volume = "299", pages = "802--803", doi = {10.1038/299802a0}, eprint = {} ) @INPROCEEDINGS{yao:unified, AUTHOR = "A. C-C. Yao", TITLE = "Probabilistic computations: Toward a unified measure of complexity", BOOKTITLE = "Proc. of 18th IEEE FOCS", PAGES = "222--227", YEAR = 1977 } @article{AdAz03, title="Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms", author="R.~Adler and Y.~Azar", journal="J. of Scheduling", year=2003, pages="113--129", url="http://www.springerlink.com/link.asp?id=jq27641706456655", doi="10.1023/A:1022933824889", eprint="soda:314500.314512,jsched:jq27641706456655", note="Prelimary version in Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pp. 1--10, 1999."} @inproceedings{AwAzFL96, title="Making commitments in the face of uncertainty: How to pick a winner almost every time", author="B.~Awerbuch and Y.~Azar and A.~Fiat and T.~Leighton", booktitle="Proc. 28th {ACM} Symp. on Theory of Computing", pages="519--530", year=1996, eprint={stoc:237814.238000}, ps="http://www.cs.tau.ac.il/~azar/set.ps"} @inproceedings{AwAzPl93, title="Throughput-competitive online routing", author="B.~Awerbuch and Y.~Azar and S.~Plotkin", booktitle="Proc. 34th IEEE Symp. on Foundations of Computer Science", pages="32--40", year=1993, ps="http://www.cs.tau.ac.il/~azar/route.ps", eprint="focs:10.1109/SFCS.1993.366884" } @inproceedings{AwBaFR94, title="Competitive non-preemptive call control", author="B.~Awerbuch and Y.~Bartal and A.~Fiat and A.~Ros\'en", booktitle="Proc. 5th ACM-SIAM Symp. on Discrete Algorithms", pages="312--320", year=1994, eprint="soda:314464.314510", ps="http://www.icsi.berkeley.edu/~yairb/pubs/ABFR-call-control.ps"} @inproceedings{AGLR94, title="On-line admission control and circuit routing for high performance computation and communication", author="B.~Awerbuch and R.~Gawlick and T.~Leighton and Y.~Rabani", booktitle="Proc. 35th IEEE Symp. on Foundations of Computer Science", pages="412--423", year=1994, ps="http://www.cs.technion.ac.il/~rabani/pss/Publications/AwerbuchGLR94.ps.gz", eprint="focs:10.1109/SFCS.1994.365675"} @inproceedings{AzBlMa03, title="Combining online algorithms for rejection and acceptance", author="Y.~Azar and A.~Blum and Y.~Mansour", booktitle="Proc. 15th ACM Symp. Parallelism in Algorithms and Architectures", pages="159--163", year=2003, url="http://doi.acm.org/10.1145/777412.777438", eprint="spaa:10.1145/777412.777438", ps="http://www.cs.tau.ac.il/~azar/acc_rej.ps"} @inproceedings{AzBrMa93, title="On-line choice of on-line algorithms", author="Y.~Azar and A.~Broder and M.~Manasse", booktitle="Proc. 4th ACM-SIAM Symp. on Discrete Algorithms", pages="432--440", year=1993, eprint="soda:313559.313847", ps="http://www.cs.tau.ac.il/~azar/choice.ps"} @article{BaCuRa93, title="Searching in the plane", author="R.~Baeza-Yates and J.~Culberson and G.~Rawlins", journal="Information and Computation", volume=106, number=2, pages="234--252", year=1993, url="http://dx.doi.org/10.1006/inco.1993.1054", eprint={iandc:10.1006/inco.1993.1054}, note="Preliminary version in Proc. 1st Scandinavian Workshop on Algorithm Theory, LNCS 318, pp. 176--189, 1988.", ps="ftp://sunsite.dcc.uchile.cl/pub/users/rbaeza/papers/searchingtheplane.ps.gz"} @article{BlKaKl04, title="Admission control to minimize rejections", author="A.~Blum and A.~Kalai and J.~Kleinberg", journal="Internet Mathematics", volume=1, number=2, pages="165--176", year=2004, note="Preliminary version in Proc. 7th Workshop on Algorithms and Data Structures, LNCS 2125, pp. 155--164, 2001.", eprint={wads:9ukehq56d6yp2m22,internetmath:1/2/165/176}, pdf="http://www.internetmathematics.org/volumes/1/2/pp165_176.pdf", ps="http://www.cs.cmu.edu/~avrim/Papers/admission.ps"} @inproceedings{BuMa04, title="Improved combination of online algorithms for acceptance and rejection", author="D.P.~Bunde and Y.~Mansour", booktitle="Proc. 16th ACM Symp.\ Parallelism in Algorithms and Architectures", pages="265--266", year=2004, eprint="spaa:10.1145/1007912.1007952", ps="http://www.math.tau.ac.il/~mansour/papers/04spaa.ps", pdf="http://compgeom.cs.uiuc.edu/~bunde/pubs/acceptreject.pdf"} @article{FFKRRV91, title="Competitive algorithms for layered graph traversal", author="A.~Fiat and D.~Foster and H.~Karloff and Y.~Rabani and Y.~Ravid and S.~Vishwanathan", journal="SIAM J. on Computing", volume=28, number=2, pages="447--462", year=1998, note="Preliminary version in Proc. 32nd IEEE Symp. on Foundations of Computer Science, pp 288--297, 1991.", eprint="focs:10.1109/SFCS.1991.185381,sicomp:10.1137/S0097539795279943", ps="http://www.cs.technion.ac.il/~rabani/pss/Publications/FiatFKRRV91.ps.gz"} % haastad-khot v001/a007 Sep 28 2005 @Article{almss, author = "S. Arora and C. Lund and R. Motwani and M. Sudan and M. Szegedy", title = "Proof Verification and the Hardness of Approximation Problems", journal = "Journal of the {ACM}", volume = "45", year = "1998", pages = "501--555", eprint = {jacm:10.1145/278298.278306} } @Article{arsa, author = "S. Arora and S. Safra", title = "Probabilistic Checking of Proofs: {A} New Characterization of {NP}", journal = "Journal of the {ACM}", volume = "45", year = "1998", pages= "70--122", eprint = {jacm:10.1145/273865.273901} } @Article{bgs, author = "M. Bellare and O. Goldreich and M. Sudan", title = "Free Bits, {PCP}s, and Nonapproximability--Towards Tight Results", journal = "{SIAM} Journal on Computing", volume = "27", year = "1998", pages= "804--915", eprint = {sicomp:10.1137/S0097539796302531} } @Article{e, author = "L. Engebretsen", title = "The Nonapproximability of Non-Boolean Predicates", journal = "{SIAM} Journal on Discrete Mathematics", volume = "18", year = "2004", pages= "114--129", eprint = {sidma:10.1137/S0895480100380458} } @Article{f, author = "U. Feige", title = "A Threshold of $\ln n$ for Approximating Set Cover", journal = "Journal of the {ACM}", volume = "45", year = "1998", pages= "634--652", eprint = {jacm:10.1145/285055.285059} } @Article{fglss, author = "U. Feige and S. Goldwasser and L. Lovasz and S. Safra and M. Szegedy", title = "Interactive Proofs and the Hardness of Approximating Cliques", journal = "Journal of the {ACM}", volume = "43", year = "1996", pages= "268--292", eprint = {jacm:10.1145/226643.226652} } @Article{ghs, author = "V. Guruswami and J. H{\aa}stad and M. Sudan", title = "Hardness of Approximate Hypergraph Coloring", journal = "{SIAM} Journal on Computing", volume = "31", year = "2002", pages= "1663--1686", eprint = {sicomp:10.1137/S0097539700377165} } @Inproceedings{glst, author= "V. ~Guruswami and D. ~Levin and M. ~Sudan and L. ~Trevisan", title = "A tight characterization of {NP} with 3 query {PCPs}", booktitle ="Proceedings of 39th Annual {IEEE} Symposium of Foundations of Computer Science", year ="1998", pages= "8--17", eprint = {focs:10.1109/SFCS.1998.743424} } @Article{h, author="J. H\aa stad", title="Some optimal inapproximability results", journal="Journal of the {ACM}", volume="48", year="2001", pages="798--859", eprint = {jacm:10.1145/502090.502098} } @Article{hastad, author="J. H\aa stad", title="Clique is hard to approximate within $n^{1-\epsilon}$", journal="Acta Mathematica", volume=182, year=1999, pages="105--142", eprint = {ActaMath:am182p01a00105} } @inproceedings{hk, author="J. H{\aa}stad and S. Khot", title="Query efficient {PCPs} with perfect completeness", booktitle="In Proceedings of 42nd Annual {IEEE} Symposium of Foundations of Computer Science", year="2001", pages="610--619", eprint = {focs:10.1109/SFCS.2001.959937} } @article{hw, author="J. H\aa stad and A. Wigderson", title="Simple analysis of graph tests for linearity and {PCP}", journal="Random Structures and Algorithms", volume="22", year="2003", pages="139--160", eprint = {rsa:10.1002/rsa.10068} } @inproceedings{kh, author="S. Khot", title="Improved inapproximability results for maxclique, chromatic number and approximate graph coloring", booktitle="Proceedings of 42nd Annual {IEEE} Symposium of Foundations of Computer Science", year="2001", pages="600--609", eprint = {focs:10.1109/SFCS.2001.959936} } @inproceedings{k33, author="S.~Khot", title="Hardness results for coloring 3-colorable 3-uniform hypergraphs", booktitle="Proceedings of 43rd Annual {IEEE} Symposium on Foundations of Computer Science", year="2002", pages="23--32", eprint = {focs:10.1109/SFCS.2002.1181879} } @article{r, author="R. Raz", title="A parallel repetition theorem", journal="{SIAM} Journal on Computing", volume=27, pages="763--803", year=1998, eprint={sicomp:10.1137/S0097539795280895}, } @inproceedings{st, author="A. Samorodnitsky and L. Trevisan", title="A {PCP} characterization of {NP} with optimal amortized query complexity", booktitle="Proceedings of the 32nd Annual {ACM} Symposium on Theory of Computing", pages="191--199", year="2000", eprint = {stoc:10.1145/335305.335329} } @article{t, author="L. Trevisan", title="Approximating Satisfiable Satisfiability Problems", journal="Algorithmica", volume="28", pages="145--172", year="2000", eprint = {algorithmica:j2nhr52hrjr9bp55} } %% a008.bib 10-05-2005 @Article{Abrahamson91, author = "K. Abrahamson", title ={{Time-Space Tradeoffs for Algebraic Problems on General Sequential Machines}}, journal = "Journal of Computer and System Sciences", volume = "43", year = 1991, pages = "269--289", eprint={jcss:10.1016/0022-0000(91)90014-V} } @InProceedings{Abrahamson86, author = "K. Abrahamson", title ={{Time-Space Tradeoffs for Branching Programs Contrasted With Those for Straight-Line Programs}}, booktitle = {27th IEEE FOCS}, publisher = {IEEE Computer Society}, year = "1986" } @ARTICLE{A1, AUTHOR = {M. Ajtai}, TITLE = {{Determinism versus Non-Determinism for Linear Time {RAMs} with Memory Restrictions}}, JOURNAL = {Journal of Computer and System Sciences}, YEAR = {2002}, volume = {65}, number = {}, pages = {2--37}, eprint = {jcss:10.1006/jcss.2002.1821} } @INPROCEEDINGS{A2, AUTHOR = {M. Ajtai}, TITLE = {A non-linear time lower bound for boolean branching programs}, BOOKTITLE = {40th IEEE FOCS}, YEAR = {1999}, editor = {}, volume = {}, number = {}, series = {}, pages = {60--70}, publisher = {IEEE Computer Society}, eprint = {focs:10.1109/SFFCS.1999.814578} } @ARTICLE{BC, AUTHOR = {A. Borodin and {S. A.} Cook}, TITLE = {A time-space tradeoff for sorting on a general sequential model of computation}, JOURNAL = {{SIAM} J. Computing}, YEAR = {1982}, volume = {11}, pages = {287--297}, eprint = {sicomp:11/0211022} } @ARTICLE{Bea, AUTHOR = {P. Beame}, TITLE = {{General Sequential Time-Space Tradeoff for Finding Unique Elements}}, JOURNAL = {{SIAM} J. Computing}, YEAR = {1991}, volume = {20}, number = {2}, pages = {270--277}, eprint = {sicomp:20/0220017} } @ARTICLE{BSSV, AUTHOR = {P. Beame and M. Saks and X. Sun and E. Vee}, TITLE = {Time-space tradeoff lower bounds for randomized computation of decision problems}, JOURNAL = {Journal of the {ACM}}, YEAR = {2003}, volume = {50}, number = {2}, pages = {154--195}, eprint = {jacm:10.1145/636865.636867} } @ARTICLE{BRS, AUTHOR = {A. Borodin and {A. A.} Razborov and R. Smolensky}, TITLE = {On lower bounds for read-$k$-times branching programs}, JOURNAL = {Computational Complexity}, YEAR = {1993}, volume = {3}, number = {}, pages = {1--18} } @ARTICLE{BST, AUTHOR = {P. Beame and M. Saks and {T. S.} Jayram}, TITLE = {Time-space tradeoffs for branching programs}, JOURNAL = {Journal of Computer and System Sciences}, YEAR = {2001}, volume = {63}, number = {4}, pages = {542--572}, eprint = {jcss:10.1006/jcss.2001.1778} } @INPROCEEDINGS{CG85, AUTHOR = {B. Chor and O. Goldreich}, TITLE = {{Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity}}, BOOKTITLE = {26th IEEE FOCS}, YEAR = {1985}, editor = {}, volume = {}, number = {}, series = {}, pages = {429--442}, publisher = {IEEE Computer Society} } @Article{Karchmer86, author = "M. Karchmer", title = {{Two Time-Space Tradeoffs for Element Distinctness}}, journal = "Theoretical Computer Science", volume = "47", year = "1986", pages = "237--246", eprint={tcs:10.1016/0304-3975(86)90150-7} } @InProceedings{Reisch-Schnitger/82, author = "S. Reisch and G. Schnitger", title ={{Three applications of Kolmogorov-complexity}}, booktitle = {23rd {IEEE} FOCS}, pages ="45--52", year = "1982", publisher = {IEEE Computer Society}, cdate ="1970-01-01", mdate ="2005-08-18", } @INPROCEEDINGS{Tha, AUTHOR = {{J. S.} Thathachar}, TITLE = {On separating the read-$k$-times branching program hierarchy}, BOOKTITLE = {30th ACM STOC}, YEAR = 1998, editor = {}, volume = {}, number = {}, series = {}, pages = {653--662}, publisher = {ACM}, eprint = {stoc:10.1145/276698.276881} } @Article{Yesha84, author = "Y. Yesha", title ={{Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform of Any General Sequential Random-Access Computer}}, journal = "Journal of Computer and System Sciences", volume = "29", year = "1984", pages = "183--197", eprint = {jcss:10.1016/0022-0000(84)90029-1} } %% v001/a009.bib October 12, 2005 @article{Al, title="Testing subgraphs in large graphs", author="N.~Alon", journal="Random Structures and Algorithms", volume=21, pages="359--370", year=2002, note="Also, Proc. $42^{nd}$ {IEEE} {FOCS}, {IEEE} (2001), 434--441", pdf="http://www.cs.tau.ac.il/~nogaa/PDFS/testsubproc.pdf", eprint={focs:10.1109/SFCS.2001.959918,rsa:10.1002/rsa.10056} } @article{ADLRY, title="The algorithmic aspects of the regularity lemma", author="N. Alon and R. A. Duke and H. Lefmann and V. {R\"{o}dl} and R. Yuster", journal="J. of Algorithms", volume=16, pages="80--109", year=1994, note="Also, Proc. $33^{rd}$ {IEEE} {FOCS}, Pittsburgh, {IEEE} (1992), 473-481", pdf="http://www.cs.tau.ac.il/~nogaa/PDFS/reg5.pdf", eprint={focs:10.1109/SFCS.1992.267804,jalg:10.1006/jagm.1994.1005} } @article{AFKS, title="Efficient testing of large graphs", author="N. Alon and E. Fischer and M. Krivelevich and M. Szegedy", journal="Combinatorica", volume=20, pages="451--476", year=2000, note="Also, Proc. of $40^{th}$ FOCS, New York, NY, IEEE (1999), 656--666", pdf="http://www.cs.tau.ac.il/~nogaa/PDFS/testn12.pdf", eprint={combinatorica:mwapje2fdyk7ma2e} } @article{ASSTOC, title="Testing subgraphs in directed graphs", author="N. Alon and A. Shapira", journal="JCSS", volume=69, pages="354--382", year=2004, note="Also, Proc. of the $35^{th}$ STOC, 2003, 700--709", pdf="http://www.cs.tau.ac.il/~nogaa/PDFS/testdig5.pdf", eprint={stoc:780542.780644,jcss:10.1016/j.jcss.2004.04.008} } @inproceedings{ASSODA, title="A characterization of easily testable induced subgraphs", author="N. Alon and A. Shapira", note="Combinatorics, Probability and Computing, to appear", booktitle={Proc. of the $15^{th}$ Annual ACM-SIAM SODA}, pages="935-944", publisher="{ACM} Press", year=2004, pdf="http://www.cs.tau.ac.il/~nogaa/PDFS/testindfull2.pdf", } @unpublished{ASTuran, title="On an extremal hypergraph problem of {Brown}, {Erd{\H o}s} and {S\'os}", author="N. Alon and A. Shapira", note="Combinatorica, to appear", pdf="http://www.cs.tau.ac.il/~nogaa/PDFS/asaferdos4.pdf", year="2005" } @article{Be, title="On sets of integers which contain no three terms in arithmetic progression", author="F.~A.~Behrend", journal="Proc. of National Academy of Sciences USA", volume=32, pages="331--332", year=1946 } @article{Bourgain, title="On triples in arithmetic progression", author="J. Bourgain", journal="Geom. and Funct. Anal.", volume=9, pages="968--984", year=1999, eprint={GAFA:7wqhpp8fnnuk388g} } @article{EFR, title="The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent", author="P. Erd\H{o}s and P. Frankl and V. R{\"{o}}dl", journal="Graphs and Combin.", volume=2, pages="113--121", year="1986" } @article{ES, title="Supersaturated graphs and hypergraphs", author="P. Erd\H{o}s and M. Simonovits", journal="Combinatorica", volume=3, pages="181--192", year="1983" } @article{F, title="The art of uninformed decisions: A primer to property testing", author="E. Fischer", journal="The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science", volume=75, pages="97--126", year="2001" } @article{FR, title="Extremal problems on set systems", author="P.~{Frankl} and V.~{R{\"{o}}dl}", journal="Random Struct. Algorithms", volume=20, pages="131--164", year="2002", eprint={rsa:10.1002/rsa.10017} } @article{GGR, title="Property testing and its connection to learning and approximation", author="O.~Goldreich and S.~Goldwasser and D.~Ron", journal="JACM", volume=45, pages="653--750", year=1998, note="Also, Proc. of $37^{th}$ Annual IEEE FOCS, (1996), 339--348", eprint={focs:10.1109/SFCS.1996.548493,jacm:10.1145/285055.285060} } @article{GT, title="Three theorems regarding testing graph properties", author="O. Goldreich and L. Trevisan", journal="Random Structures and Algorithms", volume=23, pages="23--57", year="2003", note="Also, Proc. $42^{nd}$ {IEEE} {FOCS}, {IEEE} (2001), 460-469.", eprint={focs:10.1109/SFCS.2001.959922,rsa:10.1002/rsa.10078} } @book{GR, author = {I. S. Gradshteyn and I. M. Ryzhik}, title = {Tables of Integrals, Series, and Products}, publisher = {Academic Press}, year = {2000} } @unpublished{G2, title="Hypergraph regularity and the multidimensional {Szemer\'edi} theorem", author="{W. T.} Gowers", note="Manuscript", year=2004 } @inproceedings{KNR, title="Efficient testing of hypergraphs", author="Y. Kohayakawa and B. Nagle and V. R{\"{o}}dl", booktitle="Proc. of $29^{th}$ ICALP", pages="1017--1028", year=2002, eprint={icalp:4wa2tdcqx50avb08} } @unpublished{LL, title="On sets of integers not containing long arithmetic progressions", author="I. Laba and M. Lacey", note="Manuscript", year="2004", pdf="http://www.arxiv.org/PS_cache/math/pdf/0108/0108155.pdf", eprint={arxiv:math/0108155} } @article{NR, title="Regularity properties for triple systems", author="B. Nagle and V. R{\"{o}}dl", journal="Random Structures and Algorithms", volume=23, pages="264--332", year=2003, eprint={rsa:10.1002/rsa.10094} } @unpublished{NR2, title="The counting lemma for regular $k$-uniform hypegraphs", author="B. Nagle and V. R{\"{o}}dl and M. Schacht", note="Random Structures and Algorithms, to appear", } @article{Rankin, title="Sets of integers containing not more than a given number of terms in arithmetical progression", author="R. A. Rankin", journal="Proc. Roy. Soc. Edinburgh Sect. A", volume=65, pages="332--344", year=1962 } @article{RSk, title="Regularity lemma for $k$-uniform hypergraphs", author="V. R{\"{o}}dl and J. Skokan", journal="Random Structures and Algorithms", volume=25, pages="1--42", year=2004, eprint={rsa:10.1002/rsa.20017} } @article{Ron, title="Property testing", author="D. Ron", journal="Handbook of Randomized Computing", volume=2, pages="597--649", year=2001 } @article{RS, title="Robust characterization of polynomials with applications to program testing", author="R.~Rubinfeld and M.~Sudan", journal="{SIAM} J. on Computing", volume=25, pages="252--271", year=1996, eprint={sicomp:10.1137/S0097539793255151} } @inproceedings{RUSZ, title="Triple systems with no six points carrying three triangles", author="I. Z. Ruzsa and E.~{Szemer\'edi}", booktitle="Combinatorics (Keszthely, 1976)", year=1976, publisher="Coll. Math. Soc. J. Bolyai", pages="939--945" } @unpublished{Sh, title="Behrend-type constructions for sets of linear equations", author="A. Shapira", note="Acta Arithmetica, to appear", pdf="http://www.cs.tau.ac.il/~asafico/behrend.pdf" } @inproceedings{Sz, title="Regular partitions of graphs", author="E.~Szemer\'edi", booktitle="Proc. Colloque Inter. CNRS (J.~C.~Bermond, J.~C.~Fournier, M.~Las~Vergnas and D.~Sotteau, eds.)", pages="399--401", year=1978, } @STRING{siamjc = "SIAM Journal on Computing"} @STRING{eatcsbul = "EATCS Bulletin"} @STRING{springer = "Springer"} @STRING{cup = "Cambridge University Press"} @ARTICLE(ambainis:lowerb, author = "A. Ambainis", title = "Quantum lower bounds by quantum arguments", journal = "Journal of Computer and System Sciences", year = "2002", volume = "64", number=4, pages = "750--767", note = "Earlier version in STOC '00", comment = "quant-ph/0002066", eprint="jcss:10.1006/jcss.2002.1826,stoc:335305.335394,arxiv:quant-ph/0002066" ) @INPROCEEDINGS(ambainis:degree-vs-qc, author = "A. Ambainis", title = "Polynomial degree {vs.} quantum query complexity", booktitle = "Proc. of 44th IEEE FOCS", year = "2003", pages = "230--239", eprint="focs:10.1109/SFCS.2003.1238197,arxiv:quant-ph/0305028" ) @INPROCEEDINGS(ambainis:eldist, author = "A. Ambainis", title = "Quantum walk algorithm for element distinctness", booktitle = "Proc. of 45th IEEE FOCS", year = 2004, pages = "22--31", comment = "quant-ph/0311001", eprint="arxiv:quant-ph/0311001" ) @ARTICLE(ambainis:collision, author = "A. Ambainis", title = "Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range", journal = "Theory of Computing", volume = 1, pages = "37--46", year = 2005, comment = "quant-ph/0305179", eprint="toc:v001/a003,arxiv:quant-ph/0305179" ) @ARTICLE(as:collision, author = "S. Aaronson and Y. Shi", title = "Quantum lower bounds for the collision and the element distinctness problem", journal = jacm, volume = "51", number = "4", pages = "595--605", year = "2004", comment = "quant-ph/0111102", eprint="jacm:1008731.1008735,arxiv:quant-ph/0111102" ) @ARTICLE(bbbv:hybrid, author = "H. Bennett and E. Bernstein and G. Brassard and U. Vazirani", title = "Strengths and Weaknesses of Quantum Computing", journal = siamjc, volume = 26, number = 5, pages = "1510--1523", year = "1997", comment = "quant-ph/9701001", eprint="sicomp:30093,arxiv:quant-ph/9701001" ) @ARTICLE{bbcmw:polynomialsj, AUTHOR = "R. Beals and H. Buhrman and R. Cleve and M. Mosca and Wolf, R. {de}", TITLE = "Quantum Lower Bounds by Polynomials", JOURNAL = jacm, VOLUME = 48, NUMBER = 4, PAGES = "778--797", YEAR = 2001, NOTE = "Earlier version in FOCS '98", comment = "quant-ph/9802049", eprint="jacm:502090.502097,focs:10.1109/SFCS.1998.743485,arxiv:quant-ph/9802049" } @ARTICLE(bs:q-read-once, author = "H. Barnum and M. Saks", title = "A lower bound on the quantum query complexity of read-once functions", journal = jcss, volume = 69, number = 2, pages = "244--258", year = 2004, comment = "quant-ph/0201007", eprint="jcss:10.1016/j.jcss.2004.02.002,arxiv:quant-ph/0201007" ) @INPROCEEDINGS{bs:matrix, AUTHOR = "H. Buhrman and R. {\v{S}}palek", TITLE = "Quantum Verification of Matrix Products", BOOKTITLE = "Proc. of 17th ACM-SIAM SODA", YEAR = 2006, PAGES = "880--889", comment = "quant-ph/0409035", eprint="soda:1109557.1109654,arxiv:quant-ph/0409035" } @INPROCEEDINGS(bss:semidef, author = "H. Barnum and M. Saks and M. Szegedy", title = "Quantum decision trees and semidefinite programming", booktitle = "Proc. of 18th IEEE Complexity", year = "2003", pages = "179--193", eprint="ccc:10.1109/CCC.2003.1214419" ) @ARTICLE{buhrman&wolf:dectreesurvey, AUTHOR = "H. Buhrman and Wolf, R. {de}", TITLE = "Complexity Measures and Decision Tree Complexity: {A} Survey", JOURNAL = tcs, VOLUME = 288, NUMBER = 1, PAGES = "21--43", YEAR = 2002, eprint="tcs:10.1016/S0304-3975(01)00144-X", ps="http://homepages.cwi.nl/~rdewolf/publ/qc/dectree.ps" } @INPROCEEDINGS{grover:search, AUTHOR = "L. K. Grover", TITLE = "A Fast Quantum Mechanical Algorithm for Database Search", BOOKTITLE = "Proc. of 28th ACM STOC", PAGES = "212--219", YEAR = 1996, comment = "quant-ph/9605043", eprint="stoc:237814.237866,arxiv:quant-ph/9605043" } @INPROCEEDINGS(hmw:berror-search, author = "P. H{\o}yer and M. Mosca and Wolf, R. {de}", title = "Quantum Search on Bounded-Error Inputs", booktitle = "Proc. of 30th ICALP", pages = "291--299", year = "2003", note = "LNCS 2719", comment = "quant-ph/0304052", eprint="icalp:214dhep41d6vk3d2,arxiv:quant-ph/0304052" ) @ARTICLE(hns:ordered-search, author = "P. H{\o}yer and J. Neerbek and Y. Shi", title = "Quantum complexities of ordered searching, sorting, and element distinctness", journal = "Algorithmica", volume = "34", number = "4", pages = "429--448", year = "2002", note = "Special issue on Quantum Computation and Cryptography", comment = "quant-ph/0102078", CommentBooktitle = "Proc. of 28th ICALP", CommentPages = "346--357", CommentYear = "2001", CommentNote = "LNCS 2076", commenteprint="icalp:0ybn6v2nywvtkpua", eprint="algorithmica:25gl9elr5rxr3q6a,arxiv:quant-ph/0102078" ) @ARTICLE{hs:survey-lb, author = "P. H{\o}yer and R. {\v{S}}palek", title = "Lower Bounds on Quantum Query Complexity", journal = eatcsbul, volume = 87, pages = "78--103", year = "October, 2005", eprint="arxiv:quant-ph/0509153" } @INPROCEEDINGS(lls:formulas, author = "S. Laplante and T. Lee and M. Szegedy", title = "The quantum adversary method and formula size lower bounds", booktitle = "Proc. of 20th IEEE Complexity", year = 2005, pages = "76--90", comment = "quant-ph/0501057", eprint="ccc:10.1109/CCC.2005.29,arxiv:quant-ph/0501057" ) @INPROCEEDINGS(lm:kolmogorov-lb, author = "S. Laplante and F. Magniez", title = "Lower bounds for randomized and quantum query complexity using {Kolmogorov} arguments", booktitle = "Proc. of 19th IEEE Complexity", pages = "294--304", year = "2004", comment = "quant-ph/0311189", eprint="ccc:10.1109/CCC.2004.1313852,arxiv:quant-ph/0311189" ) @UNPUBLISHED(lovasz:semidef, author = "L. Lov\'asz", title = "Semidefinite programs and combinatorial optimization", year = 2000, note = "\url{http://research.microsoft.com/users/lovasz/semidef.ps}", ps="http://research.microsoft.com/users/lovasz/semidef.ps" ) @BOOK{li&vitanyi:kolm, AUTHOR = "M. Li and P. M. B. Vit{\'{a}}nyi", TITLE = "An Introduction to {K}olmogorov Complexity and its Applications", EDITION = "Second", PUBLISHER = springer, ADDRESS = "Berlin", YEAR = 1997, } @ARTICLE(mathias:spectral-norm, author = "R. Mathias", title = "The spectral norm of a nonnegative matrix", journal = "Linear Algebra and its Applications", volume = "139", pages = "269--284", year = 1990, eprint="laa:10.1016/0024-3795(90)90403-Y", ps="http://www.math.wm.edu/~mathias/preprints/ps_zips/nonneg.ps.gz" ) @INPROCEEDINGS(mss:triangle, author = "F. Magniez and M. Santha and M. Szegedy", title = "Quantum Algorithms for the Triangle Problem", booktitle = "Proc. of 16th ACM-SIAM SODA", year = "2005", pages = "1109--1117", comment = "quant-ph/0310134", eprint="soda:1070432.1070591,arxiv:quant-ph/0310134" ) @BOOK{nielsen&chuang:qc, AUTHOR = "M. A. Nielsen and I. L. Chuang", TITLE = "Quantum Computation and Quantum Information", PUBLISHER = cup, YEAR = 2000, } @ARTICLE(santha:and-or, author = "M. Santha", title = "On the {M}onte {C}arlo decision tree complexity of read-once formulae", journal = "Random Structures and Algorithms", volume = 6, number = 1, pages = "75--87", year = 1995, comment = "Earlier version in Structures '91", ps="http://www.lri.fr/~santha/Papers/s95.ps.gz" ) @ARTICLE(snir:dec, author = "M. Snir", title = "Lower bounds on probabilistic decision trees", journal = "Theoretical Computer Science", volume = 38, pages = "69--82", year = 1985, eprint="tcs:10.1016/0304-3975(85)90210-5" ) @INPROCEEDINGS(sw:and-or, author = "M. Saks and A. Wigderson", title = "Probabilistic {Boolean} decision trees and the complexity of evaluating games trees", booktitle = "Proc. of 27th IEEE FOCS", pages = "29--38", year = "1986", ps="http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/VW85A/VW85A.ps", pdf="http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/SW86/SW86.pdf" ) @UNPUBLISHED(szegedy:triangle, author = "M. Szegedy", title = "On the Quantum Query Complexity of Detecting Triangles in Graphs", year = "2003", note = "quant-ph/0310107", eprint="arxiv:quant-ph/0310107" ) @ARTICLE(zhang:ambainis, author = "S. Zhang", title = "On the power of {Ambainis}'s lower bounds", journal = "Theoretical Computer Science", volume = 339, number = "2--3", year = 2005, pages = "241--256", note = "Earlier version in ICALP'04", commbooktitle = "Proc. of 31st ICALP", commpages = "1238--1250", commyear = "2004", comment = "quant-ph/0311060", eprint="tcs:10.1016/j.tcs.2005.01.019,icalp:gm2ff6wpc0q39v3x,arxiv:quant-ph/0311060" ) %% v002/a002 bib file @Article{LiptakLovasz:01, author = "L{\'a}szl{\'o} Lipt{\'a}k and L{\'a}szl{\'o} Lov{\'a}sz", title = "Critical facets of the stable set polytope", journal = "Combinatorica", pages = "61--88", year = 2001, number = 1, volume = 21, publisher = "J{\'a}nos Bolyai Mathematical Society, Springer International", mdate = "2005-08-18", eprint = {Combinatorica:8hmkpcvb5qaw5dnv}, ps = "http://research.microsoft.com/users/lovasz/critical.ps", } @InProceedings{AlekhnovichAT:05, author = "Mikhail Alekhnovich and Sanjeev Arora and Iannis Tourlakis", title = "Towards strong nonapproximability results in the {Lov \'{a}sz-Schrijver} hierarchy", booktitle = "Proceedings of the 37th Annual Symposium on the Theory of Computing", month = may, publisher = "ACM Press", address = "New York", year = "2005", eprint = {stoc:1060590.1060634}, } @InProceedings{Tourlakis:05, title = "Towards optimal integrality gaps for hypergraph vertex cover in the {Lov\'asz}-{Schrijver} hierarchy", author = "Iannis Tourlakis", year = "2005", booktitle = "8th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 9th International Workshop on Randomization and Computation", pages = "233--244", ps = "http://www.cs.princeton.edu/~itourlak/publications/approx05.ps", } @InProceedings{AroraBL:02, author = "Sanjeev Arora and B{\'e}la Bollob{\'a}s and L{\'a}szl{\'o} Lov{\'a}sz", title = "Proving Integrality Gaps without Knowing the Linear Program", pages = "313--322", booktitle = "Proceedings of the 43rd Symposium on Foundations of Computer Science ({FOCS}-02)", month = nov # " ~16--19", address = "Los Alamitos", year = 2002, eprint = {focs:10.1109/SFCS.2002.1181954}, } @Article{Chvatal:73, author = "Vasek Chv{\'a}tal", title = "Edmonds polytopes and a hierarchy of combinatorial problems", journal = "Discrete Math.", pages = "305--337", year = "1973", volume = "4", publisher = "Elsevier Science Publishers B.V. (North Holland)", address = "Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo", cdate = "1970-01-01", mdate = "2005-08-18", } @Article{DinurSafra:05, author = "Irit Dinur and Shmuel Safra", title = "On the hardness of approximating minimum vertex cover", journal = "Annals of Mathematics", volume = "162", number = "1", year = "2005", ps = "http://www.cs.huji.ac.il/~dinur/mypapers/vc.ps", } @Article{CookDash:01, author = "William Cook and Sanjeeb Dash", title = "On the matrix-cut rank of polyhedra", journal = "Mathematics of Operations Research", year = "2001", volume = "26", number = "1", pages = "19--30", } @InCollection{Hochbaum:97b, author = "Dorit Hochbaum", title = "Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems", booktitle = "Approximation Algorithms for NP-hard Problems", publisher = "PWS Publishing Company", year = "1997", } @InProceedings{BureshOppenheimGHMP:03, author = "Joshua Buresh-Oppenheim and Nicola Galesi and Shlomo Hoory and Avner Magen and Toniann Pitassi", title = "Rank bounds and integrality gaps for cutting planes procedures", booktitle = "Proceedings: 44th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2003, 11--14 October 2003, Cambridge, Massachusetts", publisher = "pub-IEEE", pages = "318--327", year = "2003", eprintdeprecated = {FOCS:2003.1238206}, } @UNPUBLISHED{CheriyanQian:05, author = "Joseph Cheriyan and Fei Qian", note = "Personal communication", year = "2005", } @mastersthesis{Qian:03, author = "Fei Qian", title = "The integrality gap of the minimum vertex cover problem", school = "University of Waterloo", year = "2003", } @Article{Wolsey:80, author = "Laurence A. Wolsey", title = "Heuristic analysis, linear programming, and branch and bound", journal = "Mathematical Programming Studies", volume = "13", year = "1980", pages = "121--134", } @Article{Yannakakis:91, title = "Expressing Combinatorial Optimization Problems by Linear Programs", author = "Mihalis Yannakakis", pages = "441--466", journal = "Journal of Computer and System Sciences", year = 1991, month = dec, volume = 43, number = 3, eprint = {JCSS:10.1016/0022-0000(91)90024-Y}, preliminary = "STOC::Yannakakis1988", } @InCollection{Shmoys:97, author = "David B. Shmoys", title = "Cut Problems and Their Application to Divide-and-Conquer", booktitle = "Approximation Algorithms for NP-hard Problems", publisher = "PWS Publishing Company", year = "1997", } @Book{Vazirani:01, author = "Vijay V. Vazirani", title = "Approximation Algorithms", pages = "xix, 378", year = "2001", publisher = "Springer-Verlag", address = "Berlin", cdate = "1970-01-01", mdate = "2005-08-18", } @Article{SheraliAdams:90, author = "Hanif D. Sherali and Warren P. Adams", title = "A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems", journal = "SIAM Journal on Discrete Mathematics", volume = "3", number = "3", pages = "411--430", month = aug, year = "1990", CODEN = "SJDMEC", ISSN = "0895-4801 (print), 1095-7146 (electronic)", MRclass = "90C09 (90C05)", MRnumber = "91k:90116", mrreviewer = "Csaba Fabian", bibdate = "Thu Apr 9 15:20:35 MDT 1998", mrnumber-url = "http://www.ams.org/mathscinet-getitem?mr=91k%3a90116", eprint = {sidma:03/0403036}, } @Article{Razborov:85, author = "Alexander A. Razborov", title = "Lower bounds on the monotone complexity of some {Boolean} functions", journal = "Dokl. Akad. Nauk SSSR", volume = "281", number = "4", pages = "798--801", year = "1985", note = "In Russian: English translation in {\em Soviet Math. Dokl.} 31:354--357, 1985", } @Article{Erdos:59, author = "Paul Erd{\"{o}}s", title = "Graph Theory and Probability", journal = "Canadian Journal of Mathematics", year = "1959", volume = "11", pages = "34--38", keywords = "graph coloring related theory", } @Article{Erdos:62, author = "Paul Erd{\"{o}}s", title = "On Circuits and Subgraphs of Chromatic Graphs", journal = "Mathematika", year = "1962", volume = "9", pages = "170--175", keywords = "graph coloring related theory", } @Book{AlonSpencer:92, author = "Noga Alon and Joel H. Spencer", title = "The probabilistic method", publisher = "Wiley", address = "New York", year = "1992", } @InCollection{AroraLund:95, author = "Sanjeev Arora and Carsten Lund", title = "Hardness of Approximations", chapter = "10", year = "1995", editor = "D. S. Hochbaum", publisher = "PWS", booktitle = "Approximation Algorithms for NP-Hard Problems", } @Book{Bollobas:98, author = "B{\'e}la Bollob{\'a}s", title = "Modern graph theory", booktitle = "Modern graph theory", pages = "xiii, 394", year = "1998", volume = "184", series = "Graduate Texts in Mathematics", publisher = "Springer-Verlag", address = "Berlin", cdate = "1970-01-01", mdate = "2005-08-18", } @Article{FeigeKrauthgamer:03, title = "The Probable Value of the {Lov{\'a}sz--Schrijver} Relaxations for Maximum Independent Set", author = "Uriel Feige and Robert Krauthgamer", journal = "SIAM Journal on Computing", year = "2003", number = "2", volume = "32", bibdate = "2003-11-27", bibsource = "DBLP, http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp32.html#FeigeK03", pages = "345--370", url = "http://epubs.siam.org/sam-bin/dbq/article/40118", eprint = {sicomp:10.1137/S009753970240118X}, } @Article{Feige:98, title = "A Threshold of $\ln n$ for Approximating Set Cover", author = "Uriel Feige", journal = "Journal of the ACM", year = "1998", number = "4", volume = "45", bibdate = "2003-11-20", bibsource = "DBLP, http://dblp.uni-trier.de/db/journals/jacm/jacm45.html#Feige98", pages = "634--652", URL = "http://doi.acm.org/10.1145/285055.285059", eprint = {jacm:285055.285059}, } @Book{Hochbaum:97, editor = "Dorit Hochbaum", title = "Approximation Algorithms for {NP}-hard Problems", publisher = "PWS Publishing Company", year = "1997", } @InProceedings{DinurGKR:03, author = "Irit Dinur and Venkatesan Guruswami and Subhash Khot and Oded Regev", title = "A new multilayered {PCP} and the hardness of hypergraph vertex cover", editor = "{ACM}", booktitle = "Proceedings of the Thirty-Fifth {ACM} Symposium on Theory of Computing, San Diego, {CA}, {USA}, June 9--11, 2003", publisher = "ACM Press", address = "New York, NY, USA", pages = "595--601", year = "2003", eprint = {stoc:780542.780629}, } @Article{Hastad:01, author = "Johan H{\aa}stad", title = "Some optimal inapproximability results", year = "2001", journal = "Journal of the ACM", volume = "48", number = "4", pages = "798--859", eprint = {jacm:258533.258536} } @Article{LovaszSchrijver:91, author = "L\'aszl\'o Lov{\'a}sz and Alexander Schrijver", title = "Cones of matrices and set-functions and $0$-$1$ optimization", journal = "SIAM Journal on Optimization", volume = "1", number = "2", pages = "166--190", month = may, year = "1991", CODEN = "SJOPE8", ISSN = "1052-6234 (print), 1095-7189 (electronic)", MRclass = "05C90 (90C09 90C27)", MRnumber = "MR1098425 (92b:05072)", mrreviewer = "D. de Werra", bibdate = "Tue Sep 30 16:05:25 MDT 2003", bibsource = "MathSciNet database", mrnumber-url = "http://www.ams.org/mathscinet-getitem?mr=92b%3a05072", eprint = {siopt:01/0801013}, } @InProceedings{PapadimitriouVempala:00, author = "Christos H. Papadimitriou and Santosh Vempala", title = "On the approximability of the {Traveling} {Salesman} problem", booktitle = "Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)", pages = "126--133", year = "2000", publisher = "ACM Press", address = "New York", cdate = "1970-01-01", mdate = "2005-08-18", eprint = {stoc:335305.335320} } @Book{GroetschelLS:93, author = "Martin Gr{\"o}tschel and L{\'a}szl{\'o} Lov{\'a}sz and Alexander Schrijver", title = "Geometric Algorithms and Combinatorial Optimization", booktitle = "Geometric Algorithms and Combinatorial Optimization", pages = "xii, 362", year = "1993", volume = "2", series = "Algorithms and Combinatorics", publisher = "Springer-Verlag", address = "Berlin-Heidelberg-New York-London-Paris-Tokyo-Hong Kong-Barcelona-Budapest-Milan-Santa Clara-Singapore", pcomment = "Second Corrected Edition", cdate = "1970-01-01", mdate = "2005-08-18", } @Article{Goemans:95, author = "Michel X. Goemans", title = "Worst-case comparison of valid inequalities for the {TSP}", journal = "Mathematical Programming", volume = "69", year = "1995", pages = "335--349", eprint = {MathProg:n25193135v44l625}, } @InProceedings{GoemansWilliamson:94, author = "Michel X. Goemans and David P. Williamson", title = "$.878$-approximation algorithms for {MAX} {CUT} and {MAX} 2{SAT}", booktitle = "Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montr{\'e}al, Qu{\'e}bec, Canada, May 23-25, 1994)", pages = "422--431", year = "1994", publisher = "ACM Press", address = "New York", cdate = "1970-01-01", mdate = "2005-08-18", eprint = {stoc:195058.195216}, } @Article{GoemansTuncel:01, title = "When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?", author = "Michel X. Goemans and Levent Tun{\c c}el", journal = "Mathematics of Operations Research", year = "2001", number = "4", volume = "26", bibdate = "2004-10-26", bibsource = "DBLP, http://dblp.uni-trier.de/db/journals/mor/mor26.html#GoemansT01", pages = "796--815", URL = "http://dx.doi.org/10.1287/moor.26.4.796.10012", } @Article{Feige:97, title = "Randomized Graph Products, Chromatic Numbers, and the {Lov{\'a}sz} $\vartheta$-Function", author = "Uriel Feige", journal = "Combinatorica", year = "1997", number = "1", volume = "17", bibdate = "2002-01-03", bibsource = "DBLP, http://dblp.uni-trier.de/db/journals/combinatorica/combinatorica17.html#Feige97", pages = "79--90", eprint = {Combinatorica:x785787h43724566} } @Article{BonetPR:97, title = "Lower Bounds for Cutting Planes Proofs with Small Coefficients", author = "Maria Bonet and Toniann Pitassi and Ran Raz", pages = "708--728", journal = "The Journal of Symbolic Logic", year = "1997", month = sep, volume = "62", number = "3", preliminary = "STOC::BonetPR1995", } %% ToC Vol 2 article 3 .bib file @InProceedings{bartal:focs-96, author = "Yair Bartal", booktitle = "Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science", title = "Probabilistic Approximations of Metric Spaces and its Algorithmic Applications", pages = "184--193", year = "1996", eprint = {focs:10.1109/SFCS.1996.548477} } @InProceedings{CCGG98, author = "Moses Charikar and Chandra Chekuri and Ashish Goel and Sudipto Guha", booktitle = {Proceedings of the 30th Annual Symposium on the Theory of Computing}, title = "Rounding via trees: deterministic approximation algorithms for group {Steiner} trees and $k$ median", pages = "114--123", year = "1998", eprint = {stoc:10.1145/276698.276719} } @article {evenetal:manuscript-01, AUTHOR = {Even, Guy and Kortsarz, Guy and Slany, Wolfgang}, TITLE = {On network design problems: fixed cost flows and the covering {S}teiner problem}, JOURNAL = {ACM Trans. Algorithms}, FJOURNAL = {ACM Transactions on Algorithms}, VOLUME = {1}, YEAR = {2005}, NUMBER = {1}, PAGES = {74--101}, ISSN = {1549-6325}, MRCLASS = {68R10 (05C85 68Q25 68W25 90B10)}, MRNUMBER = {MR2163131}, eprint = {talg:10.1145/1077464.1077470} } @article {fak-rao-tal, AUTHOR = {Fakcharoenphol, Jittat and Rao, Satish and Talwar, Kunal}, TITLE = {A tight bound on approximating arbitrary metrics by tree metrics}, JOURNAL = {J. Comput. System Sci.}, FJOURNAL = {Journal of Computer and System Sciences}, VOLUME = {69}, YEAR = {2004}, NUMBER = {3}, PAGES = {485--497}, ISSN = {0022-0000}, CODEN = {JCSSBM}, MRCLASS = {05C10 (68R10 68W25)}, MRNUMBER = {MR2087946 (2005h:05056)}, MRREVIEWER = {A. Vijayakumar}, EPRINT = {jcss:10.1016/j.jcss.2004.04.011} } @Article{gargetal:soda-98, author = "Naveen Garg and Goran Konjevod and R. Ravi", title = "A polylogarithmic approximation algorithm for the group {Steiner} tree problem", journal = "Journal of Algorithms", volume = "37", number = "1", pages = "66--84", year = "2000", eprint = {JAlg:10.1006/jagm.2000.1096} } @InProceedings{hkksw, author = "Eran Halperin and Guy Kortsarz and Robert Krauthgamer and Aravind Srinivasan and Nan Wang", booktitle = "14th Annual ACM-SIAM Symposium on Discrete Algorithms", title = "Integrality ratio for Group {Steiner} Trees and Directed {Steiner} Trees", pages = "275--284", month = Jan, year = "2003", eprint = {soda:644108.644155} } @InProceedings{halp-krau-polylog, author = "Eran Halperin and Robert Krauthgamer", booktitle = "Proceedings of the thirty-fifth ACM symposium on Theory of computing", title = "Polylogarithmic inapproximability", publisher = "ACM Press", pages = "585--594", year = "2003", ISBN = "1-58113-674-9", location = "San Diego, CA, USA", eprint = {stoc:10.1145/780542.780628} } @article {janson:rsa-90, AUTHOR = {Janson, Svante}, TITLE = {Poisson approximation for large deviations}, JOURNAL = {Random Structures and Algorithms}, FJOURNAL = {Random Structures and Algorithms}, VOLUME = {1}, YEAR = {1990}, NUMBER = {2}, PAGES = {221--229}, ISSN = {1042-9832}, MRCLASS = {60F10 (05C80 60C05)}, MRNUMBER = {MR1138428 (93a:60041)}, MRREVIEWER = {Andrew D. Barbour}, } @article {krs:cov-stei, AUTHOR = {Konjevod, Goran and Ravi, R. and Srinivasan, Aravind}, TITLE = {Approximation algorithms for the covering {S}teiner problem}, NOTE = {Special Issue on \textit{Probabilistic methods in combinatorial optimization}}, JOURNAL = {Random Structures and Algorithms}, FJOURNAL = {Random Structures and Algorithms}, VOLUME = {20}, YEAR = {2002}, NUMBER = {3}, PAGES = {465--482}, ISSN = {1042-9832}, MRCLASS = {90C35 (05C05 05C85)}, MRNUMBER = {MR1900617 (2003c:90125)}, EPRINT = {RSA:10.1002/rsa.10038} } @inproceedings {srinivasan:soda-01, AUTHOR = {Srinivasan, Aravind}, TITLE = {New approaches to covering and packing problems}, BOOKTITLE = {Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001)}, PAGES = {567--576}, PUBLISHER = {SIAM}, ADDRESS = {Philadelphia, PA}, YEAR = {2001}, MRCLASS = {68W25 (90B80 90C27)}, MRNUMBER = {MR1958450}, EPRINT = {soda:365411.365535} } @PhdThesis{Khandekar, author = {Rohit Khandekar}, title = {Lagrangian Relaxation based Algorithms for Convex Programming Problems}, school = {Indian Institute of Technology, New Delhi}, year = 2004, month = {March} } @inproceedings{Garg05, author = {Naveen Garg}, title = {Saving an epsilon: a 2-approximation for the k-MST problem in graphs.}, booktitle = {Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005}, year = 2005, pages = {396-402}, eprint = {stoc:10.1145/1060590.1060650}, } %% ToC v002/a004.bib @string{pofthe= "Proceedings of the "} @string{stoc ="ACM Symposium on Theory of Computing"} @string{asttoc=" Annual " # stoc} @string{stoc05=pofthe # "Thirty-Seventh" # asttoc} @string{stoc04=pofthe # "Thirty-Sixth" # asttoc} @string{stoc99=pofthe # "Thirty-First" # asttoc} @string{stoc96=pofthe # "Twenty-Eighth" # asttoc} @string{focs=" Annual Symposium on Foundations of Computer Science"} @string{focs99=pofthe # "Fortieth" # focs} @string{focs02=pofthe # "Forty-Third" # focs} @string{focs03=pofthe # "Forty-Fourth " # focs} @string{discamath="Discrete Applied Mathematics"} @string{doklady="Doklady Akademii Nauk SSSR, n.s."} @string{jsl="Journal of Symbolic Logic"} @string{dcs="Department of Computer Science"} @string{ipco99=pofthe # "Seventh Annual Conference on Integer Programming and Combinatorial Optimization"} @string{stacs=" Annual Symposium on Theoretical Aspects of Computer Science"} @string{stacs02=pofthe # "Eighteenth" # stacs} @string{icalp=" International Colloquium on Automata, Languages and Programming"} @string{icalp02=pofthe # "Twenty-Ninth" # icalp} @inproceedings{bw:reswidth, author={Ben-Sasson, E. and Wigderson, A.}, title={Short proofs are narrow -- {R}esolution made simple}, booktitle=stoc99,month=may,year=1999,address={Atlanta, GA}, pages={517--526}, eprint="stoc:301250.301392"} @inproceedings{cei:grobner, author={Clegg, M. and Edmonds, J. and Impagliazzo, R.}, title={Using the {G}r\"obner basis algorithm to find proofs of unsatisfiability}, booktitle=stoc96,month=may,year=1996,address={Philadelphia, PA}, pages={174--183}, eprint="stoc:237814.237860"} @article{chvatal:cut, author={Chv{\'a}tal, V.}, title={Edmonds polytopes and a hierarchy of combinatorial problems}, journal={Discrete Mathematics}, volume=4, number=4, pages={305--337}, year=1973, eprint={DiscMath:10.1016/0012-365X(73)90167-2}} @article{cs:resolution, author={Chv{\'a}tal, V. and Szemer{\'e}di, E.}, title={Many Hard Examples for Resolution}, journal=jacm, volume=35, number=4, year=1988, pages={759-768}, eprint="jacm:48014.48016"} @article{cct:cut, author={Cook, W. and Coullard, {C.\,R.} and Tur{\'a}n, G.}, title={On the complexity of cutting plane proofs}, journal=discamath, volume=18, year=1987, pages={25--38}, eprint={damath:10.1016/0166-218X(87)90039-4}} @article{haken:pigeon, author={Haken, A.}, title={The intractability of resolution}, journal=tcs, volume=39, year=1985, pages={297-305}, eprint="tcs:10.1016/0304-3975(85)90144-6"} @article{khachian:lp, author={Khachian, {L.\,G.}}, title={A Polynomial Time Algorithm for Linear Programming}, journal=doklady, volume=244, number=5, pages={1093-1096}, note={English translation in {\em Soviet Math. Dokl. 20}, 191--194.}, year=1979} @article{ls:cones, author={Lov{\'a}sz, L. and Schrijver, A.}, title={Cones of matrices and set-functions and 0-1 optimization}, journal={SIAM J. Optimization}, volume=1, number=2, pages={166--190}, year=1991, eprint="siopt:01/0801013" } @article{pudlak:real, author={Pudl{\'a}k, Pavel}, title={Lower bounds for resolution and cutting plane proofs and monotone computations}, journal=jsl, volume=62, number=3, pages={981--998}, month=sep, year=1997} @incollection{tseitin68, author={Tseitin, {G.\,S.}}, title={On the complexity of derivation in the propositional calculus}, booktitle={Studies in Constructive Mathematics and Mathematical Logic, Part II}, year=1968, editor={Slisenko, {A.\,O.}}} @inproceedings{ipu:cp, author={Impagliazzo, R. and Pitassi, T. and Urquhart, A.}, title={Upper and lower bounds on tree-like Cutting Planes proofs}, booktitle={Proceedings from Logic in Computer Science}, year=1994, eprint={lics:10.1109/LICS.1994.316069}, } @inproceedings{bg:reswidth, author={Bonet, {M.\,L.} and Galesi, N.}, title={A study of proof search algorithms for {R}esolution and {P}olynomial {C}alculus}, booktitle=focs99, pages={422-431}, year=1999, eprint="focs:10.1109/SFFCS.1999.814614"} @article{dp:prover, author={Davis, M. and Putnam, H.}, title={A computing procedure for quantification theory}, journal=jacm, volume=7, number=3, year=1960, pages={201--215}, eprint="jacm:321033.321034"} @Article{krish:GTn, title = "Short Proofs for Tricky Formulas", author = "B.~Krishnamurthy", pages = "253--275", journal = "Acta Informatica", year = "1985", volume = "22", eprint="actainf:mp65776636126242" } @InProceedings{Gom:60, author = "{R.\,E.} Gomory", title = "Solving linear programming problems in integers", booktitle = "Combinatorial Analysis", year = "1960", editor = "R. Bellman and M. {Hall, Jr.}", organization = "Symposia in Applied Mathematics X, American Mathematical Society", address = "Providence, RI", pages = "211--215", } @inproceedings{Eisenbrand:99, author = "Friedrich Eisenbrand and Andreas S. Schulz", title = "Bounds on the {C}hv{\'a}tal Rank of Polytopes in the $0/1$-Cube", booktitle=ipco99, series = "Lecture Notes in Computer Science", number = "1610", pages = "137--150", year = "1999", coden = "LNCSD9", ISSN = "0302-9743", bibdate = "Tue Feb 5 11:54:07 MST 2002", url = "http://link.springer-ny.com/link/service/series/0558/bibs/1610/16100137.htm; http://link.springer-ny.com/link/service/series/0558/papers/1610/16100137.pdf", acknowledgement = ack-nhfb, eprint="ipco:y0ruretrf6paebe1" } @Article{CCH:89, author = "V. Chv{\'a}tal and W. Cook and M. Hartmann", title = "On cutting-plane proofs in combinatorial optimization", journal = "Linear Algebra and its Applications", volume = "114/115", pages = "455--499", year = "1989", coden = "LAAPAW", ISSN = "0024-3795", mrclass = "90C27 (68R10 90C10)", mrnumber = "90d:90067", mrreviewer = "Endre Boros", bibdate = "Thu Jan 23 11:18:08 MST 1997", acknowledgement = ack-nhfb, eprint = {laappl:10.1016/0024-3795(89)90476-X}, } @article{BEHS:99, author = "A. Bockmayr and F. Eisenbrand and {M.\,E.} Hartmann and {A.\,S.} Schulz", title = "On the {C}hv{\'a}tal Rank of Polytopes in the 0/1 Cube", journal = "Discrete Applied Mathematics", month = oct, number = "1-2", volume = "98", year = "1999", pages = "21--27", eprint = {damath:10.1016/S0166-218X(99)00156-0} } @inproceedings{GHP02, author = "D. Grigoriev and {E.\,A.} Hirsch and {D.\,V.} Pasechnik", title = "Complexity of Semi-algebraic Proofs", booktitle =stacs02, series = {Lecture Notes in Computer Science}, number = {2285}, pages = "419--430", year = "2002", url = "citeseer.nj.nec.com/505088.html", eprint="stacs:t7lpe5yvaphpp0j6" } @inproceedings{GHP02a, author = "D. Grigoriev and {E.\,A.} Hirsch and {D.\,V.} Pasechnik", title = "Exponential lower bound for static semi-algebraic proofs", booktitle=icalp02, series= "Lecture notes in computer science", number = "2380", pages = "257--268", year = "2002", eprint="icalp:j2k07b37hmw2pfgw"} @techreport{HK:03, author={{E.\,A.} Hirsch and A. Kojevnikov}, title={Several notes on the power of {G}omory-{C}hv{\'a}tal cuts}, institution={ECCC}, number={TR03-012}, year=2003, eprint="eccc:TR03-012" } @article{stalmark:GTn, author = "G. Stalmark", title = "Short Resolution proofs for a sequence of tricky formulas", journal = "Acta Informatica", volume = "33", number=3, pages = "277-280", year = "1996", eprint="actainf:lhrhe2glkmgflbu1"} @InProceedings{ABL:02, author = "S. Arora and B. Bollob{\'a}s and L. Lov{\'a}sz", title = "Proving Integrality Gaps without Knowing the Linear Program", booktitle = focs02, pages="313--322", year = "2002", eprint="focs:10.1109/SFCS.2002.1181954" } @ARTICLE{ABLT:06, author={S. Arora and B. Bollob{\'a}s and L. Lov{\'a}sz and I. Tourlakis}, title ={Proving Integrality Gaps without Knowing the Linear Program}, year = 2006, journal = {Theory of Computing}, volume = 2, number = 2, pages = {19--51}, eprint = {toc:v002/a002} } @unpublished{TourlakisVC:05, author={I. Tourlakis}, title ={New lower bounds for vertex cover in the {L}ov{\'a}sz-{S}chrijver hierarchy}, year = 2005, note="Manuscript"} @InProceedings{aat:04, author={M. Alekhnovich and S. Arora and I. Tourlakis}, title={Towards strong approximability results in the {L}ov{\'a}sz-{S}chrijver hierarchy}, booktitle=stoc05, pages="294--303", year = 2005, eprint="stoc:1060590.1060634"} @inproceedings{ARV:04, author = "S. Arora and S. Rao and U. Vazirani", title = "Expander flows, geometric embeddings and graph partitioning", booktitle=stoc04,month=jun,year=2004,address={Chicago, IL}, pages="222--231", eprint="stoc:1007352.1007355" } @article{Hastad:01, author = "J. H{\aa}stad", title = "Some optimal inapproximability results", journal = "Journal of the ACM", volume = "48", number=4, year = "2001", pages = "798--859", eprint="jacm:502090.502098" } @phdthesis{dash:01, author={S. Dash}, title={On the matrix cuts of {L}ov{\'a}sz and {S}chrijver and their use in Integer Programming}, month=mar, year=2001, school=dcs # ", Rice University"} @article{dash:05, author = "S. Dash", title = "An exponential lower bound on the length of some classes of branch-and-cut proofs", journal = "Mathematics of Operations Research", year = "2005", volume = "30", number = "3", pages = "678--700" } @article{GT:00, author = "M. Goemans and L. Tun\c{c}el", title = "When does the postive semidefiniteness constraint help in lifting procedures", journal = "Mathematics of Operations Research", volume = "26", pages = "796--815", year = "2001"} @Article{ST:99, author = "T. Stephen and L. Tun\c{c}el", title = "On a representation of the matching polytope via semidefinite liftings", year = "1999", journal = "Mathematics of Operations Research", volume = "24(1)", pages = "1--7", URL = "http://www.math.uwaterloo.ca/~ltuncel", } @book{GLS:93, AUTHOR = {Gr{\"o}tschel, Martin and Lov{\'a}sz, L{\'a}szl{\'o} and Schrijver, Alexander}, TITLE = {Geometric algorithms and combinatorial optimization}, SERIES = {Algorithms and Combinatorics}, VOLUME = {2}, EDITION = {Second}, PUBLISHER = {Springer-Verlag}, ADDRESS = {Berlin}, YEAR = {1993}, PAGES = {xii+362}, ISBN = {3-540-56740-2}, MRCLASS = {90-02 (52C07 90C27)}, MRNUMBER = {95e:90001}, MRREVIEWER = {Ulrich Faigle}, } @article{FK:03, author = "U. Feige and R. Krauthgamer", title = "The probable value of {L}ov{\'a}sz-{S}chrijver relaxations for maximum independent set", journal = "SIAM Journal on Computing", volume = "32", number = "2", pages = "345--370", year = "2003", eprint="sicomp:10.1137/S009753970240118X"} @techreport{abl-cp:03, author={A. Atserias and {M.\,L.} Bonet and J. Levy}, title={On {C}hv{\'a}tal Rank and Cutting Planes Proofs}, institution={ECCC}, number={TR03-041}, year = 2003, eprint={eccc:TR03-041}} @inproceedings{bghmp:03, author={J. Buresh-Oppenheim and N. Galesi and S. Hoory and A. Magen and T. Pitassi }, title={Rank Bounds and Integrality Gaps for Cutting Planes Procedures}, booktitle=focs03, year=2003, pages="318--327", eprint="focs:10.1109/SFCS.2003.1238206"} @Article{GW:95, author = "M. Goemans and D. Williamson", title = "Improved Approximation algorithms for maximum cut and satisfiability problems using semidefinite programming", journal =jacm, volume = "42", number = "6", year = "1995", pages = "1115--1145", eprint="jacm:227683.227684" } @InProceedings{TourlakisHVC:05, author = "I. Tourlakis", title = "Towards Optimal Integrality Gaps for hypergraph vertex cover in the {L}ov{\'a}sz-{S}chrijver hierarchy", pages = "233--244", booktitle = "Proceedings of Eighth International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and Ninth International Workshop on Randomization and Computation", year = "2005", ps="http://www.cs.princeton.edu/~itourlak/publications/approx05.ps" } @phdthesis{hartmann, author={Hartmann, Mark}, title={Cutting Planes and the Complexity of the Integer Hull}, year=1988, school={Cornell University}, note={Department of Operations Research and Industrial Engineering} } %% ToC v002/a005.bib @Article{AjtaiKoSz83, AUTHOR = {Mikl{\'o}s Ajtai and J{\'a}nos Koml{\'o}s and Endre Szemer{\'e}di}, TITLE = {Sorting in $c\,{\rm log}\,n$ parallel steps}, JOURNAL = {Combinatorica}, FJOURNAL = {Combinatorica. An International Journal of the J{\'a}nos Bolyai Mathematical Society}, VOLUME = {3}, YEAR = {1983}, NUMBER = {1}, PAGES = {1--19}, ISSN = {0209-9683}, CODEN = {COMBDI}, MRCLASS = {68P10}, MRNUMBER = {85d:68017}, MRREVR = {Ernst-Erich Doberkat}, } @article {Alon86, AUTHOR = {Noga Alon}, TITLE = {Eigenvalues and expanders}, JOURNAL = {Combinatorica}, FJOURNAL = {Combinatorica. An International Journal of the J{\'a}nos Bolyai Mathematical Society}, VOLUME = {6}, YEAR = {1986}, NUMBER = {2}, PAGES = {83--96}, ISSN = {0209-9683}, CODEN = {COMBDI}, MRCLASS = {05C50}, MRNUMBER = {88e:05077}, MRREVR = {Claude Benzaken}, } @article {AlonGaMi87, AUTHOR = {Alon, Noga and Galil, Zvi and Milman, Vitali D.}, TITLE = {Better expanders and superconcentrators}, JOURNAL = {Journal of Algorithms}, VOLUME = {8}, YEAR = {1987}, NUMBER = {3}, PAGES = {337--347}, ISSN = {0196-6774}, CODEN = {JOALDV}, MRCLASS = {68Q20 (05C75 68R10)}, MRNUMBER = {89f:68023}, eprint="jalg:10.1016/0196-6774(87)90014-9" } @incollection {AlonLuWi01, AUTHOR = {Alon, Noga and Lubotzky, Alexander and Wigderson, Avi}, TITLE = {Semi-direct product in groups and zig-zag product in graphs: connections and applications (extended abstract)}, BOOKTITLE = {Proc. of the 42nd Annual Symposium on Foundations of Computer Science (Las Vegas, NV, 2001)}, PAGES = {630--637}, PUBLISHER = {IEEE Computer Soc., Los Alamitos, CA}, YEAR = {2001}, MRCLASS = {20E22 (05C25 68R10)}, MRNUMBER = {1 948 752}, eprint={focs:10.1109/SFCS.2001.959939} } @article {AlonMi85, AUTHOR = {Alon, Noga and Milman, Vitali D.}, TITLE = {$\lambda\sb 1,$ isoperimetric inequalities for graphs, and superconcentrators}, JOURNAL = {Journal of Combinatorial Theory. Series B}, VOLUME = {38}, YEAR = {1985}, NUMBER = {1}, PAGES = {73--88}, ISSN = {0095-8956}, CODEN = {JCBTB8}, MRCLASS = {05C50}, MRNUMBER = {87b:05092}, EPRINT = {jcombthb:10.1016/0095-8956(85)90092-9} } @article {AmitLin02, AUTHOR = {Amit, Alon and Linial, Nathan}, TITLE = {Random graph coverings. {I}. {G}eneral theory and graph connectivity}, JOURNAL = {Combinatorica}, FJOURNAL = {Combinatorica. An International Journal on Combinatorics and the Theory of Computing}, VOLUME = {22}, YEAR = {2002}, NUMBER = {1}, PAGES = {1--18}, ISSN = {0209-9683}, MRCLASS = {05C80 (05C10 05C40)}, MRNUMBER = {MR1883559 (2003a:05131)}, MRREVIEWER = {Lauren{\c{t}}iu Modan}, EPRINT = {combinatorica:er6qljcyq3v8pyd2} } @inproceedings{Ben-SassonSuVaWi03, author = {Eli Ben-Sasson and Madhu Sudan and Salil Vadhan and Avi Wigderson}, title = {Randomness-efficient low degree tests and short {PCPs} via epsilon-biased sets}, booktitle = {Proc. of the 35th Annual ACM Symposium on Theory of Computing}, year = {2003}, isbn = {1-58113-674-9}, pages = {612--621}, location = {San Diego, CA, USA}, publisher = {ACM Press}, eprint="stoc:780542.780631", } @inproceedings{BiluLin04, author = {Yonatan Bilu and Nati Linial}, title = {Constructing Expander Graphs by 2-lifts and Discrepancy vs. Spectral Gap}, isbn = {}, pages = {404--412}, location = {}, publisher = {}, crossref={FOCS45}, eprint="focs:10.1109/FOCS.2004.19" } @InProceedings{BroderSha87, title={On the Second Eigenvalue of Random Regular Graphs (Preliminary Version)}, author={Broder, Andrei and Shamir, Eli}, pages={286--294}, crossref={FOCS28}, source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib}, } @inproceedings{CapalboReVaWi02, author = {Michael Capalbo and Omer Reingold and Salil Vadhan and Avi Wigderson}, title = {Randomness conductors and constant-degree lossless expanders}, booktitle = {Proc. of the 34th Annual ACM Symposium on Theory of Computing}, year = {2002}, isbn = {1-58113-495-9}, pages = {659--668}, location = {Montreal, Quebec, Canada}, publisher = {ACM Press}, eprint="stoc:509907.510003", } @article {DiaconisSh94, AUTHOR = {Diaconis, Persi and Shahshahani, Mehrdad}, TITLE = {On the eigenvalues of random matrices}, OPTNOTE = {Studies in applied probability}, JOURNAL = {J. Appl. Probab.}, FJOURNAL = {Journal of Applied Probability}, VOLUME = {31A}, YEAR = {1994}, PAGES = {49--62}, ISSN = {0021-9002}, CODEN = {JPRBAM}, MRCLASS = {60B15 (15A18 15A52 60F05)}, MRNUMBER = {95m:60011}, MRREVIEWER = {Daniel Rockmore}, } @article {Eichler54, AUTHOR = {Eichler, Martin}, TITLE = {Quatern\"are quadratische {F}ormen und die {R}iemannsche {V}ermutung f\"ur die {K}ongruenzzetafunktion}, JOURNAL = {Arch. Math.}, VOLUME = {5}, YEAR = {1954}, PAGES = {355--366}, MRCLASS = {10.0X}, MRNUMBER = {16,116d}, MRREVIEWER = {L. Carlitz}, } @article {Friedman04, AUTHOR = {Friedman, Joel}, TITLE = {A proof of {A}lon's second eigenvalue conjecture}, JOURNAL = {Memoirs of the AMS}, FJOURNAL = {}, VOLUME = {}, YEAR = {to appear}, NUMBER = {}, PAGES = {}, ISSN = {}, MRCLASS = {}, MRNUMBER = {}, MRREVIEWER = {}, eprint="arxiv:cs.DM/0405020" } @Article{GabberGa81, title={Explicit Constructions of Linear-Sized Superconcentrators}, author={Ofer Gabber and Zvi Galil}, pages={407--420}, journal=jcss, year=1981, month=jun, volume=22, number=3, preliminary={FOCS::GabberG1979}, source={http://theory.lcs.mit.edu/~dmjones/hbp/jcss/jcss.bib}, eprint="jcss:10.1016/0022-0000(81)90040-4" } @InProceedings{GoldreichImLeVeZu90, title={Security Preserving Amplification of Hardness}, author={Goldreich, Oded and Impagliazzo, Russell and Levin, Leonid and Venkatesan, Ramarathnam and Zuckerman, David}, pages={318--326}, crossref={FOCS31a}, source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib} } @article {Gromov00, AUTHOR = {Gromov, Misha}, TITLE = {Spaces and questions}, NOTE = {Part I of Special Volume on GAFA 2000 (Tel Aviv, 1999)}, JOURNAL = {Geometric and Functional Analysis}, YEAR = {2000}, PAGES = {118--161}, ISSN = {1016-443X}, CODEN = {GFANFB}, MRCLASS = {53C23 (57-XX)}, MRNUMBER = {1 826 251}, } @article {Gross77, AUTHOR = {Gross, Jonathan L.}, TITLE = {Every connected regular graph of even degree is a {S}chreier coset graph}, JOURNAL = {Journal of Combinatorial Theory. Series B}, VOLUME = {22}, YEAR = {1977}, NUMBER = {3}, PAGES = {227--232}, MRCLASS = {05C25}, MRNUMBER = {MR0450121 (56 \#8419)}, MRREVIEWER = {A. T. White}, EPRINT = {jcombthb:10.1016/0095-8956(77)90068-5} } @InProceedings{ImpagliazzoNiWi94, title={Pseudorandomness for Network Algorithms}, author={Russell Impagliazzo and Noam Nisan and Avi Wigderson}, pages={356--364}, crossref={STOC26}, source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}, eprint="stoc:195058.195190" } @InProceedings{ImpagliazzoWi97, title={{$\mathit{P} = \mathit{BPP}$} if {$E$} Requires Exponential Circuits: Derandomizing the {XOR} Lemma}, author={Russell Impagliazzo and Avi Wigderson}, pages={220--229}, crossref={STOC29}, source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib}, eprint="stoc:258533.258590" } @article {JimboMa87, AUTHOR = {Shuji Jimbo and Akira Maruoka}, TITLE = {Expanders obtained from affine transformations}, JOURNAL = {Combinatorica}, FJOURNAL = {Combinatorica. An International Journal of the J{\'a}nos Bolyai Mathematical Society}, VOLUME = {7}, YEAR = {1987}, NUMBER = {4}, PAGES = {343--355}, ISSN = {0209-9683}, CODEN = {COMBDI}, MRCLASS = {68R10 (05C99)}, MRNUMBER = {89d:68071}, MRREVR = {Mirko K{\v{r}}iv{\'a}nek}, } @article {KaltonRo83, AUTHOR = {Kalton, Nigel J. and Roberts, James W.}, TITLE = {Uniformly exhaustive submeasures and nearly additive set functions}, JOURNAL = {Transactions of the American Mathematical Society}, VOLUME = {278}, YEAR = {1983}, NUMBER = {2}, PAGES = {803--816}, ISSN = {0002-9947}, CODEN = {TAMTAM}, MRCLASS = {28A60 (46A06)}, MRNUMBER = {85f:28006}, MRREVIEWER = {Z. Lipecki}, } @misc{Kassabov05, author = "Martin Kassabov", title = "Symmetric Groups and Expander Graphs", HOWPUBLISHED = {arxiv:math.GR/0505624}, eprint="arxiv:math.GR/0505624" } @misc{Kassabov_lattices05, author = "Martin Kassabov", title = "Universal lattices and unbounded rank expanders", HOWPUBLISHED = {arxiv:math.GR/0502237}, eprint="arxiv:math.GR/0502237" } @article {Kazhdan67, AUTHOR = {Kazhdan, David}, TITLE = {On the connection of the dual space of a group with the structure of its closed subgroups ({R}ussian)}, JOURNAL = {Funkcional. Anal. i Prilozh.}, VOLUME = {1}, YEAR = {1967}, PAGES = {71--74}, MRCLASS = {}, MRNUMBER = {}, MRREVIEWER = {}, } @article {Klawe84, AUTHOR = {Klawe, Maria}, TITLE = {Limitations on explicit constructions of expanding graphs}, JOURNAL = {SIAM J. Comput.}, FJOURNAL = {SIAM Journal on Computing}, VOLUME = {13}, YEAR = {1984}, NUMBER = {1}, PAGES = {156--166}, ISSN = {0097-5397}, CODEN = {SMJCAT}, MRCLASS = {68R10 (05C99)}, MRNUMBER = {85k:68077}, eprint="sicomp:13/0213011" } @incollection {LovaszWi98, AUTHOR = {Lov{\'a}sz, L{\'a}szl{\'o} and Winkler, Peter}, TITLE = {Mixing times}, BOOKTITLE = {Microsurveys in discrete probability (Princeton, NJ, 1997)}, SERIES = {DIMACS Ser. Discrete Math. Theoret. Comput. Sci.}, VOLUME = {41}, PAGES = {85--133}, PUBLISHER = {Amer. Math. Soc.}, ADDRESS = {Providence, RI}, YEAR = {1998}, MRCLASS = {60J10 (60G40 62L15)}, MRNUMBER = {99h:60138}, MRREVIEWER = {Mark R. Jerrum}, } @book {Lubotzky94, AUTHOR = {Lubotzky, Alexander}, TITLE = {Discrete groups, expanding graphs and invariant measures}, PUBLISHER = {Birkh\"auser Verlag}, ADDRESS = {Basel}, YEAR = {1994}, PAGES = {xii+195}, ISBN = {3-7643-5075-X}, MRCLASS = {22E40 (05C25 11F70 28C10 43A07)}, MRNUMBER = {96g:22018}, MRREVIEWER = {Wolfgang Woess}, } @article {LubotzkyPa01, AUTHOR = {Lubotzky, Alexander and Pak, Igor}, TITLE = {The product replacement algorithm and {K}azhdan's property ({T})}, JOURNAL = {Journal of the American Mathematical Society}, VOLUME = {14}, YEAR = {2001}, NUMBER = {2}, PAGES = {347--363 (electronic)}, ISSN = {0894-0347}, MRCLASS = {60B15 (05C25 22D10 60J10)}, MRNUMBER = {1 815 215}, EPRINT ="jams:jams/2001-14-02/S0894-0347-00-00356-8" } @article {LubotzkyPhSa88, AUTHOR = {Lubotzky, Alex and Phillips, Ralph and Sarnak, Peter}, TITLE = {Ramanujan graphs}, JOURNAL = {Combinatorica}, FJOURNAL = {Combinatorica. An International Journal of the J{\'a}nos Bolyai Mathematical Society}, VOLUME = {8}, YEAR = {1988}, NUMBER = {3}, PAGES = {261--277}, ISSN = {0209-9683}, CODEN = {COMBDI}, MRCLASS = {05C75 (05C25 05C50)}, MRNUMBER = {89m:05099}, MRREVR = {David Riley Witte}, EPRINT = {combinatorica:k285687344657q53} } @incollection {LubotzkyWe93, AUTHOR = {Lubotzky, A. and Weiss, B.}, TITLE = {Groups and expanders}, BOOKTITLE = {Expanding graphs (Princeton, NJ, 1992)}, SERIES = {DIMACS Ser. Discrete Math. Theoret. Comput. Sci.}, VOLUME = {10}, PAGES = {95--109}, PUBLISHER = {Amer. Math. Soc.}, ADDRESS = {Providence, RI}, YEAR = {1993}, MRCLASS = {05C25 (20F99 22E40)}, MRNUMBER = {95b:05097}, } @article{Margulis73, AUTHOR = {Margulis, Gregory A.}, TITLE = {Explicit constructions of expanders}, JOURNAL = {Problemy Pereda{\v c}i Informacii}, VOLUME = {9}, YEAR = {1973}, NUMBER = {4}, PAGES = {71--80}, MRCLASS = {94A15 (22E45)}, MRNUMBER = {58 #4643}, MRREVR = {J. S. Joel}, } @article {Margulis88, AUTHOR = {Margulis, Gregory A.}, TITLE = {Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators}, JOURNAL = {Problemy Peredachi Informatsii}, FJOURNAL = {Akademiya Nauk SSSR. Institut Problem Peredachi Informatsii Akademii Nauk SSSR. Problemy Peredachi Informatsii}, VOLUME = {24}, YEAR = {1988}, NUMBER = {1}, PAGES = {51--60}, ISSN = {0555-2923}, MRCLASS = {68R10 (05C99 94A15)}, MRNUMBER = {89f:68054}, MRREVR = {Mirko K{\v{r}}iv{\'a}nek}, } @inproceedings{MeshulamWi02, author = {Roy Meshulam and Avi Wigderson}, title = {Expanders from symmetric codes}, booktitle = {Proc. of the 34th Annual ACM Symposium on Theory of Computing}, year = {2002}, isbn = {1-58113-495-9}, pages = {669--677}, location = {Montreal, Quebec, Canada}, publisher = {ACM Press}, eprint="stoc:509907.510004", } @article {Morgenstern94, AUTHOR = {Morgenstern, Moshe}, TITLE = {Existence and explicit constructions of $q+1$ regular {R}amanujan graphs for every prime power $q$}, JOURNAL = {Journal of Combinatorial Theory. Series B}, VOLUME = {62}, YEAR = {1994}, NUMBER = {1}, PAGES = {44--62}, ISSN = {0095-8956}, CODEN = {JCBTB8}, MRCLASS = {05C35 (05C25)}, MRNUMBER = {95h:05089}, MRREVR = {Marcus du Sautoy}, EPRINT = {jcombthb:10.1006/jctb.1994.1054} } @Article{NaorNa93, title={Small-Bias Probability Spaces: Efficient Constructions and Applications}, author={Joseph Naor and Moni Naor}, pages={838--856}, journal=sicomp, year=1993, month=aug, volume=22, number=4, source={http://theory.lcs.mit.edu/~dmjones/hbp/sicomp/sicomp.bib}, eprint="sicomp:22/0222053" } @article {Nikolov03, AUTHOR = {Nikolov, Nikolay}, TITLE = {On the commutator width of perfect groups}, JOURNAL = {Bull. London Math. Soc.}, FJOURNAL = {The Bulletin of the London Mathematical Society}, VOLUME = {36}, YEAR = {2004}, NUMBER = {1}, PAGES = {30--36}, ISSN = {0024-6093}, CODEN = {LMSBBT}, MRCLASS = {20E22 (20F12)}, MRNUMBER = {MR2011975 (2004m:20055)}, MRREVIEWER = {Carlo M. Scoppola}, EPRINT = {blms:10.1112/S0024609303002601} } @misc{NikolovKa05, author = "Martin Kassabov and Nikolay Nikolov", title = "Universal lattices and Property $\tau$", HOWPUBLISHED = {arxiv:math.GR/0502112}, eprint="arxiv:math.GR/0502112" } @article {Ore51, AUTHOR = {Ore, Oystein}, TITLE = {Some remarks on commutators}, JOURNAL = {Proc. Amer. Math. Soc.}, VOLUME = {2}, YEAR = {1951}, PAGES = {307--314}, MRCLASS = {20.0X}, MRNUMBER = {12,671e}, MRREVIEWER = {G. Higman}, } @InProceedings{Pinsker73, author = {Mark S. Pinsker}, title = {On the Complexity of a Concentrator}, booktitle = {Proc. of the 7th Annual Teletraffic Conference}, OPTcrossref = {}, OPTkey = {}, pages = {318/1--318/4}, year = {1973}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Stockholm}, OPTmonth = {}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @Article{Pippenger87, title={Sorting and Selecting in Rounds}, author={Nicholas Pippenger}, pages={1032--1038}, journal=sicomp, year=1987, month=dec, volume=16, number=6, source={http://theory.lcs.mit.edu/~dmjones/hbp/sicomp/sicomp.bib}, eprint="sicomp:16/0216066" } @Article{PippengerYa82, author = {Nicholas Pippenger and Andrew C. Yao}, title = {Rearrangeable Networks with Limited Depth}, journal = {{SIAM} Journal on Algebraic and Discrete Methods}, year = {1982}, OPTkey = {}, volume = {3}, number = {4}, pages = {411--417}, OPTmonth = {}, OPTnote = {}, OPTannote = {}, eprint="simax:03/0603041" } @article {ReingoldVaWi02, AUTHOR = {Reingold, Omer and Vadhan, Salil and Wigderson, Avi}, TITLE = {Entropy waves, the zig-zag graph product, and new constant-degree expanders}, JOURNAL = {Ann. of Math. (2)}, FJOURNAL = {Annals of Mathematics. Second Series}, VOLUME = {155}, YEAR = {2002}, NUMBER = {1}, PAGES = {157--187}, ISSN = {0003-486X}, CODEN = {ANMAAH}, MRCLASS = {05C50 (60C05)}, MRNUMBER = {2003c:05145}, MRREVIEWER = {Sandi Klav{\v{z}}ar}, eprint="arxiv:math.CO/0406038" } @incollection {Selberg65, AUTHOR = {Selberg, Atle}, TITLE = {On the estimation of {F}ourier coefficients of modular forms}, BOOKTITLE = {Proc. of the Sympos. Pure Math.}, volume={VIII}, PAGES = {1--15}, PUBLISHER = {Amer. Math. Soc.}, ADDRESS = {Providence, R.I.}, YEAR = {1965}, MRCLASS = {10.20}, MRNUMBER = {32 \#93}, MRREVIEWER = {J. R. Smart}, } @Article{Sipser88, title={Expanders, Randomness, or Time versus Space}, author={Michael Sipser}, pages={379--383}, journal=jcss, year=1988, month=jun, volume=36, number=3, source={http://theory.lcs.mit.edu/~dmjones/hbp/jcss/jcss.bib}, eprint="jcss:10.1016/0022-0000(88)90035-9" } @article{SipserSp96, AUTHOR = {Sipser, Michael and Spielman, Daniel A.}, TITLE = {Expander codes}, JOURNAL = {IEEE Transactions on Information Theory}, VOLUME = 42, YEAR = 1996, NUMBER = {6, part 1}, PAGES = {1710--1722}, ISSN = {0018-9448}, CODEN = {IETTAW}, MRCLASS = {94B05}, MRNUMBER = {98d:94031}, EPRINT = {tit:10.1109/18.556667} } @article {Spielman96, AUTHOR = {Spielman, Daniel A.}, TITLE = {Linear-time encodable and decodable error-correcting codes}, JOURNAL = {IEEE Transactions on Information Theory}, VOLUME = 42, YEAR = 1996, NUMBER = {6, part 1}, PAGES = {1723--1731}, ISSN = {0018-9448}, CODEN = {IETTAW}, MRCLASS = {94B05 (68Q25)}, MRNUMBER= {98g:94034}, EPRINT = {tit:10.1109/18.556668} } @Article{Tanner84, author = {Michael R. Tanner}, title = {Explicit Concentrators from Generalized $N$-gons}, journal = {SIAM Journal on Algebraic Discrete Methods}, year = {1984}, OPTkey = {}, volume = {5}, number = {3}, pages = {287--293}, OPTmonth = {}, OPTnote = {}, OPTannote = {}, eprint="simax:05/0605030" } @article{Urquhart87, AUTHOR = {Urquhart, Alasdair}, TITLE = {Hard examples for resolution}, JOURNAL = {Journal of the Association for Computing Machinery}, VOLUME = {34}, YEAR = {1987}, NUMBER = {1}, PAGES = {209--219}, ISSN = {0004-5411}, CODEN = {JACOAH}, MRCLASS = {68Q25 (03B05 03B35 03D15 68R10 68T15)}, MRNUMBER = {89e:68056}, MRREVR = {Alexander Leitsch}, eprint="jacm:7531.8928" } @InCollection{Valiant77, author = {Valiant, Leslie G.}, title = {Graph-theoretic arguments in low-level complexity}, booktitle = {Proc. of the 6th Symposium on Mathematical Foundations of Computer Science}, OPTcrossref = {}, OPTkey = {}, pages = {162--176}, series = {Lecture Notes in Comput. Sci.}, volume=53, publisher = {Springer}, year = {1977}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTtype = {}, OPTchapter = {}, address = {Berlin}, OPTedition = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } @article {WigdersonZu99, AUTHOR = {Wigderson, Avi and Zuckerman, David}, TITLE = {Expanders that beat the eigenvalue bound: explicit construction and applications}, JOURNAL = {Combinatorica}, FJOURNAL = {Combinatorica. An International Journal on Combinatorics and the Theory of Computing}, VOLUME = {19}, YEAR = {1999}, NUMBER = {1}, PAGES = {125--138}, ISSN = {0209-9683}, MRCLASS = {15-XX}, MRNUMBER= {1 722 214}, EPRINT = {combinatorica:wcjlnyjmdxf30b9x} } @Proceedings{FOCS28, title={28th Annual Symposium on Foundations of Computer Science}, booktitle={Proc. of the 28th Annual Symposium on Foundations of Computer Science}, month={12--14 } # oct, year=1987, address={Los Angeles, California}, organization={IEEE}, crossrefonly=1, source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib} } @Proceedings{FOCS31a, title={31st Annual Symposium on Foundations of Computer Science}, booktitle={Proc. of the 31st Annual Symposium on Foundations of Computer Science}, volume={I}, month={22--24 } # oct, year=1990, address={St. Louis, Missouri}, organization={IEEE}, crossrefonly=1, source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib} } @Proceedings{FOCS45, title={45th Annual Symposium on Foundations of Computer Science}, booktitle={Proc. of the 45th Annual Symposium on Foundations of Computer Science}, month={17-19 } # oct, year=2004, address={Rome, Italy}, organization={IEEE}, crossrefonly=1, } @Proceedings{STOC26, title={Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing}, booktitle={Proc. of the 26th Annual ACM Symposium on the Theory of Computing}, month={23--25 } # may, year=1994, address={Montr{\'e}al, Qu{\'e}bec, Canada}, c-organization={ACM}, key={ACM}, crossrefonly=1, source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib} } @Proceedings{STOC29, title={Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing}, booktitle={Proc. of the 29th Annual ACM Symposium on Theory of Computing}, month={4--6 } # may, year=1997, address={El Paso, Texas}, c-organization={ACM}, key={ACM}, crossrefonly=1, source={http://theory.lcs.mit.edu/~dmjones/STOC/stoc.bib} } %% ToC#237 v002/a006.bib - Ran Raz @inproceedings{A, author = "S. Aaronson", title = "Multilinear Formulas and Skepticism of Quantum Computing" , booktitle = "Proc. 36th {ACM} Symp. on Theory of Computation", year = "2004", pages = "118--127", eprint="stoc:1007352.1007378,arxiv:quant-ph/0311039" } @book{BCS, title = {Algebraic Complexity Theory}, author = "P. B{\"u}rgisser and M. Clausen and M. A. Shokrollahi", publisher = "Springer-Verlag New York, Inc.", year = "1997", } @article{G, title = "Algebraic Complexity Theory", author = "J. von zur Gathen", journal = "Ann. Rev. Computer Science", year = "1988", volume = "3", pages = "317--347", eprint="arcs:10.1146/annurev.cs.03.060188.001533" } @article{H, title = "On the Parallel Evaluation of Multivariate Polynomials", author = "L. Hyafil", journal = "{SIAM} Journal on Computing", year = "1979", volume = "8", number=2, pages = "120--123", eprint="sicomp:08/0208010" } @inproceedings{N, title = "Lower Bounds for Non-Commutative Computation", author = "N. Nisan", booktitle = "Proc. 23rd {ACM} Symp. on Theory of Computing", year = "1991", pages = "410--418", eprint="stoc:103418.103462" } @article{NW, title = "Lower Bounds on Arithmetic Circuits via Partial Derivatives", author = "N. Nisan and A. Wigderson", journal = "Computational Complexity", year = "1996", volume = "6", number=3, pages = "217--234", note = "Preliminary version in FOCS 1995", eprint="cc:v34728p847187762, focs:10.1109/SFCS.1995.492458" } @article{R1, title = "Multi-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size", author = "R. Raz", journal="Journal of the {ACM}", year="to appear", note="Preliminary version in STOC 2004", eprint="stoc:1007352.1007353", } @inproceedings{R2, title = "Multilinear-${NC}_1$ $\neq$ {Multilinear}-${NC}_2$", author = "R. Raz", booktitle = "Proc. 45th Symp. Found. Computer Science", year = "2004", pages = "344--351", eprint="focs:10.1109/FOCS.2004.42", } @article{VSBR, title = "Fast Parallel Computation of Polynomials Using Few Processors", author = "L. G. Valiant and S. Skyum and S. Berkowitz and C. Rackoff", journal = "{SIAM} Journal on Computing", year = "1983", volume = "12", number=4, pages = "641--644", eprint="sicomp:12/0212043" } %% ToC#241 v002/a007.bib Chekuri, Khanna, Shepherd @inproceedings{AndrewsCKZ05, author = {Matthew Andrews and Julia Chuzhoy and Sanjeev Khanna and Lisa Zhang}, title = {Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion}, booktitle = {Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS)}, year = {2005}, pages = {226--244}, eprint="focs:10.1109/SFCS.2005.41" } @article{AzarR06, author = {Yossi Azar and Oded Regev}, title = {Combinatorial Algorithms for the Unsplittable Flow Problem}, journal = {Algorithmica}, volume = {44}, number = {1}, year = {2006}, pages = {49--66}, note = {Preliminary version in {\em Proc.\ of IPCO}, 2001}, eprint="algorithmica:yl21u55g402h8033,ipco:eq2xun7jtdm8udue" } @article{BavejaS00, author = {Alok Baveja and Aravind Srinivasan}, title = {Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems}, journal = {Math. Oper. Res.}, volume = {25}, number = {2}, year = {2000}, pages = {255--280}, pdf="http://www.cs.umd.edu/~srin/PDF/edge-dis.pdf" } @inproceedings{edp_revisited, author = {Chandra Chekuri and Sanjeev Khanna}, title = {Edge disjoint paths revisited}, booktitle = {Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)}, year = {2003}, pages = {628--637}, eprint="soda:644108.644212" } @inproceedings{allnothing, author = {Chandra Chekuri and Sanjeev Khanna and F. Bruce Shepherd}, title = {The all-or-nothing multicommodity flow problem}, booktitle = {Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC)}, year = {2004}, pages = {156--165}, eprint="stoc:1007352.1007383" } @inproceedings{ChekuriMS03, author = {Chandra Chekuri and Marcelo Mydlarz and F. Bruce Shepherd}, title = {Multicommodity Demand Flow in a Tree}, booktitle = {Proceedings of 30th International Colloquium on Automata, Languages and Programming (ICALP)}, year = {2003}, pages = {410--425}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {2719}, eprint="icalp:du648d9x5721adll" } @InCollection{Frank_survey, author = {Andr\'{a}s Frank}, title = {Packing paths, cuts, and circuits - a survey}, booktitle = {Paths, Flows and VLSI-Layout}, pages = {49--100}, publisher = {Springer Verlag}, year = {1990}, editor = {B.~Korte and L.~Lov\'{a}sz and H.~J.~Pr\"{o}mel and A.~Schrijver}, } @article{GargVY97, author = {Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis}, title = {Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees}, journal = {Algorithmica}, volume = {18}, number = {1}, year = {1997}, pages = {3--20}, eprint="algorithmica:x1dykd3030ggac4w" } @article{GuruswamiKRSY03, author = {Venkatesan Guruswami and Sanjeev Khanna and Rajmohan Rajaraman and F. Bruce Shepherd and Mihalis Yannakakis}, title = {Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems}, journal = {J. Comput. Syst. Sci.}, volume = {67}, number = {3}, year = {2003}, pages = {473--496}, note = {Preliminary version in {\em Proc.\ of ACM STOC}, 1999}, eprint="jcss:10.1016/S0022-0000(03)00066-7,stoc:301250.301262" } @PhdThesis{Kleinberg-thesis, author = {Jon Kleinberg}, title = {Approximation algorithms for disjoint paths problems}, school = {MIT}, year = {1996}, address = {Cambridge, MA}, month = {May}, } @InCollection{Kolliopoulos_survey, author = {Stavros Kolliopoulos}, title = {Edge Disjoint Paths and Unsplittable Flow}, booktitle = {Handbook on Approximation Algorithms and Metaheuristics}, publisher = {Chapman and Hall}, editor = {Teofilo F. Gonzalez}, series = {CRC Computer and Information Science}, year = {2006}, note = {To appear.}, } @article{KolliopoulosS04, author = {Stavros G. Kolliopoulos and Clifford Stein}, title = {Approximating disjoint-path problems using packing integer programs}, journal = {Math. Program.}, volume = {99}, number = {1}, year = {2004}, pages = {63--87}, note = {Preliminary version in {\em Proc.\ of IPCO, 1998}}, eprint="mathprog:lh5yrd3peyp3kb3h,ipco:upy56mcmrvfqdm84" } @article{Kolman03, author = {Petr Kolman}, title = {A note on the greedy algorithm for the unsplittable flow problem}, journal = {Inf. Process. Lett.}, volume = {88}, number = {3}, year = {2003}, pages = {101--105}, eprint="ipl:10.1016/S0020-0190(03)00351-X" } @inproceedings{KolmanS02, author = {Petr Kolman and Christian Scheideler}, title = {Improved bounds for the unsplittable flow problem}, booktitle = {Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA)}, year = {2002}, pages = {184--193}, eprint="soda:545381.545404" } @article{MaW00, author = {Bin Ma and Lusheng Wang}, title = {On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints}, journal = {J. Comput. Syst. Sci.}, volume = {60}, number = {1}, year = {2000}, pages = {1--12}, eprint="jcss:10.1006/jcss.1999.1661" } @Unpublished{Nguyen05, author = {Thanh Nguyen}, title = {On Disjoint Paths}, note = {Personal communication}, month = {August}, year = {2005}, } @Book{Schrijver_book, author = {Alexander Schrijver}, title = {Combinatorial Optimization: Polyhedra and Efficiency}, publisher = {Springer-Verlag}, address = {Berlin Hiedelberg}, year = {2003}, } @inproceedings{KasturiV04, author = {Kasturi R. Varadarajan and Ganesh Venkataraman}, title = {Graph decomposition and a greedy algorithm for edge-disjoint paths}, booktitle = {Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA)}, year = {2004}, pages = {379--380}, eprint="soda:982792.982846" } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% v002/a008.bib Jackson - Servedio 9/18/2006 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @article{AizensteinPitt:95, author={H. Aizenstein and L. Pitt}, title={On the Learnability of Disjunctive Normal Form Formulas}, journal={Machine Learning}, year={1995}, volume={19}, pages={183--208}, eprint={ml:n226835168336578} } @Book{AlonSpencer, author={Noga Alon and Joel H. Spencer}, title={The Probabilistic Method}, publisher={John Wiley and Sons}, year = {2000} } @article{Angluin:88, author={D. Angluin}, title={Queries and concept learning}, journal={Machine Learning}, year={1988}, volume={2}, number=4, pages={319--342}, eprint="ml:u228266621966h58" } @ARTICLE{angkha95, author = {Dana Angluin and Michael Kharitonov}, title = {When Won't Membership Queries Help?}, journal = {Journal of Computer and System Sciences}, year = {1995}, volume = {50}, pages = {336--355}, number = {2}, printoutnum = {132}, eprint={jcss:10.1006/jcss.1995.1026} } @inproceedings{Blum:03problem, author={A. Blum}, title={Learning a function of $r$ relevant variables (open problem)}, booktitle={Proc. 16th Ann. Conf. on Computational Learning Theory (COLT'03)}, series={Lecture Notes in Computer Science}, volume={2777}, publisher={Springer}, year={2003}, pages={731--733}, eprint="colt:fxdg79cvndr6n05r" } @unpublished{Blum:03tutorial, author={A. Blum}, title={Machine learning: a tour through some favorite results, directions, and open problems}, note={FOCS 2003 tutorial slides, available at http://www-2.cs.cmu.edu/~avrim/Talks/FOCS03/tutorial.ppt}, year={2003} } @InProceedings{BBL:98, author = {A. Blum and C. Burch and J. Langford}, title = {On Learning Monotone Boolean Functions}, booktitle={Proc. 39th FOCS}, publisher = {IEEE Computer Society Press}, pages = {408--415}, year = {1998}, eprint="focs:10.1109/SFCS.1998.743491" } @inproceedings{BFJ+:94, author={A. Blum and M. Furst and J. Jackson and M. Kearns and Y. Mansour and S. Rudich}, title={Weakly learning {DNF} and characterizing statistical query learning using {F}ourier analysis}, booktitle={Proc. 26th STOC}, location={Montreal, Quebec, Canada}, publisher={ACM Press}, pages={253--262}, year={1994}, eprint="stoc:195058.195147" } @book{Bollobas:86, author={B. Bollob{\'a}s}, title={Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability}, publisher={Cambridge University Press}, year={1986} } @article{GHM:94, author={M. Golea and M. Marchand and T. Hancock}, title={On Learning $\mu$-perceptron networks on the uniform distribution}, journal={Neural Networks}, year={1994}, volume={9}, number=1, pages={67--82}, eprint="NeuralNet:10.1016/0893-6080(95)00009-7" } @inproceedings{Hancock:93, author={T. Hancock}, title={{Learning $k\mu$ decision trees on the uniform distribution}}, booktitle={Proc. 6th Ann. Conf. on Computational Learning Theory (COLT'93)}, location={Santa Cruz, California}, publisher={ACM Press}, pages={352--360}, year={1993}, eprint="ACM:168304.168374" } @article{Jackson:97, author={J. Jackson}, title={An efficient membership-query algorithm for learning {DNF} with respect to the uniform distribution}, journal={Journal of Computer and System Sciences}, year={1997}, volume={55}, number=3, pages={414--440}, eprint="jcss:10.1006/jcss.1997.1533" } @inproceedings{JKS:02, author={J. Jackson and A. Klivans and R. Servedio}, title={Learnability beyond ${AC}^0$}, booktitle={Proc. 34th STOC}, location={Montreal, Quebec, Canada}, publisher={ACM Press}, pages={776--784}, year={2002}, eprint="stoc:509907.510018" } @inproceedings{JacksonServedio:03, author={J. Jackson and R. Servedio}, title={Learning Random Log-Depth Decision Trees under the Uniform Distribution}, booktitle={Proc. 16th Ann. Conf. on Computational Learning Theory (COLT'03) and 7th Kernel Workshop}, location={Washington, DC}, series={Lecture Notes in Computer Science}, volume={2777}, publisher={Springer}, pages={610--624}, year={2003}, doi = {10.1007/b12006}, eprint="colt:31wxjv7lb9l5" } @inproceedings{JacksonServedio:05random, author={J. Jackson and R. Servedio}, title={On Learning Random {DNF} Formulas under the Uniform Distribution}, booktitle={Proc. 9th Internat. Workshop on Randomization and Computation (RANDOM'05)}, series={Lecture Notes in Computer Science}, volume={3624}, publisher={Springer}, pages={342--353}, year={2005}, eprint="random:2y5933y326xhbgar" } @unpublished{JacksonTamon:97, author={J. Jackson and C. Tamon}, title={Fourier {A}nalysis in {M}achine {L}earning}, note={ICML/COLT 1997 tutorial slides, available at http://learningtheory.org/resources.html}, year={1997} } @article{Kearns:98, author={M. Kearns}, title={Efficient noise-tolerant learning from statistical queries}, journal={Journal of the ACM}, year={1998}, volume={45}, number={6}, pages={983--1006}, eprint="jacm:293347.293351" } @inproceedings{KLP+:87a, author={M. Kearns and M. Li and L. Pitt and L. Valiant}, title={Recent results on {B}oolean concept learning}, booktitle={Proc. 4th Internat. Workshop on Machine Learning}, publisher={Morgan Kaufmann}, pages={337--352}, year={1987}, ps="http://www.cis.upenn.edu/~mkearns/papers/klpv-ml.ps", pdf="http://www.cis.upenn.edu/~mkearns/papers/klpv-ml.pdf" } @inproceedings{KLP+:87b, author={M. Kearns and M. Li and L. Pitt and L. Valiant}, title={On the learnability of {B}oolean formulae}, booktitle={Proc. 19th STOC}, publisher={ACM Press}, pages={285--295}, year={1987}, eprint="stoc:28395.28426" } @book{KearnsVazirani:94, author={M. Kearns and U. Vazirani}, title={An introduction to computational learning theory}, publisher={MIT Press}, year={1994}, address={Cambridge, MA} } @inproceedings{KOS:02, author={A. Klivans and R. O'Donnell and R. Servedio}, title={Learning intersections and thresholds of halfspaces}, booktitle={Proc. 43rd FOCS}, location={Vancouver, B. C.}, publisher={IEEE Computer Society Press}, pages={177--186}, year={2002}, eprint="focs:10.1109/SFCS.2002.1181894" } @article{KMP:94, author={L. Ku{\v c}era and A. Marchetti-Spaccamela and M. Protassi}, title={On learning monotone {DNF} formulae under uniform distributions}, journal={Information and Computation}, year={1994}, volume={110}, pages={84--95}, eprint="IandC:10.1006/inco.1994.1024" } @inbook{Mansour:94, author={Y. Mansour}, title={Learning {B}oolean functions via the {F}ourier transform}, booktitle={Theoretical Advances in Neural Computation and Learning}, publisher={Kluwer Academic Publishers}, pages={391--424}, year={1994}, ps="http://www.math.tau.ac.il/~mansour/papers/fourier-survey.ps.gz" } @inproceedings{McDiarmid:89, author={C. McDiarmid}, title={On the method of bounded differences}, booktitle={Surveys in Combinatorics 1989}, pages={148--188}, publisher={London Mathematical Society Lecture Notes}, year={1989} } @inproceedings{Servedio:01mdnf, author={R. Servedio}, title="On learning monotone {DNF} under product distributions", booktitle={Proc. 14th Ann. Conf. on Computational Learning Theory (COLT'01)}, location={Amsterdam}, series="Lecture Notes in Computer Science", volume={2111}, publisher={Springer}, pages={558--573}, year={2001}, eprint="colt:3j42gw4570jb08yt" } @article{Valiant:84, author={L. Valiant}, title={A theory of the learnable}, journal={Communications of the ACM}, year={1984}, volume={27}, number={11}, pages={1134--1142}, eprint="cacm:1968.1972" } @inproceedings{Verbeurgt:90, author={K. Verbeurgt}, title={Learning {DNF} under the uniform distribution in quasi-polynomial time}, booktitle={Proc. 3rd Ann. Workshop on Computational Learning Theory (COLT '90)}, publisher={Morgan Kaufmann}, pages={314--326}, year={1990}, eprint="ACM:92571.92657" } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% ToC#249, v002/a009.bib Fischer - Fortnow @article{aet, author = "N. Alon and E. Fischer and M. Krivelevich and M. Szegedy", title = "Efficient testing of large graphs", journal = "Combinatorica", volume = 20, year = 2000, pages = "451--476", eprint="combinatorica:mwapje2fdyk7ma2e"} @article{aer, author = "N. Alon and M. Krivelevich and I. Newman and M. Szegedy", title = "Regular languages are testable with a constant number of queries", journal = "SIAM Journal on Computing", volume = 30, year = "2001", pages = "1842--1862", eprint="sicomp:10.1137/S0097539700366528"} @article{brw, author = "T. Batu and R. Rubinfeld and P. White", title = "Fast approximation {PCP}s for multidimensional bin-packing problems", journal = "Information and Computation", volume = 196, year = "2005", pages = "42--56", eprint="iandc:10.1016/j.ic.2004.10.001"} @article{bgs, author = "M. Bellare and O. Goldreich and M. Sudan", title = "Free bits, {PCP}s, and nonapproximability -- towards tight results", journal = "SIAM Journal on Computing", volume = 27, year = "1998", pages = "804--915", eprint="sicomp:10.1137/S0097539700366528"} @incollection{bep, author = "E. Ben-Sasson and O. Goldreich and P. Harsha and M. Sudan and S. Vadhan", title = "Robust {PCP}s of Proximity, shorter {PCP}s and applications to coding", booktitle = "Proc. $36^{th}$ STOC", year = "2004", pages = "1--10", publisher = "{ACM Press}", eprint="stoc:1007352.1007361"} @article{bhr, author = "E. Ben-Sasson and P. Harsha and S. Raskhodnikova", title = "Some 3{CNF} properties are hard to test", journal = "SIAM Journal on Computing", volume = 35, year = "2005", pages = "1--21", eprint="sicomp:10.1137/S0097539704445445"} @article{blr, author = "M. Blum and M. Luby and R. Rubinfeld", title = "Self-testing/cor\-recting with applications to numerical problems", journal = "Journal of Computer and System Sciences", volume = 47, year = "1993", pages = "549--595", eprint="jcss:10.1016/0022-0000(93)90044-W"} @incollection{beq, author = "H. Buhrman and L. Fortnow and I. Newman and H. Rohrig", title = "Quantum property testing", booktitle = "Proc. $14^{th}$ ACM-SIAM Symp. on Discrete Algorithms (SODA'03)", year = "2003", pages = "480--488", publisher = "{SIAM}", eprint="soda:644108.644188"} @article{ees, author = "F. Ergun and S. Kannan and R. Kumar and R. Rubinfeld and M. Viswanathan", title = "Spot checkers", journal = "Journal of Computer and System Sciences", volume = 60, year = "2000", pages = "717--751", eprint="jcss:10.1006/jcss.1999.1692"} @article{ekr, author = "F. Ergun and R. Kumar and R. Rubinfeld", title = "Fast approximate probabilistically checkable proofs", journal = "Information and Computation", volume = 189, year = "2004", pages = "135--159", eprint="iandc:10.1016/j.ic.2003.09.005"} @article{fts, author = "E. Fischer", title = "The art of uninformed decisions: A primer to property testing", journal = "Bulletin of the European Association for Theoretical Computer Science", volume = 75, year = "2001", pages = "97--126"} @article{fej, author = "E. Fischer and G. Kindler and D. Ron and S. Safra and A. Samorodnitsky", title = "Testing juntas", journal = "Journal of Computer and System Sciences", volume = 68, year = "2004", pages = "753--787", eprint="jcss:10.1016/j.jcss.2003.11.004"} @incollection{fne, author = "E. Fischer and I. Newman", title = "Testing versus estimation of graph properties", booktitle = "Proc. $37^{th}$ STOC", year = "2005", pages = "138--146", publisher = "{ACM Press}", eprint="stoc:1060590.1060612"} @article{fns, author = "E. Fischer and I. Newman and J. Sgall", title = "Functions that have read-twice constant width branching programs are not necessarily testable", journal = "Random Structures and Algorithms", volume = 24, year = "2004", pages = "175--193", eprint="rsa:10.1002/rsa.10110"} @article{ggr, author = "O. Goldreich and S. Goldwasser and D. Ron", title = "Property testing and its connection to learning and approximation", journal = "Journal of the ACM", volume = 45, year = "1998", pages = "653--750", eprint="jacm:285055.285060"} @article{gtt, author = "O. Goldreich and L. Trevisan", title = "Three theorems regarding testing graph properties", journal = "Random Structures and Algorithms", volume = 23, year = "2003", pages = "23--57", eprint="rsa:10.1002/rsa.10078"} @article{hoi, author = "J. H{\aa}stad", title = "Some optimal inapproximability results", journal = "Journal of the ACM", volume = 48, year = "2001", pages = "798--859", eprint="jacm:502090.502098"} @incollection{prr, author = "M. Parnas and D. Ron and R. Rubinfeld", title = "Tolerant property testing and distance approximation", booktitle = "ECCC", number = "TR04-010", year = 2004, organization = "{ECCC}", eprint="eccc:TR04-010"} @article{prs, author = "M. Parnas and D. Ron and A. Samorodnitsky", title = "Testing basic {Boolean} formulae", journal = "SIAM Journal on Discrete Mathematics", volume = 16, year = "2002", pages = "20--46", eprint="sidma:10.1137/S0895480101407444 "} @incollection{rtt, author = "D. Ron", title = "Property testing", booktitle = "Handbook of Randomized Computing", editor = "S. Rajasekaran and P. M. Pardalos and J. H. Reif and J. D. P. Rolim", year = 2001, volume = "II", pages = "597--649", publisher = "Kluwer", pdf="http://www.eng.tau.ac.il/~danar/Public-pdf/tut.pdf"} @article{rsc, author = "R. Rubinfeld and M. Sudan", title = "Robust characterization of polynomials with applications to program testing", journal = "SIAM Journal on Computing", volume = 25, year = "1996", pages = "252--271", eprint="sicomp:10.1137/S0097539793255151"} @string{sict20 = "Proc. 20th IEEE Conf. on Computational Complexity"} @incollection{conf, author = "E. Fischer and L. Fortnow", title = "Tolerant Versus Intolerant Testing for {Boolean} Properties", booktitle = sict20, pages = "135--140", year = 2005, publisher = "{IEEE Computer Society Press}", eprint="ccc:10.1109/CCC.2005.30"} f%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% ToC#234 v002/a010.bib Klivans - Shpilka %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @Article{A87, author = "D. Angluin", title = "Queries and Concept Learning", journal = "Machine Learning", volume = "2", year = "1988", pages = "319--342", eprint="ml:l147k68714mhg8m5" } @Article{ALMSS98, title = "Proof Verification and the Hardness of Approximation Problems", author = "S. Arora and C. Lund and R. Motwani and M. Sudan and M. Szegedy", area = "Formal Languages and Complexity Theory", journal = "Journal of the ACM", pages = "501--555", year = "1998", volume = "45", number = "3", eprint="jacm:278298.278306" } @InProceedings{ABFR91, author = "J. Aspnes and R. Beigel and M. Furst and S. Rudich", title = "The Expressive Power of Voting Polynomials", location = "New Orleans, LA", pages = "402--409", booktitle = "Proc. 23rd STOC", publisher = "ACM Press", year = "1991", eprint="stoc:103418.103461" } @Article{BBB00, author = "A. Beimel and F. Bergadano and N. H. Bshouty and E. Kushilevitz and S. Varricchio", title = "Learning functions represented as multiplicity automata", journal = "Journal of the ACM", volume = "47", number = "3", year = "2000", pages = "506--530", eprint="jacm:337244.337257" } @InProceedings{BBTV97, author = "F. Bergadano and N. H. Bshouty and C. Tamon and S. Varricchio", title = "On learning branching programs and small depth circuits", pages = "150--161", booktitle = "Proc. of the 3rd European Conf. on Computational Learning Theory (EuroCOLT'97)", series = "LNCS", volume = "1208", year = "1997", eprint="lncs:73001q2141150g25" } @Article{BB98, title = "On Interpolating Arithmetic Read-Once Formulas with Exponentiation", author = "D. Bshouty and N. H. Bshouty", pages = "112--124", journal = "Journal of Computer and System Sciences", year = "1998", volume = "56", number = "1", eprint="jcss:10.1006/jcss.1997.1550" } @Article{BM02, author = "N. H. Bshouty and Y. Mansour", title = "Simple Learning Algorithms for Decision Trees and Multivariate Polynomials", journal = "SIAM Journal on Computing", pages = "1909--1925", volume = "31", number = "6", year = "2002", eprint="sicomp:10.1137/S009753979732058X" } @Article{BTW96, title = "On learning width two branchinng programs", author = "N. H. Bshouty and C. Tamon and D. K. Wilson", pages = "217--222", journal = "Information Processing Letters", year = "1998", volume = "65", number = "4", eprint="ipl:10.1016/S0020-0190(97)00204-4" } @Article{CP71, title = "Realizations by Stochastic Finite Automata", author = "J. W. Carlyle and A. Paz", pages = "26--40", journal = "Journal of Computer and System Sciences", year = "1971", volume = "5", number = "1", } @Article{F74, author = "M. Fliess", journal = "Journal de Math{\'e}matiques Pures et Appliqu{\'e}es", pages = "197--224", title = "Matrices de {H}ankel", volume = "53", year = "1974", } @Article{GKS94, title = "Computational Complexity of Sparse Rational Interpolation", author = "D. Grigoriev and M. Karpinski and M. F. Singer", pages = "1--11", journal = "SIAM Journal on Computing", year = "1994", volume = "23", number = "1", eprint="sicomp:10.1137/S0097539791194069" } @inproceedings{GK98, author = {D. Grigoriev and M. Karpinski}, title = {An Exponential Lower Bound for Depth 3 Arithmetic Circuits.}, booktitle = {Proc. 30th STOC}, year = {1998}, location = {Dallas,TX}, publisher={ACM Press}, pages = {577--582}, eprint="stoc:276698.276872" } @InProceedings{GR98, author = "D. Grigoriev and A. A. Razborov", title = "Exponential complexity lower bounds for depth $3$ arithmetic circuits in algebras of functions over finite fields", booktitle = "Proc. 39th FOCS", year = "1998", pages = "269--278", publisher = {IEEE Computer Society Press}, location= {Palo Alto, CA}, eprint="focs:10.1109/SFCS.1998.743456" } @InProceedings{H86, title = "Almost Optimal Lower Bounds for Small Depth Circuits", author = "J. H{\aa}stad", pages = "6--20", booktitle = "Proc. 18th STOC", year = "1986", publisher = "ACM Press", location = "Baltimore, MD", eprint="stoc:12130.12132" } @Article{HR99, author = "M. A. Huang and A. J. Rao", title = "Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications", journal = "Journal of Algorithms", volume = "33", number = "2", pages = "204--228", year = "1999", eprint="jalg:10.1006/jagm.1999.1045" } @InProceedings{JKS02, author = "J. C. Jackson and A. R. Klivans and R. A. Servedio", title = "Learnability Beyond {$\mbox{AC}^{0}$}", pages = "776--784", booktitle = "Proc. 34th STOC", year = "2002", publisher = "ACM Press", location = "Montreal, Canada", eprint="stoc:509907.510018" } @Article{KT90, author = "E. Kaltofen and B. M. Trager", title = "Computing with Polynomials Given by Black Boxes for Their Evaluations: {Greatest} Common Divisors, Factorization, Separation of Numerators and Denominators", journal = "Journal of Symbolic Computation", volume = "9", number = "3", pages = "300--320", year = "1990", } @InProceedings{KS01, author = "A. R. Klivans and D. Spielman", title = "Randomness efficient identity testing of multivariate polynomials", booktitle = "Proc. 33rd STOC", year = "2001", pages = "216--223", location = "Crete, Greece", publisher = "ACM Press", eprint="stoc:380752.380801" } @Article{LMN93, title = "Constant Depth Circuits, {Fourier} Transform and Learnability", author = "N. Linial and Y. Mansour and N. Nisan", pages = "607--620", journal = "Journal of the ACM", year = "1993", volume = "40", number = "3", eprint="jacm:174130.174138" } @InProceedings{Nis91, title = "Lower Bounds for Non-Commutative Computation", author = "N. Nisan", pages = "410--418", booktitle = "Proc. 23rd STOC", year = "1991", location = "New Orleans, LA", eprint="stoc:103418.103462" } @Article{NW97, author = "N. Nisan and A. Wigderson", title = "Lower Bounds on Arithmetic Circuits via Partial Derivatives", journal = "Computational Complexity", volume = "6", number = "3", pages = "217--234", year = "1997", eprint="cc:v34728p847187762" } @Article{OSK94, author = "H. Ohnishi and H. Seki and T. Kasami", title = "A Polynomial Time Learning Algorithm for Recognizable Series", journal = "IEICE Transactions on Information and Systems", volume = "E77-D", number = "10", pages = "1077--1085", year = "1994", } @article{Raz04b, author = {R. Raz}, title = {Separation of Multilinear Circuit and Formula Size}, journal = {Theory of Computing}, year = {2006}, volume = {2}, number = {6}, pages = {121--135}, publisher = {Theory of Computing}, eprint = {toc:v002/a006}, URL = {http://www.theoryofcomputing.org/articles/main/v002/a006}, note={Preliminary version appeared in FOCS'04, pp. 344--351}, } @INPROCEEDINGS{Raz04a, AUTHOR = "R. Raz", TITLE = "Multi-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size", BOOKTITLE = "Proc. 36th STOC", YEAR = "2004", pages = "633--641", publisher = "ACM Press", location = "Chicago, IL", eprint="stoc:1007352.1007353" } @ARTICLE{RazShpilka, AUTHOR = "R. Raz and A. Shpilka", TITLE = "Deterministic Polynomial Identity Testing in Non-Commutative Models", JOURNAL = "Computational Complexity", YEAR = "2005", volume = "14", number = "1", pages = "1--19", eprint="cc:p24h4777l51112j8" } @Article{Schwar80, author = "J. T. Schwartz", title = "Fast probabilistic algorithms for verification of polynomial identities", journal = "Journal of the ACM", volume = "27", year = "1980", pages = "701--717", number = "4", eprint="jacm:322217.322225" } @Article{SS96, title = "Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples", author = "R. E. Schapire and L. M. Sellie", pages = "201--213", journal = "Journal of Computer and System Sciences", year = "1996", volume = "52", number = "2", eprint="jcss:10.1006/jcss.1996.0017" } @Article{STV01, author = "M. Sudan and L. Trevisan and S. P. Vadhan", title = "Pseudorandom Generators without the {XOR} Lemma", journal = "Journal of Computer and System Sciences", volume = "62", number = "2", pages = "236--266", year = "2001", eprint="jcss:10.1006/jcss.2000.1730" } @Article{SW01, author = "A. Shpilka and A. Wigderson", title = "Depth-3 Arithmetic Circuits over Fields of Characteristic Zero", journal = "Computational Complexity", volume = "10", number = "1", pages = "1--27", year = "2001", eprint="cc:p8hryxqwkmfr9cm0" } @inproceedings{Zippel79, author = {R. Zippel}, title = {Probabilistic algorithms for sparse polynomials}, booktitle={Proc. Intern. Symp. on Symbolic and Algebraic Manipulation}, year = {1979}, volume ={72}, series={Lecture Notes in Computer Science}, publisher={Springer}, pages = {216--226}, eprint="lncs:y1157233175643jq" } @article{BshoutyHH95a, author = {N. H. Bshouty and T. R. Hancock and L. Hellerstein}, title = {Learning Boolean Read-Once Formulas over Generalized Bases}, journal = {Journal of Computer and System Sciences}, volume = {50}, number = {3}, year = {1995}, pages = {521--542}, eprint="jcss:10.1006/jcss.1995.1042" } @article{BshoutyHH95b, author = {N. H. Bshouty and T. R. Hancock and L. Hellerstein}, title = {Learning Arithmetic Read-Once Formulas.}, journal = {SIAM Journal on Computing}, volume = {24}, number = {4}, year = {1995}, pages = {706--735}, eprint="sicomp:10.1137/S009753979223664X" } @inproceedings{HancockH91, author = {T. R. Hancock and L. Hellerstein}, title = {Learning Read-Once Formulas over Fields and Extended Bases.}, booktitle = {Proc. of the 4th Ann. Conf. on Computational Learning Theory (COLT '91)}, year = {1991}, publisher = {Morgan Kaufmann}, location = {Santa Cruz, CA}, pages = {326--336}, eprint="acm:114836.114867" } @inproceedings{KlivansS03, author = {A. Klivans and A. Shpilka}, title = {Learning Arithmetic Circuits via Partial Derivatives.}, booktitle = {Proc. of the 16th Ann. Conf. on Learning Theory (COLT '03)}, year = {2003}, location = {Washington, D.C.}, pages = {463--476}, eprint="colt:48b02anqvmv32a6j" } @article{BergadanoV96, author = {F. Bergadano and S. Varricchio}, title = {Learning Behaviors of Automata from Multiplicity and Equivalence Queries.}, journal = {SIAM Journal on Computing}, volume = {25}, number = {6}, year = {1996}, pages = {1268--1280}, eprint="sicomp:10.1137/S009753979326091X" } @article{BBV96, author = {F. Bergadano and N. H. Bshouty and S. Varricchio}, title = {Learning Multivariate Polynomials from Substitution and Equivalence Queries}, journal = {Electronic Colloquium on Computational Complexity}, volume = {3}, number = {8}, year = {1996}, eprint="eccc:TR96-008" } @BOOK{vanLintWilson, author = {J. H. van Lint and R. M. Wilson}, title = {A Course in Combinatorics}, publisher = {Cambridge University Press}, year = {2001}, } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% ToC#238 v002/a011.bib Charikar - Krauthgamer %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @inproceedings {BEKMRRS, author = {T. Batu and F. Erg\"{u}n and J. Kilian and A. Magen and S. Raskhodnikova and R. Rubinfeld and R. Sami}, title = {A sublinear algorithm for weakly approximating edit distance}, booktitle = {Proc. 35th STOC}, publisher = {ACM Press}, pages = {316--324}, year = {2003}, eprint="stoc:10.1145/780542.780590" } @article {Bourgain85, AUTHOR = {Bourgain, J.}, TITLE = {On {L}ipschitz embedding of finite metric spaces in {H}ilbert space}, JOURNAL = {Israel J. Math.}, VOLUME = {52}, YEAR = {1985}, NUMBER = {1-2}, PAGES = {46--52}, } @inproceedings{BJKK04, AUTHOR = {Z. Bar-Yossef and T. S. Jayram and R. Krauthgamer and R. Kumar}, TITLE = {Approximating edit distance efficiently}, BOOKTITLE = {Proc. 45th FOCS}, PAGES = {550--559}, PUBLISHER = {IEEE Computer Society Press}, YEAR = {2004}, eprint="focs:10.1109/FOCS.2004.14" } @inproceedings {CM02, author = {G. Cormode and S. Muthukrishnan}, title = {The string edit distance matching problem with moves}, booktitle = {Proc. 13th Ann. ACM--SIAM Symp. on Discrete Algorithms (SODA'02)}, pages = {667--676}, year = {2002}, eprint="soda:545381.545470" } @phdthesis{Cormode:Thesis, author={G. Cormode}, title={Sequence Distance Embeddings}, school={University of Warwick}, year={2003}, pdf="http://dimacs.rutgers.edu/~graham/pubs/cormode-seqdistembed.pdf" } @inproceedings{CMS01, author={G. Cormode and S. Muthukrishnan and S. C. Sahinalp}, title={Permutation Editing and Matching via Embeddings}, booktitle = {Proc. 28th Internat. Coll. on Automata, Languages, and Programming (ICALP'01)}, pages={481--492}, year={2001}, series={Lecture Notes in Computer Science}, volume={2076}, publisher={Springer}, eprint="icalp:hf0vwuh0rcyujug1" } @inproceedings {CPSV00, author = {G. Cormode and M. Paterson and S. C. Sahinalp and U. Vishkin}, title = {Communication complexity of document exchange}, booktitle = {Proc. 11th Annual ACM--SIAM Symp. on Discrete Algorithms (SODA'00)}, pages = {197--206}, year = {2000}, eprint="soda:338219.338252" } @incollection{FIMNSW, author = "J. Feigenbaum and Y. Ishai and T. Malkin and K. Nissim and M. J. Strauss and R. N. Wright", title = "Secure Multiparty Computation of Approximations", booktitle = "Proceedings of 28th International Colloquium on Automata, Languages, and Programming", series = "Lecture Notes in Computer Science", volume = "2076", pages = "927--938", year = "2001", publisher={Springer}, eprint="icalp:cpq5t97vrymq7q3n" } @inproceedings {IM98, AUTHOR = {Indyk, P. and Motwani, R.}, TITLE = {Approximate nearest neighbors: towards removing the curse of dimensionality}, BOOKTITLE = {30th STOC}, PAGES = {604--613}, YEAR = {1998}, publisher = {ACM Press}, eprint="stoc:10.1145/276698.276876" } @inproceedings{Indyk98, author={P. Indyk}, title={On Approximate Nearest Neighbors in Non-Euclidean Spaces}, booktitle={Proc. 39th FOCS}, pages={148--155}, year={1998}, publisher={IEEE Computer Society Press}, eprint="focs:10.1109/SFCS.1998.743438" } @inproceedings{Indyk00, author={P. Indyk}, title={Dimensionality reduction techniques for proximity problems}, booktitle={Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'00)}, pages={371--378}, year={2000}, publisher={SIAM}, eprint="soda:338219.338582" } @inproceedings {Indyk04, author = {P. Indyk}, title = {Approximate nearest neighbor under edit distance via product metrics}, booktitle = {Proc. 15th Ann. ACM--SIAM Symp. on Discrete Algorithms}, pages = {646--650}, year = {2004}, publisher={SIAM}, eprint="soda:982792.982889" } @article{KN05, author={S. Khot and A. Naor}, title={Nonembeddability theorems via {F}ourier analysis}, journal={Mathematische Annalen}, volume=334, number=4, year=2006, pages={821--852}, unused_doi={10.1007/s00208-005-0745-0}, unused_url={http://dx.doi.org/10.1007/s00208-005-0745-0}, eprint="springer:n4671147n1684344" } @inproceedings{KN05b, author = {S. Khot and A. Naor}, title = {Nonembeddability theorems via {F}ourier {A}nalysis}, booktitle = {Proceedings of the 46th IEEE Symposium on Foundations of Computer Science}, year = {2005}, pages = {101--112}, eprint="focs:10.1109/SFCS.2005.54" } @ARTICLE{KOR00, AUTHOR = "E. Kushilevitz and R. Ostrovsky and Y. Rabani", TITLE = "Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces", JOURNAL = "SIAM Journal on Computing", YEAR = 2000, VOLUME = 30, NUMBER = 2, PAGES = "457--474", eprint="sicomp:30/34717" } @inproceedings{KR06, author={R. Krauthgamer and Y. Rabani}, title={Improved lower bounds for embeddings into {$L_1$}}, booktitle = {Proc. 16th Ann. ACM--SIAM Symp. on Discrete Algorithms}, year=2006, pages={1010--1017}, publisher={SIAM}, eprint="soda:1109557.1109669" } @inproceedings{MS00, author = {S. Muthukrishnan and S. C. Sahinalp}, title = {Approximate nearest neighbors and sequence comparisons with block operations}, booktitle = {Proc. 32nd STOC}, pages = {416--424}, year = {2000}, publisher = {ACM Press}, eprint="stoc:10.1145/335305.335353" } @inproceedings {OR05, author = {R. Ostrovsky and R. Rabani}, title = {Low Distortion Embeddings for Edit Distance}, booktitle = {Proc. 37th STOC}, pages={218--224}, year = {2005}, publisher = {ACM Press}, eprint="stoc:1060590.1060623" } @inproceedings {Yao79, author = {A. C-C. Yao}, title = {Some complexity questions related to distributive computing}, pages = {209--213}, booktitle = {Proc. 11th STOC}, year = {1979}, publisher = {ACM Press}, eprint="stoc:10.1145/800135.804414" } @article {AD99, AUTHOR = {Aldous, D. and Diaconis, P.}, TITLE = {Longest increasing subsequences: from patience sorting to the {B}aik-{D}eift-{J}ohansson theorem}, JOURNAL = {Bull. Amer. Math. Soc. (N.S.)}, FJOURNAL = {American Mathematical Society. Bulletin. New Series}, VOLUME = {36}, YEAR = {1999}, NUMBER = {4}, PAGES = {413--432}, ISSN = {0273-0979}, eprint = "bullams:bull/1999-36-04/S0273-0979-99-00796-X" } @article {Enflo69, AUTHOR = {Enflo, P.}, TITLE = {On the nonexistence of uniform homeomorphisms between ${L}\sb{p}$-spaces}, JOURNAL = {Ark. Mat.}, VOLUME = {8}, YEAR = {1969}, PAGES = {103--105}, } @inproceedings{GIM99, author = {A. Gionis and P. Indyk and R. Motwani}, title = {Similarity Search in High Dimensions via Hashing}, booktitle = {Proc. 25th Internat. Conf. on Very Large Data Bases}, year = 1999, publisher = {Morgan Kaufmann Publishers Inc.}, pages = {518--529}, eprint="vldb:645925.671516", } %% ToC#231 v002/a012.bib A. Deshpande, L. Rademacher, S. Vempala, G. Wang @techreport{RVW, author = {L. Rademacher and S. Vempala and G. Wang}, title = {Matrix Approximation and Projective Clustering}, institution = {MIT CSAIL}, type="Technical Report", number="2005--018", year = {2005}} @inproceedings{DRVW, author = {A. Deshpande and L. Rademacher and S. Vempala and G. Wang}, title = {Matrix Approximation and Projective Clustering via Volume Sampling}, booktitle = {Proc. 17th ACM-SIAM Symp. on Discrete Algorithms (SODA'06)}, publisher = {SIAM}, year = 2006, pages = {1117--1126}, eprint="soda:1109557.1109681"} @inproceedings{DV, author = {A. Deshpande and S. Vempala}, title = {Adaptive Sampling and Fast Low-Rank Matrix Approximation}, booktitle = {Proc. 10th Internat. Workshop on Randomization and Computation (RANDOM'06)}, publisher = {Springer}, year = 2006, pages = {292--303}, pdf="http://web.mit.edu/amitd/www/academics/random06.pdf"} @InProceedings{AM, author = {D. Achlioptas and F. McSherry}, title = {Fast Computation of Low Rank Matrix Approximations}, booktitle = {Proc. 33rd STOC.}, year = {2001}, pages = {611--618}, publisher = {ACM Press}, eprint="stoc:380752.380858" } @article{APV, author = {P. Agarwal and C. Procopiuc and K. Varadarajan}, title = {Approximation Algorithms for a $k$-line center}, journal = {Algorithmica}, volume = {42}, issue = {3--4}, year = {2005}, pages = {221--230}, eprint="algorithmica:p321725768012505"} @article{AHV, author = {P. Agarwal and S. Har-Peled and K. Varadarajan}, title = {Geometric Approximations via Coresets}, journal = {Combinatorial and Computational Geometry - MSRI Publications}, publisher = {Cambridge University Press}, pages = {1--30}, volume = {52}, year = 2005, pdf="http://valis.cs.uiuc.edu/~sariel/papers/04/survey/survey.pdf"} @InProceedings{AgMu, author = {P. Agarwal and N. Mustafa}, title = {$k$-Means Projective Clustering}, booktitle = {Proc. Principles of Database Systems (PODS'04)}, publisher = {ACM Press}, year = {2004}, pages = {155--165}, eprint="pods:1055558.1055581"} @article{AGGR, author = {R. Agarwal and J. Gehrke and D. Gunopulos and P. Raghavan}, title = {Automatic subspace clustering of high dimensional data for data mining applications}, journal = {Data Mining and Knowledge Discovery}, volume = {11}, pages = {5--33}, year = 2005, issue = 1, eprint="Springer:m18077t9134v55n2"} @InProceedings{APWYP, author = {C. Aggarwal and C. Procopiuc and J. Wolf and P. Yu and J. Park}, title = {Fast Algorithms for Projected Clustering}, booktitle = {Proc. Conf. on Management of Data (SIGMOD'99)}, publisher = {ACM Press}, year = {1999}, pages = {61--72}, eprint="sigmod:304182.304188"} @article{AMS, author = {N. Alon and Y. Matias and M. Szegedy}, title = {The space complexity of approximating the frequency moments}, journal = {J. Computer and System Sciences}, year = {1999}, volume = {58}, issue = {1}, pages = {137--147}, eprint="jcss:10.1006/jcss.1997.1545"} @book{Ar, author = {M. Artin}, title = {Algebra}, publisher = {Prentice-Hall}, year = {1991}} @InProceedings{BHI, author = {M. B\u{a}doiu and S. Har-Peled and P. Indyk}, title = {Approximate Clustering via Core-Sets}, booktitle = {Proc. 34th STOC.}, publisher = {ACM Press}, year = {2002}, pages = {250--257}, eprint="stoc:509907.509947" } @InProceedings{Bar, author = {Z. Bar-Yossef}, title = {Sampling Lower Bounds via Information Theory}, booktitle = {Proc. 35th STOC.}, publisher = {ACM Press}, year = {2003}, pages = {335--344}, eprint="stoc:780542.780593"} @InProceedings{FKKR, author = {W. Fernandez~de~la~Vega and M. Karpinski and C. Kenyon and Y. Rabani}, title = {Approximation schemes for clustering problems}, booktitle = {Proc. 35th STOC.}, publisher = {ACM Press}, year = {2003}, pages = {50--58}, eprint="stoc:780542.780550"} @article{DFKVV, author = {P. Drineas and R. Kannan and A. Frieze and S. Vempala and V. Vinay}, title = {Clustering large graphs via the Singular Value Decomposition}, journal = {Machine Learning}, volume = 56, pages = {9--33}, year = {2004}, eprint="ml:u424k6nn6k622788"} @InProceedings{DK, author = {P. Drineas and R. Kannan}, title = {Pass Efficient Algorithms for approximating large matrices}, booktitle = {Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA'03)}, publisher = {SIAM}, pages = {223--232}, year = {2003}, eprint="soda:644108.644147"} @article{DKM, author = {P. Drineas and R. Kannan and M. Mahoney}, title = {Fast {M}onte {C}arlo Algorithms for Matrices {II}: Computing a Low-Rank Approximation to a Matrix}, journal = {SIAM J. on Computing}, volume = 36, issue = 1, pages = {158--183}, year = {2006}, eprint="sicomp:10.1137/S0097539704442696"} @InProceedings{ES, author = {M. Effros and L. J. Schulman}, title = {Rapid near-optimal {VQ} design with a deterministic data net}, booktitle = {Proc. Int. Symp. on Information Theory}, publisher = {IEEE}, year = {2004}, pages="298", eprint="isit:10.1109/ISIT.2004.1365336"} @article{FKMSZ, author = {J. Feigenbaum and S. Kannan and A. McGregor and S. Suri and J. Zhang.}, title = {On Graph Problems in a Semi-Streaming Model}, journal = {Theoretical Computer Science}, volume = 348, issue = 2, pages = {207--216}, year = {2005}, eprint="tcs:10.1016/j.tcs.2005.09.013"} @article{FKV, author = {A. Frieze and R. Kannan and S. Vempala}, title = {Fast {M}onte {C}arlo algorithms for finding low-rank approximations}, journal = {Journal of the ACM}, year = {2004}, volume = {51}, issue = {6}, pages = {1025--1041}, eprint="jacm:1039488.1039494"} @book{GVL, author = {G. H. Golub and C. F. van Loan}, title = {Matrix Computations}, edition = {Third}, publisher = {Johns Hopkins}, year = {1996}} @article{GT, author = {S. A. Goreinov and E. E. Tyrtyshnikov}, title = {The maximal-volume concept in approximation by low-rank matrices}, journal = {Contemporary Mathematics}, volume = 280, pages = {47--51}, year = 2001} @article{GKS, author = {S. Guha and N. Koudas and K. Shim}, title = {Approximation and streaming algorithms for histogram construction problems}, journal = {ACM Transactions on Database Systems}, volume = 31, issue = 1, pages = {396--438}, year = {2006}, eprint="tods:1132863.1132873"} @InProceedings{HM, author = {S. Har-Peled and S. Mazumdar}, title = {On coresets for $k$-means and $k$-median clustering}, booktitle = {Proc. 36th STOC.}, publisher = {ACM Press}, year = {2004}, pages = {291--300}, eprint="stoc:1007352.1007400"} @InProceedings{HV, author = {S. Har-Peled and K. Varadarajan}, title = {Projective Clustering in High Dimensions using Core-Sets}, booktitle = {Proc. 18th Symp. on Comp. Geometry (SOCG)}, publisher = {ACM Press}, pages = {312--318}, year = {2002}, eprint="socg:513400.513440"} @article{HRR, author = {M. Henzinger and P. Raghavan and S. Rajagopalan}, title = {Computing on Data Streams}, journal = {External Memory Algorithms -- DIMACS Series in Discrete Mathematics and Computer Science}, volume = {50}, year = {1999}, pages = {107--118}} @InProceedings{KM, author = {D. Kempe and F. McSherry}, title = {A decentralized algorithm for spectral analysis}, booktitle = {Proc. 36th STOC.}, publisher = {ACM Press}, pages = {561--568}, year = {2004}, eprint="stoc:1007352.1007438"} @article{KW, author = {J. Kuczy\'{n}ski and H. Wo\'{z}niakowski}, title = {Estimating the largest eigenvalues by the power and {L}anczos algorithms with a random start}, journal = {SIAM J. Matrix Anal. Appl.}, volume = {13}, issue = {4}, pages = {1094--1122}, year = {1992}, eprint="simax:10.1137/0613066"} @InProceedings{KSS, author = {A. Kumar and Y. Sabharwal and S. Sen.}, title = {A simple linear time $(1+\epsilon)$-approximation algorithm for $k$-means clustering in any dimensions}, booktitle = {Proc. 45th FOCS}, publisher = {IEEE Computer Society Press}, year = {2004}, pages = {454--462}, eprint="focs:10.1109/FOCS.2004.7"} @article{M, author = {J. Matou\v{s}ek}, title = {On approximate geometric $k$-clustering}, journal = {Discrete and Computational Geometry}, volume = {24}, issue = {1}, pages = {61--84}, year = {2000}, eprint="Springer:xawxbau59gtjtvv6"} @article{MT, author = {N. Megiddo and A. Tamir}, title = {On the complexity of locating linear facilities in the plane}, journal = {Operations Research Letters}, volume = {13}, pages = {194--197}, year = {1982}, eprint="Elsevier:10.1016/0167-6377(82)90039-6"} @article{OR, author = {R. Ostrovsky and Y. Rabani}, title = {Polynomial time approximation schemes for geometric min-sum median clustering}, journal = {Journal of the ACM}, volume = {49}, issue = {2}, year = {2002}, pages = {139--156}, eprint="jacm:506147.506149"} @InProceedings{PJAM, author = {C. Procopiuc and P. Agarwal and T. Murali and M. Jones}, title = {A {M}onte {C}arlo Algorithm for Fast Projective clustering}, booktitle = {Proc. Conf. on Management of Data (SIGMOD'02)}, publisher = {ACM Press}, pages = {418--427}, year = 2002, eprint="sigmod:564691.564739"} @InProceedings{S, author = {T. Sarl\'os}, title = {Improved approximation algorithms for large matrices via random projection}, booktitle = {Proc. 47th FOCS}, publisher = {IEEE Computer Society Press}, pages = {143-152}, year = {2006}, pdf="http://www.ilab.sztaki.hu/%7Estamas/publications/rp.pdf"}%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% ToC#239 v002/a013.bib Giotis - Guruswami 10-19-2006 11pm version %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%\usepackage{eprint} @inproceedings(ACN, author="N. Ailon and M. Charikar and A. Newman", title="Aggregating {I}nconsistent {I}nformation: {R}anking and {C}lustering", booktitle="Proc. 37th STOC", pages="684--693", publisher="ACM Press", year=2005, eprint={stoc:1060590.1060692}) @Inproceedings(ABHKS, author="S. Arora and E. Berger and E. Hazan and G. Kindler and S. Safra", title="On Non-Approximability for Quadratic Programs", booktitle="Proc. 46th FOCS", publisher="IEEE Computer Society Press", year=2005, pages="206--215", eprint={focs:10.1109/SFCS.2005.57}) @article(NRT, author="A. Nemirovski and C. Roos and T. Terlaky", title="On maximization of quadratic form over intersection of ellipsoids with common center", journal="Mathematical Programming", volume=86, number=3, pages="463--473", year=1999, eprint={stacs:922f1ftd6bpfxhk7}) @inproceedings(ACMM, author="A. Agarwal and M. Charikar and K. Makarychev and Y. Makarychev", title="${O}(\sqrt{\log n})$ approximation algorithms for {M}in {U}nCut, {M}in 2{CNF} Deletion, and directed cut problems", booktitle="Proc. 37th STOC", publisher="ACM Press", year=2005, pages="573--581", eprint={stoc:10.1145/1060590.1060675}) @article(KPRT, author="P. Klein and S. Plotkin and S. Rao and E. Tardos", title="Approximation algorithms for Steiner and directed multicuts", journal="Journal of Algorithms", volume=22, number=2, pages="241--269", year=1997, eprint={10.1006/jagm.1996.0833}) @inproceedings(indyk, author="P. Indyk", title="A Sublinear-time Approximation Scheme for Clustering in Metric Spaces", booktitle="Proc. 40th FOCS", publisher="IEEE Computer Society Press", year=1999, pages="154--159", eprint={focs:10.1109/SFFCS.1999.814587}) @inproceedings(AMMN, author="N. Alon and K. Makarychev and Y. Makarychev and A. Naor", title="Quadratic forms on graphs", booktitle="Proc. 37th STOC", publisher="ACM Press", year=2005, pages="486--493", eprint={stoc:10.1145/1060590.1060664}) @Inproceedings(dVKKR, author="W. {Fernandez de la Vega} and M. Karpinski and C. Kenyon and Y. Rabani", title="Approximation Schemes for Clustering Problems", booktitle="Proc. 35th STOC", publisher="ACM Press", year=2003, pages="50--58", eprint={stoc:10.1145/780542.780550}) @inproceedings(vega-kenyon, author="W. {Fernandez de la Vega} and C. Kenyon", title="A Randomized Approximation Scheme for Metric MAX-CUT", booktitle="Proc. 39th FOCS", publisher="IEEE Computer Society Press", pages="468--471", year=1998, eprint={focs:10.1109/SFCS.1998.743497}) @article(CGW, author="M. Charikar and V. Guruswami and A. Wirth", title="Clustering with qualitative information", journal="Journal of Computer and System Sciences", volume=71, number=3, month="October", year=2005, pages="360--383", eprint={jcss:10.1016/j.jcss.2004.10.012}) @inproceedings(CGW-focs, author="M. Charikar and V. Guruswami and A. Wirth", title="Clustering with qualitative information", booktitle="Proc. 44th FOCS", publisher="IEEE Computer Society Press", pages="524--533", year=2003) @inproceedings(CW, author="M. Charikar and A. Wirth", title="Maximizing quadratic programs: extending {Grothendieck's} inequality", booktitle="Proc. 45th FOCS", publisher="IEEE Computer Society Press", year=2004, pages="54--60", eprint={focs:10.1109/FOCS.2004.39}) @article(GGR, author="O. Goldreich and S. Goldwasser and D. Ron", title="Property testing and its connection to learning and approximation", journal="Journal of the ACM", volume=45, number=4, pages="653--750", month="July", year=1998, eprint={jacm:10.1145/285055.285060}) @inproceedings(KKMO, author="S. Khot and G. Kindler and E. Mossel and R. O'Donnell", title="Optimal inapproximability results for {Max Cut} and other 2-variable {CSP}s", booktitle="Proc. 45th FOCS", publisher="IEEE Computer Society Press", year=2004, pages="146--154", eprint={focs:10.1109/FOCS.2004.49}) @inproceedings{gramm, author = "J. Gramm and J. Guo and F. H{\"u}ffner and R. Niedermeier", title = "Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation", booktitle = "Proc. 5th Italian Conf. on Algorithms and Complexity (CIAC'03)", year = 2003, pages = "108--19", eprint={ciac:wfqd4c5405fddh8j} } @inproceedings(SST, author="R. Shamir and R. Sharan and D. Tsur", title="Cluster graph modification problems", booktitle="Proc. 28th Workshop on Graph Theory (WG'02)", year= 2002, pages="379--390" ) @article(BSY, author="A. Ben-Dor and R. Shamir and Z. Yakhini", title="Clustering gene expression patterns", journal="Journal of Computational Biology", volume=6, pages="281--297", year=1999) @incollection(roberts, author = "F. Roberts", title = "Discrete Mathematics", booktitle = "Int. Encyc. Social and Behavioral Sciences", pages = "3743--3746", year = 2001, publisher = "Elsevier" ) @inproceedings(swamy, author = "C. Swamy", title = "Correlation {C}lustering: {M}aximizing Agreements via Semidefinite Programming", booktitle="Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA'04)", publisher="SIAM", pages="519--520", year = 2004, eprint={soda:982866} ) @article(BBC, author = "N. Bansal and A. Blum and S. Chawla", title = "Correlation Clustering", journal="Machine Learning, Special Issue on Clustering", year=2004, volume=56, pages="89--113", doi={10.1023/B:MACH.0000033116.57574.95} ) @article(kss, author = "M. Kearns and R. Schapire and L. Sellie", title = "Toward efficient agnostic learning", journal = "Machine Learning", year = 1994, pages = "115--142", volume = 17, doi={10.1007/BF00993468} ) @article(ensz, author = "G. Even and J. Naor and B. Schieber and L. Zosin", title = "Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications", journal = "SIAM J. Discrete~Math.", year = 2000, pages = "255--267", volume = 25 ) @article(GVY, author = "N. Garg and V. Vazirani and M. Yannakakis", title = "Approximate Max-Flow Min-(multi)cut Theorems and Their Applications.", journal = "SIAM J. Computing", year = 1996, pages = "235--251", volume = 25 ) @article(hastad, author = "J. H{\aa}stad", title = "Some optimal inapproximability results", journal = "Journal of the ACM", year = 2001, pages = "798--859", volume = 48 ) @article(GVY2, author = "N. Garg and V. Vazirani and M. Yannakakis", title = "Primal-dual approximation algorithms for integral flow and multicut in trees", journal = "Algorithmica", year = 1997, pages = "3--20", volume = 18 ) @article(CKR00, author = "G. Calinescu and H. Karloff and Y. Rabani", title = "An Improved Approximation Algorithm for Multiway Cut", journal = "J. Computer and System Sciences", year = 2000, pages = "564--574", volume = 60 ) @inproceedings(KKS+99, author = "D. Karger and P. Klein and C. Stein and M. Thorup and N. Young", title = "Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut", booktitle = "Proc. 31st STOC", publisher="ACM Press", year = 1999, pages = "668--678" ) @inproceedings(nickle, author = "E. Demaine and N. Immorlica", title = "Correlation Clustering with Partial Information", booktitle = "Proc. 6th Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'03)", publisher="Springer", series="LNCS", volume=2764, isbn={3-540-40770-7}, year = 2003, pages = "1--13", doi={10.1007/b11961} ) @article(KRAR, author="P. Klein and S. Rao and A. Agarwal and R. Ravi", title="An approximate max-flow min-cut relation for multicommodity flow, with applications", journal="Combinatorica", volume=15, year=1995, pages="187--202") @inproceedings(dotan, author = "D. Emanuel and A. Fiat", title = "Correlation Clustering---Minimizing Disagreements on Arbitrary Weighted Graphs", booktitle = "Proc. 11th European Symp. on Algorithms ({ESA'03})", publisher="Springer", year = 2003, pages = "208--220", doi={10.1007/b13632} ) @article(setsplitting, author = "V. Guruswami", title = "Inapproximability results for set splitting and satisfiability problems with no mixed clauses", journal="Algorithmica", volume=38, number=3, pages="451--469", month="December", year=2003) @article(chen, author = "Z. Chen and T. Jiang and G. Lin", title = "Computing Phylogenetic Roots with Bounded Degrees and Errors", journal = "SIAM J.~Computing", volume = 32, number =4, pages = "864--879", year = 2003 ) @proceedings{DBLP:conf/approx/2000, editor = {Klaus Jansen and Samir Khuller}, booktitle = {Proc. 3rd Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'00)} publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {1913}, year = {2000}, isbn = {3-540-67996-0}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings(khot, author = "S. Khot", title = "On the power of unique 2-prover 1-round games", booktitle = "Proc.~of 34th STOC", publisher="ACM Press", year = 2002, pages = "767--775" ) @book(papadi, author = "C. Papadimitriou", title = "Computational Complexity", publisher = "Addison Wesley Longman", year = 1994 ) @book(vazirani, author = "V. Vazirani", title = "Approximation Algorithms", publisher = "Springer", year = 2001 ) @incollection(FJ, author = "A. Frieze and M. Jerrum", title = "Improved approximation algorithms for {MAX} \(k\)-{CUT} and {MAX} {BISECTION}", booktitle = "Proc.~of 4th International Conf. Integer Programming and Combinatorial Optimization", volume = "920", series = "LNCS", publisher = "Springer", editor = "E. Balas and J. Clausen", pages = "1--13", year = "1995" ) @InProceedings{AKKMS, author={Noga Alon and Haim Kaplan and Michael Krivelevich and Dahlia Malkhi and Julien Stern}, title={Scalable Secure Storage when Half the System is Faulty}, booktitle={Proc. 27th Internat. Colloquium on Automata, Languages and Programming (ICALP'00)}, year=2000, pages="576--587", publisher = {Springer}, eprint="icalp:3l87mp6xvnxr0cfg"} @book{as, title={The Probabilistic Method, 2nd Edition}, author={Noga Alon and Joel Spencer}, publisher={John Wiley $\&$ Sons}, year={2000} } @InProceedings{AB, author = {Yonatan Aumann and Michael Bender}, title = {Fault Tolerant Data Structures}, booktitle = {Proc. 37th FOCS}, year = {1996}, publisher = {IEEE Computer Society}, pages="580--589", eprint="focs:10.1109/SFCS.1996.548517" } @InProceedings{awerbuch_scheideler:group, author = {Baruch Awerbuch and Christian Scheideler}, title = {Group Spreading: {A} Protocol for Provably Secure Distributed Name Service}, booktitle = {Proc. 31st Internat. Colloquium on Automata, Languages, and Programming (ICALP'04)}, year = 2004, pages="183--195", publisher="Springer", eprint="icalp:782vxmb2mlxxrmru" } @InProceedings{baruch:robust, author = {Baruch Awerbuch and Christian Scheideler}, title = {Robust Distributed Name Service}, booktitle = {Proc. 3rd Internat. Workshop on Peer-to-Peer Systems (IPTPS'04)}, year = 2004, publisher = {Springer}, pages="237--249", eprint="springer:crpp90cx7r3p61t0" } @InProceedings{br, author = {M. Bellare and P. Rogaway}, title = {Random Oracles are Practical: {A} paradigm for designing efficient protocols}, booktitle = {Proc. 1st ACM Conf. on Computer and Communications Security}, pages = {62--73}, publisher = {ACM Press}, year = {1993}, eprint="acm:168588.168596" } @Article{spam, title={Gnutella Girds against Spam Attacks}, author={John Borland}, journal={CNET News.com}, year={2000}, month={August}, note={http://news.cnet.com/news/\-0-1005-200-2489605.html} } @InProceedings{datar, author = {Mayur Datar}, title = {Butterflies and Peer-to-Peer Networks}, booktitle = {Proc. 10th European Symp. on Algorithms (ESA'02)}, publisher = {Springer}, year = {2002}, pages="310--322", eprint="esa:w83mmlkyt13lx90f" } @InProceedings{past, author = {Peter Druschel and Antony Rowstron}, title = {{PAST}: {A} Large-Scale, Persistent Peer-to-Peer Storage Utility}, booktitle = {Proc. 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII)}, month = {May}, year = 2001, publisher = {IEEE Computer Society}, address = {Schloss Elmau, Germany}, pages="75--80", eprint="ieee:10.1109/HOTOS.2001.990064" } @misc{eff, title={{Electronic Freedom Foundation} --- {Censorship} --- {Internet} Censorship Legislation $\&$ Regulation ({CDA}, etc.) --- {Archive}}, key = {Electronic}, note={http://www.eff.org/\-pub/Censorship/Internet\_censorship\_bills} } @inproceedings{FS, AUTHOR={Amos Fiat and Jared Saia}, TITLE={Censorship Resistant Peer-to-Peer Content Addressable Networks}, BOOKTITLE={Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA'02)}, YEAR={2002}, publisher = {ACM Press}, pages="94--103", eprint="soda:545381.545392" } @InProceedings{FSY, author = {Amos Fiat and Jared Saia and Maxwell Young}, title = {Making Chord Robust to Byzantine Attack}, booktitle = {Proc. 13th European Symposium on Algorithms (ESA'05)}, year = 2005, pages="803--814", publisher={Springer}, eprint="esa:422llxn7khwej72n" } @InProceedings{Gifford, author = {D.K. Gifford}, title = {Weighted voting for replicated data}, booktitle = {Proc. 7th ACM Symp. on Operating Systems Principles}, pages = {150--159}, publisher = {ACM Press}, year = {1979}, eprint="acm:800215.806583" } @Misc{clip2, key = {Gnutella}, title = {Gnutella: {To} the Bandwidth Barrier and Beyond}, note = {http://dss.clip2.com/gnutella.html} } @Misc{gnutella, key = {Gnutella}, title = {{Gnutella Website}}, note = {http://www.gnutella.com} } @InProceedings{HLN, author = {J. H{\aa}stad and {F. Thomson} Leighton}, title = {Fast computation using faulty hypercubes}, booktitle = {Proc. 21st STOC}, year = {1989}, publisher = {ACM Press}, pages="251--263", eprint="stoc:73007.73031" } @misc{Naplegal, title={With Napster Weakened, RIAA Hopes To Settle Landmark Lawsuit}, author={Brian Hiatt}, year={2001}, month={July}, note={http://www.mtv.com/sendme2.tin?page=/\-news/articles/\-1445466/20010727/index.jhtml} } @inproceedings{HK, AUTHOR={Kristen Hildrum and John Kubiatowicz}, TITLE={Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-peer Networks}, BOOKTITLE={Proc. 17th Internat. Symposium on Distributed Computing (DISC'03)}, YEAR={2003}, publisher = {Springer}, pages="321--336", eprint="springer:7emt7u01cvbb6bu6" } @misc{ioc, title={{Index On Censorship Homepage}}, key={Index}, note={http://www.indexoncensorship.org} } @InProceedings{KNT, author = {Anna R. Karlin and Greg Nelson and Hisao Tamaki}, title = {On the Fault Tolerance of the Butterfly}, booktitle = {Proc. 26th STOC}, year = {1994}, publisher = {ACM Press}, pages="125--133", eprint="stoc:195058.195117" } @InProceedings{kashoek_karger:koorde, author = {M. Kashoek and D. Karger}, title = {Koorde: {A} Simple Degree-Optimal Distributed Hash Table}, booktitle = {Proc. 2nd Internat. Workshop on Peer-to-Peer Systems (IPTPS'03)}, year = 2003, publisher = {Springer}, pages="98--107", eprint="springer:unmqcqy0yxpu32xp" } @InProceedings{Oceanstore, author={John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao}, title={{OceanStore}: {An} Architecture for Global-Scale Persistent Storage}, booktitle={Proc. 9th Internat. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000)}, year={2000}, pages="190--201", eprint="acm:356989.357007" } @Article{LMS, author = {{F. Thomson} Leighton and Bruce Maggs and Ramesh Sitamaran}, title = {On the Fault Tolerance of Some Popular Bounded-Degree Networks}, journal = {SIAM Journal on Computing}, year = {1998}, volume = {27}, number = {5}, pages = {1303--1333}, eprint="sicomp:10.1137/S0097539793255163" } @inproceedings{luby:practical, AUTHOR={Michael G. Luby and Michael Mitzenmacher and M. Amin Shokrollahi and Daniel A. Spielman and Volker Stemann}, TITLE={Practical loss-resilient codes}, BOOKTITLE={Proc. 29th STOC}, publisher = {ACM Press}, YEAR={1997}, PAGES={150--159}, eprint="stoc:258533.258573" } @Article{MRW, author = {Dahlia Malkhi and Michael Reiter and Avishai Wool}, title = {The Load and Availability of Byzantine Quorum Systems}, journal = {SIAM Journal on Computing}, year = {2000}, volume = {29}, number = {6}, pages = {1889--1906}, eprint="sicomp:10.1137/S0097539797325235" } @InProceedings{MRWW, author = {Dahlia Malkhi and Michael Reiter and Avishai Wool and Rebecca N. Wright}, title = {Probabilistic Byzantine Quorum Systems}, booktitle = {Proc. 17th Ann. ACM Symp. on Principles of Distributed Computing (PODC'98)}, year = 1998, publisher = {ACM Press}, pages=321, eprint="acm:277697.277781" } @InProceedings{MBR, author = {G. Manku and M. Bawa and P. Raghavan}, title = {Symphony: {Distributed} hashing in a small world}, booktitle = {Proc. 4th USENIX Symp. on Internet Technologies and Systems (USITS'03)}, pages = "127--140", year = 2003, } @InProceedings{MM, author = {P. Maymounkov and D. Mazieres}, title = {Kademlia: {A} peer-to-peer information system based on the {XOR} metric}, booktitle = {Proc. 1st Internat. Workshop on Peer-to-Peer Systems (IPTPS'02)}, year = 2002, publisher = {Springer}, pages="53--65", eprint="springer:2ekx2a76ptwd24qt" } @book{MR, author="Rajeev Motwani and Prabhakar Raghavan", title="Randomized Algorithms", year="1995", publisher="Cambridge University Press" } @inproceedings{naor_wieder:a_simple, AUTHOR={Moni Naor and Udi Wieder}, TITLE={A simple fault tolerant distributed hash table}, BOOKTITLE={Proc. 2nd Internat. Workshop on Peer-to-Peer Systems (IPTPS'03)}, YEAR={2003}, publisher = {Springer}, pages="88--97", eprint="springer:4e756fgyq4ff4kay" } @Misc{Napster, key = {Napster}, title = {{Napster Website}}, note ={http://www.napster.com} } @Book{Peertopeer, title={Peer-to-Peer: {Harnessing} the Power of Disruptive Technologies}, editor={Andy Oram}, year=2001, month={July}, publisher={O'Reilly $\&$ Associates} } @inproceedings{PRU, author = {Gopal Pandurangan and Prabhakar Raghavan and Eli Upfal}, title = {Building Low-diameter Peer-to-peer Networks}, booktitle = {Proc. 42nd FOCS}, publisher = {IEEE Computer Society}, year = "2001" } @InProceedings{Pinsker, author = {M. Pinsker}, title = {On the complexity of a concentrator}, booktitle = {Proc. 7th Internat. Teletraffic Conference}, pages = {318/1-318/4}, year = {1973}, } @InProceedings{PRR, author={C.G. Plaxton and R. Rajaraman and A.W. Richa}, title={Accessing nearby copies of replicated objects in a distributed environment}, booktitle={Proc. 9th Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA'97)}, year=1997, publisher = {ACM Press}, pages="311--320", eprint="spaa:258492.258523" } @InProceedings{RFHKS, author = {Sylvia Ratnasamy and Paul Francis and Mark Handley and Richard Karp and Scott Shenker}, title = {A Scalable Content-Addressable Network}, booktitle = "Proc. ACM SIGCOMM 2001 Technical Conference", year = 2001, pages="161--172", publisher = {ACM Press}, eprint="acm:964723.383072" } @inproceedings{rowstron_druschel:pastry, AUTHOR={Antony I. T. Rowstron and Peter Druschel}, TITLE={Pastry: {Scalable}, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems}, BOOKTITLE={Proc. of the IFIP/ACM Internat. Conf. on Distributed Systems Platforms}, YEAR={2001}, PAGES={329--350}, publisher = {Springer}, eprint="springer:7y5mjjep0hqlctv6" } @InProceedings{SGG1, author = {Stefan Saroiu and P. Krishna Gummadi and Steven D. Gribble}, title = {A Measurement Study of Peer-to-Peer File Sharing Systems}, booktitle = {Proc. 9th Ann. Symp. on Multimedia Computing and Networking (MMNC'02)}, publisher = {SPIE Press}, year = 2002 } @Article{SGG2, author = {Stefan Saroiu and P. Krishna Gummadi and Steven D. Gribble}, title = {Measuring and analyzing the characteristics of Napster and Gnutella hosts}, journal = {Multimedia Systems}, year = {2003}, volume = {9}, number = {2}, pages = {170--184}, publisher = {Springer}, } @InProceedings{scheideler:how, author = {Christian Scheideler}, title = {How to Spread Adversarial Nodes? {Rotate!}}, booktitle = {Proc. 37th STOC}, year = 2005, publisher = {ACM Press}, pages="704--713", eprint="stoc:1060590.1060694" } @Article{shamir, title={How to Share a Secret}, author={Adi Shamir}, journal={Communications of the ACM}, volume=22, number=11, pages="612--613", publisher = {ACM Press}, year={1979}, eprint="acm:359168.359176" } @Article{chord01, author = {Ion Stoica and Robert Morris and David Liben-Nowell and David R. Karger and M. Frans Kaashoek and Frank Dabek and Hari Balakrishnan}, title = {Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications}, journal = {{IEEE/ACM} Transactions on Networking}, year = {2003}, volume = {11}, number = {1}, pages = {17--32}, publisher = {IEEE Computer Society}, doi = {10.1109/TNET.2002.808407}, } @InProceedings{PUB00, author = {Marc Waldman and Aviel D. Rubin and Lorrie Faith Cranor}, title = {Publius: {A} robust, tamper-evident, censorship-resistant, web publishing system }, booktitle = {Proc. 9th USENIX Security Symposium}, pages = {59--72}, year = 2000, month = {August} } @Article{china, title={Googling the Great Firewall: {Google} Kowtowed to Communist Censorship}, author={Erping Zhang}, journal={The New York Sun}, month = {31 January}, year = {2006}, note={http://www.nysun.com/article/26791}} @TechReport{tapestry, author = {B.Y. Zhao and K.D. Kubiatowicz and A.D. Joseph}, title = {Tapestry: {An} Infrastructure for Fault-Resilient Wide-Area Location and Routing}, institution = {University of California at Berkeley Technical Report}, number = "UCB//CSD-01-1141", month = {April}, year = 2001 } @Book{AlonSp02, author = "N. Alon and J. Spencer", title = "The Probabilistic Method", publisher = "John Wiley and Sons", year = "2002", note = "", } @Article{FriedgutBo99, author = "E. Friedgut and J. Bourgain", title = "Sharp Thresholds of Graph Properties, and the k-Sat Problem", journal = "Journal of the American Mathematical Society", volume = "12", number = "4", pages = "1017--1054", year = "1999", eprint = "JAMS:jams/1999-12-04/S0894-0347-99-00305-7" } @InProceedings{GoerdtKr01, author = "A. Goerdt and M. Krivelevich", title = "Efficient Recognition of Random Unsatisfiable $k$-{SAT} Instances by Spectral Methods", booktitle = "Proc. Ann. Symp. on Theoretical Aspects of Computer Science (STACS '01)", pages = "294--304", publisher = "Springer", series = "LNCS", volume = "2010", year = "2001", eprint="stacs:27cr0lrbpr7px7y3" } @article{FriedmanGoKr05, author = "J. Friedman and A. Goerdt and M. Krivelevich", title = "Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently", journal = "SIAM J. on Computing", volume = "35", number = "2", pages = "408--430", year = "2005", eprint="sicomp:10.1137/S009753970444096X" } @InProceedings{Feige02, author = "U. Feige", title = "Relations between Average Case Complexity and Approximation Complexity", pages = "534--543", booktitle = "Proc. 34th STOC", publisher = "ACM Press", year = "2002", eprint="stoc:509907.509985" } @article{FeigeOf05, author = "U. Feige and E. Ofek", title = "Spectral Techniques Applied to Sparse Random Graphs", journal= "Random Structures and Algorithms", volume = "27", number = "2", pages = "251--275", year = "2005", eprint="rsa:10.1002/rsa.20089" } @inproceedings{Zwick99, author = "U. Zwick", title = "Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to {MAX {CUT}} and other problems", pages = "679--687", booktitle = "Proc. 31st STOC", publisher = "ACM Press", year = "1999", eprint="stoc:301250.301431" } @article{CojaGoLaSc03, AUTHOR = "A. Coja-Oghlan and A. Goerdt and A. Lanka and F. Schadlich", TITLE = "Techniques from combinatorial approximation algorithms yield efficient algorithms for random $2k$-SAT", JOURNAL = "Theoretical Computer Science", VOLUME = "329", PAGES = "1--45", YEAR = "2004", eprint="tcs:10.1016/j.tcs.2004.07.017" } @Misc{GoerdtLa03, title = "Recognizing more random 3-SAT instances efficiently", author = "A. Goerdt and A. Lanka", howpublished = "LICS'03 Workshop on Typical Case Complexity and Phase Transitions", year = "2003", url = "http://www.scs.carleton.ca/~kranakis/LICS-03.html", } @article{ChvatalSz88, author = "V. Chv\'{a}tal and E. Szemer\'{e}di", title = "Many hard examples for resolution", journal = "J. ACM", volume = "35", number = "4", pages = "759--768", year = "1988", eprint="jacm:10.1145/48014.48016" } @InProceedings{CojaGoLa04, author = "A. Coja-Oghlan and A. Goerdt and A. Lanka", title = "Strong Refutation Heuristics for Random $k$-{SAT}", booktitle = "Proc. 8th Internat. Workshop on Randomization and Computation (RANDOM '04)", publisher = "Springer", series = "LNCS", volume = "3122", pages = "310--321", year = "2004", eprint="springer:x1tlgm3cexcj" } @article{CojaGoLa07, author = "A. Coja-Oghlan and A. Goerdt and A. Lanka", title = "Strong Refutation Heuristics for Random $k$-{SAT}", journal = "Combinatorics, Probability and Computing", volume = "16", number = "1", pages = "5--28", year = "2007", note = "Conference version appeared in Proc. 8th Internat. Workshop on Randomization and Computation (RANDOM '04), volume 3122 of LNCS, pp. 310--321. Springer, 2004", doi="10.1017/S096354830600784X", eprint="springer:x1tlgm3cexcj" } @article{JansonStVa00, author = "S. Janson and Y. Stamatiou and M. Vamvakari", title = "Bounding the unsatisfiability threshold of random 3-SAT", journal = "Random Structures and Algorithms", volume = "17", number = "2", pages = "103--116", year = "2000", eprint="rsa:10.1002/1098-2418(200009)17:2<103::AID-RSA2>3.0.CO;2-P" } @article{Ben-SassonWi01, author = {E. Ben-Sasson and A. Wigderson}, title = {Short proofs are narrow--- resolution made simple}, journal = {J. ACM}, volume = {48}, number = {2}, year = {2001}, issn = {0004-5411}, pages = {149--169}, eprint="jacm:10.1145/375827.375835" } @Misc{HajiaghayiSo03, title = "The Satisfiability Threshold of Random 3-{SAT} Is at Least 3.52", author = "M. Hajiaghayi and B. Sorkin", year = "2003", oai = "oai:arXiv.org:math/0310193", subject = "Combinatorics; Probability; Discrete Mathematics", eprint = "arxiv:math/0310193", URL = "http://arxiv.org/abs/math/0310193", } @article{KaporisKiLa03, author = "A. Kaporis and L. Kirousis and E. Lalas", title = "The probabilistic analysis of a greedy satisfiability algorithm", journal = "Random Structures and Algorithms", volume = "28", number = "4", year = "2006", pages = "444--480", eprint="rsa:10.1002/rsa.20104" } @InProceedings{Khot04a, author = "S. Khot", title = "Ruling Out {PTAS} for Graph Min-Bisection, Densest Subgraph and Bipartite Clique", booktitle = "Proc. 45th FOCS", pages = "136--145", publisher = "IEEE Computer Society", year = "2004", eprint="focs:10.1109/FOCS.2004.59" } @comment{This file has been generated by Pybliographer} @article {Tovey84, author = "C.A. Tovey", title = "A simplified {NP}-complete satisfiability problem", journal = "Discrete Applied Mathematics", Volume = {8}, Number = {1}, year = "1984", pages = "85--89", eprint="elsevier:10.1016/0166-218X(84)90081-7" } @inproceedings{CRPhardS06, author = {Haviv, I. and Regev, O.}, title = {Hardness of the Covering Radius Problem on Lattices}, booktitle = {Proc. of 21st Ann. Conf. on Computational Complexity (CCC'06)}, publisher = {IEEE Computer Society Press}, year = {2006}, pages="145--158", eprint="ccc:10.1109/CCC.2006.23" } @Article{GabberGa81, title={Explicit Constructions of Linear-Sized Superconcentrators}, author={Gabber, O. and Galil, Z.}, pages={407--420}, journal=jcss, year=1981, month=jun, volume=22, number=3, preliminary={FOCS::GabberG1979}, source={http://theory.lcs.mit.edu/~dmjones/hbp/jcss/jcss.bib}, eprint="jcss:10.1016/0022-0000(81)90040-4" } @article {AlonCapalbo, AUTHOR = {Alon, N. and Capalbo, M.}, TITLE = {Smaller explicit superconcentrators}, JOURNAL = {Internet Math.}, FJOURNAL = {Internet Mathematics}, VOLUME = {1}, YEAR = {2004}, NUMBER = {2}, PAGES = {151--163}, ISSN = {1542-7951}, MRCLASS = {05C75 (68R10)}, MRNUMBER = {MR2077222 (2006a:05140)}, MRREVIEWER = {Marek Kubale}, pdf="http://www.internetmathematics.org/volumes/1/2/pp151_163.pdf", EPRINT = {InternetMath:1/2/151/163}, } @Techreport{KoLin94, Author = {Ko, K.-I. and Lin, C.-L.}, Title = {Non-Approximability in the Polynomial-Time Hierarchy}, Number = {94-2}, Institution = {Dept. of Computer Science, SUNY at Stony Brook}, year = {1994} } @Article{PapaYanna91, Author = {C. H. Papadimitriou and M. Yannakakis}, Title = {Optimization, approximation, and complexity classes}, Journal = {Journal of Computer and System Sciences}, Volume = 43, year = 1991, Pages = {425--440}, number=3, eprint="jcss:10.1016/0022-0000(91)90023-X" } @article{GuruswamiMR04, Author = {Guruswami, V. and Micciancio, D. and Regev, O.}, Title = {The Complexity of the Covering Radius Problem on Lattices and Codes}, Journal = {Computational Complexity}, Volume = {14}, Number = {2}, year = {2005}, Pages = {90--121}, note = {Preliminary version in CCC'04}, proc_booktitle= {Proc. of 19th Ann. IEEE Conf. on Computational Complexity (CCC)}, proc_year = {2004}, proc_pages = {161--173}, doi = {10.1007/s00037-005-0193-y} } @Article {KoLin95, Author = {Ko, K.-I. and Lin, C.-L.}, Title = {On the longest circuit in an alterable digraph}, Journal = {J. Global Optimization}, Volume = {7}, year = {1995}, Number = {3}, Pages = {279--295}, issn = {0925-5001}, coden = {JGOPEO}, mrclass = {90C35 (05C20 05C38)}, mrnumber = {MR1355657 (96f:90122)}, eprint="springer:k74448w88p1483ww" } @book {VaziraniBook, Author = {Vazirani, V.V.}, Title = {Approximation algorithms}, Publisher = {Springer-Verlag}, Address = {Berlin}, year = {2001}, Pages = {xx+378}, isbn = {3-540-65367-8}, mrclass = {68-02 (68Q17 68Q25 68W25 90Cxx)}, mrnumber = {MR1851303 (2002h:68001)}, mrreviewer = {Mark R. Jerrum}, } @article {LubotzkyPhSa88, Author = {Lubotzky, A. and Phillips, R. and Sarnak, P.}, Title = {Ramanujan graphs}, Journal = {Combinatorica}, Volume = {8}, year = {1988}, Number = {3}, Pages = {261--277}, issn = {0209-9683}, coden = {COMBDI}, mrclass = {05C75 (05C25 05C50)}, mrnumber = {MR963118 (89m:05099)}, mrreviewer = {Dave Witte Morris}, eprint="springer:k285687344657q53" } @article {Margulis88, Author = {Margulis, G. A.}, Title = {Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators}, Journal = {Problemy Peredachi Informatsii}, fjournal = {Akademiya Nauk SSSR. Institut Problem Peredachi Informatsii Akademii Nauk SSSR. Problemy Peredachi Informatsii}, Volume = {24}, year = {1988}, Number = {1}, Pages = {51--60}, issn = {0555-2923}, mrclass = {68R10 (05C99 94A15)}, mrnumber = {MR939574 (89f:68054)}, mrreviewer = {Mirko K{\v{r}}iv{\'a}nek}, } @Article{SchaeferUmans02a, Author = {Schaefer, M. and Umans, C.}, Title = {Completeness in the Polynomial-Time Hierarchy: {A} compendium}, Journal = {SIGACT News}, month = sep, year = 2002, volume=33, number=3, pages="32--49", eprint="sigact:10.1145/582475.582484", note="Guest column in Complexity Theory Column." } @Article{SchaeferUmans02b, Author = {Schaefer, M. and Umans, C.}, Title = {Completeness in the Polynomial-Time Hierarchy: Part {II}}, Journal = {SIGACT News}, month = dec, year = 2002, volume=33, number=4, pages="22--36", eprint="sigact:10.1145/601819.601829", note="Guest column in Complexity Theory Column." } @InCollection{AroraLund96, Author = {Arora, S. and Lund, C.}, Title = {Hardness of Approximation}, booktitle = {Approximation algorithms for {NP}-hard problems}, Publisher = {PWS}, Editor = {Hochbaum, Dorit S.}, Address = {Boston}, year = 1996 } @Article{Qutrits, author = {Janzing, D.}, title = {Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer}, journal = {Physical Review}, year = {2007}, volume = {A}, number = {75}, pages = {012307}, eprint = {pra:10.1103/PhysRevA.75.012307}, } @Unpublished{aharonov-2003, author = {Aharonov, D.}, title = {A simple proof that {Toffoli} and {Hadamard} are quantum universal}, year = {2003}, eprint = {arxiv:quant-ph/0301040}, } @Article{esy:promise, author ={Even, S. and Selman, {A.~L.} and Yacobi, Y.}, title = {The complexity of promise problems with applications to public-key cryptography}, journal = {Inform. and Control}, vol ={61}, pages = {159--173}, year = {1984} } @Article{BernVaz, author = {Bernstein, E. and Vazirani, U.}, title = {Quantum Complexity Theory}, journal = {SIAM Journal on Computing}, year = {1997}, volume = {26}, number = {5}, pages = {1411--1473}, eprint="sicomp:10.1137/S0097539796300921" } @Article{KnillQuadr, author = {Knill, E. and Laflamme, R.}, title = {Quantum computation and quadratically signed weight enumerators}, year ={2001}, journal = {Inf. Process. Lett.}, volume = {79}, number = {4}, page = {173--179}, eprint="ipl:10.1016/S0020-0190(00)00222-2" } @Unpublished{PawelYard, author = {Wocjan, P. and Yard, J.}, title = {The {Jones} polynomial: quantum algorithms and applications in quantum complexity theory}, year = {2006}, eprint= {arxiv:quant-ph/0603069}, pdf ="http://arxiv.org/abs/quant-ph/0603069.pdf" } @Unpublished{aharonov-2006-, author = "Aharonov, D. and Arad, I.", title = {The {BQP}-hardness of approximating the {Jones} polynomial}, year = {2006}, eprint = {arxiv:quant-ph/0605181}, pdf = "http://arxiv.org/abs/quant-ph/0605181.pdf" } @Unpublished{WZ:06, author = "Wocjan, P. and Zhang, S.", title = {Several natural {BQP}-complete problems}, year = {2006}, eprint = {arxiv:quant-ph/0606179}, } @Article{Ergodic, author = {Janzing, D. and Wocjan, P.}, title = "Ergodic quantum computing", year ={2005}, journal = "Quant. Inf. Process.", volume = {4}, number = {2}, pages = {129--158}, eprint = {springer:wq1g61v1236574t4} } @Book{KitaevShen, author = "Kitaev, A. and Shen, A. and Vyalyi, M.", title = "Classical and Quantum Computation", year = {2002}, publisher = {Am. Math. Soc.}, address = {Providence, Rhode Island} } @Unpublished{Oliveira, author = "Oliveira, R. and Terhal, B.", title = "The complexity of quantum spin systems on a two-dimensional square lattice", eprint= {arxiv:quant-ph/0504050}, year = {2005}, pdf = "http://arxiv.org/abs/quant-ph/0504050" } @article{Kempe2local, author = {Kempe, J. and Kitaev, A. and Regev, O.}, title = {The complexity of the local {Hamiltonian} problem}, year = 2006, pages = {1070--1097}, journal="SIAM J. Computing", volume=35, number=5, eprint="sicomp:10.1137/S0097539704445226" } @Article{RB00, title = {A One-Way Quantum Computer}, author = {Raussendorf, R. and Briegel, H.}, journal = {Phys. Rev. Lett.}, volume = {86}, number = {22}, pages = {5188--5191}, numpages = {3}, year = {2001}, eprint = {prl:10.1103/PhysRevLett.86.5188}, } @Article{RB00b, author = {Raussendorf, R. and Briegel, H.}, title = {Quantum computing via measurement only}, year ={2000}, journal = {Phys. Rev. Lett}, pages = {5188} } @Unpublished{browne-2006-, author = {Browne, {D. E.} and Briegel, H.}, title = {One-way quantum computation - a tutorial introduction}, year = {2006}, eprint = {arxiv:quant-ph/0603226} } @Article{childs-2005-71, author = {{A.~M.} Childs and {D.~W.} Leung and {M.~A.} Nielsen}, title = {Unified derivations of measurement-based schemes for quantum computation}, journal = {Phys. Rev. A}, volume = {71}, pages = {032318}, year ={2005}, eprint = {pra:10.1103/PhysRevA.71.032318} } @InProceedings{ATS, author = {Aharonov, D. and Ta-Shma, A.}, title = {Adiabatic quantum state generation and statistical zero knowledge}, booktitle = {Proc. 35th Annual ACM Symp. on Theory of Computing}, pages = {20--29}, year = {2003}, eprint="stoc:10.1145/780542.780546" } @PhdThesis{ChildsDiss, author = {Childs, A.}, title = {Quantum information processing in continuous time}, school = {Massachusetts Institute of Technology}, year = {2004}, } @Article{Hoeffding, author = {Hoeffding, W.}, title = {Probability inequalities for sums of bounded random variables}, journal = {Journ. Am. Stat. Ass.}, year = {1963}, volume = {58}, number = {301}, pages = {13--30}, } @Article{BACS:06, author = {Berry, {D. W.} and Ahokas, G. and Cleve, R. and Sanders, {B. C.}}, title = {Efficient quantum algorithms for simulating sparse {Hamiltonians}}, journal = {Comm. Math. Phys.}, year = {2007}, volume = {270}, number = {2}, pages = {359--371}, OPTnote = {\url{http://www.springerlink.com/content/hk7484445j37r228/?p=09b4525efac543d381ab1975f8a1595f&pi=2}}, OPTannote = {}, eprint="springer:hk7484445j37r228" } @Book{NC, author = {M. Nielsen and I. Chuang}, title = {Quantum Computation and Quantum Information}, publisher = {Cambridge University Press}, year = {2000}, } @InProceedings{PSPACE, author = {Wocjan, P. and Janzing, D. and Decker, Th. and Beth, Th.}, title = {Measuring 4-local n-qubit observables could probabilistically solve {PSPACE}}, booktitle = {Proc. Winter International Symp. on Information and Communication Technologies}, year = {2004}, note = {(Proceedings contain only the abstract) }, eprint= {arxiv:quant-ph/0308011}, } @Article{IdentityQMA, author = {Janzing, D. and Wocjan, P. and Beth, T.}, title = {``{N}on-{I}dentity check'' is {QMA}-complete}, journal = {Int. Journ. Quant. Inf.}, year = {2005}, OPTkey = {}, volume = {3}, number=3, pages = {463--473}, OPTmonth = {}, doi = {10.1142/S0219749905001067}, url = {http://www.worldscinet.com/ijqi/03/0303/S0219749905001067.html}, OPTannote = {} } @Article{Freedman, author = {Freedman, M. and Kitaev, A. and Wang, Z.}, title = {Simulation of topological field theories by quantum computers}, journal = {Comm. Math. Phys.}, volume = {227}, number = {3}, year = {2002}, pages = {587--603}, eprint="springer:btldwt3g5t0308da" } @Unpublished{Landau, author = {Aharonov, D. and Jones, V. and Landau, Z.}, title = {A Polynomial Quantum Algorithm for Approximating the {Jones} Polynomial}, year = {2005}, eprint= {arxiv:quant-ph/0511096} } @TechReport{goldreich:promise, author = {Goldreich, O.}, title = {On promise problems}, institution = {Electr. Colloquium Computational Complexity}, year = {2005}, OPTkey = {}, OPTvolume = {}, number = {18}, OPTpages = {}, OPTmonth = {}, url = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-018/index.html}, OPTannote = {}, eprint="eccc:TR05-018" } @STRING{siam = "SIAM Journal of Computing"} @STRING{comb = "Combinatorica"} @STRING{mst = "Mathematical Systems Theory"} @INPROCEEDINGS{bhp, AUTHOR = {Fahiem Bacchus and Philipp Hertel and Toniann Pitassi}, TITLE = {The Complexity of Resolution with Caching}, NOTE = {Unpublished manuscript}, Year = {2006} } @INPROCEEDINGS{beapit96b, AUTHOR = {Paul Beame and Toniann Pitassi}, TITLE = {Simplified and Improved Resolution Lower Bounds}, YEAR = {1996}, BOOKTITLE = {Proc.\ 37th FOCS}, publisher = {IEEE Comp. Soc. Press}, pages="274--282", eprint="focs:10.1109/SFCS.1996.548486" } @UNPUBLISHED{benimpwig00, AUTHOR = {Eli Ben-Sasson and Russell Impagliazzo and Avi Wigderson}, TITLE = {Near-Optimal Separation of Tree-like and General Resolution}, NOTE = {ECCC TR00-005}, YEAR = {2000}, eprint="eccc:TR00-005" } @INPROCEEDINGS{bg99, AUTHOR = {M. Bonet and N. Galesi}, TITLE = {A Study of Proof Search Algorithms for Resolution and Polynomial Calculus}, YEAR = {1999}, PAGES = {422--432}, BOOKTITLE = {Proc.\ 40th FOCS}, publisher = {IEEE Comp. Soc. Press}, eprint="focs:10.1109/SFFCS.1999.814614" } @ARTICLE{bonestgaljoh00, AUTHOR = {Maria Luisa Bonet and Juan Luis Esteban and Nicola Galesi and Jan Johannsen}, TITLE = {On the Relative Complexity of Resolution Restrictions and Cutting Planes Proof Systems}, JOURNAL = siam, VOLUME = {30}, YEAR = {2000}, PAGES = {1462--1484}, eprint="sicomp:10.1137/S0097539799352474" } @INPROCEEDINGS{burcleimppit00, AUTHOR = {Buresh-Oppenheim, Joshua and Clegg, Matthew and Impagliazzo, Russell and Pitassi, Toniann}, TITLE = {Homogenization and the Polynomial Calculus}, BOOKTITLE = {Proc. 27th International Colloquium on Automata, Languages and Programming}, PAGES = {926--937}, YEAR = {2000}, PUBLISHER = {Springer}, eprint="icalp:fvxybba423y153b8" } @ARTICLE{cpt77, AUTHOR = {Celoni, James and Paul, Wolfgang and Tarjan, Robert}, TITLE = {Space Bounds for a Game on Graphs}, JOURNAL = mst, VOLUME = {10}, YEAR = {1977}, PAGES = {239--251}, eprint="springer:u32u2r202jv33611" } @ARTICLE{cook76, AUTHOR = {Stephen A.~Cook}, TITLE = {A short proof of the pigeon hole principle using extended resolution}, YEAR = {1976}, JOURNAL = {SIGACT News}, VOLUME = {8}, number=4, PAGES = {28--32}, eprint="sigact:10.1145/1008335.1008338" } @ARTICLE{cr79, AUTHOR = {Stephen A.~Cook and Robert A.~Reckhow}, TITLE = {The relative efficiency of propositional proof systems}, JOURNAL = {Journal of Symbolic Logic} , VOLUME = 6, PAGES = "169--184", YEAR = 1979 } @article{dll62, author = "Martin Davis and George Logemann and Donald Loveland", title = "A Machine Program for Theorem Proving", journal = "Communications of the Association for Computing Machinery", volume = 5, pages = "394--397", year = 1962, eprint="acm:10.1145/368273.368557" } @ARTICLE{beame-kautz, AUTHOR = "Paul Beame and Henry Kautz and Ashish Sabharwal", TITLE = "Towards understanding and harnessing the potential of clause learning", JOURNAL = {Journal of Artifical Intelligence Research}, VOLUME = 22, YEAR = 2004, pages="319--351", url="http://www.jair.org/papers/paper1410.html" } @ARTICLE{g92, AUTHOR = {Andreas Goerdt}, TITLE = {Davis-{P}utnam Resolution versus Unrestricted Resolution}, JOURNAL= {Annals of Mathematics and Artificial Intelligence} , VOLUME = 6, PAGES = "169--184", YEAR = 1992, eprint="springer:k008110v05867897" } @ARTICLE{goe93, AUTHOR = {Andreas Goerdt}, TITLE = {Regular Resolution versus Unrestricted Resolution}, JOURNAL = siam, PAGES = {661--683}, VOLUME = {22}, YEAR = {1993}, eprint="sicomp:10.1137/0222044" } @article{hak85, author = "Armin Haken", title = "The intractability of resolution", journal = "Theoretical Computer Science", volume = 39, year = 1985, pages = "297--308", eprint="tcs:10.1016/0304-3975(85)90144-6"} @ARTICLE{huang87, AUTHOR = {Wenqi Huang and Xiangdong Yu}, TITLE = {A {DNF} without regular shortest consensus path}, JOURNAL = "SIAM Journal on Computing", VOLUME = {16}, YEAR = {1987}, PAGES = {836--840}, eprint="sicomp:10.1137/0216054" } @book{kraj95, author = "Jan {Kraj\'{\i}\v{c}ek}", title = "Bounded Arithmetic, Propositional Logic and Complexity Theory", publisher = "Cambridge University Press", year = 1995} @ARTICLE{krish85, AUTHOR = "Balakrishnan Krishnamurthy", TITLE = "Short proofs for tricky formulas", JOURNAL = "Acta Informatica", VOLUME = 22, PAGES = "253--274", YEAR = 1985, eprint="actainf:mp65776636126242" } @mastersthesis{nadel, AUTHOR = {Alexander Nadel}, TITLE = {Backtrack search algorithms for propositional logic satisfiability: Review and innovations}, SCHOOL = {Hebrew University}, YEAR = 2002 } @INPROCEEDINGS{minisat, AUTHOR = {Niklas Een and Niklas {S\"{o}rensson}}, TITLE = {An extensible {SAT}-solver}, BOOKTITLE = {Proc.\ 6th International Conference on Theory and Applications of Satisfiability Testing}, pages="502--518", YEAR = 2003, publisher = {Springer}, eprint="springer:x9uavq4vpvqntt23" } @INPROCEEDINGS{zchaff, AUTHOR = {Matthew Moskewicz and Conor Madigan and Ying Zhao and Lintao Zhang and Sharad Malik}, TITLE = {Chaff: Engineering an Efficient {SAT} Solver}, BOOKTITLE = {Proc.\ 38th Design Automation Conference}, YEAR = 2001, pages="530--535", publisher = {ACM Press}, eprint="acm:10.1145/378239.379017" } @ARTICLE{razmck99, AUTHOR = {Ran Raz and Pierre McKenzie}, TITLE = {Separation of the Monotone {NC} Hierarchy}, JOURNAL = comb, VOLUME = {19}, YEAR = {1999}, PAGES = {403--435}, NOTE = {Preliminary Version in: {\em Proc.\ 38th FOCS}, 1997}, eprint="springer:h4prxbwxpn1c8xqh" } @article{stalmarck96, author = "Gunnar {St\r{a}lmarck}", title = "Short resolution proofs for a sequence of tricky formulas", journal = "Acta Informatica", volume = 33, pages = "277--280", year = 1996, eprint="actainf:lhrhe2glkmgflbu1"} @book{sw, editor = "{J{\"o}rg }Siekmann and Graham Wrightson", title = "Automation of Reasoning", publisher = "Springer-Verlag", address = "New York", year = 1983} @article{urq95, author = "Alasdair Urquhart", title = "The complexity of propositional proofs", journal = "The Bulletin of Symbolic Logic", volume = 1, pages = "425--467", year = 1995} @incollection{ts70, author = "G. S. Tseitin", booktitle = "Studies in Constructive Mathematics and Mathematical Logic, Part 2", publisher = "Consultants Bureau", address = "New York", title = "On the complexity of derivation in propositional calculus", editor = "A. O. Slisenko", pages = "115--125", year = 1970 } @string{focs89="Proc.30th FOCS"} @string{focs99="Proc. 40th FOCS"} @string{focs00="Proc. 41st FOCS"} @string{focs01="Proc. 42nd FOCS"} @string{focs02="Proc. 43rd FOCS"} @string{focs04="Proc. 45th FOCS"} @string{focs05="Proc. 46th FOCS"} @string{stoc87="Proc. 19th STOC"} @string{stoc94="Proc. 26th STOC"} @string{stoc00="Proc. 32nd STOC"} @string{stoc05="Proc. 37th STOC"} @string{random06="Proc. 10th Intern. Workshop on Randomization and Computation (RANDOM)"} @string{crypto02="Proc. 22nd Annual Intern. Cryptology Conf. (CRYPTO)"} @string{crypto03="Proc. 23rd Annual Intern. Cryptology Conf. (CRYPTO)"} @string{algor = "Algorithmica"} @string{camb = "Cambridge University Press"} @string{comb = "Combinatorica"} @string{complex = "Computational Complexity"} @string{cpc = "Combinatorics, Probability, and Computing"} @string{dm = "Discrete Mathematics"} @string{ieeeit = "IEEE Transactions on Information Theory"} @string{jcss = "Journal of Computer and System Sciences"} @string{rsa = "Random Structures and Algorithms"} @article{afwz, author = "N. Alon and U. Feige and A. Wigderson and D. Zuckerman", title = "Derandomized Graph Products", journal = complex, year = "1995", volume = "5", pages = "60--75", eprint="springer:r591795p150lj86q"} @inproceedings{aks:space, author = "M. Ajtai and J. Koml\'{o}s and E. Szemer\'{e}di", title = {Deterministic simulation in {LOGSPACE}}, booktitle = stoc87, year = "1987", pages = "132--140", eprint="stoc:28395.28410"} @Article{almss, author = "S. Arora and C. Lund and R. Motwani and M. Sudan and M. Szegedy", title = "Proof Verification and the Hardness of Approximation Problems", journal = jacm, volume = "45", pages = "501--555", year = "1998", eprint="jacm:278298.278306"} @inproceedings{biw, author = "B. Barak and R. Impagliazzo and A. Wigderson", title = "Extracting Randomness Using Few Independent Sources", booktitle=focs04, year = "2004", pages = "384--393", eprint="focs:10.1109/FOCS.2004.29"} @inproceedings{bkssw, author = "B. Barak and G. Kindler and R. Shaltiel and B. Sudakov and A. Wigderson", title = "Simulating Independence: New Constructions of Condensers, {R}amsey Graphs, Dispersers, and Extractors", booktitle=stoc05, year = "2005", pages = "1--10", eprint="stoc:1060590.1060592"} @article{bgs, author = "M. Bellare and O. Goldreich and M. Sudan", title = "Free Bits, {PCP}s, and Nonapproximability --- Towards Tight Results", journal = sicomp, volume = "27", number = "3", year = "1998", pages = "804--915", eprint="sicomp:10.1137/S0097539796302531"} @InProceedings{BelS, title={Improved Non-Approximability Results}, author={M. Bellare and M. Sudan}, pages={184--193}, booktitle = stoc94, year = "1994", eprint="stoc:195058.195129"} @article{BopH, author = "R. Boppana and M. Halldorsson", title = "Approximating Maximum Independent Sets by Excluding Subgraphs", journal = "Bit", volume = "32", pages = "180--196", year = "1992"} @article{Bou:more, author = "J. Bourgain", title = "More on the Sum-Product Phenomenon in Prime Fields and its Applications", journal = "International Journal of Number Theory", year = "2005", volume = "1", pages = "1--32", eprint="worldsci:10.1142/S1793042105000108"} @article{bgk, author= "J.~Bourgain and A.~Glibichuk and S.~Konyagin", title= "Estimates for the number of sums and products and for exponential sums in fields of prime order", journal="Journal of the London Mathematical Society", volume ="73", pages= "380--398", year= "2006", eprint="cambridge:10.1112/S0024610706022721"} @article{bkt, author = "J. Bourgain and N. Katz and T. Tao", title = "A Sum-Product Estimate in Finite Fields, and Applications", journal = "Geometric and Functional Analysis", year = "2004", volume = "14", pages = "27--57", eprint="springer:s00039-004-0451-1"} @inproceedings{cdhks, author = "R. Canetti and Y. Dodis and S. Halevi and E. Kushilevitz and A. Sahai", title = "Exposure-Resilient Functions and All-or-Nothing Transforms", editor = {Bart Preneel}, booktitle = {Proc. Intern. Conf. on the Theory and Application of Cryptographic Techniques (EUROCRYPT)}, series = "Lecture Notes in Computer Science", volume = "1807", pages = "453--469", year = "2000", month = May, publisher = {Springer-Verlag}, eprint="springer:mfkb4le6cayk9npb"} @article{cg:weak, author = "B. Chor and O. Goldreich", title = "Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity", journal = sicomp, volume = "17", number = "2", pages = "230--261", year = "1988", eprint="sicomp:10.1137/0217015"} @inproceedings{CohW, author = "A. Cohen and A. Wigderson", title = "Dispersers, Deterministic Amplification, and Weak Random Sources", booktitle = focs89, year = "1989", pages = "14--19"} @article{Din, author= "I.H. Dinwoodie", title= "A Probability Inequality for the Occupation Measure of a Reversible Markov Chain", journal="Annals of Applied Probability", year= "1995", volume= "5", pages= "37--43"} @inproceedings{DodS, author = "Y. Dodis and J. Spencer", title = "On the (non)Universality of the One-Time Pad", booktitle = focs02, year = "2002", pages = "376--385", eprint="focs:10.1109/SFCS.2002.1181962"} @techreport{DviR, author = "Z. Dvir and R. Raz", title = {Analyzing Linear Mergers}, institution = {Electronic Colloquium on Computational Complexity}, number = {TR05-025}, year = "2005", eprint="eccc:TR05-025"} @article{EngH, author = "L. Engebretsen and J. Holmerin", title = "Towards Optimal Lower Bounds for Clique and Chromatic Number", journal = tcs, volume = "299", year = "2003", pages = "537--584", eprint="tcs:10.1016/S0304-3975(02)00535-2"} @article{f:theta, author = "U. Feige", title = "Randomized Graph Products, Chromatic Numbers, and the {L}ovasz $\theta$ Function", journal = comb, volume = "17", pages = "79--90", year = "1997", eprint="springer:x785787h43724566"} @article{fglss, author ="U. Feige and S. Goldwasser and L. Lovasz and S. Safra and M. Szegedy", title ="Interactive Proofs and the Hardness of Approximating Cliques", journal =jacm, volume ="43", year ="1996", pages ="268--292", eprint="jacm:226643.226652"} @article{fk, author ="U. Feige and J. Kilian", title ="Zero Knowledge and the Chromatic Number", journal =jcss, volume ="57", year ="1998", pages ="187--199", eprint="jcss:10.1006/jcss.1998.1587"} @article{FiaN, author = "A. Fiat and M. Naor", title = "Implicit {$O(1)$} Probe Search", journal = sicomp, volume = "22", year = "1993", pages = "1--10", eprint="sicomp:10.1137/0222001"} @article{GabG, author = {O. Gabber and Z. Galil}, title = "Explicit Construction of Linear Sized Superconcentrators", journal = jcss, volume = "22", year = "1981", pages = "407-420", eprint="jcss:10.1016/0022-0000(81)90040-4"} @article{Gil, author = "D. Gillman", title = "A {Chernoff} Bound for Random Walks on Expander Graphs", journal = sicomp, year = "1998", volume = "27", pages = "1203--1220", eprint="sicomp: 10.1137/S0097539794268765"} @techreport{Gol:sampler-survey, author = "O. Goldreich", title = {A Sample of Samplers -- A Computational Perspective on Sampling (survey)}, institution = {Electronic Colloquium on Computational Complexity}, number = {TR97-020}, year = "1997", eprint="eccc:TR97-020"} @techreport{GolZ, author = "O. Goldreich and D. Zuckerman", title = {Another Proof that {B}{P}{P} $\subseteq$ {P}{H} (and more)}, institution = {Electronic Colloquium on Computational Complexity}, number = {TR97-045}, year = "1997", eprint="eccc:TR97-045"} @unpublished{Gre:sumprod, author = "B. Green", title = {Sum-Product Estimates}, note = {Unpublished lecture notes. Available at author's website}, year = {2005} } @article{Hal, author = "M. Halldorsson", title = "A Still Better Performance Guarantee for Approximate Graph Coloring", journal = ipl, volume = "45", pages = "19--23", year = "1993", eprint="ipl:10.1016/0020-0190(93)90246-6"} @article{Has:clique, author = "J. H{\aa}stad", title = "Clique is Hard to Approximate within $n^{1-\epsilon}$", journal = "Acta Mathematica", volume = "182", year = "1999", pages = "105--142", eprint="springer:m68h3576646ll648"} @inproceedings{HasK, author= "J. Hastad and S. Khot", title= "Query Efficient {PCP}s with Perfect Completeness", booktitle=focs01, year= "2001", pages= "610--619", eprint="focs:10.1109/SFCS.2001.959937"} @inproceedings{Hea, author= "A. Healy", title= "Randomness-Efficient Sampling within ${NC}^1$", booktitle=random06, year= 2006, pages="398--409", eprint="springer:b773545612310728"} @article{hlw, author= "S. Hoory and N. Linial and A. Wigderson", title= "Expander Graphs and Their Applications", journal="Bulletin of the American Mathematical Society", volume= "43", year= "2006", pages= "439--561", url="http://www.ams.org/bull/2006-43-04/S0273-0979-06-01126-8/"} @inproceedings{iz, author = "R. Impagliazzo and D. Zuckerman", title = "How to Recycle Random Bits", booktitle = focs89, year = "1989", pages = "248--253"} @article{Kah, author = "N. Kahale", title = "Eigenvalues and Expansion of Regular Graphs", journal = jacm, volume = "42", year = "1995", pages = "1091--1106", eprint="jacm:210118.210136"} @article{Kah:deviation, author = "N. Kahale", title = "Large Deviation Bounds for {M}arkov Chains", journal = cpc, volume = "6", year = "1997", pages = "465--474", eprint="cambridge:10.1017/S0963548397003209"} @InCollection{Karp:reduce, author = "R. M. Karp", title = "Reducibility Among Combinatorial Problems", booktitle = "Complexity of Computer Computations", publisher = "Plenum Press", year = 1972, editor = "R. E. Miller and J. W. Thatcher", pages = "85--103", address = "New York"} @techreport{KatS, author = "N. Katz and C.-Y. Shen", title = "Garaev's Inequality in Finite Fields Not of Prime Order", institution="Arxiv", year = "2007", eprint="arxiv:math.NT/0703676"} @inproceedings{Khot:clique, author = "S. Khot", title = "Improved Inapproximability Results for {MaxClique}, {Chromatic Number} and {Approximate Graph Coloring}", booktitle = focs01, year = "2001", pages = "600--609", eprint="focs:10.1109/SFCS.2001.959936"} @article{Lov:fractional, author = "L. Lovasz", title = "On the Ratio of the Optimal Integral and Fractional Covers", journal = dm, volume = "13", year = "1975", pages = "383--390"} @article{lps, author = "A. Lubotzky and R. Philips and P. Sarnak", title = "Ramanujan Graphs", journal = comb, volume = "8", year = "1988", pages = "261--277", eprint="springer:k285687344657q53"} @inproceedings{lu:crypto, author="C.-J. Lu", title = "Hyper-Encryption Against Space-Bounded Adversaries from On-Line Strong Extractors", booktitle = crypto02, year = "2002", pages="257--271", eprint="springer:c0hllvfbl0f3fgr5"} @article{ly, author = {C. Lund and M. Yannakakis}, title = {On the Hardness of Approximating Minimization Problems}, journal = jacm, year = {1994}, volume = {41}, pages = {960--981}, eprint="jacm:185675.306789"} @article{Mar:Ramanujan, author = "G.A. Margulis", title = "Explicit Group Theoretical Constructions of Combinatorial Schemes and Their Application to the Design of Expanders and Superconcentrators", journal = "Problems of Information Transmission", volume = "24", pages = "39--46", year = "1988"} @article{Mor:Ramanujan, author= "M. Morgenstern", title= "Existence and Explicit Constructions of $q+1$ Regular {R}amanujan Graphs for Every Prime Power $q$", journal="Journal of Combinatorial Theory, Series B", volume= "62", year= "1994", pages= "44--62", eprint="elsevier:10.1006/jctb.1994.1054"} @article{MosU, author = "E. Mossel and C. Umans", title = "On the Complexity of Approximating the {VC} Dimension", journal = jcss, pages = "660--671", volume = "65", year = "2002", eprint="jcss:10.1016/S0022-0000(02)00022-3"} @Article{nt, author = "N. Nisan and A. {Ta-S}hma", title = "Extracting Randomness: {A} Survey and New Constructions", journal = jcss, volume = "58", year = "1999", pages = "148--173", eprint="jcss:10.1006/jcss.1997.1546"} @article{nz, author = "N. Nisan and D. Zuckerman", title = "Randomness is Linear in Space", journal = jcss, volume = "52", number = "1", year = "1996", pages = "43--52", eprint="jcss:10.1006/jcss.1996.0004"} @Article{Pip, author = "N. Pippenger", title = "Sorting and Selecting in Rounds", journal = sicomp, volume = "16", number = "6", pages = "1032--1038", month = dec, year = "1987", eprint="sicomp:10.1137/0216066"} @inproceedings{Raz:extract, author = "R. Raz", title = {Extractors with Weak Random Seeds}, booktitle = stoc05, year = "2005", pages = "11--20", eprint="stoc:1060590.1060593"} @InProceedings{rsw, author = {O. Reingold and R. Shaltiel and A. Wigderson}, title = {Extracting Randomness via Repeated Condensing}, booktitle = focs00, year = "2000", pages = "22--31", eprint="focs:10.1109/SFCS.2000.892008"} @article{rz, author = "A. Russell and D. Zuckerman", title = "Perfect-Information Leader Election in $\log^* n + {O}(1)$ Rounds", journal = jcss, volume = "63", year = "2001", pages = "612--626", eprint="jcss:10.1006/jcss.2001.1776"} @inproceedings{SamT, author= "A. Samorodnitsky and L. Trevisan", title= "A {PCP} Characterization of {NP} with Optimal Amortized Query Complexity", booktitle=stoc00, year= "2000", pages= "191--199", eprint="stoc:335305.335329"} @article{Sha:survey, author= "R. Shaltiel", title= "Recent Developments in Explicit Constructions of Extractors", journal="Bulletin of the European Association for Theoretical Computer Science", volume= "77", year= "2002", month= "June", pages= "67--95", url="www.cs.haifa.ac.il/~ronen/online_papers/survey.ps"} @article{Sip, author = {M. Sipser}, title = {Expanders, Randomness, or Time versus Space}, journal = jcss, volume = 36, year = {1988}, pages = "379--383", eprint="jcss:10.1016/0022-0000(88)90035-9"} @book{tv-book, author= "T. Tao and V. Vu", title= "Additive Combinatorics", publisher=camb, year= "2006"} @article{tuz, author = "A. {Ta-S}hma and C. Umans and D. Zuckerman", title = "Lossless Condensers, Unbalanced Expanders, and Extractors", journal = comb, volume = "27", year = "2007", pages = "213--240", eprint="springer:y86m43u236782602"} @article{tz:code, author = "A. {Ta-S}hma and D. Zuckerman", title = "Extractor Codes", journal=ieeeit, volume="50", year="2004", pages="3015--3025", eprint="ieee:10.1109/TIT.2004.838377"} @article{tzs, author = "A. {Ta-S}hma and D. Zuckerman and S. Safra", title = "Extractors from {R}eed-{M}uller Codes", journal = jcss, year = "2006", volume=72, pages = "786--812", eprint="jcss:10.1016/j.jcss.2005.05.010"} @inproceedings{U:unapprox, author="C. Umans", title="Hardness of Approximating {$\Sigma_2^p$} Minimization Problems", booktitle=focs99, year="1999", pages = "465--474", eprint="focs:10.1109/SFFCS.1999.814619"} @inproceedings{v:local, author = {S. Vadhan}, title = {On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model}, year = "2003", booktitle = crypto03, pages="61--77", eprint="springer:c169t5w8lmdy6dka"} @inproceedings{wx, author= "A. Wigderson and D. Xiao", title = "A Randomness-Efficient Sampler for Matrix-Valued Functions and Applications", booktitle=focs05, year = "2005", pages="397--406", eprint="focs:10.1109/SFCS.2005.8"} @article{wz, author = "A. Wigderson and D. Zuckerman", title = "Expanders that Beat the Eigenvalue Bound: Explicit Construction and Applications", journal = comb, volume = "19", number = "1", year = "1999", pages = "125--138", eprint="springer:wcjlnyjmdxf30b9x"} @article{Zbpp, author = "D. Zuckerman", title = "Simulating {BPP} Using a General Weak Random Source", journal = algor, volume = "16", year = "1996", pages = "367--391", eprint="algorithmica:kx95d4u1jvyxh882"} @article{Zsamp, author = "D. Zuckerman", title = "Randomness-Optimal Oblivious Sampling", journal = rsa, volume = "11", pages = "345--367", year = "1997", eprint="wiley:10.1002/(SICI)1098-2418(199712)11:4<345::AID-RSA4>3.0.CO;2-Z"} @phdthesis{Zthesis, Author = "D. Zuckerman", Title = "Computing Efficiently Using General Weak Random Sources", school = {University of California at Berkeley}, Year = "1991"} %% ToC#254.bib as of Aug 31, 2007 %% history: %% ToC#254: BibTeX entries 6 Mar 2007 edited by David Bunde %% small modifications 23 Aug 2007 by LB %% new items added by au/LB 31 Aug 2007 @string(jacm="J. ACM") @string(toc="Theory of Computing") @string(ipl="Inform. Proc. Lett.") @string(sicomp="SIAM J. Computing") @unpublished{aar:copy, author = {S. Aaronson}, title = {Quantum copy-protection}, note = {In preparation} } @article{aar:adv, author = {S. Aaronson}, title = {Limitations of quantum advice and one-way communication}, journal = toc, volume = {1}, pages = {1--28}, year = {2005}, note = {quant-ph/0402095. Conference version in Proc. of CCC'2004}, eprint="toc:v001/a001,arxiv:quant-ph/0402095" } @unpublished{an, author = {D. Aharonov and T. Naveh}, title = {Quantum {NP} - a survey}, year = {2002}, note = {quant-ph/0210077}, eprint="arxiv:quant-ph/0210077" } @inproceedings{babai:am2, author = {L. Babai}, title = {Trading group theory for randomness}, booktitle ="Proc. 17th STOC", pages = {421--429}, year = {1985}, eprint="stoc:10.1145/22145.22192" } @inproceedings{babai:walk, author = {L. Babai}, title = {Local expansion of vertex-transitive graphs and random generation in finite groups}, booktitle ="Proc. 23rd STOC", pages = {164--174}, year = {1991}, eprint="stoc:10.1145/103418.103440" } @article{babai:am, author = {L. Babai}, title = {Bounded round interactive proofs in finite groups}, journal = {SIAM J. Discrete Math}, volume = {5}, number = {1}, pages = {88--111}, year = {1992}, eprint="sidma:10.1137/0405008" } @ARTICLE{bgklp, AUTHOR = "L. Babai and A. J. Goodman and W. M. Kantor and E.~M. Luks and P.~P. P{\'a}lfy", TITLE = "Short presentations for finite groups", JOURNAL = "J. Algebra", YEAR = "1997", volume = "194", pages = "79--112", eprint="elsevier:10.1006/jabr.1996.6980 " } @article{be, author = {L. Babai and P. Erd\H{o}s}, title = {Representation of group elements as short products}, journal = {Annals of Discrete Math.}, volume = {12}, pages = {27--30}, year = {1982} } @inproceedings{bls, author = {L. Babai and E. M. Luks and \'A. Seress}, title = {Permutation groups in {NC}}, booktitle ="Proc. 19th STOC", pages = {409--420}, year = {1987}, eprint="stoc:10.1145/28395.28439" } @inproceedings{bs:matrix, author = {L. Babai and E. Szemer\'{e}di}, title = {On the complexity of matrix group problems {I}}, booktitle = "Proc. 25th FOCS", pages = {229--240}, year = {1984} } @inproceedings{bclr, author = {M. Ben-Or and D. Coppersmith and M. Luby and R. Rubinfeld}, title = {Non-abelian homomorphism testing, and distributions close to their self-convolutions}, booktitle = {Proc. of 8th Intern. Workshop on Randomization and Computation (RANDOM'04)}, publisher = {Springer-Verlag}, pages = {273--285}, year = {2004}, note = {ECCC TR04-052}, eprint="springer:x1tlgm3cexcj" } @article{bbbv, author = {C. Bennett and E. Bernstein and G. Brassard and U. Vazirani}, title = {Strengths and weaknesses of quantum computing}, journal = sicomp, volume = {26}, number = {5}, pages = {1510--1523}, year = {1997}, note = {quant-ph/9701001}, eprint="sicomp:10.1137/S0097539796300933,arxiv:quant-ph/9701001" } @incollection{boroczky, author = {B\"{o}r\"{o}czky Jr., K. and G. Wintsche}, title = {Covering the sphere by equal spherical balls}, booktitle = {Discrete and Computational Geometry: The Goodman-Pollack Festschrift}, publisher="Springer", pages = {237--253}, year = {2003} } @incollection{bhmt, author = {G. Brassard and P. H{\o}yer and M. Mosca and A. Tapp}, title = {Quantum amplitude amplification and estimation}, booktitle = {Quantum Computation and Information}, series = {Contemporary Mathematics Series}, publisher = {AMS}, editor = {S. J. Lomonaco and H. E. Brandt}, year = {2002}, note = {quant-ph/0005055}, eprint="arxiv:quant-ph/0005055" } @book{atlas, author = {J. H. Conway and R. T. Curtis and S. P. Norton and R. A. Parker and R. A. Wilson}, title = {Atlas of Finite Groups}, publisher = {Clarendon Press, Oxford}, year = {1985} } @article{ehk, author = {M. Ettinger and P. H{\o}yer and E. Knill}, title = {The quantum query complexity of the hidden subgroup problem is polynomial}, journal = ipl, volume = {91}, number = {1}, pages = {43--48}, year = {2004}, note = {quant-ph/0401083}, eprint="ipl:10.1016/j.ipl.2004.01.024,arxiv:quant-ph/0401083" } @inproceedings{grover:framework, author = {L. K. Grover}, title = {A framework for fast quantum mechanical algorithms}, booktitle ="Proc. 30th STOC", pages = {53--62}, year = {1998}, note = {quant-ph/9711043}, eprint="stoc:10.1145/276698.276712,arxiv:quant-ph/9711043" } @article{hrt, author = {S. Hallgren and A. Russell and A. Ta-Shma}, title = {The hidden subgroup problem and quantum computation using group representations}, journal = sicomp, volume = {32}, number = {4}, pages = {916--934}, year = {2003}, note = {Conference version in STOC'2000, p. 627-635.}, eprint="sicomp:10.1137/S009753970139450X" } @misc{hofling, author = {B. H\"{o}fling}, title = {Efficient multiplication algorithms for finite polycyclic groups}, year = {2007}, note = {Submitted. \url{www-public.tu-bs.de/~bhoeflin/preprints/collect.pdf}} } @article{hulpke-seress, author = "A. Hulpke and \'{A}. Seress", title = "Short presentations for three-dimensional unitary groups", journal = "J. Algebra", volume = "245", pages = "719--729", year = "2001", eprint = "elsevier:10.1006/jabr.2001.8943", } @article{kkr, author = {J. Kempe and A. Kitaev and O. Regev}, title = {The complexity of the {L}ocal {H}amiltonian problem}, journal = sicomp, volume = {35}, number = {5}, pages = {1070--1097}, year = {2006}, note = {quant-ph/0406180}, eprint="sicomp:10.1137/S0097539704445226,arxiv:quant-ph/0406180" } @unpublished{kitaev:meas, author = {A. Kitaev}, title = {Quantum measurements and the abelian stabilizer problem}, year = {1996}, note = {ECCC TR96-003, quant-ph/9511026}, eprint="arxiv:quant-ph/9511026" } @article{kitaev:ec, author = {A. Kitaev}, title = {Quantum computation: algorithms and error correction}, journal = {Russian Math. Surveys}, volume = {52}, number = {6}, pages = {1191--1249}, year = {1997} } @article{mw, author = {C. Marriott and J. Watrous}, title = {Quantum {A}rthur-{M}erlin games}, journal = {Computational Complexity}, volume = {14}, number = {2}, pages = {122--152}, year = {2005}, eprint="cc:h0521k6666871652" } @inproceedings{mrr, author = {C. Moore and D. N. Rockmore and A. Russell}, title = {Generic quantum {F}ourier transforms}, booktitle ="Proc. 15th Ann. ACM-SIAM Symp. on Discrete Algorithms", pages = {778--787}, year = {2004}, note = {quant-ph/0304064}, eprint="soda:982792.982910,arxiv:quant-ph/0304064" } @unpublished{moscastebila, author = {M. Mosca and D. Stebila}, title = {Unforgeable quantum money}, year = {2006}, note = {In preparation} } @article{neumann, author = {P. M. Neumann}, title = {An enumeration theorem for finite groups}, journal = {Quart. J. Math. Ser.}, volume = {2}, number = {20}, pages = {395--401}, year = {1969} } @article{pyber, author = {L. Pyber}, title = {Enumerating finite groups of given order}, journal = {Annals of Mathematics}, volume = {137}, pages = {203--220}, year = {1993} } @inproceedings{razshpilka, author = {R. Raz and A. Shpilka}, title = {On the power of quantum proofs}, booktitle ="Proc. 19th Ann. IEEE Conf. on Computational Complexity", pages = {260--274}, year = {2004}, eprint="ccc:10.1109/CCC.2004.1313849" } @article{shamir, author = {A. Shamir}, title = {{IP=PSPACE}}, journal = jacm, volume = {39}, number = {4}, pages = {869--877}, year = {1992}, eprint="jacm:10.1145/146585.146609" } @article{shor, author = {P. Shor}, title = {Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer}, journal = sicomp, volume = {26}, number = {5}, pages = {1484--1509}, year = {1997}, note = {Earlier version in IEEE FOCS 1994. quant-ph/9508027}, eprint="sicomp:10.1137/S0097539795293172,arxiv:quant-ph/9508027" } @incollection{sims, author = {C. Sims}, title = {Computational methods in the study of permutation groups}, booktitle = {Computational Problems in Abstract Algebra}, pages = {169--183}, publisher = {Pergamon Press}, year = {1970} } @inproceedings{watrous, author = {J. Watrous}, title = {Succinct quantum proofs for properties of finite groups}, booktitle ="Proc. 41st FOCS", pages = {537--546}, year = {2000}, note = {cs.CC/0009002}, eprint="focs:10.1109/SFCS.2000.892141" } %% ToC#295.bib ToC 3/8 Matousek - Skovron 2007-09-26 @inproceedings{lptouso, author = "B. G{\"a}rtner and I. Schurr", title = "Linear Programming and Unique Sink Orientations", booktitle = "Proc. 17th Ann. Symp. on Discrete Algorithms (SODA'06)", year = "2006", pages = "749--757", publisher="ACM Press", eprint="soda:1109557.1109639"} @inproceedings{SS, author = "I. Schurr and T. Szab\'o", title = "Jumping doesn't help in abstract cubes", booktitle = "Proc. 11th Conf. on Integer Programming and Combinatorial Optimization (IPCO'05)", series = "Lecture Notes in Computer Science", publisher = "Springer-Verlag", volume="3509", year = "2005", pages ="225--235", eprint="springer:jv4nn8d0qukbbnke"} @inproceedings{MS, author = "J. Matou\v{s}ek and T. Szab\'o", title = "{R}andom {E}dge can be exponential on abstract cubes", booktitle = "Proc. 45th FOCS", year = "2004", publisher = "IEEE Comp. Soc. Press", pages = "92--100", eprint="focs:10.1109/FOCS.2004.56"} @inproceedings{SW, author = "T. Szab\'o and E. Welzl", title = "Unique sink orientations of cubes", booktitle = "Proc. 42nd FOCS", publisher = "IEEE Comp. Soc. Press", pages = "547--555", year = "2001", eprint="focs:10.1109/SFCS.2001.959931"} @inproceedings{grid_uso, author = "B. G{\"a}rtner and W.~D. Morris{, Jr.} and L. R{\"u}st", title = "Unique Sink Orientations of Grids", booktitle = "Proc. 11th Conf. on Integer Programming and Combinatorial Optimization (IPCO'05)", series = "Lecture Notes in Computer Science", publisher = "Springer-Verlag", volume = "3509", pages = "210--224", year = "2005", eprint="springer:xv16bkejxpgqlcyv"} @inproceedings{sw-cblpr-92, author = "M. Sharir and E. Welzl", title = "A combinatorial bound for linear programming and related problems", booktitle = "Proc. 9th Symp. on Theoretical Aspects of Computer Science (STACS'92)", series = "Lecture Notes in Computer Science", publisher = "Springer-Verlag", volume = "577", pages = "569--579", year = "1992"} @inproceedings{k-srsa-92, author = "G. Kalai", title = "A subexponential randomized simplex algorithm", booktitle = "Proc. 24th STOC", publisher = "ACM Press", year = "1992", pages = "475--482", eprint="stoc:129712.129759"} @inproceedings{a-bbhdn-94, author = "N. Amenta", title = "Bounded boxes, {H}ausdorff distance, and a new proof of an interesting {H}elly-type theorem", booktitle = "Proc. 10th Ann. Symp. on Computational Geometry (SCG'94)", year = "1994", pages = "340--347", publisher = "ACM Press", eprint="acm:177424.178064"} @inproceedings{ChanTukey, author = "T. Chan", title = "An optimal randomized algorithm for maximum {T}ukey depth", booktitle = "Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA'04)", year = "2004", publisher = "SIAM", pages = "430--436", eprint="soda:982792.982853"} @inproceedings{gw-lpraf-96, author = "B. G{\"a}rtner and E. Welzl", title = "Linear Programming - Randomization and Abstract Frameworks", booktitle = "Proc. 13th Ann. Symp. on Theoretical Aspects of Computer Science (STACS'96)", year = "1996", pages = "669--687", publisher = "Springer-Verlag", address = "London, UK"} @article{a-httgl-94, author = "N. Amenta ", title = "{H}elly Theorems and Generalized Linear Programming", journal = "Discrete and Computational Geometry", year = "1994", pages = "241--261", volume = "12", eprint="springer:bx1262r145x60505"} @article{a-spiht-96, author = "N. Amenta", title = "A Short Proof of an Interesting {H}elly-Type Theorem", journal = "Discrete and Computational Geometry", volume = "15", pages = "423--427", year = "1996", eprint="springer:1fdgptcx3qfd4vm4"} @article{c-lvali-95, author = "K.~L. Clarkson", title = "{L}as {V}egas algorithms for linear and integer programming", journal = "Journal of the ACM", volume = "42", year = "1995", pages = "488--499", eprint="jacm:201019.201036"} @article{cm-ltdao-96, author = "B. Chazelle and J. Matou\v{s}ek", title = "On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension", journal = "Journal of Algorithms", volume = "21", year = "1996", pages = "579--597", eprint="elsevier:10.1006/jagm.1996.0060"} @article{m-gofvc-95, author = "J. Matou\v{s}ek", title = "On Geometric Optimization with Few Violated Constraints", journal = "Discrete and Computational Geometry", volume = "14", pages = "365--384", year = "1995", eprint="springer:r750741557886767"} @article{msw-sblp-92, author = "J. Matou\v{s}ek and M. Sharir and E. Welzl", title = "A subexponential bound for linear programming", journal = "Algorithmica", volume = "16", year = "1996", pages = "498--516", eprint="algorithmica:r378224736133416"} @article{GWSampl01, author = "B. G{\"a}rtner and E. Welzl", title = "A simple sampling lemma: {A}nalysis and applications in geometric optimization", journal = "Discrete and Computational Geometry", volume = "25", number = "4", pages = "569--590", year = "2001", eprint="springer:9flx12lr0mghtcc4"} @inproceedings{halmanfocs, author = "N. Halman", title = "On the Power of Discrete and of Lexicographic {H}elly-type Theorems", year = "2004", booktitle="Proc. 46th FOCS", publisher = "IEEE Comp. Soc. Press", pages="463--472", eprint="focs:10.1109/FOCS.2004.47"} @article{gmrs06, author = "B. G{\"a}rtner and J. Matou\v{s}ek and L. R{\"u}st and P. {\v{S}}kovro\v{n}", title = "Violator Spaces: Structure and Algorithms", journal="Discr. Appl. Math.", year = "2007", note ="In press. Also in arXiv cs.DM/0606087. Extended abstract in \emph{Proc. 14th Europ. Symp. Algorithms (ESA'06)}", eprint="arxiv:cs.DM/0606087"} @inproceedings{wds06, author = "P. {\v S}kovro{\v n}", title = "Removing degeneracies in {LP}-type problems may need to increase dimension", booktitle = "Proc.\ 15th Week of Doctoral Students (WDS)", publisher = "Matfyzpress, Prague", editor = "Jana {\v S}afr{\'a}nkov{\'a} and Ji{\v r}{\'\i} Pavl{\accent23 u}", year = "2006", pages = "I:196--207", pdf="http://www.mff.cuni.cz/veda/konference/wds/contents/pdf06/WDS06_135_i4_Skovron.pdf"} @phdthesis{SchurrThesis, author="I. Schurr", title="Unique sink orientations of cubes", school="ETH Z{\"u}rich, Nr. 15747", year=2004, note="Nr. 15747. Available at \url{http://e-collection.ethbib.ethz.ch}"} @phdthesis{FischerThesis, author="K. Fischer", title="Smallest enclosing balls of balls", school="ETH Z{\"u}rich, Nr. 16168", year=2005, note="Available at \url{http://e-collection.ethbib.ethz.ch}"} @inproceedings{bsv-dsapg-01, author="H. Bj{\"o}rklund and S. Sandberg and S. Vorobyov", title="A discrete subexponential algorithm for parity games", booktitle="Proc. 20th Ann. Symp. on Theoretical Aspects of Computer Science (STACS'03), Lect. Notes Comput. Sci. 2607", publisher="Springer-Verlag", pages="663--674", year="2003", eprint="springer:wpjqa08u8db47c3g"} @inproceedings{bms-dgc-94, author = "C. Burnikel and K. Mehlhorn and S. Schirra", title = "On degeneracy in geometric computations", booktitle = "Proc. 5th ACM-SIAM Symp. on Discrete Algorithms (SODA'94)", year ="1994", pages = "16--23", publisher="SIAM", eprint="soda:314464.314474"} @article{em-sstcd-90, author = "H. Edelsbrunner and E. P. M{\"u}cke", title = "Simulation of simplicity: {A} technique to cope with degenerate cases in geometric algorithms", journal = "ACM Transactions on Graphics", volume = "9", number = "1", year = "1990", pages = "66--104", eprint="acm:77635.77639"} @article{y-gctsp-90, author = "C. K. Yap", title = "A geometric consistency theorem for a symbolic perturbation scheme", journal = "Journal of Computer and System Sciences", volume = "40", number = "1", year = "1990", pages = "2--18", eprint="jcss:10.1016/0022-0000(90)90016-E"} @article{ec-gard-95, author = "I. Emiris and J. Canny", title = "A general approach to removing degeneracies", journal = "SIAM J. Computing", volume = "24", year = "1995", pages = "650--664", eprint="sicomp:10.1137/S0097539792235918"} %% ToC#298.bib Balcan - Blum ed LB 9-8 rev DB 9-23 au added, LB rev 9-25 %% ACR rev 10-3 @INPROCEEDINGS(AwerbuchKleinbergSTOC04, AUTHOR="B. Awerbuch and R. Kleinberg", TITLE="Adaptive Routing With End-to-End Feedback: {D}istributed Learning and Geometric Approaches", BOOKTITLE="Proc.~36th STOC", PUBLISHER="ACM Press", YEAR=2004, PAGES="45--53", eprint="stoc:1007352.1007367" ) @INPROCEEDINGS(BBCH-07, AUTHOR="M.-F. Balcan and A. Blum and H. Chan and M.T. Hajiaghayi", TITLE="A theory of loss-leaders: {M}aking money by pricing below cost", booktitle="Proc.~3rd Intern. Workshop on Internet and Network Economics", YEAR=2007, publisher ="Springer", series="Lecture Notes in Computer Science", ) @INPROCEEDINGS{bbhm-05, author = {M.-F. Balcan and A. Blum and J. Hartline and Y. Mansour}, title = "Mechanism Design via Machine Learning", BOOKTITLE = {Proc.~46th FOCS}, publisher = "IEEE Computer Soc.", year = 2005, pages="605--614", eprint="focs:10.1109/SFCS.2005.50" } @techreport(BBM-07, AUTHOR="M.-F. Balcan and A. Blum and Y. Mansour", TITLE="Single Price Mechanisms for Revenue Maximization in Unlimited Supply Combinatorial Auctions", institution="Carnegie Mellon University", number="CMU-CS-07-111", YEAR=2007, pdf="reports-archive.adm.cs.cmu.edu/anon/2007/CMUCS-07-111.pdf" ) @INPROCEEDINGS(BlumHartline, AUTHOR="A. Blum and J. Hartline", TITLE="Near-Optimal Online Auctions", BOOKTITLE="Proc.~16th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'05)", publisher = "SIAM", YEAR=2005, PAGES="1156--1163", eprint="soda:1070432.1070597" ) @INPROCEEDINGS(BKRW, AUTHOR="A. Blum and V. Kumar and A. Rudra and F. Wu", TITLE="Online Learning in Online Auctions", BOOKTITLE="Proc.~14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'03)", publisher = "SIAM", YEAR=2003, PAGES="202--204", eprint="soda:644108.644143" ) @INPROCEEDINGS(BB-07, AUTHOR=" P. Briest and P. Krysta", TITLE="Buying Cheap is Expensive: {H}ardness of Non-Parametric Multi-Product Pricing", BOOKTITLE="Proc.~18th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'07)", publisher = "SIAM", pages={716--725}, YEAR=2007, eprint="soda:1283383.1283460" ) @INPROCEEDINGS(BK-06, AUTHOR="P. Briest and P. Krysta", TITLE="Single-Minded Unlimited Supply Pricing on Sparse Instances", BOOKTITLE="Proc.~17th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'06)", publisher = "SIAM", YEAR=2006, PAGES= "1093--1102", eprint="soda:1109557.1109678" ) @INPROCEEDINGS(DaniHayesSODA06, AUTHOR="V. Dani and T. P. Hayes", TITLE="Robbing the Bandit: {L}ess Regret in Online Geometric Optimization Against an Adaptive Adversary", BOOKTITLE="Proc.~17th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'06)", publisher = "SIAM", YEAR=2006, PAGES="937--943", eprint="soda:1109557.1109660" ) @INPROCEEDINGS(DFHS-06, AUTHOR="E. D. Demaine and U. Feige and M. Hajiaghayi and M. R. Salavatipour", TITLE="Combination Can Be Hard: {A}pproximability of the Unique Coverage Problem", BOOKTITLE="Proc.~17th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'06)", publisher = "SIAM", YEAR=2006, PAGES="162--171", eprint="soda:1109557.1109577" ) @inproceedings{ESZ, AUTHOR = {K. Elbassioni and R. Sitters and Y. Zhang}, TITLE = {A Quasi-{PTAS} for Profit-Maximizing Pricing on Line Graphs}, YEAR = {2007}, booktitle = {Proc. 15th Ann. European Symp. on Algorithms (ESA'07)}, publisher ="Springer", series="Lecture Notes in Computer Science", } @ARTICLE{eglnv98, author="G. Even and O. Goldreich and M. Luby and N. Nisan and B. Velickovic", title="Efficient Approximation of Product Distributions", JOURNAL="Random Structures and Algorithms", volume=13, number=1, pages={1--16}, YEAR=1998, eprint="wiley:10.1002/(SICI)1098-2418(199808)13:1<1::AID-RSA1>3.0.CO;2-W" } @ARTICLE(GHKSW-02, AUTHOR="A. Goldberg and J. Hartline and A. Karlin and M. Saks and A. Wright", TITLE="Competitive Auctions", JOURNAL="Games and Economic Behavior", volume=55, number=2, pages={242--269}, YEAR=2006, eprint="elsevier:10.1016/j.geb.2006.02.003" ) @INPROCEEDINGS(GHW-01, AUTHOR="A. Goldberg and J. Hartline and A. Wright", TITLE="Competitive Auctions and Digital Goods", BOOKTITLE="Proc.~12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'01)", publisher = "SIAM", PAGES="735--744", YEAR=2001, eprint="soda:365411.365768" ) @INPROCEEDINGS(GHKKKS-05, AUTHOR="V. Guruswami and J. Hartline and A. Karlin and D. Kempe and C. Kenyon and F. McSherry", TITLE="On Profit-Maximizing Envy-Free Pricing", BOOKTITLE="Proc.~16th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'05)", publisher = "SIAM", YEAR="2005", PAGES=" 1164--1173", eprint="soda:1070432.1070598" ) @inproceedings{HK05, author = {J. Hartline and V. Koltun}, title = "Near-Optimal Pricing in Near-Linear Time", BOOKTITLE= {9th Workshop on Algorithms and Data Structures (WADS'05)}, publisher ="Springer", series="Lecture Notes in Computer Science", number=3608, year = 2005, pages= "422--431", eprint="wads:al2ke8gd23a44atp" } @inproceedings{KKL07, author="S. Kakade and A. Kalai and K. Ligett", title= "Playing Games with Approximation Algorithms", booktitle="Proc.~39th STOC", publisher = "ACM Press", pages={546--555}, year=2007, eprint="stoc:1250790.1250870" } @ARTICLE(KV03, AUTHOR="A. Kalai and S. Vempala", TITLE="Efficient Algorithms for Online Decision Problems", JOURNAL="Journal of Computer and System Sciences", VOLUME=71, number=3, YEAR=2005, PAGES="291--307", NOTE="An earlier version appears in COLT 2003.", eprint="jcss:10.1016/j.jcss.2004.10.016,springer:fbx1n68j5ubyv706" ) @INPROCEEDINGS(KMR-07, AUTHOR="R. Krauthgamer and A. Mehta and A. Rudra", TITLE="Pricing commodities, or How to sell when buyers have restricted valuations", booktitle="5th Workshop on Approximation and Online Algorithms", publisher = "Springer", YEAR=2007 ) @techreport{LW95, author = {M. Luby and A. Wigderson}, title = "Pairwise Independence and Derandomization", institution={U.C. Berkeley}, number = {CSD-95-880}, year =1995 } @INPROCEEDINGS(McMahanBlumCOLT04, AUTHOR="H. B. McMahan and A. Blum", TITLE="Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary", BOOKTITLE="Proc.~17th Conf. on Computational Learning Theory (COLT'04)", publisher = "Springer", series="Lecture Notes in Computer Science", number=3120, YEAR=2004, PAGES="109--123", eprint="springer:38p3f4h61cgy7gg7" ) @BOOK(MR, TITLE="{Randomized Algorithms}", AUTHOR="R. Motwani and P. Raghavan", PUBLISHER="Cambridge University Press", YEAR=1995 ) %% ToC#313 Chekuri - Pal au.bib 10-04-07 ed: LB 10-04-07 ed: DB 10-08-07 @Book{networkflowbook, author = {Ravindra K. Ahuja and Thomas L. Magnanti and James B. Orlin}, title = {Network Flows}, year = {1993}, publisher = {Prentice Hall} } @InProceedings{BachrachCHMRS05, author = {Abraham Bachrach and Kevin Chen and Chris Harrelson and Radu Mihaescu and Satish Rao and Apurva Shah}, title = {Lower Bounds for Maximum Parsimony with Gene Order Data}, booktitle = {Proc. 3rd RECOMB Satellite Workshop on Comparative Genomics (RCG'05)}, publisher = "Springer", series = {LNCS}, pages = {1--10}, year = 2005, eprint="springer:761n756g03752l46" } @InProceedings{Bansaletal, author = {Nikhil Bansal and Avrim Blum and Shuchi Chawla and Adam Meyerson}, title = {Approximation Algorithms for Deadline-{TSP} and Vehicle Routing with Time-Windows}, booktitle = {Proc. 36th STOC}, publisher = {ACM Press}, pages = {166-174}, year = 2004, eprint="stoc:10.1145/1007352.1007385" } @InProceedings{Blaser02, author = {Marcus Bl\"aser}, title = {A New Approximation Algorithm for the Asymmetric {TSP} with Triangle Inequality}, booktitle = {Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'02)}, pages = {638-645}, publisher = "SIAM", year = 2002, eprint="soda:644213" } @Article{Blumetal, author = {Avrim Blum and Shuchi Chawla and David Karger and Terran Lane and Adam Meyerson and Maria Minkoff}, title = {Approximation Algorithms for Orienteering and Discounted-Reward {TSP}}, journal = {SIAM Journal on Computing}, volume = 37, issue = 2, year = 2007, pages = {653--670}, eprint = "sicomp:10.1137/050645464" } @InProceedings{CharikarMRS97, author = {Moses Charikar and Rajeev Motwani and Prabhakar Raghavan and Craig Silverstein}, title = {Constrained {TSP} and lower power computing}, year = 1997, pages = {104--115}, booktitle = {Proc. First Workshop on Algorithms and Data Structures (WADS'97)}, eprint = "wads:d5764136r2147633" } @InProceedings{CharikarGK04, author = {Moses Charikar and Michel Goemans and Howard Karloff}, title = {On the Integrality Ratio for Asymmetric {TSP}}, year = 2004, pages = {101--107}, booktitle = "Proc. 45th FOCS", publisher = "IEEE Computer Society", eprint = "FOCS:10.1109/FOCS.2004.45" } @InProceedings{ChekuriP05, author = {Chandra Chekuri and Martin P\'al}, title = {A Recursive Greedy Algorithm for Walks in Directed Graphs}, year = 2005, pages = {245--253}, booktitle = "Proc. 46th FOCS", publisher = "IEEE Computer Society", eprint = "FOCS:10.1109/SFCS.2005.9" } @InProceedings{ChekuriKP07, author = {Chandra Chekuri and Nitish Korula and Martin P\'al}, title = {Improved Algorithms for Orienteering and Related Problems}, year = 2008, booktitle = {Proc. 19th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'08)}, publisher = "SIAM", note = {To appear.} } @TechReport{Christofides76, author = {Nicos Christofides}, title = {Worst-case analysis of a new heuristic for the traveling salesman problem}, booktitle = {GSIA Technical report}, institution = {CMU}, year = 1976 } @Article{Chvatal79, author = {Va\v{s}ek Chv\'atal}, title = {A greedy heuristic for the set-covering problem}, journal = {Mathematics of Operations Research}, volume = 4, pages = {233--235}, year = 1979 } @InProceedings{FeigeS07, author = {Uriel Feige and Mohit Singh}, title = {Improved approximation ratios for traveling salesperson tours and paths in directed graphs}, booktitle = {Proc. 10th Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'07)}, publisher = {Springer}, series = {LNCS}, volume = {4627}, year = 2007, pages = {104--118}, eprint="springer:u201633r5096547w" } @Article{FriezeGM82, author = {Alan Frieze and G. Galbiati and M. Maffioli}, title = {On the worst-case performance of some algorithms for the asymmetric traveling salesman problem}, journal = {Networks}, volume = 12, pages = {23--39}, year = 1982, doi = "10.1002/net.3230120103" } @Book{TSP_book2, editor = {G. Gutin and A.P. Punnen}, title = {Traveling Salesman Problem and Its Variations}, publisher = {Springer-Verlag}, address = {Berlin}, year = 2002 } @Article{GHKR98, author = {N. Guttmann-Beck and R. Hassin and S. Khuller and B. Raghavachari}, title = {Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem}, journal = {Algorithmica}, volume = 28, pages = {422--437}, year = 2000, note = {Preliminary version in {\em Proc.\ of FSTTCS}, 1998.}, eprint="algorithmica:38vtl0dhpg55l0au" } @Article{Hoogeveen91, author = {J. Hoogeveen}, title = {Analysis of {Christofides'} heuristic: Some paths are more difficult than cycles}, journal = {Operations Research Letters}, volume = 10, number = 5, pages = {291--295}, year = 1991, eprint="elsevier:10.1016/0167-6377(91)90016-I" } @Article{KaplanLSS03, author = {H. Kaplan and M. Lewenstein and N. Shafir and M. Sviridenko}, title = {Approximation Algorithms for Asymmetric {TSP} by Decomposing Directed Regular Multidigraphs}, journal = {Journal of the ACM}, volume = 52, year = 2005, pages = {602--626}, eprint = "JACM:10.1145/1082036.1082041" } @Unpublished{KleinbergW98, title = {Unpublished note}, author = {Jon Kleinberg and David Williamson}, year = 1998 } @Article{LamN05, author = {Fumei Lam and Alantha Newman}, title = {Traveling salesman path problems}, journal = {Mathematical Programming A}, year = {2006}, note = {Online publication date 1 Nov 2006}, eprint="springer:7773743425mx673l" } @Book{TSP_book1, editor = {E. Lawler and {J.\,K.} Lenstra and {A.\,H.\,G. Rinnooy} Kan and D. Shmoys}, title = {The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization}, publisher = {John Wiley \& Sons Ltd.}, year = 1985 } @InProceedings{NagarajanR07, author = {V. Nagarajan and R. Ravi}, title = {Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems}, booktitle = {Proc. 10th Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'07)}, publisher = {Springer}, series = {LNCS}, volume = {4627}, year = 2007, pages = {257--270}, eprint="springer:vn2516l2l015u7u1" } @Book{vehicle_book, title = {The Vehicle Routing Problem}, editor = {P. Toth and D. Vigo}, series = {SIAM Monographs on Discrete Mathematics and Applications}, publisher = {SIAM}, address = {Philadelphia}, year = 2002 } @MastersThesis{Williamson90, author = {David Williamson}, title = {Analysis of the Held-Karp heuristic for the traveling salesman problem}, school = {MIT Computer Science Department}, year = 1990, url="http://www.lcs.mit.edu/publications/specpub.php?id=1046" } @TechReport{Williamson99, author = {David Williamson}, title = {Lecture Notes on Approximation Algorithms}, booktitle = {IBM Research Report}, institution = {IBM}, number = {RC 21273}, month = {February}, year = 1999 } @Article{YoungTO91, author = {N. Young and R. Tarjan and J. Orlin}, title = {Faster parametric shortest path and minimum balance algorithms}, journal = {Networks}, volume = 21, number = 2, pages = {205--221}, year = 1991, doi = "10.1002/net.3230210206", eprint="arxiv:cs/0205041" } %%% ToC#319 Haastad-Wigderson rev LB 09-24 rev DB 09-24 @inproceedings{BFS86, author="L. Babai and P. Frankl and J. Simon", title="Complexity classes in communication complexity theory", booktitle="Proc. 27th FOCS", publisher="IEEE Computer Society", year="1986", pages="337--347"} @inproceedings{BK97, author="L. Babai and P. Kimmel", title="Randomized simultaneous messages: solution of a problem of {Y}ao in communication complexity", booktitle="Proc. 12th IEEE Symp. on Computational Complexity", publisher="IEEE Computer Society", year="1997", pages="239--246", eprint="ccc:10.1109/CCC.1997.612319"} @article{BJKS04, author="Z. Bar-Yossef and T. S. Jayram and R. Kumar and D. Sivakumar", title="Information Statistics Approach to Data Stream and Communication Complexity", journal="J. of Computer and System Sciences", volume="68", year="2004", pages="702--732", eprint="jcss:10.1016/j.jcss.2003.11.006"} @book{J01, author="S. Jukna", title="Extremal Combinatorics", publisher="Springer Verlag", year="2001"} @book{KN97, author="E. Kushilevitz and N. Nisan", title="Communication Complexity", publisher="Cambridge University Press", year="1997"} @article{KS92, author="B. Kalyanasundaram and G. Schnitger", title="The probabilistic communication complexity of set intersection", journal="SIAM J. on Discrete Mathematics", volume="5", year="1992", pages="545--557", eprint="sidma:10.1137/0405044"} @article{N91, author="I. Newman", title="Private vs. common random bits in communication complexity", journal="Information Processing Letters", volume="39", pages="67--71", year="1991", eprint="ipl:10.1016/0020-0190(91)90157-D"} @inproceedings{NS96, author="I. Newman and M. Szegedy", title="Public vs. Private Coins Flips in One Round Communication Games", booktitle="Proc. 28th STOC", publisher="ACM Press", year="1996", pages="561--570", eprint="stoc:237814.238004"} @unpublished{NS06, author="N. Nisan and I. Segal", title="The communication requirements of efficient allocations and supporting Lindhal prices", year = 2004, pdf="http://www.cs.huji.ac.il/~noam/prices.pdf"} @inproceedings{PRW97, author="I. Parnafes and R. Raz and A. Wigderson", title="Direct product results and the {GCD} problem in old and new communication models", booktitle="Proc. 29th STOC", publisher="ACM Press", year="1997", pages="363--372", eprint="stoc:258533.258620"} @article{R92, author="A. A. Razborov", title="The distributional complexity of disjointness", journal="Theoretical Computer Science", volume="106", pages="385--390", year="1992", eprint="tcs:10.1016/0304-3975(92)90260-M"} @article{RW92, author="R. Raz and A. Wigderson", title="Monotone Circuits for Matching require Linear Depth", journal="Journal of the ACM", volume="39", pages="736--744", year="1992", eprint="jacm:146637.146684"} @inproceedings{Y79, author="A. C.-C. Yao", title="Some complexity questions related to distributive computing", booktitle="Proc. 11th STOC", publisher="ACM Press", year="1979", pages="209--213", eprint="stoc:800135.804414"} \end{thebibliography} \end{document} %% ToC#304 Razborov-Yekhanin @INPROCEEDINGS{Amb, AUTHOR = {Andris Ambainis}, TITLE = {Upper bound on the communication complexity of private information retrieval}, BOOKTITLE = {Proc. 32nd Intern. Colloquium on Automata, Languages and Programming (ICALP'97)}, VOLUME = {1256}, SERIES = {Lecture Notes in Computer Science}, publisher = "Springer", YEAR = 1997, PAGES = {401--407}, eprint="icalp:j210805656376051" } @ARTICLE{BFG, AUTHOR = {Richard Beigel and Lance Fortnow and William Gasarch}, TITLE = {A tight lower bound for restricted {PIR} protocols}, JOURNAL = {Computational Complexity}, VOLUME = 15, YEAR = 2006, PAGES = {82--91}, eprint="springer:10.1007/s00037-006-0208-3" } @ARTICLE{BIK, AUTHOR = {Amos Beimel and Yuval Ishai and Eyal Kushilevitz}, TITLE = {General constructions for information-theoretic private information retrieval}, JOURNAL = {J. Computer and System Sciences}, VOLUME = 71, YEAR = 2005, PAGES = {213--247}, eprint="jcss:10.1016/j.jcss.2005.03.002" } @INPROCEEDINGS{BIKR, AUTHOR = {Amos Beimel and Yuval Ishai and Eyal Kushilevitz and Jean-Francios Raymond}, TITLE = {Breaking the ${O}\left(n^{1/(2k-1)}\right)$ barrier for information-theoretic private information retrieval}, BOOKTITLE = {Proc. 43rd FOCS}, publisher = {IEEE Computer Society Press}, YEAR = 2002, PAGES = {261--270}, eprint="focs:10.1109/SFCS.2002.1181949" } @ARTICLE{CGKS, AUTHOR = {Benny Chor and Oded Goldreich and Eyal Kushilevitz and Madhu Sudan}, TITLE = {Private information retrieval}, JOURNAL = {J. ACM}, VOLUME = 45, YEAR = 1998, PAGES = {965--981}, eprint="jacm:10.1145/293347.293350" } @ARTICLE{Gasarch, AUTHOR = {William Gasarch}, TITLE = {A survey on private information retrieval}, JOURNAL = {The Bulletin of the EATCS}, VOLUME = 82, YEAR = 2004, PAGES = {72--107}, pdf="http://www.eatcs.org/bulletin/beatcs82.pdf" } @INPROCEEDINGS{GKST, AUTHOR = {Oded Goldreich and Howard Karloff and Leonard Schulman and Luca Trevisan,}, TITLE = {Lower bounds for linear locally decodable codes and private information retrieval}, BOOKTITLE = {Proc. 17th Computational Complexity Conf. (CCC'02)}, publisher = {IEEE Computer Society Press}, YEAR = 2002, PAGES = {175--183}, eprint="ccc:10.1109/CCC.2002.1004353" } @BOOK{Isaacs, AUTHOR = {I. Martin Isaacs}, TITLE = {Character theory of finite groups}, PUBLISHER = {Academic Press}, YEAR = 1976 } @ARTICLE{Itoh_upper, AUTHOR = {Toshiya Itoh}, TITLE = {Efficient private information retrieval}, JOURNAL = {IEICE Trans. Fund. of Electronics, Commun. and Comp. Sci.}, VOLUME = "E82-A", YEAR = 1999, PAGES = {11--20} } @ARTICLE{Itoh_lower, AUTHOR = {Toshiya Itoh}, TITLE = {On lower bounds for the communication complexity of private information retrieval}, JOURNAL = {IEICE Trans. Fund. of Electronics, Commun. and Comp. Sci.}, VOLUME = "E82-A", YEAR = 2001, PAGES = {157--164} } @INPROCEEDINGS{KT, AUTHOR = {Jonathan Katz and Luca Trevisan}, TITLE = {On the efficiency of local decoding procedures for error-correcting codes}, BOOKTITLE = {Proc. 32nd STOC}, publisher = {ACM Press}, YEAR = 2000, PAGES = {80--86}, eprint="stoc:10.1145/335305.335315" } @TECHREPORT{KY, AUTHOR = {Kiran S. Kedlaya and Sergey Yekhanin}, TITLE = {Locally decodable codes from nice subsets of finite fields and prime factors of {M}ersenne numbers}, TYPE = {Electronic Colloquium on Computational Complexity (ECCC)}, NUMBER = {TR07-040}, YEAR = {2007}, eprint="eccc:TR07-040" } @ARTICLE{KdW, AUTHOR = {Iordanis Kerenidis and Ronald de Wolf}, TITLE = {Exponential lower bound for 2-query locally decodable codes via a quantum argument}, JOURNAL = {J. of Computer and System Sciences}, VOLUME = 69, YEAR = 2004, PAGES = {395--420}, eprint="jcss:10.1016/j.jcss.2004.04.007" } @MASTERSTHESIS{Mann, AUTHOR = {Eran Mann}, TITLE = {Private access to distributed information}, SCHOOL = {Technion - Israel Institute of Technology}, ADDRESS = {Haifa}, YEAR = 1998 } @INPROCEEDINGS{RY, AUTHOR = {Alexander Razborov and Sergey Yekhanin}, TITLE = {An ${\Omega}(n^{1/3})$ lower bound for bilinear group based private information retrieval}, BOOKTITLE = {Proc. 47th FOCS}, publisher = {IEEE Computer Society Press}, YEAR = 2006, PAGES = {739--748}, eprint="focs:10.1109/FOCS.2006.10" } @BOOK{VdWaerden, AUTHOR = {B. L. van der Waerden}, TITLE = {Algebra}, PUBLISHER = {Springer}, YEAR = 2003 } @INPROCEEDINGS{WdW, AUTHOR = {Stephanie Wehner and Ronald de Wolf}, TITLE = {Improved lower bounds for locally decodable codes and private information retrieval}, BOOKTITLE = {Proc. 32nd Intern. Colloquium on Automata, Languages and Programming (ICALP'05)}, VOLUME = {3580}, SERIES = {Lecture Notes in Computer Science}, publisher = {Springer}, YEAR = 2005, PAGES = {1424--1436}, eprint="icalp:1utwmhj4me3lr582" } @INCOLLECTION{Weintraub, AUTHOR = {Steven H. Weintraub}, TITLE = {Representation theory of finite groups: algebra and arithmetic}, PUBLISHER = {AMS}, SERIES = {Graduate {S}tudies in {M}athematics}, VOLUME = 59, YEAR = 2003 } @INPROCEEDINGS{WY, AUTHOR = {David Woodruff and Sergey Yekhanin}, TITLE = {A geometric approach to information-theoretic private information retrieval}, BOOKTITLE = {Proc. 20th IEEE Computational Complexity Conf. (CCC'05)}, publisher = {IEEE Computer Society Press}, YEAR = 2005, PAGES = {275--284}, eprint="ccc:10.1109/CCC.2005.2" } @PHDTHESIS{Y_thesis, AUTHOR = {Sergey Yekhanin}, TITLE = {Locally decodable codes and private information retrieval schemes}, SCHOOL = {Massachusetts Institute of Technology}, YEAR = 2007 } @INPROCEEDINGS{Y_nice, AUTHOR = {Sergey Yekhanin}, TITLE = {Towards $3$-query locally decodable codes of subexponential length}, BOOKTITLE = {Proc. 39th STOC}, publisher = {ACM Press}, YEAR = 2007, PAGES = {266--274}, eprint="stoc:10.1145/1250790.1250830" } %% edited by LB 2008-04-06 DB 2008-04-13 @Article{AR:98, title = "An {$O(\log k)$} Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm", author = "Yonatan Aumann and Yuval Rabani", pages = "291--301", journal = "SIAM Journal on Computing", year = "1998", volume = "27", number = "1", eprint="sicomp:10.1137/S0097539794285983" } @Article{AO:02, author = "Charu C. Aggarwal and James B. Orlin", title = "On Multiroute Maximum Flows in Networks", journal = "Networks", volume = "39", year = "2002", pages = "43--52", eprint="wiley:10.1002/net.10008" } @Book{AMO:93, author = "R. K. Ahuja and T. L. Magnanti and J. B. Orlin", title = "Network Flows: Theory, Algorithms and Applications", year = "1993", publisher = "Prentice-Hall", } @Article{BCKS:07, author = {Amitabha Bagchi and Amitabh Chaudhary and Petr Kolman and Christian Scheideler}, title = {Algorithms for Fault-tolerant Routing in Circuit switched networks}, journal = "SIAM Journal on Discrete Mathematics", volume = "21", issue = "1", year = "2007", pages = "141--157", eprint="sidma:10.1137/S0895480102419743" } @TechReport{BCKS:04, author = {Amitabha Bagchi and Amitabh Chaudhary and Petr Kolman and {Ji\v {r}\'\i} Sgall}, title = {A simple combinatorial proof for the duality of multiroute flows and cuts}, institution = {Charles University}, year = 2004, number = {2004-662}, address = {Prague}, } @Article{BCK:05, author = "Amitabha Bagchi and Amitabh Chaudhary and Petr Kolman", title = "Short length {Menger}'s theorem and reliable optical routing", journal = "Theoretical Computer Science", volume = "339", year = "2005", pages = "315--332", eprint="tcs:10.1016/j.tcs.2005.03.009" } @Article{BKS:05, title = "The $k$-splittable Flow Problem", author = "Georg Baier and Ekkehard Koehler and Martin Skutella", journal = "Algorithmica", volume = 42, number = "3--4", pages = "231--248", year = "2005", eprint="algorithmica:jtl3r3k633523486" } @Article{BS:00, author = "Alok Baveja and Aravind Srinivasan", title = "Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems", journal = "Mathematics of Operations Research", volume = "25", number = "2", pages = "255--280", year = "2000", } @InProceedings{BCHK:07, title = "Single source multiroute flows and cuts on uniform capacity networks", author = "Henning Bruhn and Jakub \v{C}ern{\'y} and Alexander Hall and Petr Kolman", booktitle = "Proc. 18th Ann. {ACM}-{SIAM} Symposium on Discrete Algorithms ({SODA'07})", year = "2007", publisher = "SIAM", pages = "855--863", eprint="soda:1283383.1283475" } @Article{CCGK:07, title = "Approximation Algorithms for the Unsplittable Flow Problem", author = "Amit Chakrabarti and Chandra Chekuri and Anupam Gupta and Amit Kumar", journal = "Algorithmica", year = "2007", number = "1", volume = "47", pages = "53--78", eprint="algorithmica:m5710531h2514815" } @article{CK:07, author = "Chandra Chekuri and Sanjeev Khanna", title = "Edge-Disjoint Paths Revisited", journal = "ACM Transactions on Algorithms", volume = "3", issue = "4", year = "2007", eprint="acm:1290672.1290683" } @Article{CRS:99, author = "Israel Cidon and Raphael Rom and Yuval Shavitt", title = "Analysis of multi-path routing", journal = "IEEE\slash ACM Transactions on Networking", volume = "7", number = "6", pages = "885--896", year = "1999", eprint="acm:323983.323992" } @Article{DGG:99, author = "Y. Dinitz and N. Garg and M. Goemans", title = "On the Single Source Unsplittable Flow Problem", journal = "Combinatorica", volume = "19", number=1, pages = "17--41", year = "1999", eprint="springer:pg0crc9nqlfdmajj"} @Article{DCH:06, author = "D. Du and R. Chandrasekaran", title = "The multiroute maximum flow problem revisited", journal = "Networks", volume = "47", number = "2", pages = {81--92}, year = "2006", eprint="wiley:10.1002/net.20099" } @Book{Du:03, author = {Donglei Du}, title = {Multiroute Flow Problem}, publisher = {Ph.D. thesis, The University of Texas at Dallas}, year = {2003} } @Article{EH:04, title = "{NP}-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow", author = "Thomas Erlebach and Alexander Hall", journal = "Journal of Scheduling", year = "2004", volume = "7", number = "3", pages = "223--241", eprint="springer:h57n764rq0124578" } @Article{FF:56, author = {L. R. Ford and D. R. Fulkerson}, title = {Maximum flow through a network}, journal = {Canad. J. Math.}, year = 1956, volume = 8, pages = {399--404} } @Article{GVY:96, title = "Approximate Max-Flow Min-Cut Theorems and Their Applications", author = "Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis", pages = "235--251", journal = "SIAM Journal on Computing", year = "1996", volume = "25", number = "2", eprint="sicomp:10.1137/S0097539793243016" } @Article{GKRSY:03, author = "V. Guruswami and S. Khanna and R. Rajaraman and B. Shepherd and M. Yannakakis", title = "Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems", journal = "Journal of Computer and System Sciences", volume = 67, number = 3, pages = "473--496", year = "2003", eprint="jcss:10.1016/S0022-0000(03)00066-7" } @Article{KKL:03, author = "Koushik Kar and Murali Kodialam and T. V. Lakshman", title = "Routing restorable bandwidth guaranteed connections using maximum 2-route flows", journal = "IEEE\slash ACM Transactions on Networking", year = 2003, volume = 11, issue = 5, pages = "772--781", eprint="acm:948928.948935" } @Article{KT:93, author = "Wataru Kishimoto and M. Takeuchi", title = "On $m$-route flows in a network", journal = "IEICE Transactions", volume = "J-76-A", year = "1993", number = "8", pages = "1185--1200", language = "Japanese", note = "(in Japanese)" } @Article{Kishimoto:96, author = "Wataru Kishimoto", title = "A Method for Obtaining the Maximum Multiroute Flows in a Network", journal = "Networks", volume = "27", number=4, year = "1996", pages = "279--291", removeeprint={wiley:10.1002/(SICI)1097-0037(199607)27:4<279::AID-NET3>3.0.CO;2-D} } @InProceedings{Kleinberg:96, author = "J. M. Kleinberg", title = "Single-source unsplittable flow", booktitle = "Proc. 37th FOCS", publisher = "IEEE Computer Society Press", pages = "68--77", year = "1996", eprint="focs:10.1109/SFCS.1996.548465" } @InProceedings{KSS:05, title = "Approximation and Complexity of $k$-Splittable Flows", author = "Ronald Koch and Martin Skutella and Ines Spenke", year = "2005", volume = "3879", booktitle = "Proceedings of the Third Workshop on Approximation and Online Algorithms", pages = "244--257", series = "Lecture Notes in Computer Science", publisher = "Springer", eprint="wads:l871111265475j11" } @Article{KS:02a, author = "Stavros G. Kolliopoulos and Clifford Stein", title = "Approximation Algorithms for Single-Source Unsplittable Flow", journal = "SIAM Journal on Computing", volume = "31", number = "3", pages = "919--946", year = "2002", eprint="sicomp:10.1137/S0097539799355314" } @Article{KS:04, author = "Petr Kolman and Christian Scheideler", title = "Simple On-Line Algorithms for the Maximum Disjoint Paths Problem", journal = "Algorithmica", volume = "39", number = "3", pages = "209--233", year = "2004", eprint="algorithmica:ppc4pcxagm69d4jv" } @comment{ note = "Preliminary version in Proc. 13th Ann. {ACM} Symposium on Parallel Algorithms and Architectures (SPAA'01)" } @Article{KS:06, title = "Improved bounds for the unsplittable flow problem", author = "Petr Kolman and Christian Scheideler", journal = "Journal of Algorithms", year = "2006", number = "1", volume = "61", pages = "20--44", eprint="elsevier:10.1016/j.jalgor.2004.07.006" } @Article{LR:99, author = "Tom Leighton and Satish Rao", title = "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms", journal = "Journal of the ACM", volume = "46", number = "6", pages = "787--832", month = nov, year = "1999", eprint="jacm:331524.331526" } @comment{ note = "Preliminary version in Proc. 29th FOCS (1988)"} @article{LLR:95 , author="N. Linial and E. London and {Yu}. Rabinovich" , title="The geometry of graphs and some of its algorithmic applications" , journal="Combinatorica" , volume=15, number=2 , pages="215--245" , year=1995, comment="springer:h16248312kq1t054" } @comment{ note ="Preliminary version in Proc. 35th FOCS (1994)"} @InProceedings{MS:05, author = "Maren Martens and Martin Skutella", title = "Length-Bounded and Dynamic k-Splittable Flows", booktitle = "Operations Research Proceedings 2005", year = "2006", pages = {297--302}, eprint="springer:w2u3032j1804481t" } @article{MS:06, author = "Maren Martens and Martin Skutella", title = "Flows on Few Paths: Algorithms and Lower Bounds", journal = "Networks", year = 2006, volume = 48, number = "2", pages = {68--76}, eprint="wiley:10.1002/net.20121" } @comment{ note = "Preliminary version in Proc. 12th Ann. European Symposium on Algorithms (ESA'04)"} @Article{Menger:27, author = {K. Menger}, title = {Zur Allgemeinen {Kurventheorie}}, journal = {Fundam. Math.}, year = 1927, volume = 10, pages = {96--115} } @Article{Skutella:02, author = "M. Skutella", title = "Approximating the single source unsplittable min-cost flow problem", journal = "Mathematical Programming, Ser. B", volume = 91, number = 3, pages = {493--514}, year = "2002", eprint="springer:txfq9gvdtw0cac0g" } @InProceedings{Srinivasan:97, title = "Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problems", author = "Aravind Srinivasan", pages = "416--425", booktitle = "Proc. 38th FOCS", publisher = "IEEE Computer Society Press", month = "20--22 ", year = "1997", eprint="focs:10.1109/SFCS.1997.646130" } %% converted by LB from authors "thebibliography" section 5-3-2008 %% edited by DB 5-6-2008 @InProceedings{Ajtai, author = {M. Ajtai}, title = {The worst-case behavior of {Schnorr's} algorithm approximating the shortest nonzero vector in a lattice}, booktitle = {Proc. 35th STOC}, publisher = {ACM Press}, pages = {396--406}, year = 2003, eprint="stoc:10.1145/780542.780602" } @incollection{Ajt1, author = {M. Ajtai}, title = {Generating Hard Instances of Lattice Problems}, booktitle="Complexity of computations and proofs", editor="J. Kraji\v{c}ek", series="Quaderni di Matematica", publisher="Seconda Universita di Napoli", volume=13, year=2004, pages="1--32", note = {Preliminary version: Proc. 28th STOC, 1996, pp. 99--108.} } @InProceedings{Ajt2, author = {M. Ajtai}, title = {Random Lattices and a Conjectured 0---1 Law about their Polynomial Time Computable Properties}, booktitle = {Proc. 43rd FOCS}, publisher = {IEEE Computer Society}, year = 2002, pages = {733--742}, eprint="focs:10.1109/SFCS.2002.1181998" } @InProceedings{ARS, author = {M. Ajtai and R. Kumar and D.~Sivakumar}, title = {A Sieve Algorithm for the Shortest Lattice Vector Problem}, booktitle = {Proc. 33rd STOC}, publisher = {ACM Press}, year = 1996, pages = {601--610}, eprint="stoc:10.1145/380752.380857" } @Article{FK, author = {M. L. Furst and R. Kannan}, title = {Succinct certificates for almost all subset problems}, journal = {SIAM Journal on Computing}, volume = 18, year = 1989, pages = {550--558}, eprint="sicomp:10.1137/0218037"} @Article{Gauss, author = {C. F. Gauss}, title = {Recursion der ``Untersuchungen \"uber die Eigenschaften der positiven tern\"aren quadratische Formen von Ludwig August Seeber, Dr. der Philosophie, ordentl. Professor der Universit\"at in Freiburg, 1831, 248 S. in 4."}, journal = {Journal f\"ur die reine und angewandte Mathematik}, volume = 20, year = 1840, pages = {312--320}, } @Book{GL, author = {P. M. Gruber and C. G. Lekkerkerker}, title = {Geometry of Numbers, Chapter 3}, publisher = {North Holland}, year = 1987} @Article{Kannan, author = {R. Kannan}, title = {Minkowski's convex body Theorem and Integer Programming}, journal = {Mathematics of Operation Research}, volume = 12, number = 3, year = 1987, pages = {415--440}, } @Incollection{Kannan1, author = {R. Kannan}, title = {Algorithmic Geometry of Numbers}, booktitle = {Annual Review of Computer Science}, volume = 2, year = 1987, pages = {231--269}, editors = {J. Traub}, publisher = {Annual Reviews Inc.}, } @Article{LO, author = {J. C. Lagarias, A. M. Odlyzko}, title = {Solving low-density subset sum problems}, journal = {Journal of the Association for Computing Machinery}, volume = 32, number=1, year = 1985, pages = {229--246}, eprint="jacm:10.1145/2455.2461" } @Incollection{Lagrange, author = {J. L. Lagrange}, title = {Recherches d'arithm\'etique}, booktitle = {Oeuvres de Lagrange}, editor = {M. J.-A. Serret}, volume = 3, pages = {698--701}, publisher = {Gauthier-Villars}, year = 1869, note = {(article cca 1773)}, } @Article{LLL, author = {A. K. Lenstra and H. W. Lenstra and L. Lov\'asz}, title = {Factoring polynomials with rational coefficients}, journal = {Mathematische Annalen}, volume = 261, pages = {515--534}, year = 1982, eprint="springer:lh1m24436431g068" } @Article{OR, author = {A. M. Odlyzko and H. te Riele}, title = {Disproof of the {Mertens} conjecture}, journal = {Journal f\"ur die reine und angewandte Mathematik}, volume = 357, year = 1985, pages = {138--160}, pdf="http://www.dtc.umn.edu/~odlyzko/doc/arch/mertens.disproof.pdf" } @Article{Schnorr, author = {C.-P. Schnorr}, title = {A hierarchy of polynomial time lattice basis reduction algorithms}, journal = {Theoretical Computer Science}, volume = 53, year = 1987, pages = {201--224}, eprint="tcs:10.1016/0304-3975(87)90064-8" } @InProceedings{Schnorr1, author = {C.-P. Schnorr}, title = {Lattice Reduction by Random Sampling and Birthday Methods}, booktitle = {Proc. 20th Ann. Symp. on Theoretical Aspects of Computer Science (STACS'03)}, series = {Lecture Notes in Computer Science}, volume = 2607, year = 2003, publisher = {Springer}, pages = {145--156}, eprint="stacs:qjpadpmwabty52g4" } @Article{KZ, author ={A. Korkine and G. Zolotareff}, title ={Sur les formes quadratiques}, journal = {Mathematische Annalen}, volume = 6, year = 1873, pages = {366--389}, eprint="springer:p56345710m4p6214" } %% revised: LB 2008-05-06, DB 2008-05-12 @string{jacm={J. ACM}} @string{jcss={J. Computer and System Sciences}} @article{BeckSpencer, author = "J{\'o}zsef Beck and Joel Spencer", title = "Integral Approximation Sequences", journal = "Mathematical Programming", volume = "30", number = "1", year = "1984", pages = "88--98", publisher = "Springer Berlin / Heidelberg", eprint="springer:d77488n21q0222p0"} @InProceedings{Goldreich-Sudan, author = "Oded Goldreich and Madhu Sudan", title = "Locally testable codes and {PCP}s of almost-linear length", booktitle = "Proc. 43rd FOCS", pages = "13--22", year = "2002", publisher = "IEEE Computer Society Press", organization = "IEEE Computer Society", address = "Los Alamitos-Washington-Brussels-Tokyo", acknowledgement = "LEABib --- Lehrstuhl f{\"u}r Effiziente Algorithmen der Technischen Universit{\"a}t M{\"u}nchen. http://wwwmayr.informatik.tu-muenchen.de/leabib", cdate = "1970-01-01", mdate = "1970-01-01", eprint="focs:10.1109/SFCS.2002.1181878" } @article{Shor1, author = "N.Z. Shor", title = "Cut-off method with space extension in convex programming problems", journal = "Cybernetics and Systems Analysis", volume = "13", year = "1977", pages = "94--96", eprint="springer:w88055332t2p4215"} @article{Shor2, author = "N.Z. Shor", title = "Quadratic optimization problems", journal = "Soviet Journal of Circuits and Systems Sciences", volume = "25", year = "1987", pages = "1--11"} @article{NemYu, author = "D. B. Yudin and A. S. Nemirovski", title = "Informational complexity and efficient methos for solving complex extremal problems", journal = "Matekon", volume = "13", year = "1977", pages = "25--45"} @phdthesis{SpielmanThesis, author = "Daniel Spielman", title = "Computationally Efficient Error-Correcting Codes and Holographic Proofs", year = "1995", school = "{M.I.T.}", ps="http://cs-www.cs.yale.edu/homes/spielman/PAPERS/thesis.ps", pdf="http://cs-www.cs.yale.edu/homes/spielman/PAPERS/thesis.pdf"} @book{kato, author = "T. Kato", title = "Perturbation theory for linear operators", publisher = "Springer-Verlag", year = "1980" } @article{Golden, author = "S. Golden", title = "Lower Bounds for the {H}elmholtz Function", journal = "Physical Review", volume = "137B", number = "4", pages = "B1127--1128", year = "1965", eprint="doi:10.1103/PhysRev.137.B1127"} @article{Thompson, author = "C. J. Thompson", title = "Inequality with Applications in Statistical Mechanics", journal = "Journal of Mathematical Physics", volume = 6, number = 11, pages = "1812--1823", year = 1965, doi = {10.1063/1.1704727}, url="http://link.aip.org/link/?JMAPAQ/6/1812/1"} @article{VanBoyd, author = "L. Vandenberghe and S. Boyd", title = "Semidefinite Programming", journal = "{SIAM} Review", volume = "38", year = "1996", month = "March", pages = "49--95", eprint="sirev:10.1137/1038003"} @Article{SchulLoh, author = {Po-Shen Loh and Leonard J. Schulman}, title = {Improved Expansion of Random {C}ayley Graphs}, keywords = {expander graphs, Cayley graphs, second eigenvalue, logarithmic generators}, journal = {Discrete Mathematics and Theoretical Computer Science}, year = 2004, volume = {6}, number = {2}, pages = {523-528}, url = {http://www.dmtcs.org/volumes/abstracts/dm060222.abs.html} } @article{ bilu-hypergraph, author = "Yonatan Bilu and Shlomo Hoory", title = "On codes from hypergraphs", journal = "European Journal of Combinatorics", volume = "25", number = "3", year = "2004", pages = "339--354", eprint="elsevier:10.1016/j.ejc.2003.10.002"} @article{RusLan, author = "Zeph Landau and Alexander Russell", title = "Random {C}ayley graphs are expanders: a simplified proof of the {A}lon-{R}oichman theorem", journal = "The Electronic Journal of Combinatorics", volume = "11", number = "1", year = "2004", pdf="http://www.combinatorics.org/Volume_11/PDF/v11i1r62.pdf", ps="http://www.combinatorics.org/Volume_11/PostScriptfiles/v11i1r62.ps"} @article{AW, author = "Rudolf Ahlswede and Andreas Winter", title = "Strong Converse for Identification via Quantum Channels", journal = "IEEE Transactions on Information Theory", volume = "48", number = "3", year = "2002", pages = "569--579", eprint="ieee:10.1109/18.985947"} @article{ goldreich97sample, author = "Oded Goldreich", title = "A Sample of Samplers - A Computational Perspective on Sampling (survey)", journal = "Electronic Colloquium on Computational Complexity (ECCC)", volume = "4", number = "020", year = "1997", url = "citeseer.ist.psu.edu/goldreich97sample.html", eprint="eccc:TR97-020"} @article{ AR, author = "Noga Alon and Yuval Roichman", title = "Random {C}ayley Graphs and Expanders", journal = "Random Structures \& Algorithms", volume = "5", year = "1994", url = "http://citeseer.ist.psu.edu/alon97random.html" } @InProceedings{GoldreichImLeVeZu90, title={Security Preserving Amplification of Hardness}, author={Goldreich, Oded and Impagliazzo, Russell and Levin, Leonid and Venkatesan, Ramarathnam and Zuckerman, David}, pages={318--326}, booktitle = {Proc. 31st FOCS}, publisher = {IEEE Computer Society Press}, year = {1990}, source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib} } @Article{NaorNa93, title={Small-Bias Probability Spaces: Efficient Constructions and Applications}, author={Joseph Naor and Moni Naor}, pages={838--856}, journal=sicomp, year=1993, month=aug, volume=22, number=4, source={http://theory.lcs.mit.edu/~dmjones/hbp/sicomp/sicomp.bib}, eprint="sicomp:10.1137/0222053" } @InProceedings{SW, author = "Amir Shpilka and Avi Wigderson", title = "Derandomizing homomorphism testing in general groups", pages = "427--435", title = {Proc. 36th STOC}, booktitle = {Proc. 36th STOC}, publisher = {ACM Press}, year = {2004}, eprint="stoc:10.1145/1007352.1007421"} @InProceedings{AroraSa92, author = "Sanjeev Arora and Shmuel Safra", title = "Probabilistic checking of proofs; a new characterization of {NP}", pages = "2--13", year = "1992", booktitle = {Proc. 33rd FOCS}, publisher = {IEEE Computer Society Press}, year = {1992}, } @Article{AroraLuMoSuSz98, title = "Proof Verification and the Hardness of Approximation Problems", author = "Sanjeev Arora and Carsten Lund and Rajeev Motwani and Madhu Sudan and Mario Szegedy", area = "Formal Languages and Complexity Theory", journal = jacm, pages = "501--555", month = may, year = "1998", volume = "45", number = "3", keywords = "NP-completeness, optimization, proof verification, randomness", general-terms = "Algorithms, Theory", cr-categories = "F.1.2; F.1.3; F.2.1; F.2.2; F.4.1", } @article{ AFWZ, author = "Noga Alon and Uriel Feige and Avi Wigderson and David Zuckerman", title = "Derandomized Graph Products", journal = "Computational Complexity", volume = "5", number = "1", pages = "60--75", year = "1995", url = "citeseer.ist.psu.edu/alon96derandomized.html", eprint="springer:r591795p150lj86q"} @Article{Shaltiel02, author = {Ronen Shaltiel}, title = {Recent developments in extractors}, journal = {Bulletin of the European Association for Theoretical Computer Science}, year = {2002}, url = {http://www.wisdom.weizmann.ac.il/~ronens}, } @Article{NisanTa99, author = "Noam Nisan and Amnon {Ta-S}hma", title = "Extracting Randomness: {A} Survey and New Constructions", journal = jcss, volume = "58", year = "1999", pages = {148--173}, number = {1}, eprint="jcss:10.1006/jcss.1997.1546" } @InProceedings{CohenWi89, title = "Dispersers, Deterministic Amplification, and Weak Random Sources", author = "Aviad Cohen and Avi Wigderson", pages = "14--19", booktitle = {Proc. 30th FOCS}, publisher = {IEEE Computer Society Press}, year = {1989}, } @InProceedings{ImZu, author = "Russell Impagliazzo and David Zuckerman", title = "How to Recycle Random Bits", pages = "248--253", year = "1989", booktitle = {Proc.\ $30$th FOCS}, publisher = {IEEE}, } @article{Raghavan88, author = {Prabhakar Raghavan}, title = {Probabilistic construction of deterministic algorithms: {A}pproximating packing integer programs}, journal = jcss, volume = {37}, number = {2}, year = {1988}, issn = {0022-0000}, pages = {130--143}, eprint="jcss:10.1016/0022-0000(88)90003-7" } @article{HLW06, author = "Shlomo Hoory and Nathan Linial and Avi Wigderson", title = {Expander Graphs and their Applications}, journal = {Bull. Amer. Math. Soc.}, volume = {43}, pages = {439--561}, publisher = {AMS}, year = {2006}, url="http://www.ams.org/bull/2006-43-04/S0273-0979-06-01126-8/" } @article{GW95, author = {M. X. Goemans and D. P. Williams}, title = {Improved approximation algorithms for Max-Cut and Satisfiability Problems using Semidefinite Programming}, journal = jacm, year = {1995}, volume = {42}, number=6, pages = {1115--1145}, eprint="jacm:10.1145/227683.227684" } @inproceedings{ARV04, author = {Sanjeev Arora and Satish Rao and Umesh Vazirani}, title = {Expander flows, geometric embeddings, and graph partitionings}, pages = {222--231}, year = {2004}, publisher = {ACM Press}, booktitle = {Proc. 36th STOC}, eprint="stoc:10.1145/1007352.1007355" } @article{ feige98threshold, author = "Uriel Feige", title = "A Threshold of $\ln n$ for Approximating Set Cover", journal = jacm, volume = "45", number = "4", pages = "634--652", year = "1998", url = "citeseer.ist.psu.edu/feige95threshold.html", eprint="jacm:10.1145/285055.285059"} @book{ SpencerLectures, author = {Joel Spencer}, title = {Ten Lectures on the Probabilistic Method, 2nd Edition}, year = {1994}, chapter = {4}, pages = {29--36}, publisher = {SIAM} } @article{KolYoung05, author = {Stavros G. Kolliopoulos and Neal E. Young}, title = {Approximation algorithms for covering/packing integer programs}, journal = jcss, volume = {71}, number = {4}, year = {2005}, issn = {0022-0000}, pages = {495--505}, publisher = {Academic Press, Inc.}, eprint="jcss:10.1016/j.jcss.2005.05.002" } @inproceedings{WX05, author = {Avi Wigderson and David Xiao}, title = {A randomness-efficient sampler for matrix-valued functions and applications}, booktitle = {Proc.\ $46$th FOCS}, year={2005}, pages="397--406", eprint="focs:10.1109/SFCS.2005.8" } @misc{WXECCC, author = {Avi Wigderson and David Xiao}, title = {A randomness-efficient sampler for matrix-valued functions and applications}, howpublished = {ECCC Report TR05-107}, year = {2005}, eprint="eccc:TR05-107" } @inproceedings{ArKa07, author = {Sanjeev Arora and Satyen Kale}, title = {A combinatorial, primal-dual approach to semidefinite programs}, booktitle = {Proc. 39th STOC}, year = {2007}, isbn = {978-1-59593-631-8}, pages = {227--236}, location = {San Diego, California, USA}, publisher = {ACM}, address = {New York, NY, USA}, eprint="stoc:10.1145/1250790.1250823" } @book{GolubLoan, author = {G. H. Golub and C. F. Van Loan}, title = {Matrix Computations}, publisher = {Johns Hopkins University Press}, year = {1989} } %% last update acr 2008-08-03 @comment{ACM Transactions on Algorithms} @string{ACMTransAlgorithms="ACM Trans. Algorithms"} @comment{Econometrica. Journal of the Econometric Society} @string{Econometrica="Econometrica"} @comment{International Journal of Game Theory} @string{InternatJGameTheory="Internat. J. Game Theory"} @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{SIAM Journal on Applied Dynamical Systems} @string{SIAMJApplDynSyst="SIAM J. Appl. Dyn. Syst."} @comment{SIAM Journal on Applied Mathematics} @string{SIAMJApplMath="SIAM J. Appl. Math."} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{SIAM Journal on Control and Optimization} @string{SIAMJControlOptim="SIAM J. Control Optim."} @comment{SIAM Journal on Discrete Mathematics} @string{SIAMJDiscreteMath="SIAM J. Discrete Math."} @comment{SIAM Journal on Mathematical Analysis} @string{SIAMJMathAnal="SIAM J. Math. Anal."} @comment{SIAM Journal on Matrix Analysis and Applications} @string{SIAMJMatrixAnalAppl="SIAM J. Matrix Anal. Appl."} @comment{SIAM Journal on Numerical Analysis} @string{SIAMJNumerAnal="SIAM J. Numer. Anal."} @comment{SIAM Journal on Optimization} @string{SIAMJOptim="SIAM J. Optim."} @comment{SIAM Journal on Scientific Computing} @string{SIAMJSciComput="SIAM J. Sci. Comput."} @comment{SIAM Monographs on Discrete Mathematics and Applications} @string{SIAMMonogrDiscreteMathAppl="SIAM Monogr. Discrete Math. Appl."} @comment{SIAM Review} @string{SIAMRev="SIAM Rev."} @article{AKR95, Address = {Philadelphia, PA, USA}, Author = {Ajit Agrawal and Philip Klein and R. Ravi}, Issn = {0097-5397}, Journal = SIAMJComput, Number = {3}, Pages = {440--456}, Publisher = {Society for Industrial and Applied Mathematics}, Title = {When Trees Collide: An Approximation Algorithm for the Generalized {Steiner} Problem on Networks}, Volume = {24}, Year = {1995}, eprint="sicomp:10.1137/S0097539792236237"} @article{AKPSS02, Address = {New York, NY, USA}, Author = {Aditya Akella and Srinivasan Seshan and Richard Karp and Scott Shenker and Christos Papadimitriou}, Issn = {0146-4833}, Journal = {SIGCOMM Comput. Commun. Rev.}, Number = {4}, Pages = {117--130}, Publisher = {ACM}, Title = {Selfish behavior and stability of the {I}nternet: {A} game-theoretic analysis of {TCP}}, Volume = {32}, Year = {2002}, eprint="acm:964725.633037"} @inproceedings{AEEM06, Address = {New York, NY, USA}, Author = {Susanne Albers and Stefan Eilts and Eyal Even-Dar and Yishay Mansour and Liam Roditty}, Booktitle = {Proc. 17th ACM-SIAM Symp. on Discrete Algorithms (SODA'06)}, Isbn = {0-89871-605-5}, Location = {Miami, Florida}, Pages = {89--98}, Publisher = {ACM}, Title = {On {Nash} equilibria for a network creation game}, Year = {2006}, eprint="soda:1109557.1109568"} @inproceedings{ADKTWR04, Address = {Washington, DC, USA}, Author = {Elliot Anshelevich and Anirban Dasgupta and Jon Kleinberg and \'Eva Tardos and Tom Wexler and Tim Roughgarden}, Booktitle = {Proc. 45th FOCS}, Isbn = {0-7695-2228-9}, Pages = {295--304}, Publisher = {IEEE Computer Society}, Title = {The Price of Stability for Network Design with Fair Cost Allocation}, Year = {2004}, eprint="focs:10.1109/FOCS.2004.68"} @inproceedings{ADTW03, Address = {New York, NY, USA}, Author = {Elliot Anshelevich and Anirban Dasgupta and \'Eva Tardos and Tom Wexler}, Booktitle = {Proc. 35th STOC}, Isbn = {1-58113-674-9}, Location = {San Diego, CA, USA}, Pages = {511--520}, Publisher = {ACM}, Title = {Near-optimal network design with selfish agents}, Year = {2003}, eprint="stoc:780542.780617"} @inproceedings{AAE05, Address = {New York, NY, USA}, Author = {Baruch Awerbuch and Yossi Azar and Amir Epstein}, Booktitle = {Proc. 37th STOC}, Isbn = {1-58113-960-8}, Location = {Baltimore, MD, USA}, Pages = {57--66}, Publisher = {ACM}, Title = {The price of routing unsplittable flow}, Year = {2005}, eprint="stoc:1060590.1060599"} @article{BG00, Author = {Venkatesh Bala and Sanjeev Goyal}, Journal = Econometrica, Month = {September}, Number = {5}, Pages = {1181-1230}, Title = {A Noncooperative Model of Network Formation}, Url = {http://ideas.repec.org/a/ecm/emetrp/v68y2000i5p1181-1230.html}, Volume = {68}, Year = 2000} @inproceedings{CCCDGGL98, Address = {Philadelphia, PA, USA}, Author = {Moses Charikar and Chandra Chekuri and To-yat Cheung and Zuo Dai and Ashish Goel and Sudipto Guha and Ming Li}, Booktitle = {Proc. 9th ACM-SIAM Symp. on Discrete Algorithms (SODA'98)}, Isbn = {0-89871-410-9}, Location = {San Francisco, California, United States}, Pages = {192--200}, Publisher = {Society for Industrial and Applied Mathematics}, Title = {Approximation algorithms for directed {Steiner} problems}, Year = {1998}, eprint="soda:314613.314700"} @inproceedings{CCLNO06, Address = {New York, NY, USA}, Author = {Chandra Chekuri and Julia Chuzhoy and Liane Lewin-Eytan and Joseph (Seffi) Naor and Ariel Orda}, Booktitle = {Proc. 7th ACM Conference on Electronic Commerce (EC'06)}, Isbn = {1-59593-236-4}, Location = {Ann Arbor, Michigan, USA}, Pages = {72--81}, Publisher = {ACM}, Title = {Non-cooperative multicast and facility location games}, Year = {2006}, eprint="acm:1134707.1134716"} @inproceedings{CR06, Address = {New York, NY, USA}, Author = {Ho-Lin Chen and Tim Roughgarden}, Booktitle = {Proc. 18th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA'06)}, Isbn = {1-59593-452-9}, Location = {Cambridge, Massachusetts, USA}, Pages = {29--38}, Publisher = {ACM}, Title = {Network design with weighted players}, Year = {2006}, eprint="acm:1148109.1148114"} @inproceedings{CK05, Address = {New York, NY, USA}, Author = {George Christodoulou and Elias Koutsoupias}, Booktitle = {Proc. 37th STOC}, Isbn = {1-58113-960-8}, Location = {Baltimore, MD, USA}, Pages = {67--73}, Publisher = {ACM}, Title = {The price of anarchy of finite congestion games}, Year = {2005}, eprint="stoc:1060590.1060600"} @inproceedings{CKV02, author = {Artur Czumaj and Piotr Krysta and Berthold V\"{o}cking}, title = {Selfish traffic allocation for server farms}, booktitle = {Proc. STOC}, year = {2002}, isbn = {1-58113-495-9}, pages = {287--296}, location = {Montreal, Quebec, Canada}, publisher = {ACM}, address = {New York, NY, USA}, eprint="stoc:509907.509952"} @article{CV07, Address = {New York, NY, USA}, Author = {Artur Czumaj and Berthold V\"{o}cking}, Issn = {1549-6325}, Journal = ACMTransAlgorithms, Number = {1}, Pages = {4}, Publisher = {ACM}, Title = {Tight bounds for worst-case equilibria}, Volume = {3}, Year = {2007}, eprint={acm:1186810.1186814,acm:545436}} @article{DGH02, Address = {New York, NY, USA}, Author = {Debojyoti Dutta and Ashish Goel and John Heidemann}, Date-Modified = {2008-06-16 16:02:25 -0400}, Issn = {0146-4833}, Journal = {SIGCOMM Comput. Commun. Rev.}, Number = {3}, Pages = {20--20}, Publisher = {ACM}, Title = {Oblivious {AQM} and {Nash} equilibria}, Volume = {32}, Year = {2002}, eprint="acm:571697.571709"} @inproceedings{EFM07, Address = {New York, NY, USA}, Author = {Amir Epstein and Michal Feldman and Yishay Mansour}, Booktitle = {Proc. 8th ACM Conference on Electronic Commerce (EC'07)}, Isbn = {978-1-59593-653-0}, Location = {San Diego, California, USA}, Pages = {84--92}, Publisher = {ACM}, Title = {Strong equilibrium in cost sharing connection games}, Year = {2007}, eprint="acm:1250910.1250924"} @inproceedings{FLMPS03, Address = {New York, NY, USA}, Author = {Alex Fabrikant and Ankur Luthra and Elitza Maneva and Christos H. Papadimitriou and Scott Shenker}, Booktitle = {Proc. 22nd Symp. on Principles of Distributed Computing (PODC'03)}, Isbn = {1-58113-708-7}, Location = {Boston, Massachusetts}, Pages = {347--351}, Publisher = {ACM}, Title = {On a network creation game}, Year = {2003}, eprint="acm:872035.872088"} @article{F98, Address = {New York, NY, USA}, Author = {Uriel Feige}, Issn = {0004-5411}, Journal = JACM, Number = {4}, Pages = {634--652}, Publisher = {ACM}, Title = {A threshold of {$\ln n$} for approximating set cover}, Volume = {45}, Year = {1998}, eprint="jacm:285055.285059"} @article{FPS01, Address = {Orlando, FL, USA}, Author = {Joan Feigenbaum and Christos H. Papadimitriou and Scott Shenker}, Issn = {0022-0000}, Journal = JComputSystemSci, Number = {1}, Pages = {21--41}, Publisher = {Academic Press, Inc.}, Title = {Sharing the cost of multicast transmissions}, Volume = {63}, Year = {2001}, eprint="jcss:10.1006/jcss.2001.1754"} @inproceedings{FKLOS06, Author = {Amos Fiat and Haim Kaplan and Meital Levy and Svetlana Olonetsky and Ronen Shabo}, Booktitle = {Proc. 33rd International Colloq. on Automata, Languages, and Programming (ICALP'06)}, Date = {2006-07-03}, Isbn = {3-540-35904-4}, Pages = {608-618}, Publisher = {Springer}, Series = {Lecture Notes in Computer Science}, Title = {On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations.}, Url = {http://dblp.uni-trier.de/db/conf/icalp/icalp2006-1.html#FiatKLOS06}, Volume = {4051}, Year = {2006}, eprint="icalp:w045t0318v5116xl"} @article{GW95, Address = {Philadelphia, PA, USA}, Author = {Michel X. Goemans and David P. Williamson}, Issn = {0097-5397}, Journal = SIAMJComput, Number = {2}, Pages = {296--317}, Publisher = {Society for Industrial and Applied Mathematics}, Title = {A General Approximation Technique for Constrained Forest Problems}, Volume = {24}, Year = {1995}, eprint="sicomp:10.1137/S0097539793242618"} @techreport{HS01, Author = {H. Heller and S. Sarangi}, Institution = {Virginia Tech}, Number = {E-2001-1}, Title = {{Nash} Networks with Heterogeneous Agents}, Type = {Working Paper}, Year = 2001, url="http://www.bus.lsu.edu/economics/papers/pap03_06.pdf"} @inproceedings{H06, Author = {Martin Hoefer}, Bibsource = {DBLP, http://dblp.uni-trier.de}, Booktitle = {Proc. 31st Int. Symp. on Mathematical Foundations of Computer Science (MFCS'06)}, Pages = {517-527}, Title = {Non-cooperative Tree Creation}, Year = {2006}, eprint="mfcs:uu60q8258u47802v"} @inproceedings{H06b, Author = {Martin Hoefer}, Bibsource = {DBLP, http://dblp.uni-trier.de}, Booktitle = {Proc. 17th Int. Symp. on Algorithms and Computation (ISAAC'06)}, Pages = {369-378}, Title = {Non-cooperative Facility Location and Covering Games}, Year = {2006}, eprint="isaac:rwk3528257852rh1"} @inproceedings{HK05, Author = {Martin Hoefer and Piotr Krysta}, Bibsource = {DBLP, http://dblp.uni-trier.de}, Booktitle = {Proc. 11th Int. Conf. on Computing and Combinatorics (COCOON'05)}, Pages = {167-178}, Title = {Geometric Network Design with Selfish Agents}, Year = {2005}, eprint="springer:2fbchhr9y2x08k8l"} @inproceedings{JV01, Address = {New York, NY, USA}, Author = {Kamal Jain and Vijay Vazirani}, Booktitle = {Proc. 33rd STOC}, Isbn = {1-58113-349-9}, Location = {Hersonissos, Greece}, Pages = {364--372}, Publisher = {ACM}, Title = {Applications of approximation algorithms to cooperative games}, Year = {2001}, eprint="stoc:380752.380825"} @inproceedings{KP99, Address = {Trier, Germany}, Author = {E. Koutsoupias and C. Papadimitriou}, Booktitle = {Proc. 16th Symp. on Theoretical Aspects of Computer Science (STACS'99)}, Month = mar, Pages = {404--413}, Title = {Worst-case equilibria}, Year = 1999, eprint="stacs:y37e5ne8bbafjb5r"} @inproceedings{MS01, author = {Marios Mavronicolas and Paul Spirakis}, title = {The price of selfish routing}, booktitle = {Proc. STOC}, year = {2001}, isbn = {1-58113-349-9}, pages = {510--519}, location = {Hersonissos, Greece}, publisher = {ACM}, address = {New York, NY, USA}, eprint="stoc:380752.380846"} @article{MS96, author={Dov Monderer and Lloyd S. Shapley}, title={Potential Games}, journal={Games and Economic Behavior}, year=1996, volume={14}, number={1}, pages={124--143}, month={May}, url={http://ideas.repec.org/a/eee/gamebe/v14y1996i1p124-143.html} } @inproceedings{P01, Address = {New York, NY, USA}, Author = {Christos Papadimitriou}, Booktitle = {Proc. 33rd STOC}, Isbn = {1-58113-349-9}, Location = {Hersonissos, Greece}, Pages = {749--753}, Publisher = {ACM}, Title = {Algorithms, games, and the internet}, Year = {2001}, eprint="stoc:380752.380883"} @inproceedings{RZ00, Address = {Philadelphia, PA, USA}, Author = {Gabriel Robins and Alexander Zelikovsky}, Booktitle = {Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA'00)}, Isbn = {0-89871-453-2}, Location = {San Francisco, California, United States}, Pages = {770--779}, Publisher = {Society for Industrial and Applied Mathematics}, Title = {Improved {Steiner} tree approximation in graphs}, Year = {2000}, eprint="soda:338219.338638"} @article{R73, Author = {R.W. Rosenthal}, Journal = InternatJGameTheory, Pages = {65--67}, Title = {A Class of Games Possessing Pure-Strategy {Nash} Equilibria}, Volume = {2}, Year = {1973}} @inproceedings{R02, Address = {New York, NY, USA}, Author = {Tim Roughgarden}, Booktitle = {Proc. 34th STOC}, Isbn = {1-58113-495-9}, Location = {Montreal, Quebec, Canada}, Pages = {428--437}, Publisher = {ACM}, Title = {The price of anarchy is independent of the network topology}, Year = {2002}, eprint="stoc:509907.509971"} @inproceedings{R01, Address = {New York, NY, USA}, Author = {Tim Roughgarden}, Booktitle = {Proc. 33rd STOC}, Isbn = {1-58113-349-9}, Location = {Hersonissos, Greece}, Pages = {104--113}, Publisher = {ACM}, Title = {{Stackelberg} scheduling strategies}, Year = {2001}, eprint="stoc:380752.380783"} @article{RT02, Address = {New York, NY, USA}, Author = {Tim Roughgarden and \'{E}va Tardos}, Issn = {0004-5411}, Journal = JACM, Number = {2}, Pages = {236--259}, Publisher = {ACM}, Title = {How bad is selfish routing?}, Volume = {49}, Year = {2002}, eprint="jacm:506147.506153"} @inproceedings{SS03, Address = {Philadelphia, PA, USA}, Author = {Andreas S. Schulz and Nicol\'{a}s Stier Moses}, Booktitle = {Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA'03)}, Isbn = {0-89871-538-5}, Location = {Baltimore, Maryland}, Pages = {86--87}, Publisher = {Society for Industrial and Applied Mathematics}, Title = {On the performance of user equilibria in traffic networks}, Year = {2003}, eprint="soda:644108.644121"} @article{S90, Address = {New York, NY, USA}, Author = {Scott Shenker}, Issn = {0163-5999}, Journal = {SIGMETRICS Perform. Eval. Rev.}, Number = {1}, Pages = {241--242}, Publisher = {ACM}, Title = {Making greed work in networks: a game-theoretic analysis of gateway service disciplines}, Volume = {18}, Year = {1990}, eprint="acm:98460.98764"} @inproceedings{V02, Address = {Washington, DC, USA}, Author = {Adrian Vetta}, Booktitle = {Proc. 43rd FOCS}, Isbn = {0-7695-1822-2}, Pages = {416}, Publisher = {IEEE Computer Society}, Title = {{Nash} Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions}, Year = {2002}, eprint="focs:10.1109/SFCS.2002.1181966"} --Apple-Mail-4--1003346821 Content-Type: text/plain; charset=US-ASCII; format=flowed Content-Transfer-Encoding: 7bit --Apple-Mail-4--1003346821-- %% ToC#256.bib Trevisan edited by LB 2007-09-10, DB on 2008-07-09 @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @inproceedings{CMM06, title = {Near-Optimal Algorithms for Unique Games}, author = {Moses Charikar and Konstantin Makarychev and Yury Makarychev}, booktitle = {Proc. 38th STOC}, publisher = {ACM Press}, pages = {205--214}, year = 2006, eprint="stoc:1132516.1132547" } @inproceedings{ClMM06, author = {Eden Chlamtac and Konstantin Makarychev and Yury Makarychev}, title = {How to Play Unique Games Using Embeddings}, booktitle = {Proc. 47th FOCS}, year = 2006, pages = {687--696}, publisher = {IEEE Computer Society}, eprint="focs:10.1109/FOCS.2006.36" } @inproceedings{GT06, author = {Anupam Gupta and Kunal Talwar}, title = {Approximating unique games}, booktitle = {Proc. 17th ACM-SIAM Symp. on Discrete Algorithms (SODA'06)}, year = 2006, pages = {99--106}, publisher="ACM Press", eprint="soda:1109557.1109569"} @inproceedings{KV05, author = {Subhash Khot and Nisheeth Vishnoi}, title = {The Unique Games Conjecture, Integrality Gap for Cut Problems and the Embeddability of Negative Type Metrics into $\ell_1$}, booktitle = {Proc. 46th FOCS}, publisher = {IEEE Computer Society}, pages = {53--63}, year = 2005, eprint="focs:10.1109/SFCS.2005.74"} @inproceedings{K02:unique, author = {Subhash Khot}, title = {On the power of unique 2-prover 1-round games}, booktitle = {Proc. 34th STOC}, publisher = {ACM Press}, pages = {767--775}, year = 2002, eprint="stoc:509907.510017"} @article{KR08, title = {Vertex Cover Might be Hard to Approximate to within $2-\epsilon$}, author = {Subhash Khot and Oded Regev}, journal=JComputSystemSci, volume=74, pages ="335--349", year = 2008, note="Preliminary version in {\em Proc. CCC'03}.", eprint="jcss:10.1016/j.jcss.2007.06.019"} @inproceedings{CKKRS05, title = {On the Hardness of Approximating Multicut and Sparsest-Cut}, author = {Shuchi Chawla and Robert Krauthgamer and Ravi Kumar and Yuval Rabani and D.Sivakumar}, booktitle = {Proc. 20th IEEE Conf. on Computational Complexity}, year = 2005, publisher = {IEEE Computer Society}, pages="144--153", eprint="ccc:10.1109/CCC.2005.20"} @inproceedings{FR04, author = {Uriel Feige and Daniel Reichman}, title = {On Systems of Linear Equations with Two Variables per Equation}, booktitle = {7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'04)}, publisher = "Springer", year = 2004, pages = {117--127}, eprint="springer:uk7fpuul45c5h6j5"} @inproceedings{KKMO04, title = {Optimal inapproximability results for {MAX-CUT} and other two-variable {CSP}s?}, author = {Subhash Khot and Guy Kindler and Elchanan Mossel and Ryan O'Donnell}, booktitle = {Proc. 45th FOCS}, publisher = {IEEE Computer Society}, year = 2004, pages = {146--154}, eprint="focs:10.1109/FOCS.2004.49"} @article{LR99, title = {Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms}, author = {Frank T. Leighton and Satish Rao}, journal = {J. ACM}, pages = {787--832}, volume = 46, numer = 6, year = 1999, eprint="jacm:331524.331526"} @inproceedings{MOO05, title = {Noise stability of functions with low influences: invariance and optimality}, author = {Elchanan Mossel and Ryan O'Donnell and Krzysztof Oleszkiewicz}, booktitle = {Proc. 46th FOCS}, publisher = {IEEE Computer Society}, pages = {21--30}, year = 2005, eprint="focs:10.1109/SFCS.2005.53"} @inproceedings{O04, author = {Kenji Obata}, title = {Approximate max-integral-flow/min-multicut theorems}, booktitle = {Proc. 36th STOC}, publisher = {ACM Press}, pages = {539--545}, year = 2004, eprint="stoc:1007352.1007433"} @inproceedings{DMR06, title = {Conditional Hardness for Approximate Coloring}, booktitle = {Proc. 38th STOC}, publisher = {ACM Press}, Author ={Irit Dinur and Elchanan Mossel and Oded Regev}, year = 2006, pages="344--353", eprint="stoc:1132516.1132567"} @inproceedings{FL92, author = {Uri Feige and L\'aszl\'o Lov\'asz}, title = {Two-prover one round proof systems: {T}heir power and their problems}, booktitle = {Proc. 24th STOC}, publisher = {ACM Press}, pages = {733--741}, year = 1992, eprint="stoc:129712.129783"} @Article{R95, title={A Parallel Repetition Theorem}, author={Ran Raz}, pages={763--803}, journal= {SIAM J. Computing}, year = 1998, volume=27, number=3, note = {Preliminary version in {\em STOC'95}}, eprint="sicomp:10.1137/S0097539795280895,stoc:225058.225181"} @inproceedings{AKKSTV08, author="Sanjeev Arora and Subhash Khot and Alexandra Kolla and David Steurer and Madhur Tulsiani and Nisheeth Vishnoi", title="Unique games on expanding constraint graphs are easy", booktitle="Proc. 40th STOC", publisher = {ACM Press}, year=2008, pages="21--28", eprint="stoc:10.1145/1374376.1374380"} @inproceedings{A07, author="Per Austrin", title="Balanced max 2-{SAT} might not be the hardest", booktitle="Proc. 39th STOC", publisher = {ACM Press}, pages="189--197", year=2007, eprint="stoc:10.1145/1250790.1250818"} @inproceedings{A07b, author="Per Austrin", title="Towards sharp inapproximability for any {2-CSP}", booktitle="Proc. 48th FOCS", publisher = {IEEE Computer Society}, pages="307--317", year=2007, eprint="focs:10.1109/FOCS.2007.73"} @inproceedings{KOD06, author="Subhash Khot and Ryan O'Donnell", title="{SDP} gaps and {UGC}-hardness for {MAXCUTGAIN}", booktitle="Proc. 47th FOCS", publisher = {IEEE Computer Society}, pages="217--226", year=2006, eprint="focs:10.1109/FOCS.2006.67"} @inproceedings{MNRS08, author="Rajeskar Manokaran and Seffi Naor and Prasad Raghavendra and Roy Schwartz", title="{SDP} gaps and {UGC} hardness for multiway cut, 0-extension and metric labeling", booktitle="Proc. 40th STOC", publisher = {ACM Press}, year=2008, pages="11--20", eprint="stoc:10.1145/1374376.1374379"} @inproceedings{ODW08, author="Ryan O'Donnell and Yi Wu", title="An optimal {SDP} algorithm for {M}ax-{C}ut, and equally optimal long code tests", booktitle="Proc. 40th STOC", publisher = {ACM Press}, year=2008, pages="335--344", eprint="stoc:10.1145/1374376.1374425"} @inproceedings{R08, author="Prasad Raghavendra", title="Optimal algorithms and inapproximability results for every {CSP}?", booktitle="Proc. 40th STOC", publisher = {ACM Press}, year=2008, pages="245--254", eprint="stoc:10.1145/1374376.1374414"} @inproceedings{ST06, author="Alex Samorodnitsky and Luca Trevisan", title="Gowers uniformity, influence of variables, and {PCP}s", booktitle="Proc. 38th STOC", publisher = {ACM Press}, pages="11--20", year=2006, eprint="stoc:10.1145/1132516.1132519"} %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2008-09-23 15:50:19 -0400 %% Saved with string encoding Unicode (UTF-8) @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Computational Complexity} @string{CompComplex="Comput. Complexity"} @comment{Information Processing Letters} @string{InformProcessLett="Inform. Process. Lett."} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @inproceedings{BJKS02, Author = {Z. {Bar-Yossef} and T.S. Jayram and R. Kumar and D. Sivakumar}, Booktitle = {Proc. 17th Annual IEEE Conf. Computational Complexity}, Date-Modified = {2008-09-23 15:44:04 -0400}, Pages = {93--102}, Publisher = {IEEE}, Title = {Information Theory Methods in Communication Complexity}, Year = {2002}, eprint="ccc:10.1109/CCC.2002.1004344"} @article{GW95, Author = {M. X. Goemans and D. P. Williamson}, Date-Modified = {2008-09-23 15:46:55 -0400}, Journal = JACM, Number = {6}, Pages = {1115--1145}, Title = {Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming}, Volume = {42}, Year = {1995}, eprint="jacm:10.1145/227683.227684"} @article{KNR99, Author = {I. Kremer and N. Nisan and D. Ron}, Journal = CompComplex, Number = {1}, Pages = {21--49}, Publisher = {Birkhauser Verlag}, Title = {On randomized one-round communication complexity}, Volume = {8}, Year = {1999}, eprint="springer:w5pccfda9jbhpgdj"} @book{KN97, Author = {E. Kushilevitz and N. Nisan}, Publisher = {Cambridge University Press}, Title = {Communication Complexity}, Year = {1997}} @book{mcd98, Address = {Berlin}, Author = {C. McDiarmid}, Owner = {jayram}, Pages = {xviii+323}, Publisher = {Springer-Verlag}, Series = {Algorithms and Combinatorics}, Timestamp = {2007.09.14}, Title = {Probabilistic Methods for Algorithmic Discrete Mathematics}, Volume = {16}, Year = {1998}} @article{Newman, Author = {I. Newman}, Journal = InformProcessLett, Number = {2}, Pages = {67--71}, Title = {Private vs. common random bits in communication complexity}, Volume = {39}, Year = {1991}, eprint="ipl:10.1016/0020-0190(91)90157-D"} @inproceedings{Woodruff04, Author = {D. Woodruff}, Booktitle = {Proc. 15th Annual ACM-SIAM Symp. Discrete Algorithms (SODA)}, Date-Modified = {2008-09-23 15:46:32 -0400}, Pages = {167--175}, Publisher = {SIAM}, Title = {Optimal space lower bounds for all frequency moments}, Year = {2004}, eprint="soda:982792.982817"} @book{vanLint, Author = {van Lint, J. H.}, Date-Modified = {2008-09-23 15:43:30 -0400}, Publisher = {Springer}, Title = {Introduction to Coding Theory}, Year = {1999}} @inproceedings{BKS02, Author = {Z. Bar-Yossef and R. Kumar and D. Sivakumar}, Booktitle = {Proc. 13th ACM-SIAM Symp. Discrete Algorithms (SODA)}, Date-Modified = {2008-09-23 15:46:11 -0400}, Pages = {623--632}, Publisher = {SIAM}, Title = {Reductions in streaming algorithms, with an application to counting triangles in graphs}, Year = {2002}, eprint="soda:545381.545464"} @article{AMS, Author = {N. Alon and Y. Matias and M. Szegedy}, Journal = JComputSystemSci, Number = {1}, Pages = {137--147}, Title = {The space complexity of approximating the frequency moments}, Volume = {58}, Year = {1999}, eprint="jcss:10.1006/jcss.1997.1545"} @phdthesis{wood-thesis, Author = {D. Woodruff}, School = {MIT}, Title = {Efficient and Private Distance Approximation in the Communication and Streaming Models}, Year = {2007}} @article{KOR, Author = {E. Kushilevitz and R. Ostrovsky and Y. Rabani}, Journal = SIAMJComput, Number = {2}, Pages = {457--474}, Title = {Efficient search for approximate nearest neighbor in high dimensional spaces}, Volume = {30}, Year = {2000}, eprint="sicomp:10.1137/S0097539798347177"} %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2008-11-14 16:57:39 -0500 %% Saved with string encoding Unicode (UTF-8) @comment{{This file has been generated by bib2bib 1.85}} @comment{{Command line: /usr/bin/bib2bib -c '$key="Nis91" or $key="BNS92" or $key="ShV-dec" or $key="Gow98" or $key="Yao82" or $key="ChT93" or $key="ShU05" or $key="NaN90" or $key="Yao79" or $key="Cha06" or $key="GoL89" or $key="GuV04" or $key="AKKLR03" or $key="ViolaGF2" or $key="Raz87" or $key="Raz00" or $key="GrT05" or $key="Hea06" or $key="AGHP92" or $key="ImW97" or $key="NiW94" or $key="Sha03" or $key="HaG91" or $key="GRS05" or $key="CFL83" or $key="PRW97" or $key="Lev87" or $key="Imp95" or $key="Sam07" or $key="LVW93" or $key="SmT06" or $key="Grolmusz95" or $key="Bou05" or $key="NRS99" or $key="Fei95" or $key="KuN97" or $key="JPRZ04" or $key="Smo87" or $key="Raz98" or $key="HMPST93" or $key="GNW95" or $key="Gow01" or $key="Viola-SYMAC0" or 1=2' ./a005.bib}} @comment{SIAM Journal on Computing} @comment{SIAM Journal on Discrete Mathematics} @comment{Journal of Computer and System Sciences} @comment{Computational Complexity} @comment{Geometric and Functional Analysis} @comment{Comptes Rendus Mathematique} @comment{Random Structures & Algorithms} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @string{combinatorica = {Combinatorica}} @string{compcomplex = {Comput. Complexity}} @string{crmath = {C. R. Math.}} @string{geomfunctanal = {Geom. Funct. Anal.}} @string{jcomputsystemsci = {J. Comput. System Sci.}} @string{randomstructuresalgorithms = {Random Structures Algorithms}} @string{siamjcomput = {SIAM J. Comput.}} @string{siamjdiscretemath = {SIAM J. Discrete Math.}} @string{webend = {\end{tt}}} @string{webmid = {\linebreak[0]}} @string{webstart = {\begin{tt}}} @inproceedings{ShV-dec, Address = {Victoria, Canada}, Author = {Ronen Shaltiel and Emanuele Viola}, Booktitle = {Proc. 40th STOC}, Eprint = {stoc:1374376.1374461}, Pages = {589--598}, Publisher = {ACM Press}, Title = {Hardness amplification proofs require majority}, Year = 2008} @techreport{ViolaGF2, Author = {Emanuele Viola}, Eprint = {eccc:TR06-097}, Institution = {Electronic Colloquium on Computational Complexity}, Number = {TR06-097}, Title = {New correlation bounds for {$\textrm{GF}(2)$} polynomials using {G}owers uniformity}, Year = {2006}} @article{Viola-SYMAC0, Author = {Emanuele Viola}, Eprint = {sicomp:10.1137/050640941}, Journal = SIAMJComput, Number = {5}, Pages = {1387--1403}, Publisher = {SIAM}, Title = {Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates}, Url = {http://link.aip.org/link/?SMJ/36/1387/1}, Volume = {36}, Year = {2007}, Bdsk-Url-1 = {http://link.aip.org/link/?SMJ/36/1387/1}} @inproceedings{GuV04, Author = {Dan Gutfreund and Emanuele Viola}, Booktitle = {Proc. 8th Intern. Workshop on Randomization and Computation (RANDOM'08)}, Eprint = {springer:x9px6h8l0tb6et6b}, Pages = {381--392}, Publisher = {Springer-Verlag}, Series = {LNCS}, Title = {Fooling Parity Tests with Parity Gates}, Volume = 3122, Year = {2004}} @article{Grolmusz95, Author = {Grolmusz, Vince}, Date-Modified = {2008-11-14 16:57:13 -0500}, Eprint = {jcss:10.1006/jcss.1995.1069}, Fjournal = {Journal of Computer and System Sciences}, Journal = JComputSystemSci, Number = {2}, Pages = {307--313}, Title = {Separating the communication complexities of {$\bmod m$} and {$\bmod p$} circuits}, Volume = {51}, Year = {1995}} @techreport{Fei95, Address = {Jerusalem, Israel}, Author = {Feige, Uri}, Institution = {Weizmann Science Press of Israel}, Title = {Error reduction by parallel repetition-the state of the art}, Year = {1995}} @article{Raz98, Author = {Raz, Ran}, Eprint = {sicomp:10.1137/S0097539795280895}, Fjournal = {SIAM Journal on Computing}, Journal = SIAMJComput, Number = {3}, Pages = {763--803}, Title = {A parallel repetition theorem}, Volume = {27}, Year = {1998}} @article{NRS99, Author = {Nisan, Noam and Rudich, Steven and Saks, Michael}, Eprint = {sicomp:10.1137/S0097539795282444}, Fjournal = {SIAM Journal on Computing}, Journal = SIAMJComput, Number = {3}, Pages = {1035--1050}, Title = {Products and help bits in decision trees}, Volume = {28}, Year = {1999}} @inproceedings{CFL83, Address = {Boston, Massachusetts}, Author = {Ashok K. Chandra and Merrick L. Furst and Richard J. Lipton}, Booktitle = {Proc. 15th STOC}, Eprint = {stoc:800061.808737}, Pages = {94--99}, Publisher = {ACM Press}, Title = {Multi-party protocols}, Year = 1983} @inproceedings{Yao79, Address = {New York}, Author = {Andrew Chi-Chih Yao}, Booktitle = {Proc. 11th STOC}, Eprint = {stoc:800135.804414}, Location = {Atlanta, Georgia, United States}, Pages = {209--213}, Publisher = {ACM Press}, Title = {Some complexity questions related to distributive computing}, Year = {1979}} @article{Raz00, Author = {Raz, Ran}, Eprint = {cc:u8q21j1ccvltrb40}, Fjournal = {Computational Complexity}, Issn = {1016-3328}, Journal = CompComplex, Number = {2}, Pages = {113--122}, Title = {The {BNS}-{C}hung criterion for multi-party communication complexity}, Volume = {9}, Year = {2000}} @article{Sha03, Author = {Shaltiel, Ronen}, Eprint = {cc:ku74rl1ga9te5lpe}, Fjournal = {Computational Complexity}, Journal = CompComplex, Number = {1-2}, Pages = {1--22}, Title = {Towards proving strong direct product theorems}, Volume = {12}, Year = {2003}} @inproceedings{PRW97, Address = {New York}, Author = {Parnafes, Itzhak and Raz, Ran and Wigderson, Avi}, Booktitle = {Proc. 29th STOC}, Eprint = {stoc:258533.258620}, Pages = {363--372}, Publisher = {ACM Press}, Title = {Direct product results and the {GCD} problem, in old and new communication models}, Year = {1997}} @techreport{Cha06, Author = {Arkadev Chattopadhyay}, Eprint = {eccc:TR06-107}, Institution = {Electronic Colloquium on Computational Complexity}, Number = {TR06-107}, Title = {An improved bound on correlation between polynomials over {$Z_m$} and {$\textrm{MOD}_q$}}, Year = {2006}} @inproceedings{Hea06, Author = {Alexander Healy}, Booktitle = {Proceedings of the 10th International Workshop on Randomization and Computation (RANDOM'06)}, Eprint = {springer:b773545612310728}, Pages = {398--409}, Publisher = {Springer-Verlag}, Series = {LNCS}, Title = {Randomness-Efficient Sampling within $\textrm{NC}^1$}, Volume = 4110, Year = {2006}} @inproceedings{Sam07, Address = {New York}, Author = {Alex Samorodnitsky}, Booktitle = {Proc. 39th STOC}, Eprint = {stoc:1250790.1250864}, Pages = {506--515}, Publisher = {ACM Press}, Title = {Low-degree tests at large distances}, Year = {2007}} @inproceedings{SmT06, Address = {New York}, Author = {Alex Samorodnitsky and Luca Trevisan}, Booktitle = {Proc. 38th STOC}, Eprint = {stoc:1132516.1132519}, Month = {May}, Pages = {11--20}, Publisher = {ACM Press}, Title = {{Gowers} uniformity, influence of variables, and {PCP}s}, Year = {2006}} @article{Gow01, Author = {Gowers, W. T.}, Eprint = {springer:00622770r8437760}, Fjournal = {Geometric and Functional Analysis}, Journal = GeomFunctAnal, Number = {3}, Pages = {465--588}, Title = {A new proof of {S}zemer\'edi's theorem}, Volume = {11}, Year = {2001}} @article{Gow98, Author = {Gowers, W. T.}, Eprint = {springer:lg2rlw8pvtt2x0qj}, Fjournal = {Geometric and Functional Analysis}, Journal = GeomFunctAnal, Number = {3}, Pages = {529--551}, Title = {A new proof of {S}zemer\'edi's theorem for arithmetic progressions of length four}, Volume = {8}, Year = {1998}} @article{ChT93, Author = {Chung, Fan R. K. and Tetali, Prasad}, Eprint = {sidma:10.1137/0406009}, Fjournal = {SIAM Journal on Discrete Mathematics}, Journal = SIAMJDiscreteMath, Number = {1}, Pages = {110--123}, Title = {Communication complexity and quasi randomness}, Volume = {6}, Year = {1993}} @inproceedings{JPRZ04, Address = {Los Alamitos, CA, USA}, Author = {Charanjit S. Jutla and Anindya C. Patthak and Atri Rudra and David Zuckerman}, Booktitle = {Proc. 45th FOCS}, Eprint = {focs:10.1109/FOCS.2004.64}, Pages = {423--432}, Publisher = {IEEE Computer Society}, Title = {Testing Low-Degree Polynomials over Prime Fields}, Year = {2004}} @incollection{AKKLR03, Address = {Berlin}, Author = {Alon, Noga and Kaufman, Tali and Krivelevich, Michael and Litsyn, Simon and Ron, Dana}, Booktitle = {Approximation, randomization, and combinatorial optimization}, Eprint = {springer:5pcg1j8cfl39tmpy}, Pages = {188--199}, Publisher = {Springer-Verlag}, Series = {LNCS}, Title = {Testing low-degree polynomials over {${\rm GF}(2)$}}, Volume = {2764}, Year = {2003}} @misc{GrT05, Author = {Ben Green and Terence Tao}, Eprint = {arXiv:math/0503014}, Note = {arXiv.org:math/0503014}, Title = {An inverse theorem for the {G}owers {$U^3$} norm}, Year = {2005}} @article{Bou05, Author = {Bourgain, Jean}, Eprint = {elsevier:10.1016/j.crma.2005.03.008}, Fjournal = {Comptes Rendus Math\'ematique}, Journal = CRMath, Number = {9}, Pages = {627--631}, Title = {Estimation of certain exponential sums arising in complexity theory}, Volume = {340}, Year = {2005}} @article{GRS05, Author = {Green, Frederic and Roy, Amitabha and Straubing, Howard}, Eprint = {elsevier:10.1016/j.crma.2005.07.011}, Fjournal = {Comptes Rendus Math\'ematique}, Journal = CRMath, Number = {5}, Pages = {279--282}, Title = {Bounds on an exponential sum arising in {B}oolean circuit complexity}, Volume = {341}, Year = {2005}} @book{KuN97, Address = {Cambridge}, Author = {Kushilevitz, Eyal and Nisan, Noam}, Publisher = {Cambridge University Press}, Title = {Communication complexity}, Year = {1997}} @article{AGHP92, Author = {Alon, Noga and Goldreich, Oded and H{\aa}stad, Johan and Peralta, Ren{\'e}}, Eprint = {wiley:10.1002/rsa.3240030308}, Fjournal = {Random Structures \& Algorithms}, Journal = RandomStructuresAlgorithms, Number = {3}, Pages = {289--304}, Title = {Simple constructions of almost {$k$}-wise independent random variables}, Volume = {3}, Year = {1992}} @inproceedings{NaN90, Author = {J. Naor and M. Naor}, Booktitle = {Proc. 22nd STOC}, Eprint = {stoc:100216.100244}, Pages = {213--223}, Publisher = {ACM Press}, Title = {Small-bias probability spaces: efficient constructions and applications}, Year = 1990} @inproceedings{LVW93, Address = {Los Alamitos, CA, USA}, Author = {Michael Luby and Boban Velickovic and Avi Wigderson}, Booktitle = {Proc. 2nd Israeli Symp. on Theoretical Computer Science (ISTCS'93)}, Pages = {18--24}, Publisher = {IEEE Computer Society}, Title = {Deterministic Approximate Counting of Depth-2 Circuits}, Year = {1993}} @article{HMPST93, Author = {Hajnal, {Andr\'{a}s} and Maass, Wolfgang and {Pudl\'{a}k}, Pavel and Szegedy, {M\'{a}ri\'{o}} and {Tur\'{a}n}, {Gy\"{o}rgy}}, Date-Modified = {2008-11-14 16:56:00 -0500}, Eprint = {jcss:10.1016/0022-0000(93)90001-D}, Fjournal = {Journal of Computer and System Sciences}, Journal = JComputSystemSci, Number = {2}, Pages = {129--154}, Title = {Threshold circuits of bounded depth}, Volume = {46}, Year = {1993}} @article{BNS92, Author = {Babai, {L\'{a}szl\'{o}} and Nisan, Noam and Szegedy, {M\'{a}ri\'{o}}}, Date-Modified = {2008-11-14 16:54:04 -0500}, Eprint = {jcss:10.1016/0022-0000(92)90047-M}, Fjournal = {Journal of Computer and System Sciences}, Journal = JComputSystemSci, Number = {2}, Pages = {204--232}, Title = {Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs}, Volume = {45}, Year = {1992}} @article{HaG91, Author = {H{\aa}stad, Johan and Goldmann, Mikael}, Date-Modified = {2008-11-14 16:52:35 -0500}, Eprint = {cc:r0mv45x710nn1q76}, Fjournal = {Computational Complexity}, Journal = CompComplex, Number = {2}, Pages = {113--129}, Title = {On the power of small-depth threshold circuits}, Volume = {1}, Year = {1991}} @inproceedings{Smo87, Address = {New York}, Author = {Smolensky, Roman}, Booktitle = {Proc. 19th STOC}, Eprint = {stoc:28395.28404}, Pages = {77--82}, Publisher = {ACM Press}, Title = {Algebraic methods in the theory of lower bounds for {B}oolean circuit complexity}, Year = 1987} @article{Raz87, Author = {Razborov, Alexander A.}, Fjournal = {Akademiya Nauk SSSR. Matematicheskie Zametki}, Journal = {Mat. Zametki}, Number = {4}, Pages = {598--607, 623}, Title = {Lower bounds on the dimension of schemes of bounded depth in a complete basis containing the logical addition function}, Volume = {41}, Year = {1987}} @article{Lev87, Author = {Levin, Leonid A.}, Eprint = {springer:e1415188r28663m5}, Journal = Combinatorica, Number = {4}, Pages = {357--363}, Title = {One way functions and pseudorandom generators}, Volume = {7}, Year = {1987}} @article{Nis91, Author = {Noam Nisan}, Eprint = {springer:g79x907l52546012}, Journal = Combinatorica, Number = {1}, Pages = {63--70}, Title = {Pseudorandom bits for constant depth circuits}, Volume = {11}, Year = {1991}} @techreport{GNW95, Author = {Oded Goldreich and Noam Nisan and Avi Wigderson}, Date-Modified = {2008-11-14 16:57:35 -0500}, Eprint = {eccc:TR95-050}, Institution = {Electronic Colloquium on Computational Complexity}, Month = {March}, Number = {TR95-050}, Title = {On {Yao's} {XOR} lemma}, Year = {1995}} @article{NiW94, Author = {Noam Nisan and Avi Wigderson}, Date-Modified = {2008-11-14 16:56:17 -0500}, Eprint = {jcss:10.1016/S0022-0000(05)80043-1}, Journal = JComputSystemSci, Month = OCT, Number = 2, Pages = {149--167}, Title = {Hardness vs. Randomness}, Volume = 49, Year = 1994} @inproceedings{Yao82, Address = {Los Alamitos, CA, USA}, Author = {Yao, Andrew Chi-Chih}, Booktitle = {Proc. 23rd FOCS}, Pages = {80--91}, Publisher = {IEEE Computer Society}, Title = {Theory and Applications of Trapdoor Functions (Extended Abstract)}, Year = 1982} @inproceedings{Imp95, Address = {Los Alamitos, CA, USA}, Author = {Russell Impagliazzo}, Booktitle = {Proc. 36th FOCS}, Eprint = {focs:10.1109/SFCS.1995.492584}, Pages = {538--545}, Publisher = {IEEE Computer Society}, Title = {Hard-core distributions for somewhat hard problems}, Year = 1995} @inproceedings{ImW97, Address = {New York}, Author = {Russell Impagliazzo and Avi Wigderson}, Booktitle = {Proc. 29th STOC}, Eprint = {stoc:258533.258590}, Pages = {220--229}, Publisher = {ACM Press}, Title = {{$\mathit{P} = \mathit{BPP}$} if {$E$} Requires Exponential Circuits: Derandomizing the {XOR} Lemma}, Year = 1997} @inproceedings{GoL89, Address = {New York}, Author = {Goldreich, Oded and Levin, Leonid A.}, Booktitle = {Proc. 21st STOC}, Eprint = {stoc:73007.73010}, Pages = {25--32}, Publisher = {ACM Press}, Title = {A Hard-Core Predicate for all One-Way Functions}, Year = 1989} @article{ShU05, Author = {Ronen Shaltiel and Christopher Umans}, Eprint = {jacm:1059513.1059516}, Journal = {J. ACM}, Number = {2}, Pages = {172--216}, Title = {Simple extractors for all min-entropies and a new pseudorandom generator}, Volume = {52}, Year = {2005}, } @article {BGKL03, AUTHOR = {Babai, L{\'a}szl{\'o} and G{\'a}l, Anna and Kimmel, Peter G. and Lokam, Satyanarayana V.}, TITLE = {Communication complexity of simultaneous messages}, JOURNAL = {SIAM J. Comput.}, FJOURNAL = {SIAM Journal on Computing}, VOLUME = {33}, YEAR = {2003}, NUMBER = {1}, PAGES = {137--166}, eprint = {sicomp:10.1137/S0097539700375944} } @article {BabaiHayesKimmel01, AUTHOR = {Babai, L{\'a}szl{\'o} and Hayes, Thomas P. and Kimmel, Peter G.}, TITLE = {The cost of the missing bit: communication complexity with help}, JOURNAL = {Combinatorica}, VOLUME = {21}, YEAR = {2001}, NUMBER = {4}, PAGES = {455--488}, ISSN = {0209-9683}, doi = {10.1007/s004930100009}, } @PhdThesis{Fortnow89, author = {Lance Fortnow}, title = {Complexity-theoretic aspects of interactive proof systems}, school = {Massachusetts Institute of Technology}, note = {Tech Report MIT/LCS/TR-447}, year = {1989}, } %ToC#392.bib; v004a008; Farhi, Goldstone, Gutmann % last modified: acr 12-22-08 % % #1 @inproceedings{1334209, author = {Andris Ambainis and Andrew M. Childs and Ben W. Reichardt and Robert {\v{S}}palek and Shengyu Zhang}, title = {Any \uppercase{AND-OR} Formula of Size \uppercase{N} can be Evaluated in time $N^{1/2 + o(1)}$ on a Quantum Computer}, booktitle = {Proc. 48th FOCS}, year = {2007}, pages = {363--372}, doi = {10.1109/FOCS.2007.57}, publisher = {IEEE Computer Society}, } % #2 @article{1032081, author = {Howard Barnum and Michael Saks}, title = {\uppercase{A} lower bound on the quantum query complexity of read-once functions}, journal = {J. Comput. System Sci.}, volume = {69}, number = {2}, year = {2004}, issn = {0022-0000}, pages = {244--258}, doi = {10.1016/j.jcss.2004.02.002}, } % #3 @article{264407, author = {Charles H. Bennett and Ethan Bernstein and Gilles Brassard and Umesh Vazirani}, title = {Strengths and Weaknesses of Quantum Computing}, journal = {SIAM J. Comput.}, volume = {26}, number = {5}, year = {1997}, issn = {0097-5397}, pages = {1510--1523}, doi = {10.1137/S0097539796300933}, publisher = {SIAM}, address = {Philadelphia, PA, USA}, } % # 4 @MISC{childs-2007, author = {Andrew M. Childs and Richard Cleve and Stephen P. Jordan and David Yeung}, title = {Discrete-query quantum algorithm for \uppercase{NAND} trees}, url = {http://www.citebase.org/abstract?id=oai:arXiv.org:quant-ph/0702160}, year = {2007}, eprint = "quant-ph/0702160", } % #5 @MISC{cleve-2007, author = {Richard Cleve and Dmitry Gavinsky and David L. Yeung}, title = {Quantum Algorithms for Evaluating \uppercase{MIN-MAX} Trees}, url = {http://www.citebase.org/abstract?id=oai:arXiv.org:0710.5794}, year = {2007}, eprint = "arXiv:0710.5794", } % # 7 @Article{Farhi:1996na, author = {Farhi, Edward and Gutmann, Sam}, title = "An Analog Analogue of a Digital Quantum Computation", journal = {Phys. Rev. A}, volume = {57}, pages = {2403}, year = "1998", doi = "10.1103/PhysRevA.57.2403 ", } % #8 @Article{Farhi:1997jm, author = {Farhi, Edward and Gutmann, Sam}, title = {Quantum Computation and Decision Trees}, journal = {Phys. Rev. A}, year = {1998}, pages = {915} , volume = {58} , doi = "10.1103/PhysRevA.58.915 ", } % #9 @ARTICLE{mochon-2007-75, author = {Carlos Mochon}, title = {Hamiltonian Oracles}, journal = {Phys. Rev. A}, volume = {75}, pages = {042313}, doi = {10.1103/PhysRevA.75.042313}, year = {2007} } % #10 @inbook{Newton1982, author = {Roger G. Newton}, title = {Scattering Theory of Waves and Particles}, chapter = {6 and 7}, edition = {second}, publisher = {Springer-Verlag}, address = {New York}, year = {1982} } % #11 @inproceedings{reichardt-2007, author = {Ben W. Reichardt and Robert {\v{S}}palek}, title = {Span-program-based quantum algorithm for evaluating formulas}, booktitle = {Proc. 40th STOC}, year = {2008}, publisher = {ACM}, pages = {103--112}, doi = {10.1145/1374376.1374394}, } % # 12 @inproceedings{SW86, author={Michael Saks and Avi Wigderson}, title={Probabilistic boolean trees and the complexity of evaluating game trees}, booktitle={Proc. 27th FOCS}, publisher = {IEEE Computer Society}, pages={29--38}, year={1986} } % #13 @article{miklos:1995a, author = {Miklos Santha}, title = {On the {Monte Carlo} {Boolean} decision tree complexity of read-once formulae}, journal ={Random Structures Algorithms}, volume = {6}, number = {1}, pages = {75--87}, year = {1995}, doi = {10.1002/rsa.3240060108}, } % # 14 @ARTICLE{snir:dec, author = {Marc Snir}, title = {Lower bounds on probabilistic decision trees}, journal = {Theoret. Comput. Sci.}, volume = 38, pages = {69--82}, year = {1985}, doi={10.1016/0304-3975(85)90210-5} } @article{cp, author = {Chandra Chekuri and Martin P{\'a}l}, title = {An {$O(\log n)$} {A}pproximation {R}atio for the {A}symmetric {T}raveling {S}alesman {P}ath {P}roblem}, journal = {Theory of Computing}, year = {2007}, pages = {197--209}, publisher = {Theory of Computing}, volume = {3}, URL = {http://www.theoryofcomputing.org/articles/v003a010}, eprint = {toc:v003/a010}, } %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2009-04-30 12:49:24 -0400 %% Saved with string encoding Unicode (UTF-8) @comment{The American Mathematical Monthly} @comment{Journal of Mathematical Physics} @comment{Computational Complexity} @comment{Communications in Mathematical Physics} @comment{Institute of Electrical and Electronics Engineers. Transactions on Information Theory} @comment{Journal of Computer and System Sciences} @comment{SIAM Journal on Computing} @comment{Physical Review Letters} @comment{Physical Review. A} @comment{Quantum Information & Computation} @comment{Journal of the ACM} @comment{Theory of Computing. An Open Access Journal} @string{amermathmonthly = {Amer. Math. Monthly}} @string{commmathphys = {Comm. Math. Phys.}} @string{computcomplexity = {Comput. Complexity}} @string{ieeetransinformtheory = {IEEE Trans. Inform. Theory}} @string{jacm = {J. ACM}} @string{jcomputsystemsci = {J. Comput. System Sci.}} @string{jmathphys = {J. Math. Phys.}} @string{physreva = {Phys. Rev. A}} @string{physrevlett = {Phys. Rev. Lett.}} @string{pub-acm = {ACM Press}} @string{pub-acm:adr = {New York, NY, USA}} @string{pub-ieee = {IEEE Computer Society Press}} @string{pub-ieee:adr = {Silver Spring, MD, USA}} @string{quantuminfcomput = {Quantum Inf. Comput.}} @string{siamjcomput = {SIAM J. Comput.}} @string{theorycomput = {Theory of Computing}} @article{ak, Author = {S. Aaronson and G. Kuperberg}, Date-Modified = {2009-04-30 12:34:07 -0400}, Eprint = {toc:v003/a007,quant-ph/0604056}, Journal = TheoryComput, Note = {Previous version in Proc. CCC 2007 and quant-ph/0604056}, Number = {7}, Pages = {129-157}, Title = {Quantum versus classical proofs and advice}, Volume = {3}, Year = {2007}} @unpublished{an, Author = {D. Aharonov and T. Naveh}, Eprint = {arxiv:quant-ph/0210077}, Note = {quant-ph/0210077}, Title = {Quantum {NP} - a survey}, Year = {2002}} @inproceedings{ar, Author = {D. Aharonov and O. Regev}, Crossref = {conf:FOCS2004}, Eprint = {focs:FOCS.2004.35}, Pages = {362--371}, Title = {Lattice problems in {NP} intersect co{NP}}, Year = {2004}} @article{bbcjpw, Author = {C. H. Bennett and G. Brassard and C. Cr\'{e}peau and R. Jozsa and A. Peres and W. Wootters}, Eprint = {prl:10.1103/PhysRevLett.70.1895}, Journal = PhysRevLett, Pages = {1895--1898}, Title = {Teleporting an unknown quantum state by dual classical and {EPR} channels}, Volume = {70}, Year = {1993}} @article{bbbv, Author = {C. Bennett and E. Bernstein and G. Brassard and U. Vazirani}, Date-Modified = {2009-04-30 12:35:54 -0400}, Eprint = {sicomp:10.1137/S0097539796300933,quant-ph/9701001}, Journal = SIAMJComput, Number = 5, Pages = {1510--1523}, Title = {Strengths and weaknesses of quantum computing}, Volume = 26, Year = 1997} @article{bdsw, Author = {C. H. Bennett and D. P. DiVincenzo and J. A. Smolin and W. K. Wootters}, Date-Modified = {2009-04-30 12:38:43 -0400}, Eprint = {pra:10.1103/PhysRevA.54.3824,arxiv:quant-ph/9604024}, Journal = PhysRevA, Number = 5, Pages = {3824--3851}, Title = {Mixed-state entanglement and quantum error correction}, Volume = {54}, Year = {1996}} @inproceedings{bgkw, Author = {M. Ben-Or and S. Goldwasser and J. Kilian and A. Wigderson}, Crossref = {proc:STOC1988}, Eprint = {stoc:62212.62223}, Pages = {113--131}, Title = {Multi-prover interactive proofs: how to remove the intractability assumptions}, Year = {1988}} @unpublished{bliertapp, Author = {H. Blier and A. Tapp}, Eprint = {arXiv:0709.0738}, Note = {arXiv:0709.0738}, Title = {All languages in {NP} have very short quantum proofs}, Year = {2007}} @article{bloom, Author = {D. M. Bloom and W. Knight}, Journal = AmerMathMonthly, Month = {December}, Number = {10}, Pages = {1141--1142}, Title = {A birthday problem}, Volume = {80}, Year = {1973}} @book{bcss, Author = {L. Blum and F. Cucker and M. Shub and S. Smale}, Publisher = {Springer-Verlag}, Title = {Complexity and Real Computation}, Year = {1997}} @phdthesis{brandao, Author = {F. {Brand\~{a}o}}, Date-Modified = {2009-04-30 12:39:34 -0400}, Eprint = {arXiv:0810.0026}, School = {Imperial College, London}, Title = {Entanglement Theory and the Quantum Simulation of Many-Body Physics}, Year = {2008}} @article{squashed, Author = {M. Christandl and A. Winter}, Date-Modified = {2009-04-30 12:39:59 -0400}, Eprint = {arXiv:quant-ph/0308088}, Journal = JMathPhys, Number = {3}, Pages = {829--840}, Title = {{``Squashed entanglement'' - an additive entanglement measure}}, Volume = {45}, Year = {2004}} @article{dinur, Author = {I. Dinur}, Eprint = {jacm:1236457.1236459}, Journal = JACM, Number = {3}, Pages = {12}, Title = {The {PCP} theorem by gap amplification}, Volume = {54}, Year = {2007}} @article{gavinsky, Author = {D. Gavinsky}, Date-Modified = {2009-04-30 12:41:14 -0400}, Eprint = {arxiv:quant-ph/0604052}, Journal = QuantumInfComput, Number = {1-2}, Pages = {82--95}, Pdf = {http://www.rinton.net/xxqic8/qic-8-12/0082-0095.pdf}, Title = {On the role of shared entanglement}, Volume = {8}, Year = {2008}} @unpublished{hastings, Author = {M. B. Hastings}, Eprint = {arxiv:quant-ph/0809.3972}, Note = {arXiv:0809.3972}, Title = {A counterexample to additivity of minimum output entropy}, Year = {2008}} @article{kstw, Author = {S. Khanna and M. Sudan and L. Trevisan and D. P. Williamson}, Eprint = {sicomp:10.1137/S0097539799349948}, Journal = SIAMJComput, Number = {6}, Pages = {1863--1920}, Title = {The approximability of constraint satisfaction problems}, Volume = {30}, Year = {2000}} @book{ksv, Author = {A. Kitaev and A. Shen and M. N. Vyalyi}, Publisher = {American Mathematical Society}, Title = {Classical and Quantum Computation}, Year = {2002}} @article{kntz, Author = {H. Klauck and A. Nayak and A. Ta-Shma and D. Zuckerman}, Date-Modified = {2009-04-30 12:42:50 -0400}, Doi = {10.1109/TIT.2007.896888}, Journal = IEEETransInformTheory, Note = {Earlier version in STOC'2001 and quant-ph/0603135}, Number = {6}, Pages = {1970--1982}, Title = {Interaction in quantum communication}, Volume = {53}, Year = {2007}, Bdsk-Url-1 = {http://dx.doi.org/10.1109/TIT.2007.896888}} @unpublished{knill, Author = {E. Knill}, Eprint = {arxiv:quant-ph/9610012}, Note = {quant-ph/9610012}, Title = {Quantum randomness and nondeterminism}, Year = {1996}} @article{km:qmip, Author = {H. Kobayashi and K. Matsumoto}, Date-Modified = {2009-04-30 12:43:38 -0400}, Eprint = {jcss:10.1016/S0022-0000(03)00035-7}, Journal = JComputSystemSci, Number = {3}, Pages = {429--450}, Title = {Quantum multi-prover interactive proof systems with limited prior entanglement}, Volume = {66}, Year = {2003}} @inproceedings{kmy, Author = {H. Kobayashi and K. Matsumoto and T. Yamakami}, Booktitle = {Proc. 14th Intern. Symp. Algorithms and Computation}, Date-Modified = {2009-04-30 12:43:58 -0400}, Eprint = {isaac:847uk09hm42tdu3q,arxiv:quant-ph/0306051}, Pages = {189--198}, Series = {LNCS}, Title = {Quantum {M}erlin-{A}rthur proof systems: are multiple {M}erlins more helpful to {A}rthur?}, Volume = 2906, Year = {2003}} @article{konig, Author = {R. K\"{o}nig and R. Renner}, Eprint = {arxiv:quant-ph/0410229}, Journal = JMathPhys, Note = {quant-ph/0410229}, Number = {122108}, Title = {A de {F}inetti representation for finite symmetric quantum states}, Volume = {46}, Year = {2005}} @article{lcv, Author = {Y.-K. Liu and M. Christandl and F. Verstraete}, Date-Modified = {2009-04-30 12:44:46 -0400}, Eprint = {prl:10.1103/PhysRevLett.98.110503,arxiv:quant-ph/0609125}, Journal = PhysRevLett, Number = {11}, Title = {Quantum Computational Complexity of the {N}-Representability Problem: {QMA} Complete}, Volume = {98}, Year = {2007}} @article{mw, Author = {C. Marriott and J. Watrous}, Eprint = {cc:h0521k6666871652}, Journal = ComputComplexity, Number = {2}, Pages = {122--152}, Title = {Quantum {A}rthur-{M}erlin games}, Volume = {14}, Year = {2005}} @book{nc, Author = {M. Nielsen and I. Chuang}, Publisher = {Cambridge University Press}, Title = {Quantum Computation and Quantum Information}, Year = {2000}} @book{ohyapetz, Author = {M. Ohya and D. Petz}, Publisher = {Springer}, Title = {Quantum Entropy and its Use}, Year = {1993}} @article{py, Author = {C. H. Papadimitriou and M. H. Yannakakis}, Eprint = {jcss:10.1016/0022-0000(91)90023-X}, Journal = JComputSystemSci, Number = {3}, Pages = {425--440}, Title = {Optimization, approximation, and complexity classes}, Volume = {43}, Year = {1991}} @article{raz:prt, Author = {R. Raz}, Eprint = {sicomp:10.1137/S0097539795280895}, Journal = SIAMJComput, Note = {Earlier version in STOC 1995}, Number = {3}, Pages = {763--803}, Title = {A parallel repetition theorem}, Volume = {27}, Year = {1998}} @article{shor:add, Author = {P. W. Shor}, Date-Modified = {2009-04-30 12:45:52 -0400}, Eprint = {springer:a6d2vegprhlqvrby,arxiv:quant-ph/0305035}, Journal = CommMathPhys, Number = {3}, Pages = {453--472}, Title = {Equivalence of additivity questions in quantum information theory}, Volume = {246}, Year = {2004}} @article{vp, Author = {V. Vedral and M. B. Plenio}, Date-Modified = {2009-04-30 12:46:33 -0400}, Eprint = {pra:10.1103/PhysRevA.57.1619,arxiv:quant-ph/9707035}, Journal = PhysRevA, Number = 3, Pages = {1619--1633}, Title = {Entanglement measures and purification procedures}, Volume = {57}, Year = {1998}} @inproceedings{watrous, Author = {J. Watrous}, Crossref = {conf:FOCS2000}, Date-Modified = {2009-04-30 12:47:02 -0400}, Doi = {10.1109/SFCS.2000.892141}, Pages = {537--546}, Title = {Succinct quantum proofs for properties of finite groups}, Year = {2000}, Bdsk-Url-1 = {http://dx.doi.org/10.1109/SFCS.2000.892141}} @article{zzhe, Author = {M. Zukowski and A. Zeilinger and M. A. Horne and A. K. Ekert}, Eprint = {prl:10.1103/PhysRevLett.71.4287}, Journal = PhysRevLett, Number = 26, Pages = {4287--4290}, Title = {``Event-ready-detectors'': {B}ell experiment via entanglement swapping}, Volume = {71}, Year = {1993}} @proceedings{conf:FOCS2004, Address = pub-IEEE:adr, Booktitle = {Proc. 45th FOCS}, Crossrefonly = 1, Date-Modified = {2008-12-30 11:35:24 -0500}, Isbn = {0-7695-2228-9}, Isbn-13 = {978-0-7695-2228-9}, Issn = {0272-5428}, Publisher = pub-IEEE, Title = {Proc. 45th FOCS}, Year = {2004}} @proceedings{conf:FOCS2000, Address = pub-IEEE:adr, Booktitle = {Proc. 41st FOCS}, Crossrefonly = 1, Date-Modified = {2008-12-30 11:34:17 -0500}, Isbn = {0-7695-0850-2, 0-7695-0851-0 (case), 0-7695-0852-9 (microfiche)}, Isbn-13 = {978-0-7695-0850-4, 978-0-7695-0851-1 (case), 978-0-7695-0852-8 (microfiche)}, Issn = {0272-5428}, Publisher = pub-IEEE, Title = {Proc. 41st FOCS}, Year = {2000}} @proceedings{proc:STOC1988, Address = pub-ACM:adr, Booktitle = {Proc. 20th STOC}, Crossrefonly = 1, Date-Modified = {2008-12-30 12:28:41 -0500}, Isbn = {0-89791-264-0}, Lccn = {QA 76.6 A13 1988}, Publisher = pub-ACM, Title = {Proc. 20th STOC}, Year = {1988}} %% ToC#398 Moran-Naor-Segev %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2009-05-22 12:57:54 -0400 %% Saved with string encoding Unicode (UTF-8) %% modified by LB: Erd\H{o}s, Frankl, IEEE Comp. Soc. Press, %% abbreviations: Proc., Internat. 2009-05-22 6pm @inproceedings{AlonC02, Author = {Noga Alon and Michael R. Capalbo}, Booktitle = {Proc. 43rd FOCS}, Date-Modified = {2009-05-21 22:38:36 -0400}, Doi = {10.1109/SFCS.2002.1181884}, Pages = {73--79}, Publisher = {IEEE Comp. Soc. Press}, Title = {Explicit Unique-Neighbor Expanders}, Year = {2002}, Bdsk-Url-1 = {http://dx.doi.org/10.1109/SFCS.2002.1181884}} @inproceedings{AlonH08, Author = {Noga Alon and Rani Hod}, Booktitle = {Proc. the 35th Internat. Colloquium on Automata, Languages and Programming (ICALP'08)}, Date-Modified = {2009-05-21 22:46:01 -0400}, Doi = {10.1007/978-3-540-70575-8\_22}, Pages = {258--270}, Publisher = {Springer}, Title = {Optimal Monotone Encodings}, Year = {2008}, Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-540-70575-8_22}, Bdsk-Url-2 = {http://dx.doi.org/10.1007/978-3-540-70575-8_22}} @inproceedings{BethencourtBW07, Author = {John Bethencourt and Dan Boneh and Brent Waters}, Booktitle = {Proc. 14th Network and Distributed System Security Symp. (NDSS'07)}, Date-Modified = {2009-05-21 16:46:30 -0400}, Pages = {209--222}, Title = {Cryptographic Methods for Storing Ballots on a Voting Machine}, Year = {2007}} @inproceedings{BlellochG07, Author = {Guy E. Blelloch and Daniel Golovin}, Booktitle = {Proc. 48th FOCS}, Date-Modified = {2009-05-21 22:41:57 -0400}, Doi = {10.1109/FOCS.2007.36}, Pages = {272--282}, Publisher = {IEEE Comp. Soc. Press}, Title = {Strongly History-Independent Hashing with Applications}, Year = {2007}, Bdsk-Url-1 = {http://dx.doi.org/10.1109/FOCS.2007.36}} @article{BuchbinderP06, Author = {Niv Buchbinder and Erez Petrank}, Date-Modified = {2009-05-21 16:53:33 -0400}, Doi = {10.1016/j.ic.2005.11.001}, Journal = {Inform. and Comput.}, Number = {2}, Pages = {291--337}, Title = {Lower and Upper Bounds on Obtaining History-Independence}, Volume = {204}, Year = {2006}, Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.ic.2005.11.001}} @article{BuhrmanMRV02, Author = {Harry Buhrman and Peter Bro Miltersen and Jaikumar Radhakrishnan and Srinivasan Venkatesh}, Date-Modified = {2009-05-21 16:57:29 -0400}, Doi = {10.1137/S0097539702405292}, Journal = {SIAM J. Comput.}, Number = {6}, Pages = {1723--1744}, Title = {Are Bitvectors Optimal?}, Volume = {31}, Year = {2002}, Bdsk-Url-1 = {http://dx.doi.org/10.1137/S0097539702405292}} @article{Capetanakis79a, Author = {J. Capetanakis}, Date-Modified = {2009-05-21 17:50:12 -0400}, Journal = {IEEE Trans. Commun.}, Number = {10}, Pages = {1479--1484}, Title = {Generalized {TDMA}: {The} multi-accessing tree protocol}, Volume = {27}, Year = {1979}} @article{Capetanakis79b, Author = {J. Capetanakis}, Date-Modified = {2009-05-21 17:50:43 -0400}, Journal = {IEEE Trans. Inform. Theory}, Number = {5}, Pages = {505--515}, Title = {Tree algorithms for packet broadcast channels}, Volume = {25}, Year = {1979}} @article{ErdosFF85, Author = {Paul Erd{\H{o}}s and P{\'e}ter Frankl and Zolt{\'a}n F{\"u}redi}, Date-Modified = {2009-05-21 17:56:28 -0400}, Doi = {10.1007/BF02772959}, Journal = {Israel J. Math.}, Pages = {79--89}, Title = {Families of finite sets in which no set is covered by the union of {$r$} others}, Volume = {51}, Year = {1985}, Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF02772959}} @article{Furedi96, Author = {Zolt{\'a}n F{\"u}redi}, Date-Modified = {2009-05-21 17:56:03 -0400}, Doi = {10.1006/jcta.1996.0012}, Journal = {J. Combin. Theory Ser. A}, Number = {1}, Pages = {172--173}, Title = {On {$r$}-Cover-free Families}, Volume = {73}, Year = {1996}, Bdsk-Url-1 = {http://dx.doi.org/10.1006/jcta.1996.0012}} @article{GreenbergW85, Author = {Albert G. Greenberg and Shmuel Winograd}, Date-Modified = {2009-05-21 17:58:59 -0400}, Doi = {10.1145/3828.214125}, Journal = {J. ACM}, Number = {3}, Pages = {589--596}, Title = {A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels}, Volume = {32}, Year = {1985}, Bdsk-Url-1 = {http://dx.doi.org/10.1145/3828.214125}} @inproceedings{GuruswamiUV07, Author = {Venkatesan Guruswami and Christopher Umans and Salil Vadhan}, Booktitle = {Proc. 22nd Annual IEEE Conference on Computational Complexity (CCC'07)}, Date-Modified = {2009-05-21 22:42:07 -0400}, Doi = {10.1109/CCC.2007.38}, Pages = {96--108}, Publisher = {IEEE Comp. Soc. Press}, Title = {Unbalanced expanders and randomness extractors from {Parvaresh-Vardy} codes}, Year = {2007}, Bdsk-Url-1 = {http://dx.doi.org/10.1109/CCC.2007.38}} @article{HartlineHMPR05, Author = {Jason D. Hartline and Edwin S. Hong and Alexander E. Mohr and William R.Pentney and Emily Rocke}, Date-Modified = {2009-05-21 18:01:50 -0400}, Doi = {10.1007/s00453-004-1140-z}, Journal = {Algorithmica}, Number = {1}, Pages = {57--74}, Title = {Characterizing History Independent Data Structures}, Volume = {42}, Year = {2005}, Bdsk-Url-1 = {http://dx.doi.org/10.1007/s00453-004-1140-z}} @article{IraniNR92, Author = {Sandy Irani and Moni Naor and Ronitt Rubinfeld}, Date-Modified = {2009-05-22 12:57:21 -0400}, Doi = {10.1007/BF02835833}, Journal = {Mathematical Systems Theory}, Number = {2}, Pages = {141--159}, Title = {On the Time and Space Complexity of Computation Using Write-Once Memory --- or --- Is Pen Really Much Worse Than Pencil?}, Volume = {25}, Year = {1992}, Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF02835833}} @inproceedings{KamathMPS94, Author = {Anil Kamath and Rajeev Motwani and Krishna V. Palem and Paul G. Spirakis}, Booktitle = {Proc. 35th FOCS}, Date-Modified = {2009-05-21 22:37:32 -0400}, Pages = {592--603}, Publisher = {IEEE Comp. Soc. Press}, Title = {Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture}, Year = {1994}} @article{KautzS64, Author = {W. H. Kautz and R. C. Singleton}, Date-Modified = {2009-05-21 18:11:52 -0400}, Journal = {IEEE Trans. Inform. Theory}, Number = {4}, Pages = {363--377}, Title = {Nonrandom Binary Superimposed Codes}, Volume = {10}, Year = {1964}} @article{KomlosG85, Author = {J{\'a}nos Koml{\'o}s and Albert G. Greenberg}, Date-Modified = {2009-05-21 18:10:56 -0400}, Journal = {IEEE Trans. Inform. Theory}, Number = {2}, Pages = {302--306}, Title = {An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels}, Volume = {31}, Year = {1985}} @inproceedings{Micciancio97, Author = {Daniele Micciancio}, Booktitle = {Proc. 29th STOC}, Date-Modified = {2009-05-21 22:38:09 -0400}, Doi = {10.1145/258533.258638}, Pages = {456--464}, Publisher = {ACM Press}, Title = {Oblivious Data Structures: {Applications} to Cryptography}, Year = {1997}, Bdsk-Url-1 = {http://dx.doi.org/10.1145/258533.258638}} @inproceedings{MolnarKSW06, Author = {David Molnar and Tadayoshi Kohno and Naveen Sastry and David Wagner}, Booktitle = {Proc. IEEE Symp. on Security and Privacy (SP'06)}, Date-Modified = {2009-05-22 12:57:52 -0400}, Doi = {10.1109/SP.2006.39}, Pages = {365--370}, Publisher = {IEEE Comp. Soc. Press}, Title = {Tamper-Evident, History-Independent, Subliminal-Free Data Structures on {PROM} Storage --- or --- How to Store Ballots on a Voting Machine}, Year = {2006}, Bdsk-Url-1 = {http://dx.doi.org/10.1109/SP.2006.39}} @inproceedings{NaorSW08, Author = {Moni Naor and Gil Segev and Udi Wieder}, Booktitle = {Proc. 35th Internat. Colloquium on Automata, Languages and Programming (ICALP'08)}, Date-Modified = {2009-05-21 22:42:46 -0400}, Pages = {631--642}, Publisher = {Springer}, Title = {History-Independent Cuckoo Hashing}, Year = {2008}, Bdsk-Url-1 = {http://dx.doi.org/Add%20data%20for%20field:%20Doi}} @inproceedings{NaorT01, Author = {Moni Naor and Vanessa Teague}, Booktitle = {Proc. 33rd STOC}, Date-Modified = {2009-05-21 22:38:24 -0400}, Doi = {10.1145/380752.380844}, Pages = {492--501}, Publisher = {ACM Press}, Title = {Anti-persistence: {History} independent data structures}, Year = {2001}, Bdsk-Url-1 = {http://dx.doi.org/10.1145/380752.380844}} @article{NisanT99, Author = {Noam Nisan and Amnon Ta-Shma}, Date-Modified = {2009-05-21 21:39:24 -0400}, Doi = {10.1006/jcss.1997.1546}, Journal = {J. Comput. System Sci.}, Number = {1}, Pages = {148--173}, Title = {Extracting randomness: A survey and new constructions}, Volume = {58}, Year = {1999}, Bdsk-Url-1 = {http://dx.doi.org/10.1006/jcss.1997.1546}} @article{RivestS82, Author = {Ronald L. Rivest and Adi Shamir}, Journal = {Information and Control}, Number = {1-3}, Pages = {1-19}, Title = {How to Reuse a ``Write-Once'' Memory}, Volume = {55}, Year = {1982}} @article{Ruszinko94, Author = {Mikl{\'o}s Ruszink{\'o}}, Date-Modified = {2009-05-21 20:10:48 -0400}, Doi = {10.1016/0097-3165(94)90067-1}, Journal = {J. Combin. Theory Ser. A}, Number = {2}, Pages = {302--310}, Title = {On the Upper Bound of the Size of the {$r$}-Cover-Free Families}, Volume = {66}, Year = {1994}, Bdsk-Url-1 = {http://dx.doi.org/10.1016/0097-3165(94)90067-1}} @article{Sipser88, Author = {Michael Sipser}, Date-Modified = {2009-05-21 19:53:25 -0400}, Doi = {10.1016/0022-0000(88)90035-9}, Journal = {J. Comput. System Sci.}, Number = {3}, Pages = {379--383}, Title = {Expanders, randomness, or time versus space}, Volume = {36}, Year = {1988}, Bdsk-Url-1 = {http://dx.doi.org/10.1016/0022-0000(88)90035-9}} @article{Ta-Shma02, Author = {Amnon Ta-Shma}, Date-Modified = {2009-05-21 21:44:06 -0400}, Doi = {10.1016/S0020-0190(02)00206-5}, Journal = {Information Processing Letters}, Number = {5}, Pages = {267--274}, Title = {Storing information with extractors}, Volume = {83}, Year = {2002}, Bdsk-Url-1 = {http://dx.doi.org/10.1016/S0020-0190(02)00206-5}} @article{Ta-ShmaUZ07, Author = {Amnon Ta-Shma and Christopher Umans and David Zuckerman}, Date-Modified = {2009-05-21 21:46:28 -0400}, Doi = {10.1007/s00493-007-0053-2}, Journal = {Combinatorica}, Number = {2}, Pages = {213--240}, Title = {Lossless Condensers, Unbalanced Expanders, And Extractors}, Volume = {27}, Year = {2007}, Bdsk-Url-1 = {http://dx.doi.org/10.1007/s00493-007-0053-2}} @misc{cnet06att-leaks, Date-Modified = {2009-05-21 22:22:48 -0400}, Howpublished = {CNET News}, Key = {CNET}, Month = {May}, Note = {\url{http://news.cnet.com/AT38T-leaks-sensitive-info-in-NSA-suit/2100-1028_3-6077353.html}}, Owner = {talm}, Timestamp = {2009.04.29}, Title = {{AT\&T} leaks sensitive info in {NSA} suit}, Year = {2006}} @misc{bbc05redact, Date-Modified = {2009-05-21 22:22:17 -0400}, Howpublished = {BBC News}, Key = {BBC}, Month = {May}, Note = {\url{http://news.bbc.co.uk/1/hi/world/europe/4506517.stm}}, Owner = {talm}, Timestamp = {2009.04.29}, Title = {Readers `declassify' {US} document}, Year = {2005}} %% ToC#404 au 2009-05-24 version %% LB revised 2009-05-24: added 3 arxiv citations, {C}apital protections, %% "comma --> and" in author lists, ... %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2009-04-27 12:21:32 -0400 %% Saved with string encoding Unicode (UTF-8) @article{AGHP, Author = {N. Alon and O. Goldreich and J. H{\aa}stad and R. Peralta}, Journal = {Random Structures Algorithms}, Number = {3}, Pages = {289--304}, Title = {Simple Construction of Almost {$k$-wise} Independent Random Variables}, Volume = {3}, Year = {1992}, doi={10.1002/rsa.3240030308}} @inproceedings{AKKLR, Author = {N. Alon and T. Kaufman and M. Krivelevich and S. Litsyn and D. Ron}, Booktitle = {RANDOM-APPROX 2003}, Pages = {188--199}, Title = {Testing low-degree polynomials over {$GF(2)$}}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {2764}, Year = {2003}, doi={10.1007/b11961},} @article{BCHKS, Author = {M. Bellare and D. Coppersmith and J. H{\aa}stad and M. Kiwi and M. Sudan}, Journal = {IEEE Trans. Inform. Theory}, Number = {6}, Pages = {1781--1795}, Title = {Linearity testing in characteristic two}, Volume = {42}, Year = {1996}, doi={10.1109/18.556674}} @article{BLR, Author = {M. Blum and M. Luby and R. Rubinfeld}, Journal = {J. Comput. Syst. Sci.}, Number = {3}, Pages = {549--595}, Title = {Self-Testing/Correcting with Applications to Numerical Problems}, Volume = {47}, Year = {1993}, doi={10.1016/0022-0000(93)90044-W}} @inproceedings{Bog, Author = {A. Bogdanov}, Booktitle = {Proc. 37th STOC}, Pages = {21--30}, Publisher = {ACM Press}, Title = {Pseudorandom generators for low degree polynomials}, Year = {2005}, doi={10.1145/1060590.1060594}} @inproceedings{BSVW, Author = {E. Ben-Sasson and M. Sudan and S. Vadhan and A. Wigderson}, Booktitle = {Proc. 35th STOC}, Date-Modified = {2009-04-27 12:19:25 -0400}, Pages = {612--621}, Publisher = {ACM Press}, Title = {Randomness-efficient low degree tests and short {PCPs} via epsilon-biased sets}, Year = {2003}, doi={10.1145/780542.780631}} @misc{BTZ, Author = {V. Bergelson and T. Tao and T. Ziegler}, Title = {An inverse theorem for the uniformity seminorms associated with the action of {$\mathbb{F}_p^{\infty}$}}, year = {2009}, eprint = {arxiv:0901.2602} } @inproceedings{BV, Author = {A. Bogdanov and E. Viola}, Booktitle = {Proc. 48th FOCS}, Pages = {41--51}, Publisher = {IEEE Comp. Soc. Press}, Title = {Pseudorandom Bits for Polynomials}, Year = {2007}, doi={10.1109/FOCS.2007.42}} @article{Gow, Author = {W. T. Gowers}, Journal = {Geom. Funct. Anal.}, Number = {3}, Pages = {465--588}, Title = {A new proof of {Szemer{\'e}di's} theorem}, Volume = {11}, Year = {2001}, Doi ={10.1007/s00039-001-0332-9} } @article{GT, Author = {B. Green and T. Tao}, Date-Modified = {2009-04-27 12:19:05 -0400}, Journal = {Proc. Edinburgh Math. Soc. (Ser. 2)}, Number = {1}, Pages = {73--153}, Title = {An inverse theorem for the {Gowers} {$U^3(G)$} norm}, Volume = {51}, Year = {2008}, doi={10.1017/S0013091505000325}} @misc{GT2, Author = {B. Green and T. Tao}, Title = {The distribution of polynomials over finite fields, with applications to the {Gowers} norms}, year = {2007}, eprint = {arxiv:0711.3191} } @inproceedings{Lov, Author = {S. Lovett}, Booktitle = {Proc. 40th STOC}, Pages = {557--562}, Publisher = {ACM Press}, Title = {Unconditional pseudorandom generators for low degree polynomials}, Year = {2008}, doi={10.1145/1374376.1374455}} @inproceedings{LMS, Author = {S. Lovett and R. Meshulam and A. Samorodnitsky}, Booktitle = {Proc. 40th STOC}, Pages = {547--556}, Publisher = {ACM Press}, Title = {Inverse conjecture for the {Gowers} norm is false}, Year = {2008}, doi={10.1145/1374376.1374454}} @inproceedings{LVW, Author = {M. Luby and B. Velickovic and A. Wigderson}, Booktitle = {Proc. of the 2nd Israeli Symposium on Theoretical Computer Science (ISTCS'93)}, Pages = {18--24}, Publisher = {IEEE Comp. Soc. Press}, Title = {Deterministic Approximate Counting of Depth-2 Circuits}, Year = {1993}} @inproceedings{NN, Author = {J. Naor and M. Naor}, Booktitle = {Proc. 22nd STOC}, Date-Modified = {2009-04-27 12:19:55 -0400}, Pages = {213--223}, Publisher = {ACM Press}, Title = {Small-bias probability spaces: {Efficient} constructions and applications}, Year = {1990}, doi={10.1145/100216.100244}} @inproceedings{Sam, Author = {A. Samorodnitsky}, Booktitle = {Proc. 39th STOC}, Pages = {506--515}, Publisher = {ACM Press}, Title = {Low-degree tests at large distances}, Year = {2007}, doi={10.1145/1250790.1250864}} @inproceedings{ST, Author = {A. Samorodnitsky and L. Trevisan}, Booktitle = {Proc. 38th STOC}, Date-Modified = {2009-04-27 12:20:12 -0400}, Pages = {11--20}, Publisher = {ACM Press}, Title = {{Gowers} uniformity, influence of variables, and {PCPs}}, Year = {2006}, doi={10.1145/1132516.1132519}} @MASTERSTHESIS{Stef, AUTHOR = "D. {\v{S}}tefankovi{\v{c}}", TITLE = "{Fourier} Transforms in Computer Science", SCHOOL = "University of Chicago, Department of Computer Science", YEAR = 2000, note = {\url{http://www.cs.rochester.edu/~stefanko/Publications/Fourier.ps}} } @misc{TZ, Author = {T. Tao and T. Ziegler}, Title = {The inverse conjecture for the {Gowers} norm over finite fields via the correspondence principle}, year = {2008}, eprint = {arxiv:0810.5527} } @techreport{Vio1, Author = {E. Viola}, Date-Modified = {2009-04-27 12:21:05 -0400}, Institution = {Electronic Colloq. on Computational Complexity}, Number = {Technical Report TR06-097}, Title = {New correlation bounds for {$\text{GF}(2)$} polynomials using {Gowers} uniformity}, Year = {2006}, eprint={eccc:TR06-097}} @journal{Vio2, Author = {E. Viola}, Booktitle = {SIAM Journal on Computing}, Number = {5}, Pages = {1387--1403}, Title = {Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates}, Volume = {36}, Year = {2007}, doi={10.1137/050640941}} @inproceedings{Vio3, Author = {E. Viola}, Booktitle = {Proc. 23rd IEEE Conf. on Computational Complexity (CCC)}, Pages = {124--127}, Publisher = {IEEE Comp. Soc. Press}, Title = {The sum of {$d$} small-bias generators fools polynomials of degree {$d$}}, Year = {2008}, doi={10.1109/CCC.2008.16}} @inproceedings{VW, Author = {E. Viola and A. Wigderson}, Booktitle = {Proc. 22nd IEEE Conf. on Computational Complexity (CCC)}, Date-Modified = {2009-04-27 12:20:34 -0400}, Pages = {141--154}, Publisher = {IEEE Comp. Soc. Press}, Title = {Norms, {XOR} Lemmas, and Lower Bounds for {$\text{GF}(2)$} Polynomials and Multiparty Protocols}, Year = {2007}, doi={10.1109/CCC.2007.15}} % ToC#404 Khot - O'Donnell %% Alex 05-26 version %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2009-05-23 10:42:57 -0400 %% Saved with string encoding Unicode (UTF-8) @string{sicomp = {SIAM J. Comput.}} @string{sidma = {SIAM J. Discrete Math.}} @string{isrj = {Israel J.\ Math.}} @string{jacm = {J. ACM}} @string{jcss = {J. Comput. System Sci.}} @string{johnwiley = {John Wiley \& Sons}} @string{ACM = {ACM Press}} @string{IEEE = {IEEE Comp. Soc. Press}} @string{lcs = {Lecture Notes in Computer Science}} @string{lnm = {Lecture Notes in Mathematics}} @string{rsa = {Random Structures Algorithms}} @inproceedings{ACMM05, Author = {Amit Agarwal and Moses Charikar and Konstantin Makarychev and Yury Makarychev}, Booktitle = {Proc. 37th {STOC}}, Pages = {573--581}, Title = {{$O(\sqrt{\log n})$} approximation algorithms for {Min-Uncut}, {Min-2CNF-Deletion}, and directed cut problems}, Year = {2005}, Doi = {10.1145/1060590.1060675}, Publisher = ACM, } @article{ASZ02, Author = {Noga Alon and Benny Sudakov and Uri Zwick}, Journal = SIDMA, Number = {1}, Pages = {58--72}, Title = {Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms}, Volume = {15}, Year = {2002}, Doi ={10.1137/S0895480100379713}} @article{AN06, Author = {Noga Alon and Assaf Naor}, Journal = SICOMP, Number = 4, Pages = {787--803}, Title = {Approximating the {Cut}-{Norm} via {Grothendieck's} Inequality}, Volume = 35, Year = 2006, Doi = {10.1137/S0097539704441629}} @article{AMMN06, Author = {Noga Alon and Konstantin Makarychev and Yury Makarychev and Assaf Naor}, Journal = {Invent. Math.}, Number = 3, Page = {499--522}, Title = {Quadratic forms on graphs}, Volume = 163, Year = 2006, Doi = {10.1007/s00222-005-0465-9}} @inproceedings{ARV04, Author = {Sanjeev Arora and Satish Rao and Umesh Vazirani}, Booktitle = {Proc. 36th {STOC}}, Pages = {222--231}, Title = {Expander flows, geometric embeddings and graph partitioning}, Year = {2004}, Doi = {10.1145/1007352.1007355}, Publisher = ACM} @inproceedings{ABHKS05, Author = {Sanjeev Arora and Eli Berger and Elad Hazan and Guy Kindler and Muli Safra}, Booktitle = {Proc. 46th {FOCS}}, Pages = {206--215}, Title = {On Non-Approximability for Quadratic Programs}, Year = 2005, Doi = {10.1109/SFCS.2005.57}, Publisher = IEEE} @article{BBC04, Author = {Nikhil Bansal and Avrim Blum and Shuchi Chawla}, Journal = {Machine Learning}, Number = {1-3}, Pages = {89--113}, Title = {Correlation Clustering}, Volume = {56}, Year = {2004}, Doi = {10.1023/B:MACH.0000033116.57574.95} } @article{BGS98, Author = {Mihir Bellare and Oded Goldreich and Madhu Sudan}, Journal = SICOMP, Number = {3}, Pages = {804--915}, Title = {Free Bits, {PCP}s, and Nonapproximability---Towards Tight Results}, Volume = {27}, Year = {1998}, Doi = {10.1137/S0097539796302531} } @article{Bik66, Author = {Algimantas Bikelis}, Date-Modified = {2009-05-22 15:01:30 -0400}, Journal = {Litovsk. Mat. Sb.}, Note = {In Russian}, Number = 3, Pages = {323--346}, Title = {Estimates of the remainder in the {Central Limit Theorem}}, Volume = 6, Year = {1966},} @article{Bor85, Author = {Christer Borell}, Fjournal = {Zeitschrift {f\"ur} Wahrscheinlichkeitstheorie und Verwandte Gebiete}, Journal = {Z. Wahrsch. Verw. Gebiete}, Number = {1}, Pages = {1--13}, Title = {Geometric bounds on the {Ornstein}-{Uhlenbeck} velocity process}, Volume = {70}, Year = {1985}, Doi = {10.1007/BF00532234}} @inproceedings{CMM06, Author = {Moses Charikar and Konstantin Makarychev and Yury Makarychev}, Booktitle = {Proc. 38th {STOC}}, Pages = {205--214}, Title = {Near-optimal algorithms for unique games}, Year = {2006}, publisher = ACM, Doi = {10.1145/1132516.1132547} } @inproceedings{CW04, Author = {Moses Charikar and Anthony Wirth}, Booktitle = {Proc. 45th {FOCS}}, Pages = {54--60}, Title = {Maximizing Quadratic Programs: Extending {Grothendieck's} Inequality}, Year = {2004}, Publisher = IEEE, Doi = {10.1109/FOCS.2004.39} } @article{CKKRS06, Author = {Shuchi Chawla and Robert Krauthgamer and Ravi Kumar and Yuval Rabani and D. Sivakumar}, Journal = {Comput. Complexity}, Number = 2, Pages = {94--114}, Title = {On the Hardness of Approximating {Multicut} and {Sparsest-Cut}}, Volume = 15, Year = 2006, Doi = {10.1007/s00037-006-0210-9}} @article{Che52, Author = {Herman Chernoff}, Journal = {Annals of Mathematical Statistics}, Number = 4, Title = {A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations}, Volume = 23, Year = 1952, Doi ={10.1214/aoms/1177729330}} @article{Cra38, Author = {Harald {Cram{\'e}r}}, Journal = {{Actualit{\'e}s} Scientifiques et Industrielles}, Title = {Sur un nouveau {th{\'e}ro{\`e}me-limite} de la {th{\'e}orie} des {probabilit{\'e}s}}, Volume = 736, Year = 1938, } @article{CST01, Author = {Pierluigi Crescenzi and Riccardo Silvestri and Luca Trevisan}, Bibdate = {2006-04-21}, Journal = {Inform. and Comput.}, Number = {1}, Pages = {10--26}, Title = {On Weighted vs. Unweighted Versions of Combinatorial Optimization Problems}, Volume = {167}, Year = {2001}, doi = {10.1006/inco.2000.3011} } @unpublished{Dav84, Author = {Alexander Davie}, Note = {Unpublished}, Title = {Lower bound for {$K_G$}}, Year = {1984},} @inproceedings{DMR06, Author = {Irit Dinur and Elchanan Mossel and Oded Regev}, Booktitle = {Proc. 38th {STOC}}, Pages = {344--353}, Title = {Conditional hardness for approximate coloring}, Year = {2006}, publisher = ACM, Doi = {10.1145/1132516.1132567}} @article{FL06, Author = {Uriel Feige and Michael Langberg}, Journal = {J.\ Algorithms}, Number = {1}, Pages = {1--23}, Title = {The {$\textrm{RPR}^2$} rounding technique for semidefinite programs}, Volume = {60}, Year = {2006}, Doi = {10.1016/j.jalgor.2004.11.003}} @article{GW95, Author = {Michel Goemans and David Williamson}, Journal = JACM, Pages = {1115--1145}, Title = {Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming}, Volume = {42}, Year = {1995}, Doi = {10.1145/227683.227684}} @article{Gre05, Author = {Ben Green}, Journal = {Geom. Funct. Anal.}, Number = 2, Pages = {340--376}, Publisher = {Springer}, Title = {A {Szemer{\'e}di-type} regularity lemma in Abelian groups, with applications}, Volume = 15, Year = 2005, Doi ={10.1007/s00039-005-0509-8}} @article{Gro53, Author = {Alexandre Grothendieck}, Journal = {Bol.\ Soc.\ Mat.\ Sao Paulo}, Pages = {1--79}, Title = {{R\'{e}sum\'{e}} de la {th\'{e}orie} {m\'{e}trique} des produits tensoriels topologiques}, Volume = 8, Year = 1953,} @article{Hag87, Author = {Uffe Haagerup}, Journal = ISRJ, Number = 2, Pages = {199--224}, Title = {A new upper bound for the complex {Grothendieck} constant}, Volume = 60, Year = 1987, Doi = {10.1007/BF02790792}} @article{Has01, Author = {Johan H{\aa}stad}, Journal = JACM, Number = {4}, Pages = {798--859}, Title = {Some optimal inapproximability results}, Volume = {48}, Year = {2001}, Doi = {10.1145/502090.502098}} @article{HV04, Author = {Johan H{\aa}stad and Srinivasan Venkatesh}, Journal = RSA, Number = {2}, Pages = {117--149}, Title = {On the advantage over a random assignment}, Volume = {25}, Year = {2004}, Doi = {10.1002/rsa.20031} } @inproceedings{Kar05, Author = {George Karakostas}, Booktitle = {Proc. 32nd Internat. Conf. on Automata, Languages, and Programming (ICALP)}, Pages = {1043--1050}, Title = {A Better Approximation Ratio for the {Vertex Cover} Problem}, Year = {2005}, series = {Lecture Notes in Computer Science}, volume = 3580, publisher = {Springer}, Doi = {10.1007/11523468\_84}} @inproceedings{Kho02, Author = {Subhash Khot}, Booktitle = {Proc. 34th {STOC}}, Pages = {767--775}, Title = {On the power of unique 2-prover 1-round games}, Year = 2002, publisher = acm, Doi = {10.1145/509907.510017}} @article{KKMO07, Author = {Subhash Khot and Guy Kindler and Elchanan Mossel and Ryan O'Donnell}, Bibdate = {2007-06-02}, Journal = SICOMP, Number = {1}, Pages = {319--357}, Title = {Optimal Inapproximability Results for {MAX}-{CUT} and Other 2-Variable {CSP}s?}, Volume = {37}, Year = {2007}, Doi = {10.1137/S0097539705447372}} @inproceedings{KO06, Author = {Subhash Khot and Ryan O'Donnell}, Booktitle = {Proc. 47th {FOCS}}, Pages = {217--226}, Title = {{SDP} gaps and {UGC}-hardness for {MaxCutGain}}, Year = {2006}, publisher = IEEE, Doi = {10.1109/FOCS.2006.67}} @inproceedings{KR03, Author = {Subhash Khot and Oded Regev}, Booktitle = {Proc. 18th Conf. on Computational Complexity (CCC)}, Pages = {379--386}, Title = {{Vertex Cover} might be hard to approximate to within {$2-\epsilon$}}, publisher = IEEE, Year = {2003},} @inproceedings{KV05, Author = {Subhash Khot and Nisheeth Vishnoi}, Booktitle = {Proc. 46th {FOCS}}, Pages = {53--62}, Title = {The {Unique Games Conjecture}, integrality gap for cut problems and embeddability of negative type metrics into {$\ell_1$}}, publisher = IEEE, Year = {2005}, doi = {10.1109/SFCS.2005.74}} @article{KN06, Author = {Subhash Khot and Assaf Naor}, Journal = {Math. Ann.}, Number = {4}, Pages = {821--852}, Title = {Nonembeddability theorems via {Fourier} analysis}, Volume = {334}, Year = {2006}, doi = {10.1007/s00208-005-0745-0}} @inproceedings{KR06, Author = {Robert Krauthgamer and Yuval Rabani}, Booktitle = {Proc. 17th Symp. on Discrete Algorithms (SODA)}, Pages = {1010--1017}, Title = {Improved lower bounds for embeddings into {$L_1$}}, publisher = ACM, Year = {2006}, Doi = {10.1145/1109557.1109669}} @article{Kri:77, Author = {Jean-Louis Krivine}, Journal = {Comptes Rendus Acad. Sci. Paris {S{\'e}r.} A-B}, Pages = {445--446}, Title = {Sur la constante de {Grothendieck}}, Volume = {284}, Year = {1977},} @book{LT91, Author = {Michel Ledoux and Michel Talagrand}, Publisher = {Springer}, Title = {Probability in Banach Spaces}, Year = {1991},} @inproceedings{Meg01, Author = {Alexandre Megretski}, Booktitle = {Systems, Approximation, Singular Integral Operators, and Related Topics: {International} Workshop on Operator Theory and Applications}, Publisher = {Birkhauser}, Title = {Relaxations of Quadratic Programs in Operator Theory and System Analysis}, Year = {2001},} @inproceedings{MOO05, Author = {Elchanan Mossel and Ryan O'Donnell and Krzysztof Oleszkiewicz}, Booktitle = {Proc. 46th {FOCS}}, Note = {To appear, \emph{Annals of Mathematics}}, Pages = {21--30}, Title = {Noise stability of functions with low influences: {Invariance} and optimality}, Year = 2005, publisher = IEEE, Doi = {10.1109/SFCS.2005.53}} @article{NRT99, Author = {Arkadi Nemirovski and Cornelis Roos and {Tam{\'a}s} Terlaky}, Journal = {Math. Program.}, Number = {3}, Pages = {463--473}, Title = {On Maximization of Quadratic form over Intersection of Ellipsoids with Common Center}, Volume = {86}, Year = {1999}, Doi = {10.1007/s101070050100}} @inbook{Nes00, Author = {Yurii Nesterov}, Booktitle = {Handbook of Semidefinite Programming}, Pages = {363--384}, Publisher = {Kluwer Academic Publishers}, Title = {Global quadratic optimization via conic relaxation}, Year = 2000,} @inproceedings{OW08, Author = {Ryan O'Donnell and Yi Wu}, Booktitle = {Proc. 40th {STOC}}, Pages = {335--344}, Title = {An optimal {SDP} algorithm for {Max-Cut}, and equally optimal {Long Code} tests}, Year = {2008}, publisher = ACM, Doi = {10.1145/1374376.1374425}} @inproceedings{Rag08, Author = {Prasad Raghavendra}, Booktitle = {Proc. 40th {STOC}}, Pages = {245--254}, Title = {Optimal algorithms and inapproximability results for every {CSP}?}, Year = {2008}, publisher = ACM, Doi = {10.1145/1374376.1374414}} @inproceedings{RS09, Author = {Prasad Raghavendra and David Steurer}, Booktitle = {Proc. 19th Symposium on Discrete Algorithms (SODA)}, Pages = {525--534}, publisher = ACM, Title = {Towards computing the {Grothendieck} Constant}, Year = 2009,} @unpublished{Ree91, Author = {James Reeds}, Note = {Manuscript (\url{http://www.dtc.umn.edu/~reedsj/bound2.dvi})}, Title = {A new lower bound on the real {Grothendieck} constant}, Year = {1991},} @article{TSSW00, Author = {Luca Trevisan and Gregory Sorkin and Madhu Sudan and David Williamson}, Journal = SICOMP, Number = {6}, Pages = {2074--2097}, Title = {Gadgets, Approximation, and Linear Programming}, Volume = {29}, Year = {2000}, Doi = {10.1137/S0097539797328847}} @inproceedings{Zwi99, Author = {Uri Zwick}, Booktitle = {Proc. 31st {STOC}}, Pages = {679--687}, Title = {Outward Rotations: {A} Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to {MAX} {CUT} and Other Problems}, Year = {1999}, publisher = ACM, Doi = {10.1145/301250.301431}}